HomeSort by relevance Sort by last modified time
    Searched defs:NodeSet (Results 1 - 9 of 9) sorted by null

  /art/tools/ahat/src/main/com/android/ahat/dominators/
Dominators.java 167 public NodeSet dominated = new NodeSet();
174 // The empty set is represented as null instead of an empty NodeSet to
179 public NodeSet revisit = null;
222 private static class NodeSet {
364 dstS.oldDomS.revisit = new NodeSet();
389 NodeSet nodes = oldDomS.revisit;
414 xS.oldDomS.revisit = new NodeSet();
434 nodeS.oldDomS.revisit = new NodeSet();
  /external/tensorflow/tensorflow/compiler/jit/graphcycles/
graphcycles.cc 44 typedef std::unordered_set<int32> NodeSet;
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.
302 NodeSet seen;
  /external/apache-xml/src/main/java/org/apache/xpath/
NodeSet.java 19 * $Id: NodeSet.java 468655 2006-10-28 07:12:06Z minchau $
36 * <p>The NodeSet class can act as either a NodeVector,
52 * <p>Thought: Should NodeSet really implement NodeList and NodeIterator,
59 public class NodeSet
66 public NodeSet()
77 public NodeSet(int blocksize)
84 * Create a NodeSet, and copy the members of the
89 public NodeSet(NodeList nodelist)
98 * Create a NodeSet, and copy the members of the
99 * given NodeSet into it
    [all...]
  /external/llvm/include/llvm/CodeGen/
RegAllocPBQP.h 500 NodeSet::iterator NItr = OptimallyReducibleNodes.begin();
522 NodeSet::iterator NItr = ConservativelyAllocatableNodes.begin();
529 NodeSet::iterator NItr =
559 typedef std::set<NodeId> NodeSet;
560 NodeSet OptimallyReducibleNodes;
561 NodeSet ConservativelyAllocatableNodes;
562 NodeSet NotProvablyAllocatableNodes;
  /external/v8/src/compiler/
node.h 308 typedef ZoneSet<Node*> NodeSet;
  /external/llvm/lib/Target/Hexagon/
HexagonCommonGEP.cpp 53 typedef std::set<GepNode*> NodeSet;
281 in_set(const NodeSet &S) : NS(S) {}
286 const NodeSet &NS;
427 void nodes_for_root(GepNode *Root, NodeChildrenMap &NCM, NodeSet &Nodes) {
447 typedef std::set<NodeSet> NodeSymRel;
451 const NodeSet *node_class(GepNode *N, NodeSymRel &Rel) {
517 typedef std::map<unsigned,NodeSet> NodeSetMap;
532 NodeSet &S = I->second;
533 for (NodeSet::iterator NI = S.begin(), NE = S.end(); NI != NE; ++NI) {
542 NodeSet C
    [all...]
RDFGraph.h 474 typedef std::set<NodeId> NodeSet;
  /external/llvm/lib/CodeGen/
MachinePipeliner.cpp 144 class NodeSet;
222 typedef SmallVector<NodeSet, 8> NodeSetType;
362 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
418 /// A NodeSet contains a set of SUnit DAG nodes with additional information
420 class NodeSet {
432 NodeSet() : Nodes(), HasRecurrence(false) {}
434 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) {}
462 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; }
490 bool operator>(const NodeSet &RHS) const {
501 bool operator==(const NodeSet &RHS) const
    [all...]
  /external/swiftshader/third_party/llvm-7.0/llvm/lib/CodeGen/
MachinePipeliner.cpp 176 class NodeSet;
259 using NodeSetType = SmallVector<NodeSet, 8>;
399 void addConnectedNodes(SUnit *SU, NodeSet &NewSet,
457 /// A NodeSet contains a set of SUnit DAG nodes with additional information
459 class NodeSet {
472 NodeSet() = default;
473 NodeSet(iterator S, iterator E) : Nodes(S, E), HasRecurrence(true) {
507 int compareRecMII(NodeSet &RHS) { return RecMII - RHS.RecMII; }
539 bool operator>(const NodeSet &RHS) const {
550 bool operator==(const NodeSet &RHS) const
    [all...]

Completed in 2285 milliseconds