| /external/libchrome/base/sampling_heap_profiler/ |
| D | lock_free_address_hash_set.h | 92 Node* FindNode(void* key) const;
109 return FindNode(key) != nullptr; in Contains()
113 Node* node = FindNode(key); in Remove()
123 inline LockFreeAddressHashSet::Node* LockFreeAddressHashSet::FindNode( in FindNode() function
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | quantize_training_test.cc | 63 Status FindNode(Graph* g, const string& name, Node** out) { in FindNode() function in tensorflow::__anon84118ae70111::QuantizeTrainingTest
114 FindNode(g, strings::StrCat(identity->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
121 FindNode(g, strings::StrCat(relu->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
165 FindNode(g, strings::StrCat(relu6->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
172 FindNode(g, strings::StrCat(relu->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
217 Status s = FindNode(g, strings::StrCat(d->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
223 FindNode(g, strings::StrCat(relu->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
226 FindNode(g, strings::StrCat(identity->name(), "/QuantizeAndDequantizeV2"), in TEST_F()
228 TF_ASSERT_OK(FindNode( in TEST_F()
271 Status s = FindNode(g, strings::StrCat(d->name(), "/FakeQuantWithMinMaxVars"), in TEST_F()
[all …]
|
| D | graph_constructor_test.cc | 122 Node* FindNode(const string& name) { in FindNode() function in tensorflow::__anon099581520111::GraphConstructorTest
129 bool HasNode(const string& name) { return FindNode(name) != nullptr; } in HasNode()
1209 Node* t1 = FindNode("t1"); in TEST_F()
1262 Node* t1 = FindNode("import/t1"); in TEST_F()
1267 Node* t2 = FindNode("import/t2"); in TEST_F()
1272 Node* t3 = FindNode("import/t3"); in TEST_F()
1318 Node* t2 = FindNode("t2"); in TEST_F()
1550 Node* t1 = FindNode("t1"); in TEST_F()
1590 Node* t1 = FindNode("t1"); in TEST_F()
1630 Node* t1 = FindNode("t1"); in TEST_F()
[all …]
|
| D | mkl_layout_pass_test.cc | 68 Node* FindNode(const string& name) { in FindNode() function in tensorflow::__anonc71d68320111::MklLayoutPassTest
647 Node* a1 = FindNode("A1"); \
648 Node* c = FindNode("C"); \
649 Node* e = FindNode("E"); \
704 Node* a1 = FindNode("A1"); \
705 Node* c = FindNode("C"); \
706 Node* e = FindNode("E"); \
2330 Node* x = FindNode("X"); \
2331 Node* c = FindNode("C"); \
2332 Node* f = FindNode("F"); \
[all …]
|
| /external/perfetto/src/trace_processor/importers/memory_tracker/ |
| D | graph_unittest.cc | 141 ASSERT_EQ(graph.FindNode("simple/test/1"), first); in TEST()
142 ASSERT_EQ(graph.FindNode("simple/test/2"), second); in TEST()
143 ASSERT_EQ(graph.FindNode("simple/other/1"), third); in TEST()
144 ASSERT_EQ(graph.FindNode("complex/path"), fourth); in TEST()
145 ASSERT_EQ(graph.FindNode("complex/path/child/1"), fifth); in TEST()
182 Node* parent = graph.FindNode("simple/test"); in TEST()
187 Node* grandparent = graph.FindNode("simple"); in TEST()
|
| D | graph_processor.cc | 121 if (process->FindNode("winheap")) { in AddOverheadsAndPropagateEntries()
124 } else if (process->FindNode("malloc")) { in AddOverheadsAndPropagateEntries()
290 PERFETTO_DCHECK(node == process->FindNode(path)); in CollectAllocatorNodes()
446 PERFETTO_DCHECK(process->FindNode(allocator)); in AssignTracingOverhead()
449 Node* tracing_node = process->FindNode("tracing"); in AssignTracingOverhead()
|
| D | graph_processor_unittest.cc | 136 auto* first_child = id_to_node_it->second->FindNode("test1"); in TEST_F()
148 auto* direct = id_to_node_it->second->FindNode("test1/test2/test3"); in TEST_F()
160 ASSERT_EQ(edge_it->target(), id_to_node_it->second->FindNode("target")); in TEST_F()
391 ASSERT_NE(process->FindNode("malloc/allocated_objects/tracing_overhead"), in TEST_F()
|
| D | graph.cc | 117 Node* Process::FindNode(const std::string& path) { in FindNode() function in perfetto::trace_processor::Process
|
| /external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode() function
460 Node* n = FindNode(rep_, id); in Ptr()
466 return FindNode(rep_, node) != nullptr; in HasNode()
470 Node* xn = FindNode(rep_, x); in HasEdge()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
475 Node* xn = FindNode(rep_, x); in RemoveEdge()
476 Node* yn = FindNode(rep_, y); in RemoveEdge()
496 Node* nx = FindNode(r, idx); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
[all …]
|
| /external/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode() function
460 Node* n = FindNode(rep_, id); in Ptr()
466 return FindNode(rep_, node) != nullptr; in HasNode()
470 Node* xn = FindNode(rep_, x); in HasEdge()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
475 Node* xn = FindNode(rep_, x); in RemoveEdge()
476 Node* yn = FindNode(rep_, y); in RemoveEdge()
496 Node* nx = FindNode(r, idx); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode() function
460 Node* n = FindNode(rep_, id); in Ptr()
466 return FindNode(rep_, node) != nullptr; in HasNode()
470 Node* xn = FindNode(rep_, x); in HasEdge()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
475 Node* xn = FindNode(rep_, x); in RemoveEdge()
476 Node* yn = FindNode(rep_, y); in RemoveEdge()
496 Node* nx = FindNode(r, idx); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles.cc | 359 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode() function
460 Node* n = FindNode(rep_, id); in Ptr()
466 return FindNode(rep_, node) != nullptr; in HasNode()
470 Node* xn = FindNode(rep_, x); in HasEdge()
471 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
475 Node* xn = FindNode(rep_, x); in RemoveEdge()
476 Node* yn = FindNode(rep_, y); in RemoveEdge()
496 Node* nx = FindNode(r, idx); in InsertEdge()
497 Node* ny = FindNode(r, idy); in InsertEdge()
627 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| D | graphcycles.cc | 360 static Node* FindNode(GraphCycles::Rep* rep, GraphId id) { in FindNode() function
461 Node* n = FindNode(rep_, id); in Ptr()
467 return FindNode(rep_, node) != nullptr; in HasNode()
471 Node* xn = FindNode(rep_, x); in HasEdge()
472 return xn && FindNode(rep_, y) && xn->out.contains(NodeIndex(y)); in HasEdge()
476 Node* xn = FindNode(rep_, x); in RemoveEdge()
477 Node* yn = FindNode(rep_, y); in RemoveEdge()
497 Node* nx = FindNode(r, idx); in InsertEdge()
498 Node* ny = FindNode(r, idy); in InsertEdge()
628 if (FindNode(r, idx) == nullptr || FindNode(r, idy) == nullptr) return 0; in FindPath()
[all …]
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | subgraph_test.cc | 58 Node* FindNode(const string& name) { in FindNode() function in tensorflow::__anonc5e063bd0111::SubgraphTest
65 bool HasNode(const string& name) { return FindNode(name) != nullptr; } in HasNode()
83 Node* n = FindNode(s); in ExpectNodes()
209 Node* n = FindNode("_recv_W1_0"); in TEST_F()
221 Node* n = FindNode("_arg_W1_0_0"); in TEST_F()
|
| D | graph_test.cc | 117 Node* FindNode(const string& name) { in FindNode() function in tensorflow::__anon465791930111::GraphTest
453 Node* a = FindNode("A"); in TEST_F()
454 Node* b = FindNode("B"); in TEST_F()
455 Node* c = FindNode("C"); in TEST_F()
505 Node* a = FindNode("A"); in TEST_F()
506 Node* b = FindNode("B"); in TEST_F()
507 Node* c = FindNode("C"); in TEST_F()
660 EXPECT_EQ(node_name_index[node_name], FindNode(node_name)); in TEST_F()
|
| /external/pdfium/core/fpdfdoc/ |
| D | cpdf_interactiveform.cpp | 468 Node* FindNode(const WideString& full_name);
556 CFieldTree::Node* CFieldTree::FindNode(const WideString& full_name) { in FindNode() function in CFieldTree
697 CFieldTree::Node* pNode = m_pFieldTree->FindNode(csFieldName); in CountFields()
707 CFieldTree::Node* pNode = m_pFieldTree->FindNode(csFieldName); in GetField()
|
| /external/perfetto/include/perfetto/ext/trace_processor/importers/memory_tracker/ |
| D | graph.h | 63 GlobalNodeGraph::Node* FindNode(const std::string& path);
|
| /external/tensorflow/tensorflow/core/kernels/data/ |
| D | hash_utils.cc | 69 Status FindNode(const GraphDef& graph, const string& name, in FindNode() function
183 TF_RETURN_IF_ERROR(FindNode(*graph_, node_name, &input_node)); in Init()
|