| /llvm-project-15.0.7/llvm/include/llvm/CodeGen/ |
| H A D | RDFLiveness.h | 95 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
98 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) {
102 std::pair<NodeSet,bool> getAllReachingDefsRec(RegisterRef RefRR,
103 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
164 std::pair<NodeSet,bool> getAllReachingDefsRecImpl(RegisterRef RefRR,
165 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
|
| H A D | MachinePipeliner.h | 57 class NodeSet; variable
145 using NodeSetType = SmallVector<NodeSet, 8>;
301 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
320 class NodeSet {
333 NodeSet() = default;
334 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
380 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
412 bool operator>(const NodeSet &RHS) const {
423 bool operator==(const NodeSet &RHS) const {
428 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); }
|
| H A D | RegAllocPBQP.h | 437 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
459 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
465 NodeSet::iterator NItr = in reduce()
497 using NodeSet = std::set<NodeId>; variable
498 NodeSet OptimallyReducibleNodes;
499 NodeSet ConservativelyAllocatableNodes;
500 NodeSet NotProvablyAllocatableNodes;
|
| H A D | RDFGraph.h | 513 using NodeSet = std::set<NodeId>; variable
944 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeSet> &P);
|
| /llvm-project-15.0.7/llvm/lib/Target/X86/ |
| H A D | ImmutableGraph.h | 111 class NodeSet {
116 NodeSet(const ImmutableGraph &G, bool ContainsAll = false)
139 NodeSet &operator|=(const NodeSet &RHS) {
145 NodeSet &operator&=(const NodeSet &RHS) {
151 NodeSet &operator^=(const NodeSet &RHS) {
164 const NodeSet &Set;
173 iterator(const NodeSet &Set, size_type Begin) in iterator()
303 using NodeSet = typename GraphT::NodeSet; variable
354 static std::unique_ptr<GraphT> trim(const GraphT &G, const NodeSet &TrimNodes, in trim()
|
| H A D | X86LoadValueInjectionLoadHardening.cpp | 155 using NodeSet = MachineGadgetGraph::NodeSet; typedef in __anon994a0f410111::X86LoadValueInjectionLoadHardeningPass
171 NodeSet &ElimNodes /* in, out */) const;
370 rdf::NodeSet Uses; in getGadgetGraph()
545 NodeSet &ElimNodes /* in, out */) const { in elimMitigatedEdgesAndNodes()
562 NodeSet ReachableNodes{G}; in elimMitigatedEdgesAndNodes()
600 NodeSet ElimNodes{*Graph}; in trimMitigatedEdges()
653 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
|
| /llvm-project-15.0.7/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 71 using NodeSet = std::set<GepNode *>; typedef
308 in_set(const NodeSet &S) : NS(S) {} in in_set()
315 const NodeSet &NS;
463 using NodeSymRel = std::set<NodeSet>;
470 for (const NodeSet &S : Rel) in node_class()
550 NodeSet &S = I.second; in common()
560 NodeSet C; in common()
581 for (const NodeSet &S : EqRel) { in common()
595 for (const NodeSet &S : EqRel) { in common()
641 NodeSet Erase; in common()
[all …]
|
| H A D | HexagonISelDAGToDAGHVX.cpp | 130 using NodeSet = std::set<Node>; typedef
131 std::map<Node,NodeSet> Edges;
143 std::pair<bool, ColorKind> getUniqueColor(const NodeSet &Nodes);
150 std::pair<bool, ColorKind> Coloring::getUniqueColor(const NodeSet &Nodes) { in getUniqueColor()
183 NodeSet &Is = Edges[I]; in build()
195 NodeSet &Ns = Edges[Q[I]]; in color()
206 NodeSet &Ns = Edges[N]; in color()
234 NodeSet &Ns = Edges[N]; in color()
245 NodeSet &Cs = Edges[C]; in color()
246 NodeSet CopyNs = Ns; in color()
|
| H A D | HexagonOptAddrMode.cpp | 219 NodeSet Visited, Defs; in allValidCandidates()
|
| /llvm-project-15.0.7/llvm/test/CodeGen/Hexagon/ |
| H A D | swp-carried-dep1.mir | 6 # CHECK: Rec NodeSet
7 # CHECK: Rec NodeSet
8 # CHECK: Rec NodeSet
9 # CHECK: Rec NodeSet
|
| H A D | swp-carried-dep2.mir | 7 # CHECK: Rec NodeSet
8 # CHECK: Rec NodeSet
|
| /llvm-project-15.0.7/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 307 std::pair<NodeSet,bool>
309 NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
313 std::pair<NodeSet,bool>
315 NodeSet &Visited, const NodeSet &Defs, unsigned Nest, unsigned MaxNest) { in getAllReachingDefsRecImpl()
332 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
336 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
419 NodeSet Uses; in getAllReachedUses()
449 NodeSet T; in getAllReachedUses()
489 NodeSet PhiDefs; in computePhiInfo()
588 NodeSet SeenUses; in computePhiInfo()
[all …]
|
| H A D | MachinePipeliner.cpp | 1173 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1490 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1512 const NodeSet *S = nullptr) { in pred_L()
1596 NodeSet &NS) { in computeLiveOuts()
1684 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
1689 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
1731 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
1759 NodeSet NewSet; in groupRemainingNodes()
1822 NodeSet &NI = *I; in fuseRecs()
1824 NodeSet &NJ = *J; in fuseRecs()
[all …]
|
| H A D | RDFGraph.cpp | 182 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1014 NodeSet Visited; in pushClobbers()
1058 NodeSet Visited; in pushDefs()
|