OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:FindNode
(Results
1 - 9
of
9
) sorted by null
/external/swiftshader/third_party/PowerVR_SDK/Tools/
PVRTSkipGraph.h
258
CPVRTSkipGraphNode<T>* skipGraphNode(
FindNode
(NewNodeHash));
289
pNode =
FindNode
(nodeData);
295
pDependantNode =
FindNode
(dependantData);
408
CPVRTSkipGraphNode<T>*
FindNode
(const CPVRTHash& Hash)
451
CPVRTSkipGraphNode<T>*
FindNode
(const T& data)
454
return
FindNode
(inputHash);
/external/tensorflow/tensorflow/core/graph/
quantize_training_test.cc
62
Status
FindNode
(Graph* g, const string& name, Node** out) {
113
FindNode
(g, strings::StrCat(identity->name(), "/QuantizeAndDequantizeV2"),
120
FindNode
(g, strings::StrCat(relu->name(), "/QuantizeAndDequantizeV2"),
164
FindNode
(g, strings::StrCat(relu6->name(), "/QuantizeAndDequantizeV2"),
171
FindNode
(g, strings::StrCat(relu->name(), "/QuantizeAndDequantizeV2"),
216
Status s =
FindNode
(g, strings::StrCat(d->name(), "/QuantizeAndDequantizeV2"),
222
FindNode
(g, strings::StrCat(relu->name(), "/QuantizeAndDequantizeV2"),
225
FindNode
(g, strings::StrCat(identity->name(), "/QuantizeAndDequantizeV2"),
227
TF_ASSERT_OK(
FindNode
(
270
Status s =
FindNode
(g, strings::StrCat(d->name(), "/FakeQuantWithMinMaxVars")
[
all
...]
subgraph_test.cc
58
Node*
FindNode
(const string& name) {
65
bool HasNode(const string& name) { return
FindNode
(name) != nullptr; }
83
Node* n =
FindNode
(s);
209
Node* n =
FindNode
("_recv_W1_0");
221
Node* n =
FindNode
("_arg_W1_0_0");
graph_constructor_test.cc
113
Node*
FindNode
(const string& name) {
120
bool HasNode(const string& name) { return
FindNode
(name) != nullptr; }
1200
Node* t1 =
FindNode
("t1");
1253
Node* t1 =
FindNode
("import/t1");
1258
Node* t2 =
FindNode
("import/t2");
1263
Node* t3 =
FindNode
("import/t3");
[
all
...]
graph_test.cc
114
Node*
FindNode
(const string& name) {
450
Node* a =
FindNode
("A");
451
Node* b =
FindNode
("B");
452
Node* c =
FindNode
("C");
502
Node* a =
FindNode
("A");
503
Node* b =
FindNode
("B");
504
Node* c =
FindNode
("C");
/system/extras/simpleperf/
CallChainJoiner_test.cpp
47
ASSERT_NE(cache.
FindNode
(0, ip[0], sp[0]), nullptr);
48
ASSERT_NE(cache.
FindNode
(1, ip[0], sp[0]), nullptr);
55
ASSERT_EQ(cache.
FindNode
(0, ip[0], sp[0]), nullptr);
56
ASSERT_NE(cache.
FindNode
(0, ip2[0], sp[0]), nullptr);
57
ASSERT_NE(cache.
FindNode
(1, ip[0], sp[0]), nullptr);
64
ASSERT_EQ(cache.
FindNode
(1, ip[0], sp[0]), nullptr);
65
ASSERT_NE(cache.
FindNode
(0, ip2[0], sp[0]), nullptr);
66
ASSERT_NE(cache.
FindNode
(1, ip[0], sp2[0]), nullptr);
150
ASSERT_EQ(cache.
FindNode
(0, 0xa, 0xa), nullptr);
CallChainJoiner.h
79
CacheNode*
FindNode
(uint32_t tid, uint64_t ip, uint64_t sp) {
CallChainJoiner.cpp
113
CacheNode* node =
FindNode
(tid, ip, sp);
/external/pdfium/core/fpdfdoc/
cpdf_interform.cpp
449
Node*
FindNode
(const WideString& full_name);
537
CFieldTree::Node* CFieldTree::
FindNode
(const WideString& full_name) {
790
CFieldTree::Node* pNode = m_pFieldTree->
FindNode
(csFieldName);
799
CFieldTree::Node* pNode = m_pFieldTree->
FindNode
(csFieldName);
[
all
...]
Completed in 112 milliseconds