| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| NodeId.java | 21 public enum NodeId {
|
| /external/guice/extensions/grapher/src/com/google/inject/grapher/ |
| NodeId.java | 32 public final class NodeId {
50 private NodeId(Key<?> key, NodeType nodeType) {
55 public static NodeId newTypeId(Key<?> key) {
56 return new NodeId(key, NodeType.TYPE);
59 public static NodeId newInstanceId(Key<?> key) {
60 return new NodeId(key, NodeType.INSTANCE);
72 if (!(obj.getClass().equals(NodeId.class))) {
75 NodeId other = (NodeId) obj;
80 return "NodeId{nodeType=" + nodeType + " key=" + key + "}"
[all...] |
| /external/v8/src/compiler/ |
| graph.h | 29 typedef uint32_t NodeId;
106 inline NodeId NextNodeId();
112 NodeId next_node_id_;
|
| graph-reducer.h | 22 typedef uint32_t NodeId;
161 void Replace(Node* node, Node* replacement, NodeId max_id);
|
| node.h | 30 typedef uint32_t NodeId;
44 static Node* New(Zone* zone, NodeId id, const Operator* op, int input_count,
46 static Node* Clone(Zone* zone, NodeId id, const Node* node);
58 NodeId id() const { return IdField::decode(bit_field_); }
266 Node(NodeId id, const Operator* op, int inline_count, int inline_capacity);
304 typedef BitField<NodeId, 0, 24> IdField;
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| ReductionRules.h | 29 void applyR1(GraphT &G, typename GraphT::NodeId NId) {
30 typedef typename GraphT::NodeId NodeId;
40 NodeId MId = G.getEdgeOtherNodeId(EId, NId);
73 void applyR2(GraphT &G, typename GraphT::NodeId NId) {
74 typedef typename GraphT::NodeId NodeId;
89 NodeId YNId = G.getEdgeOtherNodeId(YXEId, NId),
180 typedef GraphBase::NodeId NodeId;
[all...] |
| Graph.h | 31 typedef unsigned NodeId;
35 static NodeId invalidNodeId() {
36 return std::numeric_limits<NodeId>::max();
83 void removeAdjEdgeId(Graph &G, NodeId ThisNId, AdjEdgeIdx Idx) {
105 EdgeEntry(NodeId N1Id, NodeId N2Id, MatrixPtr Costs)
127 void connectTo(Graph &G, EdgeId ThisEdgeId, NodeId NId) {
141 void setAdjEdgeIdx(NodeId NId, typename NodeEntry::AdjEdgeIdx NewIdx) {
158 void disconnectFrom(Graph &G, NodeId NId) {
167 NodeId getN1Id() const { return NIds[0];
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeTypes.cpp | 193 // Walk all nodes in the graph, assigning them a NodeId of 'ReadyToProcess'
331 // Recompute the NodeId and correct processed operands, adding the node to
366 int NodeId = User->getNodeId();
370 if (NodeId > 0) {
371 User->setNodeId(NodeId-1);
374 if (NodeId-1 == ReadyToProcess)
382 if (NodeId == NewNode)
386 // became ready. Its new NodeId is the number of operands it has minus 1
388 assert(NodeId == Unanalyzed && "Unknown node ID!");
466 /// calculate the NodeId. If the node itself changes to a processed node, i
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| RegAllocPBQP.h | 154 void setNodeIdForVReg(unsigned VReg, GraphBase::NodeId NId) {
158 GraphBase::NodeId getNodeIdForVReg(unsigned VReg) const {
174 DenseMap<unsigned, GraphBase::NodeId> VRegToNodeId;
338 typedef GraphBase::NodeId NodeId;
358 void handleAddNode(NodeId NId) {
363 void handleRemoveNode(NodeId NId) {}
364 void handleSetNodeCosts(NodeId NId, const Vector& newCosts) {}
376 void handleDisconnectEdge(EdgeId EId, NodeId NId) {
383 void handleReconnectEdge(EdgeId EId, NodeId NId)
[all...] |
| SelectionDAGNodes.h | 366 /// This function should only be used to add data to the NodeID value.
397 int NodeId;
498 int getNodeId() const { return NodeId; }
501 void setNodeId(int Id) { NodeId = Id; }
779 SubclassData(0), NodeId(-1),
800 SubclassData(0), NodeId(-1), OperandList(nullptr), ValueList(VTs.VTs),
[all...] |
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/ |
| clusapi.h | 113 DWORD NodeId;
[all...] |
| ks.h | 113 ULONG NodeId;
119 ULONG NodeId;
125 ULONG NodeId;
[all...] |
| ksmedia.h | [all...] |
