- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 1,100 for reachable (0.22 sec)
-
src/cmd/compile/internal/ssa/html.go
return err } type htmlFuncPrinter struct { w io.Writer } func (p htmlFuncPrinter) header(f *Func) {} func (p htmlFuncPrinter) startBlock(b *Block, reachable bool) { var dead string if !reachable { dead = "dead-block" } fmt.Fprintf(p.w, "<ul class=\"%s ssa-print-func %s\">", b, dead) fmt.Fprintf(p.w, "<li class=\"ssa-start-block\">%s:", b.HTML()) if len(b.Preds) > 0 {
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/vendor/golang.org/x/tools/go/types/objectpath/objectpath.go
// reading export data; the latter may have a smaller Scope since // export data trims objects that are not reachable from an exported // declaration. For example, the For function will return a path for // an exported method of an unexported type that is not reachable // from any public declaration; this path will cause the Object // function to fail if called on a package loaded from export data.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 02:20:05 UTC 2024 - 23.1K bytes - Viewed (0) -
src/runtime/mgcmark.go
state.head = x.next if stackTraceDebug { for i := 0; i < x.nobj; i++ { obj := &x.obj[i] if obj.r == nil { // reachable continue } println(" dead stkobj at", hex(gp.stack.lo+uintptr(obj.off)), "of size", obj.r.size) // Note: not necessarily really dead - only reachable-from-ptr dead. } } x.nobj = 0 putempty((*workbuf)(unsafe.Pointer(x))) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 18 21:25:11 UTC 2024 - 52.5K bytes - Viewed (0) -
src/runtime/profbuf.go
// can overwrite gp.labels, the value of gp.labels is stable during // this signal handler: it will still be reachable from gp when // we finish executing. If a GC is in progress right now, it must // keep gp.labels alive, because gp.labels is reachable from gp. // If gp were to overwrite gp.labels, the deletion barrier would // still shade that pointer, which would preserve it for the
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 18.2K bytes - Viewed (0) -
src/go/doc/example.go
// referenced by the body. unresolved := make(map[string]bool) var depDecls []ast.Decl usedDecls := make(map[ast.Decl]bool) // set of top-level decls reachable from the body usedObjs := make(map[*ast.Object]bool) // set of objects reachable from the body (each declared by a usedDecl) var inspectFunc func(ast.Node) bool inspectFunc = func(n ast.Node) bool { switch e := n.(type) { case *ast.Ident:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:00:11 UTC 2024 - 21.4K bytes - Viewed (0) -
src/cmd/go/internal/modfetch/sumdb.go
// $GOSUMDB can be "key" or "key url", // and the key can be a full verifier key // or a host on our list of known keys. // Special case: sum.golang.google.cn // is an alias, reachable inside mainland China, // for sum.golang.org. If there are more // of these we should add a map like knownGOSUMDB. gosumdb := cfg.GOSUMDB if gosumdb == "sum.golang.google.cn" {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 20 15:02:47 UTC 2023 - 9.1K bytes - Viewed (0) -
src/cmd/compile/internal/types2/mono.go
} } func (check *Checker) reportInstanceLoop(v int) { var stack []int seen := make([]bool, len(check.mono.vertices)) // We have a path that contains a cycle and ends at v, but v may // only be reachable from the cycle, not on the cycle itself. We // start by walking backwards along the path until we find a vertex // that appears twice. for !seen[v] { stack = append(stack, v) seen[v] = true
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 28 00:05:29 UTC 2024 - 9.1K bytes - Viewed (0) -
android/guava/src/com/google/common/collect/MapMaker.java
* Specifies that each value (not key) stored in the map should be wrapped in a {@link * WeakReference} (by default, strong references are used). * * <p>Weak values will be garbage collected once they are weakly reachable. This makes them a poor * candidate for caching. * * <p><b>Warning:</b> when this method is used, the resulting map will use identity ({@code ==})
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Mar 13 14:30:51 UTC 2023 - 12.8K bytes - Viewed (0) -
SECURITY.md
If you need to run untrusted models, execute them inside a [**sandbox**](https://developers.google.com/code-sandboxing). Memory corruptions in TensorFlow ops can be recognized as security issues only if they are reachable and exploitable through production-grade, benign models. ### Compilation Compiling models via the recommended entry points described in [XLA](https://www.tensorflow.org/xla) and
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sun Oct 01 06:06:35 UTC 2023 - 9.6K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/tools/internal/analysisinternal/analysis.go
// Initialize matches to contain the variable types we are searching for. matches := make(map[types.Type][]string) for _, typ := range typs { if typ == nil { continue // TODO(adonovan): is this reachable? } matches[typ] = nil // create entry } seen := map[types.Object]struct{}{} ast.Inspect(node, func(n ast.Node) bool { if n == nil { return false }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 11.7K bytes - Viewed (0)