| /external/chromium_org/net/spdy/ |
| D | spdy_priority_forest.h | 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;
63 NodeId GetParent(NodeId node_id) const;
68 bool IsNodeUnordered(NodeId node_id) const;
72 NodeId GetChild(NodeId node_id) const;
77 bool SetPriority(NodeId node_id, Priority priority);
[all …]
|
| /external/chromium_org/mojo/services/view_manager/ |
| D | ids.h | 24 struct MOJO_VIEW_MANAGER_EXPORT NodeId { struct
25 NodeId(ConnectionSpecificId connection_id, ConnectionSpecificId node_id) in NodeId() function
28 NodeId() : connection_id(0), node_id(0) {} in NodeId() argument
30 bool operator==(const NodeId& other) const {
35 bool operator!=(const NodeId& other) const {
64 inline NodeId NodeIdFromTransportId(Id id) { in NodeIdFromTransportId()
65 return NodeId(HiWord(id), LoWord(id)); in NodeIdFromTransportId()
68 inline Id NodeIdToTransportId(const NodeId& id) { in NodeIdToTransportId()
80 inline NodeId RootNodeId() { in RootNodeId()
81 return NodeId(kRootConnection, 1); in RootNodeId()
[all …]
|
| D | view_manager_service_impl.h | 59 Node* GetNode(const NodeId& id) { in GetNode()
63 const Node* GetNode(const NodeId& id) const;
98 void ProcessNodeDeleted(const NodeId& node,
120 bool CanDeleteNode(const NodeId& node_id) const;
129 bool DeleteNodeImpl(ViewManagerServiceImpl* source, const NodeId& node_id);
|
| D | node.h | 30 Node(NodeDelegate* delegate, const NodeId& id);
36 const NodeId& id() const { return id_; } in id()
96 const NodeId id_;
|
| D | view_manager_service_impl.cc | 72 const NodeId node_id(node->id()); in ~ViewManagerServiceImpl()
83 const Node* ViewManagerServiceImpl::GetNode(const NodeId& id) const { in GetNode()
161 const NodeId new_parent_id(new_parent ? new_parent->id() : NodeId()); in ProcessNodeHierarchyChanged()
162 const NodeId old_parent_id(old_parent ? old_parent->id() : NodeId()); in ProcessNodeHierarchyChanged()
206 void ViewManagerServiceImpl::ProcessNodeDeleted(const NodeId& node, in ProcessNodeDeleted()
309 bool ViewManagerServiceImpl::CanDeleteNode(const NodeId& node_id) const { in CanDeleteNode()
347 const NodeId& node_id) { in DeleteNodeImpl()
529 inode->parent_id = NodeIdToTransportId(parent ? parent->id() : NodeId()); in NodesToNodeDatas()
542 const NodeId node_id(NodeIdFromTransportId(transport_node_id)); in CreateNode()
557 const NodeId node_id(NodeIdFromTransportId(transport_node_id)); in DeleteNode()
|
| D | root_node_manager.h | 109 Node* GetNode(const NodeId& id);
149 void ProcessNodeDeleted(const NodeId& node);
|
| D | root_node_manager.cc | 101 Node* RootNodeManager::GetNode(const NodeId& id) { in GetNode()
189 void RootNodeManager::ProcessNodeDeleted(const NodeId& node) { in ProcessNodeDeleted()
|
| D | node.cc | 24 Node::Node(NodeDelegate* delegate, const NodeId& id) in Node()
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| D | Graph.h | 29 typedef unsigned NodeId; typedef
33 static NodeId invalidNodeId() { in invalidNodeId()
34 return std::numeric_limits<NodeId>::max(); in invalidNodeId()
80 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) { in removeAdjEdgeId()
102 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs) in EdgeEntry()
124 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) { in connectTo()
138 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) { in setAdjEdgeIdx()
155 void disconnectFrom(Graph &G, NodeId NId) { in disconnectFrom()
164 NodeId getN1Id() const { return NIds[0]; } in getN1Id()
165 NodeId getN2Id() const { return NIds[1]; } in getN2Id()
[all …]
|
| D | RegAllocSolver.h | 141 typedef PBQP::GraphBase::NodeId NodeId; typedef
161 void handleAddNode(NodeId NId) { in handleAddNode()
164 void handleRemoveNode(NodeId NId) {} in handleRemoveNode()
165 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {} in handleSetNodeCosts()
177 void handleDisconnectEdge(EdgeId EId, NodeId NId) { in handleDisconnectEdge()
192 void handleReconnectEdge(EdgeId EId, NodeId NId) { in handleReconnectEdge()
201 NodeId N1Id = G.getEdgeNode1Id(EId); in handleSetEdgeCosts()
202 NodeId N2Id = G.getEdgeNode2Id(EId); in handleSetEdgeCosts()
212 void removeFromCurrentSet(NodeId NId) { in removeFromCurrentSet()
236 void moveToOptimallyReducibleNodes(NodeId NId) { in moveToOptimallyReducibleNodes()
[all …]
|
| D | ReductionRules.h | 28 void applyR1(GraphT &G, typename GraphT::NodeId NId) { in applyR1()
29 typedef typename GraphT::NodeId NodeId; in applyR1() typedef
39 NodeId MId = G.getEdgeOtherNodeId(EId, NId); in applyR1()
72 void applyR2(GraphT &G, typename GraphT::NodeId NId) { in applyR2()
73 typedef typename GraphT::NodeId NodeId; in applyR2() typedef
88 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId), in applyR2()
160 typedef GraphBase::NodeId NodeId; in backpropagate() typedef
167 NodeId NId = stack.back(); in backpropagate()
175 NodeId mId = G.getEdgeNode2Id(EId); in backpropagate()
178 NodeId mId = G.getEdgeNode1Id(EId); in backpropagate()
|
| D | Solution.h | 29 typedef std::map<GraphBase::NodeId, unsigned> SelectionsMap;
75 void setSelection(GraphBase::NodeId nodeId, unsigned selection) { in setSelection()
82 unsigned getSelection(GraphBase::NodeId nodeId) const { in getSelection()
|
| /external/llvm/include/llvm/CodeGen/ |
| D | RegAllocPBQP.h | 55 void recordVReg(unsigned vreg, PBQPRAGraph::NodeId nodeId, in recordVReg()
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;
|
| D | SelectionDAGNodes.h | 360 int NodeId;
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/ |
| D | RegAllocPBQP.cpp | 156 unsigned PBQPRAProblem::getVRegForNode(PBQPRAGraph::NodeId node) const { in getVRegForNode()
162 PBQPRAGraph::NodeId PBQPRAProblem::getNodeForVReg(unsigned vreg) const { in getNodeForVReg()
252 PBQPRAGraph::NodeId nId = g.addNode(std::move(nodeCosts)); in build()
355 PBQPRAGraph::NodeId node = p->getNodeForVReg(src); in build()
365 PBQPRAGraph::NodeId node1 = p->getNodeForVReg(dst); in build()
366 PBQPRAGraph::NodeId node2 = p->getNodeForVReg(src); in build()
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| D | LegalizeTypes.cpp | 356 int NodeId = User->getNodeId(); in run() local
360 if (NodeId > 0) { in run()
361 User->setNodeId(NodeId-1); in run()
364 if (NodeId-1 == ReadyToProcess) in run()
372 if (NodeId == NewNode) in run()
378 assert(NodeId == Unanalyzed && "Unknown node ID!"); in run()
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCOpts.cpp | 820 static MDString *AppendMDNodeToSourcePtr(unsigned NodeId, in AppendMDNodeToSourcePtr() argument
830 if (!(Node = Inst->getMetadata(NodeId))) { in AppendMDNodeToSourcePtr()
844 Inst->setMetadata(NodeId, MDNode::get(Inst->getContext(),Hash)); in AppendMDNodeToSourcePtr()
878 static void AppendMDNodeToInstForPtr(unsigned NodeId, in AppendMDNodeToInstForPtr() argument
893 Inst->setMetadata(NodeId, Node); in AppendMDNodeToInstForPtr()
|
| /external/chromium_org/third_party/WebKit/PerformanceTests/Parser/resources/ |
| D | final-url-en | 13303 http://ortho.smith-nephew.com/ca_en/Standard.asp?NodeId=3417
|