Home
last modified time | relevance | path

Searched refs:BlockNode (Results 1 – 11 of 11) sorted by relevance

/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DBlockFrequencyInfoImpl.h191 struct BlockNode { struct
196 BlockNode() : Index(std::numeric_limits<uint32_t>::max()) {} in BlockNode() argument
197 BlockNode(IndexType Index) : Index(Index) {} in BlockNode() function
199 bool operator==(const BlockNode &X) const { return Index == X.Index; }
200 bool operator!=(const BlockNode &X) const { return Index != X.Index; }
201 bool operator<=(const BlockNode &X) const { return Index <= X.Index; }
202 bool operator>=(const BlockNode &X) const { return Index >= X.Index; }
203 bool operator<(const BlockNode &X) const { return Index < X.Index; }
204 bool operator>(const BlockNode &X) const { return Index > X.Index; }
224 using ExitMap = SmallVector<std::pair<BlockNode, BlockMass>, 4>; argument
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Analysis/
H A DBlockFrequencyInfoImpl.cpp89 using BlockNode = BlockFrequencyInfoImplBase::BlockNode; typedef
144 void Distribution::add(const BlockNode &Node, uint64_t Amount, in add()
200 using HashTable = DenseMap<BlockNode::IndexType, Weight>; in combineWeightsByHashing()
313 const BlockNode &Pred, in addToDist()
314 const BlockNode &Succ, in addToDist()
319 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist()
323 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); in addToDist()
425 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
435 const DitheringDistributer &D, const BlockNode &T, in debugAssign()
446 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source, in distributeMass()
[all …]
/openbsd-src/gnu/llvm/llvm/include/llvm/CodeGen/
H A DRDFGraph.h627 struct BlockNode : public CodeNode { struct
640 NodeAddr<BlockNode*> findBlock(const MachineBasicBlock *BB, argument
642 NodeAddr<BlockNode*> getEntryBlock(const DataFlowGraph &G);
767 NodeAddr<BlockNode*> findBlock(MachineBasicBlock *BB) const { in findBlock()
826 RegisterRef RR, NodeAddr<BlockNode*> PredB,
832 NodeAddr<PhiNode*> newPhi(NodeAddr<BlockNode*> Owner);
833 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
835 NodeAddr<BlockNode*> newBlock(NodeAddr<FuncNode*> Owner,
846 void buildStmt(NodeAddr<BlockNode*> BA, MachineInstr &In);
847 void recordDefsForDF(BlockRefsMap &PhiM, NodeAddr<BlockNode*> BA);
[all …]
/openbsd-src/gnu/llvm/llvm/lib/CodeGen/
H A DRDFGraph.cpp264 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
300 OS << PrintNode<BlockNode*>(I, P.G) << '\n'; in operator <<()
544 void BlockNode::addPhi(NodeAddr<PhiNode*> PA, const DataFlowGraph &G) { in addPhi()
574 NodeAddr<BlockNode*> FuncNode::findBlock(const MachineBasicBlock *BB, in findBlock()
577 return NodeAddr<BlockNode*>(NA).Addr->getCode() == BB; in findBlock()
582 return NodeAddr<BlockNode*>(); in findBlock()
586 NodeAddr<BlockNode*> FuncNode::getEntryBlock(const DataFlowGraph &G) { in getEntryBlock()
817 RegisterRef RR, NodeAddr<BlockNode*> PredB, uint16_t Flags) { in newPhiUse()
840 NodeAddr<PhiNode*> DataFlowGraph::newPhi(NodeAddr<BlockNode*> Owner) { in newPhi()
846 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
[all …]
H A DRDFLiveness.cpp167 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
362 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in getNearestAliasedRef()
401 BA = NodeAddr<BlockNode*>(); in getNearestAliasedRef()
469 for (NodeAddr<BlockNode*> BA : Blocks) { in computePhiInfo()
740 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in computeLiveIns()
778 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
796 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
822 auto PrA = DFG.addr<BlockNode*>(PUA.Addr->getPredecessor()); in computeLiveIns()
1053 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in traverse()
1087 NodeAddr<BlockNode*> BTA = ITA.Addr->getOwner(DFG); in traverse()
/openbsd-src/gnu/llvm/llvm/lib/Target/Hexagon/
H A DRDFDeadCode.cpp128 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) in collect()
157 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in collect()
231 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in erase()
H A DRDFCopy.cpp70 NodeAddr<BlockNode*> BA = DFG.findBlock(B); in scanBlock()
H A DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
764 bool HexagonOptAddrMode::processBlock(NodeAddr<BlockNode *> BA) { in processBlock()
882 for (NodeAddr<BlockNode *> BA : FA.Addr->members(*DFG)) in runOnMachineFunction()
H A DHexagonRDFOpt.cpp163 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in run()
/openbsd-src/gnu/llvm/llvm/lib/Target/X86/
H A DX86LoadValueInjectionLoadHardening.cpp471 NodeAddr<BlockNode *> EntryBlock = DFG.getFunc().Addr->getEntryBlock(DFG); in getGadgetGraph()
478 for (NodeAddr<BlockNode *> BA : DFG.getFunc().Addr->members(DFG)) { in getGadgetGraph()
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DCodeExtractor.cpp1457 using BlockNode = BlockFrequencyInfoImplBase::BlockNode; in calculateNewCallTerminatorWeights() typedef
1471 BlockNode ExitNode(i); in calculateNewCallTerminatorWeights()