- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 157 for conservatively (0.18 sec)
-
tensorflow/compiler/mlir/tensorflow/ir/tf_op_base.td
// // Note that if the trait is used where this invariant is not true, then this // might lead to incorrect execution order, while if not used where it should // be, it can only lead to reduced performance due to conservative ordering. // Example op where the invariant is not true: `TF_VarHandleOp`. def TF_UniqueResourceAllocation: TraitList<[ TF_ResourceHandleAllocatorInterface, NativeOpTrait<"TF::UniqueResourceAllocation"> ]>;
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Oct 30 06:52:55 UTC 2023 - 30.5K bytes - Viewed (0) -
src/math/rand/v2/rand_test.go
} } func hasSlowFloatingPoint() bool { switch runtime.GOARCH { case "arm": return os.Getenv("GOARM") == "5" case "mips", "mipsle", "mips64", "mips64le": // Be conservative and assume that all mips boards // have emulated floating point. // TODO: detect what it actually has. return true } return false } func TestFloat32(t *testing.T) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 17.4K bytes - Viewed (0) -
src/runtime/gc_test.go
t.Fatalf("live object not in reachable set; want %b, got %b", want, got) } if bits.OnesCount64(got&^want) > 1 { // Note: we can occasionally have a value that is retained even though // it isn't live, due to conservative scanning of stack frames. // See issue 67204. For now, we allow a "slop" of 1 unintentionally // retained object. t.Fatalf("dead object in reachable set; want %b, got %b", want, got) } runtime.KeepAlive(half)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 05 22:33:52 UTC 2024 - 17.6K bytes - Viewed (0) -
src/cmd/cgo/gcc.go
} // We can't figure out the type. Conservative // approach is to assume it has a pointer. return true case *ast.SelectorExpr: if l, ok := t.X.(*ast.Ident); !ok || l.Name != "C" { // Type defined in a different package. // Conservative approach is to assume it has a // pointer. return true } if f == nil { // Conservative approach: assume pointer. return true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 15:50:06 UTC 2024 - 97K bytes - Viewed (0) -
src/go/internal/gcimporter/gcimporter_test.go
if err != nil { t.Fatal(err) } if !bytes.HasPrefix(src, []byte("// run")) && !bytes.HasPrefix(src, []byte("// compile")) { // We're bypassing the logic of run.go here, so be conservative about // the files we consider in an attempt to make this test more robust to // changes in test/typeparams. t.Skipf("not detected as a run test") }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 16:22:59 UTC 2024 - 21.9K bytes - Viewed (0) -
src/cmd/compile/internal/types2/lookup.go
// Otherwise it returns (typ, false). func deref(typ Type) (Type, bool) { if p, _ := Unalias(typ).(*Pointer); p != nil { // p.base should never be nil, but be conservative if p.base == nil { if debug { panic("pointer with nil base type (possibly due to an invalid cyclic declaration)") } return Typ[Invalid], true } return p.base, true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 22 19:32:17 UTC 2024 - 19.8K bytes - Viewed (0) -
src/go/types/lookup.go
// Otherwise it returns (typ, false). func deref(typ Type) (Type, bool) { if p, _ := Unalias(typ).(*Pointer); p != nil { // p.base should never be nil, but be conservative if p.base == nil { if debug { panic("pointer with nil base type (possibly due to an invalid cyclic declaration)") } return Typ[Invalid], true } return p.base, true }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Apr 03 18:48:38 UTC 2024 - 19.9K bytes - Viewed (0) -
src/runtime/extern.go
asynchronous goroutine preemption. This makes some loops non-preemptible for long periods, which may delay GC and goroutine scheduling. This is useful for debugging GC issues because it also disables the conservative stack scanning used for asynchronously preempted goroutines. The [net] and [net/http] packages also refer to debugging variables in GODEBUG. See the documentation for those packages for details.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:52:17 UTC 2024 - 18.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/writebarrier.go
ptrSize := f.Config.PtrSize // Keep track of which parts of memory are known to be zero. // This helps with removing write barriers for various initialization patterns. // This analysis is conservative. We only keep track, for each memory state, of // which of the first 64 words of a single object are known to be zero. zeroes := map[ID]ZeroRegion{} // Find new objects. for _, b := range f.Blocks {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:09:14 UTC 2023 - 23.5K bytes - Viewed (0) -
src/cmd/compile/internal/types2/named.go
iface.embeddeds = old.embeddeds assert(old.complete) // otherwise we are copying incomplete data iface.complete = old.complete iface.implicit = old.implicit // should be false but be conservative underlying = iface } iface.methods = methods iface.tset = nil // recompute type set with new methods // If check != nil, check.newInterface will have saved the interface for later completion.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 15 20:03:31 UTC 2024 - 23.9K bytes - Viewed (0)