/external/chromium_org/v8/src/compiler/ |
H A D | scheduler.cc | 772 static int Push(SpecialRPOStackFrame* stack, int depth, BasicBlock* child, argument 775 stack[depth].block = child; 776 stack[depth].index = 0; 940 // Perform an iterative RPO traversal using an explicit stack, 943 SpecialRPOStackFrame* stack = local 947 int stack_depth = Push(stack, 0, entry, kBlockUnvisited1); 952 SpecialRPOStackFrame* frame = stack + current; 959 // The successor is on the stack, so this is a backedge (cycle). 967 // Push the successor onto the stack. 969 stack_depth = Push(stack, stack_dept [all...] |
/external/chromium_org/v8/test/cctest/compiler/ |
H A D | test-js-typed-lowering.cc | 65 Node* stack = graph.NewNode(common.StateValues(0)); local 69 parameters, locals, stack, context, UndefinedConstant());
|
/external/compiler-rt/lib/asan/ |
H A D | asan_allocator2.cc | 171 // If we don't use stack depot, we store the alloc/free stack traces 202 static void GetStackTraceFromId(u32 id, StackTrace *stack) { argument 207 stack->CopyFrom(trace, size); 210 void AsanChunkView::GetAllocStack(StackTrace *stack) { argument 211 GetStackTraceFromId(chunk_->alloc_context_id, stack); 214 void AsanChunkView::GetFreeStack(StackTrace *stack) { argument 215 GetStackTraceFromId(chunk_->free_context_id, stack); 283 static void *Allocate(uptr size, uptr alignment, StackTrace *stack, argument 288 CHECK(stack); 411 ReportInvalidFree(void *ptr, u8 chunk_state, StackTrace *stack) argument 418 AtomicallySetQuarantineFlag(AsanChunk *m, void *ptr, StackTrace *stack) argument 430 QuarantineChunk(AsanChunk *m, void *ptr, StackTrace *stack, AllocType alloc_type) argument 467 Deallocate(void *ptr, StackTrace *stack, AllocType alloc_type) argument 479 Reallocate(void *old_ptr, uptr new_size, StackTrace *stack) argument 592 asan_memalign(uptr alignment, uptr size, StackTrace *stack, AllocType alloc_type) argument 597 asan_free(void *ptr, StackTrace *stack, AllocType alloc_type) argument 601 asan_malloc(uptr size, StackTrace *stack) argument 605 asan_calloc(uptr nmemb, uptr size, StackTrace *stack) argument 616 asan_realloc(void *p, uptr size, StackTrace *stack) argument 626 asan_valloc(uptr size, StackTrace *stack) argument 630 asan_pvalloc(uptr size, StackTrace *stack) argument 640 asan_posix_memalign(void **memptr, uptr alignment, uptr size, StackTrace *stack) argument [all...] |
H A D | asan_interceptors.cc | 39 // that no extra frames are created, and stack trace contains 48 ReportStringFunctionSizeOverflow(__offset, __size, &stack); \ 73 offset2, length2, &stack); \ 187 CreateThreadContextArgs args = { t, &stack }; 236 static void ClearShadowMemoryForContextStack(uptr stack, uptr ssize) { argument 239 uptr bottom = stack & ~(PageSize - 1); 240 ssize += stack - bottom; 256 // Clear shadow memory for new context (it may share stack 258 uptr stack, ssize; local 259 ReadContextStack(ucp, &stack, [all...] |
H A D | asan_report.cc | 374 Printf("Address %p is located in stack of thread T%d%s " 380 // We print this frame as a stack trace with one element. 382 // The frame numbers may be different than those in the stack trace printed 385 // (e.g. use-after-scope, or different thread's stack). 391 // Report the number of stack objects. 406 Printf("AddressSanitizer can't parse the stack frame " 428 "some custom stack unwind mechanism or swapcontext\n" 604 "ERROR: AddressSanitizer: stack-overflow on address %p" 610 stack.Print(); 611 ReportErrorSummary("stack 688 ReportMallocUsableSizeNotOwned(uptr addr, StackTrace *stack) argument 701 ReportSanitizerGetAllocatedSizeNotOwned(uptr addr, StackTrace *stack) argument 714 ReportStringFunctionMemoryRangesOverlap( const char *function, const char *offset1, uptr length1, const char *offset2, uptr length2, StackTrace *stack) argument 732 ReportStringFunctionSizeOverflow(uptr offset, uptr size, StackTrace *stack) argument 745 ReportBadParamsToAnnotateContiguousContainer(uptr beg, uptr end, uptr old_mid, uptr new_mid, StackTrace *stack) argument 817 WarnMacFreeUnallocated( uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack) argument 828 ReportMacMzReallocUnknown( uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack) argument 839 ReportMacCfReallocUnknown( uptr addr, uptr zone_ptr, const char *zone_name, StackTrace *stack) argument [all...] |
/external/compiler-rt/lib/msan/ |
H A D | msan.cc | 103 // Array of stack origins. 138 "Origin per-stack limit invalid: %d. Must be 0 (unlimited) or in [1, " 190 void GetStackTrace(StackTrace *stack, uptr max_s, uptr pc, uptr bp, argument 196 return stack->Unwind(max_s, pc, bp, 0, 0, 0, request_fast_unwind); 198 stack->Unwind(max_s, pc, bp, 0, t->stack_top(), t->stack_bottom(), 220 ReportUMR(&stack, report_origin); 236 // Instances of this class may live on the signal handler stack, and data size 267 u32 ChainOrigin(u32 id, StackTrace *stack) { argument 283 StackDepotHandle h = StackDepotPut_WithHandle(stack->trace, stack [all...] |
/external/compiler-rt/lib/tsan/rtl/ |
H A D | tsan_rtl_report.cc | 59 static void StackStripMain(ReportStack *stack) { argument 67 for (ReportStack *ent = stack; ent; ent = ent->next) { 94 // Ensure that we recovered stack completely. Trimmed stack 98 DPrintf("Bottom stack frame of stack %zx is missed\n", stack->pc); 111 const uptr *stack = StackDepotGet(stack_id, &ssz); local 112 if (stack == 0) 115 trace.Init(stack, ss 165 AddStack(const StackTrace *stack, bool suppressable) argument 171 AddMemoryAccess(uptr addr, Shadow s, const StackTrace *stack, const MutexSet *mset) argument [all...] |
/external/freetype/src/truetype/ |
H A D | ttinterp.h | 167 FT_Long top; /* top of exec. stack */ 169 FT_UInt stackSize; /* size of exec. stack */ 170 FT_Long* stack; /* current exec. stack */ member in struct:TT_ExecContextRec_ 213 FT_Int callTop, /* top of call stack during execution */ 214 callSize; /* size of call stack */ 215 TT_CallStack callStack; /* call stack */
|
/external/javassist/src/main/javassist/bytecode/ |
H A D | CodeIterator.java | 999 StackMapTable stack; field in class:CodeIterator.Pointers 1010 stack = (StackMapTable)ca.getAttribute(StackMapTable.tag); 1034 if (stack != null) 1035 stack.shiftPc(where, gapLength, exclusive);
|
/external/jsilver/src/com/google/clearsilver/jsilver/syntax/parser/ |
H A D | Parser.java | 22 private final ListIterator stack = new LinkedList().listIterator(); field in class:Parser 44 if(!this.stack.hasNext()) 46 this.stack.add(new State(numstate, this.nodeList)); 50 State s = (State) this.stack.next(); 86 State s = (State) this.stack.previous(); 87 this.stack.next(); 93 return ((State) this.stack.previous()).nodes;
|
/external/libxml2/ |
H A D | xpointer.c | 917 * Move the current node of the nodeset on the stack to the 1182 * a sub-resource error, clean-up the stack 1255 /* Allocate the value stack */ 1370 int stack = 0; local 1403 stack++; 1405 stack++; 1410 if (stack != 0) { 1412 "xmlXPtrEval: object(s) left on the eval stack\n", 1557 TODO /* handle crossing entities -> stack needed */ 2302 * TODO: add a stack fo [all...] |
/external/mesa3d/src/glx/ |
H A D | glxclient.h | 209 __GLXattribute *stack[__GL_CLIENT_ATTRIB_STACK_DEPTH]; member in struct:__GLXattributeMachineRec
|
H A D | indirect_vertex_array.c | 118 if (arrays->stack) { 119 free(arrays->stack); 120 arrays->stack = NULL; 293 arrays->stack = malloc(sizeof(struct array_stack_state) 1910 struct array_stack_state *stack = local 1911 &arrays->stack[(arrays->stack_index * arrays->num_arrays)]; 1916 stack[i].data = arrays->arrays[i].data; 1917 stack[i].data_type = arrays->arrays[i].data_type; 1918 stack[i].user_stride = arrays->arrays[i].user_stride; 1919 stack[ 1936 struct array_stack_state *stack; local [all...] |
/external/mesa3d/src/mesa/drivers/dri/i965/ |
H A D | brw_wm.h | 269 struct brw_reg stack; member in struct:brw_wm_compile
|
/external/mockito/cglib-and-asm/src/org/mockito/asm/ |
H A D | MethodWriter.java | 48 * Frame has exactly the same locals as the previous stack map frame and
49 * number of stack items is zero.
54 * Frame has exactly the same locals as the previous stack map frame and
55 * number of stack items is 1
65 * Frame has exactly the same locals as the previous stack map frame and
66 * number of stack items is 1. Offset is bigger then 63;
78 * Frame has exactly the same locals as the previous stack map frame and
79 * number of stack items is zero. Offset is bigger then 63;
96 * Indicates that the stack map frames must be recomputed from scratch. In
97 * this case the maximum stack siz 540 visitFrame( final int type, final int nLocal, final Object[] local, final int nStack, final Object[] stack) argument [all...] |
/external/nist-sip/java/gov/nist/javax/sip/stack/ |
H A D | SIPTransaction.java | 26 package gov.nist.javax.sip.stack; 183 // Parent stack for this transaction 305 // Close the encapsulated socket if stack is configured 324 * Parent stack for this transaction. 362 // Always add the parent stack as a listener 1069 * Set the application data pointer. This is un-interpreted by the stack.
|
/external/openfst/src/include/fst/extensions/pdt/ |
H A D | expand.h | 42 PdtStack<typename Arc::StateId, typename Arc::Label> *stack; member in struct:fst::ExpandFstOptions 50 : CacheOptions(opts), keep_parentheses(kp), stack(s), state_table(st) {} 90 stack_(opts.stack ? opts.stack: new PdtStack<StateId, Label>(parens)), 93 own_stack_(opts.stack == 0), own_state_table_(opts.state_table == 0), 326 // shortest-stack first queue discipline and relies on the 388 // 1. states corresponding to shortest stack first, 390 // 3. among states with the same stack, shortest-first order is used. 406 // If stack id equal, use A* 470 vector<StackId> stack_length_; // Length of stack fo [all...] |
/external/pdfium/core/src/fpdfapi/fpdf_edit/ |
H A D | fpdf_edit_doc.cpp | 1145 CFX_PtrArray stack;
local 1146 stack.Add(pPages);
1147 if (InsertDeletePDFPage(pDoc, pPages, iPage, pPageDict, TRUE, stack) < 0) {
1188 CFX_PtrArray stack;
local 1189 stack.Add(pPages);
1190 if (InsertDeletePDFPage(this, pPages, iPage, NULL, FALSE, stack) < 0) {
|
/external/pdfium/core/src/fxge/fx_freetype/fxft2.5.01/src/truetype/ |
H A D | ttinterp.h | 167 FT_Long top; /* top of exec. stack */ 169 FT_UInt stackSize; /* size of exec. stack */ 170 FT_Long* stack; /* current exec. stack */ member in struct:TT_ExecContextRec_ 213 FT_Int callTop, /* top of call stack during execution */ 214 callSize; /* size of call stack */ 215 TT_CallStack callStack; /* call stack */
|
/external/protobuf/gtest/src/ |
H A D | gtest-death-test.cc | 202 // death test child process, which operates on a very small stack. Use 882 // Two utility routines that together determine the direction the stack 911 void* const stack = mmap(NULL, stack_size, PROT_READ | PROT_WRITE, local 913 GTEST_DEATH_TEST_CHECK_(stack != MAP_FAILED); 915 static_cast<char*>(stack) + (stack_grows_down ? stack_size : 0); 919 GTEST_DEATH_TEST_CHECK_(munmap(stack, stack_size) != -1);
|
/external/srec/srec/crec/ |
H A D | astar.c | 52 int astar_draw_tree_as_dotty(const char* file, srec* rec, AstarStack* stack); 238 void list_free_parps(AstarStack* stack, char* msg); 240 #define list_free_parps(stack,msg) 248 partial_path* make_new_partial_path(AstarStack* stack); 249 /*void free_partial_path(AstarStack* stack, partial_path* parp); put the proto in astar.h */ 289 partial_path* extend_path(AstarStack* stack, argument 383 extended_parp = make_new_partial_path(stack); 421 void check_stack_root_sanity(AstarStack* stack) argument 423 partial_path* parp1 = stack->root_path; 424 /* append_arc_arriving(stack 433 make_new_partial_path(AstarStack* stack) argument 464 free_partial_path(AstarStack* stack, partial_path* parp) argument 485 make_partial_path(AstarStack* stack, wtokenID token_index, srec* rec, int* pwhether_complete) argument 524 AstarStack *stack; local 556 AstarStack *stack = rec->astar_stack; local 569 astar_stack_prepare(AstarStack* stack, int request_nbest_len, srec* rec) argument 626 astar_stack_clear(AstarStack* stack) argument 657 AstarStack *stack = rec->astar_stack; local 1037 astar_draw_tree_as_dotty(const char* file, srec* rec, AstarStack* stack) argument 1073 astar_stack_prepare_from_active_search(AstarStack* stack, int nbestlen, srec* rec) argument 1142 maybe_add_to_active_paths(AstarStack* stack, word_token* word_token_array, bigcostdata parp_costsofar, wtokenID wtoken_index) argument 1243 astar_stack_flag_word_tokens_used(AstarStack* stack, srec* rec) argument 1319 list_free_parps(AstarStack* stack, char* msg) argument [all...] |
/external/valgrind/main/coregrind/m_scheduler/ |
H A D | scheduler.c | 520 until the caller is finally done with the thread stack. */ 632 - stack overflow message in default_action() in m_signals.c 642 ThreadId computed by first phase of initialisation, fill in stack 1176 call stack (e.g. in VG_(main_thread_wrapper_NORETURN)) but 2165 /* Look for stack overruns. Visit all threads. */ 2168 VgStack* stack; local 2174 stack 2180 = VG_(am_get_VgStack_unused_szB)(stack, limit); 2184 "of running out of stack!\n",
|
/external/valgrind/main/coregrind/m_syswrap/ |
H A D | syswrap-linux.c | 86 VG_(printf)("thread tid %d started: stack = %p\n", 143 * the simulated stack (used by the synthetic cpu. Guest process 144 is using this stack). 145 * the valgrind stack (used by the real cpu. Valgrind code is running 146 on this stack). 147 When Valgrind runs as an inner, it must signals that its (real) stack 148 is the stack to use by the outer to e.g. do stacktraces. 220 reusing the stack while we're doing these last cleanups. 222 reallocation. We need to make sure we don't touch the stack 320 /* Allocate a stack fo 326 VgStack* stack; local [all...] |
/external/chromium_org/chrome/browser/sync/ |
H A D | profile_sync_service_bookmark_unittest.cc | 11 #include <stack> 709 std::stack<int64> stack; local 710 stack.push(bookmark_bar_id()); 711 while (!stack.empty()) { 712 int64 id = stack.top(); 713 stack.pop(); 720 stack.push(gnode.GetSuccessorId()); 722 stack.push(gnode.GetFirstChildId());
|
/external/chromium_org/chrome/browser/sync_file_system/drive_backend/ |
H A D | metadata_database.cc | 8 #include <stack> 308 std::vector<int64> stack; local 309 stack.push_back(root_tracker_id); 310 while (!stack.empty()) { 311 int64 tracker_id = stack.back(); 312 stack.pop_back(); 313 AppendContents(index->GetFileTrackerIDsByParent(tracker_id), &stack); 1579 std::vector<int64> stack; 1581 index_->GetFileTrackerIDsByParent(app_root_tracker.tracker_id()), &stack); 1582 while (!stack [all...] |