Home
last modified time | relevance | path

Searched refs:NodeId (Results 1 – 25 of 101) 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/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 …]
DReductionRules.h29 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
30 typedef typename GraphT::NodeId NodeId; in applyR1() typedef
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
74 typedef typename GraphT::NodeId NodeId; in applyR2() typedef
89 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), in applyR2()
180 typedef GraphBase::NodeId NodeId; in backpropagate() typedef
187 NodeId NId = stack.back(); in backpropagate()
204 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
207 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/PBQP/
DGraph.h29 using NodeId = unsigned;
33 static NodeId invalidNodeId() { in invalidNodeId()
34 return std::numeric_limits<NodeId>::max(); in invalidNodeId()
81 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
104 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
124 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
141 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
150 NodeId getN1Id() const { return NIds[0]; } in getN1Id()
151 NodeId getN2Id() const { return NIds[1]; } in getN2Id()
157 NodeId NIds[2];
[all …]
DReductionRules.h31 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
32 using NodeId = typename GraphT::NodeId; in applyR1() local
42 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
75 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
76 using NodeId = typename GraphT::NodeId; in applyR2() local
91 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), in applyR2()
182 using NodeId = GraphBase::NodeId; in backpropagate() local
189 NodeId NId = stack.back(); in backpropagate()
206 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
209 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
/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()
DNode.java34 private final NodeId id;
37 protected Node(NodeId id, Object source) { in Node()
42 public NodeId getId() { in getId()
71 public abstract Node copy(NodeId id); in copy()
DBindingEdge.java40 public BindingEdge(NodeId fromId, NodeId toId, Type type) { in BindingEdge()
69 public Edge copy(NodeId fromId, NodeId toId) { in copy()
/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 …]
DRDFGraph.cpp49 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) { in operator <<()
89 OS << Print<NodeId>(RA.Id, G) << '<' in printRefHeader()
100 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
101 OS << Print<NodeId>(N, P.G); in operator <<()
103 if (NodeId N = P.Obj.Addr->getReachedDef()) in operator <<()
104 OS << Print<NodeId>(N, P.G); in operator <<()
106 if (NodeId N = P.Obj.Addr->getReachedUse()) in operator <<()
107 OS << Print<NodeId>(N, P.G); in operator <<()
109 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
110 OS << Print<NodeId>(N, P.G); in operator <<()
[all …]
DHexagonRDFOpt.cpp89 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
139 const SetVector<NodeId> &DeadNodes = getDeadNodes(); in run()
140 const SetVector<NodeId> &DeadInstrs = getDeadInstrs(); in run()
142 typedef DenseMap<NodeId,NodeId> RefToInstrMap; in run()
144 SetVector<NodeId> PartlyDead; in run()
161 SetVector<NodeId> Remove = DeadInstrs; in run()
164 for (NodeId N : PartlyDead) { in run()
184 DenseMap<NodeId,unsigned> OpMap; in removeOperand()
201 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) { in rewrite()
/external/swiftshader/third_party/llvm-7.0/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.h261 using NodeId = uint32_t; variable
337 NodeAddr(T A, NodeId I) : Addr(A), Id(I) {} in NodeAddr()
353 NodeId Id = 0;
384 NodeBase *ptr(NodeId N) const { in ptr()
391 NodeId id(const NodeBase *P) const;
458 NodeId getNext() const { return Next; } in getNext()
470 void setNext(NodeId N) { Next = N; } in setNext()
475 NodeId Next; // Id of the next node in the circular chain.
480 NodeId DD, DU; // Ids of the first reached def and use.
483 NodeId PredB; // Id of the predecessor block for a phi use.
[all …]
DRDFLiveness.cpp67 OS << Print<NodeId>(J->first, P.G) << PrintLaneMaskOpt(J->second); in operator <<()
112 SetVector<NodeId> DefQ; in getAllReachingDefs()
113 SetVector<NodeId> Owners; in getAllReachingDefs()
126 NodeId Start = RefA.Id; in getAllReachingDefs()
128 if (NodeId RD = SNA.Addr->getReachingDef()) in getAllReachingDefs()
132 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
154 if (NodeId RD = NodeAddr<RefNode*>(S).Addr->getReachingDef()) in getAllReachingDefs()
160 SetVector<NodeId> Defs; in getAllReachingDefs()
161 for (NodeId N : DefQ) { in getAllReachingDefs()
180 auto Less = [&Block,this] (NodeId A, NodeId B) -> bool { in getAllReachingDefs()
[all …]
DRDFGraph.cpp70 raw_ostream &operator<< (raw_ostream &OS, const Print<NodeId> &P) { in operator <<()
113 OS << Print<NodeId>(RA.Id, G) << '<' in printRefHeader()
123 if (NodeId N = P.Obj.Addr->getReachingDef()) in operator <<()
124 OS << Print<NodeId>(N, P.G); in operator <<()
126 if (NodeId N = P.Obj.Addr->getReachedDef()) in operator <<()
127 OS << Print<NodeId>(N, P.G); in operator <<()
129 if (NodeId N = P.Obj.Addr->getReachedUse()) in operator <<()
130 OS << Print<NodeId>(N, P.G); in operator <<()
132 if (NodeId N = P.Obj.Addr->getSibling()) in operator <<()
133 OS << Print<NodeId>(N, P.G); in operator <<()
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/
DRegAllocPBQP.h147 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
151 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
163 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
279 using NodeId = GraphBase::NodeId; variable
299 void handleAddNode(NodeId NId) { in handleAddNode()
305 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
306 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
313 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
320 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
327 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[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