Home
last modified time | relevance | path

Searched refs:AddEdge (Results 1 - 25 of 33) sorted by relevance

12

/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
H A Dgraphcycles_test.cc375 bool AddEdge(int x, int y) { in AddEdge() function in absl::synchronization_internal::GraphCyclesTest
382 EXPECT_TRUE(AddEdge(x, 2*x)) << x; in AddMultiples()
383 EXPECT_TRUE(AddEdge(x, 3*x)) << x; in AddMultiples()
413 EXPECT_FALSE(AddEdge(8, 4)); in TEST_F()
420 EXPECT_TRUE(AddEdge(16, 9)); in TEST_F()
422 EXPECT_FALSE(AddEdge(9, 2)); in TEST_F()
428 ASSERT_TRUE(AddEdge(2, 4)); in TEST_F()
429 ASSERT_TRUE(AddEdge(4, 6)); in TEST_F()
430 ASSERT_TRUE(AddEdge(6, 8)); in TEST_F()
431 ASSERT_TRUE(AddEdge( in TEST_F()
[all...]
/third_party/node/deps/v8/src/heap/cppgc-js/
H A Dcpp-snapshot.cc54 // `AddEdge`. We accept overriding the wrapper node in such cases, in SetWrapperNode()
441 void AddEdge(State& parent, const HeapObjectHeader& header, in AddEdge() function in v8::internal::final
457 graph_.AddEdge(parent.get_node(), current.get_node(), in AddEdge()
460 graph_.AddEdge(parent.get_node(), current.get_node()); in AddEdge()
464 void AddEdge(State& parent, const TracedReferenceBase& ref, in AddEdge() function in v8::internal::final
475 graph_.AddEdge(parent.get_node(), v8_node, in AddEdge()
478 graph_.AddEdge(parent.get_node(), v8_node); in AddEdge()
530 graph_.AddEdge(root.get_node(), child.get_node(), in AddRootEdge()
534 graph_.AddEdge(root.get_node(), child.get_node()); in AddRootEdge()
683 graph_builder_.AddEdge(
[all...]
/third_party/node/src/
H A Dmemory_tracker-inl.h111 graph_->AddEdge(CurrentNode(), it->second, edge_name); in TrackField()
233 graph_->AddEdge(CurrentNode(), graph_->V8Node(value), edge_name); in TrackField()
279 graph_->AddEdge(CurrentNode(), it->second, edge_name); in Track()
312 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); in AddNode()
315 graph_->AddEdge(n, n->JSWrapperNode(), "native_to_javascript"); in AddNode()
316 graph_->AddEdge(n->JSWrapperNode(), n, "javascript_to_native"); in AddNode()
328 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); in AddNode()
H A Dheap_utils.cc99 void AddEdge(Node* from, Node* to, const char* name = nullptr) override {
/third_party/ninja/src/
H A Dmissing_deps_test.cc66 Edge* header_edge = state_.AddEdge(&generator_rule_); in CreateInitialState()
68 Edge* compile_edge = state_.AddEdge(&compile_rule_); in CreateInitialState()
132 Edge* intermediate_edge = state_.AddEdge(&generator_rule_); in TEST_F()
H A Dstate_test.cc36 Edge* edge = state.AddEdge(rule); in TEST()
H A Dstate.h102 Edge* AddEdge(const Rule* rule);
H A Dstate.cc86 Edge* State::AddEdge(const Rule* rule) { in AddEdge() function in State
H A Dmanifest_parser.cc321 Edge* edge = state_->AddEdge(rule); in ParseEdge()
/third_party/skia/third_party/externals/spirv-tools/source/opt/
H A Dloop_fusion.cpp653 cfg->AddEdge(last_block_of_0->id(), first_block_of_1->id()); in Fuse()
655 cfg->AddEdge(last_block_of_1->id(), loop_0_->GetContinueBlock()->id()); in Fuse()
657 cfg->AddEdge(loop_0_->GetContinueBlock()->id(), in Fuse()
660 cfg->AddEdge(condition_block_of_0->id(), loop_1_->GetMergeBlock()->id()); in Fuse()
H A Dcfg.h117 void AddEdge(uint32_t pred_blk_id, uint32_t succ_blk_id) { in AddEdge() function in spvtools::opt::CFG
H A Dloop_unswitch_pass.cpp204 cfg.AddEdge(pid, loop_merge_block->id()); in PerformUnswitch()
253 cfg.AddEdge(if_block->id(), loop_pre_header->id()); in PerformUnswitch()
H A Dcfg.cpp56 [blk_id, this](const uint32_t succ_id) { AddEdge(blk_id, succ_id); }); in AddEdges()
H A Dloop_peeling.cpp86 cfg.AddEdge(cloned_loop_exit, loop_->GetHeaderBlock()->id()); in DuplicateAndConnectLoop()
371 cfg.AddEdge(bb_pred->id(), new_bb->id()); in CreateBlockBefore()
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
H A Dloop_fusion.cpp653 cfg->AddEdge(last_block_of_0->id(), first_block_of_1->id()); in Fuse()
655 cfg->AddEdge(last_block_of_1->id(), loop_0_->GetContinueBlock()->id()); in Fuse()
657 cfg->AddEdge(loop_0_->GetContinueBlock()->id(), in Fuse()
660 cfg->AddEdge(condition_block_of_0->id(), loop_1_->GetMergeBlock()->id()); in Fuse()
H A Dcfg.h117 void AddEdge(uint32_t pred_blk_id, uint32_t succ_blk_id) { in AddEdge() function in spvtools::opt::CFG
H A Dloop_unswitch_pass.cpp204 cfg.AddEdge(pid, loop_merge_block->id()); in PerformUnswitch()
253 cfg.AddEdge(if_block->id(), loop_pre_header->id()); in PerformUnswitch()
H A Dcfg.cpp56 [blk_id, this](const uint32_t succ_id) { AddEdge(blk_id, succ_id); }); in AddEdges()
/third_party/spirv-tools/source/opt/
H A Dloop_fusion.cpp656 cfg->AddEdge(last_block_of_0->id(), first_block_of_1->id()); in Fuse()
658 cfg->AddEdge(last_block_of_1->id(), loop_0_->GetContinueBlock()->id()); in Fuse()
660 cfg->AddEdge(loop_0_->GetContinueBlock()->id(), in Fuse()
663 cfg->AddEdge(condition_block_of_0->id(), loop_1_->GetMergeBlock()->id()); in Fuse()
H A Dcfg.h125 void AddEdge(uint32_t pred_blk_id, uint32_t succ_blk_id) { in AddEdge() function in spvtools::opt::CFG
H A Dloop_unswitch_pass.cpp197 cfg.AddEdge(pid, loop_merge_block->id()); in PerformUnswitch()
246 cfg.AddEdge(if_block->id(), loop_pre_header->id()); in PerformUnswitch()
H A Dcfg.cpp56 [blk_id, this](const uint32_t succ_id) { AddEdge(blk_id, succ_id); }); in AddEdges()
/third_party/skia/third_party/externals/abseil-cpp/absl/strings/internal/
H A Dcord_rep_btree.cc290 result = node->AddEdge<edge_type>(owned, result.tree, length); in Unwind()
431 inline OpResult CordRepBtree::AddEdge(bool owned, CordRep* edge, size_t delta) { in AddEdge() function in absl::CordRepBtree
469 leaf->AddEdge<edge_type>(ops.owned(depth), rep, length); in AddCordRep()
/third_party/node/deps/v8/include/v8-include/
H A Dv8-profiler.h832 * 3) In the callback use graph->AddEdge(node1, node2) to add an edge from
919 virtual void AddEdge(Node* from, Node* to, const char* name = nullptr) = 0;
939 * the embedder object graph. The callback should use graph->AddEdge(..) to
/third_party/node/deps/v8/include/
H A Dv8-profiler.h829 * 3) In the callback use graph->AddEdge(node1, node2) to add an edge from
907 virtual void AddEdge(Node* from, Node* to, const char* name = nullptr) = 0;
925 * the embedder object graph. The callback should use graph->AddEdge(..) to

Completed in 54 milliseconds

12