- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 25 for RemoveEdge (0.16 sec)
-
src/cmd/compile/internal/ssa/fuse.go
return false } } // We do not need to redirect the Preds of s0 and s1 to ss, // the following optimization will do this. b.removeEdge(0) if s0 != b && len(s0.Preds) == 0 { s0.removeEdge(0) // Move any (dead) values in s0 to b, // where they will be eliminated by the next deadcode pass. for _, v := range s0.Values { v.Block = b }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:45:54 UTC 2023 - 9K bytes - Viewed (0) -
tensorflow/compiler/jit/build_xla_ops_pass.cc
// NodeDef inputs we first need to fix encapsulate_subgraphs_pass to fix up // the NodeDef inputs to the function call nodes. g->AddEdge(new_node, edge->src_output(), edge->dst(), edge->dst_input()); g->RemoveEdge(edge); } } // Returns a data value that is dead iff `control` is dead. Output ControlToData(const Scope& scope, Node* control) { // The choice of data type here is important. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 24.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/fuse_comparisons.go
v := b.NewValue0(bc.Pos, op, bc.Type) v.AddArg(pc) v.AddArg(bc) // Set the combined control value as the control value for b. b.SetControl(v) // Modify p so that it jumps directly to b. p.removeEdge(i) p.Kind = BlockPlain p.Likely = BranchUnknown p.ResetControls() return true } // TODO: could negate condition(s) to merge controls. return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 11 16:34:30 UTC 2022 - 4K bytes - Viewed (0) -
tensorflow/compiler/jit/clone_constants_for_better_clustering.cc
TF_RET_CHECK(e->src_output() == 0) << "expected constant to have exactly one non-control output, but " "found output index = " << e->src_output(); graph_->RemoveEdge(e); graph_->AddEdge(input_cloned, 0, n, dst_input); } } } return absl::OkStatus(); } Status CloneConstantsForBetterClusteringPassImpl::Run() {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 7.3K bytes - Viewed (0) -
maven-core/src/main/java/org/apache/maven/project/ProjectSorter.java
fromProject.addProjectReference(toProject); } if (force && toVertex.getChildren().contains(fromVertex)) { graph.removeEdge(toVertex, fromVertex); } try { graph.addEdge(fromVertex, toVertex); } catch (CycleDetectedException e) { if (!safe) { throw e;
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Fri Sep 22 06:02:04 UTC 2023 - 10.3K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/sccp.go
// and thus can be removed in further deadcode phase func rewireSuccessor(block *Block, constVal *Value) bool { switch block.Kind { case BlockIf: block.removeEdge(int(constVal.AuxInt)) block.Kind = BlockPlain block.Likely = BranchUnknown block.ResetControls() return true case BlockJumpTable: // Remove everything but the known taken branch.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 22 16:54:50 UTC 2024 - 17.6K bytes - Viewed (0) -
tensorflow/compiler/jit/partially_decluster_pass.cc
} for (const Edge* out_edge_to_clone : out_edges_to_clone) { graph->AddEdge(cloned_node, out_edge_to_clone->src_output(), out_edge_to_clone->dst(), out_edge_to_clone->dst_input()); graph->RemoveEdge(out_edge_to_clone); } if (n->out_edges().empty()) { graph->RemoveNode(n); } return absl::OkStatus(); }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Fri Feb 09 11:36:41 UTC 2024 - 15.7K bytes - Viewed (0) -
tensorflow/compiler/jit/increase_dynamism_for_auto_jit_pass.cc
DCHECK(e->src_output() == 0 || e->src_output() == Graph::kControlSlot); int src_output = e->src_output(); int dst_input = e->dst_input(); Node* dst = e->dst(); g->RemoveEdge(e); g->AddEdge(static_shaped_slice, src_output, dst, dst_input); } for (const Edge* e : slice->in_edges()) { if (e->IsControlEdge()) { g->AddControlEdge(e->src(), static_shaped_slice);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 13.8K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void removeEdge_existingSelfLoopEdge() { assume().that(graphIsMutable()).isTrue(); assume().that(network.allowsSelfLoops()).isTrue(); addEdge(N1, N1, E11); assertThat(networkAsMutableNetwork.removeEdge(E11)).isTrue(); assertThat(network.edges()).doesNotContain(E11); assertThat(network.edgesConnecting(N1, N1)).isEmpty(); }
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 18.9K bytes - Viewed (0) -
plugin/pkg/auth/authorizer/node/graph.go
for _, v := range neighborsToRemove { g.removeVertex_locked(v) } // remove edges and decrement destination indexes for neighbors that dropped outbound edges for _, edge := range edgesToRemove { g.graph.RemoveEdge(edge) g.removeEdgeFromDestinationIndex_locked(edge) } } // A fastpath for recomputeDestinationIndex_locked for "removing edge" case. func (g *Graph) removeEdgeFromDestinationIndex_locked(e graph.Edge) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Mar 07 21:22:55 UTC 2024 - 17.5K bytes - Viewed (0)