| /sfw/usr/src/cmd/jruby/jruby-1.1.3/src/org/jruby/lexer/yacc/ |
| StackState.java | 36 private long stack = 0; field in class:StackState
43 stack = backup;
47 long old = stack;
48 stack <<= 1;
49 stack |= 1;
54 stack >>= 1;
58 stack <<= 1;
62 stack |= (stack & 1) << 1;
63 stack >>= 1
[all...] |
| /sfw/usr/src/cmd/php5/APC-3.0.19/ |
| apc_stack.c | 41 apc_stack_t* stack = (apc_stack_t*) apc_emalloc(sizeof(apc_stack_t)); local
43 stack->capacity = (size_hint > 0) ? size_hint : 10;
44 stack->size = 0;
45 stack->data = (void**) apc_emalloc(sizeof(void*) * stack->capacity);
47 return stack;
50 void apc_stack_destroy(apc_stack_t* stack)
52 if (stack != NULL) {
53 apc_efree(stack->data);
54 apc_efree(stack);
[all...] |
| apc_stack.h | 34 /* Basic stack datatype */
37 typedef struct apc_stack_t apc_stack_t; /* opaque stack type */
40 extern void apc_stack_destroy(T stack);
41 extern void apc_stack_clear(T stack);
42 extern void apc_stack_push(T stack, void* item);
43 extern void* apc_stack_pop(T stack);
44 extern void* apc_stack_top(T stack);
45 extern void* apc_stack_get(T stack, int n);
46 extern int apc_stack_size(T stack);
|
| /sfw/usr/src/cmd/php5/php-5.2.11/Zend/ |
| zend_ptr_stack.h | 35 ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack);
36 ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...);
37 ZEND_API void zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...);
38 ZEND_API void zend_ptr_stack_destroy(zend_ptr_stack *stack);
39 ZEND_API void zend_ptr_stack_apply(zend_ptr_stack *stack, void (*func)(void *));
40 ZEND_API void zend_ptr_stack_clean(zend_ptr_stack *stack, void (*func)(void *), zend_bool free_elements);
41 ZEND_API int zend_ptr_stack_num_elements(zend_ptr_stack *stack);
44 #define ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, count) \
45 if (stack->top+count > stack->max) {
[all...] |
| zend_ptr_stack.c | 28 ZEND_API void zend_ptr_stack_init(zend_ptr_stack *stack)
30 stack->top_element = stack->elements = (void **) emalloc(sizeof(void *)*PTR_STACK_BLOCK_SIZE);
31 stack->max = PTR_STACK_BLOCK_SIZE;
32 stack->top = 0;
36 ZEND_API void zend_ptr_stack_n_push(zend_ptr_stack *stack, int count, ...)
41 ZEND_PTR_STACK_RESIZE_IF_NEEDED(stack, count)
46 stack->top++;
47 *(stack->top_element++) = elem;
54 ZEND_API void zend_ptr_stack_n_pop(zend_ptr_stack *stack, int count, ...
[all...] |
| zend_stack.c | 25 ZEND_API int zend_stack_init(zend_stack *stack)
27 stack->top = 0;
28 stack->elements = (void **) emalloc(sizeof(void **) * STACK_BLOCK_SIZE);
29 if (!stack->elements) {
32 stack->max = STACK_BLOCK_SIZE;
37 ZEND_API int zend_stack_push(zend_stack *stack, void *element, int size)
39 if (stack->top >= stack->max) { /* we need to allocate more memory */
40 stack->elements = (void **) erealloc(stack->elements
[all...] |
| zend_stack.h | 34 ZEND_API int zend_stack_init(zend_stack *stack);
35 ZEND_API int zend_stack_push(zend_stack *stack, void *element, int size);
36 ZEND_API int zend_stack_top(zend_stack *stack, void **element);
37 ZEND_API int zend_stack_del_top(zend_stack *stack);
38 ZEND_API int zend_stack_int_top(zend_stack *stack);
39 ZEND_API int zend_stack_is_empty(zend_stack *stack);
40 ZEND_API int zend_stack_destroy(zend_stack *stack);
41 ZEND_API void **zend_stack_base(zend_stack *stack);
42 ZEND_API int zend_stack_count(zend_stack *stack);
43 ZEND_API void zend_stack_apply(zend_stack *stack, int type, int (*apply_function)(void *element))
[all...] |
| /sfw/usr/src/cmd/gcc/gcc-3.4.3/libstdc++-v3/include/backward/ |
| stack.h | 64 #include <stack>
66 using std::stack;
|
| /sfw/usr/src/cmd/ |
| mapfile_noexstk | 27 stack = STACK ?RW;
|
| /sfw/usr/src/cmd/cvs/cvs-1.12.13/src/ |
| stack.c | 10 * This module uses the hash.c module to implement a stack.
19 do_push (List *stack, void *elem, int isstring)
28 addnode(stack, p);
34 push (List *stack, void *elem)
36 do_push (stack, elem, 0);
42 push_string (List *stack, char *elem)
44 do_push (stack, elem, 1);
50 do_pop (List *stack, int isstring)
54 if (isempty (stack)) return NULL;
58 elem = stack->list->prev->key
[all...] |
| /sfw/usr/src/lib/xstream/xstream-1.3/xstream/src/test/com/thoughtworks/xstream/core/util/ |
| FastStackTest.java | 19 FastStack stack = new FastStack(2); local
21 stack.push("a");
22 stack.push("b");
23 stack.push("c");
24 stack.push("d");
26 assertEquals("d", stack.peek());
27 assertEquals("d", stack.peek());
28 assertEquals("d", stack.pop());
29 assertEquals("c", stack.pop());
30 stack.popSilently()
[all...] |
| /sfw/usr/src/lib/commons-collections/commons-collections-3.2.1-src/src/test/org/apache/commons/collections/ |
| TestArrayStack.java | 33 protected ArrayStack stack = null;
field in class:TestArrayStack
53 stack = (ArrayStack) makeEmptyList();
54 list = stack;
60 assertTrue("New stack is empty", stack.empty());
61 assertEquals("New stack has size zero", stack.size(), 0);
64 stack.peek();
71 stack.pop();
81 stack.push("First Item");
[all...] |
| /sfw/usr/src/lib/trove/trove-2.0.4/test/gnu/trove/ |
| TStackTest.java | 22 TIntStack stack = new TIntStack(); local
24 assertEquals(0, stack.size());
26 stack.push(10);
28 assertEquals(1, stack.size());
30 assertEquals(10, stack.peek());
31 assertEquals(1, stack.size());
32 assertEquals(10, stack.peek());
33 assertEquals(1, stack.size());
35 assertEquals(10, stack.pop());
36 assertEquals(0, stack.size())
49 TIntStack stack = new TIntStack(); local
[all...] |
| /sfw/usr/src/cmd/jruby/jruby-1.1.3/lib/ruby/gems/1.8/gems/rspec-1.1.4/examples/pure/ |
| shared_stack_examples.rb | 3 shared_examples_for "non-empty Stack" do
5 it { @stack.should_not be_empty }
8 @stack.peek.should == @last_item_added
12 @stack.peek.should == @last_item_added
13 @stack.peek.should == @last_item_added
17 @stack.pop.should == @last_item_added
21 @stack.pop.should == @last_item_added
22 unless @stack.empty?
23 @stack.pop.should_not == @last_item_added
29 shared_examples_for "non-full Stack" d
[all...] |
| /sfw/usr/src/cmd/ghostscript/ghostscript-8.64/base/ |
| gsclipsr.c | 29 * When we free a clip stack entry and the associated clip path.
34 gx_clip_stack_t *stack = (gx_clip_stack_t *)vstack; local
36 if (stack->rc.ref_count <= 1 ) {
37 gx_clip_path *pcpath = stack->clip_path;
39 gs_free_object(stack->rc.memory, stack, cname);
51 gx_clip_stack_t *stack = local
53 "gs_clipsave(stack)");
55 if (copy == 0 || stack == 0) {
56 gs_free_object(mem, stack, "gs_clipsave(stack)")
71 gx_clip_stack_t *stack = pgs->clip_stack; local
[all...] |
| /sfw/usr/src/cmd/swig/swig-1.3.35/Lib/ruby/ |
| std_stack.i | 9 struct traits_asptr<std::stack<T> > {
10 static int asptr(VALUE obj, std::stack<T> **vec) {
11 return traits_asptr_stdseq<std::stack<T> >::asptr(obj, vec);
16 struct traits_from<std::stack<T> > {
17 static VALUE from(const std::stack<T> & vec) {
18 return traits_from_stdseq<std::stack<T> >::from(vec);
25 %rename("delete") std::stack::__delete__;
26 %rename("reject!") std::stack::reject_bang;
27 %rename("map!") std::stack::map_bang;
28 %rename("empty?") std::stack::empty
[all...] |
| /sfw/usr/src/cmd/simplewbem/cimple-1.2.4/src/cimple/ |
| Thread_Context.cpp | 100 // Stack:
104 struct Stack
111 static Stack* _stack()
113 Stack* stack = (Stack*)_get_tsd(); local
115 if (stack == 0)
117 stack = new Stack;
118 stack->size = 0
142 Stack* stack = _stack(); local
149 Stack* stack = _stack(); local
162 Stack* stack = _stack(); local
[all...] |
| /sfw/usr/src/lib/tk/tk8.4.18/generic/ |
| tkUndo.c | 4 * This module provides the implementation of an undo stack.
20 * Push elem on the stack identified by stack.
29 void TkUndoPushStack ( stack, elem )
30 TkUndoAtom ** stack;
33 elem->next = *stack;
34 *stack = elem;
40 * Remove and return the top element from the stack identified by
41 * stack.
50 TkUndoAtom * TkUndoPopStack ( stack )
160 TkUndoRedoStack * stack; \/* An Undo\/Redo stack *\/ local
[all...] |
| /sfw/usr/src/cmd/gm4/m4-1.4.12/tests/ |
| test-c-stack.sh | 6 tmpfiles="t-c-stack.tmp"
7 ./test-c-stack${EXEEXT} 2> t-c-stack.tmp
9 77) cat t-c-stack.tmp >&2; (exit 77); exit 77 ;;
13 if grep 'stack overflow' t-c-stack.tmp >/dev/null ; then
|
| /sfw/usr/src/cmd/swig/swig-1.3.35/Source/Preprocessor/ |
| expr.c | 30 static exprval stack[256]; /* Parsing stack */ variable
31 static int sp = 0; /* Stack pointer */
66 /* Reduce a single operator on the stack */
69 long op_token = stack[sp - 1].value;
71 assert(stack[sp - 1].op == EXPR_OP);
73 if (stack[sp].op != EXPR_VALUE) {
78 if (stack[sp].svalue) {
85 /* top of stack: don't attempt to use sp-2! */
89 if (stack[sp].op != EXPR_VALUE)
[all...] |
| /sfw/usr/src/lib/unixodbc/unixODBC-2.2.14/Drivers/nn/ |
| herr.c | 30 err_t stack[ERRSTACK_DEPTH]; member in struct:__anon18531
34 void* nnodbc_pusherr(void* stack, int code, char* msg)
36 err_stack_t* err_stack = stack;
51 (err_stack->stack)[err_stack->top - 1].code = code;
52 (err_stack->stack)[err_stack->top - 1].msg = msg;
57 int nnodbc_errstkempty(void* stack)
59 err_stack_t* err_stack = stack;
68 void nnodbc_errstkunset(void* stack)
70 if( stack )
71 ((err_stack_t*)stack)->top = 0
[all...] |
| herr.h | 113 extern void* nnodbc_pusherr (void* stack, int code, char* msg);
114 extern void nnodbc_poperr (void* stack);
115 extern int nnodbc_errstkempty (void* stack);
116 extern int nnodbc_getsqlstatcode (void* stack);
117 extern char* nnodbc_getsqlstatstr (void* stack);
118 extern char* nnodbc_getsqlstatmsg (void* stack);
119 extern int nnodbc_getnativcode (void* stack);
120 extern char* nnodbc_getnativemsg (void* stack);
121 extern void* nnodbc_clearerr (void* stack);
123 # define PUSHSQLERR(stack, stat)
[all...] |
| /sfw/usr/src/cmd/elinks/elinks-0.11.6/src/dom/ |
| stack.h | 17 /* The depth of the state in the stack. This is amongst other things
21 /* Wether this stack state can be popped with pop_dom_*() family. */
26 /* The @object_size member tells whether the stack should allocate
55 /* The DOM stack is a convenient way to traverse DOM trees. Also it
57 * context since the stack is used to when the DOM tree is manipulated. */
59 /* The stack of nodes */
74 #define dom_stack_is_empty(stack) \
75 (!(stack)->states || (stack)->depth == 0)
78 get_dom_stack_state(struct dom_stack *stack, int top_offset
[all...] |
| /sfw/usr/src/lib/mvel/src/main/java/org/mvel/util/ |
| FastExecutionStack.java | 3 public class FastExecutionStack implements Stack {
4 private final Object[] stack = new Object[15]; field in class:FastExecutionStack
12 return stack[size];
16 stack[++size] = obj;
24 return stack[++size] = obj;
30 stack[++size] = obj1;
31 stack[++size] = obj2;
35 stack[++size] = obj1;
36 stack[++size] = obj2;
37 stack[++size] = obj3
[all...] |
| /sfw/usr/src/cmd/swig/swig-1.3.35/Lib/std/ |
| std_stack.i | 5 * @brief A wrapping of std::stack for Ruby.
12 // Stack
14 %define %std_stack_methods(stack...)
15 stack();
16 stack( const _Sequence& );
25 %define %std_stack_methods_val(stack...)
26 %std_stack_methods(stack)
30 // std::stack
35 // -- f(std::stack<T>), f(const std::stack<T>&)
[all...] |
