- Sort Score
- Result 10 results
- Languages All
Results 71 - 80 of 112 for Walks (0.05 sec)
-
src/cmd/vendor/golang.org/x/mod/zip/zip.go
} else { cc[fold] = pathInfo{path: p, isDir: isDir} } if parent := path.Dir(p); parent != "." { return cc.check(parent, true) } return nil } // listFilesInDir walks the directory tree rooted at dir and returns a list of // files, as well as a list of directories and files that were skipped (for // example, nested modules and symbolic links).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jul 12 20:38:21 UTC 2023 - 31K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
// Populate "rval" with what we've computed. rval.Slots = state.slots rval.VarSlots = state.varSlots rval.Vars = state.vars rval.LocationLists = state.lists } // liveness walks the function in control flow order, calculating the start // and end state of each block. func (state *debugState) liveness() []*BlockDebug { blockLocs := make([]*BlockDebug, state.f.NumBlocks()) counterTime := int32(1)
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/cmd/link/internal/ld/pcln.go
size += int64(len(ctxt.loader.SymName(s)) + 1) // NULL terminate }) state.funcnametab = state.addGeneratedSym(ctxt, "runtime.funcnametab", size, writeFuncNameTab) return nameOffsets } // walkFilenames walks funcs, calling a function for each filename used in each // function's line table. func walkFilenames(ctxt *Link, funcs []loader.Sym, f func(*sym.CompilationUnit, goobj.CUFileIndex)) { ldr := ctxt.loader
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 22:16:54 UTC 2024 - 29.6K bytes - Viewed (0) -
src/go/types/infer.go
// If any term of tpar has a tilde, we don't // have a precise core type and we must return // a tilde as well. return &term{tilde, typ}, false } return nil, false } // killCycles walks through the given type parameters and looks for cycles // created by type parameters whose inferred types refer back to that type // parameter, either directly or indirectly. If such a cycle is detected,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 13:54:20 UTC 2024 - 26.5K bytes - Viewed (0) -
src/encoding/json/decode.go
d.skip() d.scanNext() case scanBeginLiteral: v := d.literalInterface() switch v.(type) { case nil, string: return v } } return unquotedValue{} } // indirect walks down v allocating pointers as needed, // until it gets to a non-pointer. // If it encounters an Unmarshaler, indirect stops and returns that. // If decodingNull is true, indirect stops at the first settable pointer so it
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 00:18:55 UTC 2024 - 35.3K bytes - Viewed (0) -
pkg/kubelet/cm/cpumanager/cpu_assignment.go
// (e.g. the accumulator needs 4 CPUs but only 3 are available). func (a *cpuAccumulator) isFailed() bool { return a.numCPUsNeeded > a.details.CPUs().Size() } // iterateCombinations walks through all n-choose-k subsets of size k in n and // calls function 'f()' on each subset. For example, if n={0,1,2}, and k=2, // then f() will be called on the subsets {0,1}, {0,2}. and {1,2}. If f() ever
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 25 23:56:21 UTC 2024 - 36.3K bytes - Viewed (0) -
src/cmd/link/internal/ld/data.go
if outer != 0 { off += ldr.SymValue(s) - ldr.SymValue(outer) s = outer } return s, off } // relocsym resolve relocations in "s", updating the symbol's content // in "P". // The main loop walks through the list of relocations attached to "s" // and resolves them where applicable. Relocations are often // architecture-specific, requiring calls into the 'archreloc' and/or
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Jun 12 15:10:50 UTC 2024 - 100.5K bytes - Viewed (1) -
src/text/template/exec.go
s.writeError(err) } case *parse.WithNode: s.walkIfOrWith(parse.NodeWith, dot, node.Pipe, node.List, node.ElseList) default: s.errorf("unknown node: %s", node) } } // walkIfOrWith walks an 'if' or 'with' node. The two control structures // are identical in behavior except that 'with' sets dot. func (s *state) walkIfOrWith(typ parse.NodeType, dot reflect.Value, pipe *parse.PipeNode, list, elseList *parse.ListNode) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 24 21:22:24 UTC 2024 - 32K bytes - Viewed (0) -
src/runtime/symtab.go
// matches the cached contents. const debugCheckCache = false if off == 0 { return -1, 0 } // Check the cache. This speeds up walks of deep stacks, which // tend to have the same recursive functions over and over, // or repetitive stacks between goroutines. var checkVal int32 var checkPC uintptr ck := pcvalueCacheKey(targetpc) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 40K bytes - Viewed (0) -
src/runtime/mpagealloc.go
// // p.mheapLock must be held. func (p *pageAlloc) find(npages uintptr) (uintptr, offAddr) { assertLockHeld(p.mheapLock) // Search algorithm. // // This algorithm walks each level l of the radix tree from the root level // to the leaf level. It iterates over at most 1 << levelBits[l] of entries // in a given level in the radix tree, and uses the summary information to // find either:
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 39.2K bytes - Viewed (0)