|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/Support/GenericDomTreeConstruction.h 779 TreeNodePtr TN = II.Bucket.top();
include/llvm/Support/GenericIteratedDominanceFrontier.h 157 DomTreeNodePair RootPair = PQ.top();
lib/CodeGen/LiveDebugValues.cpp 1367 MachineBasicBlock *MBB = OrderToBB[Worklist.top()];
lib/CodeGen/MachinePipeliner.cpp 1037 MachineInstr *MI = FuncUnitOrder.top();
lib/CodeGen/MachineScheduler.cpp 3627 SU = TopQ.top();
3634 SU = BottomQ.top();
lib/CodeGen/RegAllocBasic.cpp 98 LiveInterval *LI = Queue.top();
lib/CodeGen/RegAllocGreedy.cpp 752 LiveInterval *LI = &LIS->getInterval(~CurQueue.top().second);
lib/CodeGen/RegAllocPBQP.cpp 343 IntervalInfo Cur = Inactive.top();
360 Cur = Inactive.top();
lib/Target/Hexagon/BitTracker.h 84 return Uses.top();
lib/Target/WebAssembly/WebAssemblyCFGSort.cpp 307 Next = Preferred.top();
338 Next = Ready.top();
lib/Transforms/Utils/SplitModule.cpp 191 unsigned CurrentClusterID = BalancinQueue.top().first;
192 unsigned CurrentClusterSize = BalancinQueue.top().second;
tools/clang/lib/Analysis/LiveVariables.cpp 67 const CFGBlock *b = worklist.top();
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 959 Penalty = Queue.top().first.first;
960 StateNode *Node = Queue.top().second;
993 reconstructPath(InitialState, Queue.top().second);
tools/clang/lib/StaticAnalyzer/Core/WorkList.cpp 244 QueueItem U = queue.top();
302 QueueItem U = queue.top();
tools/clang/lib/Tooling/ASTDiff/ASTDiff.cpp 739 Result.push_back(List.top());
749 return Tree.getNode(List.top()).Height;
tools/llvm-profdata/llvm-profdata.cpp 896 if (HottestFuncs.top().second < FuncMax) {
971 SortedHottestFuncs.emplace_back(HottestFuncs.top());