- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 131 for Kappen (1.13 sec)
-
src/cmd/compile/internal/walk/assign.go
clrfn := mkcall(clrname, nil, &clr, hp, hn) clr.Append(clrfn) if hasPointers { // growslice will have cleared the new entries, so only // if growslice isn't called do we need to do the zeroing ourselves. nif.Body = append(nif.Body, clr...) } else { nifnz.Body = append(nifnz.Body, clr...) } typecheck.Stmts(nodes) walkStmtList(nodes) init.Append(nodes...) return s
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:09:06 UTC 2024 - 20.3K bytes - Viewed (0) -
src/cmd/go/internal/mvs/mvs.go
} m := module.Version{Path: path, Version: max[path]} min = append(min, m) walk(m) haveBase[path] = true } // Now the reverse postorder to bring in anything else. for i := len(postorder) - 1; i >= 0; i-- { m := postorder[i] if max[m.Path] != m.Version { // Older version. continue } if !have[m] { min = append(min, m) walk(m) } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Mar 27 21:58:12 UTC 2024 - 14.5K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
func (h *ValHeap) Push(x interface{}) { // Push and Pop use pointer receivers because they modify the slice's length, // not just its contents. v := x.(*Value) h.a = append(h.a, v) } func (h *ValHeap) Pop() interface{} { old := h.a n := len(old) x := old[n-1] h.a = old[0 : n-1] return x } func (h ValHeap) Less(i, j int) bool { x := h.a[i] y := h.a[j]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 15:53:17 UTC 2024 - 16.4K bytes - Viewed (0) -
src/cmd/dist/build.go
link = []string{pathf("%s/link", tooldir)} if goos == "android" { link = append(link, "-buildmode=pie") } if goldflags != "" { link = append(link, goldflags) } link = append(link, "-extld="+compilerEnvLookup("CC", defaultcc, goos, goarch)) link = append(link, "-L="+pathf("%s/pkg/obj/go-bootstrap/%s_%s", goroot, goos, goarch)) link = append(link, "-o", pathf("%s/%s%s", tooldir, elem, exe)) targ = len(link) - 1 }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 20 18:34:40 UTC 2024 - 54K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/memcombine.go
// We use BFS here, but any walk that puts roots before leaves would work. i := len(order) order = append(order, v) for ; i < len(order); i++ { x := order[i] for j := 0; j < 2; j++ { a := x.Args[j] if a.Op == OpOr16 || a.Op == OpOr32 || a.Op == OpOr64 { order = append(order, a) } } } } for _, v := range order { max := f.Config.RegSize switch v.Op {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 21 19:45:41 UTC 2024 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 284.9K bytes - Viewed (0) -
src/cmd/compile/internal/staticinit/sched.go
// within this package. seenMutation bool } func (s *Schedule) append(n ir.Node) { s.Out = append(s.Out, n) } // StaticInit adds an initialization statement n to the schedule. func (s *Schedule) StaticInit(n ir.Node) { if !s.tryStaticInit(n) { if base.Flag.Percent != 0 { ir.Dump("StaticInit failed", n) } s.append(n) } } // varToMapInit holds book-keeping state for global map initialization;
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 02 17:16:14 UTC 2024 - 30.7K bytes - Viewed (0) -
src/cmd/cgo/internal/testsanitizers/libfuzzer_test.go
cmd, err := cc(config.cFlags...) if err != nil { t.Fatalf("error running cc: %v", err) } cmd.Args = append(cmd.Args, config.ldFlags...) cmd.Args = append(cmd.Args, "-o", outPath, "-I", dir.Base()) if tc.cSrc != "" { cmd.Args = append(cmd.Args, srcPath(tc.cSrc)) } cmd.Args = append(cmd.Args, archivePath) mustRun(t, cmd) cmd = hangProneCmd(outPath) cmd.Dir = dir.Base()
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 31 00:12:03 UTC 2024 - 2.6K bytes - Viewed (0) -
src/cmd/covdata/covdata.go
var memprofilerateflag = flag.Int("memprofilerate", 0, "Set memprofile sampling rate to value") var matchpkg func(name string) bool var atExitFuncs []func() func atExit(f func()) { atExitFuncs = append(atExitFuncs, f) } func Exit(code int) { for i := len(atExitFuncs) - 1; i >= 0; i-- { f := atExitFuncs[i] atExitFuncs = atExitFuncs[:i] f() } os.Exit(code) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue May 14 19:41:17 UTC 2024 - 5.7K bytes - Viewed (0) -
src/cmd/compile/internal/types2/initorder.go
d.pred.add(n) } } } var G, funcG []*graphNode // separate non-functions and functions for _, n := range M { if _, ok := n.obj.(*Func); ok { funcG = append(funcG, n) } else { G = append(G, n) } } // remove function nodes and collect remaining graph nodes in G // (Mutually recursive functions may introduce cycles among themselves
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 28 22:06:51 UTC 2024 - 9.8K bytes - Viewed (0)