Searched refs:stack (Results 1 - 25 of 1370) sorted by relevance

1234567891011>>

/external/selinux/libsepol/cil/src/
H A Dcil_stack.c40 void cil_stack_init(struct cil_stack **stack) argument
43 new_stack->stack = cil_malloc(sizeof(*(new_stack->stack)) * CIL_STACK_INIT_SIZE);
46 *stack = new_stack;
49 void cil_stack_destroy(struct cil_stack **stack) argument
51 if (stack == NULL || *stack == NULL) {
55 free((*stack)->stack);
56 free(*stack);
60 cil_stack_empty(struct cil_stack *stack) argument
65 cil_stack_is_empty(struct cil_stack *stack) argument
70 cil_stack_push(struct cil_stack *stack, enum cil_flavor flavor, void *data) argument
83 cil_stack_pop(struct cil_stack *stack) argument
93 cil_stack_peek(struct cil_stack *stack) argument
102 cil_stack_peek_at(struct cil_stack *stack, int pos) argument
[all...]
H A Dcil_stack.h34 struct cil_stack_item *stack; member in struct:cil_stack
44 #define cil_stack_for_each_starting_at(stack, start, pos, item) \
45 for (pos = start, item = cil_stack_peek_at(stack, pos); item != NULL; pos++, item = cil_stack_peek_at(stack, pos))
47 #define cil_stack_for_each(stack, pos, item) cil_stack_for_each_starting_at(stack, 0, pos, item)
50 void cil_stack_init(struct cil_stack **stack);
51 void cil_stack_destroy(struct cil_stack **stack);
53 void cil_stack_empty(struct cil_stack *stack);
54 int cil_stack_is_empty(struct cil_stack *stack);
[all...]
/external/pdfium/third_party/freetype/src/cff/
H A Dcf2stack.c5 /* Adobe's code for emulating a CFF stack (body). */
58 CF2_Stack stack = NULL; local
61 if ( !FT_QNEW( stack ) )
64 stack->memory = memory;
65 stack->error = e;
66 stack->top = &stack->buffer[0]; /* empty stack */
69 return stack;
74 cf2_stack_free( CF2_Stack stack )
95 cf2_stack_pushInt( CF2_Stack stack, CF2_Int val ) argument
111 cf2_stack_pushFixed( CF2_Stack stack, CF2_Fixed val ) argument
[all...]
/external/libnetfilter_conntrack/include/internal/
H A Dstack.h4 struct stack;
6 struct stack *stack_create(size_t elem_size, int max_elems);
7 void stack_destroy(struct stack *s);
8 int stack_push(struct stack *s, void *data);
9 int stack_pop(struct stack *s, void *data);
/external/webrtc/webrtc/libjingle/xmllite/
H A Dxmlnsstack_unittest.cc27 XmlnsStack stack; local
29 EXPECT_EQ(std::string(NS_XML), stack.NsForPrefix("xml").first);
30 EXPECT_EQ(std::string(NS_XMLNS), stack.NsForPrefix("xmlns").first);
31 EXPECT_EQ("", stack.NsForPrefix("").first);
33 EXPECT_EQ("xml", stack.PrefixForNs(NS_XML, false).first);
34 EXPECT_EQ("xmlns", stack.PrefixForNs(NS_XMLNS, false).first);
35 EXPECT_EQ("", stack.PrefixForNs("", false).first);
36 EXPECT_EQ("", stack.PrefixForNs("", true).first);
40 XmlnsStack stack; local
41 stack
55 XmlnsStack stack; local
90 XmlnsStack stack; local
166 XmlnsStack stack; local
214 XmlnsStack stack; local
[all...]
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/util/
H A DArrayStackTest.java23 ArrayStack<Integer> stack = new ArrayStack<Integer>(25);
24 assertTrue(stack.isEmpty());
25 stack.push(new Integer(1));
26 stack.push(new Integer(2));
27 assertFalse(stack.isEmpty());
28 stack.clear();
29 assertTrue(stack.isEmpty());
/external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/
H A Dtypes.fail.cpp27 #include <stack>
34 std::stack<double, std::deque<int>> t;
H A Dsize.pass.cpp10 // <stack>
14 #include <stack>
19 std::stack<int> q;
H A Dswap.pass.cpp10 // <stack>
12 // void swap(stack& q);
14 #include <stack>
29 std::stack<int> q1 = make<std::stack<int> >(5);
30 std::stack<int> q2 = make<std::stack<int> >(10);
31 std::stack<int> q1_save = q1;
32 std::stack<int> q2_save = q2;
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
H A DStackExtensions.cs45 public static T elementAt<T>( this Stack<T> stack, int index ) argument
47 return stack.ElementAt( index );
51 public static T peek<T>( this Stack<T> stack )
53 return stack.Peek();
57 public static T pop<T>( this Stack<T> stack )
59 return stack.Pop();
63 public static void push<T>( this Stack<T> stack, T obj ) argument
65 stack.Push( obj );
69 public static int size<T>( this Stack<T> stack )
71 return stack
75 setSize( this Stack<T> stack, int size ) argument
[all...]
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/util/
H A DArrayStack.java21 private ArrayList<T> stack; field in class:ArrayStack
24 stack = new ArrayList<T>(initSize);
28 stack.add(obj);
32 return stack.remove(stack.size() - 1);
36 return stack.isEmpty();
40 stack.clear();
/external/freetype/src/cff/
H A Dcf2stack.c5 /* Adobe's code for emulating a CFF stack (body). */
59 CF2_Stack stack = NULL; local
62 if ( !FT_NEW( stack ) )
65 stack->memory = memory;
66 stack->error = e;
69 /* allocate the stack buffer */
70 if ( FT_NEW_ARRAY( stack->buffer, stackSize ) )
72 FT_FREE( stack );
76 stack->stackSize = stackSize;
77 stack
107 cf2_stack_pushInt( CF2_Stack stack, CF2_Int val ) argument
123 cf2_stack_pushFixed( CF2_Stack stack, CF2_Fixed val ) argument
212 cf2_stack_setReal( CF2_Stack stack, CF2_UInt idx, CF2_Fixed val ) argument
229 cf2_stack_pop( CF2_Stack stack, CF2_UInt num ) argument
242 cf2_stack_roll( CF2_Stack stack, CF2_Int count, CF2_Int shift ) argument
[all...]
/external/libcxx/test/std/containers/container.adaptors/stack/stack.cons/
H A Ddefault_noexcept.pass.cpp10 // <stack>
12 // stack()
19 #include <stack>
29 typedef std::stack<MoveOnly> C;
H A Ddtor_noexcept.pass.cpp10 // <stack>
12 // ~stack() // implied noexcept;
16 #include <stack>
24 typedef std::stack<MoveOnly> C;
H A Dmove_assign_noexcept.pass.cpp10 // <stack>
12 // stack& operator=(stack&& c)
19 #include <stack>
27 typedef std::stack<MoveOnly> C;
H A Dmove_noexcept.pass.cpp10 // <stack>
12 // stack(stack&&)
19 #include <stack>
29 typedef std::stack<MoveOnly> C;
/external/llvm/test/MC/COFF/
H A Dsection-invalid-flags.s11 .section .stack, "w", @nobits
/external/speex/libspeex/
H A Dstack_alloc.h4 @brief Temporary memory allocation on stack
51 * @def ALIGN(stack, size)
53 * Aligns the stack to a 'size' boundary
55 * @param stack Stack
60 * @def PUSH(stack, size, type)
62 * Allocates 'size' elements of type 'type' on the stack
64 * @param stack Stack
72 * Declare variable on stack
80 * Allocate 'size' elements of 'type' on stack
91 #define ALIGN(stack, siz
[all...]
/external/proguard/src/proguard/evaluation/
H A DProcessor.java31 * local variable frame and stack.
39 private final Stack stack; field in class:Processor
52 * @param stack the local stack.
59 Stack stack,
66 this.stack = stack;
87 stack.push(valueFactory.createReferenceValueNull());
99 stack.push(valueFactory.createIntegerValue(simpleInstruction.constant));
104 stack
58 Processor(Variables variables, Stack stack, ValueFactory valueFactory, BranchUnit branchUnit, InvocationUnit invocationUnit, boolean alwaysCast) argument
[all...]
/external/libcxx/test/libcxx/containers/container.adaptors/stack/
H A Dversion.pass.cpp10 // <stack>
12 #include <stack>
/external/libunwind/src/ia64/
H A DLinstall_cursor.S4 /* We do not need executable stack. */
5 .section .note.GNU-stack,"",@progbits
/external/libcxx/test/std/containers/container.adaptors/stack/stack.ops/
H A Deq.pass.cpp10 // <stack>
13 // bool operator==(const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator!=(const stack<T, Container>& x,const stack<T, Container>& y);
18 #include <stack>
33 std::stack<int> q1 = make<std::stack<int> >(5);
34 std::stack<int> q2 = make<std::stack<in
[all...]
H A Dlt.pass.cpp10 // <stack>
13 // bool operator< (const stack<T, Container>& x,const stack<T, Container>& y);
16 // bool operator> (const stack<T, Container>& x,const stack<T, Container>& y);
19 // bool operator>=(const stack<T, Container>& x,const stack<T, Container>& y);
22 // bool operator<=(const stack<T, Container>& x,const stack<T, Container>& y);
24 #include <stack>
[all...]
/external/libcxx/test/std/containers/container.adaptors/stack/stack.special/
H A Dswap.pass.cpp10 // <stack>
13 // void swap(stack<T, Container>& x, stack<T, Container>& y);
15 #include <stack>
30 std::stack<int> q1 = make<std::stack<int> >(5);
31 std::stack<int> q2 = make<std::stack<int> >(10);
32 std::stack<int> q1_save = q1;
33 std::stack<in
[all...]
/external/testng/src/main/java/org/testng/reporters/util/
H A DStackTraceTools.java6 * Functionality to allow tools to analyse and subdivide stack traces.
15 /** Finds topmost position of the test method in the stack, or top of stack if <code>method</code> is not in it. */
16 public static int getTestRoot(StackTraceElement[] stack,ITestNGMethod method) { argument
17 if(stack!=null) {
19 for(int x=stack.length-1; x>=0; x--) {
20 if(cname.equals(stack[x].getClassName())
21 && method.getMethodName().equals(stack[x].getMethodName())) {
25 return stack.length-1;
31 /** Finds topmost position of the test method in the stack, o
32 getTestNGInstrastructure(StackTraceElement[] stack,ITestNGMethod method) argument
[all...]

Completed in 605 milliseconds

1234567891011>>