| /external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/Hexagon/ |
| D | RDFLiveness.h | 71 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,
|
| D | HexagonCommonGEP.cpp | 70 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>;
473 static const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) { in node_class()
538 using NodeSetMap = std::map<unsigned, NodeSet>; in common()
553 NodeSet &S = I->second; in common()
554 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) { in common()
563 NodeSet C; in common()
[all …]
|
| D | RDFLiveness.cpp | 270 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()
280 return { NodeSet(), false }; in getAllReachingDefsRecImpl()
295 NodeSet TmpDefs = Defs; in getAllReachingDefsRecImpl()
299 NodeSet Result = Defs; in getAllReachingDefsRecImpl()
381 NodeSet Liveness::getAllReachedUses(RegisterRef RefRR, in getAllReachedUses()
383 NodeSet Uses; in getAllReachedUses()
413 NodeSet T; in getAllReachedUses()
[all …]
|
| 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()
|
| D | RDFGraph.cpp | 193 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1050 NodeSet Visited; in pushClobbers()
1094 NodeSet Visited; in pushDefs()
|
| D | RDFGraph.h | 514 using NodeSet = std::set<NodeId>; variable
|
| D | HexagonOptAddrMode.cpp | 217 NodeSet Visited, Defs; in allValidCandidates()
|
| /external/apache-xml/src/main/java/org/apache/xpath/ |
| D | NodeSet.java | 59 public class NodeSet class
66 public NodeSet() in NodeSet() method in NodeSet
77 public NodeSet(int blocksize) in NodeSet() method in NodeSet
89 public NodeSet(NodeList nodelist) in NodeSet() method in NodeSet
103 public NodeSet(NodeSet nodelist) in NodeSet() method in NodeSet
117 public NodeSet(NodeIterator ni) in NodeSet() method in NodeSet
130 public NodeSet(Node node) in NodeSet() method in NodeSet
160 NodeSet clone = (NodeSet) clone(); in cloneWithReset()
471 public void addNodes(NodeSet ns) in addNodes()
848 NodeSet clone = (NodeSet) super.clone(); in clone()
[all …]
|
| /external/llvm/lib/Target/Hexagon/ |
| D | RDFLiveness.h | 34 typedef std::map<RegisterRef,NodeSet> RefMap;
43 NodeSet getAllReachingDefsRec(RegisterRef RefRR, NodeAddr<RefNode*> RefA,
44 NodeSet &Visited, const NodeSet &Defs);
45 NodeSet getAllReachedUses(RegisterRef RefRR, NodeAddr<DefNode*> DefA,
|
| D | HexagonCommonGEP.cpp | 53 typedef std::set<GepNode*> NodeSet; typedef
281 in_set(const NodeSet &S) : NS(S) {} in in_set()
286 const NodeSet &NS;
427 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) { in nodes_for_root()
447 typedef std::set<NodeSet> NodeSymRel;
451 const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) { in node_class()
517 typedef std::map<unsigned,NodeSet> NodeSetMap; in common()
532 NodeSet &S = I->second; in common()
533 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) { in common()
542 NodeSet C; in common()
[all …]
|
| D | RDFLiveness.cpp | 240 NodeSet Liveness::getAllReachingDefsRec(RegisterRef RefRR, in getAllReachingDefsRec()
241 NodeAddr<RefNode*> RefA, NodeSet &Visited, const NodeSet &Defs) { in getAllReachingDefsRec()
256 NodeSet TmpDefs = Defs; in getAllReachingDefsRec()
260 NodeSet Result = Defs; in getAllReachingDefsRec()
281 NodeSet Liveness::getAllReachedUses(RegisterRef RefRR, in getAllReachedUses()
283 NodeSet Uses; in getAllReachedUses()
309 NodeSet T; in getAllReachedUses()
349 NodeSet PhiDefs; in computePhiInfo()
838 NodeSet Rest; in traverse()
|
| D | RDFGraph.h | 474 typedef std::set<NodeId> NodeSet; typedef
|
| D | HexagonOptAddrMode.cpp | 195 NodeSet Visited, Defs; in allValidCandidates()
|
| D | RDFGraph.cpp | 170 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeSet> &P) { in operator <<()
1007 NodeSet Visited; in pushDefs()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 435 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;
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 500 NodeSet::iterator NItr = OptimallyReducibleNodes.begin(); in reduce()
522 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin(); in reduce()
529 NodeSet::iterator NItr = in reduce()
559 typedef std::set<NodeId> NodeSet; typedef
560 NodeSet OptimallyReducibleNodes;
561 NodeSet ConservativelyAllocatableNodes;
562 NodeSet NotProvablyAllocatableNodes;
|
| /external/tensorflow/tensorflow/compiler/jit/graphcycles/ |
| D | graphcycles.cc | 44 typedef std::unordered_set<int32> NodeSet; typedef
58 NodeSet in; // List of immediate predecessor nodes in graph
59 NodeSet out; // List of immediate successor nodes in graph
87 NodeSet ranks; // Set of ranks seen so far. in CheckInvariants()
302 NodeSet seen; in FindPath()
|
| /external/llvm/lib/CodeGen/ |
| D | MachinePipeliner.cpp | 144 class NodeSet;
222 typedef SmallVector<NodeSet, 8> NodeSetType;
362 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
420 class NodeSet { class
432 NodeSet() : Nodes(), HasRecurrence(false) {} in NodeSet() function in __anon5f28c6f30111::NodeSet
434 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) {} in NodeSet() function in __anon5f28c6f30111::NodeSet
462 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
490 bool operator>(const NodeSet &RHS) const { in operator >()
501 bool operator==(const NodeSet &RHS) const { in operator ==()
506 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); } in operator !=()
[all …]
|
| /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/ |
| D | MachinePipeliner.cpp | 176 class NodeSet;
259 using NodeSetType = SmallVector<NodeSet, 8>;
399 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
459 class NodeSet { class
472 NodeSet() = default;
473 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) { in NodeSet() function in __anona194c52b0111::NodeSet
507 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; } in compareRecMII()
539 bool operator>(const NodeSet &RHS) const { in operator >()
550 bool operator==(const NodeSet &RHS) const { in operator ==()
555 bool operator!=(const NodeSet &RHS) const { return !operator==(RHS); } in operator !=()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/dtm/ref/ |
| D | DTMNodeProxy.java | 27 import org.apache.xpath.NodeSet;
764 NodeSet nodeSet = new NodeSet(size); in getElementsByTagName()
889 NodeSet nodeSet = new NodeSet(size); in getElementsByTagNameNS()
|
| /external/v8/src/compiler/ |
| D | node.h | 308 typedef ZoneSet<Node*> NodeSet; typedef
|
| /external/libxml2/os400/libxmlrpg/ |
| D | xpathInternals.rpgle | 99 * NodeSet handling.
|