- Sort Score
- Result 10 results
- Languages All
Results 41 - 50 of 269 for Atack (0.04 sec)
-
src/cmd/vendor/golang.org/x/telemetry/internal/upload/reports.go
u.logger.Printf("Unparseable count file %s: %v", filepath.Base(f), err) continue } prog := findProgReport(x.Meta, report) for k, v := range x.Count { if counter.IsStackCounter(k) { // stack prog.Stacks[k] += int64(v) } else { // counter prog.Counters[k] += int64(v) } succeeded = true fok = true } if !fok { u.logger.Printf("no counters found in %s", f)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 14:52:56 UTC 2024 - 10.3K bytes - Viewed (0) -
src/runtime/export_test.go
func G0StackOverflow() { systemstack(func() { g0 := getg() sp := getcallersp() // The stack bounds for g0 stack is not always precise. // Use an artificially small stack, to trigger a stack overflow // without actually run out of the system stack (which may seg fault). g0.stack.lo = sp - 4096 - stackSystem g0.stackguard0 = g0.stack.lo + stackGuard g0.stackguard1 = g0.stackguard0 stackOverflow(nil) }) }
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/cmd/internal/obj/arm64/obj7.go
// the traceback code will not see a half-updated stack frame. // Also, on Linux, in a cgo binary we may get a SIGSETXID signal // early on before the signal stack is set, as glibc doesn't allow // us to block SIGSETXID. So it is important that we don't write below // the SP until the signal stack is set. // Luckily, all the functions from thread entry to setting the signal // stack have small frames.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 08 05:46:32 UTC 2023 - 28.4K bytes - Viewed (0) -
src/runtime/chan_test.go
// Test that channel receive slots that contain local stack // pointers are adjusted correctly by stack shrinking. c := make(chan *int) d := make(chan *int) ready1 := make(chan bool) ready2 := make(chan bool) f := func(ready chan bool, dup bool) { // Temporarily grow the stack to 10K. stackGrowthRecursive((10 << 10) / (128 * 8)) // We're ready to trigger GC and stack shrink. ready <- true val := 42
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Oct 31 20:47:35 UTC 2023 - 23.4K bytes - Viewed (0) -
src/debug/dwarf/const.go
opConstu = 0x10 /* 1 op, LEB128 const */ opConsts = 0x11 /* " signed */ opDup = 0x12 opDrop = 0x13 opOver = 0x14 opPick = 0x15 /* 1 op, 1 byte stack index */ opSwap = 0x16 opRot = 0x17 opXderef = 0x18 opAbs = 0x19 opAnd = 0x1A opDiv = 0x1B opMinus = 0x1C opMod = 0x1D opMul = 0x1E
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Oct 18 19:33:30 UTC 2023 - 13.8K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/telemetry/internal/counter/counter.go
} pf, err := Parse(name, data) if err != nil { return nil, fmt.Errorf("failed to parse: %v", err) } return pf, nil } // ReadFile reads the counters and stack counters from the given file. // This is the implementation of x/telemetry/counter/countertest.Read func ReadFile(name string) (counters, stackCounters map[string]uint64, _ error) {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 10.3K bytes - Viewed (0) -
src/cmd/compile/internal/rangefunc/rewrite.go
default: // Push n onto stack. r.stack = append(r.stack, n) if nfor, ok := forRangeFunc(n); ok { loop := &forLoop{nfor: nfor, depth: 1 + len(r.forStack)} r.forStack = append(r.forStack, loop) r.startLoop(loop) } case nil: // n == nil signals that we are done visiting // the top-of-stack node's children. Find it. n = r.stack[len(r.stack)-1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 01:05:44 UTC 2024 - 41.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadstore.go
if elim[v] == nil { elim[v] = n changed = true } return case OpVarLive: // Don't delete the auto if it needs to be kept alive. // We depend on this check to keep the autotmp stack slots // for open-coded defers from being removed (since they // may not be used by the inline code, but will be used by // panic processing). n, ok := v.Aux.(*ir.Name) if !ok || n.Class != ir.PAUTO {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Apr 25 20:07:26 UTC 2024 - 11K bytes - Viewed (0) -
src/cmd/compile/internal/walk/walk.go
length.SetTypecheck(1) return ptr, length } // mayCall reports whether evaluating expression n may require // function calls, which could clobber function call arguments/results // currently on the stack. func mayCall(n ir.Node) bool { // When instrumenting, any expression might require function calls. if base.Flag.Cfg.Instrumenting { return true } isSoftFloat := func(typ *types.Type) bool {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Feb 27 20:56:00 UTC 2024 - 10.4K bytes - Viewed (0) -
src/cmd/internal/obj/plist.go
pcdata := ctxt.EmitEntryStackMap(s, p, newprog) pcdata = ctxt.EmitEntryUnsafePoint(s, pcdata, newprog) return pcdata } // Similar to EmitEntryLiveness, but just emit stack map. func (ctxt *Link) EmitEntryStackMap(s *LSym, p *Prog, newprog ProgAlloc) *Prog { pcdata := Appendp(p, newprog) pcdata.Pos = s.Func().Text.Pos pcdata.As = APCDATA pcdata.From.Type = TYPE_CONST
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 01 15:52:41 UTC 2023 - 11.5K bytes - Viewed (0)