| /freebsd-13.1/contrib/llvm-project/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 | 53 class NodeSet; variable
138 using NodeSetType = SmallVector<NodeSet, 8>;
292 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
311 class NodeSet {
324 NodeSet() = default;
325 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
371 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
403 bool operator>(const NodeSet &RHS) const {
414 bool operator==(const NodeSet &RHS) const {
419 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); }
|
| H A D | RegAllocPBQP.h | 436 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
458 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
464 NodeSet::iterator NItr = in reduce()
496 using NodeSet = std::set<NodeId>; variable
497 NodeSet OptimallyReducibleNodes;
498 NodeSet ConservativelyAllocatableNodes;
499 NodeSet NotProvablyAllocatableNodes;
|
| H A D | RDFGraph.h | 513 using NodeSet = std::set<NodeId>; variable
945 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeSet> &P);
|
| /freebsd-13.1/contrib/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 | 155 using NodeSet = MachineGadgetGraph::NodeSet; typedef in __anon6c45a0450111::X86LoadValueInjectionLoadHardeningPass
171 NodeSet &ElimNodes /* in, out */) const;
369 rdf::NodeSet Uses; in getGadgetGraph()
544 NodeSet &ElimNodes /* in, out */) const { in elimMitigatedEdgesAndNodes()
561 NodeSet ReachableNodes{G}; in elimMitigatedEdgesAndNodes()
600 NodeSet ElimNodes{*Graph}; in trimMitigatedEdges()
653 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | HexagonCommonGEP.cpp | 72 using NodeSet = std::set<GepNode *>; typedef
311 in_set(const NodeSet &S) : NS(S) {} in in_set()
318 const NodeSet &NS;
454 NodeSet &Nodes) { in nodes_for_root()
473 using NodeSymRel = std::set<NodeSet>;
562 NodeSet &S = I->second; in common()
572 NodeSet C; in common()
595 const NodeSet &S = *I; in common()
609 const NodeSet &S = *I; in common()
657 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()
235 NodeSet &Ns = Edges[N]; in color()
246 NodeSet &Cs = Edges[C]; in color()
247 NodeSet CopyNs = Ns; in color()
|
| H A D | HexagonOptAddrMode.cpp | 217 NodeSet Visited, Defs; in allValidCandidates()
|
| /freebsd-13.1/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RDFLiveness.cpp | 308 std::pair<NodeSet,bool>
310 NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
314 std::pair<NodeSet,bool>
316 NodeSet &Visited, const NodeSet &Defs, unsigned Nest, unsigned MaxNest) { in getAllReachingDefsRecImpl()
333 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
337 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
421 NodeSet Uses; in getAllReachedUses()
451 NodeSet T; in getAllReachedUses()
491 NodeSet PhiDefs; in computePhiInfo()
590 NodeSet SeenUses; in computePhiInfo()
[all …]
|
| H A D | MachinePipeliner.cpp | 1175 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1501 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1523 const NodeSet *S = nullptr) { in pred_L()
1607 NodeSet &NS) { in computeLiveOuts()
1695 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
1700 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
1742 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
1770 NodeSet NewSet; in groupRemainingNodes()
1833 NodeSet &NI = *I; in fuseRecs()
1835 NodeSet &NJ = *J; in fuseRecs()
[all …]
|
| H A D | RDFGraph.cpp | 184 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1028 NodeSet Visited; in pushClobbers()
1072 NodeSet Visited; in pushDefs()
|