| /llvm-project/llvm/include/llvm/CodeGen/ |
| H A D | RDFLiveness.h | 79 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode *> DefA,
82 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode *> DefA) {
86 std::pair<NodeSet, bool> getAllReachingDefsRec(RegisterRef RefRR,
88 NodeSet &Visited,
89 const NodeSet &Defs);
150 std::pair<NodeSet, bool>
152 NodeSet &Visited, const NodeSet &Defs,
|
| H A D | MachinePipeliner.h | 61 class NodeSet;
266 using NodeSetType = SmallVector<NodeSet, 8>;
407 void addConnectedNodes(SUnit *SU, NodeSet &NewSet, in clear()
424 /// A NodeSet contains a set of SUnit DAG nodes with additional information
426 class NodeSet {
439 NodeSet() = default; in end()
440 NodeSet(iterator S, iterator E, const SwingSchedulerDAG *DAG)
519 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; }
551 bool operator>(const NodeSet &RHS) const {
562 bool operator==(const NodeSet
60 class NodeSet; global() variable
342 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { NodeSet() function
[all...] |
| 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 = llvm::min_element(NotProvablyAllocatableNodes, in reduce()
495 using NodeSet = std::set<NodeId>; variable
496 NodeSet OptimallyReducibleNodes;
497 NodeSet ConservativelyAllocatableNodes;
498 NodeSet NotProvablyAllocatableNodes;
|
| H A D | RDFGraph.h | 551 using NodeSet = std::set<NodeId>; variable
981 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeSet> &P);
|
| /llvm-project/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 | 153 using NodeSet = MachineGadgetGraph::NodeSet;
169 NodeSet &ElimNodes /* in, out */) const;
367 rdf::NodeSet Uses; in getGadgetGraph()
541 NodeSet &ElimNodes /* in, out */) const { in elimMitigatedEdgesAndNodes()
558 NodeSet ReachableNodes{G}; in elimMitigatedEdgesAndNodes()
596 NodeSet ElimNodes{*Graph}; in trimMitigatedEdges()
649 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
154 using NodeSet = MachineGadgetGraph::NodeSet; global() typedef in __anonca6689240111::X86LoadValueInjectionLoadHardeningPass
|
| /llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 70 using NodeSet = std::set<GepNode *>;
307 in_set(const NodeSet &S) : NS(S) {}
314 const NodeSet &NS;
443 NodeSet &Nodes) { in nodes_for_root()
462 using NodeSymRel = std::set<NodeSet>;
468 static const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) {
469 for (const NodeSet &S : Rel) in node_class()
536 using NodeSetMap = std::map<unsigned, NodeSet>; in common()
549 NodeSet &S = I.second; in common()
550 for (NodeSet in common()
71 using NodeSet = std::set<GepNode *>; global() typedef
[all...] |
| H A D | HexagonISelDAGToDAGHVX.cpp | 132 using NodeSet = std::set<Node>;
133 std::map<Node,NodeSet> Edges;
145 std::pair<bool, ColorKind> getUniqueColor(const NodeSet &Nodes); in getColor()
152 std::pair<bool, ColorKind> Coloring::getUniqueColor(const NodeSet &Nodes) {
185 NodeSet &Is = Edges[I]; in build()
197 NodeSet &Ns = Edges[Q[I]]; in color()
208 NodeSet &Ns = Edges[N]; in color()
236 NodeSet &Ns = Edges[N]; in color()
247 NodeSet &Cs = Edges[C]; in color()
248 NodeSet CopyN in color()
136 using NodeSet = std::set<Node>; global() typedef
[all...] |
| H A D | HexagonOptAddrMode.cpp | 242 NodeSet Visited, Defs; in allValidCandidates()
|
| /llvm-project/llvm/test/CodeGen/Hexagon/ |
| H A D | swp-carried-dep3.mir | 6 # we check that we don't have the Rec NodeSet containing SU(5) and SU(7) which
7 # requires to use a single CHECK-NOT to match such a Rec NodeSet. Fortunately
10 # CHECK-NOT: Rec NodeSet{{.+[[:space:]]}} SU(5){{.+[[:space:]]}} SU(7)
|
| 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/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 303 std::pair<NodeSet, bool>
305 NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
309 std::pair<NodeSet, bool>
311 NodeSet &Visited, const NodeSet &Defs, in getAllReachingDefsRecImpl()
314 return {NodeSet(), false}; in getAllReachingDefsRecImpl()
329 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
333 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
414 NodeSet Livenes
[all...] |
| H A D | MachinePipeliner.cpp | 631 dbgs() << " Rec NodeSet "; in schedule()
636 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
644 dbgs() << " NodeSet "; in schedule()
1570 for (NodeSet &Nodes : NodeSets) { in detect()
1668 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end(), DAG)); in createAdjacencyStructure()
1859 for (NodeSet &I : NodeSets)
1881 const NodeSet *S = nullptr) { in computeNodeFunctions()
1917 const NodeSet *S = nullptr) { in computeNodeFunctions()
1981 NodeSet &NS) { in succ_L()
2064 NodeSet in registerPressureFilter()
[all...] |
| H A D | RDFGraph.cpp | 184 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeSet> &P) {
1034 NodeSet Visited; in pushClobbers()
1080 NodeSet Visited; in pushDefs()
|