Home
last modified time | relevance | path

Searched refs:NodeSet (Results 1 – 10 of 10) sorted by relevance

/freebsd-12.1/contrib/llvm/lib/Target/Hexagon/
H A DRDFLiveness.h71 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
74 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA) { in getAllReachedUses()
78 std::pair<NodeSet,bool> getAllReachingDefsRec(RegisterRef RefRR,
79 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs);
141 std::pair<NodeSet,bool> getAllReachingDefsRecImpl(RegisterRef RefRR,
142 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs,
H A DHexagonCommonGEP.cpp70 using NodeSet = std::set<GepNode *>; typedef
306 in_set(const NodeSet &S) : NS(S) {} in in_set()
313 const NodeSet &NS;
448 NodeSet &Nodes) { in nodes_for_root()
467 using NodeSymRel = std::set<NodeSet>;
553 NodeSet &S = I->second; in common()
563 NodeSet C; in common()
586 const NodeSet &S = *I; in common()
600 const NodeSet &S = *I; in common()
648 NodeSet Erase; in common()
[all …]
H A DRDFLiveness.cpp270 std::pair<NodeSet,bool>
272 NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
276 std::pair<NodeSet,bool>
278 NodeSet &Visited, const NodeSet &Defs, unsigned Nest, unsigned MaxNest) { in getAllReachingDefsRecImpl()
295 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
299 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
383 NodeSet Uses; in getAllReachedUses()
413 NodeSet T; in getAllReachedUses()
453 NodeSet PhiDefs; in computePhiInfo()
552 NodeSet SeenUses; in computePhiInfo()
[all …]
H A DHexagonISelDAGToDAGHVX.cpp130 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 DRDFGraph.cpp193 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1050 NodeSet Visited; in pushClobbers()
1094 NodeSet Visited; in pushDefs()
H A DRDFGraph.h514 using NodeSet = std::set<NodeId>; variable
H A DHexagonOptAddrMode.cpp217 NodeSet Visited, Defs; in allValidCandidates()
/freebsd-12.1/contrib/llvm/include/llvm/CodeGen/
H A DMachinePipeliner.h51 class NodeSet; variable
136 using NodeSetType = SmallVector<NodeSet, 8>;
293 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
353 class NodeSet {
366 NodeSet() = default;
367 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function
401 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
433 bool operator>(const NodeSet &RHS) const {
444 bool operator==(const NodeSet &RHS) const {
449 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); }
H A DRegAllocPBQP.h435 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
457 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
463 NodeSet::iterator NItr = in reduce()
495 using NodeSet = std::set<NodeId>; variable
496 NodeSet OptimallyReducibleNodes;
497 NodeSet ConservativelyAllocatableNodes;
498 NodeSet NotProvablyAllocatableNodes;
/freebsd-12.1/contrib/llvm/lib/CodeGen/
H A DMachinePipeliner.cpp877 for (NodeSet &Nodes : NodeSets) { in calculateRecMII()
1208 for (NodeSet &I : NodeSets) in computeNodeFunctions()
1230 const NodeSet *S = nullptr) { in pred_L()
1328 NodeSet &NS) { in computeLiveOuts()
1414 NodeSet &N1 = NodeSets[i]; in colocateNodeSets()
1419 NodeSet &N2 = NodeSets[j]; in colocateNodeSets()
1462 for (NodeSet &I : NodeSets) { in groupRemainingNodes()
1490 NodeSet NewSet; in groupRemainingNodes()
1554 NodeSet &NI = *I; in fuseRecs()
1556 NodeSet &NJ = *J; in fuseRecs()
[all …]