/external/chromium_org/third_party/libjingle/source/talk/xmllite/ |
H A D | xmlnsstack_unittest.cc | 44 XmlnsStack stack; local 46 EXPECT_EQ(std::string(NS_XML), stack.NsForPrefix("xml").first); 47 EXPECT_EQ(std::string(NS_XMLNS), stack.NsForPrefix("xmlns").first); 48 EXPECT_EQ("", stack.NsForPrefix("").first); 50 EXPECT_EQ("xml", stack.PrefixForNs(NS_XML, false).first); 51 EXPECT_EQ("xmlns", stack.PrefixForNs(NS_XMLNS, false).first); 52 EXPECT_EQ("", stack.PrefixForNs("", false).first); 53 EXPECT_EQ("", stack.PrefixForNs("", true).first); 57 XmlnsStack stack; local 58 stack 72 XmlnsStack stack; local 107 XmlnsStack stack; local 183 XmlnsStack stack; local 231 XmlnsStack stack; local [all...] |
/external/chromium_org/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/chromium_org/third_party/tcmalloc/chromium/src/ |
H A D | stacktrace_generic-inl.h | 56 // void** result: the stack-trace, as an array 57 // int* sizes: the size of each stack frame, as an array 60 // int skip_count: how many stack pointers to skip before storing in result 64 void * stack[kStackLength]; variable 67 size = backtrace(stack, kStackLength); 75 result[i] = stack[i + skip_count]; 78 // No implementation for finding out the stack frame sizes yet.
|
H A D | heap-profile-stats.h | 9 // A bucket is data structure for heap profiling to store a pair of a stack 13 // A hash value is computed from a stack trace. Collision in the hash table 41 // Allocation and deallocation statistics per each stack trace. 43 // Longest stack trace we record. 46 uintptr_t hash; // Hash value of the stack trace. 47 int depth; // Depth of stack trace. 48 const void** stack; // Stack trace. member in struct:HeapProfileBucket
|
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
H A D | stacktrace_generic-inl.h | 56 // void** result: the stack-trace, as an array 57 // int* sizes: the size of each stack frame, as an array 60 // int skip_count: how many stack pointers to skip before storing in result 64 void * stack[kStackLength]; variable 67 size = backtrace(stack, kStackLength); 75 result[i] = stack[i + skip_count]; 78 // No implementation for finding out the stack frame sizes yet.
|
/external/chromium_org/chrome/browser/ui/panels/ |
H A D | stacked_panel_drag_handler.cc | 20 StackedPanelCollection* stack = panel->stack(); local 21 DCHECK(stack); 23 // If the panel is in its original stack, only top panel is allowed to drag. 24 if (in_orginal_collection && panel != stack->top_panel()) 27 // Find out if all panels in the stack are being dragged. 30 stack->panels().begin(); 31 iter != stack->panels().end(); ++iter) { 40 // If not all panels in the stack are being dragged, it means that these 41 // panels being dragged have just been added to this stack 54 StackedPanelCollection* stack = panel->stack(); local [all...] |
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | stack.h | 2 * stack.h 18 node_t **stack; member in struct:node_stack 22 void stack_delete(node_stack_t *stack); 23 void stack_push(node_stack_t *stack, node_t *node); 24 node_t *stack_pop(node_stack_t *stack); 25 int stack_is_empty(node_stack_t *stack); 26 void stack_reset(node_stack_t *stack);
|
H A D | stack.c | 2 * stack.c 10 #include "stack.h" 15 node_stack_t *stack; local 17 stack = PyMem_Malloc(sizeof(node_stack_t)); 18 stack->stack = PyMem_Malloc(sizeof(node_t *) * size); 19 stack->size = size; 20 stack->stackptr = 0; 21 return stack; 25 stack_delete(node_stack_t *stack) argument 32 stack_push(node_stack_t *stack, node_t *node) argument 43 stack_pop(node_stack_t *stack) argument 49 stack_is_empty(node_stack_t *stack) argument 55 stack_reset(node_stack_t *stack) argument [all...] |
/external/chromium_org/third_party/npapi/npspy/extern/nspr/ |
H A D | pratom.h | 95 ** LIFO linked-list (stack) 109 ** Create a stack, a LIFO linked list 111 ** stack_name: a pointer to string containing the name of the stack 113 ** A pointer to the created stack, if successful, else NULL. 120 ** Push an element on the top of the stack 122 ** stack: pointer to the stack 123 ** stack_elem: pointer to the stack element 127 NSPR_API(void) PR_StackPush(PRStack *stack, PRStackElem *stack_elem); 132 ** Remove the element on the top of the stack 140 NSPR_API(PRStackElem *) PR_StackPop(PRStack *stack); variable 154 NSPR_API(PRStatus) PR_DestroyStack(PRStack *stack); variable [all...] |
/external/clang/test/CodeGen/ |
H A D | 2002-12-15-StructParameters.c | 5 void *stack; member in struct:__anon16696
|
/external/nist-sip/java/gov/nist/javax/sip/stack/ |
H A D | SIPDialogEventListener.java | 16 package gov.nist.javax.sip.stack;
|
H A D | SIPTransactionEventListener.java | 26 package gov.nist.javax.sip.stack;
|
H A D | HandshakeCompletedListenerImpl.java | 19 package gov.nist.javax.sip.stack;
|
H A D | RawMessageChannel.java | 1 package gov.nist.javax.sip.stack;
|
H A D | SIPStackTimerTask.java | 9 package gov.nist.javax.sip.stack; 31 System.out.println("SIP stack timer task failed due to exception:");
|
H A D | ServerRequestInterface.java | 29 package gov.nist.javax.sip.stack; 35 * This is implemented by the application. The stack calls the message
|
H A D | ServerResponseInterface.java | 29 package gov.nist.javax.sip.stack; 39 * This is implemented by the application. The stack calls the message
|
/external/chromium_org/third_party/cld/base/ |
H A D | crash.h | 19 // We'll also store a bit of stack trace context at the time of crash as 21 void* stack[32]; member in struct:base::CrashReason
|
/external/chromium_org/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...] |
H A D | cf2stack.h | 5 /* Adobe's code for emulating a CFF stack (specification). */ 46 /* CFF operand stack; specified maximum of 48 or 192 values */ 75 cf2_stack_free( CF2_Stack stack ); variable 78 cf2_stack_count( CF2_Stack stack ); variable 81 cf2_stack_pushInt( CF2_Stack stack, 84 cf2_stack_pushFixed( CF2_Stack stack, 88 cf2_stack_popInt( CF2_Stack stack ); variable 90 cf2_stack_popFixed( CF2_Stack stack ); variable 93 cf2_stack_getReal( CF2_Stack stack, 97 cf2_stack_clear( CF2_Stack stack ); variable [all...] |
/external/compiler-rt/lib/asan/ |
H A D | asan_stack.cc | 12 // Code for ASan stack trace. 27 void PrintStack(StackTrace *stack) { argument 28 stack->PrintStack(stack->trace, stack->size, common_flags()->symbolize,
|
/external/compiler-rt/lib/tsan/tests/unit/ |
H A D | tsan_shadow_test.cc | 51 int stack; local 56 CHECK(IsAppMem((uptr)&stack)); 60 CHECK(IsShadowMem(MemToShadow((uptr)&stack)));
|
/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/kernel-headers/original/asm-arm/ |
H A D | smp.h | 65 * This also gives us the initial stack to use for this CPU. 85 void *stack; member in struct:secondary_data
|
/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...] |