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

<<11121314151617181920>>

  /external/valgrind/memcheck/tests/
signal2.stderr.exp 3 Address 0x........ is not stack'd, malloc'd or (recently) free'd
  /external/valgrind/none/tests/
thread-exits.stdout.exp 0 stack grew OK
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons/
ctor_container.pass.cpp 10 // <stack>
12 // explicit stack(const container_type& c);
14 #include <stack>
30 std::stack<int> q(d);
  /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/
pop.pass.cpp 10 // <stack>
14 #include <stack>
19 std::stack<int> q;
  /toolchain/binutils/binutils-2.25/gold/testsuite/
split_i386_3.s 21 .section .note.GNU-stack,"",@progbits
22 .section .note.GNU-split-stack,"",@progbits
split_x32_3.s 21 .section .note.GNU-stack,"",@progbits
22 .section .note.GNU-split-stack,"",@progbits
split_x86_64_3.s 21 .section .note.GNU-stack,"",@progbits
22 .section .note.GNU-split-stack,"",@progbits
  /external/compiler-rt/lib/asan/
asan_mac.cc 63 void ReadContextStack(void *context, uptr *stack, uptr *ssize) {
111 void asan_register_worker_thread(int parent_tid, StackTrace *stack) {
115 parent_tid, stack, /* detached */ true);
132 asan_register_worker_thread(context->parent_tid, &stack);
135 asan_free(context, &stack, FROM_MALLOC);
146 BufferedStackTrace *stack) {
148 (asan_block_context_t*) asan_malloc(sizeof(asan_block_context_t), stack);
161 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack); \
179 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack);
192 asan_block_context_t *asan_ctxt = alloc_asan_context(ctxt, func, &stack);
    [all...]
  /external/gemmlowp/profiling/
profiler.h 20 // This profiler only samples a pseudo-stack, not the actual call stack.
22 // pseudo-stack "labels", see ScopedProfilingLabel.
114 // of the number of samples that recorded the given pseudo-stack.
188 static void AddStackToNode(const ProfilingStack& stack, Node* node,
191 if (stack.size == level) {
196 if (child->label == stack.labels[level]) {
203 child_to_add_to->label = stack.labels[level];
206 AddStackToNode(stack, child_to_add_to, level + 1);
210 void AddStack(const ProfilingStack& stack) {
    [all...]
  /external/icu/icu4j/tools/build/src/com/ibm/icu/dev/tool/docs/
CheckTags.java 45 DocStack stack = new DocStack(); field in class:CheckTags
68 private DocNode[] stack; field in class:CheckTags.DocStack
73 if (stack == null) {
74 stack = new DocNode[5];
76 if (index == stack.length) {
77 DocNode[] temp = new DocNode[stack.length * 2];
78 System.arraycopy(stack, 0, temp, 0, index);
79 stack = temp;
82 if (stack[index] == null) {
83 stack[index] = new DocNode()
    [all...]
  /art/runtime/interpreter/mterp/x86/
op_rem_double_2addr.S 4 fldl VREG_ADDRESS(rINST) # vB to fp stack
6 fldl VREG_ADDRESS(%ecx) # vA to fp stack
op_rem_float.S 4 flds VREG_ADDRESS(%ecx) # vBB to fp stack
5 flds VREG_ADDRESS(%eax) # vCC to fp stack
op_rem_float_2addr.S 4 flds VREG_ADDRESS(rINST) # vB to fp stack
6 flds VREG_ADDRESS(%ecx) # vA to fp stack
  /art/runtime/interpreter/mterp/x86_64/
op_rem_double_2addr.S 4 fldl VREG_ADDRESS(rINSTq) # vB to fp stack
6 fldl VREG_ADDRESS(%rcx) # vA to fp stack
op_rem_float.S 4 flds VREG_ADDRESS(%rcx) # vBB to fp stack
5 flds VREG_ADDRESS(%rax) # vCC to fp stack
op_rem_float_2addr.S 4 flds VREG_ADDRESS(rINSTq) # vB to fp stack
6 flds VREG_ADDRESS(%rcx) # vA to fp stack
  /bionic/libc/arch-common/bionic/
crtend_so.S 30 .section .note.GNU-stack,"",%progbits
  /development/ndk/platforms/android-21/arch-arm64/src/
crtend.S 41 .section .note.GNU-stack,"",%progbits
crtend_so.S 40 .section .note.GNU-stack,"",%progbits
  /development/ndk/platforms/android-3/arch-arm/include/asm/
smp.h 31 void *stack; member in struct:secondary_data
  /development/samples/devbytes/animation/CardFlip/src/com/example/android/cardflip/
CardFlip.java 35 * these cards can be flipped from one stack to another where each flip comes with
37 * or right to left depending on which stack the animating card currently belongs to.
39 * This application demonstrates an animation where a stack of cards can either be
41 * Rotate out: Down fling on stack of cards
42 * Rotate in: Up fling on stack of cards
43 * Full rotation: Tap on stack of cards
47 * state, no new cards can be rotated to or from that stack. These changes were made to
113 * Adds a new card to the specified stack. Also performs all the necessary layout setup
116 public void addNewCard(int stack) {
118 view.updateTranslation(mStackCards.get(stack).size())
    [all...]
  /external/antlr/antlr-3.4/runtime/Ruby/test/functional/debugging/
rule-tracing.rb 15 @stack = nil
20 attr_accessor :stack, :traces
32 @stack = nil
37 attr_accessor :stack, :traces
  /external/chromium-trace/catapult/third_party/coverage/coverage/ctracer/
datastack.h 10 /* An entry on the data stack. For each call frame, we need to record all
32 /* A data stack is a dynamically allocated vector of DataStackEntry's. */
34 int depth; /* The index of the last-used entry in stack. */
35 int alloc; /* number of entries allocated at stack. */
37 DataStackEntry * stack; member in struct:DataStack
  /external/compiler-rt/lib/msan/
msan_allocator.cc 110 static void *MsanAllocate(StackTrace *stack, uptr size, uptr alignment,
135 stack->tag = StackTrace::TAG_ALLOC;
136 Origin o = Origin::CreateHeapOrigin(stack);
144 void MsanDeallocate(StackTrace *stack, void *p) {
155 stack->tag = StackTrace::TAG_DEALLOC;
156 Origin o = Origin::CreateHeapOrigin(stack);
171 void *MsanCalloc(StackTrace *stack, uptr nmemb, uptr size) {
174 return MsanReallocate(stack, nullptr, nmemb * size, sizeof(u64), true);
177 void *MsanReallocate(StackTrace *stack, void *old_p, uptr new_size,
180 return MsanAllocate(stack, new_size, alignment, zeroise)
    [all...]
  /external/compiler-rt/lib/tsan/rtl/
tsan_suppressions.h 33 uptr IsSuppressed(ReportType typ, const ReportStack *stack, Suppression **sp);

Completed in 1146 milliseconds

<<11121314151617181920>>