/external/selinux/libsepol/cil/src/ |
H A D | cil_stack.c | 40 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 D | cil_stack.h | 34 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/freetype/src/cff/ |
H A D | cf2stack.c | 5 /* 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/pdfium/third_party/freetype/src/cff/ |
H A D | cf2stack.c | 5 /* 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/v8/test/mjsunit/regress/ |
H A D | regress-1591.js | 28 var stack; variable 40 stack = err.stack; 46 assertTrue(stack.indexOf(expected_message) >= 0);
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
H A D | StackExtensions.cs | 45 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/v8/test/mjsunit/compiler/ |
H A D | regress-stacktrace.js | 28 // Test correctness of stack traces with global functions. 42 var stack = e.stack.toString(); 43 var p3 = stack.indexOf("at three"); 44 var p2 = stack.indexOf("at two"); 45 var p1 = stack.indexOf("at one"); 51 print(stack);
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.cons/ |
H A D | default_noexcept.pass.cpp | 10 // <stack> 12 // stack() 17 #include <stack> 26 typedef std::stack<MoveOnly> C;
|
H A D | dtor_noexcept.pass.cpp | 10 // <stack> 12 // ~stack() // implied noexcept; 14 #include <stack> 23 typedef std::stack<MoveOnly> C;
|
H A D | move_assign_noexcept.pass.cpp | 10 // <stack> 12 // stack& operator=(stack&& c) 17 #include <stack> 26 typedef std::stack<MoveOnly> C;
|
H A D | move_noexcept.pass.cpp | 10 // <stack> 12 // stack(stack&&) 17 #include <stack> 26 typedef std::stack<MoveOnly> C;
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.defn/ |
H A D | size.pass.cpp | 10 // <stack> 14 #include <stack> 19 std::stack<int> q;
|
H A D | swap.pass.cpp | 10 // <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/llvm/test/MC/COFF/ |
H A D | section-invalid-flags.s | 11 .section .stack, "w", @nobits
|
/external/chromium-trace/trace-viewer/tracing/third_party/vinn/third_party/parse5/test/fixtures/ |
H A D | open_element_stack_test.js | 15 stack = new OpenElementStack(document, treeAdapter); 17 assert.strictEqual(stack.current, document); 18 assert.strictEqual(stack.stackTop, -1); 20 stack.push(element1); 21 assert.strictEqual(stack.current, element1); 22 assert.strictEqual(stack.currentTagName, treeAdapter.getTagName(element1)); 23 assert.strictEqual(stack.stackTop, 0); 25 stack.push(element2); 26 assert.strictEqual(stack.current, element2); 27 assert.strictEqual(stack [all...] |
/external/speex/libspeex/ |
H A D | stack_alloc.h | 4 @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/v8/test/mjsunit/ |
H A D | stack-traces-overflow.js | 28 // Flags: --stack-size=100 34 // Test stack trace getter and setter. 38 assertTrue(e.stack.indexOf("rec1") > 0); 39 e.stack = "123"; 40 assertEquals("123", e.stack); 47 assertTrue(e.stack.indexOf("rec2") > 0); 48 assertTrue(e.stack.indexOf("rec3") > 0); 49 e.stack = "123"; 50 assertEquals("123", e.stack); 57 assertTrue(e.stack [all...] |
/external/proguard/src/proguard/evaluation/ |
H A D | Processor.java | 31 * 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/std/containers/container.adaptors/stack/ |
H A D | version.pass.cpp | 10 // <stack> 12 #include <stack>
|
/external/libunwind/src/ia64/ |
H A D | Linstall_cursor.S | 4 /* We do not need executable stack. */ 5 .section .note.GNU-stack,"",@progbits
|
/external/libcxx/test/std/containers/container.adaptors/stack/stack.ops/ |
H A D | eq.pass.cpp | 10 // <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 D | lt.pass.cpp | 10 // <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 D | swap.pass.cpp | 10 // <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/v8/test/webkit/ |
H A D | stack-unwinding.js | 26 "This test checks that JavaScriptCore does not crash when uwinding the stack that includes a host function." 31 var stack = []; 32 stack.push({ "args": twoHostFunctions.arguments }); 33 stack.push({ "args": twoHostFunctions.arguments }); 51 var stack = []; 52 stack.push({ "args": hostAndException.arguments });
|
/external/easymock/src/org/easymock/internal/ |
H A D | LastControl.java | 48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
49 if (stack == null) {
50 stack = new Stack<IArgumentMatcher>();
51 threadToArgumentMatcherStack.set(stack);
53 stack.push(matcher);
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
58 if (stack == null) {
62 return new ArrayList<IArgumentMatcher>(stack);
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get();
67 assertState(stack ! [all...] |