Home
last modified time | relevance | path

Searched refs:g_ (Results 1 – 25 of 178) sorted by relevance

12345678

/external/tensorflow/tensorflow/compiler/mlir/hlo/lib/utils/
Dcycle_detector_test.cc22 GraphCyclesTest() : g_(100) {} in GraphCyclesTest()
24 bool AddEdge(int x, int y) { return g_.InsertEdge(x, y); } in AddEdge()
34 mlir::GraphCycles g_; member in GraphCyclesTest
55 g_.RemoveEdge(2, 3); in TEST_F()
56 EXPECT_FALSE(g_.HasEdge(2, 3)); in TEST_F()
65 EXPECT_TRUE(g_.IsReachable(1, 5)); in TEST_F()
66 EXPECT_FALSE(g_.IsReachable(5, 1)); in TEST_F()
77 EXPECT_FALSE(g_.ContractEdge(1, 3).hasValue()); in TEST_F()
78 EXPECT_TRUE(g_.HasEdge(1, 3)); in TEST_F()
81 EXPECT_EQ(*g_.ContractEdge(1, 2), 2); in TEST_F()
[all …]
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles_test.cc381 tensorflow::GraphCycles g_; member in GraphCyclesTest
386 CHECK_EQ(i, g_.NewNode()); in GraphCyclesTest()
388 CHECK(g_.CheckInvariants()); in GraphCyclesTest()
391 bool AddEdge(int x, int y) { return g_.InsertEdge(x, y); } in AddEdge()
399 CHECK(g_.CheckInvariants()); in AddMultiples()
405 int np = g_.FindPath(x, y, kPathSize, path); in Path()
423 CHECK(g_.CheckInvariants()); in TEST_F()
430 CHECK(g_.CheckInvariants()); in TEST_F()
436 CHECK(g_.CheckInvariants()); in TEST_F()
439 CHECK(g_.CheckInvariants()); in TEST_F()
[all …]
/external/openscreen/third_party/abseil/src/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
/external/libtextclassifier/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
/external/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
/external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
/external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
/external/angle/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc357 GraphCycles g_; member in absl::synchronization_internal::GraphCyclesTest
370 id_[i] = g_.GetId(Ptr(i)); in GraphCyclesTest()
372 CheckInvariants(g_); in GraphCyclesTest()
376 return g_.InsertEdge(Get(id_, x), Get(id_, y)); in AddEdge()
385 CheckInvariants(g_); in AddMultiples()
390 int np = g_.FindPath(Get(id_, x), Get(id_, y), ABSL_ARRAYSIZE(path), path); in Path()
399 snprintf(buf, sizeof(buf), "%d", Num(g_.Ptr(path[i]))); in Path()
408 CheckInvariants(g_); in TEST_F()
415 CheckInvariants(g_); in TEST_F()
421 CheckInvariants(g_); in TEST_F()
[all …]
/external/llvm-project/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h139 uptr size() const { return g_.size(); } in size()
146 g_.clear(); in clear()
167 g_.removeEdgesTo(recycled_nodes_); in newNode()
176 g_.clear(); in newNode()
192 g_.removeEdgesFrom(idx); in removeNode()
205 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_)); in onLockBefore()
228 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) in hasAllEdges()
245 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx, in addEdges()
315 uptr res = g_.findShortestPath(idx, tmp_bv_, path, path_size); in findPathToLock()
348 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); in testOnlyHasEdge()
[all …]
/external/compiler-rt/lib/sanitizer_common/
Dsanitizer_deadlock_detector.h142 uptr size() const { return g_.size(); } in size()
149 g_.clear(); in clear()
171 g_.removeEdgesTo(recycled_nodes_); in newNode()
180 g_.clear(); in newNode()
196 g_.removeEdgesFrom(idx); in removeNode()
209 return g_.isReachable(cur_idx, dtls->getLocks(current_epoch_)); in onLockBefore()
232 if (!g_.hasEdge(dtls->getLock(i), cur_idx)) in hasAllEdges()
249 uptr n_added_edges = g_.addEdges(dtls->getLocks(current_epoch_), cur_idx, in addEdges()
321 uptr res = g_.findShortestPath(idx, tmp_bv_, path, path_size); in findPathToLock()
354 return g_.hasEdge(nodeToIndex(l1), nodeToIndex(l2)); in testOnlyHasEdge()
[all …]
/external/arm-trusted-firmware/services/std_svc/sdei/
Dsdei_state.c21 #define g_ 0U macro
25 #define reg_ (r_ | e_ | g_)
27 #define rEg_ (r_ | E_ | g_)
29 #define Reg_ (R_ | e_ | g_)
31 #define REg_ (R_ | E_ | g_)
/external/tensorflow/tensorflow/core/graph/
Dsubgraph_test.cc44 SubgraphTest() : g_(new Graph(OpRegistry::Global())) { in SubgraphTest()
55 TF_CHECK_OK(ConvertGraphDefToGraph(opts, gdef_, g_.get())); in ExpectOK()
59 for (Node* n : g_->nodes()) { in FindNode()
70 for (Node* n : g_->nodes()) { in ExpectNodes()
96 for (const Edge* e : g_->edges()) { in HasEdge()
111 CopyGraph(*g_, subgraph); in Subgraph()
132 g_.reset(subgraph); in Subgraph()
136 Graph* graph() { return g_.get(); } in graph()
140 std::unique_ptr<Graph> g_; member in tensorflow::__anonf2fe6f640111::SubgraphTest
Doptimizer_cse.cc59 explicit OptimizerCSE(Graph* g) : g_(g) {} in OptimizerCSE()
68 Graph* g_; member in tensorflow::OptimizerCSE
283 GetReversePostOrder(*g_, &order); in Optimize()
321 g_->AddEdge(*candidate, e->src_output(), e->dst(), e->dst_input()); in Optimize()
325 g_->RemoveNode(n); in Optimize()
/external/tensorflow/tensorflow/core/common_runtime/
Dquantize_training_test.cc47 void Reset() { g_.reset(new Graph(OpRegistry::Global())); } in Reset()
51 return test::graph::Constant(g_.get(), test::AsTensor(values, shape)); in Constant()
73 std::unique_ptr<Graph> g_; member in tensorflow::__anonad8d0a4e0111::QuantizeTrainingTest
87 Graph* g = g_.get(); in TEST_F()
138 Graph* g = g_.get(); in TEST_F()
181 Graph* g = g_.get(); in TEST_F()
235 Graph* g = g_.get(); in TEST_F()
289 Graph* graph = g_.get(); in TEST_F()
326 Graph* graph = g_.get(); in TEST_F()
367 Graph* g = g_.get(); in TEST_F()
[all …]
Dgraph_constructor.cc177 g_(g), in GraphConstructor()
203 FixupSourceAndSinkEdges(g_); in TryImport()
295 Graph* g_; member in tensorflow::__anond78e089a0111::GraphConstructor
577 existing_nodes_.reserve(g_->num_nodes()); in EnsureNoNameCollisions()
579 for (Node* n : g_->nodes()) { in EnsureNoNameCollisions()
778 *node = g_->AddNode(std::move(node_def), &status); in MakeNode()
837 TF_RETURN_IF_ERROR(g_->op_registry()->LookUpOpDef(node_def->op(), &op_def)); in ModifyNodeDefForImport()
1051 TF_RETURN_IF_ERROR(g_->op_registry()->LookUpOpDef(node_def.op(), &op_def)); in IsNodeFullyMapped()
1114 TF_RETURN_IF_ERROR(g_->AddFunctionLibrary(*library())); in Convert()
1237 g_->op_registry()->LookUpOpDef(node_def.op(), &op_def)); in Convert()
[all …]
/external/llvm-project/clang/test/CodeGenCXX/
Ddebug-info-limited-ctor.cpp41 G() : g_(0) {} in G()
43 int g_; member
/external/tensorflow/tensorflow/c/eager/
Dc_api_unified_experimental_graph.cc97 explicit GraphOperation(TF_Graph* g) : TracingOperation(kGraph), g_(g) {} in GraphOperation()
120 mutex_lock l(g_->mu); in SetOpName()
121 op_.reset(new TF_OperationDescription(g_, op_type_.c_str(), in SetOpName()
122 g_->graph.NewName(op_name).c_str())); in SetOpName()
168 retvals[i] = new GraphTensor({operation, i}, g_); in Execute()
313 TF_Graph* g_; member in tensorflow::tracing::graph::GraphOperation
/external/XNNPACK/test/
Dzip-microkernel-tester.h41 this->g_ = g; in g()
46 return this->g_; in g()
160 size_t g_{1};
/external/deqp-deps/amber/src/
Dcommand.h392 void SetG(float g) { g_ = g; } in SetG()
393 float GetG() const { return g_; } in GetG()
420 float g_ = 0.0; variable
605 void SetG(float g) { g_ = g; } in SetG()
606 float GetG() const { return g_; } in GetG()
618 float g_ = 0.0; variable
/external/skia/tests/
DGrVxTest.cpp92 vec<N> g_ = (4*d*xx + 2*c)*x; in DEF_TEST() local
95 err_ = (f_*g - f*g_)/gg + 1/q; in DEF_TEST()
102 vec<N> err__ = ((f__*g - f*g__)*g - (f_*g - f*g_)*2*g_) / (gg*g) + x/((1 - xx)*q); in DEF_TEST()
/external/tensorflow/tensorflow/lite/toco/
Ddump_graphviz.cc72 Color(uint8 r, uint8 g, uint8 b) : r_(r), g_(g), b_(b) {} in Color()
75 g_((word & 0x0000FF00) >> 8), in Color()
81 return StringF("#%.2X%.2X%.2X", r_, g_, b_); in AsHexString()
92 const float luminance = 0.2126f * r_ + 0.7152f * g_ + 0.0722f * b_; in TextColorString()
98 uint8 r_ = 0, g_ = 0, b_ = 0; member in toco::__anond0a6cb910111::Color
/external/llvm/test/Transforms/LoopVectorize/ARM/
Dgather-cost.ll11 @g_ = global i8 0, align 4
85 store i8 %g.0.lcssa, i8* @g_, align 4
/external/llvm-project/llvm/test/Transforms/LoopVectorize/X86/
Dgather-cost.ll10 @g_ = global i8 0, align 1
83 store i8 %g.0.lcssa, i8* @g_, align 1
/external/llvm-project/llvm/test/Transforms/LoopVectorize/AArch64/
Dgather-cost.ll10 @g_ = global i8 0, align 1
82 store i8 %g.0.lcssa, i8* @g_, align 1
/external/llvm/test/Transforms/LoopVectorize/X86/
Dgather-cost.ll10 @g_ = global i8 0, align 1
83 store i8 %g.0.lcssa, i8* @g_, align 1

12345678