Search Options

Results per page
Sort
Preferred Languages
Advance

Results 41 - 50 of 67 for PCs (0.02 sec)

  1. src/runtime/traceback.go

    }
    
    // tracebackPCs populates pcBuf with the return addresses for each frame from u
    // and returns the number of PCs written to pcBuf. The returned PCs correspond
    // to "logical frames" rather than "physical frames"; that is if A is inlined
    // into B, this will still return a PCs for both A and B. This also includes PCs
    // generated by the cgo unwinder, if one is registered.
    //
    // If skip != 0, this skips this many logical frames.
    //
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 29 16:25:21 UTC 2024
    - 55.1K bytes
    - Viewed (0)
  2. src/cmd/compile/internal/wasm/ssa.go

       https://docs.google.com/document/d/131vjr4DH6JFnb-blm_uRdaC0_Nv3OUwjEY5qVCxCup4/edit#heading=h.mjo1bish3xni
    
       PCs:
    
       Wasm doesn't have PCs in the normal sense that you can jump
       to or call to. Instead, we simulate these PCs using our own construct.
    
       A PC in the Wasm implementation is the combination of a function
       ID and a block ID within that function. The function ID is an index
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri Feb 24 00:21:13 UTC 2023
    - 17.6K bytes
    - Viewed (0)
  3. src/runtime/debuglog.go

    	case debugLogPC:
    		printDebugLogPC(uintptr(r.uvarint()), false)
    
    	case debugLogTraceback:
    		n := int(r.uvarint())
    		for i := 0; i < n; i++ {
    			print("\n\t")
    			// gentraceback PCs are always return PCs.
    			// Convert them to call PCs.
    			//
    			// TODO(austin): Expand inlined frames.
    			printDebugLogPC(uintptr(r.uvarint()), true)
    		}
    	}
    
    	return true
    }
    
    // printDebugLog prints the debug log.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 15:10:48 UTC 2024
    - 18.3K bytes
    - Viewed (0)
  4. src/runtime/extern.go

    //
    // To translate these PCs into symbolic information such as function
    // names and line numbers, use [CallersFrames]. CallersFrames accounts
    // for inlined functions and adjusts the return program counters into
    // call program counters. Iterating over the returned slice of PCs
    // directly is discouraged, as is using [FuncForPC] on any of the
    // returned PCs, since these cannot account for inlining or return
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu May 30 17:52:17 UTC 2024
    - 18.9K bytes
    - Viewed (0)
  5. pkg/kube/inject/webhook_test.go

    			EnvironmentVariables: map[string]string{
    				fmt.Sprintf("VAR_%d", i): fmt.Sprint(i),
    			},
    		}))
    	}
    	pcs := model.GetProxyConfigs(store, m)
    	env := model.Environment{
    		Watcher:     mesh.NewFixedWatcher(m),
    		ConfigStore: store,
    	}
    	env.SetPushContext(&model.PushContext{
    		ProxyConfigs: pcs,
    	})
    	watcher, err := NewFileWatcher(configFile, valuesFile)
    	if err != nil {
    Registered: Fri Jun 14 15:00:06 UTC 2024
    - Last Modified: Mon Jul 17 20:25:52 UTC 2023
    - 39K bytes
    - Viewed (1)
  6. src/cmd/link/internal/ld/dwarf.go

    		// different units.
    		sval := d.ldr.SymValue(sym)
    		u0val := d.ldr.SymValue(loader.Sym(unit.Textp[0]))
    		if prevUnit != unit {
    			unit.PCs = append(unit.PCs, dwarf.Range{Start: sval - u0val})
    			prevUnit = unit
    		}
    		unit.PCs[len(unit.PCs)-1].End = sval - u0val + int64(len(d.ldr.Data(sym)))
    	}
    }
    
    func movetomodule(ctxt *Link, parent *dwarf.DWDie) {
    	die := ctxt.runtimeCU.DWInfo.Child
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Tue Apr 02 16:25:18 UTC 2024
    - 72.4K bytes
    - Viewed (0)
  7. src/debug/dwarf/entry.go

    			return nil, err
    		}
    		if e == nil || e.Tag == 0 {
    			return nil, ErrUnknownPC
    		}
    		ranges, err := r.d.Ranges(e)
    		if err != nil {
    			return nil, err
    		}
    		for _, pcs := range ranges {
    			if pcs[0] <= pc && pc < pcs[1] {
    				return e, nil
    			}
    		}
    		unit++
    	}
    	return nil, ErrUnknownPC
    }
    
    // Ranges returns the PC ranges covered by e, a slice of [low,high) pairs.
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed Oct 18 19:33:30 UTC 2023
    - 30.7K bytes
    - Viewed (0)
  8. src/internal/bisect/bisect.go

    func (m *Matcher) stack(w Writer) bool {
    	const maxStack = 16
    	var stk [maxStack]uintptr
    	n := runtime.Callers(2, stk[:])
    	// caller #2 is not for printing; need it to normalize PCs if ASLR.
    	if n <= 1 {
    		return false
    	}
    
    	base := stk[0]
    	// normalize PCs
    	for i := range stk[:n] {
    		stk[i] -= base
    	}
    
    	h := Hash(stk[:n])
    	if m.ShouldPrint(h) {
    		var d *dedup
    		for {
    			d = m.dedup.Load()
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Fri May 03 17:28:43 UTC 2024
    - 22.9K bytes
    - Viewed (0)
  9. src/runtime/traceevent.go

    // stack ID for it.
    //
    // It then returns a traceArg representing that stack which may be
    // passed to write.
    func (tl traceLocker) startPC(pc uintptr) traceArg {
    	// +PCQuantum because makeTraceFrame expects return PCs and subtracts PCQuantum.
    	return traceArg(trace.stackTab[tl.gen%2].put([]uintptr{
    		logicalStackSentinel,
    		startPCForTrace(pc) + sys.PCQuantum,
    	}))
    }
    
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Wed May 08 17:47:01 UTC 2024
    - 9.2K bytes
    - Viewed (0)
  10. src/cmd/link/internal/ld/dwarf_test.go

    	// - at least one row has the correct line number (8)
    	pcs := make(map[uint64]bool)
    	line8seen := false
    	for _, r := range rows {
    		pcs[r.Address] = true
    		if r.Line == 8 {
    			line8seen = true
    		}
    	}
    	failed := false
    	if len(pcs) < 2 {
    		failed = true
    		t.Errorf("not enough line table rows for main.singleInstruction (got %d, wanted > 1", len(pcs))
    	}
    	if !line8seen {
    		failed = true
    Registered: Wed Jun 12 16:32:35 UTC 2024
    - Last Modified: Thu Feb 08 01:38:11 UTC 2024
    - 48.6K bytes
    - Viewed (0)
Back to top