Home
last modified time | relevance | path

Searched refs:NodeId (Results 1 – 25 of 121) sorted by relevance

12345

/external/google-fruit/include/fruit/impl/data_structures/
Dsemistatic_graph.defn.h33 template <typename NodeId, typename Node>
34 inline SemistaticGraph<NodeId, Node>::node_iterator::node_iterator(NodeData* itr) : itr(itr) {} in node_iterator()
36 template <typename NodeId, typename Node>
37 inline Node& SemistaticGraph<NodeId, Node>::node_iterator::getNode() { in getNode()
42 template <typename NodeId, typename Node>
43 inline bool SemistaticGraph<NodeId, Node>::node_iterator::isTerminal() { in isTerminal()
48 template <typename NodeId, typename Node>
49 inline void SemistaticGraph<NodeId, Node>::node_iterator::setTerminal() { in setTerminal()
54 template <typename NodeId, typename Node>
55 inline bool SemistaticGraph<NodeId, Node>::node_iterator::operator==(const node_iterator& other) co…
[all …]
Dsemistatic_graph.templates.h58 template <typename NodeId, typename Node>
60 void SemistaticGraph<NodeId, Node>::printGraph(NodeIter first, NodeIter last) { in printGraph()
82 template <typename NodeId, typename Node>
84 SemistaticGraph<NodeId, Node>::SemistaticGraph(NodeIter first, NodeIter last, MemoryPool& memory_po… in SemistaticGraph()
87 …HashSetWithArenaAllocator<NodeId> node_ids = createHashSetWithArenaAllocator<NodeId>(last - first,… in SemistaticGraph()
98 using itr_t = typename HashSetWithArenaAllocator<NodeId>::iterator; in SemistaticGraph()
99 node_index_map = SemistaticMap<NodeId, InternalNodeId>( in SemistaticGraph()
112 NodeId(), in SemistaticGraph()
139 template <typename NodeId, typename Node>
141 SemistaticGraph<NodeId, Node>::SemistaticGraph(const SemistaticGraph& x, NodeIter first, NodeIter l… in SemistaticGraph()
[all …]
Dsemistatic_graph.h58 template <typename NodeId, typename Node>
67 SemistaticMap<NodeId, InternalNodeId> node_index_map;
71 NodeId key;
114 friend class SemistaticGraph<NodeId, Node>;
138 friend class SemistaticGraph<NodeId, Node>;
158 friend class SemistaticGraph<NodeId, Node>;
159 friend class SemistaticGraph<NodeId, Node>::node_iterator;
222 node_iterator at(NodeId nodeId);
226 node_iterator find(NodeId nodeId);
227 const_node_iterator find(NodeId nodeId) const;
/external/llvm-project/clang/lib/Tooling/ASTDiff/
DASTDiff.cpp39 SrcToDst = std::make_unique<NodeId[]>(Size); in Mapping()
40 DstToSrc = std::make_unique<NodeId[]>(Size); in Mapping()
43 void link(NodeId Src, NodeId Dst) { in link()
47 NodeId getDst(NodeId Src) const { return SrcToDst[Src]; } in getDst()
48 NodeId getSrc(NodeId Dst) const { return DstToSrc[Dst]; } in getSrc()
49 bool hasSrc(NodeId Src) const { return getDst(Src).isValid(); } in hasSrc()
50 bool hasDst(NodeId Dst) const { return getSrc(Dst).isValid(); } in hasDst()
53 std::unique_ptr<NodeId[]> SrcToDst, DstToSrc;
71 NodeId getMapped(const std::unique_ptr<SyntaxTree::Impl> &Tree, in getMapped()
72 NodeId Id) const { in getMapped()
[all …]
/external/llvm/include/llvm/CodeGen/PBQP/
DGraph.h30 typedef unsigned NodeId; typedef
34 static NodeId invalidNodeId() { in invalidNodeId()
35 return std::numeric_limits<NodeId>::max(); in invalidNodeId()
82 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
126 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
140 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
157 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
166 NodeId getN1Id() const { return NIds[0]; } in getN1Id()
167 NodeId getN2Id() const { return NIds[1]; } in getN2Id()
[all …]
/external/llvm-project/llvm/include/llvm/CodeGen/PBQP/
DGraph.h28 using NodeId = unsigned;
32 static NodeId invalidNodeId() { in invalidNodeId()
33 return std::numeric_limits<NodeId>::max(); in invalidNodeId()
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
149 NodeId getN1Id() const { return NIds[0]; } in getN1Id()
150 NodeId getN2Id() const { return NIds[1]; } in getN2Id()
156 NodeId NIds[2];
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h28 using NodeId = unsigned;
32 static NodeId invalidNodeId() { in invalidNodeId()
33 return std::numeric_limits<NodeId>::max(); in invalidNodeId()
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
103 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
123 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
140 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
149 NodeId getN1Id() const { return NIds[0]; } in getN1Id()
150 NodeId getN2Id() const { return NIds[1]; } in getN2Id()
156 NodeId NIds[2];
[all …]
/external/guice/extensions/grapher/src/com/google/inject/grapher/
DAbstractInjectorGrapher.java112 Map<NodeId, NodeId> aliases = resolveAliases(aliasCreator.createAliases(bindings)); in graph()
139 private void createNodes(Iterable<Node> nodes, Map<NodeId, NodeId> aliases) throws IOException { in createNodes() argument
141 NodeId originalId = node.getId(); in createNodes()
142 NodeId resolvedId = resolveAlias(aliases, originalId); in createNodes()
158 private void createEdges(Iterable<Edge> edges, Map<NodeId, NodeId> aliases) throws IOException { in createEdges() argument
172 private NodeId resolveAlias(Map<NodeId, NodeId> aliases, NodeId nodeId) { in resolveAlias() argument
180 private Map<NodeId, NodeId> resolveAliases(Iterable<Alias> aliases) { in resolveAliases()
181 Map<NodeId, NodeId> resolved = Maps.newHashMap(); in resolveAliases()
182 Map<NodeId, Set<NodeId>> inverse = Maps.newHashMap(); in resolveAliases()
185 NodeId from = alias.getFromId(); in resolveAliases()
[all …]
DDefaultEdgeCreator.java66 NodeId nodeId, T binding) { in newDependencyEdges()
69 NodeId to = NodeId.newTypeId(dependency.getKey()); in newDependencyEdges()
81 return newDependencyEdges(NodeId.newTypeId(binding.getKey()), binding); in visit()
93 NodeId.newTypeId(binding.getKey()), in visit()
94 NodeId.newTypeId(binding.getSourceKey()), in visit()
109 NodeId.newTypeId(binding.getKey()), in visit()
110 NodeId.newInstanceId(binding.getKey()), in visit()
112 .addAll(newDependencyEdges(NodeId.newInstanceId(binding.getKey()), binding)) in visit()
125 NodeId.newTypeId(binding.getKey()), in visit()
126 NodeId.newTypeId(binding.getLinkedKey()), in visit()
[all …]
DNodeId.java31 public final class NodeId { class
49 private NodeId(Key<?> key, NodeType nodeType) { in NodeId() method in NodeId
54 public static NodeId newTypeId(Key<?> key) { in newTypeId()
55 return new NodeId(key, NodeType.TYPE); in newTypeId()
58 public static NodeId newInstanceId(Key<?> key) { in newInstanceId()
59 return new NodeId(key, NodeType.INSTANCE); in newInstanceId()
73 if (obj == null || !(obj.getClass().equals(NodeId.class))) { in equals()
76 NodeId other = (NodeId) obj; in equals()
DEdge.java28 private final NodeId fromId;
29 private final NodeId toId;
31 protected Edge(NodeId fromId, NodeId toId) { in Edge()
36 public NodeId getFromId() { in getFromId()
40 public NodeId getToId() { in getToId()
65 public abstract Edge copy(NodeId fromId, NodeId toId); in copy()
DAlias.java27 private final NodeId fromId;
28 private final NodeId toId;
30 public Alias(NodeId fromId, NodeId toId) { in Alias()
35 public NodeId getFromId() { in getFromId()
39 public NodeId getToId() { in getToId()
/external/llvm-project/llvm/lib/Target/Hexagon/
DRDFDeadCode.h39 bool erase(const SetVector<NodeId> &Nodes);
43 SetVector<NodeId> getDeadNodes() { return DeadNodes; } in getDeadNodes()
44 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; } in getDeadInstrs()
49 SetVector<NodeId> LiveNodes;
50 SetVector<NodeId> DeadNodes;
51 SetVector<NodeId> DeadInstrs;
59 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
60 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
61 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
/external/llvm/lib/Target/Hexagon/
DRDFDeadCode.h40 bool erase(const SetVector<NodeId> &Nodes);
44 SetVector<NodeId> getDeadNodes() { return DeadNodes; } in getDeadNodes()
45 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; } in getDeadInstrs()
50 SetVector<NodeId> LiveNodes;
51 SetVector<NodeId> DeadNodes;
52 SetVector<NodeId> DeadInstrs;
60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
61 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
62 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
DRDFGraph.h226 typedef uint32_t NodeId; typedef
296 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
313 NodeId Id;
342 NodeBase *ptr(NodeId N) const { in ptr()
348 NodeId id(const NodeBase *P) const;
420 NodeId getNext() const { return Next; } in getNext()
430 void setNext(NodeId N) { Next = N; } in setNext()
435 NodeId Next; // Id of the next node in the circular chain.
440 NodeId DD, DU; // Ids of the first reached def and use.
443 NodeId PredB; // Id of the predecessor block for a phi use.
[all …]
/external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/Hexagon/
DRDFDeadCode.h39 bool erase(const SetVector<NodeId> &Nodes);
43 SetVector<NodeId> getDeadNodes() { return DeadNodes; } in getDeadNodes()
44 SetVector<NodeId> getDeadInstrs() { return DeadInstrs; } in getDeadInstrs()
49 SetVector<NodeId> LiveNodes;
50 SetVector<NodeId> DeadNodes;
51 SetVector<NodeId> DeadInstrs;
59 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
60 void processDef(NodeAddr<DefNode*> DA, SetQueue<NodeId> &WorkQ);
61 void processUse(NodeAddr<UseNode*> UA, SetQueue<NodeId> &WorkQ);
DRDFGraph.h260 using NodeId = uint32_t; variable
336 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
352 NodeId Id = 0;
383 NodeBase *ptr(NodeId N) const { in ptr()
390 NodeId id(const NodeBase *P) const;
457 NodeId getNext() const { return Next; } in getNext()
469 void setNext(NodeId N) { Next = N; } in setNext()
474 NodeId Next; // Id of the next node in the circular chain.
479 NodeId DD, DU; // Ids of the first reached def and use.
482 NodeId PredB; // Id of the predecessor block for a phi use.
[all …]
/external/tensorflow/tensorflow/lite/delegates/gpu/common/
Dmodel.h41 using NodeId = uint32_t; variable
63 const NodeId id;
97 std::vector<Value*> FindInputs(NodeId id) const;
100 std::vector<Value*> FindOutputs(NodeId id) const;
114 Node* GetNode(NodeId id) const;
129 absl::Status InsertNodeAfter(NodeId id, Node** new_node);
138 absl::Status SetProducer(NodeId producer, ValueId value);
146 absl::Status AddConsumer(NodeId consumer, ValueId value);
149 absl::Status ReplaceInput(NodeId node, ValueId old_value, ValueId new_value);
153 absl::Status RemoveConsumer(NodeId consumer, ValueId value);
[all …]
/external/llvm-project/clang/include/clang/Tooling/ASTDiff/
DASTDiff.h38 NodeId Parent, LeftMostDescendant, RightMostDescendant;
41 SmallVector<NodeId, 4> Children;
57 NodeId getMapped(const SyntaxTree &SourceTree, NodeId Id) const;
82 NodeId getRootId() const;
83 using PreorderIterator = NodeId;
87 const Node &getNode(NodeId Id) const;
88 int findPositionInParent(NodeId Id) const;
96 std::string getNodeValue(NodeId Id) const;
DASTDiffInternal.h25 struct NodeId { struct
32 NodeId() : Id(InvalidNodeId) {} in NodeId() function
33 NodeId(int Id) : Id(Id) {} in NodeId() argument
36 NodeId &operator++() { return ++Id, *this; }
37 NodeId &operator--() { return --Id, *this; }
39 NodeId &operator*() { return *this; }
/external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h146 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
150 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
162 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
278 using NodeId = GraphBase::NodeId; variable
298 void handleAddNode(NodeId NId) { in handleAddNode()
304 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
305 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
312 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
319 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
326 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[all …]
/external/llvm-project/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h148 void setNodeIdForVReg(Register VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
152 GraphBase::NodeId getNodeIdForVReg(Register VReg) const { in getNodeIdForVReg()
164 DenseMap<Register, GraphBase::NodeId> VRegToNodeId;
280 using NodeId = GraphBase::NodeId; variable
300 void handleAddNode(NodeId NId) { in handleAddNode()
306 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
307 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
314 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
321 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
328 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[all …]
DRDFGraph.h260 using NodeId = uint32_t; variable
336 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
352 NodeId Id = 0;
383 NodeBase *ptr(NodeId N) const { in ptr()
390 NodeId id(const NodeBase *P) const;
457 NodeId getNext() const { return Next; } in getNext()
469 void setNext(NodeId N) { Next = N; } in setNext()
474 NodeId Next; // Id of the next node in the circular chain.
479 NodeId DD, DU; // Ids of the first reached def and use.
482 NodeId PredB; // Id of the predecessor block for a phi use.
[all …]
/external/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h155 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
159 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
175 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
339 typedef GraphBase::NodeId NodeId; typedef
359 void handleAddNode(NodeId NId) { in handleAddNode()
364 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
365 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
377 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
384 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
391 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[all …]
/external/guice/extensions/grapher/src/com/google/inject/grapher/graphviz/
DGraphvizEdge.java20 import com.google.inject.grapher.NodeId;
29 private final NodeId headNodeId;
34 private final NodeId tailNodeId;
41 public GraphvizEdge(NodeId tailNodeId, NodeId headNodeId) { in GraphvizEdge()
47 public NodeId getHeadNodeId() { in getHeadNodeId()
76 public NodeId getTailNodeId() { in getTailNodeId()

12345