| /openbsd-src/gnu/llvm/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 | 58 class NodeSet; variable
147 using NodeSetType = SmallVector<NodeSet, 8>;
303 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
322 class NodeSet {
335 NodeSet() = default;
336 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
382 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
414 bool operator>(const NodeSet &RHS) const {
425 bool operator==(const NodeSet &RHS) const {
430 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 | 514 using NodeSet = std::set<NodeId>; variable
953 raw_ostream &operator<<(raw_ostream &OS, const Print<NodeSet> &P);
|
| /openbsd-src/gnu/llvm/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 __anonced864880111::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()
599 NodeSet ElimNodes{*Graph}; in trimMitigatedEdges()
652 Graph = GraphBuilder::trim(*Graph, NodeSet{*Graph}, CutEdges); in hardenLoadsWithPlugin()
|
| /openbsd-src/gnu/llvm/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 CopyNs = Ns; in color()
|
| H A D | HexagonOptAddrMode.cpp | 219 NodeSet Visited, Defs; in allValidCandidates()
|
| /openbsd-src/gnu/llvm/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()
317 return { NodeSet(), false }; in getAllReachingDefsRecImpl()
332 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
336 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
417 NodeSet Liveness::getAllReachedUses(RegisterRef RefRR, in getAllReachedUses()
419 NodeSet Uses; in getAllReachedUses()
449 NodeSet T; in getAllReachedUses()
[all …]
|
| H A D | MachinePipeliner.cpp | 565 llvm::stable_sort(NodeSets, std::greater<NodeSet>()); in schedule()
1130 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1241 NodeSets.push_back(NodeSet(Stack.begin(), Stack.end())); in circuit()
1447 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1469 const NodeSet *S = nullptr) { in pred_L()
1498 const NodeSet *S = nullptr) { in succ_L()
1553 NodeSet &NS) { in computeLiveOuts()
1641 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
1646 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
1688 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
[all …]
|
| H A D | RDFGraph.cpp | 182 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1017 NodeSet Visited; in pushClobbers()
1061 NodeSet Visited; in pushDefs()
|