Home
last modified time | relevance | path

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

12345678

/freebsd-12.1/contrib/llvm/tools/clang/lib/Format/
H A DContinuationIndenter.cpp307 State.Stack[State.Stack.size() - 2].NestedBlockInlined && in canBreak()
308 State.Stack[State.Stack.size() - 2].HasMultipleNestedBlocks) in canBreak()
558 State.Stack.back().LastSpace = State.Stack.back().VariablePos; in addTokenOnCurrentLine()
722 State.Stack[State.Stack.size() - 2].CallContinuation == 0) in addTokenOnCurrentLine()
808 State.Stack[State.Stack.size() - 2].LastSpace = in addTokenOnNewLine()
862 State.Stack[State.Stack.size() - 2].NestedBlockInlined; in addTokenOnNewLine()
927 return State.Stack[State.Stack.size() - 2].NestedBlockIndent; in getNewLineColumn()
930 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
945 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
947 return State.Stack[State.Stack.size() - 2].LastSpace; in getNewLineColumn()
[all …]
/freebsd-12.1/contrib/googletest/googletest/test/
H A Dgoogletest-output-test-golden-lin.txt7 Stack trace: (omitted)
13 Stack trace: (omitted)
47 Stack trace: (omitted)
55 Stack trace: (omitted)
69 Stack trace: (omitted)
80 Stack trace: (omitted)
90 Stack trace: (omitted)
99 Stack trace: (omitted)
109 Stack trace: (omitted)
115 Stack trace: (omitted)
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp38 SmallVector<WorkListUnit, 20> Stack; member in __anon24c7175d0111::DFS
42 return !Stack.empty(); in hasWork()
46 Stack.push_back(U); in enqueue()
50 assert(!Stack.empty()); in dequeue()
51 const WorkListUnit& U = Stack.back(); in dequeue()
52 Stack.pop_back(); // This technically "invalidates" U, but we are fine. in dequeue()
94 SmallVector<WorkListUnit, 20> Stack; member in __anon24c7175d0211::BFSBlockDFSContents
98 return !Queue.empty() || !Stack.empty(); in hasWork()
105 Stack.push_back(U); in enqueue()
110 if (!Stack.empty()) { in dequeue()
[all …]
/freebsd-12.1/contrib/compiler-rt/lib/ubsan/
H A 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() argument
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()
/freebsd-12.1/contrib/llvm/tools/clang/lib/Sema/
H A DSemaAttr.cpp209 if (PackStack.Stack.empty()) in ActOnPragmaPack()
251 if (PackStack.Stack.empty()) in DiagnoseUnterminatedPragmaPack()
327 if (I != Stack.rend()) { in Act()
330 Stack.erase(std::prev(I.base()), Stack.end()); in Act()
332 } else if (!Stack.empty()) { in Act()
336 Stack.pop_back(); in Act()
404 if (Action & PSK_Pop && Stack->Stack.empty()) in ActOnPragmaMSSeg()
848 Stack->pop_back(); in PopPragmaVisibility()
849 Back = &Stack->back(); in PopPragmaVisibility()
858 Stack->pop_back(); in PopPragmaVisibility()
[all …]
H A DSemaOpenMP.cpp182 return Stack.empty() || in isStackEmpty()
212 if (Stack.empty() || in push()
222 Stack.back().first.pop_back(); in pop()
260 if (!Stack.empty() && Stack.back().second == OldFSI) { in popFunction()
262 Stack.pop_back(); in popFunction()
1015 if (Stack.back().first.empty()) in getTopMostTaskgroupReductionData()
1044 if (Stack.back().first.empty()) in getTopMostTaskgroupReductionData()
1171 std::find_if(Stack.back().first.rbegin(), Stack.back().first.rend(), in getTopDSA()
2188 DSAStackTy *Stack; member in __anon45dbc4931311::DSAAttrChecker
3054 if (Stack->getCurScope()) { in checkNestingOfRegions()
[all …]
/freebsd-12.1/contrib/llvm/lib/Analysis/
H A DPhiValues.cpp51 SmallVector<const PHINode *, 8> &Stack) { in processPhi() argument
64 processPhi(PhiPhiOp, Stack); in processPhi()
76 Stack.push_back(Phi); in processPhi()
85 while (!Stack.empty() && DepthMap[Stack.back()] >= DepthNumber) { in processPhi()
86 const PHINode *ComponentPhi = Stack.pop_back_val(); in processPhi()
116 SmallVector<const PHINode *, 8> Stack; in getValuesForPhi() local
117 processPhi(PN, Stack); in getValuesForPhi()
118 assert(Stack.empty()); in getValuesForPhi()
/freebsd-12.1/contrib/llvm/lib/Target/AMDGPU/
H A DAMDGPUAlwaysInlinePass.cpp60 SmallVector<User *, 16> Stack; in recursivelyVisitUsers() local
65 Stack.push_back(U); in recursivelyVisitUsers()
67 while (!Stack.empty()) { in recursivelyVisitUsers()
68 User *U = Stack.pop_back_val(); in recursivelyVisitUsers()
76 Stack.push_back(F); in recursivelyVisitUsers()
84 Stack.push_back(UU); in recursivelyVisitUsers()
H A DSILowerI1Copies.cpp142 assert(Stack.empty()); in analyze()
176 Stack.push_back(Succ); in analyze()
180 while (!Stack.empty()) { in analyze()
187 Stack.push_back(Succ); in analyze()
196 Stack.push_back(Pred); in analyze()
207 Stack.clear(); in analyze()
276 Stack.clear(); in initialize()
349 Stack.push_back(DefBlock); in advanceLevel()
356 Stack.push_back(NextLevel[i]); in advanceLevel()
367 while (!Stack.empty()) { in advanceLevel()
[all …]
H A DAMDGPUUnifyDivergentExitNodes.cpp100 SmallVector<BasicBlock *, 8> Stack; in isUniformlyReached() local
104 Stack.push_back(Pred); in isUniformlyReached()
106 while (!Stack.empty()) { in isUniformlyReached()
107 BasicBlock *Top = Stack.pop_back_val(); in isUniformlyReached()
113 Stack.push_back(Pred); in isUniformlyReached()
H A DAMDGPUAnnotateKernelFeatures.cpp110 SmallVector<const Constant *, 16> Stack; in visitConstantExprsRecursively() local
111 Stack.push_back(EntryC); in visitConstantExprsRecursively()
113 while (!Stack.empty()) { in visitConstantExprsRecursively()
114 const Constant *C = Stack.pop_back_val(); in visitConstantExprsRecursively()
131 Stack.push_back(OpC); in visitConstantExprsRecursively()
H A DSIAnnotateControlFlow.cpp74 StackVector Stack; member in __anon740648470111::SIAnnotateControlFlow
164 return !Stack.empty() && Stack.back().first == BB; in isTopOfStack()
169 return Stack.pop_back_val().second; in popSaved()
174 Stack.push_back(std::make_pair(BB, Saved)); in push()
280 assert(Stack.back().first == BB); in closeControlFlow()
346 if (!Stack.empty()) { in runOnFunction()
/freebsd-12.1/contrib/llvm/lib/Transforms/AggressiveInstCombine/
H A DTruncInstCombine.cpp67 SmallVector<Instruction *, 8> Stack; in buildTruncExpressionDag() local
85 if (!Stack.empty() && Stack.back() == I) { in buildTruncExpressionDag()
89 Stack.pop_back(); in buildTruncExpressionDag()
101 Stack.push_back(I); in buildTruncExpressionDag()
140 SmallVector<Instruction *, 8> Stack; in getMinBitWidth() local
170 if (!Stack.empty() && Stack.back() == I) { in getMinBitWidth()
174 Stack.pop_back(); in getMinBitWidth()
183 Stack.push_back(I); in getMinBitWidth()
/freebsd-12.1/contrib/llvm/include/llvm/Support/
H A DFileSystem.h1270 if (State->Stack.top() == directory_iterator()) in State()
1281 file_type type = State->Stack.top()->type(); in increment()
1290 State->Stack.push(directory_iterator(*State->Stack.top(), ec, Follow)); in increment()
1291 if (State->Stack.top() != end_itr) { in increment()
1295 State->Stack.pop(); in increment()
1299 while (!State->Stack.empty() in increment()
1301 State->Stack.pop(); in increment()
1306 if (State->Stack.empty()) in increment()
1333 State->Stack.pop(); in pop()
1335 } while (!State->Stack.empty() in pop()
[all …]
/freebsd-12.1/contrib/llvm/lib/Bitcode/Writer/
H A DValueEnumerator.cpp234 Stack.emplace_back(V, F, List.size()); in predictValueUseListOrderImpl()
237 Stack.back().Shuffle[I] = List[I].second; in predictValueUseListOrderImpl()
258 predictValueUseListOrder(Op, F, OM, Stack); in predictValueUseListOrder()
269 UseListOrderStack Stack; in predictUseListOrder() local
279 predictValueUseListOrder(&BB, &F, OM, Stack); in predictUseListOrder()
281 predictValueUseListOrder(&A, &F, OM, Stack); in predictUseListOrder()
289 predictValueUseListOrder(&I, &F, OM, Stack); in predictUseListOrder()
295 predictValueUseListOrder(&G, nullptr, OM, Stack); in predictUseListOrder()
297 predictValueUseListOrder(&F, nullptr, OM, Stack); in predictUseListOrder()
299 predictValueUseListOrder(&A, nullptr, OM, Stack); in predictUseListOrder()
[all …]
/freebsd-12.1/contrib/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGStackify.cpp594 GetDepth(const SmallVectorImpl<const MachineBasicBlock *> &Stack, in GetDepth() argument
597 for (auto X : reverse(Stack)) { in GetDepth()
700 SmallVector<const MachineBasicBlock *, 8> Stack; in rewriteDepthImmediates() local
707 assert(ScopeTops[Stack.back()->getNumber()]->getNumber() <= in rewriteDepthImmediates()
710 Stack.pop_back(); in rewriteDepthImmediates()
714 assert(ScopeTops[Stack.back()->getNumber()]->getNumber() <= in rewriteDepthImmediates()
717 Stack.pop_back(); in rewriteDepthImmediates()
742 Stack.pop_back(); in rewriteDepthImmediates()
747 Stack.push_back(&MBB); in rewriteDepthImmediates()
751 Stack.push_back(EndToBegin[&MI]->getParent()); in rewriteDepthImmediates()
[all …]
/freebsd-12.1/contrib/llvm/lib/ExecutionEngine/Orc/
H A DOrcCBindingsStack.h126 CBindingsResolver(OrcCBindingsStack &Stack, in CBindingsResolver() argument
129 : Stack(Stack), ExternalResolver(std::move(ExternalResolver)), in CBindingsResolver()
141 Stack.reportError(std::move(Err)); in getResponsibilitySet()
160 Stack.ES.legacyFailQuery(*Query, Addr.takeError()); in lookup()
164 Stack.ES.legacyFailQuery(*Query, std::move(Err)); in lookup()
186 if (Stack.CODLayer) { in findSymbol()
187 if (auto Sym = Stack.CODLayer->findSymbol(Name, true)) in findSymbol()
192 if (auto Sym = Stack.CompileLayer.findSymbol(Name, true)) in findSymbol()
198 if (auto Sym = Stack.CXXRuntimeOverrides.searchOverrides(Name)) in findSymbol()
208 OrcCBindingsStack &Stack; variable
/freebsd-12.1/contrib/llvm/tools/llvm-xray/
H A Dxray-stacks.cpp37 static cl::SubCommand Stack("stack", "Call stack accounting"); variable
44 cl::sub(Stack), cl::init(false));
47 cl::sub(Stack));
55 cl::sub(Stack), cl::init(""));
58 cl::sub(Stack));
63 cl::sub(Stack), cl::init(false));
68 cl::sub(Stack), cl::init(false));
74 cl::sub(Stack), cl::init(false));
77 cl::sub(Stack));
93 cl::sub(Stack), cl::init(HUMAN));
[all …]
/freebsd-12.1/contrib/llvm/tools/clang/lib/Basic/
H A DModule.cpp297 SmallVector<Module *, 2> Stack; in markUnavailable() local
298 Stack.push_back(this); in markUnavailable()
299 while (!Stack.empty()) { in markUnavailable()
300 Module *Current = Stack.back(); in markUnavailable()
301 Stack.pop_back(); in markUnavailable()
312 Stack.push_back(*Sub); in markUnavailable()
395 SmallVector<Module *, 16> Stack(Imports.begin(), Imports.end()); in buildVisibleModulesCache() local
396 while (!Stack.empty()) { in buildVisibleModulesCache()
397 Module *CurrModule = Stack.pop_back_val(); in buildVisibleModulesCache()
401 CurrModule->getExportedModules(Stack); in buildVisibleModulesCache()
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DCFIInstrInserter.cpp225 SmallVector<MachineBasicBlock *, 4> Stack; in updateSuccCFAInfo() local
226 Stack.push_back(MBBInfo.MBB); in updateSuccCFAInfo()
229 MachineBasicBlock *Current = Stack.pop_back_val(); in updateSuccCFAInfo()
240 Stack.push_back(Succ); in updateSuccCFAInfo()
243 } while (!Stack.empty()); in updateSuccCFAInfo()
/freebsd-12.1/contrib/llvm/lib/Object/
H A DCOFFModuleDefinition.cpp162 if (Stack.empty()) { in read()
166 Tok = Stack.back(); in read()
167 Stack.pop_back(); in read()
184 void unget() { Stack.push_back(Tok); } in unget()
356 std::vector<Token> Stack; member in llvm::object::Parser
/freebsd-12.1/contrib/llvm/lib/Target/X86/
H A DX86FloatingPoint.cpp66 memset(Stack, 0, sizeof(Stack)); in FPS()
177 dbgs() << " FP" << Stack[i]; in dumpStack()
200 return Stack[StackTop-1-STi]; in getStackEntry()
214 Stack[StackTop] = Reg; in pushReg()
239 std::swap(Stack[RegMap[RegOnTop]], Stack[StackTop-1]); in moveToTop()
869 Stack[OldSlot] = TopReg; in freeStackSlotBefore()
872 Stack[--StackTop] = ~0; in freeStackSlotBefore()
884 unsigned RegNo = Stack[i]; in adjustLiveRegs()
900 std::swap(Stack[getSlot(KReg)], Stack[getSlot(DReg)]); in adjustLiveRegs()
1363 Stack[UpdatedSlot] = Dest; in handleTwoArgFP()
[all …]
/freebsd-12.1/contrib/compiler-rt/lib/esan/
H A Desan_sideline_linux.cpp117 Stack = static_cast<char*>(MmapOrDie(SidelineStackSize, "SidelineStack")); in launchThread()
125 runSideline, Stack + SidelineStackSize, in launchThread()
154 UnmapOrDie(Stack, SidelineStackSize); in joinThread()
/freebsd-12.1/contrib/llvm/lib/Transforms/Utils/
H A DPredicateInfo.cpp225 bool PredicateInfo::stackIsInScope(const ValueDFSStack &Stack, in stackIsInScope() argument
227 if (Stack.empty()) in stackIsInScope()
234 if (Stack.back().EdgeOnly) { in stackIsInScope()
242 if (EdgePred != getBranchBlock(Stack.back().PInfo)) in stackIsInScope()
246 return DT.dominates(getBlockEdge(Stack.back().PInfo), *VDUse.U); in stackIsInScope()
249 return (VDUse.DFSIn >= Stack.back().DFSIn && in stackIsInScope()
250 VDUse.DFSOut <= Stack.back().DFSOut); in stackIsInScope()
253 void PredicateInfo::popStackUntilDFSScope(ValueDFSStack &Stack, in popStackUntilDFSScope() argument
255 while (!Stack.empty() && !stackIsInScope(Stack, VD)) in popStackUntilDFSScope()
256 Stack.pop_back(); in popStackUntilDFSScope()
/freebsd-12.1/contrib/compiler-rt/lib/xray/
H A Dxray_function_call_trie.h490 using Stack = Array<NodeAndParent>; in deepCopyInto() local
492 typename Stack::AllocatorType StackAllocator( in deepCopyInto()
494 Stack DFSStack(StackAllocator); in deepCopyInto()
549 using Stack = Array<NodeAndTarget>; in mergeInto() local
550 typename Stack::AllocatorType StackAllocator( in mergeInto()
552 Stack DFSStack(StackAllocator); in mergeInto()

12345678