| /freebsd/contrib/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 | 60 class NodeSet; variable
152 using NodeSetType = SmallVector<NodeSet, 8>;
309 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
328 class NodeSet {
341 NodeSet() = default;
342 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
388 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
420 bool operator>(const NodeSet &RHS) const {
431 bool operator==(const NodeSet &RHS) const {
436 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 = 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);
|
| /freebsd/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 | 154 using NodeSet = MachineGadgetGraph::NodeSet; typedef in __anond4b80a110111::X86LoadValueInjectionLoadHardeningPass
170 NodeSet &ElimNodes /* in, out */) const;
368 rdf::NodeSet Uses; in getGadgetGraph()
542 NodeSet &ElimNodes /* in, out */) const { in elimMitigatedEdgesAndNodes()
559 NodeSet ReachableNodes{G}; in elimMitigatedEdgesAndNodes()
597 NodeSet ElimNodes{*Graph}; in trimMitigatedEdges()
650 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
|
| /freebsd/contrib/llvm-project/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;
444 NodeSet &Nodes) { in nodes_for_root()
463 using NodeSymRel = std::set<NodeSet>;
469 static const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) { in node_class()
470 for (const NodeSet &S : Rel) in node_class()
537 using NodeSetMap = std::map<unsigned, NodeSet>; in common()
550 NodeSet &S = I.second; in common()
551 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) { in common()
[all …]
|
| H A D | HexagonISelDAGToDAGHVX.cpp | 136 using NodeSet = std::set<Node>; typedef
137 std::map<Node,NodeSet> Edges;
149 std::pair<bool, ColorKind> getUniqueColor(const NodeSet &Nodes);
156 std::pair<bool, ColorKind> Coloring::getUniqueColor(const NodeSet &Nodes) { in getUniqueColor()
189 NodeSet &Is = Edges[I]; in build()
201 NodeSet &Ns = Edges[Q[I]]; in color()
212 NodeSet &Ns = Edges[N]; in color()
240 NodeSet &Ns = Edges[N]; in color()
251 NodeSet &Cs = Edges[C]; in color()
252 NodeSet CopyN in color()
[all...] |
| H A D | HexagonOptAddrMode.cpp | 221 NodeSet Visited, Defs; in allValidCandidates()
|
| /freebsd/contrib/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 Liveness::getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode *> DefA, in getAllReachedUses()
416 NodeSet Uses; in getAllReachedUses()
446 NodeSet T; in getAllReachedUses()
[all …]
|
| H A D | MachinePipeliner.cpp | 638 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
1611 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1722 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1928 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1950 const NodeSet *S = nullptr) { in pred_L()
1979 const NodeSet *S = nullptr) { in succ_L()
2034 NodeSet &NS) { in computeLiveOuts()
2119 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
2124 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
2166 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
[all …]
|
| H A D | RDFGraph.cpp | 185 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1035 NodeSet Visited; in pushClobbers()
1081 NodeSet Visited; in pushDefs()
|