Home
last modified time | relevance | path

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

12

/external/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h172 struct BlockNode {
176 bool operator==(const BlockNode &X) const { return Index == X.Index; }
177 bool operator!=(const BlockNode &X) const { return Index != X.Index; }
178 bool operator<=(const BlockNode &X) const { return Index <= X.Index; }
179 bool operator>=(const BlockNode &X) const { return Index >= X.Index; }
180 bool operator<(const BlockNode &X) const { return Index < X.Index; }
181 bool operator>(const BlockNode &X) const { return Index > X.Index; }
183 BlockNode() : Index(UINT32_MAX) {}
184 BlockNode(IndexType Index) : Index(Index) {}
201 typedef SmallVector<std::pair<BlockNode, BlockMass>, 4> ExitMap;
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h182 struct BlockNode { struct
187 BlockNode() : Index(std::numeric_limits<uint32_t>::max()) {} in BlockNode() function
188 BlockNode(IndexType Index) : Index(Index) {} in BlockNode() argument
190 bool operator==(const BlockNode &X) const { return Index == X.Index; }
191 bool operator!=(const BlockNode &X) const { return Index != X.Index; }
192 bool operator<=(const BlockNode &X) const { return Index <= X.Index; }
193 bool operator>=(const BlockNode &X) const { return Index >= X.Index; }
194 bool operator<(const BlockNode &X) const { return Index < X.Index; }
195 bool operator>(const BlockNode &X) const { return Index > X.Index; }
215 using ExitMap = SmallVector<std::pair<BlockNode, BlockMass>, 4>; argument
[all …]
/external/llvm-project/llvm/include/llvm/Analysis/
DBlockFrequencyInfoImpl.h186 struct BlockNode { struct
191 BlockNode() : Index(std::numeric_limits<uint32_t>::max()) {} in BlockNode() argument
192 BlockNode(IndexType Index) : Index(Index) {} in BlockNode() function
194 bool operator==(const BlockNode &X) const { return Index == X.Index; }
195 bool operator!=(const BlockNode &X) const { return Index != X.Index; }
196 bool operator<=(const BlockNode &X) const { return Index <= X.Index; }
197 bool operator>=(const BlockNode &X) const { return Index >= X.Index; }
198 bool operator<(const BlockNode &X) const { return Index < X.Index; }
199 bool operator>(const BlockNode &X) const { return Index > X.Index; }
219 using ExitMap = SmallVector<std::pair<BlockNode, BlockMass>, 4>; argument
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp68 using BlockNode = BlockFrequencyInfoImplBase::BlockNode; typedef
123 void Distribution::add(const BlockNode &Node, uint64_t Amount, in add()
179 using HashTable = DenseMap<BlockNode::IndexType, Weight>; in combineWeightsByHashing()
292 const BlockNode &Pred, in addToDist()
293 const BlockNode &Succ, in addToDist()
298 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist()
302 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); in addToDist()
404 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
414 const DitheringDistributer &D, const BlockNode &T, in debugAssign()
425 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source, in distributeMass()
[all …]
/external/llvm-project/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp74 using BlockNode = BlockFrequencyInfoImplBase::BlockNode; typedef
129 void Distribution::add(const BlockNode &Node, uint64_t Amount, in add()
185 using HashTable = DenseMap<BlockNode::IndexType, Weight>; in combineWeightsByHashing()
298 const BlockNode &Pred, in addToDist()
299 const BlockNode &Succ, in addToDist()
304 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist()
308 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); in addToDist()
410 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
420 const DitheringDistributer &D, const BlockNode &T, in debugAssign()
431 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source, in distributeMass()
[all …]
/external/llvm/lib/Analysis/
DBlockFrequencyInfoImpl.cpp48 typedef BlockFrequencyInfoImplBase::BlockNode BlockNode; typedef
103 void Distribution::add(const BlockNode &Node, uint64_t Amount, in add()
159 typedef DenseMap<BlockNode::IndexType, Weight> HashTable; in combineWeightsByHashing()
268 const BlockNode &Pred, in addToDist()
269 const BlockNode &Succ, in addToDist()
274 auto isLoopHeader = [&OuterLoop](const BlockNode &Node) { in addToDist()
278 BlockNode Resolved = Working[Succ.Index].getResolvedNode(); in addToDist()
379 for (const BlockNode &M : Loop.Nodes) { in packageLoop()
389 const DitheringDistributer &D, const BlockNode &T, in debugAssign()
400 void BlockFrequencyInfoImplBase::distributeMass(const BlockNode &Source, in distributeMass()
[all …]
/external/llvm/lib/Target/Hexagon/
DRDFGraph.h580 struct BlockNode : public CodeNode { struct
591 NodeAddr<BlockNode*> findBlock(const MachineBasicBlock *BB, argument
593 NodeAddr<BlockNode*> getEntryBlock(const DataFlowGraph &G);
746 RegisterRef RR, NodeAddr<BlockNode*> PredB,
752 NodeAddr<PhiNode*> newPhi(NodeAddr<BlockNode*> Owner);
753 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
755 NodeAddr<BlockNode*> newBlock(NodeAddr<FuncNode*> Owner,
766 void buildStmt(NodeAddr<BlockNode*> BA, MachineInstr &In);
767 void buildBlockRefs(NodeAddr<BlockNode*> BA, BlockRefsMap &RefM);
769 NodeAddr<BlockNode*> BA);
[all …]
DRDFGraph.cpp236 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
274 OS << PrintNode<BlockNode*>(I, P.G) << '\n'; in operator <<()
516 void BlockNode::addPhi(NodeAddr<PhiNode*> PA, const DataFlowGraph &G) { in addPhi()
546 NodeAddr<BlockNode*> FuncNode::findBlock(const MachineBasicBlock *BB, in findBlock()
549 return NodeAddr<BlockNode*>(NA).Addr->getCode() == BB; in findBlock()
554 return NodeAddr<BlockNode*>(); in findBlock()
558 NodeAddr<BlockNode*> FuncNode::getEntryBlock(const DataFlowGraph &G) { in getEntryBlock()
878 RegisterRef RR, NodeAddr<BlockNode*> PredB, uint16_t Flags) { in newPhiUse()
901 NodeAddr<PhiNode*> DataFlowGraph::newPhi(NodeAddr<BlockNode*> Owner) { in newPhi()
907 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
[all …]
DRDFDeadCode.cpp117 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) in collect()
146 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in collect()
221 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in erase()
DRDFLiveness.cpp142 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
330 for (NodeAddr<BlockNode*> BA : Blocks) { in computePhiInfo()
530 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in computeLiveIns()
568 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
586 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
601 auto PrA = DFG.addr<BlockNode*>(UA.Addr->getPredecessor()); in computeLiveIns()
843 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in traverse()
873 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in traverse()
DHexagonOptAddrMode.cpp77 bool processBlock(NodeAddr<BlockNode *> BA);
506 bool HexagonOptAddrMode::processBlock(NodeAddr<BlockNode *> BA) { in processBlock()
641 for (NodeAddr<BlockNode *> BA : FA.Addr->members(*DFG)) in runOnMachineFunction()
/external/llvm-project/llvm/include/llvm/CodeGen/
DRDFGraph.h626 struct BlockNode : public CodeNode { struct
639 NodeAddr<BlockNode*> findBlock(const MachineBasicBlock *BB, argument
641 NodeAddr<BlockNode*> getEntryBlock(const DataFlowGraph &G);
764 NodeAddr<BlockNode*> findBlock(MachineBasicBlock *BB) const { in findBlock()
823 RegisterRef RR, NodeAddr<BlockNode*> PredB,
829 NodeAddr<PhiNode*> newPhi(NodeAddr<BlockNode*> Owner);
830 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
832 NodeAddr<BlockNode*> newBlock(NodeAddr<FuncNode*> Owner,
843 void buildStmt(NodeAddr<BlockNode*> BA, MachineInstr &In);
844 void recordDefsForDF(BlockRefsMap &PhiM, NodeAddr<BlockNode*> BA);
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFGraph.h626 struct BlockNode : public CodeNode { struct
639 NodeAddr<BlockNode*> findBlock(const MachineBasicBlock *BB, argument
641 NodeAddr<BlockNode*> getEntryBlock(const DataFlowGraph &G);
768 NodeAddr<BlockNode*> findBlock(MachineBasicBlock *BB) const { in findBlock()
827 RegisterRef RR, NodeAddr<BlockNode*> PredB,
833 NodeAddr<PhiNode*> newPhi(NodeAddr<BlockNode*> Owner);
834 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
836 NodeAddr<BlockNode*> newBlock(NodeAddr<FuncNode*> Owner,
847 void buildStmt(NodeAddr<BlockNode*> BA, MachineInstr &In);
848 void recordDefsForDF(BlockRefsMap &PhiM, NodeAddr<BlockNode*> BA);
[all …]
DRDFGraph.cpp266 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
302 OS << PrintNode<BlockNode*>(I, P.G) << '\n'; in operator <<()
546 void BlockNode::addPhi(NodeAddr<PhiNode*> PA, const DataFlowGraph &G) { in addPhi()
576 NodeAddr<BlockNode*> FuncNode::findBlock(const MachineBasicBlock *BB, in findBlock()
579 return NodeAddr<BlockNode*>(NA).Addr->getCode() == BB; in findBlock()
584 return NodeAddr<BlockNode*>(); in findBlock()
588 NodeAddr<BlockNode*> FuncNode::getEntryBlock(const DataFlowGraph &G) { in getEntryBlock()
814 RegisterRef RR, NodeAddr<BlockNode*> PredB, uint16_t Flags) { in newPhiUse()
837 NodeAddr<PhiNode*> DataFlowGraph::newPhi(NodeAddr<BlockNode*> Owner) { in newPhi()
843 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
[all …]
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()
232 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in erase()
DRDFLiveness.cpp174 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
324 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in getNearestAliasedRef()
363 BA = NodeAddr<BlockNode*>(); in getNearestAliasedRef()
431 for (NodeAddr<BlockNode*> BA : Blocks) { in computePhiInfo()
686 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in computeLiveIns()
724 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
742 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
768 auto PrA = DFG.addr<BlockNode*>(PUA.Addr->getPredecessor()); in computeLiveIns()
1002 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in traverse()
1036 NodeAddr<BlockNode*> BTA = ITA.Addr->getOwner(DFG); in traverse()
DRDFCopy.cpp70 NodeAddr<BlockNode*> BA = DFG.findBlock(B); in scanBlock()
DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
687 bool HexagonOptAddrMode::processBlock(NodeAddr<BlockNode *> BA) { in processBlock()
806 for (NodeAddr<BlockNode *> BA : FA.Addr->members(*DFG)) in runOnMachineFunction()
DHexagonRDFOpt.cpp163 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in run()
/external/llvm-project/llvm/lib/CodeGen/
DRDFGraph.cpp266 const Print<NodeAddr<BlockNode*>> &P) { in operator <<()
302 OS << PrintNode<BlockNode*>(I, P.G) << '\n'; in operator <<()
546 void BlockNode::addPhi(NodeAddr<PhiNode*> PA, const DataFlowGraph &G) { in addPhi()
576 NodeAddr<BlockNode*> FuncNode::findBlock(const MachineBasicBlock *BB, in findBlock()
579 return NodeAddr<BlockNode*>(NA).Addr->getCode() == BB; in findBlock()
584 return NodeAddr<BlockNode*>(); in findBlock()
588 NodeAddr<BlockNode*> FuncNode::getEntryBlock(const DataFlowGraph &G) { in getEntryBlock()
816 RegisterRef RR, NodeAddr<BlockNode*> PredB, uint16_t Flags) { in newPhiUse()
839 NodeAddr<PhiNode*> DataFlowGraph::newPhi(NodeAddr<BlockNode*> Owner) { in newPhi()
845 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
[all …]
DRDFLiveness.cpp168 NodeAddr<BlockNode*> BA = PA.Addr->getOwner(DFG); in getAllReachingDefs()
364 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in getNearestAliasedRef()
403 BA = NodeAddr<BlockNode*>(); in getNearestAliasedRef()
471 for (NodeAddr<BlockNode*> BA : Blocks) { in computePhiInfo()
743 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in computeLiveIns()
781 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
799 for (NodeAddr<BlockNode*> BA : Blocks) { in computeLiveIns()
825 auto PrA = DFG.addr<BlockNode*>(PUA.Addr->getPredecessor()); in computeLiveIns()
1059 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in traverse()
1093 NodeAddr<BlockNode*> BTA = ITA.Addr->getOwner(DFG); in traverse()
/external/llvm-project/llvm/lib/Target/Hexagon/
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()
232 NodeAddr<BlockNode*> BA = IA.Addr->getOwner(DFG); in erase()
DRDFCopy.cpp70 NodeAddr<BlockNode*> BA = DFG.findBlock(B); in scanBlock()
DHexagonOptAddrMode.cpp91 bool processBlock(NodeAddr<BlockNode *> BA);
688 bool HexagonOptAddrMode::processBlock(NodeAddr<BlockNode *> BA) { in processBlock()
807 for (NodeAddr<BlockNode *> BA : FA.Addr->members(*DFG)) in runOnMachineFunction()
DHexagonRDFOpt.cpp163 for (NodeAddr<BlockNode*> BA : DFG.getFunc().Addr->members(DFG)) { in run()

12