/external/valgrind/main/coregrind/m_syswrap/ |
syswrap-x86-darwin.c | 200 // on a separate non-client stack. 207 char *stack; local 212 stack = (char *)allocstack(tst->tid); 213 stack -= 64+320; // make room for top frame 214 memset(stack, 0, 64+320); // ...and clear it 215 *(uintptr_t *)stack = (uintptr_t)tst; // set parameter 216 stack -= sizeof(uintptr_t); 217 *(uintptr_t *)stack = 0; // push fake return address 220 mach->__esp = (uintptr_t)stack; 224 /* Call f(arg1), but first switch stacks, using 'stack' as the ne 316 Addr stack = VG_PGROUNDUP(sp) - stacksize; local 386 Addr stack; local [all...] |
/frameworks/support/v4/java/android/support/v4/app/ |
TaskStackBuilder.java | 46 * <p>When crossing from one task stack to another post-Android 3.0, 47 * the application should synthesize a back stack/history for the new task so that 55 * the synthetic back stack as prescribed. On devices running older versions of the platform, 56 * these same calls will invoke the topmost activity in the supplied stack, ignoring 57 * the rest of the synthetic stack and allowing the back key to navigate back to the previous 62 * For more detailed information about tasks, the back stack, and navigation design guidelines, 64 * <a href="{@docRoot}guide/topics/fundamentals/tasks-and-back-stack.html">Tasks and Back Stack</a> 130 * Return a new TaskStackBuilder for launching a fresh task stack consisting 133 * @param context The context that will launch the new task stack or generate a PendingInten [all...] |
/art/runtime/gc/accounting/ |
atomic_stack.h | 36 // Capacity is how many elements we can store in the stack. 59 // Returns false if we overflowed the stack. 68 // Stack overflow. 93 // Take an item from the front of the stack. 128 // Will clear the stack. 167 CHECK(mem_map_.get() != NULL) << "couldn't allocate mark stack"; 175 // Name of the mark stack. 178 // Memory mapping of the atomic stack. 187 // Base of the atomic stack. 193 // Whether or not the stack is sorted, only updated in debug mode to avoid performance overhead [all...] |
/docs/source.android.com/src/devices/ |
bluetooth.jd | 28 <p>Android provides a default Bluetooth stack, BlueDroid, that is divided into two layers: The Bluetooth Embedded System (BTE), which implements the core 30 with Android framework applications. A Bluetooth system service communicates with the Bluetooth stack through JNI and with applications through 32 diagram shows the general structure of the Bluetooth stack: 65 <dt>Bluetooth stack</dt> 66 <dd>The default Bluetooth stack is provided for you and is located in 67 <code>external/bluetooth/bluedroid</code>. The stack implements the generic Bluetooth HAL as well 97 in the BlueDroid Bluetooth stack in the <code>external/bluetooth/bluedroid</code> directory, 101 <h2>Customizing the BlueDroid Stack</h2> 103 <p>If you are using the default BlueDroid stack, but want to make a few customizations, you can 110 to the BlueDroid stack (<code>external/bluetooth/bluedroid</code>).</li [all...] |
/external/chromium_org/build/android/ |
tombstones.py | 77 """Run the stack tool for given tombstone input. 81 include_stack: boolean whether to include stack data in output. 84 A string for each line of resolved stack output. 88 'scripts', 'stack') 93 if not include_stack and 'Stack Data:' in line: 106 lines += _ResolveSymbols(tombstone['data'], tombstone['stack']) 154 'stack': options.stack, 172 parser.add_option('-s', '--stack', action='store_true', 173 help='Also include symbols for stack data' [all...] |
/external/chromium_org/chrome/browser/ui/panels/ |
panel_manager.cc | 56 // stack or panel we want to seacrh first for adding new panel. 61 // When there're ties, the right-most stack will appear first. 67 // In the event of another draw, the top-most stack will appear first. 73 // The stack with more panels will appear first. 314 // If there're stacks, try to find a stack that can fit new panel. 317 // 1) Search from the stack with more panels to the stack with least panels. 319 // most stack to the left-most stack. 320 // 3) Among the stack with same number of panels and same x position 327 StackedPanelCollection* stack = *iter; local 421 StackedPanelCollection* stack = local 442 StackedPanelCollection* stack = new StackedPanelCollection(this); local [all...] |
/external/chromium_org/third_party/tcmalloc/chromium/src/ |
profiledata.h | 50 // Each sample contains a stack trace and a count. Memory usage is 51 // reduced by combining profile samples that have the same stack trace 103 static const int kMaxStackDepth = 64; // Max stack depth stored in profile 126 // entries from 'stack'. (depth must be > 0.) At most 127 // kMaxStackDepth stack entries will be recorded, starting with 128 // stack[0]. 132 void Add(int depth, const void* const* stack); 155 Slot depth; // Stack depth 156 Slot stack[kMaxStackDepth]; // Stack content member in struct:ProfileData::Entry [all...] |
/external/chromium_org/third_party/tcmalloc/vendor/src/ |
profiledata.h | 50 // Each sample contains a stack trace and a count. Memory usage is 51 // reduced by combining profile samples that have the same stack trace 103 static const int kMaxStackDepth = 64; // Max stack depth stored in profile 126 // entries from 'stack'. (depth must be > 0.) At most 127 // kMaxStackDepth stack entries will be recorded, starting with 128 // stack[0]. 132 void Add(int depth, const void* const* stack); 155 Slot depth; // Stack depth 156 Slot stack[kMaxStackDepth]; // Stack content member in struct:ProfileData::Entry [all...] |
/external/compiler-rt/lib/asan/ |
asan_fake_stack.h | 20 // Fake stack frame contains local variables of one function. 63 // For each thread we create a fake stack and place stack objects on this fake 64 // stack instead of the real stack. The fake stack is not really a stack but 65 // a fast malloc-like allocator so that when a function exits the fake stack 67 // So, we poison the objects on the fake stack when function returns. 85 static const uptr kMaxStackFrameSizeLog = 16; // Max stack frame is 64K [all...] |
asan_malloc_linux.cc | 65 asan_free(ptr, &stack, FROM_MALLOC); 70 asan_free(ptr, &stack, FROM_MALLOC); 75 return asan_malloc(size, &stack); 91 return asan_calloc(nmemb, size, &stack); 96 return asan_realloc(ptr, size, &stack); 101 return asan_memalign(boundary, size, &stack, FROM_MALLOC); 109 return asan_malloc_usable_size(ptr, &stack); 133 return asan_posix_memalign(memptr, alignment, size, &stack); 138 return asan_valloc(size, &stack); 143 return asan_pvalloc(size, &stack); [all...] |
/external/llvm/docs/ |
SegmentedStacks.rst | 11 Segmented stack allows stack space to be allocated incrementally than as a 13 done by allocating stack blocks (henceforth called *stacklets*) and linking them 16 call into the libgcc runtime to allocate more stack space. When using ``llc``, 33 current stack limit (minus the amount of space needed to allocate a new block) - 43 # More stack space needs to be allocated 45 movabsq $0, %r11 # The total size of arguments passed on stack 51 The size of function arguments on the stack needs to be passed to 67 The section on `allocating stacklets`_ automatically assumes that every stack 69 intrinsic to allocate dynamically sized blocks of memory on the stack. Whe [all...] |
/external/llvm/test/CodeGen/Thumb2/ |
aligned-spill.ll | 10 ; The caller-saved r4 is used as a scratch register for stack realignment. 27 ; Stack pointer must be updated before the spills. 31 ; Stack pointer adjustment for the stack frame contents. 34 ; subtract #8 here. That would leave sp less aligned than some stack slots, 41 ; The stack pointer restore must happen after the reloads. 58 ; Stack pointer must be updated before the spills. 67 ; The stack pointer restore must happen after the reloads. 85 ; Stack pointer must be updated before the spills. 92 ; The stack pointer restore must happen after the reloads [all...] |
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p2/src/ |
omxVCM4P2_DecodeVLCZigzag_IntraDCVLC_s.s | 118 ;// Allocate stack memory to store optimized VLC,Zigzag, RMAX, LMAX Table Addresses 130 M_ARG shortVideoHeaderonStack,4 ;// Pointer to argument on stack 131 M_ARG videoComponstack,4 ;// Pointer to argument on stack 188 M_STR DCVal,pDCCoeff ;// Store Decoded DC Coeff on Stack 194 M_STR pZigzagTable,ppZigzagTable ;// Store zigzag table on stack 196 M_STR pVlcTableL0L1,ppVlcTableL0L1 ;// Store Optimized VLC Table on stack 198 M_STR pLMAXTableL0L1,ppLMAXTableL0L1 ;// Store LMAX table on stack 202 M_STR pRMAXTableL0L1,ppRMAXTableL0L1 ;// Store RMAX Table on Stack 205 M_LDR shortVideoHeader,shortVideoHeaderonStack ;// Load the Input Argument From Stack 209 M_LDR DCVal,pDCCoeff ;// Get the Decoded DC Value From Stack [all...] |
/frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm_neon/vc/m4p2/src/ |
omxVCM4P2_DecodeVLCZigzag_IntraDCVLC_s.s | 118 ;// Allocate stack memory to store optimized VLC,Zigzag, RMAX, LMAX Table Addresses 130 M_ARG shortVideoHeaderonStack,4 ;// Pointer to argument on stack 131 M_ARG videoComponstack,4 ;// Pointer to argument on stack 188 M_STR DCVal,pDCCoeff ;// Store Decoded DC Coeff on Stack 194 M_STR pZigzagTable,ppZigzagTable ;// Store zigzag table on stack 196 M_STR pVlcTableL0L1,ppVlcTableL0L1 ;// Store Optimized VLC Table on stack 198 M_STR pLMAXTableL0L1,ppLMAXTableL0L1 ;// Store LMAX table on stack 202 M_STR pRMAXTableL0L1,ppRMAXTableL0L1 ;// Store RMAX Table on Stack 205 M_LDR shortVideoHeader,shortVideoHeaderonStack ;// Load the Input Argument From Stack 209 M_LDR DCVal,pDCCoeff ;// Get the Decoded DC Value From Stack [all...] |
/external/chromium_org/tools/grit/grit/ |
grd_reader.py | 31 # 'stack' is the a stack of elements that we push new nodes onto and 33 # 'stack[-1]' is the top of the stack. 35 self.stack = [] 58 if self.stack: 59 self.stack[-1].AddChild(node) 60 node.StartParsing(name, self.stack[-1]) 67 self.stack.append(node) 78 partnode = self.stack[-1 [all...] |
/external/chromium_org/v8/src/ia32/ |
regexp-macro-assembler-ia32.h | 108 // Called from RegExp if the stack-guard is triggered. 134 // Below the frame pointer - local stack variables. 142 // First register address. Following registers are below it on the stack. 155 // Check whether we are exceeding the stack limit on the backtrack stack. 167 // The register containing the backtrack stack top. Provides a meaningful 179 // is GC-safe (i.e., doesn't leave absolute code addresses on the stack) 184 // Pushes the value of a register on the backtrack stack. Decrements the 185 // stack pointer (ecx) by a word size and stores the register's value there. 188 // Pushes a value on the backtrack stack. Decrements the stack pointer (ecx [all...] |
/external/jmonkeyengine/engine/src/core/com/jme3/util/ |
TempVars.java | 56 * <code>TempVarsStack</code> contains a stack of TempVars.
57 * Every time TempVars.get() is called, a new entry is added to the stack,
97 TempVarsStack stack = varsLocal.get();
local 99 TempVars instance = stack.tempVars[stack.index];
106 stack.tempVars[stack.index] = instance;
109 stack.index++;
130 TempVarsStack stack = varsLocal.get();
local 132 // Return it to the stack
[all...] |
/external/proguard/src/proguard/evaluation/ |
BasicInvocationUnit.java | 34 * and it updates the stack for the invocation of a class member, 50 private Stack stack; field in class:BasicInvocationUnit 138 public void invokeMember(Clazz clazz, Method method, CodeAttribute codeAttribute, int offset, ConstantInstruction constantInstruction, Stack stack) 176 this.stack = stack; 178 this.stack = null; 189 setFieldValue(clazz, fieldrefConstant, stack.pop()); 195 setFieldClassValue(clazz, fieldrefConstant, stack.apop()) [all...] |
/external/v8/src/ia32/ |
regexp-macro-assembler-ia32.h | 111 // Called from RegExp if the stack-guard is triggered. 133 // Below the frame pointer - local stack variables. 140 // First register address. Following registers are below it on the stack. 153 // Check whether we are exceeding the stack limit on the backtrack stack. 165 // The register containing the backtrack stack top. Provides a meaningful 177 // is GC-safe (i.e., doesn't leave absolute code addresses on the stack) 182 // Pushes the value of a register on the backtrack stack. Decrements the 183 // stack pointer (ecx) by a word size and stores the register's value there. 186 // Pushes a value on the backtrack stack. Decrements the stack pointer (ecx [all...] |
/packages/apps/UnifiedEmail/src/com/android/mail/lib/html/parser/ |
HtmlTreeBuilder.java | 38 /** Stack contains HTML4.Element objects to keep track of unclosed tags */ 39 private final List<HTML.Element> stack = new ArrayList<HTML.Element>(); field in class:HtmlTreeBuilder 59 while (stack.size() > 0) { 103 while (pos < stack.size() - 1) { 128 /** Finds the start tag from the stack, returns -1 if not found */ 130 for (int i = stack.size() - 1; i >= 0; i--) { 131 HTML.Element e = stack.get(i); 140 * Adds a close tag corresponding to a tag on the stack, if 151 /** Pushes a tag onto the stack */ 153 stack.add(element) [all...] |
/packages/apps/UnifiedEmail/src/com/google/android/mail/common/html/parser/ |
HtmlTreeBuilder.java | 38 /** Stack contains HTML4.Element objects to keep track of unclosed tags */ 39 private final List<HTML.Element> stack = new ArrayList<HTML.Element>(); field in class:HtmlTreeBuilder 59 while (stack.size() > 0) { 103 while (pos < stack.size() - 1) { 128 /** Finds the start tag from the stack, returns -1 if not found */ 130 for (int i = stack.size() - 1; i >= 0; i--) { 131 HTML.Element e = stack.get(i); 140 * Adds a close tag corresponding to a tag on the stack, if 151 /** Pushes a tag onto the stack */ 153 stack.add(element) [all...] |
/prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/lib/ |
libm.a | 151 ? L ^ } w ? b e ? J ? J ? ? * | e ? ? ? % ? ? ? / ?? ???? ?? ? GCC: (GNU) 4.2.3 (Ubuntu 4.2.3-2ubuntu7) .symtab .strtab .shstrtab .rel.text .data .bss .rodata.str1.1 .rodata.str1.4 .rel.rodata .rodata.cst4 .rodata.cst8 .comment .note.GNU-stack |