- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for pcdatavalue1 (0.18 sec)
-
src/runtime/symtabinl.go
func (u *inlineUnwinder) resolveInternal(pc uintptr) inlineFrame { return inlineFrame{ pc: pc, // Conveniently, this returns -1 if there's an error, which is the same // value we use for the outermost frame. index: pcdatavalue1(u.f, abi.PCDATA_InlTreeIndex, pc, false), } } func (uf inlineFrame) valid() bool { return uf.pc != 0 } // next returns the frame representing uf's logical caller.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 4.5K bytes - Viewed (0) -
src/runtime/symtab.go
return *(*uint32)(add(unsafe.Pointer(&f.nfuncdata), unsafe.Sizeof(f.nfuncdata)+uintptr(table)*4)) } func pcdatavalue(f funcInfo, table uint32, targetpc uintptr) int32 { if table >= f.npcdata { return -1 } r, _ := pcvalue(f, pcdatastart(f, table), targetpc, true) return r } func pcdatavalue1(f funcInfo, table uint32, targetpc uintptr, strict bool) int32 { if table >= f.npcdata { return -1 }
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/debugcall.go
if pfx := "runtime."; len(name) > len(pfx) && name[:len(pfx)] == pfx { ret = debugCallRuntime return } // Check that this isn't an unsafe-point. if pc != f.entry() { pc-- } up := pcdatavalue(f, abi.PCDATA_UnsafePoint, pc) if up != abi.UnsafePointSafe { // Not at a safe point. ret = debugCallUnsafePoint } }) return ret }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 05 20:50:21 UTC 2024 - 7.1K bytes - Viewed (0) -
src/runtime/stkframe.go
// Back up to the CALL. If we're at the function entry // point, we want to use the entry map (-1), even if // the first instruction of the function changes the // stack map. targetpc-- pcdata = pcdatavalue(f, abi.PCDATA_StackMapIndex, targetpc) } if pcdata == -1 { // We do not have a valid pcdata value but there might be a // stackmap for this function. It is likely that we are looking
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 15:10:48 UTC 2024 - 9.9K bytes - Viewed (0) -
src/runtime/preempt.go
// stack for unwinding, not the LR value. But if this is a // call to morestack, we haven't created the frame, and we'll // use the LR for unwinding, which will be bad. return false, 0 } up, startpc := pcdatavalue2(f, abi.PCDATA_UnsafePoint, pc) if up == abi.UnsafePointUnsafe { // Unsafe-point marked by compiler. This includes // atomic sequences (e.g., write barrier) and nosplit // functions (except at calls).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:41:45 UTC 2024 - 15.1K bytes - Viewed (0) -
src/runtime/heapdump.go
f := s.fn // Figure out what we can about our stack map pc := s.pc pcdata := int32(-1) // Use the entry map at function entry if pc != f.entry() { pc-- pcdata = pcdatavalue(f, abi.PCDATA_StackMapIndex, pc) } if pcdata == -1 { // We do not have a valid pcdata value but there might be a // stackmap for this function. It is likely that we are looking
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 09 04:07:57 UTC 2024 - 17.6K bytes - Viewed (0) -
src/runtime/export_test.go
} var testUintptr uintptr func MyGenericFunc[T any]() { systemstack(func() { testUintptr = 4 }) } func UnsafePoint(pc uintptr) bool { fi := findfunc(pc) v := pcdatavalue(fi, abi.PCDATA_UnsafePoint, pc) switch v { case abi.UnsafePointUnsafe: return true case abi.UnsafePointSafe: return false
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 30 17:50:53 UTC 2024 - 46.1K bytes - Viewed (0) -
src/runtime/traceback.go
p := (*[abi.TraceArgsMaxLen]uint8)(funcdata(f, abi.FUNCDATA_ArgInfo)) if p == nil { return } liveInfo := funcdata(f, abi.FUNCDATA_ArgLiveInfo) liveIdx := pcdatavalue(f, abi.PCDATA_ArgLiveIndex, pc) startOffset := uint8(0xff) // smallest offset that needs liveness info (slots with a lower offset is always live) if liveInfo != nil { startOffset = *(*uint8)(liveInfo) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 16:25:21 UTC 2024 - 55.1K bytes - Viewed (0)