/external/chromium_org/net/spdy/ |
H A D | spdy_priority_forest.h | 30 // The NodeId and Priority types must be POD that support comparison (most 32 template <typename NodeId, typename Priority> 42 bool NodeExists(NodeId node_id) const; 46 bool AddRootNode(NodeId node_id, Priority priority); 51 bool AddNonRootNode(NodeId node_id, NodeId parent_id, bool unordered); 55 bool RemoveNode(NodeId node_id); 59 Priority GetPriority(NodeId node_id) const; 62 // node (and thus has no parent), returns NodeId(). 63 NodeId GetParen [all...] |
H A D | spdy_priority_tree.h | 32 // The NodeId type must be a POD that supports comparison (most 36 template <typename NodeId> 45 template <typename NodeId> 47 typedef std::vector<std::pair<NodeId, float> > PriorityNodeList; 53 typedef std::list<NodeId> List; 58 NodeId id; 59 NodeId parent_id; 76 bool operator ()(const std::pair<NodeId, float>& lhs, 77 const std::pair<NodeId, float>& rhs); 80 friend class test::SpdyPriorityTreePeer<NodeId>; [all...] |
H A D | spdy_priority_tree_test.cc | 14 template <typename NodeId> 17 explicit SpdyPriorityTreePeer(SpdyPriorityTree<NodeId>* tree) : tree_(tree) {} 19 void PropagateNodeState(NodeId node) { 24 SpdyPriorityTree<NodeId>* tree_;
|
/external/chromium_org/v8/src/compiler/ |
H A D | generic-graph.h | 23 NodeId NextNodeID() { return next_node_id_++; } 24 NodeId NodeCount() const { return next_node_id_; } 28 NodeId next_node_id_;
|
H A D | code-generator-impl.h | 68 NodeId block_id = static_cast<NodeId>(InputInt32(index));
|
H A D | graph-reducer.cc | 19 static bool NodeIdIsLessThan(const Node* node, NodeId id) {
|
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_;
|
H A D | instruction-selector.cc | 157 NodeId id = node->id(); 159 DCHECK(id < static_cast<NodeId>(defined_.size())); 166 NodeId id = node->id(); 168 DCHECK(id < static_cast<NodeId>(defined_.size())); 175 NodeId id = node->id(); 177 DCHECK(id < static_cast<NodeId>(used_.size())); 184 NodeId id = node->id(); 186 DCHECK(id < static_cast<NodeId>(used_.size()));
|
H A D | schedule.h | 170 if (node->id() < static_cast<NodeId>(nodeid_to_block_.size())) {
|
H A D | js-inlining.cc | 207 for (NodeId id = 0; id < source_graph_->NodeCount(); ++id) {
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Solution.h | 29 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap; 75 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { 82 unsigned getSelection(GraphBase::NodeId nodeId) const {
|
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...] |
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...] |
/external/llvm/include/llvm/CodeGen/ |
H A D | RegAllocPBQP.h | 55 void recordVReg(unsigned vreg, PBQPRAGraph::NodeId nodeId, 67 unsigned getVRegForNode(PBQPRAGraph::NodeId nodeId) const; 70 PBQPRAGraph::NodeId getNodeForVReg(unsigned vreg) const; 95 typedef std::map<PBQPRAGraph::NodeId, unsigned> Node2VReg; 96 typedef DenseMap<unsigned, PBQPRAGraph::NodeId> VReg2Node;
|
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),
|
/external/llvm/lib/CodeGen/ |
H A D | RegAllocPBQP.cpp | 156 unsigned PBQPRAProblem::getVRegForNode(PBQPRAGraph::NodeId node) const { 162 PBQPRAGraph::NodeId PBQPRAProblem::getNodeForVReg(unsigned vreg) const { 252 PBQPRAGraph::NodeId nId = g.addNode(std::move(nodeCosts)); 355 PBQPRAGraph::NodeId node = p->getNodeForVReg(src); 365 PBQPRAGraph::NodeId node1 = p->getNodeForVReg(dst); 366 PBQPRAGraph::NodeId node2 = p->getNodeForVReg(src);
|
/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);
|