| /external/tensorflow/tensorflow/compiler/xla/service/graphcycles/ |
| D | graphcycles_test.cc | 202 tensorflow::GraphCycles graph_cycles; in TEST() local
217 PrintGCEdges(&nodes, &graph_cycles); in TEST()
220 ASSERT_EQ(reinterpret_cast<intptr_t>(graph_cycles.GetNodeData(i)), in TEST()
224 CheckEdges(&nodes, &edges, &graph_cycles); in TEST()
225 CheckTransitiveClosure(&nodes, &edges, &graph_cycles); in TEST()
231 int new_node = graph_cycles.NewNode(); in TEST()
234 ASSERT_EQ(nullptr, graph_cycles.GetNodeData(new_node)); in TEST()
235 graph_cycles.SetNodeData( in TEST()
253 graph_cycles.RemoveNode(node); in TEST()
271 if (graph_cycles.InsertEdge(nodes[from], nodes[to])) { in TEST()
[all …]
|
| /external/openscreen/third_party/abseil/src/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /external/libtextclassifier/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /external/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /external/webrtc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /external/rust/crates/grpcio-sys/grpc/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /external/angle/third_party/abseil-cpp/absl/synchronization/internal/ |
| D | graphcycles_test.cc | 196 GraphCycles graph_cycles; in TEST() local
210 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), ptr(node)) << " node " << node; in TEST()
212 CheckEdges(&nodes, &edges, id, &graph_cycles); in TEST()
213 CheckTransitiveClosure(&nodes, &edges, id, &graph_cycles); in TEST()
219 GraphId new_gnode = graph_cycles.GetId(ptr(new_node)); in TEST()
222 ASSERT_EQ(ptr(new_node), graph_cycles.Ptr(new_gnode)); in TEST()
233 graph_cycles.RemoveNode(ptr(node)); in TEST()
234 ASSERT_EQ(graph_cycles.Ptr(Get(id, node)), nullptr); in TEST()
253 if (graph_cycles.InsertEdge(id[nodes[from]], id[nodes[to]])) { in TEST()
276 graph_cycles.RemoveEdge(id[from], id[to]); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/compiler/xla/service/ |
| D | loop_schedule_linearizer.cc | 50 int32 node_id = graph_cycles.NewNode(); in NodeIdForInstruction()
60 return graph_cycles.InsertEdge(source_id, dest_id); in InsertEdge()
65 tensorflow::GraphCycles graph_cycles; member
|
| /external/rust/crates/parking_lot_core/src/ |
| D | parking_lot.rs | 1324 let cycles = graph_cycles(&graph); in check_wait_graph_slow()
1369 fn graph_cycles(g: &DiGraphMap<WaitGraphNode, ()>) -> Vec<Vec<*const ThreadData>> { in graph_cycles() function
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | deadness_analysis.cc | 914 GraphCycles graph_cycles; in GetInputPreds() local
916 CreateCycleDetectionGraph(&graph_, &graph_cycles).status()); in GetInputPreds()
|