HomeSort by relevance Sort by last modified time
    Searched refs:stack (Results 401 - 425 of 2692) sorted by null

<<11121314151617181920>>

  /external/chromium_org/third_party/freetype/src/cff/
cffparse.h 44 FT_Byte* stack[CFF_MAX_STACK_DEPTH + 1]; member in struct:CFF_ParserRec_
  /external/chromium_org/third_party/tcmalloc/chromium/src/
stack_trace_table.cc 48 if (this->trace.stack[i] != t.stack[i]) {
75 h += reinterpret_cast<uintptr_t>(t.stack[i]);
119 "tcmalloc: allocation failed for stack traces",
133 out[idx++] = b->trace.stack[d];
stacktrace.cc 33 // Produce stack trace.
35 // There are three different ways we can try to get the stack trace:
37 // 1) Our hand-coded stack-unwinder. This depends on a certain stack
109 # error Cannot calculate stack trace: will need to write for your environment
  /external/chromium_org/third_party/tcmalloc/vendor/src/
stack_trace_table.cc 48 if (this->trace.stack[i] != t.stack[i]) {
75 h += reinterpret_cast<uintptr_t>(t.stack[i]);
119 "tcmalloc: allocation failed for stack traces",
133 out[idx++] = b->trace.stack[d];
stacktrace.cc 33 // Produce stack trace.
35 // There are three different ways we can try to get the stack trace:
37 // 1) Our hand-coded stack-unwinder. This depends on a certain stack
109 # error Cannot calculate stack trace: will need to write for your environment
  /external/chromium_org/tools/memory_watcher/
memory_watcher.h 28 CallStack* stack; member in struct:MemoryWatcher::StackTrack
76 // a stack track. Used to avoid recursive tracking.
  /external/freetype/src/cff/
cffparse.h 44 FT_Byte* stack[CFF_MAX_STACK_DEPTH + 1]; member in struct:CFF_ParserRec_
  /external/kernel-headers/original/asm-arm/
smp.h 65 * This also gives us the initial stack to use for this CPU.
85 void *stack; member in struct:secondary_data
  /external/libffi/src/alpha/
ffi.c 81 unsigned long *stack, *argp; local
92 argp = stack = alloca(cif->bytes + 4*FFI_SIZEOF_ARG);
136 if (argp - stack < 6)
168 ffi_call_osf(stack, cif->bytes, cif->flags, rvalue, fn);
229 /* Grab the addresses of the arguments from the stack frame. */
  /external/llvm/include/llvm/Analysis/
PathNumbering.h 35 #include <stack>
49 typedef std::stack<BallLarusNode*> BLNodeStack;
287 void buildNode(BLBlockNodeMap& inDag, std::stack<BallLarusNode*>& dfsStack);
290 void buildEdge(BLBlockNodeMap& inDag, std::stack<BallLarusNode*>& dfsStack,
  /external/llvm/test/MC/ELF/
basic-elf-32.s 31 .section .note.GNU-stack,"",@progbits
basic-elf-64.s 31 .section .note.GNU-stack,"",@progbits
  /external/nist-sip/java/gov/nist/javax/sip/stack/
DefaultMessageLogFactory.java 1 package gov.nist.javax.sip.stack;
7 * The Default Message log factory. This can be replaced as a stack
  /external/speex/libspeex/
cb_search.c 53 static void compute_weighted_codebook(const signed char *shape_cb, const spx_word16_t *r, spx_word16_t *resp, spx_word16_t *resp2, spx_word32_t *E, int shape_cb_size, int subvect_size, char *stack)
111 char *stack,
153 compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack);
160 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
162 vq_nbest(x, resp2, subvect_size, shape_cb_size, E, 1, &best_index, &best_dist, stack);
234 syn_percep_zero16(r2, ak, awk1, awk2, r2, nsf,p, stack);
253 char *stack,
297 split_cb_search_shape_sign_N1(target,ak,awk1,awk2,par,p,nsf,exc,r,bits,stack,update_target);
351 compute_weighted_codebook(shape_cb, r, resp, resp2, E, shape_cb_size, subvect_size, stack);
381 vq_nbest_sign(x, resp2, subvect_size, shape_cb_size, E, N, best_index, best_dist, stack);
    [all...]
vq_bfin.h 37 void vq_nbest(spx_word16_t *in, const spx_word16_t *codebook, int len, int entries, spx_word32_t *E, int N, int *nbest, spx_word32_t *best_dist, char *stack)
  /external/srec/srec/crec/
srec_stats.h 68 void srec_stats_update_astar(AstarStack* stack);
  /external/valgrind/main/memcheck/tests/darwin/
aio.stderr.exp 5 Address 0x........ is not stack'd, malloc'd or (recently) free'd
12 Address 0x........ is not stack'd, malloc'd or (recently) free'd
  /packages/apps/Gallery2/src/com/android/gallery3d/util/
Profile.java 27 // samples stack traces for a thread periodically. enable() and disable() is
40 // For every cycleTime period, we dump the stack of the thread.
127 StackTraceElement[] stack = thread.getStackTrace(); local
128 String[] lines = new String[stack.length];
129 for (int i = 0; i < stack.length; i++) {
130 lines[i] = stack[i].toString();
186 // milliseconds) sample the stack trace of the calling thread.
  /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/core/include/utils/
Thread.h 50 size_t stack = 0);
  /external/chromium_org/third_party/mesa/src/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...]
  /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...]
  /external/chromium_org/chrome/browser/chromeos/login/screens/
screen_manager.h 9 #include <stack>
116 // Current stack of screens (screen ids, all screens are assumed to have an
118 std::stack<std::string> screen_stack_;
  /external/chromium_org/chrome/common/extensions/docs/server2/
future_test.py 38 # Set up a chain of functions to test the stack trace.
66 stack = traceback.format_exc()
67 assertTrue(all(stack.find(fn.__name__) != -1 for fn in chain))

Completed in 1122 milliseconds

<<11121314151617181920>>