| /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/proguard/src/proguard/evaluation/ |
| D | Processor.java | 39 private final Stack stack; field in Processor
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()
123 IntegerValue arrayIndex = stack.ipop(); in visitSimpleInstruction()
124 ReferenceValue arrayReference = stack.apop(); in visitSimpleInstruction()
[all …]
|
| /external/freetype/src/cff/ |
| D | cf2stack.c | 59 CF2_Stack stack = NULL; in cf2_stack_init() local
62 if ( !FT_NEW( stack ) ) in cf2_stack_init()
65 stack->memory = memory; in cf2_stack_init()
66 stack->error = e; in cf2_stack_init()
70 if ( FT_NEW_ARRAY( stack->buffer, stackSize ) ) in cf2_stack_init()
72 FT_FREE( stack ); in cf2_stack_init()
76 stack->stackSize = stackSize; in cf2_stack_init()
77 stack->top = stack->buffer; /* empty stack */ in cf2_stack_init()
79 return stack; in cf2_stack_init()
84 cf2_stack_free( CF2_Stack stack ) in cf2_stack_free() argument
[all …]
|
| D | cf2stack.h | 77 cf2_stack_free( CF2_Stack stack );
80 cf2_stack_count( CF2_Stack stack );
83 cf2_stack_pushInt( CF2_Stack stack,
86 cf2_stack_pushFixed( CF2_Stack stack,
90 cf2_stack_popInt( CF2_Stack stack );
92 cf2_stack_popFixed( CF2_Stack stack );
95 cf2_stack_getReal( CF2_Stack stack,
98 cf2_stack_setReal( CF2_Stack stack,
103 cf2_stack_pop( CF2_Stack stack,
107 cf2_stack_roll( CF2_Stack stack,
[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 …]
|
| D | cil_stack.h | 34 struct cil_stack_item *stack; member
44 #define cil_stack_for_each_starting_at(stack, start, pos, item) \ argument
45 …for (pos = start, item = cil_stack_peek_at(stack, pos); item != NULL; pos++, item = cil_stack_peek…
47 #define cil_stack_for_each(stack, pos, item) cil_stack_for_each_starting_at(stack, 0, pos, item) argument
50 void cil_stack_init(struct cil_stack **stack);
51 void cil_stack_destroy(struct cil_stack **stack);
53 void cil_stack_empty(struct cil_stack *stack);
54 int cil_stack_is_empty(struct cil_stack *stack);
56 void cil_stack_push(struct cil_stack *stack, enum cil_flavor flavor, void *data);
57 struct cil_stack_item *cil_stack_pop(struct cil_stack *stack);
[all …]
|
| /external/pdfium/third_party/freetype/src/cff/ |
| D | cf2stack.c | 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()
82 FT_FREE( stack ); in cf2_stack_free()
[all …]
|
| /external/skia/tests/ |
| D | ClipStackTest.cpp | 122 static void assert_count(skiatest::Reporter* reporter, const SkClipStack& stack, in assert_count() argument
124 SkClipStack::B2TIter iter(stack); in assert_count()
135 SkClipStack stack; in test_iterators() local
146 stack.clipRect(gRects[i], SkMatrix::I(), kUnion_SkClipOp, false); in test_iterators()
149 assert_count(reporter, stack, 4); in test_iterators()
155 SkClipStack::B2TIter iter(stack); in test_iterators()
170 SkClipStack::Iter iter(stack, SkClipStack::Iter::kTop_IterStart); in test_iterators()
185 SkClipStack::Iter iter(stack, SkClipStack::Iter::kBottom_IterStart); in test_iterators()
248 SkClipStack stack; in test_bounds() local
257 stack.save(); in test_bounds()
[all …]
|
| /external/easymock/src/org/easymock/internal/ |
| D | LastControl.java | 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()
62 return new ArrayList<IArgumentMatcher>(stack); in pullMatchers()
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportAnd() local
67 assertState(stack != null, "no matchers found."); in reportAnd()
[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/pcre/dist2/src/sljit/ |
| D | sljitUtils.c | 208 struct sljit_stack *stack; in sljit_allocate_stack() local
239 stack = (struct sljit_stack*)SLJIT_MALLOC(sizeof(struct sljit_stack), allocator_data); in sljit_allocate_stack()
240 if (!stack) in sljit_allocate_stack()
246 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
249 stack->base = base.uw; in sljit_allocate_stack()
250 stack->limit = stack->base; in sljit_allocate_stack()
251 stack->max_limit = stack->base + max_limit; in sljit_allocate_stack()
252 if (sljit_stack_resize(stack, stack->base + limit)) { in sljit_allocate_stack()
253 sljit_free_stack(stack, allocator_data); in sljit_allocate_stack()
262 SLJIT_FREE(stack, allocator_data); in sljit_allocate_stack()
[all …]
|
| /external/guava/guava/src/com/google/common/collect/ |
| D | BinaryTreeTraverser.java | 100 private final Deque<T> stack;
103 this.stack = new ArrayDeque<T>();
104 stack.addLast(root);
109 return !stack.isEmpty();
114 T result = stack.removeLast();
115 pushIfPresent(stack, rightChild(result));
116 pushIfPresent(stack, leftChild(result));
122 return stack.getLast();
135 private final Deque<T> stack;
139 this.stack = new ArrayDeque<T>();
[all …]
|
| /external/javassist/src/main/javassist/bytecode/ |
| D | CodeAnalyzer.java | 40 int[] stack = new int[length]; in computeMaxStack() local
42 initStack(stack, codeAttr); in computeMaxStack()
47 if (stack[i] < 0) { in computeMaxStack()
49 visitBytecode(ci, stack, i); in computeMaxStack()
55 if (stack[i] > maxStack) in computeMaxStack()
56 maxStack = stack[i]; in computeMaxStack()
61 private void initStack(int[] stack, CodeAttribute ca) { in initStack() argument
62 stack[0] = -1; in initStack()
67 stack[et.handlerPc(i)] = -2; // an exception is on stack in initStack()
71 private void visitBytecode(CodeIterator ci, int[] stack, int index) in visitBytecode() argument
[all …]
|
| /external/autotest/tko/ |
| D | status_lib_unittest.py | 107 stack = status_lib.status_stack()
108 self.assertEquals(stack.current_status(), "NOSTATUS")
112 stack = status_lib.status_stack()
113 stack.update("FAIL")
114 stack.start()
115 self.assertEquals(stack.current_status(), "NOSTATUS")
119 stack = status_lib.status_stack()
120 self.assertEquals(stack.size(), 0)
121 stack.start()
122 stack.end()
[all …]
|
| /external/speex/libspeex/ |
| D | stack_alloc.h | 91 #define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) argument
93 …stack, size, type) (VALGRIND_MAKE_NOACCESS(stack, 1000),ALIGN((stack),sizeof(type)),VALGRIND_MAKE_… argument
97 #define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) argument
99 #define PUSH(stack, size, type) (ALIGN((stack),sizeof(type)),(stack)+=((size)*sizeof(type)),(type*)… argument
111 #define ALLOC(var, size, type) var = PUSH(stack, size, type)
|
| /external/valgrind/memcheck/tests/ |
| D | descr_belowsp.stderr.exp | 2 Address 0x........ is on thread 1's stack
3 .... bytes below stack pointer
5 Address 0x........ is on thread 2's stack
6 .... bytes below stack pointer
12 Address 0x........ is on thread 2's stack
13 .... bytes below stack pointer
15 describing 0x........ discovered address giving SEGV in thread stack
16 Address 0x........ is on thread 2's stack
17 In stack guard protected page, .... bytes below stack pointer
19 Address 0x........ is on thread 2's stack
[all …]
|
| /external/elfutils/libdwfl/ |
| D | frame_unwind.c | 111 do_push (struct eval_stack *stack, Dwarf_Addr val) in do_push() argument
113 if (stack->used >= DWARF_EXPR_STACK_MAX) in do_push()
118 if (stack->used == stack->allocated) in do_push()
120 stack->allocated = MAX (stack->allocated * 2, 32); in do_push()
122 new_addrs = realloc (stack->addrs, in do_push()
123 stack->allocated * sizeof (*stack->addrs)); in do_push()
129 stack->addrs = new_addrs; in do_push()
131 stack->addrs[stack->used++] = val; in do_push()
136 do_pop (struct eval_stack *stack, Dwarf_Addr *val) in do_pop() argument
138 if (stack->used == 0) in do_pop()
[all …]
|
| /external/javassist/src/main/javassist/bytecode/analysis/ |
| D | Frame.java | 25 private Type[] stack; field in Frame
36 public Frame(int locals, int stack) { in Frame() argument
38 this.stack = new Type[stack]; in Frame()
69 return stack[index]; in getStack()
79 stack[index] = type; in setStack()
120 return stack[top - 1]; in peek()
131 return stack[--top]; in pop()
140 stack[top++] = type; in push()
151 Frame frame = new Frame(locals.length, stack.length); in copy()
153 System.arraycopy(stack, 0, frame.stack, 0, stack.length); in copy()
[all …]
|
| /external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/ |
| D | StackExtensions.cs | 45 public static T elementAt<T>( this Stack<T> stack, int index ) in elementAt() argument
47 return stack.ElementAt( index ); in elementAt()
51 public static T peek<T>( this Stack<T> stack ) in peek() argument
53 return stack.Peek(); in peek()
57 public static T pop<T>( this Stack<T> stack ) in pop() argument
59 return stack.Pop(); in pop()
63 public static void push<T>( this Stack<T> stack, T obj ) in push() argument
65 stack.Push( obj ); in push()
69 public static int size<T>( this Stack<T> stack ) in size() argument
71 return stack.Count; in size()
[all …]
|
| /external/compiler-rt/lib/asan/ |
| D | asan_stack.h | 34 void GetStackTraceWithPcBpAndContext(BufferedStackTrace *stack, uptr max_depth, in GetStackTraceWithPcBpAndContext() argument
38 stack->Unwind(max_depth, pc, bp, context, 0, 0, fast); in GetStackTraceWithPcBpAndContext()
41 stack->size = 0; in GetStackTraceWithPcBpAndContext()
52 stack->Unwind(max_depth, pc, bp, context, stack_top, stack_bottom, in GetStackTraceWithPcBpAndContext()
57 stack->Unwind(max_depth, pc, bp, context, 0, 0, false); in GetStackTraceWithPcBpAndContext()
70 BufferedStackTrace stack; \
72 stack.size = max_size; \
74 stack.top_frame_bp = GET_CURRENT_FRAME(); \
75 stack.trace_buffer[0] = StackTrace::GetCurrentPc(); \
77 stack.trace_buffer[1] = GET_CALLER_PC(); \
[all …]
|
| /external/ltp/lib/ |
| D | cloner.c | 54 # define clone(fn, stack, flags, arg, ptid, tls, ctid) \ argument
55 clone(fn, stack, flags, arg)
66 size_t stack_size, void *stack, pid_t *ptid, void *tls, pid_t *ctid) in ltp_clone_() argument
71 ret = __clone2(fn, stack, stack_size, flags, arg, ptid, tls, ctid); in ltp_clone_()
83 if (stack) in ltp_clone_()
84 stack += stack_size; in ltp_clone_()
87 ret = clone(fn, stack, flags, arg, ptid, tls, ctid); in ltp_clone_()
94 size_t stack_size, void *stack) in ltp_clone() argument
96 return ltp_clone_(flags, fn, arg, stack_size, stack, NULL, NULL, NULL); in ltp_clone()
100 size_t stack_size, void *stack, ...) in ltp_clone7() argument
[all …]
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| D | sanitizer_stackdepot_test.cc | 24 StackTrace stack = StackDepotGet(i1); in TEST() local
25 EXPECT_NE(stack.trace, (uptr*)0); in TEST()
26 EXPECT_EQ(ARRAY_SIZE(array), stack.size); in TEST()
27 EXPECT_EQ(0, internal_memcmp(stack.trace, array, sizeof(array))); in TEST()
31 StackTrace stack = StackDepotGet((1 << 30) - 1); in TEST() local
32 EXPECT_EQ((uptr*)0, stack.trace); in TEST()
37 StackTrace stack = StackDepotGet(i1); in TEST() local
38 EXPECT_EQ((uptr*)0, stack.trace); in TEST()
42 StackTrace stack = StackDepotGet(0); in TEST() local
43 EXPECT_EQ((uptr*)0, stack.trace); in TEST()
[all …]
|
| /external/libopus/celt/ |
| D | stack_alloc.h | 136 #define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) argument
137 …stack, size, type) (VALGRIND_MAKE_MEM_NOACCESS(stack, global_stack_top-stack),ALIGN((stack),sizeof… argument
143 #define ALIGN(stack, size) ((stack) += ((size) - (long)(stack)) & ((size) - 1)) argument
144 #define PUSH(stack, size, type) (ALIGN((stack),sizeof(type)/sizeof(char)),(stack)+=(size)*(sizeof(t… argument
|
| /external/libdivsufsort/include/ |
| D | divsufsort_private.h | 157 stack[ssize].a = (_a), stack[ssize].b = (_b),\
158 stack[ssize].c = (_c), stack[ssize++].d = (_d);\
163 stack[ssize].a = (_a), stack[ssize].b = (_b),\
164 stack[ssize].c = (_c), stack[ssize].d = (_d), stack[ssize++].e = (_e);\
170 (_a) = stack[--ssize].a, (_b) = stack[ssize].b,\
171 (_c) = stack[ssize].c, (_d) = stack[ssize].d;\
177 (_a) = stack[--ssize].a, (_b) = stack[ssize].b,\
178 (_c) = stack[ssize].c, (_d) = stack[ssize].d, (_e) = stack[ssize].e;\
|
| /external/clang/docs/ |
| D | SafeStack.rst | 12 based on stack buffer overflows, without introducing any measurable performance
13 overhead. It works by separating the program stack into two distinct regions:
14 the safe stack and the unsafe stack. The safe stack stores return addresses,
16 while the unsafe stack stores everything else. This separation ensures that
17 buffer overflows on the unsafe stack cannot be used to overwrite anything
18 on the safe stack.
30 stack and, hence, do not need unsafe stack frames to be created. The cost of
31 creating unsafe stack frames for large functions is amortized by the cost of
35 being moved to the unsafe stack are usually large arrays or variables that are
36 used through multiple stack frames. Moving such objects away from the safe
[all …]
|