| /external/google-fruit/include/fruit/impl/data_structures/ |
| D | semistatic_graph.h | 69 struct NodeData { struct
88 FixedSizeVector<NodeData> nodes; argument
101 NodeData* nodeAtId(InternalNodeId internalNodeId);
102 const NodeData* nodeAtId(InternalNodeId internalNodeId) const;
104 static NodeData* nodeAtId(NodeData* nodes_begin, InternalNodeId internalNodeId);
105 static const NodeData* nodeAtId(const NodeData* nodes_begin, InternalNodeId internalNodeId);
112 NodeData* itr;
116 node_iterator(NodeData* itr);
136 const NodeData* itr;
140 const_node_iterator(const NodeData* itr);
|
| D | semistatic_graph.defn.h | 34 inline SemistaticGraph<NodeId, Node>::node_iterator::node_iterator(NodeData* itr) : itr(itr) {} in node_iterator()
60 inline SemistaticGraph<NodeId, Node>::const_node_iterator::const_node_iterator(const NodeData* itr)… in const_node_iterator()
139 const NodeData* p = nodeAtId(*internalNodeIdPtr); in find()
153 NodeData* p = nodeAtId(*internalNodeIdPtr); in find()
162 inline typename SemistaticGraph<NodeId, Node>::NodeData*
168 inline const typename SemistaticGraph<NodeId, Node>::NodeData*
174 inline typename SemistaticGraph<NodeId, Node>::NodeData*
175 SemistaticGraph<NodeId, Node>::nodeAtId(NodeData* nodes_begin, InternalNodeId internalNodeId) { in nodeAtId()
176 FruitAssert(internalNodeId.id % sizeof(NodeData) == 0); in nodeAtId()
177 …NodeData* p = reinterpret_cast<NodeData*>(reinterpret_cast<char*>(nodes_begin) + internalNodeId.id… in nodeAtId()
[all …]
|
| D | semistatic_graph.templates.h | 100 indexing_iterator<itr_t, sizeof(NodeData)>{node_ids.begin(), 0}, in SemistaticGraph()
101 … indexing_iterator<itr_t, sizeof(NodeData)>{node_ids.end(), node_ids.size() * sizeof(NodeData)}, in SemistaticGraph()
110 nodes = FixedSizeVector<NodeData>(first_unused_index, NodeData{ in SemistaticGraph()
121 NodeData& nodeData = *nodeAtId(node_index_map.at(i->getId())); in SemistaticGraph()
175 p.second = InternalNodeId{first_unused_index * sizeof(NodeData)}; in SemistaticGraph()
183 nodes = FixedSizeVector<NodeData>(x.nodes, first_unused_index); in SemistaticGraph()
186 nodes.push_back(NodeData{ in SemistaticGraph()
198 NodeData& nodeData = *nodeAtId(node_index_map.at(i->getId())); in SemistaticGraph()
219 for (NodeData& data : nodes) { in checkFullyConstructed()
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/Heuristics/ |
| D | Briggs.h | 89 struct NodeData { struct
97 NodeData() in NodeData() function
138 NodeData &nd = getHeuristicNodeData(nItr); in addToHeuristicReduceList()
188 NodeData &n1 = getHeuristicNodeData(n1Itr), in preUpdateEdgeCosts()
218 NodeData &n1 = getHeuristicNodeData(n1Itr), in handleAddEdge()
261 NodeData &nd = getHeuristicNodeData(nItr); in handleRemoveEdge()
298 NodeData& getHeuristicNodeData(Graph::NodeItr nItr) { in getHeuristicNodeData()
361 NodeData &nd = getHeuristicNodeData(nItr); in addEdgeContributions()
388 NodeData &nd = getHeuristicNodeData(nItr); in subtractEdgeContributions()
407 NodeData &nd = getHeuristicNodeData(nItr); in updateAllocability()
[all …]
|
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/ |
| D | HeuristicSolver.h | 40 typedef typename HImpl::NodeData HeuristicNodeData;
52 class NodeData {
54 NodeData() : solverDegree(0) {} in NodeData() function
109 typedef std::list<NodeData> NodeDataList;
166 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in removeSolverEdge()
238 NodeData &nd = getSolverNodeData(xnItr); in applyR1()
290 NodeData &nd = getSolverNodeData(xnItr); in applyR2()
394 NodeData& getSolverNodeData(Graph::NodeItr nItr) { in getSolverNodeData()
395 return *static_cast<NodeData*>(g.getNodeData(nItr)); in getSolverNodeData()
404 NodeData &n1Data = getSolverNodeData(g.getEdgeNode1(eItr)), in addSolverEdge()
[all …]
|
| /external/v8/src/compiler/ |
| D | control-equivalence.h | 83 struct NodeData : ZoneObject { in NON_EXPORTED_BASE() struct
84 explicit NodeData(Zone* zone) in NON_EXPORTED_BASE() function
97 typedef ZoneVector<NodeData*> Data; in NON_EXPORTED_BASE()
131 NodeData* GetData(Node* node) { in NON_EXPORTED_BASE()
139 node_data_[index] = new (zone_) NodeData(zone_); in NON_EXPORTED_BASE()
|
| /external/swiftshader/third_party/llvm-7.0/llvm/include/llvm/CodeGen/ |
| D | ScheduleDFS.h | 77 struct NodeData { struct
81 NodeData() = default; argument
103 std::vector<NodeData> DFSNodeData;
|
| /external/llvm/include/llvm/CodeGen/ |
| D | ScheduleDFS.h | 77 struct NodeData { struct
81 NodeData(): InstrCount(0), SubtreeID(InvalidSubtreeID) {} in NodeData() argument
103 std::vector<NodeData> DFSNodeData;
|
| /external/cldr/tools/cldr-unittest/src/org/unicode/cldr/unittest/ |
| D | TestDTDAttributes.java | 369 CurrentData.NodeData data = CurrentData.fullNodeData.get(type); in checkNodeData()
495 static class NodeData { class in TestDTDAttributes.CurrentData
507 NodeData(DtdType type) { in NodeData() method in TestDTDAttributes.CurrentData.NodeData
512 static Map<DtdType, NodeData> fullNodeData = new HashMap<DtdType, NodeData>();
517 NodeData nodeData = null;
527 fullNodeData.put(type, nodeData = new NodeData( in fullNodeData.put()
|