- Sort Score
- Result 10 results
- Languages All
Results 21 - 30 of 44 for findfunc (0.16 sec)
-
src/runtime/debuglog.go
printunlock() } // printDebugLogPC prints a single symbolized PC. If returnPC is true, // pc is a return PC that must first be converted to a call PC. func printDebugLogPC(pc uintptr, returnPC bool) { fn := findfunc(pc) if returnPC && (!fn.valid() || pc > fn.entry()) { // TODO(austin): Don't back up if the previous frame // was a sigpanic. pc-- } print(hex(pc)) if !fn.valid() {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 15:10:48 UTC 2024 - 18.3K bytes - Viewed (0) -
src/cmd/link/internal/ld/pcln.go
call := fi.InlTree(i) nameOff, ok := nameOffsets[call.Func] if !ok { panic("couldn't find function name offset") } inlFunc := ldr.FuncInfo(call.Func) var funcID abi.FuncID startLine := int32(0) if inlFunc.Valid() { funcID = inlFunc.FuncID() startLine = inlFunc.StartLine() } else if !ctxt.linkShared { // Inlined functions are always Go functions, and thus // must have FuncInfo. //
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/runtime/export_test.go
for _, r := range a.addrRanges.ranges { result = append(result, AddrRange{r}) } return result } // FindSucc returns the successor to base. See addrRanges.findSucc // for more details. func (a *AddrRanges) FindSucc(base uintptr) int { return a.findSucc(base) } // Add adds a new AddrRange to the AddrRanges. // // The AddrRange must be mutable (i.e. created by NewAddrRanges),
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
pilot/pkg/model/push_context_test.go
total2 += len(envoyFilters) for _, ef := range envoyFilters { key := ConfigKey{Kind: kind.EnvoyFilter, Namespace: ns, Name: ef.Name} previousVersion := slices.FindFunc(pc1.envoyFiltersByNamespace[ns], func(e *EnvoyFilterWrapper) bool { return e.Name == ef.Name }) switch { // Newly created Envoy filter. case createSet.Contains(key):
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sun Apr 21 17:42:54 UTC 2024 - 95.3K bytes - Viewed (0) -
src/runtime/proc.go
throw("bad g status") } if gp.asyncSafePoint { // Double-check that async preemption does not // happen in SPWRITE assembly functions. // isAsyncSafePoint must exclude this case. f := findfunc(gp.sched.pc) if !f.valid() { throw("preempt at unknown pc") } if f.flag&abi.FuncFlagSPWrite != 0 { println("runtime: unexpected SPWRITE function", funcname(f), "in async preempt")
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 207.5K bytes - Viewed (0) -
pkg/config/validation/validation.go
} canoncalGroup := targetRef.Group if canoncalGroup == "" { canoncalGroup = "core" } allowed := slices.FindFunc(allowedTargetRefs, func(gvk config.GroupVersionKind) bool { return gvk.Kind == targetRef.Kind && gvk.CanonicalGroup() == canoncalGroup }) != nil if !allowed {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Wed Jun 12 04:03:33 UTC 2024 - 107.2K bytes - Viewed (0) -
src/cmd/vendor/github.com/google/pprof/profile/legacy_java_profile.go
// The path isn't interesting, so just give the .so. lineFunc, lineFile = filePath[1], filepath.Base(filePath[2]) } else if strings.Contains(jloc[2], "generated stub/JIT") { lineFunc = "STUB" } else { // Treat whole line as the function name. This is used by the // java agent for internal states such as "GC" or "VM". lineFunc = jloc[2] } fn := fns[lineFunc] if fn == nil { fn = &Function{
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 16 15:19:53 UTC 2024 - 8.8K bytes - Viewed (0) -
src/slices/sort_test.go
gotMin := Min(tt.data) if gotMin != tt.wantMin { t.Errorf("Min got %v, want %v", gotMin, tt.wantMin) } gotMinFunc := MinFunc(tt.data, intCmp) if gotMinFunc != tt.wantMin { t.Errorf("MinFunc got %v, want %v", gotMinFunc, tt.wantMin) } gotMax := Max(tt.data) if gotMax != tt.wantMax { t.Errorf("Max got %v, want %v", gotMax, tt.wantMax) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 09 19:20:55 UTC 2024 - 9.5K bytes - Viewed (0) -
src/runtime/mranges.go
a.sysStat = sysStat a.totalBytes = 0 } // findSucc returns the first index in a such that addr is // less than the base of the addrRange at that index. func (a *addrRanges) findSucc(addr uintptr) int { base := offAddr{addr} // Narrow down the search space via a binary search // for large addrRanges until we have at most iterMax
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 14.5K bytes - Viewed (0) -
src/slices/sort.go
m = min(m, x[i]) } return m } // MinFunc returns the minimal value in x, using cmp to compare elements. // It panics if x is empty. If there is more than one minimal element // according to the cmp function, MinFunc returns the first one. func MinFunc[S ~[]E, E any](x S, cmp func(a, b E) int) E { if len(x) < 1 { panic("slices.MinFunc: empty list") } m := x[0] for i := 1; i < len(x); i++ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 07 23:54:41 UTC 2024 - 5.8K bytes - Viewed (0)