- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 61 for live0 (0.06 sec)
-
tensorflow/compiler/jit/deadness_analysis_test.cc
ops::Add(root.WithOpName("b0"), sw_0.output_false, sw_1.output_true); Output b1 = ops::Add(root.WithOpName("b1"), sw_1.output_true, sw_0.output_false); Output live0 = ops::Add(root.WithOpName("live0"), a0, a1); Output live1 = ops::Add(root.WithOpName("live1"), b0, b1); Output halfdead0 = ops::Add(root.WithOpName("halfdead0"), a0, b0); Output halfdead1 = ops::Add(root.WithOpName("halfdead1"), a1, b1);
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 51.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/regalloc.go
// Start with known live values at the end of the block. // Add len(b.Values) to adjust from end-of-block distance // to beginning-of-block distance. live.clear() for _, e := range s.live[b.ID] { live.set(e.ID, e.dist+int32(len(b.Values)), e.pos) } // Mark control values as live for _, c := range b.ControlValues() { if s.values[c.ID].needReg {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Nov 21 17:49:56 UTC 2023 - 87.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
} // reset fills state with the live variables from live. func (state *stateAtPC) reset(live abt.T) { slots, registers := state.slots, state.registers for i := range slots { slots[i] = VarLoc{} } for i := range registers { registers[i] = registers[i][:0] } for it := live.Iterator(); !it.Done(); { k, d := it.Next() live := d.(*liveSlot) slots[k] = live.VarLoc if live.VarLoc.Registers == 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0) -
src/runtime/mgcpacer.go
memoryLimit atomic.Int64 // heapMinimum is the minimum heap size at which to trigger GC. // For small heaps, this overrides the usual GOGC*live set rule. // // When there is a very small live set but a lot of allocation, simply // collecting when the heap reaches GOGC*live results in many GC // cycles and high total per-GC overhead. This minimum amortizes this // per-GC overhead while keeping the heap reasonably small. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 55.4K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/Multimaps.java
public void clear() { multimap.clear(); } } /** * Returns a multimap containing the mappings in {@code unfiltered} whose keys satisfy a * predicate. The returned multimap is a live view of {@code unfiltered}; changes to one affect * the other. * * <p>The resulting multimap's views have iterators that don't support {@code remove()}, but all
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Sun Jun 02 13:36:19 UTC 2024 - 86.3K bytes - Viewed (0) -
guava/src/com/google/common/collect/Multimaps.java
public void clear() { multimap.clear(); } } /** * Returns a multimap containing the mappings in {@code unfiltered} whose keys satisfy a * predicate. The returned multimap is a live view of {@code unfiltered}; changes to one affect * the other. * * <p>The resulting multimap's views have iterators that don't support {@code remove()}, but all
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Apr 01 16:15:01 UTC 2024 - 86.4K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.cc
// | | // +---------------+ // // Where S is the predicate for Init and X is the predicate that asserts that // Cond is true. {S,&,X} states that Merge is live on the first "iteration" iff // S is true, live on the second iteration iff "S&X" is true, live on the third // iteration iff "S&X&X" is true etc. There is a subtlety here, S&X&X would // normally be equivalent to S&X which isn't quite what we want to represent.
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 12 06:33:33 UTC 2024 - 60.4K bytes - Viewed (0) -
subprojects/core-api/src/main/java/org/gradle/api/Project.java
* * </ul> * * <p>The returned file collection is lazy, so that the paths are evaluated only when the contents of the file * collection are queried. The file collection is also live, so that it evaluates the above each time the contents * of the collection is queried.</p> * * <p>The returned file collection maintains the iteration order of the supplied paths.</p> *
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Thu May 30 04:56:22 UTC 2024 - 74.3K bytes - Viewed (0) -
staging/src/k8s.io/apimachinery/pkg/util/strategicpatch/patch.go
// They have higher precedence than the order in the live list. // The place for a item in `left` is found by: // scan from the place of last insertion in `right` to the end of `right`, // the place is before the first item that is greater than the item we want to insert. // example usage: using server-only items as left and patch items as right. We insert server-only items // to patch list. We use the order of live object as record for comparison.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 01 23:34:23 UTC 2023 - 75.5K bytes - Viewed (0) -
tensorflow/compiler/jit/mark_for_compilation_pass.cc
// because of two reasons: // // 1. Operations assigned to XLA_CPU and XLA_GPU have to always be compiled. // 2. We don't support live-out values of type DT_RESOURCE and live-in values // of type DT_RESOURCE that are not resource variables. // // Together these imply we cannot let resource variable safety analysis
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed Feb 21 12:19:41 UTC 2024 - 85.3K bytes - Viewed (0)