| /external/skia/src/sksl/ |
| D | SkSLASTNode.h | 253 struct NodeData { struct
283 NodeData() = default;
285 NodeData(Operator op) in NodeData() argument
290 NodeData(const StringFragment& data) in NodeData() function
295 NodeData(bool data) in NodeData() argument
300 NodeData(SKSL_INT data) in NodeData() argument
305 NodeData(SKSL_FLOAT data) in NodeData() function
310 NodeData(const Modifiers& data) in NodeData() argument
315 NodeData(const FunctionData& data) in NodeData() argument
320 NodeData(const VarData& data) in NodeData() argument
[all …]
|
| /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 explicit node_iterator(NodeData* itr);
136 const NodeData* itr;
140 explicit 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/protobuf/src/google/protobuf/compiler/ |
| D | scc.h | 73 struct NodeData { struct
79 std::map<const Descriptor*, NodeData> cache_; argument
90 NodeData DFS(const Descriptor* descriptor) { in DFS()
95 NodeData& result = cache_[descriptor]; in DFS()
105 NodeData child_data = DFS(dep); in DFS()
108 NodeData child_data = cache_[dep]; in DFS()
|
| /external/llvm-project/llvm/include/llvm/CodeGen/ |
| D | ScheduleDFS.h | 76 struct NodeData { struct
80 NodeData() = default; argument
102 std::vector<NodeData> DFSNodeData;
|
| /external/swiftshader/third_party/llvm-10.0/llvm/include/llvm/CodeGen/ |
| D | ScheduleDFS.h | 76 struct NodeData { struct
80 NodeData() = default; argument
102 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/angle/src/compiler/translator/ |
| D | OutputSPIRV.cpp | 110 struct NodeData struct
176 bool IsAccessChainUnindexedLValue(const NodeData &data) in IsAccessChainUnindexedLValue()
221 void accessChainOnPush(NodeData *data, const TType &parentType, size_t index);
222 void accessChainPush(NodeData *data, spirv::IdRef index, spirv::IdRef typeId) const;
223 void accessChainPushLiteral(NodeData *data,
226 void accessChainPushSwizzle(NodeData *data,
230 void accessChainPushDynamicComponent(NodeData *data, spirv::IdRef index, spirv::IdRef typeId);
231 spirv::IdRef accessChainCollapse(NodeData *data);
232 spirv::IdRef accessChainLoad(NodeData *data,
235 void accessChainStore(NodeData *data, spirv::IdRef value, const TType &valueType);
[all …]
|
| /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>();
516 NodeData nodeData = null;
526 fullNodeData.put(type, nodeData = new NodeData( in fullNodeData.put()
|