- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 425 for flive (0.1 sec)
-
src/cmd/compile/internal/x86/ssa.go
func ssaMarkMoves(s *ssagen.State, b *ssa.Block) { flive := b.FlagsLiveAtEnd for _, c := range b.ControlValues() { flive = c.Type.IsFlags() || flive } for i := len(b.Values) - 1; i >= 0; i-- { v := b.Values[i] if flive && v.Op == ssa.Op386MOVLconst { // The "mark" is any non-nil Aux value. v.Aux = ssa.AuxMark } if v.Type.IsFlags() { flive = false } for _, a := range v.Args {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 01:26:58 UTC 2023 - 26.7K bytes - Viewed (0) -
src/cmd/compile/internal/s390x/ssa.go
func ssaMarkMoves(s *ssagen.State, b *ssa.Block) { flive := b.FlagsLiveAtEnd for _, c := range b.ControlValues() { flive = c.Type.IsFlags() || flive } for i := len(b.Values) - 1; i >= 0; i-- { v := b.Values[i] if flive && v.Op == ssa.OpS390XMOVDconst { // The "mark" is any non-nil Aux value. v.Aux = ssa.AuxMark } if v.Type.IsFlags() { flive = false } for _, a := range v.Args {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 24 01:26:58 UTC 2023 - 27.1K bytes - Viewed (0) -
src/cmd/compile/internal/liveness/plive.go
// Check to make sure only input variables are live. for i, n := range lv.vars { if !liveout.Get(int32(i)) { continue } if n.Class == ir.PPARAM { continue // ok } base.FatalfAt(n.Pos(), "bad live variable at entry of %v: %L", lv.fn.Nname, n) } // Record live variables. live := &lv.livevars[index] live.Or(*live, liveout) } if lv.doClobber {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 15:22:22 UTC 2024 - 45.2K bytes - Viewed (0) -
test/live.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 18K bytes - Viewed (0) -
src/runtime/traceback_test.go
if a < 0 { // use in-reg args to keep them alive return a + b + c + d + e } return n } //go:noinline func testTracebackArgs2(a bool, b struct { a, b, c int x [2]int }, _ [0]int, d [3]byte) int { n := runtime.Stack(testTracebackArgsBuf[:], false) if a { // use in-reg args to keep them alive return b.a + b.b + b.c + b.x[0] + b.x[1] + int(d[0]) + int(d[1]) + int(d[2])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Dec 14 17:22:18 UTC 2023 - 22.9K bytes - Viewed (0) -
src/runtime/arena_test.go
}) // Make sure it stays alive. GC() GC() // In order to ensure the object can be freed, we now need to make sure to use // the entire arena. Exhaust the rest of the arena. for i := 0; i < int(UserArenaChunkBytes/unsafe.Sizeof(mediumScalarEven{})); i++ { var x any x = (*mediumScalarEven)(nil) arena.New(&x) } // Make sure it stays alive again. GC() GC() v = nil
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 13.4K bytes - Viewed (0) -
src/runtime/mgcstack.go
// Once we're done processing all the pointers (including the ones we // added during processing), we've found all the stack objects that // are live. Any dead stack objects are not scanned and their contents // will not keep heap objects live. Unlike the main garbage // collection, we can't sweep the dead stack objects; they live on in // a moribund state until the stack frame that contains them is // popped. // // A stack can look like this: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Aug 21 21:06:52 UTC 2023 - 10.6K bytes - Viewed (0) -
test/live_regabi.go
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Dec 05 20:34:30 UTC 2023 - 18.4K bytes - Viewed (0) -
src/cmd/compile/internal/walk/range.go
// or the other of hp and hu as the loop proceeds. // // hp is live during most of the body of the loop. But it isn't live // at the very top of the loop, when we haven't checked i<n yet, and // it could point off the end of the backing store. // hu is live only at the very top and very bottom of the loop. // In particular, only when it cannot possibly be live across a call. // // So we do
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Sep 20 14:52:33 UTC 2023 - 17.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/stackalloc.go
s.interfere = s.interfere[:n] } else { s.interfere = make([][]ID, n) } live := f.newSparseSet(f.NumValues()) defer f.retSparseSet(live) for _, b := range f.Blocks { // Propagate liveness backwards to the start of the block. // Two values interfere if one is defined while the other is live. live.clear() live.addAll(s.live[b.ID]) for i := len(b.Values) - 1; i >= 0; i-- { v := b.Values[i]
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0)