Home
last modified time | relevance | path

Searched refs:Stack (Results 1 – 25 of 316) sorted by relevance

12345678910>>...13

/external/clang/lib/Format/
DContinuationIndenter.cpp84 State.Stack.push_back(ParenState(FirstIndent, Line->Level, FirstIndent, in getInitialState()
103 !(State.Stack.back().BreakBeforeClosingBrace && in canBreak()
122 if (Current.isMemberAccess() && State.Stack.back().ContainsUnwrappedBuilder) in canBreak()
127 if (Previous.is(tok::l_brace) && State.Stack.size() > 1 && in canBreak()
128 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
129 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) in canBreak()
139 return !State.Stack.back().NoLineBreak; in canBreak()
147 if (State.Stack.back().BreakBeforeClosingBrace && in mustBreak()
164 State.Stack.back().BreakBeforeParameter && !Current.isTrailingComment() && in mustBreak()
177 State.Stack.back().BreakBeforeParameter) && in mustBreak()
[all …]
/external/llvm/test/CodeGen/X86/
Ddeopt-bundles.ll10 ; STACKMAPS: Stack Maps: callsite 2882400015
11 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
12 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
13 ; STACKMAPS-NEXT: Stack Maps: Loc 1: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
14 ; STACKMAPS-NEXT: Stack Maps: Loc 2: Constant 1 [encoding: .byte 4, .byte 8, .short 0, .int 1]
15 ; STACKMAPS-NEXT: Stack Maps: Loc 3: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
16 ; STACKMAPS-NEXT: Stack Maps: has 0 live-out registers
17 ; STACKMAPS-NEXT: Stack Maps: callsite 4242
18 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
19 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
[all …]
Ddeopt-intrinsic.ll42 ; STACKMAPS: Stack Maps: callsites:
43 ; STACKMAPS-NEXT: Stack Maps: callsite 2882400015
44 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
45 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
46 ; STACKMAPS-NEXT: Stack Maps: Loc 1: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
47 ; STACKMAPS-NEXT: Stack Maps: Loc 2: Constant 1 [encoding: .byte 4, .byte 8, .short 0, .int 1]
48 ; STACKMAPS-NEXT: Stack Maps: Loc 3: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
49 ; STACKMAPS-NEXT: Stack Maps: has 0 live-out registers
50 ; STACKMAPS-NEXT: Stack Maps: callsite 2882400015
51 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
[all …]
Ddeopt-intrinsic-cconv.ll27 ; STACKMAPS: Stack Maps: callsites:
28 ; STACKMAPS-NEXT: Stack Maps: callsite 2882400015
29 ; STACKMAPS-NEXT: Stack Maps: has 4 locations
30 ; STACKMAPS-NEXT: Stack Maps: Loc 0: Constant 12 [encoding: .byte 4, .byte 8, .short 0, .int 12]
31 ; STACKMAPS-NEXT: Stack Maps: Loc 1: Constant 0 [encoding: .byte 4, .byte 8, .short 0, .int 0]
32 ; STACKMAPS-NEXT: Stack Maps: Loc 2: Constant 1 [encoding: .byte 4, .byte 8, .short 0, .int 1]
33 ; STACKMAPS-NEXT: Stack Maps: Loc 3: Constant 3 [encoding: .byte 4, .byte 8, .short 0, .int 3]
34 ; STACKMAPS-NEXT: Stack Maps: has 0 live-out registers
/external/easymock/src/org/easymock/internal/
DLastControl.java21 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()
50 stack = new Stack<IArgumentMatcher>(); in reportMatcher()
57 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in pullMatchers()
66 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportAnd()
72 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportNot()
78 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in popLastArgumentMatchers()
98 Stack<IArgumentMatcher> stack = threadToArgumentMatcherStack.get(); in reportOr()
[all …]
/external/apache-xml/src/main/java/org/apache/xml/serializer/
DNamespaceMappings.java95 private Stack m_nodeStack = new Stack();
119 Stack stack; in initNamespaces()
141 final Stack stack = getPrefixStack(prefix); in lookupNamespace()
152 final Stack stack = (Stack) m_namespaces.get(prefix); in getMappingFromPrefix()
210 Stack stack; in popNamespace()
233 Stack stack; in pushNamespace()
235 if ((stack = (Stack) m_namespaces.get(prefix)) == null) in pushNamespace()
237 m_namespaces.put(prefix, stack = new Stack()); in pushNamespace()
283 Stack prefixStack = getPrefixStack(prefix); in popNamespaces()
333 clone.m_nodeStack = (NamespaceMappings.Stack) m_nodeStack.clone(); in clone()
[all …]
/external/clang/lib/Sema/
DSemaAttr.cpp114 if (PackStack.Stack.empty()) { in ActOnPragmaOptionsAlign()
168 if (PackStack.Stack.empty()) in ActOnPragmaPack()
205 if (Action & PSK_Pop && VtorDispStack.Stack.empty()) in ActOnPragmaMSVtorDisp()
221 Stack.push_back(Slot(StackSlotLabel, CurrentValue, CurrentPragmaLocation)); in Act()
225 auto I = llvm::find_if(llvm::reverse(Stack), [&](const Slot &x) { in Act()
229 if (I != Stack.rend()) { in Act()
232 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
234 } else if (!Stack.empty()) { in Act()
236 CurrentValue = Stack.back().Value; in Act()
237 CurrentPragmaLocation = Stack.back().PragmaLocation; in Act()
[all …]
/external/valgrind/coregrind/
Dm_addrinfo.c149 VG_(initThreadInfo)(&ai->Addr.Stack.tinfo); in VG_()
150 ai->Addr.Stack.tinfo.tid = tid; in VG_()
151 ai->Addr.Stack.IP = 0; in VG_()
152 ai->Addr.Stack.frameNo = -1; in VG_()
153 ai->Addr.Stack.stackPos = StackPos_stacked; in VG_()
154 ai->Addr.Stack.spoffset = 0; // Unused. in VG_()
173 ai->Addr.Stack.frameNo = f; in VG_()
174 ai->Addr.Stack.IP = ips[f]; in VG_()
249 VG_(initThreadInfo)(&ai->Addr.Stack.tinfo); in VG_()
250 ai->Addr.Stack.tinfo.tid = tid; in VG_()
[all …]
Dm_stacks.c100 } Stack; typedef
102 static Stack *stacks;
110 static Stack *current_stack;
115 static void move_Stack_one_step_forward ( Stack* st ) in move_Stack_one_step_forward()
117 Stack *st0, *st1, *st2; in move_Stack_one_step_forward()
132 Stack* tmp; in move_Stack_one_step_forward()
155 static Stack* find_stack_by_addr(Addr sp) in find_stack_by_addr()
160 Stack *i = stacks; in find_stack_by_addr()
190 Stack *i; in VG_()
201 i = VG_(malloc)("stacks.rs.1", sizeof(Stack)); in VG_()
[all …]
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.JavaExtensions/
DStackExtensions.cs45 public static T elementAt<T>( this Stack<T> stack, int index ) in elementAt()
51 public static T peek<T>( this Stack<T> stack ) in peek()
57 public static T pop<T>( this Stack<T> stack ) in pop()
63 public static void push<T>( this Stack<T> stack, T obj ) in push()
69 public static int size<T>( this Stack<T> stack ) in size()
75 public static void setSize<T>( this Stack<T> stack, int size ) in setSize()
/external/compiler-rt/lib/ubsan/
Dubsan_diag.h23 SymbolizedStack *Stack; variable
26 if (Stack) in clear()
27 Stack->ClearAll(); in clear()
31 explicit SymbolizedStackHolder(SymbolizedStack *Stack = nullptr)
32 : Stack(Stack) {} in Stack() function
35 if (Stack != S) in reset()
37 Stack = S; in reset()
39 const SymbolizedStack *get() const { return Stack; } in get()
73 Location(const SymbolizedStackHolder &Stack) : in Location() argument
74 Kind(LK_Symbolized), SymbolizedLoc(Stack.get()) {} in Location()
/external/libmojo/base/android/jni_generator/
DtestMotionEvent.javap671 Stack=3, Locals=1, Args_size=1
690 Stack=3, Locals=1, Args_size=1
708 Stack=3, Locals=16, Args_size=14
738 Stack=3, Locals=15, Args_size=13
770 Stack=3, Locals=14, Args_size=12
798 Stack=3, Locals=15, Args_size=13
830 Stack=3, Locals=8, Args_size=6
852 Stack=3, Locals=1, Args_size=1
869 Stack=3, Locals=1, Args_size=1
886 Stack=3, Locals=1, Args_size=1
[all …]
DtestInputStream.javap59 Stack=3, Locals=1, Args_size=1
78 Stack=3, Locals=1, Args_size=1
96 Stack=3, Locals=1, Args_size=1
114 Stack=3, Locals=2, Args_size=2
132 Stack=3, Locals=1, Args_size=1
153 Stack=3, Locals=2, Args_size=2
172 Stack=3, Locals=4, Args_size=4
193 Stack=3, Locals=1, Args_size=1
211 Stack=3, Locals=3, Args_size=2
/external/r8/src/main/java/com/android/tools/r8/utils/
DTiming.java16 import java.util.Stack;
20 private final Stack<Node> stack;
23 stack = new Stack<>(); in Timing()
30 final Stack<Node> sons = new Stack<>();
/external/llvm/lib/Target/WebAssembly/
DWebAssemblyCFGStackify.cpp440 GetDepth(const SmallVectorImpl<const MachineBasicBlock *> &Stack, in GetDepth() argument
443 for (auto X : reverse(Stack)) { in GetDepth()
448 assert(Depth < Stack.size() && "Branch destination should be in scope"); in GetDepth()
476 SmallVector<const MachineBasicBlock *, 8> Stack; in PlaceMarkers() local
481 assert(ScopeTops[Stack.back()->getNumber()] == &MBB && in PlaceMarkers()
483 Stack.pop_back(); in PlaceMarkers()
486 assert(Stack.back() == &MBB && "Loop top should be balanced"); in PlaceMarkers()
487 Stack.pop_back(); in PlaceMarkers()
488 Stack.pop_back(); in PlaceMarkers()
491 Stack.push_back(&MBB); in PlaceMarkers()
[all …]
/external/llvm/include/llvm/Support/
DFileSystem.h832 std::stack<directory_iterator, std::vector<directory_iterator> > Stack; member
847 State->Stack.push(directory_iterator(path, ec)); in recursive_directory_iterator()
848 if (State->Stack.top() == directory_iterator()) in recursive_directory_iterator()
859 if ((ec = State->Stack.top()->status(st))) return *this; in increment()
861 State->Stack.push(directory_iterator(*State->Stack.top(), ec)); in increment()
863 if (State->Stack.top() != end_itr) { in increment()
867 State->Stack.pop(); in increment()
871 while (!State->Stack.empty() in increment()
872 && State->Stack.top().increment(ec) == end_itr) { in increment()
873 State->Stack.pop(); in increment()
[all …]
/external/swiftshader/third_party/llvm-subzero/include/llvm/Support/
DFileSystem.h843 std::stack<directory_iterator, std::vector<directory_iterator>> Stack; member
858 State->Stack.push(directory_iterator(path, ec)); in recursive_directory_iterator()
859 if (State->Stack.top() == directory_iterator()) in recursive_directory_iterator()
871 if ((ec = State->Stack.top()->status(st))) return *this; in increment()
873 State->Stack.push(directory_iterator(*State->Stack.top(), ec)); in increment()
875 if (State->Stack.top() != end_itr) { in increment()
879 State->Stack.pop(); in increment()
883 while (!State->Stack.empty() in increment()
884 && State->Stack.top().increment(ec) == end_itr) { in increment()
885 State->Stack.pop(); in increment()
[all …]
/external/proguard/src/proguard/evaluation/
DTracedStack.java37 public class TracedStack extends Stack
40 private Stack producerStack;
41 private Stack actualProducerStack;
51 producerStack = new Stack(maxSize); in TracedStack()
52 actualProducerStack = new Stack(maxSize); in TracedStack()
63 producerStack = new Stack(tracedStack.producerStack); in TracedStack()
64 actualProducerStack = new Stack(tracedStack.actualProducerStack); in TracedStack()
DStack.java33 public class Stack class
47 public Stack(int maxSize) in Stack() method in Stack
56 public Stack(Stack stack) in Stack() method in Stack
98 public void copy(Stack other) in copy()
121 public boolean generalize(Stack other) in generalize()
507 Stack other = (Stack)object; in equals()
/external/apache-xml/src/main/java/org/apache/xalan/processor/
DStylesheetHandler.java23 import java.util.Stack;
226 private boolean stackContains(Stack stack, String url) in stackContains()
1166 private Stack m_stylesheets = new Stack();
1253 private Stack m_processors = new Stack();
1307 private Stack m_elems = new Stack();
1369 Stack m_baseIdentifiers = new Stack();
1438 private Stack m_stylesheetLocatorStack = new Stack();
1466 private Stack m_importStack = new Stack();
1473 private Stack m_importSourceStack = new Stack();
1545 Stack m_nsSupportStack = new Stack();
/external/clang/lib/StaticAnalyzer/Core/
DCoreEngine.cpp45 SmallVector<WorkListUnit,20> Stack; member in __anon43bd222f0111::DFS
48 return !Stack.empty(); in hasWork()
52 Stack.push_back(U); in enqueue()
56 assert (!Stack.empty()); in dequeue()
57 const WorkListUnit& U = Stack.back(); in dequeue()
58 Stack.pop_back(); // This technically "invalidates" U, but we are fine. in dequeue()
64 I = Stack.begin(), E = Stack.end(); I != E; ++I) { in visitItemsInWorkList()
111 SmallVector<WorkListUnit,20> Stack; member in __anon43bd222f0211::BFSBlockDFSContents
114 return !Queue.empty() || !Stack.empty(); in hasWork()
121 Stack.push_back(U); in enqueue()
[all …]
/external/mesa3d/src/mesa/main/
Dmatrix.c249 GLmatrix *new_stack = realloc(stack->Stack, in _mesa_PushMatrix()
260 stack->Stack = new_stack; in _mesa_PushMatrix()
264 _math_matrix_copy( &stack->Stack[stack->Depth + 1], in _mesa_PushMatrix()
265 &stack->Stack[stack->Depth] ); in _mesa_PushMatrix()
267 stack->Top = &(stack->Stack[stack->Depth]); in _mesa_PushMatrix()
306 stack->Top = &(stack->Stack[stack->Depth]); in _mesa_PopMatrix()
669 stack->Stack = calloc(1, sizeof(GLmatrix)); in init_matrix_stack()
672 _math_matrix_ctr(&stack->Stack[i]); in init_matrix_stack()
674 stack->Top = stack->Stack; in init_matrix_stack()
690 _math_matrix_dtr(&stack->Stack[i]); in free_matrix_stack()
[all …]
/external/llvm/test/CodeGen/ARM/
D2013-04-16-AAPCS-C5-vs-VFP.ll31 double %p8, ; --> Stack
33 %struct_t* byval %p10) ; --> Stack+8
56 double 23.8, ; --> Stack
57 i32 43, ; --> R0, not Stack+8
58 %struct_t* byval @static_val) ; --> Stack+8, not R1
/external/llvm/lib/Target/AMDGPU/
DAMDGPUAnnotateKernelFeatures.cpp88 SmallVector<const Constant *, 16> Stack; in visitConstantExprsRecursively() local
89 Stack.push_back(EntryC); in visitConstantExprsRecursively()
91 while (!Stack.empty()) { in visitConstantExprsRecursively()
92 const Constant *C = Stack.pop_back_val(); in visitConstantExprsRecursively()
109 Stack.push_back(OpC); in visitConstantExprsRecursively()
/external/llvm/lib/Bitcode/Writer/
DValueEnumerator.cpp142 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
203 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
204 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
206 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
210 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
220 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
227 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
238 UseListOrderStack Stack; in predictUseListOrder() local
248 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder()
250 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder()
[all …]

12345678910>>...13