HomeSort by relevance Sort by last modified time
    Searched refs:NodeId (Results 1 - 4 of 4) sorted by null

  /external/chromium_org/net/spdy/
spdy_priority_forest.h 29 // The NodeId and Priority types must be POD that support comparison (most
31 template <typename NodeId, typename Priority>
41 bool NodeExists(NodeId node_id) const;
45 bool AddRootNode(NodeId node_id, Priority priority);
50 bool AddNonRootNode(NodeId node_id, NodeId parent_id, bool unordered);
54 bool RemoveNode(NodeId node_id);
58 Priority GetPriority(NodeId node_id) const;
61 // node (and thus has no parent), returns NodeId().
62 NodeId GetParent(NodeId node_id) const
    [all...]
  /external/llvm/lib/CodeGen/SelectionDAG/
LegalizeTypes.cpp 192 // Walk all nodes in the graph, assigning them a NodeId of 'ReadyToProcess'
319 // Recompute the NodeId and correct processed operands, adding the node to
354 int NodeId = User->getNodeId();
358 if (NodeId > 0) {
359 User->setNodeId(NodeId-1);
362 if (NodeId-1 == ReadyToProcess)
370 if (NodeId == NewNode)
374 // became ready. Its new NodeId is the number of operands it has minus 1
376 assert(NodeId == Unanalyzed && "Unknown node ID!");
446 /// calculate the NodeId. If the node itself changes to a processed node, i
    [all...]
  /external/llvm/include/llvm/CodeGen/
SelectionDAGNodes.h 327 /// NodeId - Unique id per SDNode in the DAG.
328 int NodeId;
417 int getNodeId() const { return NodeId; }
420 void setNodeId(int Id) { NodeId = Id; }
702 SubclassData(0), NodeId(-1),
718 SubclassData(0), NodeId(-1), OperandList(0),
    [all...]
  /external/llvm/lib/Transforms/ObjCARC/
ObjCARCOpts.cpp 877 static MDString *AppendMDNodeToSourcePtr(unsigned NodeId,
887 if (!(Node = Inst->getMetadata(NodeId))) {
901 Inst->setMetadata(NodeId, MDNode::get(Inst->getContext(),Hash));
935 static void AppendMDNodeToInstForPtr(unsigned NodeId,
    [all...]

Completed in 38 milliseconds