| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 30 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 …]
|
| D | ReductionRules.h | 29 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()
|
| D | Solution.h | 30 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap;
76 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
83 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 154 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) { in setNodeIdForVReg()
158 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const { in getNodeIdForVReg()
174 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
338 typedef GraphBase::NodeId NodeId; typedef
358 void handleAddNode(NodeId NId) { in handleAddNode()
363 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
364 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
383 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
390 NodeId N1Id = G.getEdgeNode1Id(EId); in handleUpdateCosts()
[all …]
|
| D | SelectionDAGNodes.h | 345 int NodeId;
439 int getNodeId() const { return NodeId; }
442 void setNodeId(int Id) { NodeId = Id; }
715 SubclassData(0), NodeId(-1),
736 SubclassData(0), NodeId(-1), OperandList(nullptr), ValueList(VTs.VTs),
|
| /external/llvm/lib/CodeGen/ |
| D | RegAllocPBQP.cpp | 184 typedef std::pair<PBQP::GraphBase::NodeId, PBQP::GraphBase::NodeId> IEdgeKey;
187 bool haveDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in haveDisjointAllowedRegs()
188 PBQPRAGraph::NodeId MId, in haveDisjointAllowedRegs()
202 void setDisjointAllowedRegs(const PBQPRAGraph &G, PBQPRAGraph::NodeId NId, in setDisjointAllowedRegs()
203 PBQPRAGraph::NodeId MId, in setDisjointAllowedRegs()
220 typedef std::tuple<LiveInterval*, size_t, PBQP::GraphBase::NodeId>
231 static PBQP::GraphBase::NodeId getNodeId(const IntervalInfo &I) { in getNodeId()
328 PBQP::GraphBase::NodeId NId = getNodeId(Cur); in apply()
330 PBQP::GraphBase::NodeId MId = getNodeId(A); in apply()
362 PBQPRAGraph::NodeId NId, PBQPRAGraph::NodeId MId, in createInterferenceEdge()
[all …]
|
| /external/v8/src/compiler/ |
| D | generic-graph.h | 23 NodeId NextNodeID() { return next_node_id_++; } in NextNodeID()
24 NodeId NodeCount() const { return next_node_id_; } in NodeCount()
28 NodeId next_node_id_;
|
| D | code-generator-impl.h | 68 NodeId block_id = static_cast<NodeId>(InputInt32(index)); in InputBlock()
|
| D | generic-node.h | 18 typedef int NodeId; typedef
35 inline NodeId id() const { return id_; } in id()
138 NodeId id_;
|
| D | instruction-selector.cc | 157 NodeId id = node->id(); in IsDefined()
159 DCHECK(id < static_cast<NodeId>(defined_.size())); in IsDefined()
166 NodeId id = node->id(); in MarkAsDefined()
168 DCHECK(id < static_cast<NodeId>(defined_.size())); in MarkAsDefined()
175 NodeId id = node->id(); in IsUsed()
177 DCHECK(id < static_cast<NodeId>(used_.size())); in IsUsed()
184 NodeId id = node->id(); in MarkAsUsed()
186 DCHECK(id < static_cast<NodeId>(used_.size())); in MarkAsUsed()
|
| D | graph-reducer.cc | 19 static bool NodeIdIsLessThan(const Node* node, NodeId id) { in NodeIdIsLessThan()
|
| D | schedule.h | 170 if (node->id() < static_cast<NodeId>(nodeid_to_block_.size())) { in block()
|
| D | js-inlining.cc | 207 for (NodeId id = 0; id < source_graph_->NodeCount(); ++id) { in ReplaceSentinels()
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint()
175 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint()
261 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint()
274 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | LegalizeTypes.cpp | 364 int NodeId = User->getNodeId(); in run() local
368 if (NodeId > 0) { in run()
369 User->setNodeId(NodeId-1); in run()
372 if (NodeId-1 == ReadyToProcess) in run()
380 if (NodeId == NewNode) in run()
386 assert(NodeId == Unanalyzed && "Unknown node ID!"); in run()
|