/external/compiler-rt/lib/sanitizer_common/ |
sanitizer_stackdepot.cc | 27 uptr stack[1]; // [size] member in struct:__sanitizer::StackDepotNode 31 // We use these bits to store the per-stack use counter. 45 if (stack[i] != args.trace[i]) return false; 78 internal_memcpy(stack, args.trace, size * sizeof(uptr)); 81 return args_type(&stack[0], size, tag); 111 u32 StackDepotPut(StackTrace stack) { 112 StackDepotHandle h = theDepot.Put(stack); 116 StackDepotHandle StackDepotPut_WithHandle(StackTrace stack) { 117 return theDepot.Put(stack);
|
/external/compiler-rt/lib/tsan/rtl/ |
tsan_report.h | 60 ReportStack *stack; member in struct:__tsan::ReportMop 81 ReportStack *stack; member in struct:__tsan::ReportLocation 94 ReportStack *stack; member in struct:__tsan::ReportThread 101 ReportStack *stack; member in struct:__tsan::ReportMutex 126 void PrintStack(const ReportStack *stack);
|
/external/deqp-deps/SPIRV-Tools/source/opt/ |
dead_branch_elim_pass.cpp | 99 std::vector<BasicBlock*> stack; local 100 stack.push_back(&*func->begin()); 102 while (!stack.empty()) { 103 BasicBlock* block = stack.back(); 104 stack.pop_back(); 178 stack.push_back(GetParentBlock(live_lab_id)); 182 const_block->ForEachSuccessorLabel([&stack, this](const uint32_t label) { 183 stack.push_back(GetParentBlock(label));
|
upgrade_memory_model.cpp | 312 std::vector<const Instruction*> stack; local 313 stack.push_back(inst); 317 while (!stack.empty()) { 318 const Instruction* def = stack.back(); 319 stack.pop_back(); 335 stack.push_back(context()->get_def_use_mgr()->GetDef( 339 stack.push_back(context()->get_def_use_mgr()->GetDef( 342 stack.push_back(context()->get_def_use_mgr()->GetDef(
|
/external/deqp-deps/glslang/glslang/Include/ |
PoolAlloc.h | 239 tAllocStack stack; // stack of where to allocate from, to partition pool member in class:glslang::TPoolAllocator
|
/external/dexmaker/dexmaker-mockito-inline/src/main/java/com/android/dx/mockito/inline/ |
MockMethodAdvice.java | 56 * Remove calls to a class from a throwable's stack. 59 * @param current stack frame number to start cleaning from (upwards) 60 * @param targetType class to remove from the stack 62 * @return throwable with the cleaned stack 67 StackTraceElement[] stack = throwable.getStackTrace(); local 72 next = stack[stack.length - current - ++skip]; 75 int top = stack.length - current - skip; 76 StackTraceElement[] cleared = new StackTraceElement[stack.length - skip]; 77 System.arraycopy(stack, 0, cleared, 0, top) [all...] |
/external/elfutils/libdwfl/ |
frame_unwind.c | 39 /* Maximum number of DWARF expression stack slots before returning an error. */ 107 do_push (struct eval_stack *stack, Dwarf_Addr val) 109 if (stack->used >= DWARF_EXPR_STACK_MAX) 114 if (stack->used == stack->allocated) 116 stack->allocated = MAX (stack->allocated * 2, 32); 118 new_addrs = realloc (stack->addrs, 119 stack->allocated * sizeof (*stack->addrs)) 156 struct eval_stack stack = local [all...] |
/external/freetype/src/cff/ |
cffparse.h | 31 /* CFF uses constant parser stack size; */ 37 * revision of the CFF2 specification, increasing the (then static) stack 38 * size to 513. By making the default stack size equal to the maximum 39 * stack size, the operator is essentially disabled, which has the 59 FT_Byte** stack; member in struct:CFF_ParserRec_
|
/external/freetype/src/lzw/ |
ftzopen.h | 139 FT_Byte* stack; /* character stack */ member in struct:FT_LzwStateRec_
|
/external/gemmlowp/profiling/ |
instrumentation.h | 107 // A pseudo-call-stack. Contrary to a real call-stack, this only 162 ProfilingStack stack; member in struct:gemmlowp::ThreadInfo 167 stack.lock = new Mutex(); 175 delete self->stack.lock; 209 : profiling_stack_(&ThreadLocalThreadInfo().stack) {
|
/external/google-breakpad/src/client/linux/microdump_writer/ |
microdump_writer.cc | 195 const void* stack; local 198 if (!dumper_->GetStackInfo(&stack, &stack_len, stack_pointer)) { 199 // The stack pointer might not be available. In this case we don't hard 200 // fail, just produce a (almost useless) microdump w/o a stack section. 207 LogAppend(reinterpret_cast<uintptr_t>(stack)); 218 dumper_->CopyFromProcess(*stack_copy, thread_id, stack, stack_len); 220 // Dump the content of the stack, splicing it into chunks which size is 226 LogAppend(reinterpret_cast<uintptr_t>(stack) + stack_off);
|
/external/google-breakpad/src/processor/ |
minidump_processor_unittest.cc | 31 // corresponding symbol file, and checks the stack frames for correctness. 421 CallStack *stack = state.threads()->at(0); local 422 ASSERT_TRUE(stack); 423 ASSERT_EQ(stack->frames()->size(), 4U); 425 ASSERT_TRUE(stack->frames()->at(0)->module); 426 ASSERT_EQ(stack->frames()->at(0)->module->base_address(), 0x400000U); 427 ASSERT_EQ(stack->frames()->at(0)->module->code_file(), "c:\\test_app.exe"); 428 ASSERT_EQ(stack->frames()->at(0)->function_name, 430 ASSERT_EQ(stack->frames()->at(0)->source_file_name, "c:\\test_app.cc"); 431 ASSERT_EQ(stack->frames()->at(0)->source_line, 58) [all...] |
/external/libdivsufsort/lib/ |
sssort.c | 314 struct { saidx_t *a, *b, c; saint_t d; } stack[STACK_SIZE]; local 669 struct { saidx_t *a, *b, *c; saint_t d; } stack[STACK_SIZE]; local
|
trsort.c | 331 struct { const saidx_t *a; saidx_t *b, *c; saint_t d, e; }stack[STACK_SIZE]; local 381 a = stack[--ssize].b, b = stack[ssize].c; 382 if(stack[ssize].d == 0) { 385 if(0 <= trlink) { stack[trlink].d = -1; } 415 if(0 <= trlink) { stack[trlink].d = -1; } 514 if((1 < (b - a)) && (0 <= trlink)) { stack[trlink].d = -1; } 539 if(0 <= trlink) { stack[trlink].d = -1; }
|
/external/libffi/src/ia64/ |
ffi.c | 52 /* The stack layout given to ffi_call_unix and ffi_closure_unix_inner. */ 58 UINT64 other_args[]; /* Arguments passed on stack, variable size. */ 279 struct ia64_args *stack; local 289 /* Allocate the stack frame. */ 290 stack = alloca (cif->bytes); 299 stack->gp_regs[gpcount++] = *(SINT8 *)avalue[i]; 302 stack->gp_regs[gpcount++] = *(UINT8 *)avalue[i]; 305 stack->gp_regs[gpcount++] = *(SINT16 *)avalue[i]; 308 stack->gp_regs[gpcount++] = *(UINT16 *)avalue[i]; 311 stack->gp_regs[gpcount++] = *(SINT32 *)avalue[i] [all...] |
/external/libffi/src/x86/ |
ffi64.c | 220 /* If the struct is larger than 32 bytes, pass it on the stack. */ 393 not, add it's size to the stack byte count. */ 426 char *stack, *argp; local 444 stack = alloca (sizeof (struct register_args) + cif->bytes + 4*8); 445 reg_args = (struct register_args *) stack; 446 argp = stack + sizeof (struct register_args); 469 /* Stack arguments are *always* at least 8 byte aligned. */ 525 ffi_call_unix64 (stack, cif->bytes + sizeof (struct register_args), 625 /* Stack arguments are *always* at least 8 byte aligned. */
|
/external/linux-kselftest/tools/testing/selftests/memfd/ |
memfd_test.c | 542 uint8_t *stack; local 545 stack = malloc(STACK_SIZE); 546 if (!stack) { 552 stack + STACK_SIZE,
|
/external/mesa3d/src/gallium/drivers/nouveau/codegen/ |
nv50_ir_graph.cpp | 26 #include <stack> 171 std::stack<const Node *> stack; local 175 stack.push(node); 177 while (!stack.empty()) { 178 pos = stack.top(); 179 stack.pop(); 190 stack.push(ei.getNode()); 286 Stack bb, cross;
|
/external/mesa3d/src/intel/compiler/ |
brw_eu.h | 64 brw_inst stack[BRW_EU_MAX_INSN_STACK]; member in struct:brw_codegen 99 * blocks they were popping out of, to fix up the mask stack. This tracks
|
/external/nist-sip/java/gov/nist/javax/sip/stack/ |
MessageProcessor.java | 26 package gov.nist.javax.sip.stack; 41 * This is the Stack abstraction for the active object that waits for messages 98 * Our stack (that created us). 273 * Get the SIP Stack. 275 * @return the sip stack.
|
ServerLog.java | 30 package gov.nist.javax.sip.stack; 115 // specified. if not, use the stack name as the default 205 + "Here are the stack configuration properties \n" 223 .logDebug("Here are the stack configuration properties \n" 262 stackLogger.logDebug("Here are the stack configuration properties \n" 398 * Log an exception stack trace. 414 * Set the trace level for the stack. 431 * Get the trace level for the stack.
|
TCPMessageProcessor.java | 29 package gov.nist.javax.sip.stack; 164 * Returns the stack. 166 * @return my sip stack.
|
TLSMessageProcessor.java | 41 package gov.nist.javax.sip.stack; 180 * Returns the stack. 182 * @return my sip stack.
|
UDPMessageProcessor.java | 29 package gov.nist.javax.sip.stack; 54 * stack that were incorporated into this code. Niklas Uhrberg suggested that 95 * pointer to the stack. 298 * Returns the stack. 300 * @return my sip stack.
|
/external/pdfium/fxjs/ |
cfxjse_resolveprocessor.cpp | 506 std::vector<int32_t> stack; local 541 nType = stack.empty() ? -1 : stack.back(); 542 if (!stack.empty()) 543 stack.pop_back(); 545 stack.push_back(nType); 548 stack.push_back(nType); 551 stack.push_back(nType); 556 if (!stack.empty())
|