HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 651 - 675 of 3511) sorted by null

<<21222324252627282930>>

  /prebuilts/go/linux-x86/src/runtime/cgo/
gcc_arm.S 45 .section .note.GNU-stack,"",%progbits
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
inspect_fodder.py 16 st = inspect.stack()
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
inspect_fodder.py 16 st = inspect.stack()
  /system/bt/hci/
Android.mk 30 $(LOCAL_PATH)/../stack/include \
57 $(LOCAL_PATH)/../stack/include \
  /system/bt/vendor_libs/test_vendor_lib/
Android.mk 26 $(BT_DIR)/stack/include \
62 $(BT_DIR)/stack/include
  /system/core/include/utils/
Thread.h 50 size_t stack = 0);
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-m68k/
tls-gd-2.s 24 .section .note.GNU-stack,"",@progbits
tls-gd-ie-1.s 23 .section .note.GNU-stack,"",@progbits
  /external/mesa3d/src/glx/
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
1936 struct array_stack_state *stack; local
    [all...]
  /art/runtime/arch/mips64/
jni_entrypoints_mips64.S 52 ld $a0, 0($sp) # restore registers from stack
71 daddiu $sp, $sp, 80 # restore the stack
  /external/autotest/client/site_tests/security_RuntimeExecStack/
security_RuntimeExecStack.py 16 stack segments' markings. If "x" is found, it fails.
29 0: ok: stack not executable (second element will be None)
30 1: error: stack is executable
31 2: error: stack is not writable
32 3: error: stack not found
40 if '[stack' not in line:
46 # Stack segment is executable.
50 # Sanity check we have stack segment perms.
55 # Stack segments are non-executable.
58 # Should be impossible: no stack segment seen
    [all...]
  /external/clang/lib/Format/
UnwrappedLineParser.h 23 #include <stack>
178 // Keeps a stack of currently active preprocessor branching directives.
200 std::stack<int> PPChainBranchIndex;
  /external/clang/unittests/Tooling/
RecursiveASTVisitorTest.cpp 11 #include <stack>
38 std::stack<LambdaExpr *> PendingBodies;
  /external/compiler-rt/lib/sanitizer_common/
sanitizer_symbolizer_internal.h 48 // The |stack| parameter is inout. It is pre-filled with the address,
50 // other stack frames.
51 virtual bool SymbolizePC(uptr addr, SymbolizedStack *stack) {
122 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override;
sanitizer_symbolizer_posix_libcdep.cc 252 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override {
254 SendCommand(stack->info.module, stack->info.module_offset)) {
255 ParseSymbolizePCOutput(buf, stack);
320 bool SymbolizePC(uptr addr, SymbolizedStack *stack) override {
322 stack->info.module, stack->info.module_offset, buffer_, kBufferSize);
323 if (result) ParseSymbolizePCOutput(buffer_, stack);
  /external/elfutils/tests/
run-deleted.sh 24 # stack will see the valgrind process backtrace.
35 # .../elfutils/src/stack: dwfl_thread_getframes tid 26376 at 0x4006c8 in .../elfutils/tests/deleted: no matching address range
36 testrun ${abs_top_builddir}/src/stack -p $pid 1>bt 2>bt.err || true
  /external/emma/core/java12/com/vladium/logging/
Logger.java 269 * Logs 'msg' from an unnamed calling method followed by the 'throwable' stack
283 * Logs 'msg' from a given calling method followed by the 'throwable' stack
310 * Returns the current top of the thread-local logger stack or the static
311 * Logger instance scoped to Logger.class if the stack is empty.
317 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local
319 // [assertion: stack != null]
321 if (stack.isEmpty ())
327 return (Logger) stack.getLast ();
340 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local
341 stack.addLast (ctx)
355 final LinkedList stack = (LinkedList) THREAD_LOCAL_STACK.get (); local
    [all...]
  /external/google-breakpad/src/client/linux/minidump_writer/
linux_core_dumper_unittest.cc 113 const void* stack; local
115 EXPECT_TRUE(dumper.GetStackInfo(&stack, &stack_len, info.stack_pointer));
  /external/google-breakpad/src/google_breakpad/processor/
stackwalker.h 80 bool Walk(CallStack* stack,
84 // Returns a new concrete subclass suitable for the CPU that a stack was
106 // memory identifies a MemoryRegion that provides the stack memory
107 // for the stack to walk. modules, if non-NULL, is a CodeModules
108 // object that is used to look up which code module each stack frame is
111 // supplier to symbolize stack frame and look up caller frame information
120 // the stack walker resorts to stack scanning.
129 // The default number of words to search through on the stack
139 // allow the scanner to look farther down the stack
    [all...]
  /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/lzw/
ftzopen.c 109 /* grow the character stack */
122 if ( state->stack == state->stack_0 )
124 state->stack = NULL;
128 /* requirement of the character stack larger than 1<<LZW_MAX_BITS */
137 if ( FT_RENEW_ARRAY( state->stack, old_size, new_size ) )
212 state->stack = state->stack_0;
227 if ( state->stack != state->stack_0 )
228 FT_FREE( state->stack );
243 state->stack[state->stack_top++] = (FT_Byte)(c); \
372 buffer[result] = state->stack[state->stack_top]
    [all...]
  /external/skia/src/gpu/
GrReducedClip.cpp 12 static void reduced_stack_walker(const SkClipStack& stack,
33 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
325 void GrReducedClip::ReduceClipStack(const SkClipStack& stack,
337 *resultGenID = stack.getTopmostGenID();
339 if (stack.isWideOpen()) {
345 // We initially look at whether the bounds alone is sufficient. We also use the stack bounds to
351 stack.getBounds(&stackBounds, &stackBoundsType, &iior);
385 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart);
421 // proceed to walking the stack.
432 // helper that actually walks the stack
    [all...]
  /external/speex/libspeex/
sb_celp.h 58 char *stack; /**< Temporary allocation stack */ member in struct:SBEncState
111 char *stack; member in struct:SBDecState
  /external/v8/test/mjsunit/
callsite.js 6 var constructor = Error().stack[0].constructor;
debug-evaluate-modify-this.js 21 print("Caught something. " + e + " " + e.stack);
debug-step-end-of-script.js 16 %AbortJS(e + "\n" + e.stack);

Completed in 1552 milliseconds

<<21222324252627282930>>