Searched defs:NodeId (Results 1 - 7 of 7) sorted by relevance
/external/chromium_org/v8/src/compiler/ |
H A D | generic-node.h | 18 typedef int NodeId; typedef in namespace:v8::internal::compiler 35 inline NodeId id() const { return id_; } 138 NodeId id_;
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | ReductionRules.h | 28 void applyR1(GraphT &G, typename GraphT::NodeId NId) { 29 typedef typename GraphT::NodeId NodeId; typedef 39 NodeId MId = G.getEdgeOtherNodeId(EId, NId); 72 void applyR2(GraphT &G, typename GraphT::NodeId NId) { 73 typedef typename GraphT::NodeId NodeId; typedef 88 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), 160 typedef GraphBase::NodeId NodeId; typedef [all...] |
H A D | RegAllocSolver.h | 141 typedef PBQP::GraphBase::NodeId NodeId; typedef in class:PBQP::RegAlloc::RegAllocSolverImpl 161 void handleAddNode(NodeId NId) { 164 void handleRemoveNode(NodeId NId) {} 165 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} 177 void handleDisconnectEdge(EdgeId EId, NodeId NId) { 192 void handleReconnectEdge(EdgeId EId, NodeId NId) { 201 NodeId N1Id = G.getEdgeNode1Id(EId); 202 NodeId N2Id = G.getEdgeNode2Id(EId); 212 void removeFromCurrentSet(NodeId NI 278 typedef GraphBase::NodeId NodeId; typedef [all...] |
H A D | Graph.h | 29 typedef unsigned NodeId; typedef in class:PBQP::GraphBase 33 static NodeId invalidNodeId() { 34 return std::numeric_limits<NodeId>::max(); 80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { 102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) 124 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { 138 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { 155 void disconnectFrom(Graph &G, NodeId NId) { 164 NodeId getN1I [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
H A D | LegalizeTypes.cpp | 194 // Walk all nodes in the graph, assigning them a NodeId of 'ReadyToProcess' 321 // Recompute the NodeId and correct processed operands, adding the node to 356 int NodeId = User->getNodeId(); local 360 if (NodeId > 0) { 361 User->setNodeId(NodeId-1); 364 if (NodeId-1 == ReadyToProcess) 372 if (NodeId == NewNode) 376 // became ready. Its new NodeId is the number of operands it has minus 1 378 assert(NodeId == Unanalyzed && "Unknown node ID!"); 448 /// calculate the NodeId [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 820 static MDString *AppendMDNodeToSourcePtr(unsigned NodeId, argument 830 if (!(Node = Inst->getMetadata(NodeId))) { 844 Inst->setMetadata(NodeId, MDNode::get(Inst->getContext(),Hash)); 878 static void AppendMDNodeToInstForPtr(unsigned NodeId, argument 893 Inst->setMetadata(NodeId, Node);
|
/external/llvm/include/llvm/CodeGen/ |
H A D | SelectionDAGNodes.h | 359 /// NodeId - Unique id per SDNode in the DAG. 360 int NodeId; member in class:llvm::SDNode 449 int getNodeId() const { return NodeId; } 452 void setNodeId(int Id) { NodeId = Id; } 744 SubclassData(0), NodeId(-1), 760 SubclassData(0), NodeId(-1), OperandList(nullptr), ValueList(VTs.VTs),
|
Completed in 166 milliseconds