- Sort Score
- Result 10 results
- Languages All
Results 61 - 70 of 139 for auxint (0.11 sec)
-
src/cmd/compile/internal/ssa/poset_test.go
var v [1512]*Value for i := range v { v[i] = new(Value) v[i].ID = ID(i) if i >= 1000 && i < 1256 { v[i].Op = OpConst64 v[i].AuxInt = int64(i - 1000 - 128) } if i >= 1256 && i < 1512 { v[i].Op = OpConst64 v[i].AuxInt = int64(i - 1000 - 256) } } po := newPoset() po.SetUnsigned(unsigned) for idx, op := range ops { t.Logf("op%d%v", idx, op) switch op.typ {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sat Oct 26 07:52:35 UTC 2019 - 18.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/schedule.go
return c > 0 // smaller uses come later } // These comparisons are fairly arbitrary. // The goal here is stability in the face // of unrelated changes elsewhere in the compiler. if c := x.AuxInt - y.AuxInt; c != 0 { return c < 0 } if cmp := x.Type.Compare(y.Type); cmp != types.CMPeq { return cmp == types.CMPlt } return x.ID < y.ID } func (op Op) isLoweredGetClosurePtr() bool { switch op {
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/compile/internal/ssa/_gen/main.go
} type blockData struct { name string // the suffix for this block ("EQ", "LT", etc.) controls int // the number of control values this type of block requires aux string // the type of the Aux/AuxInt value, if any } type regInfo struct { // inputs[i] encodes the set of registers allowed for the i'th input. // Inputs that don't use registers (flags, memory, etc.) should be 0. inputs []regMask
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Jan 19 22:42:34 UTC 2023 - 16.9K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/PPC64.rules
(SRWconst (ANDconst [m] x) [s]) && mergePPC64RShiftMask(m>>uint(s),s,32) == 0 => (MOVDconst [0]) (SRWconst (ANDconst [m] x) [s]) && mergePPC64AndSrwi(m>>uint(s),s) != 0 => (RLWINM [mergePPC64AndSrwi(m>>uint(s),s)] x) (SRWconst (AND (MOVDconst [m]) x) [s]) && mergePPC64RShiftMask(m>>uint(s),s,32) == 0 => (MOVDconst [0]) (SRWconst (AND (MOVDconst [m]) x) [s]) && mergePPC64AndSrwi(m>>uint(s),s) != 0 => (RLWINM [mergePPC64AndSrwi(m>>uint(s),s)] x)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 53.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssagen/ssa.go
return s.curBlock.NewValue0A(s.peekPos(), op, t, aux) } // newValue0I adds a new value with no arguments and an auxint value to the current block. func (s *state) newValue0I(op ssa.Op, t *types.Type, auxint int64) *ssa.Value { return s.curBlock.NewValue0I(s.peekPos(), op, t, auxint) } // newValue1 adds a new value with one argument to the current block.
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/ssa/deadcode.go
live[v.ID] = true q = append(q, v) if v.Pos.IsStmt() != src.PosNotStmt { liveOrderStmts = append(liveOrderStmts, v) } } if v.Op == OpInlMark { if !liveInlIdx[int(v.AuxInt)] { // We don't need marks for bodies that // have been completely optimized away. // TODO: save marks only for bodies which // have a faulting instruction or a call? continue }
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/cmd/compile/internal/ssa/stackalloc.go
if !hasAnyArgOp(v) { continue } if v.Aux == nil { f.Fatalf("%s has nil Aux\n", v.LongString()) } if v.Op == OpArg { loc := LocalSlot{N: v.Aux.(*ir.Name), Type: v.Type, Off: v.AuxInt} if f.pass.debug > stackDebug { fmt.Printf("stackalloc OpArg %s to %s\n", v, loc) } f.setHome(v, loc) continue }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Feb 29 21:29:41 UTC 2024 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/shortcircuit.go
} // p is the predecessor corresponding to cidx. pe := b.Preds[cidx] p := pe.b pi := pe.i // t is the "taken" branch: the successor we always go to when coming in from p. ti := 1 ^ ctl.Args[cidx].AuxInt ^ swap te := b.Succs[ti] t := te.b if p == b || t == b { // This is an infinite loop; we can't remove it. See issue 33903. return false } var fixPhi func(*Value, int) if nOtherPhi > 0 {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Oct 03 17:47:02 UTC 2022 - 12.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/poset.go
package ssa import ( "fmt" "os" ) // If true, check poset integrity after every mutation var debugPoset = false const uintSize = 32 << (^uint(0) >> 63) // 32 or 64 // bitset is a bit array for dense indexes. type bitset []uint func newBitset(n int) bitset { return make(bitset, (n+uintSize-1)/uintSize) } func (bs bitset) Reset() { for i := range bs { bs[i] = 0 } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Sep 04 17:23:05 UTC 2023 - 37.2K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/debug.go
} synthesizeOpIntFloatArg := func(n *ir.Name, t *types.Type, reg abi.RegIndex, sl LocalSlot) *Value { aux := &AuxNameOffset{n, sl.Off} op, auxInt := ArgOpAndRegisterFor(reg, f.ABISelf) v := f.newValueNoBlock(op, t, pos) v.AuxInt = auxInt v.Aux = aux v.Args = nil v.Block = f.Entry newValues = append(newValues, v) addToNV(v, sl)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jun 10 19:44:43 UTC 2024 - 58.4K bytes - Viewed (0)