|
|
reference, declaration → definition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced
|
References
include/llvm/Analysis/BlockFrequencyInfoImpl.h 603 std::deque<const IrrNode *> Edges;
607 using iterator = std::deque<const IrrNode *>::const_iterator;
1092 std::deque<std::pair<const LoopT *, LoopData *>> Q;
include/llvm/Analysis/LoopPass.h 154 std::deque<Loop *> LQ;
include/llvm/Analysis/RegionPass.h 89 std::deque<Region*> RQ;
include/llvm/CodeGen/MachinePipeliner.h 265 void fixupRegisterOverlaps(std::deque<SUnit *> &Instrs);
484 DenseMap<int, std::deque<SUnit *>> ScheduledInstrs;
542 using sched_iterator = DenseMap<int, std::deque<SUnit *>>::iterator;
544 DenseMap<int, std::deque<SUnit *>>::const_iterator;
574 std::deque<SUnit *> &getInstructions(int cycle) {
581 std::deque<SUnit *> &Insts);
include/llvm/CodeGen/ModuloSchedule.h 301 std::deque<MachineBasicBlock *> PeeledFront, PeeledBack;
include/llvm/Support/Automaton.h 79 std::deque<PathSegment *> Heads;
include/llvm/Support/TaskQueue.h 134 std::deque<std::function<void()>> Tasks;
include/llvm/Transforms/Scalar/Reassociate.h 74 SetVector<AssertingVH<Instruction>, std::deque<AssertingVH<Instruction>>>;
include/llvm/Transforms/Utils/Evaluator.h 102 std::deque<DenseMap<Value*, Constant*>> ValueStack;
lib/Analysis/LoopPass.cpp 128 static void addLoopIntoQueue(Loop *L, std::deque<Loop *> &LQ) {
lib/Analysis/RegionPass.cpp 40 static void addRegionIntoQueue(Region &R, std::deque<Region *> &RQ) {
lib/Bitcode/Reader/BitcodeReader.cpp 549 std::deque<Function *> BasicBlockFwdRefQueue;
lib/Bitcode/Reader/MetadataLoader.cpp 365 std::deque<DistinctMDOperandPlaceholder> PHs;
lib/CodeGen/DetectDeadLanes.cpp 121 std::deque<unsigned> Worklist;
lib/CodeGen/MachinePipeliner.cpp 2303 std::deque<SUnit *> &cycleInstrs = ScheduledInstrs[checkCycle];
2305 for (std::deque<SUnit *>::iterator I = cycleInstrs.begin(),
2460 std::deque<SUnit *> &Insts) {
2470 for (std::deque<SUnit *>::iterator I = Insts.begin(), E = Insts.end(); I != E;
2760 void SwingSchedulerDAG::fixupRegisterOverlaps(std::deque<SUnit *> &Instrs) {
2814 std::deque<SUnit *> &cycleInstrs =
2816 for (std::deque<SUnit *>::reverse_iterator I = cycleInstrs.rbegin(),
2838 std::deque<SUnit *> &cycleInstrs = ScheduledInstrs[Cycle];
2839 std::deque<SUnit *> newOrderPhi;
2845 std::deque<SUnit *> newOrderI;
lib/DebugInfo/DWARF/DWARFContext.cpp 1443 std::deque<SmallString<0>> UncompressedSections;
lib/MC/MCParser/AsmParser.cpp 151 std::deque<MCAsmMacro> MacroLikeBodies;
lib/MC/XCOFFObjectWriter.cpp 88 std::deque<ControlSection> Csects;
91 using CsectGroups = std::deque<CsectGroup *>;
lib/Target/AMDGPU/AMDILCFGStructurizer.cpp 1014 std::deque<MachineLoop *> NestedLoops;
lib/Target/Hexagon/HexagonLoopIdiomRecognition.cpp 191 std::deque<Value*> Q;
lib/Target/Mips/Mips16ISelLowering.cpp 413 std::deque< std::pair<unsigned, SDValue> > &RegsToPass,
lib/Target/Mips/Mips16ISelLowering.h 48 std::deque< std::pair<unsigned, SDValue> > &RegsToPass,
lib/Target/Mips/MipsISelLowering.cpp 2907 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
3120 std::deque<std::pair<unsigned, SDValue>> RegsToPass;
4228 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
lib/Target/Mips/MipsISelLowering.h 501 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
587 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
lib/Target/Mips/MipsSEISelLowering.cpp 1163 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
lib/Target/Mips/MipsSEISelLowering.h 69 std::deque<std::pair<unsigned, SDValue>> &RegsToPass,
lib/Target/X86/X86WinEHState.cpp 671 std::deque<BasicBlock *> Worklist;
lib/Transforms/Scalar/EarlyCSE.cpp 1271 std::deque<StackNode *> nodesToProcess;
lib/Transforms/Scalar/Float2Int.cpp 186 std::deque<Instruction*> Worklist(Roots.begin(), Roots.end());
tools/clang/include/clang/Analysis/PathDiagnostic.h 734 std::deque<std::string> OtherDesc;
805 using meta_iterator = std::deque<std::string>::const_iterator;
tools/clang/include/clang/Sema/Sema.h 8199 std::deque<PendingImplicitInstantiation> PendingInstantiations;
8239 std::deque<PendingImplicitInstantiation> SavedPendingInstantiations;
8250 std::deque<PendingImplicitInstantiation> PendingLocalImplicitInstantiations;
8270 std::deque<PendingImplicitInstantiation>
tools/clang/include/clang/Serialization/ASTReader.h 1062 std::deque<InterestingDecl> PotentiallyInterestingDecls;
1092 std::deque<PendingDeclContextInfo> PendingDeclContextInfos;
tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/FunctionSummary.h 30 using SetOfDecls = std::deque<Decl *>;
tools/clang/lib/ASTMatchers/ASTMatchFinder.cpp 716 std::deque<ast_type_traits::DynTypedNode> Queue(Parents.begin(),
tools/clang/lib/Format/UnwrappedLineFormatter.cpp 1027 std::deque<StateNode *> Path;
tools/clang/lib/Sema/AnalysisBasedWarnings.cpp 1056 std::deque<const CFGBlock *> BlockQueue;
1089 std::deque<const CFGBlock*> BlockQueue(B.pred_begin(), B.pred_end());
tools/clang/lib/Serialization/ASTWriter.cpp 1802 std::deque<InputFileEntry> SortedFiles;
tools/clang/lib/StaticAnalyzer/Core/WorkList.cpp 57 std::deque<WorkListUnit> Queue;
92 std::deque<WorkListUnit> Queue;
tools/clang/tools/extra/clang-tidy/abseil/RedundantStrcatCallsCheck.cpp 84 std::deque<const CallExpr*> CallsToProcess = {RootCall};
tools/clang/tools/extra/clangd/ClangdLSPServer.cpp 435 std::deque<std::pair</*RequestID*/ int,
tools/clang/tools/extra/clangd/Selection.cpp 160 static std::deque<Node> collect(ASTContext &AST,
427 std::deque<Node> Nodes; // Stable pointers as we add more nodes.
tools/clang/tools/extra/clangd/Selection.h 124 std::deque<Node> Nodes; // Stable-pointer storage.
tools/clang/tools/extra/clangd/TUScheduler.cpp 270 std::deque<Request> Requests; /* GUARDED_BY(Mutex) */
tools/clang/tools/extra/clangd/unittests/BackgroundIndexTests.cpp 609 std::deque<std::string> VersionStorage;
tools/clang/utils/TableGen/NeonEmitter.cpp 526 std::map<std::string, std::deque<Intrinsic>> IntrinsicMap;
tools/lldb/source/Target/StackFrameRecognizer.cpp 147 std::deque<RegisteredEntry> m_recognizers;
tools/llvm-dwp/llvm-dwp.cpp 373 handleCompressedSection(std::deque<SmallString<32>> &UncompressedSections,
397 std::deque<SmallString<32>> &UncompressedSections,
533 std::deque<SmallString<32>> UncompressedSections;
tools/llvm-exegesis/lib/Clustering.cpp 148 SetVector<size_t, std::deque<size_t>> ToProcess;
tools/polly/lib/Analysis/ScopBuilder.cpp 1208 std::deque<RegionNode *> WorkList(RTraversal.begin(), RTraversal.end());
1209 std::deque<RegionNode *> DelayList;
tools/polly/lib/CodeGen/BlockGenerators.cpp 1492 std::deque<BasicBlock *> Blocks;
unittests/ADT/HashingTest.cpp 146 const std::deque<int> deque(begin(arr1), end(arr1));
usr/include/c++/7.4.0/bits/deque.tcc 91 deque<_Tp, _Alloc>&
93 operator=(const deque& __x)
183 typename deque<_Tp, _Alloc>::iterator
206 typename deque<_Tp, _Alloc>::iterator
231 typename deque<_Tp, _Alloc>::iterator
254 typename deque<_Tp, _Alloc>::iterator
384 return std::__shrink_to_fit_aux<deque>::_S_do_it(*this);
630 typename deque<_Tp, _Alloc>::iterator
usr/include/c++/7.4.0/bits/stl_deque.h 947 deque(const deque& __x)
962 deque(deque&& __x)
966 deque(const deque& __x, const allocator_type& __a)
973 deque(deque&& __x, const allocator_type& __a)
1056 deque&
1057 operator=(const deque& __x);
1068 deque&
1069 operator=(deque&& __x) noexcept(_Alloc_traits::_S_always_equal())
1087 deque&
1822 swap(deque& __x) _GLIBCXX_NOEXCEPT
2172 _M_move_assign1(deque&& __x, /* always equal: */ true_type) noexcept
2183 _M_move_assign1(deque&& __x, /* always equal: */ false_type)
2197 deque __newobj(std::forward<_Args>(__args)...);
2210 _M_move_assign2(deque&& __x, /* propagate: */ true_type)
2224 _M_move_assign2(deque&& __x, /* propagate: */ false_type)
2258 operator==(const deque<_Tp, _Alloc>& __x,
2259 const deque<_Tp, _Alloc>& __y)
2276 operator<(const deque<_Tp, _Alloc>& __x,
2277 const deque<_Tp, _Alloc>& __y)
2284 operator!=(const deque<_Tp, _Alloc>& __x,
2285 const deque<_Tp, _Alloc>& __y)
2291 operator>(const deque<_Tp, _Alloc>& __x,
2292 const deque<_Tp, _Alloc>& __y)
2298 operator<=(const deque<_Tp, _Alloc>& __x,
2299 const deque<_Tp, _Alloc>& __y)
2305 operator>=(const deque<_Tp, _Alloc>& __x,
2306 const deque<_Tp, _Alloc>& __y)
2312 swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y)
2312 swap(deque<_Tp,_Alloc>& __x, deque<_Tp,_Alloc>& __y)
utils/TableGen/AsmWriterEmitter.cpp 500 const std::deque<CodeGenRegister> &Registers) {
utils/TableGen/CodeGenRegisters.h 527 std::deque<CodeGenSubRegIndex> SubRegIndices;
537 std::deque<CodeGenRegister> Registers;
622 const std::deque<CodeGenSubRegIndex> &getSubRegIndices() const {
638 const std::deque<CodeGenRegister> &getRegisters() { return Registers; }
utils/TableGen/DFAEmitter.cpp 286 std::deque<uint64_t> Worklist(1, 0);
utils/TableGen/DFAPacketizerEmitter.cpp 470 std::deque<unsigned> V(1, State);
512 std::deque<NfaStateTy> Worklist(1, 0);
utils/TableGen/GlobalISelEmitter.cpp 988 using PredicatesTy = std::deque<std::unique_ptr<PredicateTy>>;
utils/TableGen/RegisterInfoEmitter.cpp 86 void EmitRegMapping(raw_ostream &o, const std::deque<CodeGenRegister> &Regs,
89 const std::deque<CodeGenRegister> &Regs,
371 raw_ostream &OS, const std::deque<CodeGenRegister> &Regs, bool isCtor) {
506 raw_ostream &OS, const std::deque<CodeGenRegister> &Regs, bool isCtor) {