- Sort Score
- Result 10 results
- Languages All
Results 141 - 150 of 694 for Atack (0.05 sec)
-
test/fixedbugs/issue8048.go
// Issue 8048. Incorrect handling of liveness when walking stack // containing faulting frame. package main import "runtime" func main() { test1() test2() test3() } func test1() { // test1f will panic without its own defer. // The runtime.GC checks that we can walk the stack // at that point and not get confused. // The recover lets test1 exit normally.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 13:43:18 UTC 2016 - 2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/deadcode.go
return } // ReachableBlocks returns the reachable blocks in f. func ReachableBlocks(f *Func) []bool { reachable := make([]bool, f.NumBlocks()) reachable[f.Entry.ID] = true p := make([]*Block, 0, 64) // stack-like worklist p = append(p, f.Entry) for len(p) > 0 { // Pop a reachable block b := p[len(p)-1] p = p[:len(p)-1] // Mark successors as reachable s := b.Succs if b.Kind == BlockFirst { s = s[:1]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Dec 08 00:29:01 UTC 2023 - 9.2K 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) -
test/escape_hash_maphash.go
// license that can be found in the LICENSE file. // Test escape analysis for hash/maphash. package escape import ( "hash/maphash" ) func f() { var x maphash.Hash // should be stack allocatable x.WriteString("foo") x.Sum64()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Nov 16 20:31:45 UTC 2019 - 368 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) -
src/runtime/pprof/protomem.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 21 14:38:45 UTC 2024 - 2.9K bytes - Viewed (0)