Home
last modified time | relevance | path

Searched refs:CycleT (Results 1 – 4 of 4) sorted by relevance

/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h111 using CycleT = typename CycleInfoT::CycleT; variable
140 static void updateDepth(CycleT *SubTree);
148 -> CycleT * {
212 std::unique_ptr<CycleT> NewCycle = std::make_unique<CycleT>(); in run()
291 for (CycleT *Cycle : depth_first(SubTree)) in updateDepth()
373 -> CycleT * {
386 CycleT *Cycle = getCycle(Block); in getCycleDepth()
415 for (const CycleT *Cycle : depth_first(TLC)) { in validateTree()
435 for (const CycleT *Child : Cycle->children()) { in validateTree()
448 for (const CycleT *Cycle = Entry.second; Cycle; in validateTree()
[all …]
H A DGenericCycleInfo.h227 using CycleT = GenericCycle<ContextT>; variable
236 DenseMap<BlockT *, CycleT *> BlockMap;
239 DenseMap<BlockT *, CycleT *> BlockMapTopLevel;
245 std::vector<std::unique_ptr<CycleT>> TopLevelCycles;
251 void moveTopLevelCycleToNewParent(CycleT *NewParent, CycleT *Child);
264 CycleT *getCycle(const BlockT *Block) const;
266 CycleT *getTopLevelParentCycle(BlockT *Block);
280 typename std::vector<std::unique_ptr<CycleT>>::const_iterator;
292 CycleT *operator*() const { return Base::I->get(); }
/llvm-project-15.0.7/llvm/include/llvm/CodeGen/
H A DMachineCycleAnalysis.h28 using MachineCycle = MachineCycleInfo::CycleT;
/llvm-project-15.0.7/llvm/include/llvm/Analysis/
H A DCycleAnalysis.h28 using Cycle = CycleInfo::CycleT;