Home
last modified time | relevance | path

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

1234

/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/guice/extensions/grapher/src/com/google/inject/grapher/
DAbstractInjectorGrapher.java109 Map<NodeId, NodeId> aliases = resolveAliases(aliasCreator.createAliases(bindings)); in graph()
136 private void createNodes(Iterable<Node> nodes, Map<NodeId, NodeId> aliases) throws IOException { in createNodes() argument
138 NodeId originalId = node.getId(); in createNodes()
139 NodeId resolvedId = resolveAlias(aliases, originalId); in createNodes()
155 private void createEdges(Iterable<Edge> edges, Map<NodeId, NodeId> aliases) throws IOException { in createEdges() argument
169 private NodeId resolveAlias(Map<NodeId, NodeId> aliases, NodeId nodeId) { in resolveAlias() argument
177 private Map<NodeId, NodeId> resolveAliases(Iterable<Alias> aliases) { in resolveAliases()
178 Map<NodeId, NodeId> resolved = Maps.newHashMap(); in resolveAliases()
179 Map<NodeId, Set<NodeId>> inverse = Maps.newHashMap(); in resolveAliases()
182 NodeId from = alias.getFromId(); in resolveAliases()
[all …]
DDefaultEdgeCreator.java66 NodeId nodeId, T binding) { in newDependencyEdges()
69 NodeId to = NodeId.newTypeId(dependency.getKey()); in newDependencyEdges()
80 return newDependencyEdges(NodeId.newTypeId(binding.getKey()), binding); in visit()
89 return ImmutableList.<Edge>of(new BindingEdge(NodeId.newTypeId(binding.getKey()), in visit()
90 NodeId.newTypeId(binding.getSourceKey()), in visit()
102 .add(new BindingEdge(NodeId.newTypeId(binding.getKey()), in visit()
103 NodeId.newInstanceId(binding.getKey()), in visit()
105 .addAll(newDependencyEdges(NodeId.newInstanceId(binding.getKey()), binding)) in visit()
115 return ImmutableList.<Edge>of(new BindingEdge(NodeId.newTypeId(binding.getKey()), in visit()
116 NodeId.newTypeId(binding.getLinkedKey()), in visit()
[all …]
DNodeId.java32 public final class NodeId { class
50 private NodeId(Key<?> key, NodeType nodeType) { in NodeId() method in NodeId
55 public static NodeId newTypeId(Key<?> key) { in newTypeId()
56 return new NodeId(key, NodeType.TYPE); in newTypeId()
59 public static NodeId newInstanceId(Key<?> key) { in newInstanceId()
60 return new NodeId(key, NodeType.INSTANCE); in newInstanceId()
72 if (!(obj.getClass().equals(NodeId.class))) { in equals()
75 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()
63 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()
69 public abstract Node copy(NodeId id); in copy()
DBindingEdge.java42 public BindingEdge(NodeId fromId, NodeId toId, Type type) { in BindingEdge()
67 @Override public Edge copy(NodeId fromId, NodeId toId) { in copy()
DDependencyEdge.java36 public DependencyEdge(NodeId fromId, NodeId toId, InjectionPoint injectionPoint) { in DependencyEdge()
62 @Override 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 …]
DRDFCopy.h42 std::map<RegisterRef,std::map<NodeId,NodeId>> RDefMap;
44 std::map<NodeId, EqualityMap> CopyMap;
45 std::vector<NodeId> Copies;
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()
DRDFLiveness.cpp47 OS << Print<NodeId>(*J, P.G); in operator <<()
89 SetVector<NodeId> DefQ; in getAllReachingDefs()
90 SetVector<NodeId> Owners; in getAllReachingDefs()
95 NodeId Start = RefA.Id; in getAllReachingDefs()
97 if (NodeId RD = SNA.Addr->getReachingDef()) in getAllReachingDefs()
126 SetVector<NodeId> Defs; in getAllReachingDefs()
146 auto Less = [&Block,this] (NodeId A, NodeId B) -> bool { in getAllReachingDefs()
175 std::vector<NodeId> Tmp(Owners.begin(), Owners.end()); in getAllReachingDefs()
291 NodeId U = DefA.Addr->getReachedUse(); in getAllReachedUses()
301 for (NodeId D = DefA.Addr->getReachedDef(), NextD; D != 0; D = NextD) { in getAllReachedUses()
[all …]
DRDFDeadCode.cpp72 SetQueue<NodeId> &WorkQ) { in scanInstr()
84 SetQueue<NodeId> &WorkQ) { in processDef()
95 SetQueue<NodeId> &WorkQ) { in processUse()
116 SetQueue<NodeId> WorkQ; in collect()
122 NodeId N = WorkQ.pop_front(); in collect()
133 for (NodeId N : LiveNodes) { in collect()
168 bool DeadCodeElimination::erase(const SetVector<NodeId> &Nodes) { in erase()
/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;
31 private final NodeId headNodeId;
36 private final NodeId tailNodeId;
43 public GraphvizEdge(NodeId tailNodeId, NodeId headNodeId) { in GraphvizEdge()
49 public NodeId getHeadNodeId() { in getHeadNodeId()
78 public NodeId getTailNodeId() { in getTailNodeId()
DGraphvizNode.java22 import com.google.inject.grapher.NodeId;
34 private final NodeId nodeId;
51 public GraphvizNode(NodeId nodeId) { in GraphvizNode()
56 public NodeId getNodeId() { in getNodeId()
/external/v8/src/compiler/
Descape-analysis-reducer.cc35 if (node->id() < static_cast<NodeId>(fully_reduced_.length()) && in Reduce()
59 if (node->id() >= static_cast<NodeId>(fully_reduced_.length()) || in Reduce()
76 input->id() >= static_cast<NodeId>(fully_reduced_.length()) || in Reduce()
120 if (node->id() < static_cast<NodeId>(fully_reduced_.length())) { in ReduceLoad()
140 if (node->id() < static_cast<NodeId>(fully_reduced_.length())) { in ReduceStore()
155 if (node->id() < static_cast<NodeId>(fully_reduced_.length())) { in ReduceAllocate()
174 if (node->id() < static_cast<NodeId>(fully_reduced_.length())) { in ReduceFinishRegion()
235 if (node->id() < static_cast<NodeId>(fully_reduced_.length())) { in ReduceFrameStateUses()
260 if (node->id() < static_cast<NodeId>(fully_reduced_.length()) && in ReduceDeoptState()
303 if (node->id() < static_cast<NodeId>(fully_reduced_.length())) { in ReduceDeoptState()
[all …]
/external/snakeyaml/src/test/java/org/yaml/snakeyaml/
DYamlComposeTest.java24 import org.yaml.snakeyaml.nodes.NodeId;
54 assertEquals(NodeId.mapping, node.getNodeId()); in testComposeAllFromReader()
56 assertEquals(NodeId.scalar, node.getNodeId()); in testComposeAllFromReader()
65 assertEquals(NodeId.scalar, node.getNodeId()); in testComposeAllOneDocument()
/external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/
DRepresenter.java32 import org.yaml.snakeyaml.nodes.NodeId;
129 NodeId nodeId = nodeValue.getNodeId(); in representJavaBeanProperty()
131 if (nodeId == NodeId.scalar) { in representJavaBeanProperty()
136 if (nodeId == NodeId.mapping) { in representJavaBeanProperty()
173 if (node.getNodeId() == NodeId.sequence) { in checkGlobalTag()
190 if (childNode.getNodeId() == NodeId.mapping) { in checkGlobalTag()
205 if (keyNode.getNodeId() == NodeId.mapping) { in checkGlobalTag()
/external/llvm/lib/CodeGen/
DRegAllocPBQP.cpp192 typedef std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId> IEdgeKey;
195 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
196 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs()
210 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
211 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs()
228 typedef std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>
239 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
336 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
338 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
370 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
[all …]
/external/guice/extensions/grapher/test/com/google/inject/grapher/
DAbstractInjectorGrapherTest.java112 aNode = new ImplementationNode(NodeId.newTypeId(Key.get(A.class)), null, in setUp()
114 a2Node = new ImplementationNode(NodeId.newTypeId(Key.get(A2.class)), null, in setUp()
116 iaNode = new InterfaceNode(NodeId.newTypeId(Key.get(IA.class)), null); in setUp()
117 iaAnnNode = new InterfaceNode(NodeId.newTypeId(Key.get(IA.class, Ann.class)), null); in setUp()
118 stringNode = new InterfaceNode(NodeId.newTypeId(Key.get(String.class)), null); in setUp()
119 stringInstanceNode = new InstanceNode(NodeId.newInstanceId(Key.get(String.class)), null, in setUp()
155 Node a2ProviderNode = new InstanceNode(NodeId.newInstanceId(Key.get(IA.class)), null, in testProviderBindings()

1234