- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 47 for predecessor (0.28 sec)
-
src/cmd/compile/internal/ssa/loopbce.go
// only when it's smaller than the limiting value. // Two conditions must happen listed below to accept ind // as an induction variable. // First condition: loop entry has a single predecessor, which // is the header block. This implies that b.Succs[0] is // reached iff ind < limit. if len(b.Succs[0].b.Preds) != 1 { // b.Succs[1] must exit the loop. continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 07 17:37:47 UTC 2023 - 11.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
phis = append(phis, v) } continue } for _, a := range v.Args { if s.values[a.ID].needSlot { live.add(a.ID) } } } // for each predecessor of b, expand its list of live-at-end values // invariant: s contains the values live at the start of b (excluding phi inputs) for i, e := range b.Preds { p := e.b t.clear() t.addAll(s.live[p.ID])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/internal/report/source.go
// cannot determine the real line number. if f.begin > expand { f.begin -= expand } else if f.begin > 1 { f.begin = 1 } } else { // Find gap from predecessor and divide between predecessor and f. halfGap := (f.begin - funcs[i-1].end) / 2 if halfGap > expand { halfGap = expand } funcs[i-1].end += halfGap f.begin -= halfGap } funcs[i] = f }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 19:48:28 UTC 2024 - 31.3K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
} if m.Op == ssa.OpPhi { break } } // Find the two predecessor blocks (write barrier on and write barrier off) if len(m.Args) != 2 { lv.f.Fatalf("phi before write barrier end mark has %d args, want 2", len(m.Args)) } c := b.Preds[0].Block() d := b.Preds[1].Block() // Find their common predecessor block (the one that branches based on wb on/off).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/transforms/passes.h
// Creates a pass that propagates TPU devices to users. std::unique_ptr<OperationPass<func::FuncOp>> CreateTPUDevicePropagationPass(); // Create a pass that colocates each `Split` with its predecessor. std::unique_ptr<OperationPass<func::FuncOp>> CreateTPUColocateSplitsPass(); // Creates a pass that replicates the tf._TPUCompileMlir op on each host that
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Jun 12 21:18:05 UTC 2024 - 31.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/genericOps.go
{name: "FMA", argLength: 3}, // compute (a*b)+c without intermediate rounding // Data movement. Max argument length for Phi is indefinite. {name: "Phi", argLength: -1, zeroWidth: true}, // select an argument based on which predecessor block we came from {name: "Copy", argLength: 1}, // output = arg0 // Convert converts between pointers and integers. // We have a special op for this so as to not confuse GC
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 15:49:20 UTC 2024 - 42.6K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedGraphTest.java
assume().that(graphIsMutable()).isTrue(); addNode(N2); Set<Integer> predecessors = graph.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); putEdge(N1, N2); assertThat(graph.predecessors(N2)).containsExactlyElementsIn(predecessors); } @Override @Test public void successors_checkReturnedSetMutability() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 12.9K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/graph/AbstractStandardUndirectedNetworkTest.java
public void predecessors_checkReturnedSetMutability() { addNode(N2); Set<Integer> predecessors = network.predecessors(N2); UnsupportedOperationException e = assertThrows(UnsupportedOperationException.class, () -> predecessors.add(N1)); addEdge(N1, N2, E12); assertThat(network.predecessors(N2)).containsExactlyElementsIn(predecessors); } @Override @Test
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Wed Sep 06 17:04:31 UTC 2023 - 18.9K bytes - Viewed (0) -
maven-model-builder/src/main/java/org/apache/maven/model/inheritance/DefaultInheritanceAssembler.java
Object key = getPluginKey().apply(plugin); master.put(key, plugin); } } Map<Object, List<Plugin>> predecessors = new LinkedHashMap<>(); List<Plugin> pending = new ArrayList<>(); for (Plugin element : tgt) { Object key = getPluginKey().apply(element);
Registered: Wed Jun 12 09:55:16 UTC 2024 - Last Modified: Wed Feb 28 07:40:37 UTC 2024 - 13.8K bytes - Viewed (0) -
android/guava/src/com/google/common/graph/Graphs.java
} @Override Graph<N> delegate() { return graph; } @Override public Set<N> predecessors(N node) { return delegate().successors(node); // transpose } @Override public Set<N> successors(N node) { return delegate().predecessors(node); // transpose } @Override public Set<EndpointPair<N>> incidentEdges(N node) {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 21.2K bytes - Viewed (0)