- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 926 for effects (0.15 sec)
-
src/cmd/compile/internal/typecheck/typecheck.go
np = &dot.X // peel away method selector } // Check for side effects in the callee expression. // We explicitly special case new(T) though, because it doesn't have // observable side effects, and keeping it in place allows better escape analysis. if !ir.Any(*np, func(n ir.Node) bool { return n.Op() != ir.ONEW && callOrChan(n) }) { return }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 20 19:08:34 UTC 2024 - 30.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/builtin.go
"cmd/compile/internal/escape" "cmd/compile/internal/ir" "cmd/compile/internal/reflectdata" "cmd/compile/internal/typecheck" "cmd/compile/internal/types" ) // Rewrite append(src, x, y, z) so that any side effects in // x, y, z (including runtime panics) are evaluated in // initialization statements before the append. // For normal code generation, stop there and leave the // rest to ssagen. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Mar 08 22:35:22 UTC 2024 - 31.2K bytes - Viewed (0) -
platforms/documentation/docs/src/docs/userguide/authoring-builds/tasks/task_configuration_avoidance.adoc
When task relationships need to be established (i.e., `dependsOn`, `finalizedBy`, `mustRunAfter`, `shouldRunAfter`), a distinction can be made between soft and strong relationships. Their effects on task creation during the configuration phase differ:
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Wed Mar 27 23:45:25 UTC 2024 - 21.4K bytes - Viewed (0) -
src/cmd/compile/internal/walk/compare.go
// simpler to just extend walkCompareInterface to optimize when one // operand is an OCONVIFACE. if n.X.Type().IsInterface() != n.Y.Type().IsInterface() { // Preserve side-effects in case of short-circuiting; see #32187. l := cheapExpr(n.X, init) r := cheapExpr(n.Y, init) // Swap so that l is the interface value and r is the concrete value. if n.Y.Type().IsInterface() { l, r = r, l }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 21:55:14 UTC 2023 - 16.2K bytes - Viewed (0) -
pkg/volume/csi/nodeinfomanager/nodeinfomanager.go
// which is modified by applying the given update functions sequentially. // Because updateFuncs are applied sequentially, later updateFuncs should take into account // the effects of previous updateFuncs to avoid potential conflicts. For example, if multiple // functions update the same field, updates in the last function are persisted.
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Sat May 11 09:02:45 UTC 2024 - 20.1K bytes - Viewed (0) -
src/runtime/mfinal.go
1<<0 | 0<<1 | 1<<2 | 1<<3 | 1<<4 | 1<<5 | 0<<6 | 1<<7, 1<<0 | 1<<1 | 1<<2 | 0<<3 | 1<<4 | 1<<5 | 1<<6 | 1<<7, 0<<0 | 1<<1 | 1<<2 | 1<<3 | 1<<4 | 0<<5 | 1<<6 | 1<<7, } // lockRankMayQueueFinalizer records the lock ranking effects of a // function that may call queuefinalizer. func lockRankMayQueueFinalizer() { lockWithRankMayAcquire(&finlock, getLockRank(&finlock)) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 01:56:56 UTC 2024 - 19K bytes - Viewed (0) -
src/math/rand/rand.go
m := make([]int, n) // In the following loop, the iteration when i=0 always swaps m[0] with m[0]. // A change to remove this useless iteration is to assign 1 to i in the init // statement. But Perm also effects r. Making this change will affect // the final state of r. So this change can't be made for compatibility // reasons for Go 1. for i := 0; i < n; i++ { j := r.Intn(i + 1) m[i] = m[j] m[j] = i } return m }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 22:09:08 UTC 2024 - 16.9K bytes - Viewed (0) -
src/cmd/compile/internal/walk/complit.go
n := n.(*ir.CompLitExpr) if !t.IsMap() { base.Fatalf("anylit: not map") } maplit(n, var_, init) } } // oaslit handles special composite literal assignments. // It returns true if n's effects have been added to init, // in which case n should be dropped from the program by the caller. func oaslit(n *ir.AssignStmt, init *ir.Nodes) bool { if n.X == nil || n.Y == nil { // not a special composite literal assignment
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 08 19:03:54 UTC 2023 - 19.5K bytes - Viewed (0) -
src/cmd/compile/internal/walk/convert.go
} // Try a bunch of cases to avoid an allocation. var value ir.Node switch { case fromType.Size() == 0: // n is zero-sized. Use zerobase. cheapExpr(n, init) // Evaluate n for side-effects. See issue 19246. value = ir.NewLinksymExpr(base.Pos, ir.Syms.Zerobase, types.Types[types.TUINTPTR]) case isBool || fromType.Size() == 1 && isInteger: // n is a bool/byte. Use staticuint64s[n * 8] on little-endian
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 09 17:28:22 UTC 2023 - 18.2K bytes - Viewed (0) -
platforms/core-configuration/configuration-cache/src/main/kotlin/org/gradle/internal/cc/impl/ConfigurationCacheState.kt
internal enum class StateType(val encryptable: Boolean = false) { /** * Contains the state for the entire build. */ Work(true), /** * Contains the side effects observed during the creation of the [Model]. */ ModelSideEffects(true), /** * Contains the model objects sent back to the IDE in response to a TAPI request. */ Model(true),
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Sat Jun 08 11:29:30 UTC 2024 - 34.8K bytes - Viewed (0)