- Sort Score
- Result 10 results
- Languages All
Results 11 - 20 of 208 for Gdead (0.04 sec)
-
src/cmd/compile/internal/ssa/html.go
.dead-block.highlight-palegreen, .dead-value span.highlight-skyblue, .dead-block.highlight-skyblue, .dead-value span.highlight-lightgray, .dead-block.highlight-lightgray, .dead-value span.highlight-yellow, .dead-block.highlight-yellow, .dead-value span.highlight-lime, .dead-block.highlight-lime, .dead-value span.highlight-khaki, .dead-block.highlight-khaki, .dead-value span.highlight-aqua,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 04 15:11:40 UTC 2023 - 34.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode_test.go
Goto("exit")), Bloc("exit", Exit("mem")), // dead loop Bloc("deadblock", // dead value in dead block Valu("deadval", OpConstBool, c.config.Types.Bool, 1, nil), If("deadval", "deadblock", "exit"))) CheckFunc(fun.f) Deadcode(fun.f) CheckFunc(fun.f) for _, b := range fun.f.Blocks { if b == fun.blocks["deadblock"] { t.Errorf("dead block not removed") } for _, v := range b.Values {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 09 23:01:51 UTC 2017 - 3.5K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/go/analysis/passes/shift/shift.go
// Do a complete pass to compute dead nodes. dead := make(map[ast.Node]bool) nodeFilter := []ast.Node{ (*ast.IfStmt)(nil), (*ast.SwitchStmt)(nil), } inspect.Preorder(nodeFilter, func(n ast.Node) { // TODO(adonovan): move updateDead into this file. updateDead(pass.TypesInfo, dead, n) }) nodeFilter = []ast.Node{ (*ast.AssignStmt)(nil),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 3.5K bytes - Viewed (0) -
test/fixedbugs/issue27518a.go
// heap. runtime.GC() // At this point x's dead stack slot points to dead memory. // Trigger a sigpanic. Since this is an implicit panic, we // don't have an explicit liveness map here. // Traceback used to use the liveness map of the most recent defer, // but in that liveness map, x will be live again even though // it points to dead memory. The fix is to use the liveness // map of a deferreturn call instead.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 03 19:54:23 UTC 2018 - 1.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
} }) // Remove dead values from blocks' value list. Return dead // values to the allocator. for _, b := range f.Blocks { i := 0 for _, v := range b.Values { if live[v.ID] { b.Values[i] = v i++ } else { f.freeValue(v) } } b.truncateValues(i) } // Remove unreachable blocks. Return dead blocks to allocator. i = 0
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/ir/tf_executor_ops.td
captured by a `tf_executor.island` is dead, the whole region does not execute and every produced value is marked as dead as well. An arbitrary number of `tf_executor.control` operands are accepted by a `tf_executor.island` operation. If any operand or implicitly captured value are dead, the region is not executed and dead values are immediately returned for every result. }];
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 23 19:35:12 UTC 2023 - 22K bytes - Viewed (0) -
test/writebarrier.go
} func f2(x *interface{}, y interface{}) { *x = y // no barrier (dead store) z := y // no barrier *x = z // ERROR "write barrier" } func f2a(x *interface{}, y *interface{}) { *x = *y // no barrier (dead store) z := y // no barrier *x = z // ERROR "write barrier" } func f3(x *string, y string) { *x = y // no barrier (dead store) z := y // no barrier *x = z // ERROR "write barrier" }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 23 19:46:36 UTC 2021 - 5.9K bytes - Viewed (0) -
src/compress/testdata/gettysburg.txt
nobly advanced. It is rather for us to be here dedicated to the great task remaining before us - that from these honored dead we take increased devotion to that cause for which they gave the last full measure of devotion - that we here highly resolve that these dead shall not have died in vain - that this nation, under God, shall have a new birth of freedom - and that government of the people, by the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 29 15:46:44 UTC 2015 - 1.5K bytes - Viewed (0) -
tensorflow/compiler/jit/deadness_analysis.h
#define TENSORFLOW_COMPILER_JIT_DEADNESS_ANALYSIS_H_ #include "tensorflow/core/graph/graph.h" namespace tensorflow { // This analyzes a TensorFlow graph to identify nodes which may have partially // dead inputs (i.e. these nodes may have some dead inputs and some alive // inputs). // // For example, the ADD node in the following graph // // V0 PRED0 V1 PRED1 // | | | | // v v v v
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Feb 22 06:59:07 UTC 2024 - 3.3K bytes - Viewed (0) -
pkg/kubelet/container/container_gc.go
MinAge time.Duration // Max number of dead containers any single pod (UID, container name) pair is // allowed to have, less than zero for no limit. MaxPerPodContainer int // Max number of total dead containers, less than zero for no limit. MaxContainers int } // GC manages garbage collection of dead containers. // // Implementation is thread-compatible. type GC interface {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Nov 01 18:46:33 UTC 2023 - 3.8K bytes - Viewed (0)