| /external/google-breakpad/src/processor/testdata/symbols/libc-2.13.so/F4F8DFCD5A5FB5A7CE64717E9E6AE3890/ |
| D | libc-2.13.so.sym | 1712 STACK CFI INIT 1eaf0 90 .cfa: $rsp 16 + .ra: .cfa -8 + ^
1713 STACK CFI 1eaf6 .cfa: $rsp 24 +
1714 STACK CFI INIT 1eb80 2 .cfa: $rsp 8 + .ra: .cfa -8 + ^
1715 STACK CFI INIT 1eb90 9 .cfa: $rsp 8 + .ra: .cfa -8 + ^
1716 STACK CFI 1eb94 .cfa: $rsp 16 +
1717 STACK CFI INIT 1eba0 210 .cfa: $rsp 8 + .ra: .cfa -8 + ^
1718 STACK CFI 1ebac $rbp: .cfa -32 + ^ $rbx: .cfa -40 + ^
1719 STACK CFI 1ebba .cfa: $rsp 80 +
1720 STACK CFI 1ebc7 $r12: .cfa -24 + ^ $r13: .cfa -16 + ^
1721 STACK CFI INIT 1edb0 1c7 .cfa: $rsp 8 + .ra: .cfa -8 + ^
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/libgcc_s.so.1/18B180F90887D8F8B5C35D185444AF4C0/ |
| D | libgcc_s.so.1.sym | 129 STACK CFI INIT 2bb0 2c0 .cfa: $rsp 16 + .ra: .cfa -8 + ^
130 STACK CFI 2bb6 .cfa: $rsp 24 +
131 STACK CFI INIT 2fe0 4b .cfa: $rsp 8 + .ra: .cfa -8 + ^
132 STACK CFI INIT 3030 29 .cfa: $rsp 8 + .ra: .cfa -8 + ^
133 STACK CFI INIT 3060 67 .cfa: $rsp 8 + .ra: .cfa -8 + ^
134 STACK CFI INIT 30d0 67 .cfa: $rsp 8 + .ra: .cfa -8 + ^
135 STACK CFI INIT 3140 6a .cfa: $rsp 8 + .ra: .cfa -8 + ^
136 STACK CFI INIT 31b0 32 .cfa: $rsp 8 + .ra: .cfa -8 + ^
137 STACK CFI INIT 31f0 32 .cfa: $rsp 8 + .ra: .cfa -8 + ^
138 STACK CFI INIT 3230 2 .cfa: $rsp 8 + .ra: .cfa -8 + ^
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/ld-2.13.so/C32AD7E235EA6112E02A5B9D6219C4850/ |
| D | ld-2.13.so.sym | 17 STACK CFI INIT b40 8 .cfa: $rsp 8 + .ra: .cfa -8 + ^
18 STACK CFI INIT b50 5 .cfa: $rsp 8 + .ra: .cfa -8 + ^
19 STACK CFI INIT b60 5 .cfa: $rsp 8 + .ra: .cfa -8 + ^
20 STACK CFI INIT b70 69 .cfa: $rsp 8 + .ra: .cfa -8 + ^
21 STACK CFI b71 .cfa: $rsp 16 +
22 STACK CFI b74 $rbx: .cfa -16 + ^
23 STACK CFI b7e .cfa: $rsp 48 +
24 STACK CFI INIT be0 49 .cfa: $rsp 8 + .ra: .cfa -8 + ^
25 STACK CFI be1 .cfa: $rsp 16 +
26 STACK CFI be4 $rbx: .cfa -16 + ^
[all …]
|
| /external/chromium-trace/catapult/third_party/vinn/third_party/parse5/test/fixtures/ |
| D | open_element_stack_test.js | 15 stack = new OpenElementStack(document, treeAdapter);
17 assert.strictEqual(stack.current, document);
18 assert.strictEqual(stack.stackTop, -1);
20 stack.push(element1);
21 assert.strictEqual(stack.current, element1);
22 assert.strictEqual(stack.currentTagName, treeAdapter.getTagName(element1));
23 assert.strictEqual(stack.stackTop, 0);
25 stack.push(element2);
26 assert.strictEqual(stack.current, element2);
27 assert.strictEqual(stack.currentTagName, treeAdapter.getTagName(element2));
[all …]
|
| /external/proguard/src/proguard/evaluation/ |
| D | Processor.java | 31 * local variable frame and stack.
39 private final Stack stack; field in Processor
52 * @param stack the local stack.
59 Stack stack, in Processor() argument
66 this.stack = stack; in Processor()
87 stack.push(valueFactory.createReferenceValueNull()); in visitSimpleInstruction()
99 stack.push(valueFactory.createIntegerValue(simpleInstruction.constant)); in visitSimpleInstruction()
104 stack.push(valueFactory.createLongValue(simpleInstruction.constant)); in visitSimpleInstruction()
110 stack.push(valueFactory.createFloatValue((float)simpleInstruction.constant)); in visitSimpleInstruction()
115 stack.push(valueFactory.createDoubleValue((double)simpleInstruction.constant)); in visitSimpleInstruction()
[all …]
|
| D | Stack.java | 28 * This class represents an operand stack that contains <code>Value</code>
33 public class Stack class
44 * Creates a new Stack with a given maximum size, accounting for the double
47 public Stack(int maxSize) in Stack() method in Stack
54 * Creates a Stack that is a copy of the given Stack.
56 public Stack(Stack stack) in Stack() argument
59 this(stack.values.length); in Stack()
61 // Copy the stack contents. in Stack()
62 copy(stack); in Stack()
67 * Returns the actual maximum stack size that was required for all stack
[all …]
|
| /external/webrtc/webrtc/libjingle/xmllite/ |
| D | xmlnsstack_unittest.cc | 27 XmlnsStack stack; in TEST() local
29 EXPECT_EQ(std::string(NS_XML), stack.NsForPrefix("xml").first); in TEST()
30 EXPECT_EQ(std::string(NS_XMLNS), stack.NsForPrefix("xmlns").first); in TEST()
31 EXPECT_EQ("", stack.NsForPrefix("").first); in TEST()
33 EXPECT_EQ("xml", stack.PrefixForNs(NS_XML, false).first); in TEST()
34 EXPECT_EQ("xmlns", stack.PrefixForNs(NS_XMLNS, false).first); in TEST()
35 EXPECT_EQ("", stack.PrefixForNs("", false).first); in TEST()
36 EXPECT_EQ("", stack.PrefixForNs("", true).first); in TEST()
40 XmlnsStack stack; in TEST() local
41 stack.AddXmlns("pre1", "ns1"); in TEST()
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/microdump/breakpad_unittests/D6D1FEC9A15DE7F38A236898871A2E770/ |
| D | breakpad_unittests.sym | 58084 STACK CFI INIT 2351c 4 .cfa: sp 0 + .ra: x30
58085 STACK CFI INIT 23520 4 .cfa: sp 0 + .ra: x30
58086 STACK CFI INIT 23524 8 .cfa: sp 0 + .ra: x30
58087 STACK CFI INIT 2352c 8 .cfa: sp 0 + .ra: x30
58088 STACK CFI INIT 23534 8 .cfa: sp 0 + .ra: x30
58089 STACK CFI INIT 2353c 8 .cfa: sp 0 + .ra: x30
58090 STACK CFI INIT 23544 8 .cfa: sp 0 + .ra: x30
58091 STACK CFI INIT 2354c 8 .cfa: sp 0 + .ra: x30
58092 STACK CFI INIT 23554 4 .cfa: sp 0 + .ra: x30
58093 STACK CFI INIT 23558 8 .cfa: sp 0 + .ra: x30
[all …]
|
| /external/skia/tests/ |
| D | ClipStackTest.cpp | 24 // Build up a clip stack with a path, an empty clip, and a rect. in test_assign_and_comparison()
116 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
118 SkClipStack::B2TIter iter(stack); in assert_count()
129 SkClipStack stack; in test_iterators() local
140 stack.clipDevRect(gRects[i], SkRegion::kUnion_Op, false); in test_iterators()
143 assert_count(reporter, stack, 4); in test_iterators()
149 SkClipStack::B2TIter iter(stack); in test_iterators()
164 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
179 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
242 SkClipStack stack; in test_bounds() local
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/overflow/B0E1FC01EF48E39CAF5C881D2DF0C3840/ |
| D | overflow.sym | 5589 STACK CFI INIT 1a70 3b0 .cfa: $rsp 16 + .ra: .cfa -8 + ^
5590 STACK CFI 1a76 .cfa: $rsp 24 +
5591 STACK CFI INIT 2590 12 .cfa: $rsp 8 + .ra: .cfa -8 + ^
5592 STACK CFI INIT 25b0 8 .cfa: $rsp 8 + .ra: .cfa -8 + ^
5593 STACK CFI INIT 25c0 8 .cfa: $rsp 8 + .ra: .cfa -8 + ^
5594 STACK CFI INIT 25d0 c .cfa: $rsp 8 + .ra: .cfa -8 + ^
5595 STACK CFI INIT 25e0 c .cfa: $rsp 8 + .ra: .cfa -8 + ^
5596 STACK CFI INIT 25f0 c .cfa: $rsp 8 + .ra: .cfa -8 + ^
5597 STACK CFI INIT 2600 9 .cfa: $rsp 8 + .ra: .cfa -8 + ^
5598 STACK CFI INIT 24d0 2c .cfa: $rsp 8 + .ra: .cfa -8 + ^
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/null_read_av/7B7D1968FF0D47AE4366E9C3A7E1B6750/ |
| D | null_read_av.sym | 5519 STACK CFI INIT 18c0 350 .cfa: $rsp 16 + .ra: .cfa -8 + ^
5520 STACK CFI 18c6 .cfa: $rsp 24 +
5521 STACK CFI INIT 2140 2c .cfa: $rsp 8 + .ra: .cfa -8 + ^
5522 STACK CFI 2141 $rbx: .cfa -16 + ^ .cfa: $rsp 16 +
5523 STACK CFI 216b .cfa: $rsp 8 +
5524 STACK CFI INIT 2170 8 .cfa: $rsp 8 + .ra: .cfa -8 + ^
5525 STACK CFI INIT 2180 90 .cfa: $rsp 8 + .ra: .cfa -8 + ^
5526 STACK CFI 2181 $rbx: .cfa -16 + ^ .cfa: $rsp 16 +
5527 STACK CFI 2188 .cfa: $rsp 32 +
5528 STACK CFI 21ae .cfa: $rsp 16 +
[all …]
|
| /external/libcxx/include/ |
| D | stack | 2 //===---------------------------- stack -----------------------------------===//
15 stack synopsis
21 class stack
34 stack() = default;
35 ~stack() = default;
37 stack(const stack& q) = default;
38 stack(stack&& q) = default;
40 stack& operator=(const stack& q) = default;
41 stack& operator=(stack&& q) = default;
43 explicit stack(const container_type& c);
[all …]
|
| /external/easymock/src/org/easymock/internal/ |
| D | LastControl.java | 21 import java.util.Stack;
31 …private static final ThreadLocal<Stack<Invocation>> threadToCurrentInvocation = new ThreadLocal<St…
33 …private static final ThreadLocal<Stack<IArgumentMatcher>> threadToArgumentMatcherStack = new Threa…
48 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportMatcher() local
49 if (stack == null) { in reportMatcher()
50 stack = new Stack<IArgumentMatcher>(); in reportMatcher()
51 threadToArgumentMatcherStack.set(stack); in reportMatcher()
53 stack.push(matcher); in reportMatcher()
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in pullMatchers() local
58 if (stack == null) { in pullMatchers()
[all …]
|
| /external/selinux/libsepol/cil/src/ |
| D | cil_stack.c | 40 void cil_stack_init(struct cil_stack **stack) in cil_stack_init() argument
43 new_stack->stack = cil_malloc(sizeof(*(new_stack->stack)) * CIL_STACK_INIT_SIZE); in cil_stack_init()
46 *stack = new_stack; in cil_stack_init()
49 void cil_stack_destroy(struct cil_stack **stack) in cil_stack_destroy() argument
51 if (stack == NULL || *stack == NULL) { in cil_stack_destroy()
55 free((*stack)->stack); in cil_stack_destroy()
56 free(*stack); in cil_stack_destroy()
57 *stack = NULL; in cil_stack_destroy()
60 void cil_stack_empty(struct cil_stack *stack) in cil_stack_empty() argument
62 stack->pos = -1; in cil_stack_empty()
[all …]
|
| /external/pdfium/third_party/freetype/src/cff/ |
| D | cf2stack.c | 5 /* Adobe's code for emulating a CFF stack (body). */
58 CF2_Stack stack = NULL; in cf2_stack_init() local
61 if ( !FT_QNEW( stack ) ) in cf2_stack_init()
64 stack->memory = memory; in cf2_stack_init()
65 stack->error = e; in cf2_stack_init()
66 stack->top = &stack->buffer[0]; /* empty stack */ in cf2_stack_init()
69 return stack; in cf2_stack_init()
74 cf2_stack_free( CF2_Stack stack ) in cf2_stack_free() argument
76 if ( stack ) in cf2_stack_free()
78 FT_Memory memory = stack->memory; in cf2_stack_free()
[all …]
|
| /external/freetype/src/cff/ |
| D | cf2stack.c | 5 /* Adobe's code for emulating a CFF stack (body). */
58 CF2_Stack stack = NULL; in cf2_stack_init() local
61 if ( !FT_QNEW( stack ) ) in cf2_stack_init()
64 stack->memory = memory; in cf2_stack_init()
65 stack->error = e; in cf2_stack_init()
66 stack->top = &stack->buffer[0]; /* empty stack */ in cf2_stack_init()
69 return stack; in cf2_stack_init()
74 cf2_stack_free( CF2_Stack stack ) in cf2_stack_free() argument
76 if ( stack ) in cf2_stack_free()
78 FT_Memory memory = stack->memory; in cf2_stack_free()
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/microdump/breakpad_unittests/DA7778FB66018A4E9B4110ED06E730D00/ |
| D | breakpad_unittests.sym | 55150 STACK CFI INIT 15dc4 2 .cfa: sp 0 + .ra: lr
55151 STACK CFI INIT 15dc6 2 .cfa: sp 0 + .ra: lr
55152 STACK CFI INIT 15dc8 4 .cfa: sp 0 + .ra: lr
55153 STACK CFI INIT 15dcc 4 .cfa: sp 0 + .ra: lr
55154 STACK CFI INIT 15dd0 4 .cfa: sp 0 + .ra: lr
55155 STACK CFI INIT 15dd4 4 .cfa: sp 0 + .ra: lr
55156 STACK CFI INIT 15dd8 4 .cfa: sp 0 + .ra: lr
55157 STACK CFI INIT 15ddc 6 .cfa: sp 0 + .ra: lr
55158 STACK CFI INIT 15de2 2 .cfa: sp 0 + .ra: lr
55159 STACK CFI INIT 15dc8 4 .cfa: sp 0 + .ra: lr
[all …]
|
| /external/google-breakpad/src/tools/windows/dump_syms/testdata/ |
| D | omap_reorder_bbs.sym | 3705 STACK WIN 4 2cec 54 6 0 8 0 14 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3706 STACK WIN 4 4b70 a 3 0 0 0 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3707 STACK WIN 4 25a8 21 7 0 0 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3708 STACK WIN 4 131c 14 7 0 0 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3709 STACK WIN 4 1b94 16 7 0 4 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3710 STACK WIN 4 11e8 1e 7 0 0 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3711 STACK WIN 4 1b3c 10 7 0 0 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3712 STACK WIN 4 669c 7 3 0 4 0 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3713 STACK WIN 4 16d4 7 7 0 4 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
3714 STACK WIN 4 16db 19 0 0 4 0 4 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + =
[all …]
|
| /external/chromium-trace/catapult/third_party/gsutil/third_party/boto/boto/cloudformation/ |
| D | connection.py | 24 from boto.cloudformation.stack import Stack, StackSummary, StackEvent
25 from boto.cloudformation.stack import StackResource, StackResourceSummary
44 of resources as a single unit called a stack. AWS CloudFormation
45 creates and deletes all member resources of the stack together and
105 Helper that creates JSON parameters needed by a Stack Create or
106 Stack Update call.
110 The name associated with the stack. The name must be unique within your
129 an S3 bucket in the same region as the stack. For more information,
138 parameters for the stack. A 3-tuple (key, value, bool) may be used to
142 :param disable_rollback: Set to `True` to disable rollback of the stack
[all …]
|
| /external/google-breakpad/src/processor/testdata/symbols/kernel32.pdb/BCE8785C57B44245A669896B6A19B9542/ |
| D | kernel32.sym | 1578 STACK WIN 4 b5ae 16 5 0 c 0 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T0 .c…
1579 STACK WIN 4 9b47 66 5 0 4 0 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T0 .c…
1580 STACK WIN 4 17826 35 0 0 0 0 0 0 1 $T2 $esp .cbLocals + .cbSavedRegs + = $T0 .raSearchStart = $eip …
1581 STACK WIN 4 55709 1f7 c 0 10 8 4c 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T…
1582 STACK WIN 4 558b4 e 0 0 10 8 4c 0 1 $T0 $ebp = $T2 $esp = $T1 .raSearchStart = $eip $T1 ^ = $ebp $e…
1583 STACK WIN 4 be41 c7 c 0 4 8 3c 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T0 .…
1584 STACK WIN 4 39bc8 e 0 0 4 8 3c 0 1 $T0 $ebp = $T2 $esp = $T1 .raSearchStart = $eip $T1 ^ = $ebp $eb…
1585 STACK WIN 4 98f4 2b 5 0 8 0 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T0 .c…
1586 STACK WIN 4 936b 1e 6 0 4 0 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T0 .c…
1587 STACK WIN 4 9371 14 0 0 4 4 0 0 1 $T0 $ebp = $eip $T0 4 + ^ = $ebp $T0 ^ = $esp $T0 8 + = $L $T0 .c…
[all …]
|
| /external/llvm/docs/ |
| D | StackMaps.rst | 2 Stack maps and patch points in LLVM
16 A stack map records the location of ``live values`` at a particular
18 LLVM values live across the stack map. Instead, they are only the
22 containing the stack map.
24 LLVM emits stack map data into the object code within a designated
25 :ref:`stackmap-section`. This stack map data contains a record for
26 each stack map. The record stores the stack map's instruction address
28 value's location as a register, stack offset, or constant.
33 convention and may return a value. They also imply stack map
50 used whenever stack maps or code patching are needed. Because the
[all …]
|
| /external/clang/lib/Format/ |
| D | ContinuationIndenter.cpp | 78 State.Stack.push_back(ParenState(FirstIndent, Line->Level, FirstIndent, in getInitialState()
97 !(State.Stack.back().BreakBeforeClosingBrace && in canBreak()
116 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder) in canBreak()
121 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 && in canBreak()
122 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
123 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) in canBreak()
133 return !State.Stack.back().NoLineBreak; in canBreak()
141 if (State.Stack.back().BreakBeforeClosingBrace && in mustBreak()
152 State.Stack.back().BreakBeforeParameter && !Current.isTrailingComment() && in mustBreak()
164 State.Stack.back().BreakBeforeParameter) && in mustBreak()
[all …]
|
| /external/valgrind/coregrind/ |
| D | m_stacks.c | 3 /*--- Stack management. m_stacks.c ---*/
45 The stack
47 The stack's segment seems to be dynamically extended downwards by
48 the kernel as the stack pointer moves down. Initially, a 1-page
49 (4k) stack is allocated. When SP moves below that for the first
52 upwards to the current valid stack. It then extends the stack
57 That means that Valgrind can't spot when the stack segment is being
59 update stack permissions around SP, so we need to spot all writes
62 The deal is: when SP is assigned a lower value, the stack is being
64 between the old stack ptr and this one, if necessary. Then mark
[all …]
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| D | Frame.java | 19 * Represents the stack frame and local variable table at a particular point in time.
25 private Type[] stack; field in Frame
31 * Create a new frame with the specified local variable table size, and max stack size
34 * @param stack the maximum stack size
36 public Frame(int locals, int stack) { in Frame() argument
38 this.stack = new Type[stack]; in Frame()
63 * Returns the type on the stack at the specified index.
65 * @param index the position on the stack
66 * @return the type of the stack position
69 return stack[index]; in getStack()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/serializer/ |
| D | NamespaceMappings.java | 31 * prefix/uri/depth triplets are pushed on a stack pushed on a stack. The depth
47 * "def" is pushed on the stack with depth 1.
52 * stack. Of course popNamespaces(2) would pop anything with depth 2 or
55 * So prefix/uri pairs are pushed and poped off the stack as elements are
57 * are on the stack and a prefix can be found given a uri, or a uri can be found
73 * Each entry (prefix) in this hashtable points to a Stack of URIs
74 * This table maps a prefix (String) to a Stack of NamespaceNodes.
75 * All Namespace nodes in that retrieved stack have the same prefix,
76 * though possibly different URI's or depths. Such a stack must have
77 * mappings at deeper depths push later on such a stack. Mappings pushed
[all …]
|