/third_party/re2/re2/ |
D | prefilter_tree.h | 63 typedef std::map<std::string, Prefilter*> NodeMap; typedef 93 void AssignUniqueIds(NodeMap* nodes, std::vector<std::string>* atom_vec); 101 Prefilter* CanonicalNode(NodeMap* nodes, Prefilter* node); 111 void PrintDebugInfo(NodeMap* nodes);
|
D | prefilter_tree.cc | 71 NodeMap nodes; in Compile() 108 Prefilter* PrefilterTree::CanonicalNode(NodeMap* nodes, Prefilter* node) { in CanonicalNode() 168 void PrefilterTree::AssignUniqueIds(NodeMap* nodes, in AssignUniqueIds() 367 void PrefilterTree::PrintDebugInfo(NodeMap* nodes) { in PrintDebugInfo()
|
/third_party/boost/libs/graph/example/ |
D | leda-graph-eg.cpp | 21 typedef property_map< graph_t, vertex_all_t >::type NodeMap; in main() typedef 22 NodeMap node_name_map = get(vertex_all, g); in main()
|
/third_party/cef/libcef/renderer/ |
D | dom_document_impl.h | 57 using NodeMap = std::map<blink::WebNode, CefDOMNode*>; variable 58 NodeMap node_map_;
|
D | dom_document_impl.cc | 200 NodeMap::const_iterator it = node_map_.find(node); in GetOrCreateNode() 216 NodeMap::iterator it = node_map_.find(node); in RemoveNode() 235 NodeMap::const_iterator it = node_map_.begin(); in Detach()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/Analysis/ |
D | LazyCallGraph.cpp | 207 : BPA(std::move(G.BPA)), NodeMap(std::move(G.NodeMap)), in LazyCallGraph() 216 NodeMap = std::move(G.NodeMap); in operator =() 1455 assert(G->NodeMap.find(&NewF) == G->NodeMap.end() && in replaceNodeFunction() 1472 G->NodeMap.erase(&OldF); in replaceNodeFunction() 1473 G->NodeMap[&NewF] = &N; in replaceNodeFunction() 1503 auto NI = NodeMap.find(&F); in removeDeadFunction() 1504 if (NI == NodeMap.end()) in removeDeadFunction() 1509 NodeMap.erase(NI); in removeDeadFunction() 1563 for (auto &FunctionNodePair : NodeMap) in updateGraphPtrs()
|
/third_party/node/src/ |
D | memory_tracker.h | 261 NodeMap; typedef 279 NodeMap seen_;
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/SelectionDAG/ |
D | SelectionDAGBuilder.h | 100 DenseMap<const Value*, SDValue> NodeMap; variable 525 if (NodeMap.find(V) == NodeMap.end()) in getNodeForIRValue() 527 return NodeMap[V].getNode(); in getNodeForIRValue() 534 SDValue &N = NodeMap[V]; in setValue()
|
D | SelectionDAGBuilder.cpp | 1024 NodeMap.clear(); in clear() 1328 SDValue N = NodeMap[V]; in handleDebugValue() 1425 SDValue &N = NodeMap[V]; in getValue() 1435 NodeMap[V] = Val; in getValue() 1442 return (NodeMap.find(V) != NodeMap.end()) || in findValue() 1450 SDValue &N = NodeMap[V]; in getNonRegisterValue() 1464 NodeMap[V] = Val; in getNonRegisterValue() 1497 SDValue N1 = NodeMap[V]; in getValueImpl() 1531 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops); in getValueImpl() 1583 return NodeMap[V] = DAG.getBuildVector(VT, getCurSDLoc(), Ops); in getValueImpl() [all …]
|
/third_party/skia/third_party/externals/swiftshader/third_party/subzero/src/ |
D | IceConverter.cpp | 104 NodeMap.clear(); in convertFunction() 188 if (NodeMap.find(BB) == NodeMap.end()) { in mapBasicBlockToNode() 189 NodeMap[BB] = Func->makeNode(); in mapBasicBlockToNode() 191 NodeMap[BB]->setName(BB->getName()); in mapBasicBlockToNode() 193 return NodeMap[BB]; in mapBasicBlockToNode() 651 std::map<const BasicBlock *, Ice::CfgNode *> NodeMap; member in __anon0a7e44cd0111::LLVM2ICEFunctionConverter
|
D | IceOperand.cpp | 108 assert(NodeMap.find(Start) == NodeMap.end()); in addSegment() 109 NodeMap[Start] = Node; in addSegment()
|
D | IceOperand.h | 650 auto Iter = NodeMap.find(Begin); in getNodeForSegment() 651 assert(Iter != NodeMap.end()); in getNodeForSegment() 657 CfgUnorderedMap<InstNumberT, CfgNode *> NodeMap; variable
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/IR/ |
D | ModuleSummaryIndex.cpp | 412 DenseMap<GlobalValue::GUID, std::vector<uint64_t>> NodeMap; in exportToDot() local 471 NodeMap[SummaryIt.first].push_back(ModId); in exportToDot() 526 auto &ModList = NodeMap[E.Dst]; in exportToDot()
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/include/llvm/Analysis/ |
D | LazyCallGraph.h | 964 Node *lookup(const Function &F) const { return NodeMap.lookup(&F); } in lookup() 986 Node *&N = NodeMap[&F]; in get() 1126 DenseMap<const Function *, Node *> NodeMap; variable
|
/third_party/skia/third_party/externals/swiftshader/third_party/llvm-10.0/llvm/lib/CodeGen/ |
D | CodeGenPrepare.cpp | 2984 MapType NodeMap; member in __anona24ce5a20711::PhiNodeSet 2997 if (NodeMap.insert(std::make_pair(Ptr, NodeList.size())).second) { in insert() 3008 auto it = NodeMap.find(Ptr); in erase() 3009 if (it != NodeMap.end()) { in erase() 3010 NodeMap.erase(Ptr); in erase() 3019 NodeMap.clear(); in clear() 3037 return NodeMap.size(); in size() 3042 return NodeMap.count(Ptr); in count() 3053 auto it = NodeMap.find(NodeList[CurrentIndex]); in SkipRemovedElements() 3056 if (it != NodeMap.end() && it->second == CurrentIndex) in SkipRemovedElements()
|
/third_party/typescript/src/compiler/ |
D | utilities.ts | 7088 export type NodeMap<TNode extends Node, TValue> = ESMap<TNode, TValue>; alias
|