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

<<41424344454647484950>>

  /packages/apps/Messaging/src/com/android/messaging/mmslib/pdu/
PduComposer.java 103 * Message compose buffer stack.
1135 private LengthRecordNode stack = null; field in class:PduComposer.BufferStack
    [all...]
  /toolchain/binutils/binutils-2.25/ld/testsuite/ld-x86-64/
dwarfreloc1.s 101 .section .note.GNU-stack,"",@progbits
dwarfreloc2.s 94 .section .note.GNU-stack,"",@progbits
  /bionic/libc/arch-x86/bionic/
__bionic_clone.S 22 # Copy 'fn' and 'arg' onto the child stack
  /bionic/linker/
Android.mk 39 -fno-stack-protector \
77 # Leave the symbols in the shared library so that stack unwinders can produce
  /external/boringssl/src/crypto/
cpu-arm-asm.S 30 .section .note.GNU-stack,"",%progbits
  /external/clang/unittests/Tooling/
RecursiveASTVisitorTestDeclVisitor.cpp 11 #include <stack>
  /external/google-breakpad/src/client/linux/minidump_writer/
linux_dumper.h 96 // Find a block of memory to take as the stack given the top of stack pointer.
97 // stack: (output) the lowest address in the memory area
99 // stack_top: the current top of the stack
100 bool GetStackInfo(const void** stack, size_t* stack_len, uintptr_t stack_top);
  /external/libopus/celt/arm/
arm2gnu.pl 313 # stack.
315 printf (" .section\t.note.GNU-stack,\"\",\%\%progbits\n");
  /external/libunwind/src/x86_64/
setcontext.S 100 /* push the return address on the stack */
110 /* We do not need executable stack. */
111 .section .note.GNU-stack,"",@progbits
  /external/libunwind/tests/
flush-cache.S 86 /* We do not need executable stack. */
87 .section .note.GNU-stack,"",@progbits
  /external/llvm/test/MC/Mips/
mips-pdr-bad.s 11 .frame # ASM: :[[@LINE]]:16: error: expected stack register
12 .frame bar # ASM: :[[@LINE]]:16: error: expected stack register
  /external/nist-sip/java/gov/nist/javax/sip/
NistSipMessageFactoryImpl.java 32 import gov.nist.javax.sip.stack.*;
37 * Implements all the support classes that are necessary for the nist-sip stack
38 * on which the jain-sip stack has been based. This is a mapping class to map
42 * messageChannel, the NIST-SIP stack calls the SIPStackMessageFactory
92 * Generate a new server response for the stack.
  /external/nist-sip/java/gov/nist/javax/sip/stack/
HopImpl.java 29 package gov.nist.javax.sip.stack;
MessageLog.java 30 package gov.nist.javax.sip.stack;
66 * @see gov.nist.javax.sip.stack.LogRecord#equals(java.lang.Object)
142 * @see gov.nist.javax.sip.stack.LogRecord#toString()
  /external/pdfium/xfa/src/fxfa/src/parser/
xfa_script_resolveprocessor.h 63 int32_t XFA_ResolveNodes_PopStack(CFX_Int32Array& stack);
  /external/speex/libspeex/
cb_search_sse.h 54 static void compute_weighted_codebook(const signed char *shape_cb, const spx_sig_t *_r, float *resp, __m128 *resp2, __m128 *E, int shape_cb_size, int subvect_size, char *stack)
ltp_arm4.h 88 void pitch_xcorr(const spx_word16_t *_x, const spx_word16_t *_y, spx_word32_t *corr, int len, int nb_pitch, char *stack)
ltp_sse.h 57 void pitch_xcorr(const float *_x, const float *_y, float *corr, int len, int nb_pitch, char *stack)
vq_arm4.h 36 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/v8/src/crankshaft/
hydrogen-range-analysis.cc 37 ZoneList<Pending> stack(graph()->blocks()->length(), zone());
81 // remaining blocks on the stack (in reverse order).
84 stack.Add(Pending(dominated_blocks->at(i), last_changed_range), zone());
87 } else if (!stack.is_empty()) {
88 // Pop next pending block from stack.
89 Pending pending = stack.RemoveLast();
  /external/v8/src/profiler/
sampling-heap-profiler.cc 158 std::vector<SharedFunctionInfo*> stack; local
164 stack.push_back(shared);
195 // We need to process the stack in reverse order as the top of the stack is
197 for (auto it = stack.rbegin(); it != stack.rend(); ++it) {
  /external/v8/test/mjsunit/es6/
tail-call.js 10 Error.prepareStackTrace = (error,stack) => {
11 error.strace = stack;
12 return error.message + "\n at " + stack.join("\n at ");
18 e.stack; // prepare stack trace
19 var stack = e.strace;
20 assertEquals("CheckStackTrace", stack[0].getFunctionName());
22 assertEquals(expected[i].name, stack[i + 1].getFunctionName());
  /external/v8/test/mjsunit/es8/
syntactic-tail-call.js 10 Error.prepareStackTrace = (error,stack) => {
11 error.strace = stack;
12 return error.message + "\n at " + stack.join("\n at ");
18 e.stack; // prepare stack trace
19 var stack = e.strace;
20 assertEquals("CheckStackTrace", stack[0].getFunctionName());
22 assertEquals(expected[i].name, stack[i + 1].getFunctionName());
  /external/v8/test/mjsunit/regress/
regress-1118.js 30 // An exception thrown in a function optimized by on-stack replacement (OSR)
31 // should be able to construct a receiver from all optimized stack frames.

Completed in 1118 milliseconds

<<41424344454647484950>>