| /minix3/external/bsd/llvm/dist/clang/lib/Format/ |
| H A 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()
132 return !State.Stack.back().NoLineBreak; in canBreak()
140 if (State.Stack.back().BreakBeforeClosingBrace && in mustBreak()
151 State.Stack.back().BreakBeforeParameter && !Current.isTrailingComment() && in mustBreak()
155 State.Column > State.Stack.back().Indent && // Breaking saves columns. in mustBreak()
[all …]
|
| H A D | ContinuationIndenter.h | 334 std::vector<ParenState> Stack; member
376 return Stack < Other.Stack;
|
| /minix3/external/bsd/llvm/dist/clang/lib/Sema/ |
| H A D | SemaAttr.cpp | 48 stack_ty Stack; member in __anonf348ea230111::PragmaPackStack
60 Stack.push_back(PSE); in push()
75 if (Stack.empty()) { in pop()
87 Alignment = Stack.back().Alignment; in pop()
88 Stack.pop_back(); in pop()
95 for (unsigned i = Stack.size(); i != 0; ) { in pop()
97 if (Stack[i].Name == Name) { in pop()
99 Alignment = Stack[i].Alignment; in pop()
100 Stack.erase(Stack.begin() + i, Stack.end()); in pop()
120 PragmaPackStack *Stack = static_cast<PragmaPackStack*>(PackContext); in AddAlignmentAttributesForRecord() local
[all …]
|
| H A D | SemaOpenMP.cpp | 111 StackTy Stack; member in __anon8add7ef70111::DSAStackTy
122 explicit DSAStackTy(Sema &S) : Stack(1), SemaRef(S) {} in DSAStackTy()
126 Stack.push_back(SharingMapTy(DKind, DirName, CurScope, Loc)); in push()
127 Stack.back().DefaultAttrLoc = Loc; in push()
131 assert(Stack.size() > 1 && "Data-sharing attributes stack is empty!"); in pop()
132 Stack.pop_back(); in pop()
167 return Stack.back().Directive; in getCurrentDirective()
171 if (Stack.size() > 2) in getParentDirective()
172 return Stack[Stack.size() - 2].Directive; in getParentDirective()
178 Stack.back().DefaultAttr = DSA_none; in setDefaultDSANone()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/include/llvm/Support/ |
| H A D | FileSystem.h | 784 std::stack<directory_iterator, std::vector<directory_iterator> > Stack; member
799 State->Stack.push(directory_iterator(path, ec)); in recursive_directory_iterator()
800 if (State->Stack.top() == directory_iterator()) in recursive_directory_iterator()
811 if ((ec = State->Stack.top()->status(st))) return *this; in increment()
813 State->Stack.push(directory_iterator(*State->Stack.top(), ec)); in increment()
815 if (State->Stack.top() != end_itr) { in increment()
819 State->Stack.pop(); in increment()
823 while (!State->Stack.empty() in increment()
824 && State->Stack.top().increment(ec) == end_itr) { in increment()
825 State->Stack.pop(); in increment()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/test/CodeGen/ARM/ |
| H A D | 2013-04-16-AAPCS-C5-vs-VFP.ll | 31 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
|
| H A D | 2013-04-16-AAPCS-C4-vs-VFP.ll | 72 double %p8, ; --> Stack
73 i32 %p9) #0 { ; --> R0, not Stack+8
91 double 23.8, ; --> Stack
92 i32 43) ; --> R0, not Stack+8
|
| /minix3/external/bsd/llvm/dist/clang/lib/StaticAnalyzer/Core/ |
| H A D | CoreEngine.cpp | 45 SmallVector<WorkListUnit,20> Stack; member in __anon3c7a8e810111::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 __anon3c7a8e810211::BFSBlockDFSContents
114 return !Queue.empty() || !Stack.empty(); in hasWork()
121 Stack.push_back(U); in enqueue()
[all …]
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Bitcode/Writer/ |
| H A D | ValueEnumerator.cpp | 139 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
200 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
201 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
203 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
207 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
217 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
224 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
235 UseListOrderStack Stack; in predictUseListOrder() local
245 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder()
247 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/lib/Basic/ |
| H A D | Module.cpp | 172 SmallVector<Module *, 2> Stack; in markUnavailable() local
173 Stack.push_back(this); in markUnavailable()
174 while (!Stack.empty()) { in markUnavailable()
175 Module *Current = Stack.back(); in markUnavailable()
176 Stack.pop_back(); in markUnavailable()
187 Stack.push_back(*Sub); in markUnavailable()
278 SmallVector<Module *, 16> Stack(Imports.begin(), Imports.end()); in buildVisibleModulesCache() local
279 while (!Stack.empty()) { in buildVisibleModulesCache()
280 Module *CurrModule = Stack.pop_back_val(); in buildVisibleModulesCache()
284 CurrModule->getExportedModules(Stack); in buildVisibleModulesCache()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/R600/ |
| H A D | SIAnnotateControlFlow.cpp | 68 StackVector Stack; member in __anon03809f9f0111::SIAnnotateControlFlow
157 return !Stack.empty() && Stack.back().first == BB; in isTopOfStack()
162 return Stack.pop_back_val().second; in popSaved()
167 Stack.push_back(std::make_pair(BB, Saved)); in push()
357 assert(Stack.empty()); in runOnFunction()
|
| /minix3/external/bsd/llvm/dist/llvm/test/CodeGen/Thumb2/ |
| H A D | aligned-spill.ll | 27 ; Stack pointer must be updated before the spills.
31 ; Stack pointer adjustment for the stack frame contents.
58 ; Stack pointer must be updated before the spills.
85 ; Stack pointer must be updated before the spills.
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Target/X86/ |
| H A D | X86FloatingPoint.cpp | 65 memset(Stack, 0, sizeof(Stack)); in FPS()
142 unsigned Stack[8]; // FP<n> Registers in each stack slot... member
165 dbgs() << " FP" << Stack[i]; in dumpStack()
166 assert(RegMap[Stack[i]] == i && "Stack[] doesn't match RegMap[]!"); in dumpStack()
181 return Slot < StackTop && Stack[Slot] == RegNo; in isLive()
188 return Stack[StackTop-1-STi]; in getStackEntry()
202 Stack[StackTop] = Reg; in pushReg()
220 std::swap(Stack[RegMap[RegOnTop]], Stack[StackTop-1]); in moveToTop()
797 RegMap[Stack[--StackTop]] = ~0; // Update state in popStackAfter()
832 unsigned TopReg = Stack[StackTop-1]; in freeStackSlotBefore()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/include/clang/Serialization/ |
| H A D | ModuleManager.h | 72 Stack.reserve(N); in VisitState()
81 SmallVector<ModuleFile *, 4> Stack; member
|
| /minix3/external/bsd/llvm/dist/llvm/lib/Object/ |
| H A D | MachOObjectFile.cpp | 1492 Stack.clear(); in moveToEnd()
1501 if (Stack.size() != Other.Stack.size()) in operator ==()
1507 for (unsigned i=0; i < Stack.size(); ++i) { in operator ==()
1508 if (Stack[i].Start != Other.Stack[i].Start) in operator ==()
1530 return Stack.back().Flags; in flags()
1534 return Stack.back().Address; in address()
1538 return Stack.back().Other; in other()
1542 const char* ImportName = Stack.back().ImportName; in otherName()
1549 return Stack.back().Start - Trie.begin(); in nodeOffset()
1580 Stack.push_back(State); in pushNode()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/lib/AST/ |
| H A D | CXXInheritance.cpp | 574 SmallVector<OverriddenMethods, 4> Stack; in Collect() local
575 Stack.push_back(std::make_pair(CanonM->begin_overridden_methods(), in Collect()
577 while (!Stack.empty()) { in Collect()
578 OverriddenMethods OverMethods = Stack.back(); in Collect()
579 Stack.pop_back(); in Collect()
604 Stack.push_back(std::make_pair(CanonOM->begin_overridden_methods(), in Collect()
|
| H A D | NestedNameSpecifier.cpp | 609 SmallVector<NestedNameSpecifier *, 4> Stack; in MakeTrivial() local
611 Stack.push_back(NNS); in MakeTrivial()
612 while (!Stack.empty()) { in MakeTrivial()
613 NestedNameSpecifier *NNS = Stack.pop_back_val(); in MakeTrivial()
637 SaveSourceLocation(Stack.empty()? R.getEnd() : R.getBegin(), in MakeTrivial()
|
| /minix3/external/bsd/llvm/dist/clang/lib/Frontend/ |
| H A D | DiagnosticRenderer.cpp | 301 ModuleBuildStack Stack = SM.getModuleBuildStack(); in emitModuleBuildStack() local
302 for (unsigned I = 0, N = Stack.size(); I != N; ++I) { in emitModuleBuildStack()
303 const SourceManager &CurSM = Stack[I].second.getManager(); in emitModuleBuildStack()
304 SourceLocation CurLoc = Stack[I].second; in emitModuleBuildStack()
308 Stack[I].first, in emitModuleBuildStack()
|
| /minix3/external/bsd/llvm/dist/llvm/test/YAMLParser/ |
| H A D | spec-02-28.data | 20 Stack:
|
| /minix3/external/bsd/llvm/dist/llvm/test/CodeGen/X86/ |
| H A D | inline-asm-stack-realign2.ll | 7 ; CHECK: Stack realignment in presence of dynamic stack adjustments is not supported with inline as…
|
| H A D | inline-asm-stack-realign.ll | 7 ; CHECK: Stack realignment in presence of dynamic stack adjustments is not supported with inline as…
|
| H A D | libcall-sret.ll | 12 ; Stack for call: 4(sret ptr), 16(i128 %l), 16(128 %r). So next logical
|
| /minix3/external/bsd/llvm/dist/llvm/lib/CodeGen/ |
| H A D | MachineTraceMetrics.cpp | 784 SmallVector<const MachineBasicBlock*, 8> Stack; in computeInstrDepths() local
790 Stack.push_back(MBB); in computeInstrDepths()
803 while (!Stack.empty()) { in computeInstrDepths()
804 MBB = Stack.pop_back_val(); in computeInstrDepths()
979 SmallVector<const MachineBasicBlock*, 8> Stack; in computeInstrHeights() local
985 Stack.push_back(MBB); in computeInstrHeights()
1021 for (;!Stack.empty(); Stack.pop_back()) { in computeInstrHeights()
1022 MBB = Stack.back(); in computeInstrHeights()
1062 addLiveIns(Deps.front().DefMI, Deps.front().DefOp, Stack); in computeInstrHeights()
1095 addLiveIns(Deps[i].DefMI, Deps[i].DefOp, Stack); in computeInstrHeights()
|
| /minix3/external/bsd/llvm/dist/llvm/lib/IR/ |
| H A D | AsmWriter.cpp | 132 UseListOrderStack &Stack) { in predictValueUseListOrderImpl() argument
187 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
188 assert(List.size() == Stack.back().Shuffle.size() && "Wrong size"); in predictValueUseListOrderImpl()
190 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
194 OrderMap &OM, UseListOrderStack &Stack) { in predictValueUseListOrder() argument
204 predictValueUseListOrderImpl(V, F, IDPair.first, OM, Stack); in predictValueUseListOrder()
211 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
222 UseListOrderStack Stack; in predictUseListOrder() local
232 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder()
234 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder()
[all …]
|
| /minix3/external/bsd/llvm/dist/clang/lib/Serialization/ |
| H A D | ModuleManager.cpp | 375 State->Stack.push_back(*M); in visit()
380 if (State->Stack.empty()) in visit()
384 NextModule = State->Stack.pop_back_val(); in visit()
|