Source file src/cmd/compile/internal/ssagen/ssa.go

     1  // Copyright 2015 The Go Authors. All rights reserved.
     2  // Use of this source code is governed by a BSD-style
     3  // license that can be found in the LICENSE file.
     4  
     5  package ssagen
     6  
     7  import (
     8  	"bufio"
     9  	"bytes"
    10  	"cmp"
    11  	"fmt"
    12  	"go/constant"
    13  	"html"
    14  	"internal/buildcfg"
    15  	"os"
    16  	"path/filepath"
    17  	"slices"
    18  	"strings"
    19  
    20  	"cmd/compile/internal/abi"
    21  	"cmd/compile/internal/base"
    22  	"cmd/compile/internal/ir"
    23  	"cmd/compile/internal/liveness"
    24  	"cmd/compile/internal/objw"
    25  	"cmd/compile/internal/reflectdata"
    26  	"cmd/compile/internal/rttype"
    27  	"cmd/compile/internal/ssa"
    28  	"cmd/compile/internal/staticdata"
    29  	"cmd/compile/internal/typecheck"
    30  	"cmd/compile/internal/types"
    31  	"cmd/internal/obj"
    32  	"cmd/internal/objabi"
    33  	"cmd/internal/src"
    34  	"cmd/internal/sys"
    35  
    36  	rtabi "internal/abi"
    37  )
    38  
    39  var ssaConfig *ssa.Config
    40  var ssaCaches []ssa.Cache
    41  
    42  var ssaDump string     // early copy of $GOSSAFUNC; the func name to dump output for
    43  var ssaDir string      // optional destination for ssa dump file
    44  var ssaDumpStdout bool // whether to dump to stdout
    45  var ssaDumpCFG string  // generate CFGs for these phases
    46  const ssaDumpFile = "ssa.html"
    47  
    48  // ssaDumpInlined holds all inlined functions when ssaDump contains a function name.
    49  var ssaDumpInlined []*ir.Func
    50  
    51  // Maximum size we will aggregate heap allocations of scalar locals.
    52  // Almost certainly can't hurt to be as big as the tiny allocator.
    53  // Might help to be a bit bigger.
    54  const maxAggregatedHeapAllocation = 16
    55  
    56  func DumpInline(fn *ir.Func) {
    57  	if ssaDump != "" && ssaDump == ir.FuncName(fn) {
    58  		ssaDumpInlined = append(ssaDumpInlined, fn)
    59  	}
    60  }
    61  
    62  func InitEnv() {
    63  	ssaDump = os.Getenv("GOSSAFUNC")
    64  	ssaDir = os.Getenv("GOSSADIR")
    65  	if ssaDump != "" {
    66  		if strings.HasSuffix(ssaDump, "+") {
    67  			ssaDump = ssaDump[:len(ssaDump)-1]
    68  			ssaDumpStdout = true
    69  		}
    70  		spl := strings.Split(ssaDump, ":")
    71  		if len(spl) > 1 {
    72  			ssaDump = spl[0]
    73  			ssaDumpCFG = spl[1]
    74  		}
    75  	}
    76  }
    77  
    78  func InitConfig() {
    79  	types_ := ssa.NewTypes()
    80  
    81  	if Arch.SoftFloat {
    82  		softfloatInit()
    83  	}
    84  
    85  	// Generate a few pointer types that are uncommon in the frontend but common in the backend.
    86  	// Caching is disabled in the backend, so generating these here avoids allocations.
    87  	_ = types.NewPtr(types.Types[types.TINTER])                             // *interface{}
    88  	_ = types.NewPtr(types.NewPtr(types.Types[types.TSTRING]))              // **string
    89  	_ = types.NewPtr(types.NewSlice(types.Types[types.TINTER]))             // *[]interface{}
    90  	_ = types.NewPtr(types.NewPtr(types.ByteType))                          // **byte
    91  	_ = types.NewPtr(types.NewSlice(types.ByteType))                        // *[]byte
    92  	_ = types.NewPtr(types.NewSlice(types.Types[types.TSTRING]))            // *[]string
    93  	_ = types.NewPtr(types.NewPtr(types.NewPtr(types.Types[types.TUINT8]))) // ***uint8
    94  	_ = types.NewPtr(types.Types[types.TINT16])                             // *int16
    95  	_ = types.NewPtr(types.Types[types.TINT64])                             // *int64
    96  	_ = types.NewPtr(types.ErrorType)                                       // *error
    97  	if buildcfg.Experiment.SwissMap {
    98  		_ = types.NewPtr(reflectdata.SwissMapType()) // *internal/runtime/maps.Map
    99  	} else {
   100  		_ = types.NewPtr(reflectdata.OldMapType()) // *runtime.hmap
   101  	}
   102  	_ = types.NewPtr(deferstruct()) // *runtime._defer
   103  	types.NewPtrCacheEnabled = false
   104  	ssaConfig = ssa.NewConfig(base.Ctxt.Arch.Name, *types_, base.Ctxt, base.Flag.N == 0, Arch.SoftFloat)
   105  	ssaConfig.Race = base.Flag.Race
   106  	ssaCaches = make([]ssa.Cache, base.Flag.LowerC)
   107  
   108  	// Set up some runtime functions we'll need to call.
   109  	ir.Syms.AssertE2I = typecheck.LookupRuntimeFunc("assertE2I")
   110  	ir.Syms.AssertE2I2 = typecheck.LookupRuntimeFunc("assertE2I2")
   111  	ir.Syms.CgoCheckMemmove = typecheck.LookupRuntimeFunc("cgoCheckMemmove")
   112  	ir.Syms.CgoCheckPtrWrite = typecheck.LookupRuntimeFunc("cgoCheckPtrWrite")
   113  	ir.Syms.CheckPtrAlignment = typecheck.LookupRuntimeFunc("checkptrAlignment")
   114  	ir.Syms.Deferproc = typecheck.LookupRuntimeFunc("deferproc")
   115  	ir.Syms.Deferprocat = typecheck.LookupRuntimeFunc("deferprocat")
   116  	ir.Syms.DeferprocStack = typecheck.LookupRuntimeFunc("deferprocStack")
   117  	ir.Syms.Deferreturn = typecheck.LookupRuntimeFunc("deferreturn")
   118  	ir.Syms.Duffcopy = typecheck.LookupRuntimeFunc("duffcopy")
   119  	ir.Syms.Duffzero = typecheck.LookupRuntimeFunc("duffzero")
   120  	ir.Syms.GCWriteBarrier[0] = typecheck.LookupRuntimeFunc("gcWriteBarrier1")
   121  	ir.Syms.GCWriteBarrier[1] = typecheck.LookupRuntimeFunc("gcWriteBarrier2")
   122  	ir.Syms.GCWriteBarrier[2] = typecheck.LookupRuntimeFunc("gcWriteBarrier3")
   123  	ir.Syms.GCWriteBarrier[3] = typecheck.LookupRuntimeFunc("gcWriteBarrier4")
   124  	ir.Syms.GCWriteBarrier[4] = typecheck.LookupRuntimeFunc("gcWriteBarrier5")
   125  	ir.Syms.GCWriteBarrier[5] = typecheck.LookupRuntimeFunc("gcWriteBarrier6")
   126  	ir.Syms.GCWriteBarrier[6] = typecheck.LookupRuntimeFunc("gcWriteBarrier7")
   127  	ir.Syms.GCWriteBarrier[7] = typecheck.LookupRuntimeFunc("gcWriteBarrier8")
   128  	ir.Syms.Goschedguarded = typecheck.LookupRuntimeFunc("goschedguarded")
   129  	ir.Syms.Growslice = typecheck.LookupRuntimeFunc("growslice")
   130  	ir.Syms.InterfaceSwitch = typecheck.LookupRuntimeFunc("interfaceSwitch")
   131  	ir.Syms.MallocGC = typecheck.LookupRuntimeFunc("mallocgc")
   132  	ir.Syms.Memmove = typecheck.LookupRuntimeFunc("memmove")
   133  	ir.Syms.Msanread = typecheck.LookupRuntimeFunc("msanread")
   134  	ir.Syms.Msanwrite = typecheck.LookupRuntimeFunc("msanwrite")
   135  	ir.Syms.Msanmove = typecheck.LookupRuntimeFunc("msanmove")
   136  	ir.Syms.Asanread = typecheck.LookupRuntimeFunc("asanread")
   137  	ir.Syms.Asanwrite = typecheck.LookupRuntimeFunc("asanwrite")
   138  	ir.Syms.Newobject = typecheck.LookupRuntimeFunc("newobject")
   139  	ir.Syms.Newproc = typecheck.LookupRuntimeFunc("newproc")
   140  	ir.Syms.Panicdivide = typecheck.LookupRuntimeFunc("panicdivide")
   141  	ir.Syms.PanicdottypeE = typecheck.LookupRuntimeFunc("panicdottypeE")
   142  	ir.Syms.PanicdottypeI = typecheck.LookupRuntimeFunc("panicdottypeI")
   143  	ir.Syms.Panicnildottype = typecheck.LookupRuntimeFunc("panicnildottype")
   144  	ir.Syms.Panicoverflow = typecheck.LookupRuntimeFunc("panicoverflow")
   145  	ir.Syms.Panicshift = typecheck.LookupRuntimeFunc("panicshift")
   146  	ir.Syms.Racefuncenter = typecheck.LookupRuntimeFunc("racefuncenter")
   147  	ir.Syms.Racefuncexit = typecheck.LookupRuntimeFunc("racefuncexit")
   148  	ir.Syms.Raceread = typecheck.LookupRuntimeFunc("raceread")
   149  	ir.Syms.Racereadrange = typecheck.LookupRuntimeFunc("racereadrange")
   150  	ir.Syms.Racewrite = typecheck.LookupRuntimeFunc("racewrite")
   151  	ir.Syms.Racewriterange = typecheck.LookupRuntimeFunc("racewriterange")
   152  	ir.Syms.TypeAssert = typecheck.LookupRuntimeFunc("typeAssert")
   153  	ir.Syms.WBZero = typecheck.LookupRuntimeFunc("wbZero")
   154  	ir.Syms.WBMove = typecheck.LookupRuntimeFunc("wbMove")
   155  	ir.Syms.X86HasPOPCNT = typecheck.LookupRuntimeVar("x86HasPOPCNT")         // bool
   156  	ir.Syms.X86HasSSE41 = typecheck.LookupRuntimeVar("x86HasSSE41")           // bool
   157  	ir.Syms.X86HasFMA = typecheck.LookupRuntimeVar("x86HasFMA")               // bool
   158  	ir.Syms.ARMHasVFPv4 = typecheck.LookupRuntimeVar("armHasVFPv4")           // bool
   159  	ir.Syms.ARM64HasATOMICS = typecheck.LookupRuntimeVar("arm64HasATOMICS")   // bool
   160  	ir.Syms.Loong64HasLAMCAS = typecheck.LookupRuntimeVar("loong64HasLAMCAS") // bool
   161  	ir.Syms.Loong64HasLAM_BH = typecheck.LookupRuntimeVar("loong64HasLAM_BH") // bool
   162  	ir.Syms.Loong64HasLSX = typecheck.LookupRuntimeVar("loong64HasLSX")       // bool
   163  	ir.Syms.RISCV64HasZbb = typecheck.LookupRuntimeVar("riscv64HasZbb")       // bool
   164  	ir.Syms.Staticuint64s = typecheck.LookupRuntimeVar("staticuint64s")
   165  	ir.Syms.Typedmemmove = typecheck.LookupRuntimeFunc("typedmemmove")
   166  	ir.Syms.Udiv = typecheck.LookupRuntimeVar("udiv")                 // asm func with special ABI
   167  	ir.Syms.WriteBarrier = typecheck.LookupRuntimeVar("writeBarrier") // struct { bool; ... }
   168  	ir.Syms.Zerobase = typecheck.LookupRuntimeVar("zerobase")
   169  	ir.Syms.ZeroVal = typecheck.LookupRuntimeVar("zeroVal")
   170  
   171  	if Arch.LinkArch.Family == sys.Wasm {
   172  		BoundsCheckFunc[ssa.BoundsIndex] = typecheck.LookupRuntimeFunc("goPanicIndex")
   173  		BoundsCheckFunc[ssa.BoundsIndexU] = typecheck.LookupRuntimeFunc("goPanicIndexU")
   174  		BoundsCheckFunc[ssa.BoundsSliceAlen] = typecheck.LookupRuntimeFunc("goPanicSliceAlen")
   175  		BoundsCheckFunc[ssa.BoundsSliceAlenU] = typecheck.LookupRuntimeFunc("goPanicSliceAlenU")
   176  		BoundsCheckFunc[ssa.BoundsSliceAcap] = typecheck.LookupRuntimeFunc("goPanicSliceAcap")
   177  		BoundsCheckFunc[ssa.BoundsSliceAcapU] = typecheck.LookupRuntimeFunc("goPanicSliceAcapU")
   178  		BoundsCheckFunc[ssa.BoundsSliceB] = typecheck.LookupRuntimeFunc("goPanicSliceB")
   179  		BoundsCheckFunc[ssa.BoundsSliceBU] = typecheck.LookupRuntimeFunc("goPanicSliceBU")
   180  		BoundsCheckFunc[ssa.BoundsSlice3Alen] = typecheck.LookupRuntimeFunc("goPanicSlice3Alen")
   181  		BoundsCheckFunc[ssa.BoundsSlice3AlenU] = typecheck.LookupRuntimeFunc("goPanicSlice3AlenU")
   182  		BoundsCheckFunc[ssa.BoundsSlice3Acap] = typecheck.LookupRuntimeFunc("goPanicSlice3Acap")
   183  		BoundsCheckFunc[ssa.BoundsSlice3AcapU] = typecheck.LookupRuntimeFunc("goPanicSlice3AcapU")
   184  		BoundsCheckFunc[ssa.BoundsSlice3B] = typecheck.LookupRuntimeFunc("goPanicSlice3B")
   185  		BoundsCheckFunc[ssa.BoundsSlice3BU] = typecheck.LookupRuntimeFunc("goPanicSlice3BU")
   186  		BoundsCheckFunc[ssa.BoundsSlice3C] = typecheck.LookupRuntimeFunc("goPanicSlice3C")
   187  		BoundsCheckFunc[ssa.BoundsSlice3CU] = typecheck.LookupRuntimeFunc("goPanicSlice3CU")
   188  		BoundsCheckFunc[ssa.BoundsConvert] = typecheck.LookupRuntimeFunc("goPanicSliceConvert")
   189  	} else {
   190  		BoundsCheckFunc[ssa.BoundsIndex] = typecheck.LookupRuntimeFunc("panicIndex")
   191  		BoundsCheckFunc[ssa.BoundsIndexU] = typecheck.LookupRuntimeFunc("panicIndexU")
   192  		BoundsCheckFunc[ssa.BoundsSliceAlen] = typecheck.LookupRuntimeFunc("panicSliceAlen")
   193  		BoundsCheckFunc[ssa.BoundsSliceAlenU] = typecheck.LookupRuntimeFunc("panicSliceAlenU")
   194  		BoundsCheckFunc[ssa.BoundsSliceAcap] = typecheck.LookupRuntimeFunc("panicSliceAcap")
   195  		BoundsCheckFunc[ssa.BoundsSliceAcapU] = typecheck.LookupRuntimeFunc("panicSliceAcapU")
   196  		BoundsCheckFunc[ssa.BoundsSliceB] = typecheck.LookupRuntimeFunc("panicSliceB")
   197  		BoundsCheckFunc[ssa.BoundsSliceBU] = typecheck.LookupRuntimeFunc("panicSliceBU")
   198  		BoundsCheckFunc[ssa.BoundsSlice3Alen] = typecheck.LookupRuntimeFunc("panicSlice3Alen")
   199  		BoundsCheckFunc[ssa.BoundsSlice3AlenU] = typecheck.LookupRuntimeFunc("panicSlice3AlenU")
   200  		BoundsCheckFunc[ssa.BoundsSlice3Acap] = typecheck.LookupRuntimeFunc("panicSlice3Acap")
   201  		BoundsCheckFunc[ssa.BoundsSlice3AcapU] = typecheck.LookupRuntimeFunc("panicSlice3AcapU")
   202  		BoundsCheckFunc[ssa.BoundsSlice3B] = typecheck.LookupRuntimeFunc("panicSlice3B")
   203  		BoundsCheckFunc[ssa.BoundsSlice3BU] = typecheck.LookupRuntimeFunc("panicSlice3BU")
   204  		BoundsCheckFunc[ssa.BoundsSlice3C] = typecheck.LookupRuntimeFunc("panicSlice3C")
   205  		BoundsCheckFunc[ssa.BoundsSlice3CU] = typecheck.LookupRuntimeFunc("panicSlice3CU")
   206  		BoundsCheckFunc[ssa.BoundsConvert] = typecheck.LookupRuntimeFunc("panicSliceConvert")
   207  	}
   208  	if Arch.LinkArch.PtrSize == 4 {
   209  		ExtendCheckFunc[ssa.BoundsIndex] = typecheck.LookupRuntimeVar("panicExtendIndex")
   210  		ExtendCheckFunc[ssa.BoundsIndexU] = typecheck.LookupRuntimeVar("panicExtendIndexU")
   211  		ExtendCheckFunc[ssa.BoundsSliceAlen] = typecheck.LookupRuntimeVar("panicExtendSliceAlen")
   212  		ExtendCheckFunc[ssa.BoundsSliceAlenU] = typecheck.LookupRuntimeVar("panicExtendSliceAlenU")
   213  		ExtendCheckFunc[ssa.BoundsSliceAcap] = typecheck.LookupRuntimeVar("panicExtendSliceAcap")
   214  		ExtendCheckFunc[ssa.BoundsSliceAcapU] = typecheck.LookupRuntimeVar("panicExtendSliceAcapU")
   215  		ExtendCheckFunc[ssa.BoundsSliceB] = typecheck.LookupRuntimeVar("panicExtendSliceB")
   216  		ExtendCheckFunc[ssa.BoundsSliceBU] = typecheck.LookupRuntimeVar("panicExtendSliceBU")
   217  		ExtendCheckFunc[ssa.BoundsSlice3Alen] = typecheck.LookupRuntimeVar("panicExtendSlice3Alen")
   218  		ExtendCheckFunc[ssa.BoundsSlice3AlenU] = typecheck.LookupRuntimeVar("panicExtendSlice3AlenU")
   219  		ExtendCheckFunc[ssa.BoundsSlice3Acap] = typecheck.LookupRuntimeVar("panicExtendSlice3Acap")
   220  		ExtendCheckFunc[ssa.BoundsSlice3AcapU] = typecheck.LookupRuntimeVar("panicExtendSlice3AcapU")
   221  		ExtendCheckFunc[ssa.BoundsSlice3B] = typecheck.LookupRuntimeVar("panicExtendSlice3B")
   222  		ExtendCheckFunc[ssa.BoundsSlice3BU] = typecheck.LookupRuntimeVar("panicExtendSlice3BU")
   223  		ExtendCheckFunc[ssa.BoundsSlice3C] = typecheck.LookupRuntimeVar("panicExtendSlice3C")
   224  		ExtendCheckFunc[ssa.BoundsSlice3CU] = typecheck.LookupRuntimeVar("panicExtendSlice3CU")
   225  	}
   226  
   227  	// Wasm (all asm funcs with special ABIs)
   228  	ir.Syms.WasmDiv = typecheck.LookupRuntimeVar("wasmDiv")
   229  	ir.Syms.WasmTruncS = typecheck.LookupRuntimeVar("wasmTruncS")
   230  	ir.Syms.WasmTruncU = typecheck.LookupRuntimeVar("wasmTruncU")
   231  	ir.Syms.SigPanic = typecheck.LookupRuntimeFunc("sigpanic")
   232  }
   233  
   234  func InitTables() {
   235  	initIntrinsics(nil)
   236  }
   237  
   238  // AbiForBodylessFuncStackMap returns the ABI for a bodyless function's stack map.
   239  // This is not necessarily the ABI used to call it.
   240  // Currently (1.17 dev) such a stack map is always ABI0;
   241  // any ABI wrapper that is present is nosplit, hence a precise
   242  // stack map is not needed there (the parameters survive only long
   243  // enough to call the wrapped assembly function).
   244  // This always returns a freshly copied ABI.
   245  func AbiForBodylessFuncStackMap(fn *ir.Func) *abi.ABIConfig {
   246  	return ssaConfig.ABI0.Copy() // No idea what races will result, be safe
   247  }
   248  
   249  // abiForFunc implements ABI policy for a function, but does not return a copy of the ABI.
   250  // Passing a nil function returns the default ABI based on experiment configuration.
   251  func abiForFunc(fn *ir.Func, abi0, abi1 *abi.ABIConfig) *abi.ABIConfig {
   252  	if buildcfg.Experiment.RegabiArgs {
   253  		// Select the ABI based on the function's defining ABI.
   254  		if fn == nil {
   255  			return abi1
   256  		}
   257  		switch fn.ABI {
   258  		case obj.ABI0:
   259  			return abi0
   260  		case obj.ABIInternal:
   261  			// TODO(austin): Clean up the nomenclature here.
   262  			// It's not clear that "abi1" is ABIInternal.
   263  			return abi1
   264  		}
   265  		base.Fatalf("function %v has unknown ABI %v", fn, fn.ABI)
   266  		panic("not reachable")
   267  	}
   268  
   269  	a := abi0
   270  	if fn != nil {
   271  		if fn.Pragma&ir.RegisterParams != 0 { // TODO(register args) remove after register abi is working
   272  			a = abi1
   273  		}
   274  	}
   275  	return a
   276  }
   277  
   278  // emitOpenDeferInfo emits FUNCDATA information about the defers in a function
   279  // that is using open-coded defers.  This funcdata is used to determine the active
   280  // defers in a function and execute those defers during panic processing.
   281  //
   282  // The funcdata is all encoded in varints (since values will almost always be less than
   283  // 128, but stack offsets could potentially be up to 2Gbyte). All "locations" (offsets)
   284  // for stack variables are specified as the number of bytes below varp (pointer to the
   285  // top of the local variables) for their starting address. The format is:
   286  //
   287  //   - Offset of the deferBits variable
   288  //   - Offset of the first closure slot (the rest are laid out consecutively).
   289  func (s *state) emitOpenDeferInfo() {
   290  	firstOffset := s.openDefers[0].closureNode.FrameOffset()
   291  
   292  	// Verify that cmpstackvarlt laid out the slots in order.
   293  	for i, r := range s.openDefers {
   294  		have := r.closureNode.FrameOffset()
   295  		want := firstOffset + int64(i)*int64(types.PtrSize)
   296  		if have != want {
   297  			base.FatalfAt(s.curfn.Pos(), "unexpected frame offset for open-coded defer slot #%v: have %v, want %v", i, have, want)
   298  		}
   299  	}
   300  
   301  	x := base.Ctxt.Lookup(s.curfn.LSym.Name + ".opendefer")
   302  	x.Set(obj.AttrContentAddressable, true)
   303  	s.curfn.LSym.Func().OpenCodedDeferInfo = x
   304  
   305  	off := 0
   306  	off = objw.Uvarint(x, off, uint64(-s.deferBitsTemp.FrameOffset()))
   307  	off = objw.Uvarint(x, off, uint64(-firstOffset))
   308  }
   309  
   310  // buildssa builds an SSA function for fn.
   311  // worker indicates which of the backend workers is doing the processing.
   312  func buildssa(fn *ir.Func, worker int, isPgoHot bool) *ssa.Func {
   313  	name := ir.FuncName(fn)
   314  
   315  	abiSelf := abiForFunc(fn, ssaConfig.ABI0, ssaConfig.ABI1)
   316  
   317  	printssa := false
   318  	// match either a simple name e.g. "(*Reader).Reset", package.name e.g. "compress/gzip.(*Reader).Reset", or subpackage name "gzip.(*Reader).Reset"
   319  	// optionally allows an ABI suffix specification in the GOSSAHASH, e.g. "(*Reader).Reset<0>" etc
   320  	if strings.Contains(ssaDump, name) { // in all the cases the function name is entirely contained within the GOSSAFUNC string.
   321  		nameOptABI := name
   322  		if l := len(ssaDump); l > 1 && ssaDump[l-2] == ',' { // ABI specification
   323  			nameOptABI = ssa.FuncNameABI(name, abiSelf.Which())
   324  		} else if strings.HasSuffix(ssaDump, ">") { // if they use the linker syntax instead....
   325  			l := len(ssaDump)
   326  			if l >= 3 && ssaDump[l-3] == '<' {
   327  				nameOptABI = ssa.FuncNameABI(name, abiSelf.Which())
   328  				ssaDump = ssaDump[:l-3] + "," + ssaDump[l-2:l-1]
   329  			}
   330  		}
   331  		pkgDotName := base.Ctxt.Pkgpath + "." + nameOptABI
   332  		printssa = nameOptABI == ssaDump || // "(*Reader).Reset"
   333  			pkgDotName == ssaDump || // "compress/gzip.(*Reader).Reset"
   334  			strings.HasSuffix(pkgDotName, ssaDump) && strings.HasSuffix(pkgDotName, "/"+ssaDump) // "gzip.(*Reader).Reset"
   335  	}
   336  
   337  	var astBuf *bytes.Buffer
   338  	if printssa {
   339  		astBuf = &bytes.Buffer{}
   340  		ir.FDumpList(astBuf, "buildssa-body", fn.Body)
   341  		if ssaDumpStdout {
   342  			fmt.Println("generating SSA for", name)
   343  			fmt.Print(astBuf.String())
   344  		}
   345  	}
   346  
   347  	var s state
   348  	s.pushLine(fn.Pos())
   349  	defer s.popLine()
   350  
   351  	s.hasdefer = fn.HasDefer()
   352  	if fn.Pragma&ir.CgoUnsafeArgs != 0 {
   353  		s.cgoUnsafeArgs = true
   354  	}
   355  	s.checkPtrEnabled = ir.ShouldCheckPtr(fn, 1)
   356  
   357  	if base.Flag.Cfg.Instrumenting && fn.Pragma&ir.Norace == 0 && !fn.Linksym().ABIWrapper() {
   358  		if !base.Flag.Race || !objabi.LookupPkgSpecial(fn.Sym().Pkg.Path).NoRaceFunc {
   359  			s.instrumentMemory = true
   360  		}
   361  		if base.Flag.Race {
   362  			s.instrumentEnterExit = true
   363  		}
   364  	}
   365  
   366  	fe := ssafn{
   367  		curfn: fn,
   368  		log:   printssa && ssaDumpStdout,
   369  	}
   370  	s.curfn = fn
   371  
   372  	cache := &ssaCaches[worker]
   373  	cache.Reset()
   374  
   375  	s.f = ssaConfig.NewFunc(&fe, cache)
   376  	s.config = ssaConfig
   377  	s.f.Type = fn.Type()
   378  	s.f.Name = name
   379  	s.f.PrintOrHtmlSSA = printssa
   380  	if fn.Pragma&ir.Nosplit != 0 {
   381  		s.f.NoSplit = true
   382  	}
   383  	s.f.ABI0 = ssaConfig.ABI0
   384  	s.f.ABI1 = ssaConfig.ABI1
   385  	s.f.ABIDefault = abiForFunc(nil, ssaConfig.ABI0, ssaConfig.ABI1)
   386  	s.f.ABISelf = abiSelf
   387  
   388  	s.panics = map[funcLine]*ssa.Block{}
   389  	s.softFloat = s.config.SoftFloat
   390  
   391  	// Allocate starting block
   392  	s.f.Entry = s.f.NewBlock(ssa.BlockPlain)
   393  	s.f.Entry.Pos = fn.Pos()
   394  	s.f.IsPgoHot = isPgoHot
   395  
   396  	if printssa {
   397  		ssaDF := ssaDumpFile
   398  		if ssaDir != "" {
   399  			ssaDF = filepath.Join(ssaDir, base.Ctxt.Pkgpath+"."+s.f.NameABI()+".html")
   400  			ssaD := filepath.Dir(ssaDF)
   401  			os.MkdirAll(ssaD, 0755)
   402  		}
   403  		s.f.HTMLWriter = ssa.NewHTMLWriter(ssaDF, s.f, ssaDumpCFG)
   404  		// TODO: generate and print a mapping from nodes to values and blocks
   405  		dumpSourcesColumn(s.f.HTMLWriter, fn)
   406  		s.f.HTMLWriter.WriteAST("AST", astBuf)
   407  	}
   408  
   409  	// Allocate starting values
   410  	s.labels = map[string]*ssaLabel{}
   411  	s.fwdVars = map[ir.Node]*ssa.Value{}
   412  	s.startmem = s.entryNewValue0(ssa.OpInitMem, types.TypeMem)
   413  
   414  	s.hasOpenDefers = base.Flag.N == 0 && s.hasdefer && !s.curfn.OpenCodedDeferDisallowed()
   415  	switch {
   416  	case base.Debug.NoOpenDefer != 0:
   417  		s.hasOpenDefers = false
   418  	case s.hasOpenDefers && (base.Ctxt.Flag_shared || base.Ctxt.Flag_dynlink) && base.Ctxt.Arch.Name == "386":
   419  		// Don't support open-coded defers for 386 ONLY when using shared
   420  		// libraries, because there is extra code (added by rewriteToUseGot())
   421  		// preceding the deferreturn/ret code that we don't track correctly.
   422  		//
   423  		// TODO this restriction can be removed given adjusted offset in computeDeferReturn in cmd/link/internal/ld/pcln.go
   424  		s.hasOpenDefers = false
   425  	}
   426  	if s.hasOpenDefers && s.instrumentEnterExit {
   427  		// Skip doing open defers if we need to instrument function
   428  		// returns for the race detector, since we will not generate that
   429  		// code in the case of the extra deferreturn/ret segment.
   430  		s.hasOpenDefers = false
   431  	}
   432  	if s.hasOpenDefers {
   433  		// Similarly, skip if there are any heap-allocated result
   434  		// parameters that need to be copied back to their stack slots.
   435  		for _, f := range s.curfn.Type().Results() {
   436  			if !f.Nname.(*ir.Name).OnStack() {
   437  				s.hasOpenDefers = false
   438  				break
   439  			}
   440  		}
   441  	}
   442  	if s.hasOpenDefers &&
   443  		s.curfn.NumReturns*s.curfn.NumDefers > 15 {
   444  		// Since we are generating defer calls at every exit for
   445  		// open-coded defers, skip doing open-coded defers if there are
   446  		// too many returns (especially if there are multiple defers).
   447  		// Open-coded defers are most important for improving performance
   448  		// for smaller functions (which don't have many returns).
   449  		s.hasOpenDefers = false
   450  	}
   451  
   452  	s.sp = s.entryNewValue0(ssa.OpSP, types.Types[types.TUINTPTR]) // TODO: use generic pointer type (unsafe.Pointer?) instead
   453  	s.sb = s.entryNewValue0(ssa.OpSB, types.Types[types.TUINTPTR])
   454  
   455  	s.startBlock(s.f.Entry)
   456  	s.vars[memVar] = s.startmem
   457  	if s.hasOpenDefers {
   458  		// Create the deferBits variable and stack slot.  deferBits is a
   459  		// bitmask showing which of the open-coded defers in this function
   460  		// have been activated.
   461  		deferBitsTemp := typecheck.TempAt(src.NoXPos, s.curfn, types.Types[types.TUINT8])
   462  		deferBitsTemp.SetAddrtaken(true)
   463  		s.deferBitsTemp = deferBitsTemp
   464  		// For this value, AuxInt is initialized to zero by default
   465  		startDeferBits := s.entryNewValue0(ssa.OpConst8, types.Types[types.TUINT8])
   466  		s.vars[deferBitsVar] = startDeferBits
   467  		s.deferBitsAddr = s.addr(deferBitsTemp)
   468  		s.store(types.Types[types.TUINT8], s.deferBitsAddr, startDeferBits)
   469  		// Make sure that the deferBits stack slot is kept alive (for use
   470  		// by panics) and stores to deferBits are not eliminated, even if
   471  		// all checking code on deferBits in the function exit can be
   472  		// eliminated, because the defer statements were all
   473  		// unconditional.
   474  		s.vars[memVar] = s.newValue1Apos(ssa.OpVarLive, types.TypeMem, deferBitsTemp, s.mem(), false)
   475  	}
   476  
   477  	var params *abi.ABIParamResultInfo
   478  	params = s.f.ABISelf.ABIAnalyze(fn.Type(), true)
   479  
   480  	// The backend's stackframe pass prunes away entries from the fn's
   481  	// Dcl list, including PARAMOUT nodes that correspond to output
   482  	// params passed in registers. Walk the Dcl list and capture these
   483  	// nodes to a side list, so that we'll have them available during
   484  	// DWARF-gen later on. See issue 48573 for more details.
   485  	var debugInfo ssa.FuncDebug
   486  	for _, n := range fn.Dcl {
   487  		if n.Class == ir.PPARAMOUT && n.IsOutputParamInRegisters() {
   488  			debugInfo.RegOutputParams = append(debugInfo.RegOutputParams, n)
   489  		}
   490  	}
   491  	fn.DebugInfo = &debugInfo
   492  
   493  	// Generate addresses of local declarations
   494  	s.decladdrs = map[*ir.Name]*ssa.Value{}
   495  	for _, n := range fn.Dcl {
   496  		switch n.Class {
   497  		case ir.PPARAM:
   498  			// Be aware that blank and unnamed input parameters will not appear here, but do appear in the type
   499  			s.decladdrs[n] = s.entryNewValue2A(ssa.OpLocalAddr, types.NewPtr(n.Type()), n, s.sp, s.startmem)
   500  		case ir.PPARAMOUT:
   501  			s.decladdrs[n] = s.entryNewValue2A(ssa.OpLocalAddr, types.NewPtr(n.Type()), n, s.sp, s.startmem)
   502  		case ir.PAUTO:
   503  			// processed at each use, to prevent Addr coming
   504  			// before the decl.
   505  		default:
   506  			s.Fatalf("local variable with class %v unimplemented", n.Class)
   507  		}
   508  	}
   509  
   510  	s.f.OwnAux = ssa.OwnAuxCall(fn.LSym, params)
   511  
   512  	// Populate SSAable arguments.
   513  	for _, n := range fn.Dcl {
   514  		if n.Class == ir.PPARAM {
   515  			if s.canSSA(n) {
   516  				v := s.newValue0A(ssa.OpArg, n.Type(), n)
   517  				s.vars[n] = v
   518  				s.addNamedValue(n, v) // This helps with debugging information, not needed for compilation itself.
   519  			} else { // address was taken AND/OR too large for SSA
   520  				paramAssignment := ssa.ParamAssignmentForArgName(s.f, n)
   521  				if len(paramAssignment.Registers) > 0 {
   522  					if ssa.CanSSA(n.Type()) { // SSA-able type, so address was taken -- receive value in OpArg, DO NOT bind to var, store immediately to memory.
   523  						v := s.newValue0A(ssa.OpArg, n.Type(), n)
   524  						s.store(n.Type(), s.decladdrs[n], v)
   525  					} else { // Too big for SSA.
   526  						// Brute force, and early, do a bunch of stores from registers
   527  						// Note that expand calls knows about this and doesn't trouble itself with larger-than-SSA-able Args in registers.
   528  						s.storeParameterRegsToStack(s.f.ABISelf, paramAssignment, n, s.decladdrs[n], false)
   529  					}
   530  				}
   531  			}
   532  		}
   533  	}
   534  
   535  	// Populate closure variables.
   536  	if fn.Needctxt() {
   537  		clo := s.entryNewValue0(ssa.OpGetClosurePtr, s.f.Config.Types.BytePtr)
   538  		if fn.RangeParent != nil && base.Flag.N != 0 {
   539  			// For a range body closure, keep its closure pointer live on the
   540  			// stack with a special name, so the debugger can look for it and
   541  			// find the parent frame.
   542  			sym := &types.Sym{Name: ".closureptr", Pkg: types.LocalPkg}
   543  			cloSlot := s.curfn.NewLocal(src.NoXPos, sym, s.f.Config.Types.BytePtr)
   544  			cloSlot.SetUsed(true)
   545  			cloSlot.SetEsc(ir.EscNever)
   546  			cloSlot.SetAddrtaken(true)
   547  			s.f.CloSlot = cloSlot
   548  			s.vars[memVar] = s.newValue1Apos(ssa.OpVarDef, types.TypeMem, cloSlot, s.mem(), false)
   549  			addr := s.addr(cloSlot)
   550  			s.store(s.f.Config.Types.BytePtr, addr, clo)
   551  			// Keep it from being dead-store eliminated.
   552  			s.vars[memVar] = s.newValue1Apos(ssa.OpVarLive, types.TypeMem, cloSlot, s.mem(), false)
   553  		}
   554  		csiter := typecheck.NewClosureStructIter(fn.ClosureVars)
   555  		for {
   556  			n, typ, offset := csiter.Next()
   557  			if n == nil {
   558  				break
   559  			}
   560  
   561  			ptr := s.newValue1I(ssa.OpOffPtr, types.NewPtr(typ), offset, clo)
   562  
   563  			// If n is a small variable captured by value, promote
   564  			// it to PAUTO so it can be converted to SSA.
   565  			//
   566  			// Note: While we never capture a variable by value if
   567  			// the user took its address, we may have generated
   568  			// runtime calls that did (#43701). Since we don't
   569  			// convert Addrtaken variables to SSA anyway, no point
   570  			// in promoting them either.
   571  			if n.Byval() && !n.Addrtaken() && ssa.CanSSA(n.Type()) {
   572  				n.Class = ir.PAUTO
   573  				fn.Dcl = append(fn.Dcl, n)
   574  				s.assign(n, s.load(n.Type(), ptr), false, 0)
   575  				continue
   576  			}
   577  
   578  			if !n.Byval() {
   579  				ptr = s.load(typ, ptr)
   580  			}
   581  			s.setHeapaddr(fn.Pos(), n, ptr)
   582  		}
   583  	}
   584  
   585  	// Convert the AST-based IR to the SSA-based IR
   586  	if s.instrumentEnterExit {
   587  		s.rtcall(ir.Syms.Racefuncenter, true, nil, s.newValue0(ssa.OpGetCallerPC, types.Types[types.TUINTPTR]))
   588  	}
   589  	s.zeroResults()
   590  	s.paramsToHeap()
   591  	s.stmtList(fn.Body)
   592  
   593  	// fallthrough to exit
   594  	if s.curBlock != nil {
   595  		s.pushLine(fn.Endlineno)
   596  		s.exit()
   597  		s.popLine()
   598  	}
   599  
   600  	for _, b := range s.f.Blocks {
   601  		if b.Pos != src.NoXPos {
   602  			s.updateUnsetPredPos(b)
   603  		}
   604  	}
   605  
   606  	s.f.HTMLWriter.WritePhase("before insert phis", "before insert phis")
   607  
   608  	s.insertPhis()
   609  
   610  	// Main call to ssa package to compile function
   611  	ssa.Compile(s.f)
   612  
   613  	fe.AllocFrame(s.f)
   614  
   615  	if len(s.openDefers) != 0 {
   616  		s.emitOpenDeferInfo()
   617  	}
   618  
   619  	// Record incoming parameter spill information for morestack calls emitted in the assembler.
   620  	// This is done here, using all the parameters (used, partially used, and unused) because
   621  	// it mimics the behavior of the former ABI (everything stored) and because it's not 100%
   622  	// clear if naming conventions are respected in autogenerated code.
   623  	// TODO figure out exactly what's unused, don't spill it. Make liveness fine-grained, also.
   624  	for _, p := range params.InParams() {
   625  		typs, offs := p.RegisterTypesAndOffsets()
   626  		for i, t := range typs {
   627  			o := offs[i]                // offset within parameter
   628  			fo := p.FrameOffset(params) // offset of parameter in frame
   629  			reg := ssa.ObjRegForAbiReg(p.Registers[i], s.f.Config)
   630  			s.f.RegArgs = append(s.f.RegArgs, ssa.Spill{Reg: reg, Offset: fo + o, Type: t})
   631  		}
   632  	}
   633  
   634  	return s.f
   635  }
   636  
   637  func (s *state) storeParameterRegsToStack(abi *abi.ABIConfig, paramAssignment *abi.ABIParamAssignment, n *ir.Name, addr *ssa.Value, pointersOnly bool) {
   638  	typs, offs := paramAssignment.RegisterTypesAndOffsets()
   639  	for i, t := range typs {
   640  		if pointersOnly && !t.IsPtrShaped() {
   641  			continue
   642  		}
   643  		r := paramAssignment.Registers[i]
   644  		o := offs[i]
   645  		op, reg := ssa.ArgOpAndRegisterFor(r, abi)
   646  		aux := &ssa.AuxNameOffset{Name: n, Offset: o}
   647  		v := s.newValue0I(op, t, reg)
   648  		v.Aux = aux
   649  		p := s.newValue1I(ssa.OpOffPtr, types.NewPtr(t), o, addr)
   650  		s.store(t, p, v)
   651  	}
   652  }
   653  
   654  // zeroResults zeros the return values at the start of the function.
   655  // We need to do this very early in the function.  Defer might stop a
   656  // panic and show the return values as they exist at the time of
   657  // panic.  For precise stacks, the garbage collector assumes results
   658  // are always live, so we need to zero them before any allocations,
   659  // even allocations to move params/results to the heap.
   660  func (s *state) zeroResults() {
   661  	for _, f := range s.curfn.Type().Results() {
   662  		n := f.Nname.(*ir.Name)
   663  		if !n.OnStack() {
   664  			// The local which points to the return value is the
   665  			// thing that needs zeroing. This is already handled
   666  			// by a Needzero annotation in plive.go:(*liveness).epilogue.
   667  			continue
   668  		}
   669  		// Zero the stack location containing f.
   670  		if typ := n.Type(); ssa.CanSSA(typ) {
   671  			s.assign(n, s.zeroVal(typ), false, 0)
   672  		} else {
   673  			if typ.HasPointers() || ssa.IsMergeCandidate(n) {
   674  				s.vars[memVar] = s.newValue1A(ssa.OpVarDef, types.TypeMem, n, s.mem())
   675  			}
   676  			s.zero(n.Type(), s.decladdrs[n])
   677  		}
   678  	}
   679  }
   680  
   681  // paramsToHeap produces code to allocate memory for heap-escaped parameters
   682  // and to copy non-result parameters' values from the stack.
   683  func (s *state) paramsToHeap() {
   684  	do := func(params []*types.Field) {
   685  		for _, f := range params {
   686  			if f.Nname == nil {
   687  				continue // anonymous or blank parameter
   688  			}
   689  			n := f.Nname.(*ir.Name)
   690  			if ir.IsBlank(n) || n.OnStack() {
   691  				continue
   692  			}
   693  			s.newHeapaddr(n)
   694  			if n.Class == ir.PPARAM {
   695  				s.move(n.Type(), s.expr(n.Heapaddr), s.decladdrs[n])
   696  			}
   697  		}
   698  	}
   699  
   700  	typ := s.curfn.Type()
   701  	do(typ.Recvs())
   702  	do(typ.Params())
   703  	do(typ.Results())
   704  }
   705  
   706  // allocSizeAndAlign returns the size and alignment of t.
   707  // Normally just t.Size() and t.Alignment(), but there
   708  // is a special case to handle 64-bit atomics on 32-bit systems.
   709  func allocSizeAndAlign(t *types.Type) (int64, int64) {
   710  	size, align := t.Size(), t.Alignment()
   711  	if types.PtrSize == 4 && align == 4 && size >= 8 {
   712  		// For 64-bit atomics on 32-bit systems.
   713  		size = types.RoundUp(size, 8)
   714  		align = 8
   715  	}
   716  	return size, align
   717  }
   718  func allocSize(t *types.Type) int64 {
   719  	size, _ := allocSizeAndAlign(t)
   720  	return size
   721  }
   722  func allocAlign(t *types.Type) int64 {
   723  	_, align := allocSizeAndAlign(t)
   724  	return align
   725  }
   726  
   727  // newHeapaddr allocates heap memory for n and sets its heap address.
   728  func (s *state) newHeapaddr(n *ir.Name) {
   729  	size := allocSize(n.Type())
   730  	if n.Type().HasPointers() || size >= maxAggregatedHeapAllocation || size == 0 {
   731  		s.setHeapaddr(n.Pos(), n, s.newObject(n.Type(), nil))
   732  		return
   733  	}
   734  
   735  	// Do we have room together with our pending allocations?
   736  	// If not, flush all the current ones.
   737  	var used int64
   738  	for _, v := range s.pendingHeapAllocations {
   739  		used += allocSize(v.Type.Elem())
   740  	}
   741  	if used+size > maxAggregatedHeapAllocation {
   742  		s.flushPendingHeapAllocations()
   743  	}
   744  
   745  	var allocCall *ssa.Value // (SelectN [0] (call of runtime.newobject))
   746  	if len(s.pendingHeapAllocations) == 0 {
   747  		// Make an allocation, but the type being allocated is just
   748  		// the first pending object. We will come back and update it
   749  		// later if needed.
   750  		allocCall = s.newObject(n.Type(), nil)
   751  	} else {
   752  		allocCall = s.pendingHeapAllocations[0].Args[0]
   753  	}
   754  	// v is an offset to the shared allocation. Offsets are dummy 0s for now.
   755  	v := s.newValue1I(ssa.OpOffPtr, n.Type().PtrTo(), 0, allocCall)
   756  
   757  	// Add to list of pending allocations.
   758  	s.pendingHeapAllocations = append(s.pendingHeapAllocations, v)
   759  
   760  	// Finally, record for posterity.
   761  	s.setHeapaddr(n.Pos(), n, v)
   762  }
   763  
   764  func (s *state) flushPendingHeapAllocations() {
   765  	pending := s.pendingHeapAllocations
   766  	if len(pending) == 0 {
   767  		return // nothing to do
   768  	}
   769  	s.pendingHeapAllocations = nil // reset state
   770  	ptr := pending[0].Args[0]      // The SelectN [0] op
   771  	call := ptr.Args[0]            // The runtime.newobject call
   772  
   773  	if len(pending) == 1 {
   774  		// Just a single object, do a standard allocation.
   775  		v := pending[0]
   776  		v.Op = ssa.OpCopy // instead of OffPtr [0]
   777  		return
   778  	}
   779  
   780  	// Sort in decreasing alignment.
   781  	// This way we never have to worry about padding.
   782  	// (Stable not required; just cleaner to keep program order among equal alignments.)
   783  	slices.SortStableFunc(pending, func(x, y *ssa.Value) int {
   784  		return cmp.Compare(allocAlign(y.Type.Elem()), allocAlign(x.Type.Elem()))
   785  	})
   786  
   787  	// Figure out how much data we need allocate.
   788  	var size int64
   789  	for _, v := range pending {
   790  		v.AuxInt = size // Adjust OffPtr to the right value while we are here.
   791  		size += allocSize(v.Type.Elem())
   792  	}
   793  	align := allocAlign(pending[0].Type.Elem())
   794  	size = types.RoundUp(size, align)
   795  
   796  	// Convert newObject call to a mallocgc call.
   797  	args := []*ssa.Value{
   798  		s.constInt(types.Types[types.TUINTPTR], size),
   799  		s.constNil(call.Args[0].Type), // a nil *runtime._type
   800  		s.constBool(true),             // needZero TODO: false is ok?
   801  		call.Args[1],                  // memory
   802  	}
   803  	call.Aux = ssa.StaticAuxCall(ir.Syms.MallocGC, s.f.ABIDefault.ABIAnalyzeTypes(
   804  		[]*types.Type{args[0].Type, args[1].Type, args[2].Type},
   805  		[]*types.Type{types.Types[types.TUNSAFEPTR]},
   806  	))
   807  	call.AuxInt = 4 * s.config.PtrSize // arg+results size, uintptr/ptr/bool/ptr
   808  	call.SetArgs4(args[0], args[1], args[2], args[3])
   809  	// TODO: figure out how to pass alignment to runtime
   810  
   811  	call.Type = types.NewTuple(types.Types[types.TUNSAFEPTR], types.TypeMem)
   812  	ptr.Type = types.Types[types.TUNSAFEPTR]
   813  }
   814  
   815  // setHeapaddr allocates a new PAUTO variable to store ptr (which must be non-nil)
   816  // and then sets it as n's heap address.
   817  func (s *state) setHeapaddr(pos src.XPos, n *ir.Name, ptr *ssa.Value) {
   818  	if !ptr.Type.IsPtr() || !types.Identical(n.Type(), ptr.Type.Elem()) {
   819  		base.FatalfAt(n.Pos(), "setHeapaddr %L with type %v", n, ptr.Type)
   820  	}
   821  
   822  	// Declare variable to hold address.
   823  	sym := &types.Sym{Name: "&" + n.Sym().Name, Pkg: types.LocalPkg}
   824  	addr := s.curfn.NewLocal(pos, sym, types.NewPtr(n.Type()))
   825  	addr.SetUsed(true)
   826  	types.CalcSize(addr.Type())
   827  
   828  	if n.Class == ir.PPARAMOUT {
   829  		addr.SetIsOutputParamHeapAddr(true)
   830  	}
   831  
   832  	n.Heapaddr = addr
   833  	s.assign(addr, ptr, false, 0)
   834  }
   835  
   836  // newObject returns an SSA value denoting new(typ).
   837  func (s *state) newObject(typ *types.Type, rtype *ssa.Value) *ssa.Value {
   838  	if typ.Size() == 0 {
   839  		return s.newValue1A(ssa.OpAddr, types.NewPtr(typ), ir.Syms.Zerobase, s.sb)
   840  	}
   841  	if rtype == nil {
   842  		rtype = s.reflectType(typ)
   843  	}
   844  	return s.rtcall(ir.Syms.Newobject, true, []*types.Type{types.NewPtr(typ)}, rtype)[0]
   845  }
   846  
   847  func (s *state) checkPtrAlignment(n *ir.ConvExpr, v *ssa.Value, count *ssa.Value) {
   848  	if !n.Type().IsPtr() {
   849  		s.Fatalf("expected pointer type: %v", n.Type())
   850  	}
   851  	elem, rtypeExpr := n.Type().Elem(), n.ElemRType
   852  	if count != nil {
   853  		if !elem.IsArray() {
   854  			s.Fatalf("expected array type: %v", elem)
   855  		}
   856  		elem, rtypeExpr = elem.Elem(), n.ElemElemRType
   857  	}
   858  	size := elem.Size()
   859  	// Casting from larger type to smaller one is ok, so for smallest type, do nothing.
   860  	if elem.Alignment() == 1 && (size == 0 || size == 1 || count == nil) {
   861  		return
   862  	}
   863  	if count == nil {
   864  		count = s.constInt(types.Types[types.TUINTPTR], 1)
   865  	}
   866  	if count.Type.Size() != s.config.PtrSize {
   867  		s.Fatalf("expected count fit to a uintptr size, have: %d, want: %d", count.Type.Size(), s.config.PtrSize)
   868  	}
   869  	var rtype *ssa.Value
   870  	if rtypeExpr != nil {
   871  		rtype = s.expr(rtypeExpr)
   872  	} else {
   873  		rtype = s.reflectType(elem)
   874  	}
   875  	s.rtcall(ir.Syms.CheckPtrAlignment, true, nil, v, rtype, count)
   876  }
   877  
   878  // reflectType returns an SSA value representing a pointer to typ's
   879  // reflection type descriptor.
   880  func (s *state) reflectType(typ *types.Type) *ssa.Value {
   881  	// TODO(mdempsky): Make this Fatalf under Unified IR; frontend needs
   882  	// to supply RType expressions.
   883  	lsym := reflectdata.TypeLinksym(typ)
   884  	return s.entryNewValue1A(ssa.OpAddr, types.NewPtr(types.Types[types.TUINT8]), lsym, s.sb)
   885  }
   886  
   887  func dumpSourcesColumn(writer *ssa.HTMLWriter, fn *ir.Func) {
   888  	// Read sources of target function fn.
   889  	fname := base.Ctxt.PosTable.Pos(fn.Pos()).Filename()
   890  	targetFn, err := readFuncLines(fname, fn.Pos().Line(), fn.Endlineno.Line())
   891  	if err != nil {
   892  		writer.Logf("cannot read sources for function %v: %v", fn, err)
   893  	}
   894  
   895  	// Read sources of inlined functions.
   896  	var inlFns []*ssa.FuncLines
   897  	for _, fi := range ssaDumpInlined {
   898  		elno := fi.Endlineno
   899  		fname := base.Ctxt.PosTable.Pos(fi.Pos()).Filename()
   900  		fnLines, err := readFuncLines(fname, fi.Pos().Line(), elno.Line())
   901  		if err != nil {
   902  			writer.Logf("cannot read sources for inlined function %v: %v", fi, err)
   903  			continue
   904  		}
   905  		inlFns = append(inlFns, fnLines)
   906  	}
   907  
   908  	slices.SortFunc(inlFns, ssa.ByTopoCmp)
   909  	if targetFn != nil {
   910  		inlFns = append([]*ssa.FuncLines{targetFn}, inlFns...)
   911  	}
   912  
   913  	writer.WriteSources("sources", inlFns)
   914  }
   915  
   916  func readFuncLines(file string, start, end uint) (*ssa.FuncLines, error) {
   917  	f, err := os.Open(os.ExpandEnv(file))
   918  	if err != nil {
   919  		return nil, err
   920  	}
   921  	defer f.Close()
   922  	var lines []string
   923  	ln := uint(1)
   924  	scanner := bufio.NewScanner(f)
   925  	for scanner.Scan() && ln <= end {
   926  		if ln >= start {
   927  			lines = append(lines, scanner.Text())
   928  		}
   929  		ln++
   930  	}
   931  	return &ssa.FuncLines{Filename: file, StartLineno: start, Lines: lines}, nil
   932  }
   933  
   934  // updateUnsetPredPos propagates the earliest-value position information for b
   935  // towards all of b's predecessors that need a position, and recurs on that
   936  // predecessor if its position is updated. B should have a non-empty position.
   937  func (s *state) updateUnsetPredPos(b *ssa.Block) {
   938  	if b.Pos == src.NoXPos {
   939  		s.Fatalf("Block %s should have a position", b)
   940  	}
   941  	bestPos := src.NoXPos
   942  	for _, e := range b.Preds {
   943  		p := e.Block()
   944  		if !p.LackingPos() {
   945  			continue
   946  		}
   947  		if bestPos == src.NoXPos {
   948  			bestPos = b.Pos
   949  			for _, v := range b.Values {
   950  				if v.LackingPos() {
   951  					continue
   952  				}
   953  				if v.Pos != src.NoXPos {
   954  					// Assume values are still in roughly textual order;
   955  					// TODO: could also seek minimum position?
   956  					bestPos = v.Pos
   957  					break
   958  				}
   959  			}
   960  		}
   961  		p.Pos = bestPos
   962  		s.updateUnsetPredPos(p) // We do not expect long chains of these, thus recursion is okay.
   963  	}
   964  }
   965  
   966  // Information about each open-coded defer.
   967  type openDeferInfo struct {
   968  	// The node representing the call of the defer
   969  	n *ir.CallExpr
   970  	// If defer call is closure call, the address of the argtmp where the
   971  	// closure is stored.
   972  	closure *ssa.Value
   973  	// The node representing the argtmp where the closure is stored - used for
   974  	// function, method, or interface call, to store a closure that panic
   975  	// processing can use for this defer.
   976  	closureNode *ir.Name
   977  }
   978  
   979  type state struct {
   980  	// configuration (arch) information
   981  	config *ssa.Config
   982  
   983  	// function we're building
   984  	f *ssa.Func
   985  
   986  	// Node for function
   987  	curfn *ir.Func
   988  
   989  	// labels in f
   990  	labels map[string]*ssaLabel
   991  
   992  	// unlabeled break and continue statement tracking
   993  	breakTo    *ssa.Block // current target for plain break statement
   994  	continueTo *ssa.Block // current target for plain continue statement
   995  
   996  	// current location where we're interpreting the AST
   997  	curBlock *ssa.Block
   998  
   999  	// variable assignments in the current block (map from variable symbol to ssa value)
  1000  	// *Node is the unique identifier (an ONAME Node) for the variable.
  1001  	// TODO: keep a single varnum map, then make all of these maps slices instead?
  1002  	vars map[ir.Node]*ssa.Value
  1003  
  1004  	// fwdVars are variables that are used before they are defined in the current block.
  1005  	// This map exists just to coalesce multiple references into a single FwdRef op.
  1006  	// *Node is the unique identifier (an ONAME Node) for the variable.
  1007  	fwdVars map[ir.Node]*ssa.Value
  1008  
  1009  	// all defined variables at the end of each block. Indexed by block ID.
  1010  	defvars []map[ir.Node]*ssa.Value
  1011  
  1012  	// addresses of PPARAM and PPARAMOUT variables on the stack.
  1013  	decladdrs map[*ir.Name]*ssa.Value
  1014  
  1015  	// starting values. Memory, stack pointer, and globals pointer
  1016  	startmem *ssa.Value
  1017  	sp       *ssa.Value
  1018  	sb       *ssa.Value
  1019  	// value representing address of where deferBits autotmp is stored
  1020  	deferBitsAddr *ssa.Value
  1021  	deferBitsTemp *ir.Name
  1022  
  1023  	// line number stack. The current line number is top of stack
  1024  	line []src.XPos
  1025  	// the last line number processed; it may have been popped
  1026  	lastPos src.XPos
  1027  
  1028  	// list of panic calls by function name and line number.
  1029  	// Used to deduplicate panic calls.
  1030  	panics map[funcLine]*ssa.Block
  1031  
  1032  	cgoUnsafeArgs       bool
  1033  	hasdefer            bool // whether the function contains a defer statement
  1034  	softFloat           bool
  1035  	hasOpenDefers       bool // whether we are doing open-coded defers
  1036  	checkPtrEnabled     bool // whether to insert checkptr instrumentation
  1037  	instrumentEnterExit bool // whether to instrument function enter/exit
  1038  	instrumentMemory    bool // whether to instrument memory operations
  1039  
  1040  	// If doing open-coded defers, list of info about the defer calls in
  1041  	// scanning order. Hence, at exit we should run these defers in reverse
  1042  	// order of this list
  1043  	openDefers []*openDeferInfo
  1044  	// For open-coded defers, this is the beginning and end blocks of the last
  1045  	// defer exit code that we have generated so far. We use these to share
  1046  	// code between exits if the shareDeferExits option (disabled by default)
  1047  	// is on.
  1048  	lastDeferExit       *ssa.Block // Entry block of last defer exit code we generated
  1049  	lastDeferFinalBlock *ssa.Block // Final block of last defer exit code we generated
  1050  	lastDeferCount      int        // Number of defers encountered at that point
  1051  
  1052  	prevCall *ssa.Value // the previous call; use this to tie results to the call op.
  1053  
  1054  	// List of allocations in the current block that are still pending.
  1055  	// They are all (OffPtr (Select0 (runtime call))) and have the correct types,
  1056  	// but the offsets are not set yet, and the type of the runtime call is also not final.
  1057  	pendingHeapAllocations []*ssa.Value
  1058  
  1059  	// First argument of append calls that could be stack allocated.
  1060  	appendTargets map[ir.Node]bool
  1061  }
  1062  
  1063  type funcLine struct {
  1064  	f    *obj.LSym
  1065  	base *src.PosBase
  1066  	line uint
  1067  }
  1068  
  1069  type ssaLabel struct {
  1070  	target         *ssa.Block // block identified by this label
  1071  	breakTarget    *ssa.Block // block to break to in control flow node identified by this label
  1072  	continueTarget *ssa.Block // block to continue to in control flow node identified by this label
  1073  }
  1074  
  1075  // label returns the label associated with sym, creating it if necessary.
  1076  func (s *state) label(sym *types.Sym) *ssaLabel {
  1077  	lab := s.labels[sym.Name]
  1078  	if lab == nil {
  1079  		lab = new(ssaLabel)
  1080  		s.labels[sym.Name] = lab
  1081  	}
  1082  	return lab
  1083  }
  1084  
  1085  func (s *state) Logf(msg string, args ...interface{}) { s.f.Logf(msg, args...) }
  1086  func (s *state) Log() bool                            { return s.f.Log() }
  1087  func (s *state) Fatalf(msg string, args ...interface{}) {
  1088  	s.f.Frontend().Fatalf(s.peekPos(), msg, args...)
  1089  }
  1090  func (s *state) Warnl(pos src.XPos, msg string, args ...interface{}) { s.f.Warnl(pos, msg, args...) }
  1091  func (s *state) Debug_checknil() bool                                { return s.f.Frontend().Debug_checknil() }
  1092  
  1093  func ssaMarker(name string) *ir.Name {
  1094  	return ir.NewNameAt(base.Pos, &types.Sym{Name: name}, nil)
  1095  }
  1096  
  1097  var (
  1098  	// marker node for the memory variable
  1099  	memVar = ssaMarker("mem")
  1100  
  1101  	// marker nodes for temporary variables
  1102  	ptrVar       = ssaMarker("ptr")
  1103  	lenVar       = ssaMarker("len")
  1104  	capVar       = ssaMarker("cap")
  1105  	typVar       = ssaMarker("typ")
  1106  	okVar        = ssaMarker("ok")
  1107  	deferBitsVar = ssaMarker("deferBits")
  1108  	hashVar      = ssaMarker("hash")
  1109  )
  1110  
  1111  // startBlock sets the current block we're generating code in to b.
  1112  func (s *state) startBlock(b *ssa.Block) {
  1113  	if s.curBlock != nil {
  1114  		s.Fatalf("starting block %v when block %v has not ended", b, s.curBlock)
  1115  	}
  1116  	s.curBlock = b
  1117  	s.vars = map[ir.Node]*ssa.Value{}
  1118  	clear(s.fwdVars)
  1119  }
  1120  
  1121  // endBlock marks the end of generating code for the current block.
  1122  // Returns the (former) current block. Returns nil if there is no current
  1123  // block, i.e. if no code flows to the current execution point.
  1124  func (s *state) endBlock() *ssa.Block {
  1125  	b := s.curBlock
  1126  	if b == nil {
  1127  		return nil
  1128  	}
  1129  
  1130  	s.flushPendingHeapAllocations()
  1131  
  1132  	for len(s.defvars) <= int(b.ID) {
  1133  		s.defvars = append(s.defvars, nil)
  1134  	}
  1135  	s.defvars[b.ID] = s.vars
  1136  	s.curBlock = nil
  1137  	s.vars = nil
  1138  	if b.LackingPos() {
  1139  		// Empty plain blocks get the line of their successor (handled after all blocks created),
  1140  		// except for increment blocks in For statements (handled in ssa conversion of OFOR),
  1141  		// and for blocks ending in GOTO/BREAK/CONTINUE.
  1142  		b.Pos = src.NoXPos
  1143  	} else {
  1144  		b.Pos = s.lastPos
  1145  	}
  1146  	return b
  1147  }
  1148  
  1149  // pushLine pushes a line number on the line number stack.
  1150  func (s *state) pushLine(line src.XPos) {
  1151  	if !line.IsKnown() {
  1152  		// the frontend may emit node with line number missing,
  1153  		// use the parent line number in this case.
  1154  		line = s.peekPos()
  1155  		if base.Flag.K != 0 {
  1156  			base.Warn("buildssa: unknown position (line 0)")
  1157  		}
  1158  	} else {
  1159  		s.lastPos = line
  1160  	}
  1161  
  1162  	s.line = append(s.line, line)
  1163  }
  1164  
  1165  // popLine pops the top of the line number stack.
  1166  func (s *state) popLine() {
  1167  	s.line = s.line[:len(s.line)-1]
  1168  }
  1169  
  1170  // peekPos peeks the top of the line number stack.
  1171  func (s *state) peekPos() src.XPos {
  1172  	return s.line[len(s.line)-1]
  1173  }
  1174  
  1175  // newValue0 adds a new value with no arguments to the current block.
  1176  func (s *state) newValue0(op ssa.Op, t *types.Type) *ssa.Value {
  1177  	return s.curBlock.NewValue0(s.peekPos(), op, t)
  1178  }
  1179  
  1180  // newValue0A adds a new value with no arguments and an aux value to the current block.
  1181  func (s *state) newValue0A(op ssa.Op, t *types.Type, aux ssa.Aux) *ssa.Value {
  1182  	return s.curBlock.NewValue0A(s.peekPos(), op, t, aux)
  1183  }
  1184  
  1185  // newValue0I adds a new value with no arguments and an auxint value to the current block.
  1186  func (s *state) newValue0I(op ssa.Op, t *types.Type, auxint int64) *ssa.Value {
  1187  	return s.curBlock.NewValue0I(s.peekPos(), op, t, auxint)
  1188  }
  1189  
  1190  // newValue1 adds a new value with one argument to the current block.
  1191  func (s *state) newValue1(op ssa.Op, t *types.Type, arg *ssa.Value) *ssa.Value {
  1192  	return s.curBlock.NewValue1(s.peekPos(), op, t, arg)
  1193  }
  1194  
  1195  // newValue1A adds a new value with one argument and an aux value to the current block.
  1196  func (s *state) newValue1A(op ssa.Op, t *types.Type, aux ssa.Aux, arg *ssa.Value) *ssa.Value {
  1197  	return s.curBlock.NewValue1A(s.peekPos(), op, t, aux, arg)
  1198  }
  1199  
  1200  // newValue1Apos adds a new value with one argument and an aux value to the current block.
  1201  // isStmt determines whether the created values may be a statement or not
  1202  // (i.e., false means never, yes means maybe).
  1203  func (s *state) newValue1Apos(op ssa.Op, t *types.Type, aux ssa.Aux, arg *ssa.Value, isStmt bool) *ssa.Value {
  1204  	if isStmt {
  1205  		return s.curBlock.NewValue1A(s.peekPos(), op, t, aux, arg)
  1206  	}
  1207  	return s.curBlock.NewValue1A(s.peekPos().WithNotStmt(), op, t, aux, arg)
  1208  }
  1209  
  1210  // newValue1I adds a new value with one argument and an auxint value to the current block.
  1211  func (s *state) newValue1I(op ssa.Op, t *types.Type, aux int64, arg *ssa.Value) *ssa.Value {
  1212  	return s.curBlock.NewValue1I(s.peekPos(), op, t, aux, arg)
  1213  }
  1214  
  1215  // newValue2 adds a new value with two arguments to the current block.
  1216  func (s *state) newValue2(op ssa.Op, t *types.Type, arg0, arg1 *ssa.Value) *ssa.Value {
  1217  	return s.curBlock.NewValue2(s.peekPos(), op, t, arg0, arg1)
  1218  }
  1219  
  1220  // newValue2A adds a new value with two arguments and an aux value to the current block.
  1221  func (s *state) newValue2A(op ssa.Op, t *types.Type, aux ssa.Aux, arg0, arg1 *ssa.Value) *ssa.Value {
  1222  	return s.curBlock.NewValue2A(s.peekPos(), op, t, aux, arg0, arg1)
  1223  }
  1224  
  1225  // newValue2Apos adds a new value with two arguments and an aux value to the current block.
  1226  // isStmt determines whether the created values may be a statement or not
  1227  // (i.e., false means never, yes means maybe).
  1228  func (s *state) newValue2Apos(op ssa.Op, t *types.Type, aux ssa.Aux, arg0, arg1 *ssa.Value, isStmt bool) *ssa.Value {
  1229  	if isStmt {
  1230  		return s.curBlock.NewValue2A(s.peekPos(), op, t, aux, arg0, arg1)
  1231  	}
  1232  	return s.curBlock.NewValue2A(s.peekPos().WithNotStmt(), op, t, aux, arg0, arg1)
  1233  }
  1234  
  1235  // newValue2I adds a new value with two arguments and an auxint value to the current block.
  1236  func (s *state) newValue2I(op ssa.Op, t *types.Type, aux int64, arg0, arg1 *ssa.Value) *ssa.Value {
  1237  	return s.curBlock.NewValue2I(s.peekPos(), op, t, aux, arg0, arg1)
  1238  }
  1239  
  1240  // newValue3 adds a new value with three arguments to the current block.
  1241  func (s *state) newValue3(op ssa.Op, t *types.Type, arg0, arg1, arg2 *ssa.Value) *ssa.Value {
  1242  	return s.curBlock.NewValue3(s.peekPos(), op, t, arg0, arg1, arg2)
  1243  }
  1244  
  1245  // newValue3I adds a new value with three arguments and an auxint value to the current block.
  1246  func (s *state) newValue3I(op ssa.Op, t *types.Type, aux int64, arg0, arg1, arg2 *ssa.Value) *ssa.Value {
  1247  	return s.curBlock.NewValue3I(s.peekPos(), op, t, aux, arg0, arg1, arg2)
  1248  }
  1249  
  1250  // newValue3A adds a new value with three arguments and an aux value to the current block.
  1251  func (s *state) newValue3A(op ssa.Op, t *types.Type, aux ssa.Aux, arg0, arg1, arg2 *ssa.Value) *ssa.Value {
  1252  	return s.curBlock.NewValue3A(s.peekPos(), op, t, aux, arg0, arg1, arg2)
  1253  }
  1254  
  1255  // newValue3Apos adds a new value with three arguments and an aux value to the current block.
  1256  // isStmt determines whether the created values may be a statement or not
  1257  // (i.e., false means never, yes means maybe).
  1258  func (s *state) newValue3Apos(op ssa.Op, t *types.Type, aux ssa.Aux, arg0, arg1, arg2 *ssa.Value, isStmt bool) *ssa.Value {
  1259  	if isStmt {
  1260  		return s.curBlock.NewValue3A(s.peekPos(), op, t, aux, arg0, arg1, arg2)
  1261  	}
  1262  	return s.curBlock.NewValue3A(s.peekPos().WithNotStmt(), op, t, aux, arg0, arg1, arg2)
  1263  }
  1264  
  1265  // newValue4 adds a new value with four arguments to the current block.
  1266  func (s *state) newValue4(op ssa.Op, t *types.Type, arg0, arg1, arg2, arg3 *ssa.Value) *ssa.Value {
  1267  	return s.curBlock.NewValue4(s.peekPos(), op, t, arg0, arg1, arg2, arg3)
  1268  }
  1269  
  1270  // newValue4I adds a new value with four arguments and an auxint value to the current block.
  1271  func (s *state) newValue4I(op ssa.Op, t *types.Type, aux int64, arg0, arg1, arg2, arg3 *ssa.Value) *ssa.Value {
  1272  	return s.curBlock.NewValue4I(s.peekPos(), op, t, aux, arg0, arg1, arg2, arg3)
  1273  }
  1274  
  1275  func (s *state) entryBlock() *ssa.Block {
  1276  	b := s.f.Entry
  1277  	if base.Flag.N > 0 && s.curBlock != nil {
  1278  		// If optimizations are off, allocate in current block instead. Since with -N
  1279  		// we're not doing the CSE or tighten passes, putting lots of stuff in the
  1280  		// entry block leads to O(n^2) entries in the live value map during regalloc.
  1281  		// See issue 45897.
  1282  		b = s.curBlock
  1283  	}
  1284  	return b
  1285  }
  1286  
  1287  // entryNewValue0 adds a new value with no arguments to the entry block.
  1288  func (s *state) entryNewValue0(op ssa.Op, t *types.Type) *ssa.Value {
  1289  	return s.entryBlock().NewValue0(src.NoXPos, op, t)
  1290  }
  1291  
  1292  // entryNewValue0A adds a new value with no arguments and an aux value to the entry block.
  1293  func (s *state) entryNewValue0A(op ssa.Op, t *types.Type, aux ssa.Aux) *ssa.Value {
  1294  	return s.entryBlock().NewValue0A(src.NoXPos, op, t, aux)
  1295  }
  1296  
  1297  // entryNewValue1 adds a new value with one argument to the entry block.
  1298  func (s *state) entryNewValue1(op ssa.Op, t *types.Type, arg *ssa.Value) *ssa.Value {
  1299  	return s.entryBlock().NewValue1(src.NoXPos, op, t, arg)
  1300  }
  1301  
  1302  // entryNewValue1I adds a new value with one argument and an auxint value to the entry block.
  1303  func (s *state) entryNewValue1I(op ssa.Op, t *types.Type, auxint int64, arg *ssa.Value) *ssa.Value {
  1304  	return s.entryBlock().NewValue1I(src.NoXPos, op, t, auxint, arg)
  1305  }
  1306  
  1307  // entryNewValue1A adds a new value with one argument and an aux value to the entry block.
  1308  func (s *state) entryNewValue1A(op ssa.Op, t *types.Type, aux ssa.Aux, arg *ssa.Value) *ssa.Value {
  1309  	return s.entryBlock().NewValue1A(src.NoXPos, op, t, aux, arg)
  1310  }
  1311  
  1312  // entryNewValue2 adds a new value with two arguments to the entry block.
  1313  func (s *state) entryNewValue2(op ssa.Op, t *types.Type, arg0, arg1 *ssa.Value) *ssa.Value {
  1314  	return s.entryBlock().NewValue2(src.NoXPos, op, t, arg0, arg1)
  1315  }
  1316  
  1317  // entryNewValue2A adds a new value with two arguments and an aux value to the entry block.
  1318  func (s *state) entryNewValue2A(op ssa.Op, t *types.Type, aux ssa.Aux, arg0, arg1 *ssa.Value) *ssa.Value {
  1319  	return s.entryBlock().NewValue2A(src.NoXPos, op, t, aux, arg0, arg1)
  1320  }
  1321  
  1322  // const* routines add a new const value to the entry block.
  1323  func (s *state) constSlice(t *types.Type) *ssa.Value {
  1324  	return s.f.ConstSlice(t)
  1325  }
  1326  func (s *state) constInterface(t *types.Type) *ssa.Value {
  1327  	return s.f.ConstInterface(t)
  1328  }
  1329  func (s *state) constNil(t *types.Type) *ssa.Value { return s.f.ConstNil(t) }
  1330  func (s *state) constEmptyString(t *types.Type) *ssa.Value {
  1331  	return s.f.ConstEmptyString(t)
  1332  }
  1333  func (s *state) constBool(c bool) *ssa.Value {
  1334  	return s.f.ConstBool(types.Types[types.TBOOL], c)
  1335  }
  1336  func (s *state) constInt8(t *types.Type, c int8) *ssa.Value {
  1337  	return s.f.ConstInt8(t, c)
  1338  }
  1339  func (s *state) constInt16(t *types.Type, c int16) *ssa.Value {
  1340  	return s.f.ConstInt16(t, c)
  1341  }
  1342  func (s *state) constInt32(t *types.Type, c int32) *ssa.Value {
  1343  	return s.f.ConstInt32(t, c)
  1344  }
  1345  func (s *state) constInt64(t *types.Type, c int64) *ssa.Value {
  1346  	return s.f.ConstInt64(t, c)
  1347  }
  1348  func (s *state) constFloat32(t *types.Type, c float64) *ssa.Value {
  1349  	return s.f.ConstFloat32(t, c)
  1350  }
  1351  func (s *state) constFloat64(t *types.Type, c float64) *ssa.Value {
  1352  	return s.f.ConstFloat64(t, c)
  1353  }
  1354  func (s *state) constInt(t *types.Type, c int64) *ssa.Value {
  1355  	if s.config.PtrSize == 8 {
  1356  		return s.constInt64(t, c)
  1357  	}
  1358  	if int64(int32(c)) != c {
  1359  		s.Fatalf("integer constant too big %d", c)
  1360  	}
  1361  	return s.constInt32(t, int32(c))
  1362  }
  1363  func (s *state) constOffPtrSP(t *types.Type, c int64) *ssa.Value {
  1364  	return s.f.ConstOffPtrSP(t, c, s.sp)
  1365  }
  1366  
  1367  // newValueOrSfCall* are wrappers around newValue*, which may create a call to a
  1368  // soft-float runtime function instead (when emitting soft-float code).
  1369  func (s *state) newValueOrSfCall1(op ssa.Op, t *types.Type, arg *ssa.Value) *ssa.Value {
  1370  	if s.softFloat {
  1371  		if c, ok := s.sfcall(op, arg); ok {
  1372  			return c
  1373  		}
  1374  	}
  1375  	return s.newValue1(op, t, arg)
  1376  }
  1377  func (s *state) newValueOrSfCall2(op ssa.Op, t *types.Type, arg0, arg1 *ssa.Value) *ssa.Value {
  1378  	if s.softFloat {
  1379  		if c, ok := s.sfcall(op, arg0, arg1); ok {
  1380  			return c
  1381  		}
  1382  	}
  1383  	return s.newValue2(op, t, arg0, arg1)
  1384  }
  1385  
  1386  type instrumentKind uint8
  1387  
  1388  const (
  1389  	instrumentRead = iota
  1390  	instrumentWrite
  1391  	instrumentMove
  1392  )
  1393  
  1394  func (s *state) instrument(t *types.Type, addr *ssa.Value, kind instrumentKind) {
  1395  	s.instrument2(t, addr, nil, kind)
  1396  }
  1397  
  1398  // instrumentFields instruments a read/write operation on addr.
  1399  // If it is instrumenting for MSAN or ASAN and t is a struct type, it instruments
  1400  // operation for each field, instead of for the whole struct.
  1401  func (s *state) instrumentFields(t *types.Type, addr *ssa.Value, kind instrumentKind) {
  1402  	if !(base.Flag.MSan || base.Flag.ASan) || !t.IsStruct() {
  1403  		s.instrument(t, addr, kind)
  1404  		return
  1405  	}
  1406  	for _, f := range t.Fields() {
  1407  		if f.Sym.IsBlank() {
  1408  			continue
  1409  		}
  1410  		offptr := s.newValue1I(ssa.OpOffPtr, types.NewPtr(f.Type), f.Offset, addr)
  1411  		s.instrumentFields(f.Type, offptr, kind)
  1412  	}
  1413  }
  1414  
  1415  func (s *state) instrumentMove(t *types.Type, dst, src *ssa.Value) {
  1416  	if base.Flag.MSan {
  1417  		s.instrument2(t, dst, src, instrumentMove)
  1418  	} else {
  1419  		s.instrument(t, src, instrumentRead)
  1420  		s.instrument(t, dst, instrumentWrite)
  1421  	}
  1422  }
  1423  
  1424  func (s *state) instrument2(t *types.Type, addr, addr2 *ssa.Value, kind instrumentKind) {
  1425  	if !s.instrumentMemory {
  1426  		return
  1427  	}
  1428  
  1429  	w := t.Size()
  1430  	if w == 0 {
  1431  		return // can't race on zero-sized things
  1432  	}
  1433  
  1434  	if ssa.IsSanitizerSafeAddr(addr) {
  1435  		return
  1436  	}
  1437  
  1438  	var fn *obj.LSym
  1439  	needWidth := false
  1440  
  1441  	if addr2 != nil && kind != instrumentMove {
  1442  		panic("instrument2: non-nil addr2 for non-move instrumentation")
  1443  	}
  1444  
  1445  	if base.Flag.MSan {
  1446  		switch kind {
  1447  		case instrumentRead:
  1448  			fn = ir.Syms.Msanread
  1449  		case instrumentWrite:
  1450  			fn = ir.Syms.Msanwrite
  1451  		case instrumentMove:
  1452  			fn = ir.Syms.Msanmove
  1453  		default:
  1454  			panic("unreachable")
  1455  		}
  1456  		needWidth = true
  1457  	} else if base.Flag.Race && t.NumComponents(types.CountBlankFields) > 1 {
  1458  		// for composite objects we have to write every address
  1459  		// because a write might happen to any subobject.
  1460  		// composites with only one element don't have subobjects, though.
  1461  		switch kind {
  1462  		case instrumentRead:
  1463  			fn = ir.Syms.Racereadrange
  1464  		case instrumentWrite:
  1465  			fn = ir.Syms.Racewriterange
  1466  		default:
  1467  			panic("unreachable")
  1468  		}
  1469  		needWidth = true
  1470  	} else if base.Flag.Race {
  1471  		// for non-composite objects we can write just the start
  1472  		// address, as any write must write the first byte.
  1473  		switch kind {
  1474  		case instrumentRead:
  1475  			fn = ir.Syms.Raceread
  1476  		case instrumentWrite:
  1477  			fn = ir.Syms.Racewrite
  1478  		default:
  1479  			panic("unreachable")
  1480  		}
  1481  	} else if base.Flag.ASan {
  1482  		switch kind {
  1483  		case instrumentRead:
  1484  			fn = ir.Syms.Asanread
  1485  		case instrumentWrite:
  1486  			fn = ir.Syms.Asanwrite
  1487  		default:
  1488  			panic("unreachable")
  1489  		}
  1490  		needWidth = true
  1491  	} else {
  1492  		panic("unreachable")
  1493  	}
  1494  
  1495  	args := []*ssa.Value{addr}
  1496  	if addr2 != nil {
  1497  		args = append(args, addr2)
  1498  	}
  1499  	if needWidth {
  1500  		args = append(args, s.constInt(types.Types[types.TUINTPTR], w))
  1501  	}
  1502  	s.rtcall(fn, true, nil, args...)
  1503  }
  1504  
  1505  func (s *state) load(t *types.Type, src *ssa.Value) *ssa.Value {
  1506  	s.instrumentFields(t, src, instrumentRead)
  1507  	return s.rawLoad(t, src)
  1508  }
  1509  
  1510  func (s *state) rawLoad(t *types.Type, src *ssa.Value) *ssa.Value {
  1511  	return s.newValue2(ssa.OpLoad, t, src, s.mem())
  1512  }
  1513  
  1514  func (s *state) store(t *types.Type, dst, val *ssa.Value) {
  1515  	s.vars[memVar] = s.newValue3A(ssa.OpStore, types.TypeMem, t, dst, val, s.mem())
  1516  }
  1517  
  1518  func (s *state) zero(t *types.Type, dst *ssa.Value) {
  1519  	s.instrument(t, dst, instrumentWrite)
  1520  	store := s.newValue2I(ssa.OpZero, types.TypeMem, t.Size(), dst, s.mem())
  1521  	store.Aux = t
  1522  	s.vars[memVar] = store
  1523  }
  1524  
  1525  func (s *state) move(t *types.Type, dst, src *ssa.Value) {
  1526  	s.moveWhichMayOverlap(t, dst, src, false)
  1527  }
  1528  func (s *state) moveWhichMayOverlap(t *types.Type, dst, src *ssa.Value, mayOverlap bool) {
  1529  	s.instrumentMove(t, dst, src)
  1530  	if mayOverlap && t.IsArray() && t.NumElem() > 1 && !ssa.IsInlinableMemmove(dst, src, t.Size(), s.f.Config) {
  1531  		// Normally, when moving Go values of type T from one location to another,
  1532  		// we don't need to worry about partial overlaps. The two Ts must either be
  1533  		// in disjoint (nonoverlapping) memory or in exactly the same location.
  1534  		// There are 2 cases where this isn't true:
  1535  		//  1) Using unsafe you can arrange partial overlaps.
  1536  		//  2) Since Go 1.17, you can use a cast from a slice to a ptr-to-array.
  1537  		//     https://go.dev/ref/spec#Conversions_from_slice_to_array_pointer
  1538  		//     This feature can be used to construct partial overlaps of array types.
  1539  		//       var a [3]int
  1540  		//       p := (*[2]int)(a[:])
  1541  		//       q := (*[2]int)(a[1:])
  1542  		//       *p = *q
  1543  		// We don't care about solving 1. Or at least, we haven't historically
  1544  		// and no one has complained.
  1545  		// For 2, we need to ensure that if there might be partial overlap,
  1546  		// then we can't use OpMove; we must use memmove instead.
  1547  		// (memmove handles partial overlap by copying in the correct
  1548  		// direction. OpMove does not.)
  1549  		//
  1550  		// Note that we have to be careful here not to introduce a call when
  1551  		// we're marshaling arguments to a call or unmarshaling results from a call.
  1552  		// Cases where this is happening must pass mayOverlap to false.
  1553  		// (Currently this only happens when unmarshaling results of a call.)
  1554  		if t.HasPointers() {
  1555  			s.rtcall(ir.Syms.Typedmemmove, true, nil, s.reflectType(t), dst, src)
  1556  			// We would have otherwise implemented this move with straightline code,
  1557  			// including a write barrier. Pretend we issue a write barrier here,
  1558  			// so that the write barrier tests work. (Otherwise they'd need to know
  1559  			// the details of IsInlineableMemmove.)
  1560  			s.curfn.SetWBPos(s.peekPos())
  1561  		} else {
  1562  			s.rtcall(ir.Syms.Memmove, true, nil, dst, src, s.constInt(types.Types[types.TUINTPTR], t.Size()))
  1563  		}
  1564  		ssa.LogLargeCopy(s.f.Name, s.peekPos(), t.Size())
  1565  		return
  1566  	}
  1567  	store := s.newValue3I(ssa.OpMove, types.TypeMem, t.Size(), dst, src, s.mem())
  1568  	store.Aux = t
  1569  	s.vars[memVar] = store
  1570  }
  1571  
  1572  // stmtList converts the statement list n to SSA and adds it to s.
  1573  func (s *state) stmtList(l ir.Nodes) {
  1574  	for _, n := range l {
  1575  		s.stmt(n)
  1576  	}
  1577  }
  1578  
  1579  // stmt converts the statement n to SSA and adds it to s.
  1580  func (s *state) stmt(n ir.Node) {
  1581  	s.pushLine(n.Pos())
  1582  	defer s.popLine()
  1583  
  1584  	// If s.curBlock is nil, and n isn't a label (which might have an associated goto somewhere),
  1585  	// then this code is dead. Stop here.
  1586  	if s.curBlock == nil && n.Op() != ir.OLABEL {
  1587  		return
  1588  	}
  1589  
  1590  	s.stmtList(n.Init())
  1591  	switch n.Op() {
  1592  
  1593  	case ir.OBLOCK:
  1594  		n := n.(*ir.BlockStmt)
  1595  		s.stmtList(n.List)
  1596  
  1597  	case ir.OFALL: // no-op
  1598  
  1599  	// Expression statements
  1600  	case ir.OCALLFUNC:
  1601  		n := n.(*ir.CallExpr)
  1602  		if ir.IsIntrinsicCall(n) {
  1603  			s.intrinsicCall(n)
  1604  			return
  1605  		}
  1606  		fallthrough
  1607  
  1608  	case ir.OCALLINTER:
  1609  		n := n.(*ir.CallExpr)
  1610  		s.callResult(n, callNormal)
  1611  		if n.Op() == ir.OCALLFUNC && n.Fun.Op() == ir.ONAME && n.Fun.(*ir.Name).Class == ir.PFUNC {
  1612  			if fn := n.Fun.Sym().Name; base.Flag.CompilingRuntime && fn == "throw" ||
  1613  				n.Fun.Sym().Pkg == ir.Pkgs.Runtime &&
  1614  					(fn == "throwinit" || fn == "gopanic" || fn == "panicwrap" || fn == "block" ||
  1615  						fn == "panicmakeslicelen" || fn == "panicmakeslicecap" || fn == "panicunsafeslicelen" ||
  1616  						fn == "panicunsafeslicenilptr" || fn == "panicunsafestringlen" || fn == "panicunsafestringnilptr" ||
  1617  						fn == "panicrangestate") {
  1618  				m := s.mem()
  1619  				b := s.endBlock()
  1620  				b.Kind = ssa.BlockExit
  1621  				b.SetControl(m)
  1622  				// TODO: never rewrite OPANIC to OCALLFUNC in the
  1623  				// first place. Need to wait until all backends
  1624  				// go through SSA.
  1625  			}
  1626  		}
  1627  	case ir.ODEFER:
  1628  		n := n.(*ir.GoDeferStmt)
  1629  		if base.Debug.Defer > 0 {
  1630  			var defertype string
  1631  			if s.hasOpenDefers {
  1632  				defertype = "open-coded"
  1633  			} else if n.Esc() == ir.EscNever {
  1634  				defertype = "stack-allocated"
  1635  			} else {
  1636  				defertype = "heap-allocated"
  1637  			}
  1638  			base.WarnfAt(n.Pos(), "%s defer", defertype)
  1639  		}
  1640  		if s.hasOpenDefers {
  1641  			s.openDeferRecord(n.Call.(*ir.CallExpr))
  1642  		} else {
  1643  			d := callDefer
  1644  			if n.Esc() == ir.EscNever && n.DeferAt == nil {
  1645  				d = callDeferStack
  1646  			}
  1647  			s.call(n.Call.(*ir.CallExpr), d, false, n.DeferAt)
  1648  		}
  1649  	case ir.OGO:
  1650  		n := n.(*ir.GoDeferStmt)
  1651  		s.callResult(n.Call.(*ir.CallExpr), callGo)
  1652  
  1653  	case ir.OAS2DOTTYPE:
  1654  		n := n.(*ir.AssignListStmt)
  1655  		var res, resok *ssa.Value
  1656  		if n.Rhs[0].Op() == ir.ODOTTYPE2 {
  1657  			res, resok = s.dottype(n.Rhs[0].(*ir.TypeAssertExpr), true)
  1658  		} else {
  1659  			res, resok = s.dynamicDottype(n.Rhs[0].(*ir.DynamicTypeAssertExpr), true)
  1660  		}
  1661  		deref := false
  1662  		if !ssa.CanSSA(n.Rhs[0].Type()) {
  1663  			if res.Op != ssa.OpLoad {
  1664  				s.Fatalf("dottype of non-load")
  1665  			}
  1666  			mem := s.mem()
  1667  			if res.Args[1] != mem {
  1668  				s.Fatalf("memory no longer live from 2-result dottype load")
  1669  			}
  1670  			deref = true
  1671  			res = res.Args[0]
  1672  		}
  1673  		s.assign(n.Lhs[0], res, deref, 0)
  1674  		s.assign(n.Lhs[1], resok, false, 0)
  1675  		return
  1676  
  1677  	case ir.OAS2FUNC:
  1678  		// We come here only when it is an intrinsic call returning two values.
  1679  		n := n.(*ir.AssignListStmt)
  1680  		call := n.Rhs[0].(*ir.CallExpr)
  1681  		if !ir.IsIntrinsicCall(call) {
  1682  			s.Fatalf("non-intrinsic AS2FUNC not expanded %v", call)
  1683  		}
  1684  		v := s.intrinsicCall(call)
  1685  		v1 := s.newValue1(ssa.OpSelect0, n.Lhs[0].Type(), v)
  1686  		v2 := s.newValue1(ssa.OpSelect1, n.Lhs[1].Type(), v)
  1687  		s.assign(n.Lhs[0], v1, false, 0)
  1688  		s.assign(n.Lhs[1], v2, false, 0)
  1689  		return
  1690  
  1691  	case ir.ODCL:
  1692  		n := n.(*ir.Decl)
  1693  		if v := n.X; v.Esc() == ir.EscHeap {
  1694  			s.newHeapaddr(v)
  1695  		}
  1696  
  1697  	case ir.OLABEL:
  1698  		n := n.(*ir.LabelStmt)
  1699  		sym := n.Label
  1700  		if sym.IsBlank() {
  1701  			// Nothing to do because the label isn't targetable. See issue 52278.
  1702  			break
  1703  		}
  1704  		lab := s.label(sym)
  1705  
  1706  		// The label might already have a target block via a goto.
  1707  		if lab.target == nil {
  1708  			lab.target = s.f.NewBlock(ssa.BlockPlain)
  1709  		}
  1710  
  1711  		// Go to that label.
  1712  		// (We pretend "label:" is preceded by "goto label", unless the predecessor is unreachable.)
  1713  		if s.curBlock != nil {
  1714  			b := s.endBlock()
  1715  			b.AddEdgeTo(lab.target)
  1716  		}
  1717  		s.startBlock(lab.target)
  1718  
  1719  	case ir.OGOTO:
  1720  		n := n.(*ir.BranchStmt)
  1721  		sym := n.Label
  1722  
  1723  		lab := s.label(sym)
  1724  		if lab.target == nil {
  1725  			lab.target = s.f.NewBlock(ssa.BlockPlain)
  1726  		}
  1727  
  1728  		b := s.endBlock()
  1729  		b.Pos = s.lastPos.WithIsStmt() // Do this even if b is an empty block.
  1730  		b.AddEdgeTo(lab.target)
  1731  
  1732  	case ir.OAS:
  1733  		n := n.(*ir.AssignStmt)
  1734  		if n.X == n.Y && n.X.Op() == ir.ONAME {
  1735  			// An x=x assignment. No point in doing anything
  1736  			// here. In addition, skipping this assignment
  1737  			// prevents generating:
  1738  			//   VARDEF x
  1739  			//   COPY x -> x
  1740  			// which is bad because x is incorrectly considered
  1741  			// dead before the vardef. See issue #14904.
  1742  			return
  1743  		}
  1744  
  1745  		// mayOverlap keeps track of whether the LHS and RHS might
  1746  		// refer to partially overlapping memory. Partial overlapping can
  1747  		// only happen for arrays, see the comment in moveWhichMayOverlap.
  1748  		//
  1749  		// If both sides of the assignment are not dereferences, then partial
  1750  		// overlap can't happen. Partial overlap can only occur only when the
  1751  		// arrays referenced are strictly smaller parts of the same base array.
  1752  		// If one side of the assignment is a full array, then partial overlap
  1753  		// can't happen. (The arrays are either disjoint or identical.)
  1754  		mayOverlap := n.X.Op() == ir.ODEREF && (n.Y != nil && n.Y.Op() == ir.ODEREF)
  1755  		if n.Y != nil && n.Y.Op() == ir.ODEREF {
  1756  			p := n.Y.(*ir.StarExpr).X
  1757  			for p.Op() == ir.OCONVNOP {
  1758  				p = p.(*ir.ConvExpr).X
  1759  			}
  1760  			if p.Op() == ir.OSPTR && p.(*ir.UnaryExpr).X.Type().IsString() {
  1761  				// Pointer fields of strings point to unmodifiable memory.
  1762  				// That memory can't overlap with the memory being written.
  1763  				mayOverlap = false
  1764  			}
  1765  		}
  1766  
  1767  		// Evaluate RHS.
  1768  		rhs := n.Y
  1769  		if rhs != nil {
  1770  			switch rhs.Op() {
  1771  			case ir.OSTRUCTLIT, ir.OARRAYLIT, ir.OSLICELIT:
  1772  				// All literals with nonzero fields have already been
  1773  				// rewritten during walk. Any that remain are just T{}
  1774  				// or equivalents. Use the zero value.
  1775  				if !ir.IsZero(rhs) {
  1776  					s.Fatalf("literal with nonzero value in SSA: %v", rhs)
  1777  				}
  1778  				rhs = nil
  1779  			case ir.OAPPEND:
  1780  				rhs := rhs.(*ir.CallExpr)
  1781  				// Check whether we're writing the result of an append back to the same slice.
  1782  				// If so, we handle it specially to avoid write barriers on the fast
  1783  				// (non-growth) path.
  1784  				if !ir.SameSafeExpr(n.X, rhs.Args[0]) || base.Flag.N != 0 {
  1785  					break
  1786  				}
  1787  				// If the slice can be SSA'd, it'll be on the stack,
  1788  				// so there will be no write barriers,
  1789  				// so there's no need to attempt to prevent them.
  1790  				if s.canSSA(n.X) {
  1791  					if base.Debug.Append > 0 { // replicating old diagnostic message
  1792  						base.WarnfAt(n.Pos(), "append: len-only update (in local slice)")
  1793  					}
  1794  					break
  1795  				}
  1796  				if base.Debug.Append > 0 {
  1797  					base.WarnfAt(n.Pos(), "append: len-only update")
  1798  				}
  1799  				s.append(rhs, true)
  1800  				return
  1801  			}
  1802  		}
  1803  
  1804  		if ir.IsBlank(n.X) {
  1805  			// _ = rhs
  1806  			// Just evaluate rhs for side-effects.
  1807  			if rhs != nil {
  1808  				s.expr(rhs)
  1809  			}
  1810  			return
  1811  		}
  1812  
  1813  		var t *types.Type
  1814  		if n.Y != nil {
  1815  			t = n.Y.Type()
  1816  		} else {
  1817  			t = n.X.Type()
  1818  		}
  1819  
  1820  		var r *ssa.Value
  1821  		deref := !ssa.CanSSA(t)
  1822  		if deref {
  1823  			if rhs == nil {
  1824  				r = nil // Signal assign to use OpZero.
  1825  			} else {
  1826  				r = s.addr(rhs)
  1827  			}
  1828  		} else {
  1829  			if rhs == nil {
  1830  				r = s.zeroVal(t)
  1831  			} else {
  1832  				r = s.expr(rhs)
  1833  			}
  1834  		}
  1835  
  1836  		var skip skipMask
  1837  		if rhs != nil && (rhs.Op() == ir.OSLICE || rhs.Op() == ir.OSLICE3 || rhs.Op() == ir.OSLICESTR) && ir.SameSafeExpr(rhs.(*ir.SliceExpr).X, n.X) {
  1838  			// We're assigning a slicing operation back to its source.
  1839  			// Don't write back fields we aren't changing. See issue #14855.
  1840  			rhs := rhs.(*ir.SliceExpr)
  1841  			i, j, k := rhs.Low, rhs.High, rhs.Max
  1842  			if i != nil && (i.Op() == ir.OLITERAL && i.Val().Kind() == constant.Int && ir.Int64Val(i) == 0) {
  1843  				// [0:...] is the same as [:...]
  1844  				i = nil
  1845  			}
  1846  			// TODO: detect defaults for len/cap also.
  1847  			// Currently doesn't really work because (*p)[:len(*p)] appears here as:
  1848  			//    tmp = len(*p)
  1849  			//    (*p)[:tmp]
  1850  			// if j != nil && (j.Op == OLEN && SameSafeExpr(j.Left, n.Left)) {
  1851  			//      j = nil
  1852  			// }
  1853  			// if k != nil && (k.Op == OCAP && SameSafeExpr(k.Left, n.Left)) {
  1854  			//      k = nil
  1855  			// }
  1856  			if i == nil {
  1857  				skip |= skipPtr
  1858  				if j == nil {
  1859  					skip |= skipLen
  1860  				}
  1861  				if k == nil {
  1862  					skip |= skipCap
  1863  				}
  1864  			}
  1865  		}
  1866  
  1867  		s.assignWhichMayOverlap(n.X, r, deref, skip, mayOverlap)
  1868  
  1869  	case ir.OIF:
  1870  		n := n.(*ir.IfStmt)
  1871  		if ir.IsConst(n.Cond, constant.Bool) {
  1872  			s.stmtList(n.Cond.Init())
  1873  			if ir.BoolVal(n.Cond) {
  1874  				s.stmtList(n.Body)
  1875  			} else {
  1876  				s.stmtList(n.Else)
  1877  			}
  1878  			break
  1879  		}
  1880  
  1881  		bEnd := s.f.NewBlock(ssa.BlockPlain)
  1882  		var likely int8
  1883  		if n.Likely {
  1884  			likely = 1
  1885  		}
  1886  		var bThen *ssa.Block
  1887  		if len(n.Body) != 0 {
  1888  			bThen = s.f.NewBlock(ssa.BlockPlain)
  1889  		} else {
  1890  			bThen = bEnd
  1891  		}
  1892  		var bElse *ssa.Block
  1893  		if len(n.Else) != 0 {
  1894  			bElse = s.f.NewBlock(ssa.BlockPlain)
  1895  		} else {
  1896  			bElse = bEnd
  1897  		}
  1898  		s.condBranch(n.Cond, bThen, bElse, likely)
  1899  
  1900  		if len(n.Body) != 0 {
  1901  			s.startBlock(bThen)
  1902  			s.stmtList(n.Body)
  1903  			if b := s.endBlock(); b != nil {
  1904  				b.AddEdgeTo(bEnd)
  1905  			}
  1906  		}
  1907  		if len(n.Else) != 0 {
  1908  			s.startBlock(bElse)
  1909  			s.stmtList(n.Else)
  1910  			if b := s.endBlock(); b != nil {
  1911  				b.AddEdgeTo(bEnd)
  1912  			}
  1913  		}
  1914  		s.startBlock(bEnd)
  1915  
  1916  	case ir.ORETURN:
  1917  		n := n.(*ir.ReturnStmt)
  1918  		s.stmtList(n.Results)
  1919  		b := s.exit()
  1920  		b.Pos = s.lastPos.WithIsStmt()
  1921  
  1922  	case ir.OTAILCALL:
  1923  		n := n.(*ir.TailCallStmt)
  1924  		s.callResult(n.Call, callTail)
  1925  		call := s.mem()
  1926  		b := s.endBlock()
  1927  		b.Kind = ssa.BlockRetJmp // could use BlockExit. BlockRetJmp is mostly for clarity.
  1928  		b.SetControl(call)
  1929  
  1930  	case ir.OCONTINUE, ir.OBREAK:
  1931  		n := n.(*ir.BranchStmt)
  1932  		var to *ssa.Block
  1933  		if n.Label == nil {
  1934  			// plain break/continue
  1935  			switch n.Op() {
  1936  			case ir.OCONTINUE:
  1937  				to = s.continueTo
  1938  			case ir.OBREAK:
  1939  				to = s.breakTo
  1940  			}
  1941  		} else {
  1942  			// labeled break/continue; look up the target
  1943  			sym := n.Label
  1944  			lab := s.label(sym)
  1945  			switch n.Op() {
  1946  			case ir.OCONTINUE:
  1947  				to = lab.continueTarget
  1948  			case ir.OBREAK:
  1949  				to = lab.breakTarget
  1950  			}
  1951  		}
  1952  
  1953  		b := s.endBlock()
  1954  		b.Pos = s.lastPos.WithIsStmt() // Do this even if b is an empty block.
  1955  		b.AddEdgeTo(to)
  1956  
  1957  	case ir.OFOR:
  1958  		// OFOR: for Ninit; Left; Right { Nbody }
  1959  		// cond (Left); body (Nbody); incr (Right)
  1960  		n := n.(*ir.ForStmt)
  1961  		base.Assert(!n.DistinctVars) // Should all be rewritten before escape analysis
  1962  		bCond := s.f.NewBlock(ssa.BlockPlain)
  1963  		bBody := s.f.NewBlock(ssa.BlockPlain)
  1964  		bIncr := s.f.NewBlock(ssa.BlockPlain)
  1965  		bEnd := s.f.NewBlock(ssa.BlockPlain)
  1966  
  1967  		// ensure empty for loops have correct position; issue #30167
  1968  		bBody.Pos = n.Pos()
  1969  
  1970  		// first, jump to condition test
  1971  		b := s.endBlock()
  1972  		b.AddEdgeTo(bCond)
  1973  
  1974  		// generate code to test condition
  1975  		s.startBlock(bCond)
  1976  		if n.Cond != nil {
  1977  			s.condBranch(n.Cond, bBody, bEnd, 1)
  1978  		} else {
  1979  			b := s.endBlock()
  1980  			b.Kind = ssa.BlockPlain
  1981  			b.AddEdgeTo(bBody)
  1982  		}
  1983  
  1984  		// set up for continue/break in body
  1985  		prevContinue := s.continueTo
  1986  		prevBreak := s.breakTo
  1987  		s.continueTo = bIncr
  1988  		s.breakTo = bEnd
  1989  		var lab *ssaLabel
  1990  		if sym := n.Label; sym != nil {
  1991  			// labeled for loop
  1992  			lab = s.label(sym)
  1993  			lab.continueTarget = bIncr
  1994  			lab.breakTarget = bEnd
  1995  		}
  1996  
  1997  		// generate body
  1998  		s.startBlock(bBody)
  1999  		s.stmtList(n.Body)
  2000  
  2001  		// tear down continue/break
  2002  		s.continueTo = prevContinue
  2003  		s.breakTo = prevBreak
  2004  		if lab != nil {
  2005  			lab.continueTarget = nil
  2006  			lab.breakTarget = nil
  2007  		}
  2008  
  2009  		// done with body, goto incr
  2010  		if b := s.endBlock(); b != nil {
  2011  			b.AddEdgeTo(bIncr)
  2012  		}
  2013  
  2014  		// generate incr
  2015  		s.startBlock(bIncr)
  2016  		if n.Post != nil {
  2017  			s.stmt(n.Post)
  2018  		}
  2019  		if b := s.endBlock(); b != nil {
  2020  			b.AddEdgeTo(bCond)
  2021  			// It can happen that bIncr ends in a block containing only VARKILL,
  2022  			// and that muddles the debugging experience.
  2023  			if b.Pos == src.NoXPos {
  2024  				b.Pos = bCond.Pos
  2025  			}
  2026  		}
  2027  
  2028  		s.startBlock(bEnd)
  2029  
  2030  	case ir.OSWITCH, ir.OSELECT:
  2031  		// These have been mostly rewritten by the front end into their Nbody fields.
  2032  		// Our main task is to correctly hook up any break statements.
  2033  		bEnd := s.f.NewBlock(ssa.BlockPlain)
  2034  
  2035  		prevBreak := s.breakTo
  2036  		s.breakTo = bEnd
  2037  		var sym *types.Sym
  2038  		var body ir.Nodes
  2039  		if n.Op() == ir.OSWITCH {
  2040  			n := n.(*ir.SwitchStmt)
  2041  			sym = n.Label
  2042  			body = n.Compiled
  2043  		} else {
  2044  			n := n.(*ir.SelectStmt)
  2045  			sym = n.Label
  2046  			body = n.Compiled
  2047  		}
  2048  
  2049  		var lab *ssaLabel
  2050  		if sym != nil {
  2051  			// labeled
  2052  			lab = s.label(sym)
  2053  			lab.breakTarget = bEnd
  2054  		}
  2055  
  2056  		// generate body code
  2057  		s.stmtList(body)
  2058  
  2059  		s.breakTo = prevBreak
  2060  		if lab != nil {
  2061  			lab.breakTarget = nil
  2062  		}
  2063  
  2064  		// walk adds explicit OBREAK nodes to the end of all reachable code paths.
  2065  		// If we still have a current block here, then mark it unreachable.
  2066  		if s.curBlock != nil {
  2067  			m := s.mem()
  2068  			b := s.endBlock()
  2069  			b.Kind = ssa.BlockExit
  2070  			b.SetControl(m)
  2071  		}
  2072  		s.startBlock(bEnd)
  2073  
  2074  	case ir.OJUMPTABLE:
  2075  		n := n.(*ir.JumpTableStmt)
  2076  
  2077  		// Make blocks we'll need.
  2078  		jt := s.f.NewBlock(ssa.BlockJumpTable)
  2079  		bEnd := s.f.NewBlock(ssa.BlockPlain)
  2080  
  2081  		// The only thing that needs evaluating is the index we're looking up.
  2082  		idx := s.expr(n.Idx)
  2083  		unsigned := idx.Type.IsUnsigned()
  2084  
  2085  		// Extend so we can do everything in uintptr arithmetic.
  2086  		t := types.Types[types.TUINTPTR]
  2087  		idx = s.conv(nil, idx, idx.Type, t)
  2088  
  2089  		// The ending condition for the current block decides whether we'll use
  2090  		// the jump table at all.
  2091  		// We check that min <= idx <= max and jump around the jump table
  2092  		// if that test fails.
  2093  		// We implement min <= idx <= max with 0 <= idx-min <= max-min, because
  2094  		// we'll need idx-min anyway as the control value for the jump table.
  2095  		var min, max uint64
  2096  		if unsigned {
  2097  			min, _ = constant.Uint64Val(n.Cases[0])
  2098  			max, _ = constant.Uint64Val(n.Cases[len(n.Cases)-1])
  2099  		} else {
  2100  			mn, _ := constant.Int64Val(n.Cases[0])
  2101  			mx, _ := constant.Int64Val(n.Cases[len(n.Cases)-1])
  2102  			min = uint64(mn)
  2103  			max = uint64(mx)
  2104  		}
  2105  		// Compare idx-min with max-min, to see if we can use the jump table.
  2106  		idx = s.newValue2(s.ssaOp(ir.OSUB, t), t, idx, s.uintptrConstant(min))
  2107  		width := s.uintptrConstant(max - min)
  2108  		cmp := s.newValue2(s.ssaOp(ir.OLE, t), types.Types[types.TBOOL], idx, width)
  2109  		b := s.endBlock()
  2110  		b.Kind = ssa.BlockIf
  2111  		b.SetControl(cmp)
  2112  		b.AddEdgeTo(jt)             // in range - use jump table
  2113  		b.AddEdgeTo(bEnd)           // out of range - no case in the jump table will trigger
  2114  		b.Likely = ssa.BranchLikely // TODO: assumes missing the table entirely is unlikely. True?
  2115  
  2116  		// Build jump table block.
  2117  		s.startBlock(jt)
  2118  		jt.Pos = n.Pos()
  2119  		if base.Flag.Cfg.SpectreIndex {
  2120  			idx = s.newValue2(ssa.OpSpectreSliceIndex, t, idx, width)
  2121  		}
  2122  		jt.SetControl(idx)
  2123  
  2124  		// Figure out where we should go for each index in the table.
  2125  		table := make([]*ssa.Block, max-min+1)
  2126  		for i := range table {
  2127  			table[i] = bEnd // default target
  2128  		}
  2129  		for i := range n.Targets {
  2130  			c := n.Cases[i]
  2131  			lab := s.label(n.Targets[i])
  2132  			if lab.target == nil {
  2133  				lab.target = s.f.NewBlock(ssa.BlockPlain)
  2134  			}
  2135  			var val uint64
  2136  			if unsigned {
  2137  				val, _ = constant.Uint64Val(c)
  2138  			} else {
  2139  				vl, _ := constant.Int64Val(c)
  2140  				val = uint64(vl)
  2141  			}
  2142  			// Overwrite the default target.
  2143  			table[val-min] = lab.target
  2144  		}
  2145  		for _, t := range table {
  2146  			jt.AddEdgeTo(t)
  2147  		}
  2148  		s.endBlock()
  2149  
  2150  		s.startBlock(bEnd)
  2151  
  2152  	case ir.OINTERFACESWITCH:
  2153  		n := n.(*ir.InterfaceSwitchStmt)
  2154  		typs := s.f.Config.Types
  2155  
  2156  		t := s.expr(n.RuntimeType)
  2157  		h := s.expr(n.Hash)
  2158  		d := s.newValue1A(ssa.OpAddr, typs.BytePtr, n.Descriptor, s.sb)
  2159  
  2160  		// Check the cache first.
  2161  		var merge *ssa.Block
  2162  		if base.Flag.N == 0 && rtabi.UseInterfaceSwitchCache(Arch.LinkArch.Family) {
  2163  			// Note: we can only use the cache if we have the right atomic load instruction.
  2164  			// Double-check that here.
  2165  			if intrinsics.lookup(Arch.LinkArch.Arch, "internal/runtime/atomic", "Loadp") == nil {
  2166  				s.Fatalf("atomic load not available")
  2167  			}
  2168  			merge = s.f.NewBlock(ssa.BlockPlain)
  2169  			cacheHit := s.f.NewBlock(ssa.BlockPlain)
  2170  			cacheMiss := s.f.NewBlock(ssa.BlockPlain)
  2171  			loopHead := s.f.NewBlock(ssa.BlockPlain)
  2172  			loopBody := s.f.NewBlock(ssa.BlockPlain)
  2173  
  2174  			// Pick right size ops.
  2175  			var mul, and, add, zext ssa.Op
  2176  			if s.config.PtrSize == 4 {
  2177  				mul = ssa.OpMul32
  2178  				and = ssa.OpAnd32
  2179  				add = ssa.OpAdd32
  2180  				zext = ssa.OpCopy
  2181  			} else {
  2182  				mul = ssa.OpMul64
  2183  				and = ssa.OpAnd64
  2184  				add = ssa.OpAdd64
  2185  				zext = ssa.OpZeroExt32to64
  2186  			}
  2187  
  2188  			// Load cache pointer out of descriptor, with an atomic load so
  2189  			// we ensure that we see a fully written cache.
  2190  			atomicLoad := s.newValue2(ssa.OpAtomicLoadPtr, types.NewTuple(typs.BytePtr, types.TypeMem), d, s.mem())
  2191  			cache := s.newValue1(ssa.OpSelect0, typs.BytePtr, atomicLoad)
  2192  			s.vars[memVar] = s.newValue1(ssa.OpSelect1, types.TypeMem, atomicLoad)
  2193  
  2194  			// Initialize hash variable.
  2195  			s.vars[hashVar] = s.newValue1(zext, typs.Uintptr, h)
  2196  
  2197  			// Load mask from cache.
  2198  			mask := s.newValue2(ssa.OpLoad, typs.Uintptr, cache, s.mem())
  2199  			// Jump to loop head.
  2200  			b := s.endBlock()
  2201  			b.AddEdgeTo(loopHead)
  2202  
  2203  			// At loop head, get pointer to the cache entry.
  2204  			//   e := &cache.Entries[hash&mask]
  2205  			s.startBlock(loopHead)
  2206  			entries := s.newValue2(ssa.OpAddPtr, typs.UintptrPtr, cache, s.uintptrConstant(uint64(s.config.PtrSize)))
  2207  			idx := s.newValue2(and, typs.Uintptr, s.variable(hashVar, typs.Uintptr), mask)
  2208  			idx = s.newValue2(mul, typs.Uintptr, idx, s.uintptrConstant(uint64(3*s.config.PtrSize)))
  2209  			e := s.newValue2(ssa.OpAddPtr, typs.UintptrPtr, entries, idx)
  2210  			//   hash++
  2211  			s.vars[hashVar] = s.newValue2(add, typs.Uintptr, s.variable(hashVar, typs.Uintptr), s.uintptrConstant(1))
  2212  
  2213  			// Look for a cache hit.
  2214  			//   if e.Typ == t { goto hit }
  2215  			eTyp := s.newValue2(ssa.OpLoad, typs.Uintptr, e, s.mem())
  2216  			cmp1 := s.newValue2(ssa.OpEqPtr, typs.Bool, t, eTyp)
  2217  			b = s.endBlock()
  2218  			b.Kind = ssa.BlockIf
  2219  			b.SetControl(cmp1)
  2220  			b.AddEdgeTo(cacheHit)
  2221  			b.AddEdgeTo(loopBody)
  2222  
  2223  			// Look for an empty entry, the tombstone for this hash table.
  2224  			//   if e.Typ == nil { goto miss }
  2225  			s.startBlock(loopBody)
  2226  			cmp2 := s.newValue2(ssa.OpEqPtr, typs.Bool, eTyp, s.constNil(typs.BytePtr))
  2227  			b = s.endBlock()
  2228  			b.Kind = ssa.BlockIf
  2229  			b.SetControl(cmp2)
  2230  			b.AddEdgeTo(cacheMiss)
  2231  			b.AddEdgeTo(loopHead)
  2232  
  2233  			// On a hit, load the data fields of the cache entry.
  2234  			//   Case = e.Case
  2235  			//   Itab = e.Itab
  2236  			s.startBlock(cacheHit)
  2237  			eCase := s.newValue2(ssa.OpLoad, typs.Int, s.newValue1I(ssa.OpOffPtr, typs.IntPtr, s.config.PtrSize, e), s.mem())
  2238  			eItab := s.newValue2(ssa.OpLoad, typs.BytePtr, s.newValue1I(ssa.OpOffPtr, typs.BytePtrPtr, 2*s.config.PtrSize, e), s.mem())
  2239  			s.assign(n.Case, eCase, false, 0)
  2240  			s.assign(n.Itab, eItab, false, 0)
  2241  			b = s.endBlock()
  2242  			b.AddEdgeTo(merge)
  2243  
  2244  			// On a miss, call into the runtime to get the answer.
  2245  			s.startBlock(cacheMiss)
  2246  		}
  2247  
  2248  		r := s.rtcall(ir.Syms.InterfaceSwitch, true, []*types.Type{typs.Int, typs.BytePtr}, d, t)
  2249  		s.assign(n.Case, r[0], false, 0)
  2250  		s.assign(n.Itab, r[1], false, 0)
  2251  
  2252  		if merge != nil {
  2253  			// Cache hits merge in here.
  2254  			b := s.endBlock()
  2255  			b.Kind = ssa.BlockPlain
  2256  			b.AddEdgeTo(merge)
  2257  			s.startBlock(merge)
  2258  		}
  2259  
  2260  	case ir.OCHECKNIL:
  2261  		n := n.(*ir.UnaryExpr)
  2262  		p := s.expr(n.X)
  2263  		_ = s.nilCheck(p)
  2264  		// TODO: check that throwing away the nilcheck result is ok.
  2265  
  2266  	case ir.OINLMARK:
  2267  		n := n.(*ir.InlineMarkStmt)
  2268  		s.newValue1I(ssa.OpInlMark, types.TypeVoid, n.Index, s.mem())
  2269  
  2270  	default:
  2271  		s.Fatalf("unhandled stmt %v", n.Op())
  2272  	}
  2273  }
  2274  
  2275  // If true, share as many open-coded defer exits as possible (with the downside of
  2276  // worse line-number information)
  2277  const shareDeferExits = false
  2278  
  2279  // exit processes any code that needs to be generated just before returning.
  2280  // It returns a BlockRet block that ends the control flow. Its control value
  2281  // will be set to the final memory state.
  2282  func (s *state) exit() *ssa.Block {
  2283  	if s.hasdefer {
  2284  		if s.hasOpenDefers {
  2285  			if shareDeferExits && s.lastDeferExit != nil && len(s.openDefers) == s.lastDeferCount {
  2286  				if s.curBlock.Kind != ssa.BlockPlain {
  2287  					panic("Block for an exit should be BlockPlain")
  2288  				}
  2289  				s.curBlock.AddEdgeTo(s.lastDeferExit)
  2290  				s.endBlock()
  2291  				return s.lastDeferFinalBlock
  2292  			}
  2293  			s.openDeferExit()
  2294  		} else {
  2295  			// Shared deferreturn is assigned the "last" position in the function.
  2296  			// The linker picks the first deferreturn call it sees, so this is
  2297  			// the only sensible "shared" place.
  2298  			// To not-share deferreturn, the protocol would need to be changed
  2299  			// so that the call to deferproc-etc would receive the PC offset from
  2300  			// the return PC, and the runtime would need to use that instead of
  2301  			// the deferreturn retrieved from the pcln information.
  2302  			// opendefers would remain a problem, however.
  2303  			s.pushLine(s.curfn.Endlineno)
  2304  			s.rtcall(ir.Syms.Deferreturn, true, nil)
  2305  			s.popLine()
  2306  		}
  2307  	}
  2308  
  2309  	// Do actual return.
  2310  	// These currently turn into self-copies (in many cases).
  2311  	resultFields := s.curfn.Type().Results()
  2312  	results := make([]*ssa.Value, len(resultFields)+1, len(resultFields)+1)
  2313  	// Store SSAable and heap-escaped PPARAMOUT variables back to stack locations.
  2314  	for i, f := range resultFields {
  2315  		n := f.Nname.(*ir.Name)
  2316  		if s.canSSA(n) { // result is in some SSA variable
  2317  			if !n.IsOutputParamInRegisters() && n.Type().HasPointers() {
  2318  				// We are about to store to the result slot.
  2319  				s.vars[memVar] = s.newValue1A(ssa.OpVarDef, types.TypeMem, n, s.mem())
  2320  			}
  2321  			results[i] = s.variable(n, n.Type())
  2322  		} else if !n.OnStack() { // result is actually heap allocated
  2323  			// We are about to copy the in-heap result to the result slot.
  2324  			if n.Type().HasPointers() {
  2325  				s.vars[memVar] = s.newValue1A(ssa.OpVarDef, types.TypeMem, n, s.mem())
  2326  			}
  2327  			ha := s.expr(n.Heapaddr)
  2328  			s.instrumentFields(n.Type(), ha, instrumentRead)
  2329  			results[i] = s.newValue2(ssa.OpDereference, n.Type(), ha, s.mem())
  2330  		} else { // result is not SSA-able; not escaped, so not on heap, but too large for SSA.
  2331  			// Before register ABI this ought to be a self-move, home=dest,
  2332  			// With register ABI, it's still a self-move if parameter is on stack (i.e., too big or overflowed)
  2333  			// No VarDef, as the result slot is already holding live value.
  2334  			results[i] = s.newValue2(ssa.OpDereference, n.Type(), s.addr(n), s.mem())
  2335  		}
  2336  	}
  2337  
  2338  	// In -race mode, we need to call racefuncexit.
  2339  	// Note: This has to happen after we load any heap-allocated results,
  2340  	// otherwise races will be attributed to the caller instead.
  2341  	if s.instrumentEnterExit {
  2342  		s.rtcall(ir.Syms.Racefuncexit, true, nil)
  2343  	}
  2344  
  2345  	results[len(results)-1] = s.mem()
  2346  	m := s.newValue0(ssa.OpMakeResult, s.f.OwnAux.LateExpansionResultType())
  2347  	m.AddArgs(results...)
  2348  
  2349  	b := s.endBlock()
  2350  	b.Kind = ssa.BlockRet
  2351  	b.SetControl(m)
  2352  	if s.hasdefer && s.hasOpenDefers {
  2353  		s.lastDeferFinalBlock = b
  2354  	}
  2355  	return b
  2356  }
  2357  
  2358  type opAndType struct {
  2359  	op    ir.Op
  2360  	etype types.Kind
  2361  }
  2362  
  2363  var opToSSA = map[opAndType]ssa.Op{
  2364  	{ir.OADD, types.TINT8}:    ssa.OpAdd8,
  2365  	{ir.OADD, types.TUINT8}:   ssa.OpAdd8,
  2366  	{ir.OADD, types.TINT16}:   ssa.OpAdd16,
  2367  	{ir.OADD, types.TUINT16}:  ssa.OpAdd16,
  2368  	{ir.OADD, types.TINT32}:   ssa.OpAdd32,
  2369  	{ir.OADD, types.TUINT32}:  ssa.OpAdd32,
  2370  	{ir.OADD, types.TINT64}:   ssa.OpAdd64,
  2371  	{ir.OADD, types.TUINT64}:  ssa.OpAdd64,
  2372  	{ir.OADD, types.TFLOAT32}: ssa.OpAdd32F,
  2373  	{ir.OADD, types.TFLOAT64}: ssa.OpAdd64F,
  2374  
  2375  	{ir.OSUB, types.TINT8}:    ssa.OpSub8,
  2376  	{ir.OSUB, types.TUINT8}:   ssa.OpSub8,
  2377  	{ir.OSUB, types.TINT16}:   ssa.OpSub16,
  2378  	{ir.OSUB, types.TUINT16}:  ssa.OpSub16,
  2379  	{ir.OSUB, types.TINT32}:   ssa.OpSub32,
  2380  	{ir.OSUB, types.TUINT32}:  ssa.OpSub32,
  2381  	{ir.OSUB, types.TINT64}:   ssa.OpSub64,
  2382  	{ir.OSUB, types.TUINT64}:  ssa.OpSub64,
  2383  	{ir.OSUB, types.TFLOAT32}: ssa.OpSub32F,
  2384  	{ir.OSUB, types.TFLOAT64}: ssa.OpSub64F,
  2385  
  2386  	{ir.ONOT, types.TBOOL}: ssa.OpNot,
  2387  
  2388  	{ir.ONEG, types.TINT8}:    ssa.OpNeg8,
  2389  	{ir.ONEG, types.TUINT8}:   ssa.OpNeg8,
  2390  	{ir.ONEG, types.TINT16}:   ssa.OpNeg16,
  2391  	{ir.ONEG, types.TUINT16}:  ssa.OpNeg16,
  2392  	{ir.ONEG, types.TINT32}:   ssa.OpNeg32,
  2393  	{ir.ONEG, types.TUINT32}:  ssa.OpNeg32,
  2394  	{ir.ONEG, types.TINT64}:   ssa.OpNeg64,
  2395  	{ir.ONEG, types.TUINT64}:  ssa.OpNeg64,
  2396  	{ir.ONEG, types.TFLOAT32}: ssa.OpNeg32F,
  2397  	{ir.ONEG, types.TFLOAT64}: ssa.OpNeg64F,
  2398  
  2399  	{ir.OBITNOT, types.TINT8}:   ssa.OpCom8,
  2400  	{ir.OBITNOT, types.TUINT8}:  ssa.OpCom8,
  2401  	{ir.OBITNOT, types.TINT16}:  ssa.OpCom16,
  2402  	{ir.OBITNOT, types.TUINT16}: ssa.OpCom16,
  2403  	{ir.OBITNOT, types.TINT32}:  ssa.OpCom32,
  2404  	{ir.OBITNOT, types.TUINT32}: ssa.OpCom32,
  2405  	{ir.OBITNOT, types.TINT64}:  ssa.OpCom64,
  2406  	{ir.OBITNOT, types.TUINT64}: ssa.OpCom64,
  2407  
  2408  	{ir.OIMAG, types.TCOMPLEX64}:  ssa.OpComplexImag,
  2409  	{ir.OIMAG, types.TCOMPLEX128}: ssa.OpComplexImag,
  2410  	{ir.OREAL, types.TCOMPLEX64}:  ssa.OpComplexReal,
  2411  	{ir.OREAL, types.TCOMPLEX128}: ssa.OpComplexReal,
  2412  
  2413  	{ir.OMUL, types.TINT8}:    ssa.OpMul8,
  2414  	{ir.OMUL, types.TUINT8}:   ssa.OpMul8,
  2415  	{ir.OMUL, types.TINT16}:   ssa.OpMul16,
  2416  	{ir.OMUL, types.TUINT16}:  ssa.OpMul16,
  2417  	{ir.OMUL, types.TINT32}:   ssa.OpMul32,
  2418  	{ir.OMUL, types.TUINT32}:  ssa.OpMul32,
  2419  	{ir.OMUL, types.TINT64}:   ssa.OpMul64,
  2420  	{ir.OMUL, types.TUINT64}:  ssa.OpMul64,
  2421  	{ir.OMUL, types.TFLOAT32}: ssa.OpMul32F,
  2422  	{ir.OMUL, types.TFLOAT64}: ssa.OpMul64F,
  2423  
  2424  	{ir.ODIV, types.TFLOAT32}: ssa.OpDiv32F,
  2425  	{ir.ODIV, types.TFLOAT64}: ssa.OpDiv64F,
  2426  
  2427  	{ir.ODIV, types.TINT8}:   ssa.OpDiv8,
  2428  	{ir.ODIV, types.TUINT8}:  ssa.OpDiv8u,
  2429  	{ir.ODIV, types.TINT16}:  ssa.OpDiv16,
  2430  	{ir.ODIV, types.TUINT16}: ssa.OpDiv16u,
  2431  	{ir.ODIV, types.TINT32}:  ssa.OpDiv32,
  2432  	{ir.ODIV, types.TUINT32}: ssa.OpDiv32u,
  2433  	{ir.ODIV, types.TINT64}:  ssa.OpDiv64,
  2434  	{ir.ODIV, types.TUINT64}: ssa.OpDiv64u,
  2435  
  2436  	{ir.OMOD, types.TINT8}:   ssa.OpMod8,
  2437  	{ir.OMOD, types.TUINT8}:  ssa.OpMod8u,
  2438  	{ir.OMOD, types.TINT16}:  ssa.OpMod16,
  2439  	{ir.OMOD, types.TUINT16}: ssa.OpMod16u,
  2440  	{ir.OMOD, types.TINT32}:  ssa.OpMod32,
  2441  	{ir.OMOD, types.TUINT32}: ssa.OpMod32u,
  2442  	{ir.OMOD, types.TINT64}:  ssa.OpMod64,
  2443  	{ir.OMOD, types.TUINT64}: ssa.OpMod64u,
  2444  
  2445  	{ir.OAND, types.TINT8}:   ssa.OpAnd8,
  2446  	{ir.OAND, types.TUINT8}:  ssa.OpAnd8,
  2447  	{ir.OAND, types.TINT16}:  ssa.OpAnd16,
  2448  	{ir.OAND, types.TUINT16}: ssa.OpAnd16,
  2449  	{ir.OAND, types.TINT32}:  ssa.OpAnd32,
  2450  	{ir.OAND, types.TUINT32}: ssa.OpAnd32,
  2451  	{ir.OAND, types.TINT64}:  ssa.OpAnd64,
  2452  	{ir.OAND, types.TUINT64}: ssa.OpAnd64,
  2453  
  2454  	{ir.OOR, types.TINT8}:   ssa.OpOr8,
  2455  	{ir.OOR, types.TUINT8}:  ssa.OpOr8,
  2456  	{ir.OOR, types.TINT16}:  ssa.OpOr16,
  2457  	{ir.OOR, types.TUINT16}: ssa.OpOr16,
  2458  	{ir.OOR, types.TINT32}:  ssa.OpOr32,
  2459  	{ir.OOR, types.TUINT32}: ssa.OpOr32,
  2460  	{ir.OOR, types.TINT64}:  ssa.OpOr64,
  2461  	{ir.OOR, types.TUINT64}: ssa.OpOr64,
  2462  
  2463  	{ir.OXOR, types.TINT8}:   ssa.OpXor8,
  2464  	{ir.OXOR, types.TUINT8}:  ssa.OpXor8,
  2465  	{ir.OXOR, types.TINT16}:  ssa.OpXor16,
  2466  	{ir.OXOR, types.TUINT16}: ssa.OpXor16,
  2467  	{ir.OXOR, types.TINT32}:  ssa.OpXor32,
  2468  	{ir.OXOR, types.TUINT32}: ssa.OpXor32,
  2469  	{ir.OXOR, types.TINT64}:  ssa.OpXor64,
  2470  	{ir.OXOR, types.TUINT64}: ssa.OpXor64,
  2471  
  2472  	{ir.OEQ, types.TBOOL}:      ssa.OpEqB,
  2473  	{ir.OEQ, types.TINT8}:      ssa.OpEq8,
  2474  	{ir.OEQ, types.TUINT8}:     ssa.OpEq8,
  2475  	{ir.OEQ, types.TINT16}:     ssa.OpEq16,
  2476  	{ir.OEQ, types.TUINT16}:    ssa.OpEq16,
  2477  	{ir.OEQ, types.TINT32}:     ssa.OpEq32,
  2478  	{ir.OEQ, types.TUINT32}:    ssa.OpEq32,
  2479  	{ir.OEQ, types.TINT64}:     ssa.OpEq64,
  2480  	{ir.OEQ, types.TUINT64}:    ssa.OpEq64,
  2481  	{ir.OEQ, types.TINTER}:     ssa.OpEqInter,
  2482  	{ir.OEQ, types.TSLICE}:     ssa.OpEqSlice,
  2483  	{ir.OEQ, types.TFUNC}:      ssa.OpEqPtr,
  2484  	{ir.OEQ, types.TMAP}:       ssa.OpEqPtr,
  2485  	{ir.OEQ, types.TCHAN}:      ssa.OpEqPtr,
  2486  	{ir.OEQ, types.TPTR}:       ssa.OpEqPtr,
  2487  	{ir.OEQ, types.TUINTPTR}:   ssa.OpEqPtr,
  2488  	{ir.OEQ, types.TUNSAFEPTR}: ssa.OpEqPtr,
  2489  	{ir.OEQ, types.TFLOAT64}:   ssa.OpEq64F,
  2490  	{ir.OEQ, types.TFLOAT32}:   ssa.OpEq32F,
  2491  
  2492  	{ir.ONE, types.TBOOL}:      ssa.OpNeqB,
  2493  	{ir.ONE, types.TINT8}:      ssa.OpNeq8,
  2494  	{ir.ONE, types.TUINT8}:     ssa.OpNeq8,
  2495  	{ir.ONE, types.TINT16}:     ssa.OpNeq16,
  2496  	{ir.ONE, types.TUINT16}:    ssa.OpNeq16,
  2497  	{ir.ONE, types.TINT32}:     ssa.OpNeq32,
  2498  	{ir.ONE, types.TUINT32}:    ssa.OpNeq32,
  2499  	{ir.ONE, types.TINT64}:     ssa.OpNeq64,
  2500  	{ir.ONE, types.TUINT64}:    ssa.OpNeq64,
  2501  	{ir.ONE, types.TINTER}:     ssa.OpNeqInter,
  2502  	{ir.ONE, types.TSLICE}:     ssa.OpNeqSlice,
  2503  	{ir.ONE, types.TFUNC}:      ssa.OpNeqPtr,
  2504  	{ir.ONE, types.TMAP}:       ssa.OpNeqPtr,
  2505  	{ir.ONE, types.TCHAN}:      ssa.OpNeqPtr,
  2506  	{ir.ONE, types.TPTR}:       ssa.OpNeqPtr,
  2507  	{ir.ONE, types.TUINTPTR}:   ssa.OpNeqPtr,
  2508  	{ir.ONE, types.TUNSAFEPTR}: ssa.OpNeqPtr,
  2509  	{ir.ONE, types.TFLOAT64}:   ssa.OpNeq64F,
  2510  	{ir.ONE, types.TFLOAT32}:   ssa.OpNeq32F,
  2511  
  2512  	{ir.OLT, types.TINT8}:    ssa.OpLess8,
  2513  	{ir.OLT, types.TUINT8}:   ssa.OpLess8U,
  2514  	{ir.OLT, types.TINT16}:   ssa.OpLess16,
  2515  	{ir.OLT, types.TUINT16}:  ssa.OpLess16U,
  2516  	{ir.OLT, types.TINT32}:   ssa.OpLess32,
  2517  	{ir.OLT, types.TUINT32}:  ssa.OpLess32U,
  2518  	{ir.OLT, types.TINT64}:   ssa.OpLess64,
  2519  	{ir.OLT, types.TUINT64}:  ssa.OpLess64U,
  2520  	{ir.OLT, types.TFLOAT64}: ssa.OpLess64F,
  2521  	{ir.OLT, types.TFLOAT32}: ssa.OpLess32F,
  2522  
  2523  	{ir.OLE, types.TINT8}:    ssa.OpLeq8,
  2524  	{ir.OLE, types.TUINT8}:   ssa.OpLeq8U,
  2525  	{ir.OLE, types.TINT16}:   ssa.OpLeq16,
  2526  	{ir.OLE, types.TUINT16}:  ssa.OpLeq16U,
  2527  	{ir.OLE, types.TINT32}:   ssa.OpLeq32,
  2528  	{ir.OLE, types.TUINT32}:  ssa.OpLeq32U,
  2529  	{ir.OLE, types.TINT64}:   ssa.OpLeq64,
  2530  	{ir.OLE, types.TUINT64}:  ssa.OpLeq64U,
  2531  	{ir.OLE, types.TFLOAT64}: ssa.OpLeq64F,
  2532  	{ir.OLE, types.TFLOAT32}: ssa.OpLeq32F,
  2533  }
  2534  
  2535  func (s *state) concreteEtype(t *types.Type) types.Kind {
  2536  	e := t.Kind()
  2537  	switch e {
  2538  	default:
  2539  		return e
  2540  	case types.TINT:
  2541  		if s.config.PtrSize == 8 {
  2542  			return types.TINT64
  2543  		}
  2544  		return types.TINT32
  2545  	case types.TUINT:
  2546  		if s.config.PtrSize == 8 {
  2547  			return types.TUINT64
  2548  		}
  2549  		return types.TUINT32
  2550  	case types.TUINTPTR:
  2551  		if s.config.PtrSize == 8 {
  2552  			return types.TUINT64
  2553  		}
  2554  		return types.TUINT32
  2555  	}
  2556  }
  2557  
  2558  func (s *state) ssaOp(op ir.Op, t *types.Type) ssa.Op {
  2559  	etype := s.concreteEtype(t)
  2560  	x, ok := opToSSA[opAndType{op, etype}]
  2561  	if !ok {
  2562  		s.Fatalf("unhandled binary op %v %s", op, etype)
  2563  	}
  2564  	return x
  2565  }
  2566  
  2567  type opAndTwoTypes struct {
  2568  	op     ir.Op
  2569  	etype1 types.Kind
  2570  	etype2 types.Kind
  2571  }
  2572  
  2573  type twoTypes struct {
  2574  	etype1 types.Kind
  2575  	etype2 types.Kind
  2576  }
  2577  
  2578  type twoOpsAndType struct {
  2579  	op1              ssa.Op
  2580  	op2              ssa.Op
  2581  	intermediateType types.Kind
  2582  }
  2583  
  2584  var fpConvOpToSSA = map[twoTypes]twoOpsAndType{
  2585  
  2586  	{types.TINT8, types.TFLOAT32}:  {ssa.OpSignExt8to32, ssa.OpCvt32to32F, types.TINT32},
  2587  	{types.TINT16, types.TFLOAT32}: {ssa.OpSignExt16to32, ssa.OpCvt32to32F, types.TINT32},
  2588  	{types.TINT32, types.TFLOAT32}: {ssa.OpCopy, ssa.OpCvt32to32F, types.TINT32},
  2589  	{types.TINT64, types.TFLOAT32}: {ssa.OpCopy, ssa.OpCvt64to32F, types.TINT64},
  2590  
  2591  	{types.TINT8, types.TFLOAT64}:  {ssa.OpSignExt8to32, ssa.OpCvt32to64F, types.TINT32},
  2592  	{types.TINT16, types.TFLOAT64}: {ssa.OpSignExt16to32, ssa.OpCvt32to64F, types.TINT32},
  2593  	{types.TINT32, types.TFLOAT64}: {ssa.OpCopy, ssa.OpCvt32to64F, types.TINT32},
  2594  	{types.TINT64, types.TFLOAT64}: {ssa.OpCopy, ssa.OpCvt64to64F, types.TINT64},
  2595  
  2596  	{types.TFLOAT32, types.TINT8}:  {ssa.OpCvt32Fto32, ssa.OpTrunc32to8, types.TINT32},
  2597  	{types.TFLOAT32, types.TINT16}: {ssa.OpCvt32Fto32, ssa.OpTrunc32to16, types.TINT32},
  2598  	{types.TFLOAT32, types.TINT32}: {ssa.OpCvt32Fto32, ssa.OpCopy, types.TINT32},
  2599  	{types.TFLOAT32, types.TINT64}: {ssa.OpCvt32Fto64, ssa.OpCopy, types.TINT64},
  2600  
  2601  	{types.TFLOAT64, types.TINT8}:  {ssa.OpCvt64Fto32, ssa.OpTrunc32to8, types.TINT32},
  2602  	{types.TFLOAT64, types.TINT16}: {ssa.OpCvt64Fto32, ssa.OpTrunc32to16, types.TINT32},
  2603  	{types.TFLOAT64, types.TINT32}: {ssa.OpCvt64Fto32, ssa.OpCopy, types.TINT32},
  2604  	{types.TFLOAT64, types.TINT64}: {ssa.OpCvt64Fto64, ssa.OpCopy, types.TINT64},
  2605  	// unsigned
  2606  	{types.TUINT8, types.TFLOAT32}:  {ssa.OpZeroExt8to32, ssa.OpCvt32to32F, types.TINT32},
  2607  	{types.TUINT16, types.TFLOAT32}: {ssa.OpZeroExt16to32, ssa.OpCvt32to32F, types.TINT32},
  2608  	{types.TUINT32, types.TFLOAT32}: {ssa.OpZeroExt32to64, ssa.OpCvt64to32F, types.TINT64}, // go wide to dodge unsigned
  2609  	{types.TUINT64, types.TFLOAT32}: {ssa.OpCopy, ssa.OpInvalid, types.TUINT64},            // Cvt64Uto32F, branchy code expansion instead
  2610  
  2611  	{types.TUINT8, types.TFLOAT64}:  {ssa.OpZeroExt8to32, ssa.OpCvt32to64F, types.TINT32},
  2612  	{types.TUINT16, types.TFLOAT64}: {ssa.OpZeroExt16to32, ssa.OpCvt32to64F, types.TINT32},
  2613  	{types.TUINT32, types.TFLOAT64}: {ssa.OpZeroExt32to64, ssa.OpCvt64to64F, types.TINT64}, // go wide to dodge unsigned
  2614  	{types.TUINT64, types.TFLOAT64}: {ssa.OpCopy, ssa.OpInvalid, types.TUINT64},            // Cvt64Uto64F, branchy code expansion instead
  2615  
  2616  	{types.TFLOAT32, types.TUINT8}:  {ssa.OpCvt32Fto32, ssa.OpTrunc32to8, types.TINT32},
  2617  	{types.TFLOAT32, types.TUINT16}: {ssa.OpCvt32Fto32, ssa.OpTrunc32to16, types.TINT32},
  2618  	{types.TFLOAT32, types.TUINT32}: {ssa.OpCvt32Fto64, ssa.OpTrunc64to32, types.TINT64}, // go wide to dodge unsigned
  2619  	{types.TFLOAT32, types.TUINT64}: {ssa.OpInvalid, ssa.OpCopy, types.TUINT64},          // Cvt32Fto64U, branchy code expansion instead
  2620  
  2621  	{types.TFLOAT64, types.TUINT8}:  {ssa.OpCvt64Fto32, ssa.OpTrunc32to8, types.TINT32},
  2622  	{types.TFLOAT64, types.TUINT16}: {ssa.OpCvt64Fto32, ssa.OpTrunc32to16, types.TINT32},
  2623  	{types.TFLOAT64, types.TUINT32}: {ssa.OpCvt64Fto64, ssa.OpTrunc64to32, types.TINT64}, // go wide to dodge unsigned
  2624  	{types.TFLOAT64, types.TUINT64}: {ssa.OpInvalid, ssa.OpCopy, types.TUINT64},          // Cvt64Fto64U, branchy code expansion instead
  2625  
  2626  	// float
  2627  	{types.TFLOAT64, types.TFLOAT32}: {ssa.OpCvt64Fto32F, ssa.OpCopy, types.TFLOAT32},
  2628  	{types.TFLOAT64, types.TFLOAT64}: {ssa.OpRound64F, ssa.OpCopy, types.TFLOAT64},
  2629  	{types.TFLOAT32, types.TFLOAT32}: {ssa.OpRound32F, ssa.OpCopy, types.TFLOAT32},
  2630  	{types.TFLOAT32, types.TFLOAT64}: {ssa.OpCvt32Fto64F, ssa.OpCopy, types.TFLOAT64},
  2631  }
  2632  
  2633  // this map is used only for 32-bit arch, and only includes the difference
  2634  // on 32-bit arch, don't use int64<->float conversion for uint32
  2635  var fpConvOpToSSA32 = map[twoTypes]twoOpsAndType{
  2636  	{types.TUINT32, types.TFLOAT32}: {ssa.OpCopy, ssa.OpCvt32Uto32F, types.TUINT32},
  2637  	{types.TUINT32, types.TFLOAT64}: {ssa.OpCopy, ssa.OpCvt32Uto64F, types.TUINT32},
  2638  	{types.TFLOAT32, types.TUINT32}: {ssa.OpCvt32Fto32U, ssa.OpCopy, types.TUINT32},
  2639  	{types.TFLOAT64, types.TUINT32}: {ssa.OpCvt64Fto32U, ssa.OpCopy, types.TUINT32},
  2640  }
  2641  
  2642  // uint64<->float conversions, only on machines that have instructions for that
  2643  var uint64fpConvOpToSSA = map[twoTypes]twoOpsAndType{
  2644  	{types.TUINT64, types.TFLOAT32}: {ssa.OpCopy, ssa.OpCvt64Uto32F, types.TUINT64},
  2645  	{types.TUINT64, types.TFLOAT64}: {ssa.OpCopy, ssa.OpCvt64Uto64F, types.TUINT64},
  2646  	{types.TFLOAT32, types.TUINT64}: {ssa.OpCvt32Fto64U, ssa.OpCopy, types.TUINT64},
  2647  	{types.TFLOAT64, types.TUINT64}: {ssa.OpCvt64Fto64U, ssa.OpCopy, types.TUINT64},
  2648  }
  2649  
  2650  var shiftOpToSSA = map[opAndTwoTypes]ssa.Op{
  2651  	{ir.OLSH, types.TINT8, types.TUINT8}:   ssa.OpLsh8x8,
  2652  	{ir.OLSH, types.TUINT8, types.TUINT8}:  ssa.OpLsh8x8,
  2653  	{ir.OLSH, types.TINT8, types.TUINT16}:  ssa.OpLsh8x16,
  2654  	{ir.OLSH, types.TUINT8, types.TUINT16}: ssa.OpLsh8x16,
  2655  	{ir.OLSH, types.TINT8, types.TUINT32}:  ssa.OpLsh8x32,
  2656  	{ir.OLSH, types.TUINT8, types.TUINT32}: ssa.OpLsh8x32,
  2657  	{ir.OLSH, types.TINT8, types.TUINT64}:  ssa.OpLsh8x64,
  2658  	{ir.OLSH, types.TUINT8, types.TUINT64}: ssa.OpLsh8x64,
  2659  
  2660  	{ir.OLSH, types.TINT16, types.TUINT8}:   ssa.OpLsh16x8,
  2661  	{ir.OLSH, types.TUINT16, types.TUINT8}:  ssa.OpLsh16x8,
  2662  	{ir.OLSH, types.TINT16, types.TUINT16}:  ssa.OpLsh16x16,
  2663  	{ir.OLSH, types.TUINT16, types.TUINT16}: ssa.OpLsh16x16,
  2664  	{ir.OLSH, types.TINT16, types.TUINT32}:  ssa.OpLsh16x32,
  2665  	{ir.OLSH, types.TUINT16, types.TUINT32}: ssa.OpLsh16x32,
  2666  	{ir.OLSH, types.TINT16, types.TUINT64}:  ssa.OpLsh16x64,
  2667  	{ir.OLSH, types.TUINT16, types.TUINT64}: ssa.OpLsh16x64,
  2668  
  2669  	{ir.OLSH, types.TINT32, types.TUINT8}:   ssa.OpLsh32x8,
  2670  	{ir.OLSH, types.TUINT32, types.TUINT8}:  ssa.OpLsh32x8,
  2671  	{ir.OLSH, types.TINT32, types.TUINT16}:  ssa.OpLsh32x16,
  2672  	{ir.OLSH, types.TUINT32, types.TUINT16}: ssa.OpLsh32x16,
  2673  	{ir.OLSH, types.TINT32, types.TUINT32}:  ssa.OpLsh32x32,
  2674  	{ir.OLSH, types.TUINT32, types.TUINT32}: ssa.OpLsh32x32,
  2675  	{ir.OLSH, types.TINT32, types.TUINT64}:  ssa.OpLsh32x64,
  2676  	{ir.OLSH, types.TUINT32, types.TUINT64}: ssa.OpLsh32x64,
  2677  
  2678  	{ir.OLSH, types.TINT64, types.TUINT8}:   ssa.OpLsh64x8,
  2679  	{ir.OLSH, types.TUINT64, types.TUINT8}:  ssa.OpLsh64x8,
  2680  	{ir.OLSH, types.TINT64, types.TUINT16}:  ssa.OpLsh64x16,
  2681  	{ir.OLSH, types.TUINT64, types.TUINT16}: ssa.OpLsh64x16,
  2682  	{ir.OLSH, types.TINT64, types.TUINT32}:  ssa.OpLsh64x32,
  2683  	{ir.OLSH, types.TUINT64, types.TUINT32}: ssa.OpLsh64x32,
  2684  	{ir.OLSH, types.TINT64, types.TUINT64}:  ssa.OpLsh64x64,
  2685  	{ir.OLSH, types.TUINT64, types.TUINT64}: ssa.OpLsh64x64,
  2686  
  2687  	{ir.ORSH, types.TINT8, types.TUINT8}:   ssa.OpRsh8x8,
  2688  	{ir.ORSH, types.TUINT8, types.TUINT8}:  ssa.OpRsh8Ux8,
  2689  	{ir.ORSH, types.TINT8, types.TUINT16}:  ssa.OpRsh8x16,
  2690  	{ir.ORSH, types.TUINT8, types.TUINT16}: ssa.OpRsh8Ux16,
  2691  	{ir.ORSH, types.TINT8, types.TUINT32}:  ssa.OpRsh8x32,
  2692  	{ir.ORSH, types.TUINT8, types.TUINT32}: ssa.OpRsh8Ux32,
  2693  	{ir.ORSH, types.TINT8, types.TUINT64}:  ssa.OpRsh8x64,
  2694  	{ir.ORSH, types.TUINT8, types.TUINT64}: ssa.OpRsh8Ux64,
  2695  
  2696  	{ir.ORSH, types.TINT16, types.TUINT8}:   ssa.OpRsh16x8,
  2697  	{ir.ORSH, types.TUINT16, types.TUINT8}:  ssa.OpRsh16Ux8,
  2698  	{ir.ORSH, types.TINT16, types.TUINT16}:  ssa.OpRsh16x16,
  2699  	{ir.ORSH, types.TUINT16, types.TUINT16}: ssa.OpRsh16Ux16,
  2700  	{ir.ORSH, types.TINT16, types.TUINT32}:  ssa.OpRsh16x32,
  2701  	{ir.ORSH, types.TUINT16, types.TUINT32}: ssa.OpRsh16Ux32,
  2702  	{ir.ORSH, types.TINT16, types.TUINT64}:  ssa.OpRsh16x64,
  2703  	{ir.ORSH, types.TUINT16, types.TUINT64}: ssa.OpRsh16Ux64,
  2704  
  2705  	{ir.ORSH, types.TINT32, types.TUINT8}:   ssa.OpRsh32x8,
  2706  	{ir.ORSH, types.TUINT32, types.TUINT8}:  ssa.OpRsh32Ux8,
  2707  	{ir.ORSH, types.TINT32, types.TUINT16}:  ssa.OpRsh32x16,
  2708  	{ir.ORSH, types.TUINT32, types.TUINT16}: ssa.OpRsh32Ux16,
  2709  	{ir.ORSH, types.TINT32, types.TUINT32}:  ssa.OpRsh32x32,
  2710  	{ir.ORSH, types.TUINT32, types.TUINT32}: ssa.OpRsh32Ux32,
  2711  	{ir.ORSH, types.TINT32, types.TUINT64}:  ssa.OpRsh32x64,
  2712  	{ir.ORSH, types.TUINT32, types.TUINT64}: ssa.OpRsh32Ux64,
  2713  
  2714  	{ir.ORSH, types.TINT64, types.TUINT8}:   ssa.OpRsh64x8,
  2715  	{ir.ORSH, types.TUINT64, types.TUINT8}:  ssa.OpRsh64Ux8,
  2716  	{ir.ORSH, types.TINT64, types.TUINT16}:  ssa.OpRsh64x16,
  2717  	{ir.ORSH, types.TUINT64, types.TUINT16}: ssa.OpRsh64Ux16,
  2718  	{ir.ORSH, types.TINT64, types.TUINT32}:  ssa.OpRsh64x32,
  2719  	{ir.ORSH, types.TUINT64, types.TUINT32}: ssa.OpRsh64Ux32,
  2720  	{ir.ORSH, types.TINT64, types.TUINT64}:  ssa.OpRsh64x64,
  2721  	{ir.ORSH, types.TUINT64, types.TUINT64}: ssa.OpRsh64Ux64,
  2722  }
  2723  
  2724  func (s *state) ssaShiftOp(op ir.Op, t *types.Type, u *types.Type) ssa.Op {
  2725  	etype1 := s.concreteEtype(t)
  2726  	etype2 := s.concreteEtype(u)
  2727  	x, ok := shiftOpToSSA[opAndTwoTypes{op, etype1, etype2}]
  2728  	if !ok {
  2729  		s.Fatalf("unhandled shift op %v etype=%s/%s", op, etype1, etype2)
  2730  	}
  2731  	return x
  2732  }
  2733  
  2734  func (s *state) uintptrConstant(v uint64) *ssa.Value {
  2735  	if s.config.PtrSize == 4 {
  2736  		return s.newValue0I(ssa.OpConst32, types.Types[types.TUINTPTR], int64(v))
  2737  	}
  2738  	return s.newValue0I(ssa.OpConst64, types.Types[types.TUINTPTR], int64(v))
  2739  }
  2740  
  2741  func (s *state) conv(n ir.Node, v *ssa.Value, ft, tt *types.Type) *ssa.Value {
  2742  	if ft.IsBoolean() && tt.IsKind(types.TUINT8) {
  2743  		// Bool -> uint8 is generated internally when indexing into runtime.staticbyte.
  2744  		return s.newValue1(ssa.OpCvtBoolToUint8, tt, v)
  2745  	}
  2746  	if ft.IsInteger() && tt.IsInteger() {
  2747  		var op ssa.Op
  2748  		if tt.Size() == ft.Size() {
  2749  			op = ssa.OpCopy
  2750  		} else if tt.Size() < ft.Size() {
  2751  			// truncation
  2752  			switch 10*ft.Size() + tt.Size() {
  2753  			case 21:
  2754  				op = ssa.OpTrunc16to8
  2755  			case 41:
  2756  				op = ssa.OpTrunc32to8
  2757  			case 42:
  2758  				op = ssa.OpTrunc32to16
  2759  			case 81:
  2760  				op = ssa.OpTrunc64to8
  2761  			case 82:
  2762  				op = ssa.OpTrunc64to16
  2763  			case 84:
  2764  				op = ssa.OpTrunc64to32
  2765  			default:
  2766  				s.Fatalf("weird integer truncation %v -> %v", ft, tt)
  2767  			}
  2768  		} else if ft.IsSigned() {
  2769  			// sign extension
  2770  			switch 10*ft.Size() + tt.Size() {
  2771  			case 12:
  2772  				op = ssa.OpSignExt8to16
  2773  			case 14:
  2774  				op = ssa.OpSignExt8to32
  2775  			case 18:
  2776  				op = ssa.OpSignExt8to64
  2777  			case 24:
  2778  				op = ssa.OpSignExt16to32
  2779  			case 28:
  2780  				op = ssa.OpSignExt16to64
  2781  			case 48:
  2782  				op = ssa.OpSignExt32to64
  2783  			default:
  2784  				s.Fatalf("bad integer sign extension %v -> %v", ft, tt)
  2785  			}
  2786  		} else {
  2787  			// zero extension
  2788  			switch 10*ft.Size() + tt.Size() {
  2789  			case 12:
  2790  				op = ssa.OpZeroExt8to16
  2791  			case 14:
  2792  				op = ssa.OpZeroExt8to32
  2793  			case 18:
  2794  				op = ssa.OpZeroExt8to64
  2795  			case 24:
  2796  				op = ssa.OpZeroExt16to32
  2797  			case 28:
  2798  				op = ssa.OpZeroExt16to64
  2799  			case 48:
  2800  				op = ssa.OpZeroExt32to64
  2801  			default:
  2802  				s.Fatalf("weird integer sign extension %v -> %v", ft, tt)
  2803  			}
  2804  		}
  2805  		return s.newValue1(op, tt, v)
  2806  	}
  2807  
  2808  	if ft.IsComplex() && tt.IsComplex() {
  2809  		var op ssa.Op
  2810  		if ft.Size() == tt.Size() {
  2811  			switch ft.Size() {
  2812  			case 8:
  2813  				op = ssa.OpRound32F
  2814  			case 16:
  2815  				op = ssa.OpRound64F
  2816  			default:
  2817  				s.Fatalf("weird complex conversion %v -> %v", ft, tt)
  2818  			}
  2819  		} else if ft.Size() == 8 && tt.Size() == 16 {
  2820  			op = ssa.OpCvt32Fto64F
  2821  		} else if ft.Size() == 16 && tt.Size() == 8 {
  2822  			op = ssa.OpCvt64Fto32F
  2823  		} else {
  2824  			s.Fatalf("weird complex conversion %v -> %v", ft, tt)
  2825  		}
  2826  		ftp := types.FloatForComplex(ft)
  2827  		ttp := types.FloatForComplex(tt)
  2828  		return s.newValue2(ssa.OpComplexMake, tt,
  2829  			s.newValueOrSfCall1(op, ttp, s.newValue1(ssa.OpComplexReal, ftp, v)),
  2830  			s.newValueOrSfCall1(op, ttp, s.newValue1(ssa.OpComplexImag, ftp, v)))
  2831  	}
  2832  
  2833  	if tt.IsComplex() { // and ft is not complex
  2834  		// Needed for generics support - can't happen in normal Go code.
  2835  		et := types.FloatForComplex(tt)
  2836  		v = s.conv(n, v, ft, et)
  2837  		return s.newValue2(ssa.OpComplexMake, tt, v, s.zeroVal(et))
  2838  	}
  2839  
  2840  	if ft.IsFloat() || tt.IsFloat() {
  2841  		conv, ok := fpConvOpToSSA[twoTypes{s.concreteEtype(ft), s.concreteEtype(tt)}]
  2842  		if s.config.RegSize == 4 && Arch.LinkArch.Family != sys.MIPS && !s.softFloat {
  2843  			if conv1, ok1 := fpConvOpToSSA32[twoTypes{s.concreteEtype(ft), s.concreteEtype(tt)}]; ok1 {
  2844  				conv = conv1
  2845  			}
  2846  		}
  2847  		if Arch.LinkArch.Family == sys.ARM64 || Arch.LinkArch.Family == sys.Wasm || Arch.LinkArch.Family == sys.S390X || s.softFloat {
  2848  			if conv1, ok1 := uint64fpConvOpToSSA[twoTypes{s.concreteEtype(ft), s.concreteEtype(tt)}]; ok1 {
  2849  				conv = conv1
  2850  			}
  2851  		}
  2852  
  2853  		if Arch.LinkArch.Family == sys.MIPS && !s.softFloat {
  2854  			if ft.Size() == 4 && ft.IsInteger() && !ft.IsSigned() {
  2855  				// tt is float32 or float64, and ft is also unsigned
  2856  				if tt.Size() == 4 {
  2857  					return s.uint32Tofloat32(n, v, ft, tt)
  2858  				}
  2859  				if tt.Size() == 8 {
  2860  					return s.uint32Tofloat64(n, v, ft, tt)
  2861  				}
  2862  			} else if tt.Size() == 4 && tt.IsInteger() && !tt.IsSigned() {
  2863  				// ft is float32 or float64, and tt is unsigned integer
  2864  				if ft.Size() == 4 {
  2865  					return s.float32ToUint32(n, v, ft, tt)
  2866  				}
  2867  				if ft.Size() == 8 {
  2868  					return s.float64ToUint32(n, v, ft, tt)
  2869  				}
  2870  			}
  2871  		}
  2872  
  2873  		if !ok {
  2874  			s.Fatalf("weird float conversion %v -> %v", ft, tt)
  2875  		}
  2876  		op1, op2, it := conv.op1, conv.op2, conv.intermediateType
  2877  
  2878  		if op1 != ssa.OpInvalid && op2 != ssa.OpInvalid {
  2879  			// normal case, not tripping over unsigned 64
  2880  			if op1 == ssa.OpCopy {
  2881  				if op2 == ssa.OpCopy {
  2882  					return v
  2883  				}
  2884  				return s.newValueOrSfCall1(op2, tt, v)
  2885  			}
  2886  			if op2 == ssa.OpCopy {
  2887  				return s.newValueOrSfCall1(op1, tt, v)
  2888  			}
  2889  			return s.newValueOrSfCall1(op2, tt, s.newValueOrSfCall1(op1, types.Types[it], v))
  2890  		}
  2891  		// Tricky 64-bit unsigned cases.
  2892  		if ft.IsInteger() {
  2893  			// tt is float32 or float64, and ft is also unsigned
  2894  			if tt.Size() == 4 {
  2895  				return s.uint64Tofloat32(n, v, ft, tt)
  2896  			}
  2897  			if tt.Size() == 8 {
  2898  				return s.uint64Tofloat64(n, v, ft, tt)
  2899  			}
  2900  			s.Fatalf("weird unsigned integer to float conversion %v -> %v", ft, tt)
  2901  		}
  2902  		// ft is float32 or float64, and tt is unsigned integer
  2903  		if ft.Size() == 4 {
  2904  			return s.float32ToUint64(n, v, ft, tt)
  2905  		}
  2906  		if ft.Size() == 8 {
  2907  			return s.float64ToUint64(n, v, ft, tt)
  2908  		}
  2909  		s.Fatalf("weird float to unsigned integer conversion %v -> %v", ft, tt)
  2910  		return nil
  2911  	}
  2912  
  2913  	s.Fatalf("unhandled OCONV %s -> %s", ft.Kind(), tt.Kind())
  2914  	return nil
  2915  }
  2916  
  2917  // expr converts the expression n to ssa, adds it to s and returns the ssa result.
  2918  func (s *state) expr(n ir.Node) *ssa.Value {
  2919  	return s.exprCheckPtr(n, true)
  2920  }
  2921  
  2922  func (s *state) exprCheckPtr(n ir.Node, checkPtrOK bool) *ssa.Value {
  2923  	if ir.HasUniquePos(n) {
  2924  		// ONAMEs and named OLITERALs have the line number
  2925  		// of the decl, not the use. See issue 14742.
  2926  		s.pushLine(n.Pos())
  2927  		defer s.popLine()
  2928  	}
  2929  
  2930  	s.stmtList(n.Init())
  2931  	switch n.Op() {
  2932  	case ir.OBYTES2STRTMP:
  2933  		n := n.(*ir.ConvExpr)
  2934  		slice := s.expr(n.X)
  2935  		ptr := s.newValue1(ssa.OpSlicePtr, s.f.Config.Types.BytePtr, slice)
  2936  		len := s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], slice)
  2937  		return s.newValue2(ssa.OpStringMake, n.Type(), ptr, len)
  2938  	case ir.OSTR2BYTESTMP:
  2939  		n := n.(*ir.ConvExpr)
  2940  		str := s.expr(n.X)
  2941  		ptr := s.newValue1(ssa.OpStringPtr, s.f.Config.Types.BytePtr, str)
  2942  		if !n.NonNil() {
  2943  			// We need to ensure []byte("") evaluates to []byte{}, and not []byte(nil).
  2944  			//
  2945  			// TODO(mdempsky): Investigate using "len != 0" instead of "ptr != nil".
  2946  			cond := s.newValue2(ssa.OpNeqPtr, types.Types[types.TBOOL], ptr, s.constNil(ptr.Type))
  2947  			zerobase := s.newValue1A(ssa.OpAddr, ptr.Type, ir.Syms.Zerobase, s.sb)
  2948  			ptr = s.ternary(cond, ptr, zerobase)
  2949  		}
  2950  		len := s.newValue1(ssa.OpStringLen, types.Types[types.TINT], str)
  2951  		return s.newValue3(ssa.OpSliceMake, n.Type(), ptr, len, len)
  2952  	case ir.OCFUNC:
  2953  		n := n.(*ir.UnaryExpr)
  2954  		aux := n.X.(*ir.Name).Linksym()
  2955  		// OCFUNC is used to build function values, which must
  2956  		// always reference ABIInternal entry points.
  2957  		if aux.ABI() != obj.ABIInternal {
  2958  			s.Fatalf("expected ABIInternal: %v", aux.ABI())
  2959  		}
  2960  		return s.entryNewValue1A(ssa.OpAddr, n.Type(), aux, s.sb)
  2961  	case ir.ONAME:
  2962  		n := n.(*ir.Name)
  2963  		if n.Class == ir.PFUNC {
  2964  			// "value" of a function is the address of the function's closure
  2965  			sym := staticdata.FuncLinksym(n)
  2966  			return s.entryNewValue1A(ssa.OpAddr, types.NewPtr(n.Type()), sym, s.sb)
  2967  		}
  2968  		if s.canSSA(n) {
  2969  			return s.variable(n, n.Type())
  2970  		}
  2971  		return s.load(n.Type(), s.addr(n))
  2972  	case ir.OLINKSYMOFFSET:
  2973  		n := n.(*ir.LinksymOffsetExpr)
  2974  		return s.load(n.Type(), s.addr(n))
  2975  	case ir.ONIL:
  2976  		n := n.(*ir.NilExpr)
  2977  		t := n.Type()
  2978  		switch {
  2979  		case t.IsSlice():
  2980  			return s.constSlice(t)
  2981  		case t.IsInterface():
  2982  			return s.constInterface(t)
  2983  		default:
  2984  			return s.constNil(t)
  2985  		}
  2986  	case ir.OLITERAL:
  2987  		switch u := n.Val(); u.Kind() {
  2988  		case constant.Int:
  2989  			i := ir.IntVal(n.Type(), u)
  2990  			switch n.Type().Size() {
  2991  			case 1:
  2992  				return s.constInt8(n.Type(), int8(i))
  2993  			case 2:
  2994  				return s.constInt16(n.Type(), int16(i))
  2995  			case 4:
  2996  				return s.constInt32(n.Type(), int32(i))
  2997  			case 8:
  2998  				return s.constInt64(n.Type(), i)
  2999  			default:
  3000  				s.Fatalf("bad integer size %d", n.Type().Size())
  3001  				return nil
  3002  			}
  3003  		case constant.String:
  3004  			i := constant.StringVal(u)
  3005  			if i == "" {
  3006  				return s.constEmptyString(n.Type())
  3007  			}
  3008  			return s.entryNewValue0A(ssa.OpConstString, n.Type(), ssa.StringToAux(i))
  3009  		case constant.Bool:
  3010  			return s.constBool(constant.BoolVal(u))
  3011  		case constant.Float:
  3012  			f, _ := constant.Float64Val(u)
  3013  			switch n.Type().Size() {
  3014  			case 4:
  3015  				return s.constFloat32(n.Type(), f)
  3016  			case 8:
  3017  				return s.constFloat64(n.Type(), f)
  3018  			default:
  3019  				s.Fatalf("bad float size %d", n.Type().Size())
  3020  				return nil
  3021  			}
  3022  		case constant.Complex:
  3023  			re, _ := constant.Float64Val(constant.Real(u))
  3024  			im, _ := constant.Float64Val(constant.Imag(u))
  3025  			switch n.Type().Size() {
  3026  			case 8:
  3027  				pt := types.Types[types.TFLOAT32]
  3028  				return s.newValue2(ssa.OpComplexMake, n.Type(),
  3029  					s.constFloat32(pt, re),
  3030  					s.constFloat32(pt, im))
  3031  			case 16:
  3032  				pt := types.Types[types.TFLOAT64]
  3033  				return s.newValue2(ssa.OpComplexMake, n.Type(),
  3034  					s.constFloat64(pt, re),
  3035  					s.constFloat64(pt, im))
  3036  			default:
  3037  				s.Fatalf("bad complex size %d", n.Type().Size())
  3038  				return nil
  3039  			}
  3040  		default:
  3041  			s.Fatalf("unhandled OLITERAL %v", u.Kind())
  3042  			return nil
  3043  		}
  3044  	case ir.OCONVNOP:
  3045  		n := n.(*ir.ConvExpr)
  3046  		to := n.Type()
  3047  		from := n.X.Type()
  3048  
  3049  		// Assume everything will work out, so set up our return value.
  3050  		// Anything interesting that happens from here is a fatal.
  3051  		x := s.expr(n.X)
  3052  		if to == from {
  3053  			return x
  3054  		}
  3055  
  3056  		// Special case for not confusing GC and liveness.
  3057  		// We don't want pointers accidentally classified
  3058  		// as not-pointers or vice-versa because of copy
  3059  		// elision.
  3060  		if to.IsPtrShaped() != from.IsPtrShaped() {
  3061  			return s.newValue2(ssa.OpConvert, to, x, s.mem())
  3062  		}
  3063  
  3064  		v := s.newValue1(ssa.OpCopy, to, x) // ensure that v has the right type
  3065  
  3066  		// CONVNOP closure
  3067  		if to.Kind() == types.TFUNC && from.IsPtrShaped() {
  3068  			return v
  3069  		}
  3070  
  3071  		// named <--> unnamed type or typed <--> untyped const
  3072  		if from.Kind() == to.Kind() {
  3073  			return v
  3074  		}
  3075  
  3076  		// unsafe.Pointer <--> *T
  3077  		if to.IsUnsafePtr() && from.IsPtrShaped() || from.IsUnsafePtr() && to.IsPtrShaped() {
  3078  			if s.checkPtrEnabled && checkPtrOK && to.IsPtr() && from.IsUnsafePtr() {
  3079  				s.checkPtrAlignment(n, v, nil)
  3080  			}
  3081  			return v
  3082  		}
  3083  
  3084  		// map <--> *hmap
  3085  		var mt *types.Type
  3086  		if buildcfg.Experiment.SwissMap {
  3087  			mt = types.NewPtr(reflectdata.SwissMapType())
  3088  		} else {
  3089  			mt = types.NewPtr(reflectdata.OldMapType())
  3090  		}
  3091  		if to.Kind() == types.TMAP && from == mt {
  3092  			return v
  3093  		}
  3094  
  3095  		types.CalcSize(from)
  3096  		types.CalcSize(to)
  3097  		if from.Size() != to.Size() {
  3098  			s.Fatalf("CONVNOP width mismatch %v (%d) -> %v (%d)\n", from, from.Size(), to, to.Size())
  3099  			return nil
  3100  		}
  3101  		if etypesign(from.Kind()) != etypesign(to.Kind()) {
  3102  			s.Fatalf("CONVNOP sign mismatch %v (%s) -> %v (%s)\n", from, from.Kind(), to, to.Kind())
  3103  			return nil
  3104  		}
  3105  
  3106  		if base.Flag.Cfg.Instrumenting {
  3107  			// These appear to be fine, but they fail the
  3108  			// integer constraint below, so okay them here.
  3109  			// Sample non-integer conversion: map[string]string -> *uint8
  3110  			return v
  3111  		}
  3112  
  3113  		if etypesign(from.Kind()) == 0 {
  3114  			s.Fatalf("CONVNOP unrecognized non-integer %v -> %v\n", from, to)
  3115  			return nil
  3116  		}
  3117  
  3118  		// integer, same width, same sign
  3119  		return v
  3120  
  3121  	case ir.OCONV:
  3122  		n := n.(*ir.ConvExpr)
  3123  		x := s.expr(n.X)
  3124  		return s.conv(n, x, n.X.Type(), n.Type())
  3125  
  3126  	case ir.ODOTTYPE:
  3127  		n := n.(*ir.TypeAssertExpr)
  3128  		res, _ := s.dottype(n, false)
  3129  		return res
  3130  
  3131  	case ir.ODYNAMICDOTTYPE:
  3132  		n := n.(*ir.DynamicTypeAssertExpr)
  3133  		res, _ := s.dynamicDottype(n, false)
  3134  		return res
  3135  
  3136  	// binary ops
  3137  	case ir.OLT, ir.OEQ, ir.ONE, ir.OLE, ir.OGE, ir.OGT:
  3138  		n := n.(*ir.BinaryExpr)
  3139  		a := s.expr(n.X)
  3140  		b := s.expr(n.Y)
  3141  		if n.X.Type().IsComplex() {
  3142  			pt := types.FloatForComplex(n.X.Type())
  3143  			op := s.ssaOp(ir.OEQ, pt)
  3144  			r := s.newValueOrSfCall2(op, types.Types[types.TBOOL], s.newValue1(ssa.OpComplexReal, pt, a), s.newValue1(ssa.OpComplexReal, pt, b))
  3145  			i := s.newValueOrSfCall2(op, types.Types[types.TBOOL], s.newValue1(ssa.OpComplexImag, pt, a), s.newValue1(ssa.OpComplexImag, pt, b))
  3146  			c := s.newValue2(ssa.OpAndB, types.Types[types.TBOOL], r, i)
  3147  			switch n.Op() {
  3148  			case ir.OEQ:
  3149  				return c
  3150  			case ir.ONE:
  3151  				return s.newValue1(ssa.OpNot, types.Types[types.TBOOL], c)
  3152  			default:
  3153  				s.Fatalf("ordered complex compare %v", n.Op())
  3154  			}
  3155  		}
  3156  
  3157  		// Convert OGE and OGT into OLE and OLT.
  3158  		op := n.Op()
  3159  		switch op {
  3160  		case ir.OGE:
  3161  			op, a, b = ir.OLE, b, a
  3162  		case ir.OGT:
  3163  			op, a, b = ir.OLT, b, a
  3164  		}
  3165  		if n.X.Type().IsFloat() {
  3166  			// float comparison
  3167  			return s.newValueOrSfCall2(s.ssaOp(op, n.X.Type()), types.Types[types.TBOOL], a, b)
  3168  		}
  3169  		// integer comparison
  3170  		return s.newValue2(s.ssaOp(op, n.X.Type()), types.Types[types.TBOOL], a, b)
  3171  	case ir.OMUL:
  3172  		n := n.(*ir.BinaryExpr)
  3173  		a := s.expr(n.X)
  3174  		b := s.expr(n.Y)
  3175  		if n.Type().IsComplex() {
  3176  			mulop := ssa.OpMul64F
  3177  			addop := ssa.OpAdd64F
  3178  			subop := ssa.OpSub64F
  3179  			pt := types.FloatForComplex(n.Type()) // Could be Float32 or Float64
  3180  			wt := types.Types[types.TFLOAT64]     // Compute in Float64 to minimize cancellation error
  3181  
  3182  			areal := s.newValue1(ssa.OpComplexReal, pt, a)
  3183  			breal := s.newValue1(ssa.OpComplexReal, pt, b)
  3184  			aimag := s.newValue1(ssa.OpComplexImag, pt, a)
  3185  			bimag := s.newValue1(ssa.OpComplexImag, pt, b)
  3186  
  3187  			if pt != wt { // Widen for calculation
  3188  				areal = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, areal)
  3189  				breal = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, breal)
  3190  				aimag = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, aimag)
  3191  				bimag = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, bimag)
  3192  			}
  3193  
  3194  			xreal := s.newValueOrSfCall2(subop, wt, s.newValueOrSfCall2(mulop, wt, areal, breal), s.newValueOrSfCall2(mulop, wt, aimag, bimag))
  3195  			ximag := s.newValueOrSfCall2(addop, wt, s.newValueOrSfCall2(mulop, wt, areal, bimag), s.newValueOrSfCall2(mulop, wt, aimag, breal))
  3196  
  3197  			if pt != wt { // Narrow to store back
  3198  				xreal = s.newValueOrSfCall1(ssa.OpCvt64Fto32F, pt, xreal)
  3199  				ximag = s.newValueOrSfCall1(ssa.OpCvt64Fto32F, pt, ximag)
  3200  			}
  3201  
  3202  			return s.newValue2(ssa.OpComplexMake, n.Type(), xreal, ximag)
  3203  		}
  3204  
  3205  		if n.Type().IsFloat() {
  3206  			return s.newValueOrSfCall2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  3207  		}
  3208  
  3209  		return s.newValue2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  3210  
  3211  	case ir.ODIV:
  3212  		n := n.(*ir.BinaryExpr)
  3213  		a := s.expr(n.X)
  3214  		b := s.expr(n.Y)
  3215  		if n.Type().IsComplex() {
  3216  			// TODO this is not executed because the front-end substitutes a runtime call.
  3217  			// That probably ought to change; with modest optimization the widen/narrow
  3218  			// conversions could all be elided in larger expression trees.
  3219  			mulop := ssa.OpMul64F
  3220  			addop := ssa.OpAdd64F
  3221  			subop := ssa.OpSub64F
  3222  			divop := ssa.OpDiv64F
  3223  			pt := types.FloatForComplex(n.Type()) // Could be Float32 or Float64
  3224  			wt := types.Types[types.TFLOAT64]     // Compute in Float64 to minimize cancellation error
  3225  
  3226  			areal := s.newValue1(ssa.OpComplexReal, pt, a)
  3227  			breal := s.newValue1(ssa.OpComplexReal, pt, b)
  3228  			aimag := s.newValue1(ssa.OpComplexImag, pt, a)
  3229  			bimag := s.newValue1(ssa.OpComplexImag, pt, b)
  3230  
  3231  			if pt != wt { // Widen for calculation
  3232  				areal = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, areal)
  3233  				breal = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, breal)
  3234  				aimag = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, aimag)
  3235  				bimag = s.newValueOrSfCall1(ssa.OpCvt32Fto64F, wt, bimag)
  3236  			}
  3237  
  3238  			denom := s.newValueOrSfCall2(addop, wt, s.newValueOrSfCall2(mulop, wt, breal, breal), s.newValueOrSfCall2(mulop, wt, bimag, bimag))
  3239  			xreal := s.newValueOrSfCall2(addop, wt, s.newValueOrSfCall2(mulop, wt, areal, breal), s.newValueOrSfCall2(mulop, wt, aimag, bimag))
  3240  			ximag := s.newValueOrSfCall2(subop, wt, s.newValueOrSfCall2(mulop, wt, aimag, breal), s.newValueOrSfCall2(mulop, wt, areal, bimag))
  3241  
  3242  			// TODO not sure if this is best done in wide precision or narrow
  3243  			// Double-rounding might be an issue.
  3244  			// Note that the pre-SSA implementation does the entire calculation
  3245  			// in wide format, so wide is compatible.
  3246  			xreal = s.newValueOrSfCall2(divop, wt, xreal, denom)
  3247  			ximag = s.newValueOrSfCall2(divop, wt, ximag, denom)
  3248  
  3249  			if pt != wt { // Narrow to store back
  3250  				xreal = s.newValueOrSfCall1(ssa.OpCvt64Fto32F, pt, xreal)
  3251  				ximag = s.newValueOrSfCall1(ssa.OpCvt64Fto32F, pt, ximag)
  3252  			}
  3253  			return s.newValue2(ssa.OpComplexMake, n.Type(), xreal, ximag)
  3254  		}
  3255  		if n.Type().IsFloat() {
  3256  			return s.newValueOrSfCall2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  3257  		}
  3258  		return s.intDivide(n, a, b)
  3259  	case ir.OMOD:
  3260  		n := n.(*ir.BinaryExpr)
  3261  		a := s.expr(n.X)
  3262  		b := s.expr(n.Y)
  3263  		return s.intDivide(n, a, b)
  3264  	case ir.OADD, ir.OSUB:
  3265  		n := n.(*ir.BinaryExpr)
  3266  		a := s.expr(n.X)
  3267  		b := s.expr(n.Y)
  3268  		if n.Type().IsComplex() {
  3269  			pt := types.FloatForComplex(n.Type())
  3270  			op := s.ssaOp(n.Op(), pt)
  3271  			return s.newValue2(ssa.OpComplexMake, n.Type(),
  3272  				s.newValueOrSfCall2(op, pt, s.newValue1(ssa.OpComplexReal, pt, a), s.newValue1(ssa.OpComplexReal, pt, b)),
  3273  				s.newValueOrSfCall2(op, pt, s.newValue1(ssa.OpComplexImag, pt, a), s.newValue1(ssa.OpComplexImag, pt, b)))
  3274  		}
  3275  		if n.Type().IsFloat() {
  3276  			return s.newValueOrSfCall2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  3277  		}
  3278  		return s.newValue2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  3279  	case ir.OAND, ir.OOR, ir.OXOR:
  3280  		n := n.(*ir.BinaryExpr)
  3281  		a := s.expr(n.X)
  3282  		b := s.expr(n.Y)
  3283  		return s.newValue2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  3284  	case ir.OANDNOT:
  3285  		n := n.(*ir.BinaryExpr)
  3286  		a := s.expr(n.X)
  3287  		b := s.expr(n.Y)
  3288  		b = s.newValue1(s.ssaOp(ir.OBITNOT, b.Type), b.Type, b)
  3289  		return s.newValue2(s.ssaOp(ir.OAND, n.Type()), a.Type, a, b)
  3290  	case ir.OLSH, ir.ORSH:
  3291  		n := n.(*ir.BinaryExpr)
  3292  		a := s.expr(n.X)
  3293  		b := s.expr(n.Y)
  3294  		bt := b.Type
  3295  		if bt.IsSigned() {
  3296  			cmp := s.newValue2(s.ssaOp(ir.OLE, bt), types.Types[types.TBOOL], s.zeroVal(bt), b)
  3297  			s.check(cmp, ir.Syms.Panicshift)
  3298  			bt = bt.ToUnsigned()
  3299  		}
  3300  		return s.newValue2(s.ssaShiftOp(n.Op(), n.Type(), bt), a.Type, a, b)
  3301  	case ir.OANDAND, ir.OOROR:
  3302  		// To implement OANDAND (and OOROR), we introduce a
  3303  		// new temporary variable to hold the result. The
  3304  		// variable is associated with the OANDAND node in the
  3305  		// s.vars table (normally variables are only
  3306  		// associated with ONAME nodes). We convert
  3307  		//     A && B
  3308  		// to
  3309  		//     var = A
  3310  		//     if var {
  3311  		//         var = B
  3312  		//     }
  3313  		// Using var in the subsequent block introduces the
  3314  		// necessary phi variable.
  3315  		n := n.(*ir.LogicalExpr)
  3316  		el := s.expr(n.X)
  3317  		s.vars[n] = el
  3318  
  3319  		b := s.endBlock()
  3320  		b.Kind = ssa.BlockIf
  3321  		b.SetControl(el)
  3322  		// In theory, we should set b.Likely here based on context.
  3323  		// However, gc only gives us likeliness hints
  3324  		// in a single place, for plain OIF statements,
  3325  		// and passing around context is finicky, so don't bother for now.
  3326  
  3327  		bRight := s.f.NewBlock(ssa.BlockPlain)
  3328  		bResult := s.f.NewBlock(ssa.BlockPlain)
  3329  		if n.Op() == ir.OANDAND {
  3330  			b.AddEdgeTo(bRight)
  3331  			b.AddEdgeTo(bResult)
  3332  		} else if n.Op() == ir.OOROR {
  3333  			b.AddEdgeTo(bResult)
  3334  			b.AddEdgeTo(bRight)
  3335  		}
  3336  
  3337  		s.startBlock(bRight)
  3338  		er := s.expr(n.Y)
  3339  		s.vars[n] = er
  3340  
  3341  		b = s.endBlock()
  3342  		b.AddEdgeTo(bResult)
  3343  
  3344  		s.startBlock(bResult)
  3345  		return s.variable(n, types.Types[types.TBOOL])
  3346  	case ir.OCOMPLEX:
  3347  		n := n.(*ir.BinaryExpr)
  3348  		r := s.expr(n.X)
  3349  		i := s.expr(n.Y)
  3350  		return s.newValue2(ssa.OpComplexMake, n.Type(), r, i)
  3351  
  3352  	// unary ops
  3353  	case ir.ONEG:
  3354  		n := n.(*ir.UnaryExpr)
  3355  		a := s.expr(n.X)
  3356  		if n.Type().IsComplex() {
  3357  			tp := types.FloatForComplex(n.Type())
  3358  			negop := s.ssaOp(n.Op(), tp)
  3359  			return s.newValue2(ssa.OpComplexMake, n.Type(),
  3360  				s.newValue1(negop, tp, s.newValue1(ssa.OpComplexReal, tp, a)),
  3361  				s.newValue1(negop, tp, s.newValue1(ssa.OpComplexImag, tp, a)))
  3362  		}
  3363  		return s.newValue1(s.ssaOp(n.Op(), n.Type()), a.Type, a)
  3364  	case ir.ONOT, ir.OBITNOT:
  3365  		n := n.(*ir.UnaryExpr)
  3366  		a := s.expr(n.X)
  3367  		return s.newValue1(s.ssaOp(n.Op(), n.Type()), a.Type, a)
  3368  	case ir.OIMAG, ir.OREAL:
  3369  		n := n.(*ir.UnaryExpr)
  3370  		a := s.expr(n.X)
  3371  		return s.newValue1(s.ssaOp(n.Op(), n.X.Type()), n.Type(), a)
  3372  	case ir.OPLUS:
  3373  		n := n.(*ir.UnaryExpr)
  3374  		return s.expr(n.X)
  3375  
  3376  	case ir.OADDR:
  3377  		n := n.(*ir.AddrExpr)
  3378  		return s.addr(n.X)
  3379  
  3380  	case ir.ORESULT:
  3381  		n := n.(*ir.ResultExpr)
  3382  		if s.prevCall == nil || s.prevCall.Op != ssa.OpStaticLECall && s.prevCall.Op != ssa.OpInterLECall && s.prevCall.Op != ssa.OpClosureLECall {
  3383  			panic("Expected to see a previous call")
  3384  		}
  3385  		which := n.Index
  3386  		if which == -1 {
  3387  			panic(fmt.Errorf("ORESULT %v does not match call %s", n, s.prevCall))
  3388  		}
  3389  		return s.resultOfCall(s.prevCall, which, n.Type())
  3390  
  3391  	case ir.ODEREF:
  3392  		n := n.(*ir.StarExpr)
  3393  		p := s.exprPtr(n.X, n.Bounded(), n.Pos())
  3394  		return s.load(n.Type(), p)
  3395  
  3396  	case ir.ODOT:
  3397  		n := n.(*ir.SelectorExpr)
  3398  		if n.X.Op() == ir.OSTRUCTLIT {
  3399  			// All literals with nonzero fields have already been
  3400  			// rewritten during walk. Any that remain are just T{}
  3401  			// or equivalents. Use the zero value.
  3402  			if !ir.IsZero(n.X) {
  3403  				s.Fatalf("literal with nonzero value in SSA: %v", n.X)
  3404  			}
  3405  			return s.zeroVal(n.Type())
  3406  		}
  3407  		// If n is addressable and can't be represented in
  3408  		// SSA, then load just the selected field. This
  3409  		// prevents false memory dependencies in race/msan/asan
  3410  		// instrumentation.
  3411  		if ir.IsAddressable(n) && !s.canSSA(n) {
  3412  			p := s.addr(n)
  3413  			return s.load(n.Type(), p)
  3414  		}
  3415  		v := s.expr(n.X)
  3416  		return s.newValue1I(ssa.OpStructSelect, n.Type(), int64(fieldIdx(n)), v)
  3417  
  3418  	case ir.ODOTPTR:
  3419  		n := n.(*ir.SelectorExpr)
  3420  		p := s.exprPtr(n.X, n.Bounded(), n.Pos())
  3421  		p = s.newValue1I(ssa.OpOffPtr, types.NewPtr(n.Type()), n.Offset(), p)
  3422  		return s.load(n.Type(), p)
  3423  
  3424  	case ir.OINDEX:
  3425  		n := n.(*ir.IndexExpr)
  3426  		switch {
  3427  		case n.X.Type().IsString():
  3428  			if n.Bounded() && ir.IsConst(n.X, constant.String) && ir.IsConst(n.Index, constant.Int) {
  3429  				// Replace "abc"[1] with 'b'.
  3430  				// Delayed until now because "abc"[1] is not an ideal constant.
  3431  				// See test/fixedbugs/issue11370.go.
  3432  				return s.newValue0I(ssa.OpConst8, types.Types[types.TUINT8], int64(int8(ir.StringVal(n.X)[ir.Int64Val(n.Index)])))
  3433  			}
  3434  			a := s.expr(n.X)
  3435  			i := s.expr(n.Index)
  3436  			len := s.newValue1(ssa.OpStringLen, types.Types[types.TINT], a)
  3437  			i = s.boundsCheck(i, len, ssa.BoundsIndex, n.Bounded())
  3438  			ptrtyp := s.f.Config.Types.BytePtr
  3439  			ptr := s.newValue1(ssa.OpStringPtr, ptrtyp, a)
  3440  			if ir.IsConst(n.Index, constant.Int) {
  3441  				ptr = s.newValue1I(ssa.OpOffPtr, ptrtyp, ir.Int64Val(n.Index), ptr)
  3442  			} else {
  3443  				ptr = s.newValue2(ssa.OpAddPtr, ptrtyp, ptr, i)
  3444  			}
  3445  			return s.load(types.Types[types.TUINT8], ptr)
  3446  		case n.X.Type().IsSlice():
  3447  			p := s.addr(n)
  3448  			return s.load(n.X.Type().Elem(), p)
  3449  		case n.X.Type().IsArray():
  3450  			if ssa.CanSSA(n.X.Type()) {
  3451  				// SSA can handle arrays of length at most 1.
  3452  				bound := n.X.Type().NumElem()
  3453  				a := s.expr(n.X)
  3454  				i := s.expr(n.Index)
  3455  				if bound == 0 {
  3456  					// Bounds check will never succeed.  Might as well
  3457  					// use constants for the bounds check.
  3458  					z := s.constInt(types.Types[types.TINT], 0)
  3459  					s.boundsCheck(z, z, ssa.BoundsIndex, false)
  3460  					// The return value won't be live, return junk.
  3461  					// But not quite junk, in case bounds checks are turned off. See issue 48092.
  3462  					return s.zeroVal(n.Type())
  3463  				}
  3464  				len := s.constInt(types.Types[types.TINT], bound)
  3465  				s.boundsCheck(i, len, ssa.BoundsIndex, n.Bounded()) // checks i == 0
  3466  				return s.newValue1I(ssa.OpArraySelect, n.Type(), 0, a)
  3467  			}
  3468  			p := s.addr(n)
  3469  			return s.load(n.X.Type().Elem(), p)
  3470  		default:
  3471  			s.Fatalf("bad type for index %v", n.X.Type())
  3472  			return nil
  3473  		}
  3474  
  3475  	case ir.OLEN, ir.OCAP:
  3476  		n := n.(*ir.UnaryExpr)
  3477  		// Note: all constant cases are handled by the frontend. If len or cap
  3478  		// makes it here, we want the side effects of the argument. See issue 72844.
  3479  		a := s.expr(n.X)
  3480  		t := n.X.Type()
  3481  		switch {
  3482  		case t.IsSlice():
  3483  			op := ssa.OpSliceLen
  3484  			if n.Op() == ir.OCAP {
  3485  				op = ssa.OpSliceCap
  3486  			}
  3487  			return s.newValue1(op, types.Types[types.TINT], a)
  3488  		case t.IsString(): // string; not reachable for OCAP
  3489  			return s.newValue1(ssa.OpStringLen, types.Types[types.TINT], a)
  3490  		case t.IsMap(), t.IsChan():
  3491  			return s.referenceTypeBuiltin(n, a)
  3492  		case t.IsArray():
  3493  			return s.constInt(types.Types[types.TINT], t.NumElem())
  3494  		case t.IsPtr() && t.Elem().IsArray():
  3495  			return s.constInt(types.Types[types.TINT], t.Elem().NumElem())
  3496  		default:
  3497  			s.Fatalf("bad type in len/cap: %v", t)
  3498  			return nil
  3499  		}
  3500  
  3501  	case ir.OSPTR:
  3502  		n := n.(*ir.UnaryExpr)
  3503  		a := s.expr(n.X)
  3504  		if n.X.Type().IsSlice() {
  3505  			if n.Bounded() {
  3506  				return s.newValue1(ssa.OpSlicePtr, n.Type(), a)
  3507  			}
  3508  			return s.newValue1(ssa.OpSlicePtrUnchecked, n.Type(), a)
  3509  		} else {
  3510  			return s.newValue1(ssa.OpStringPtr, n.Type(), a)
  3511  		}
  3512  
  3513  	case ir.OITAB:
  3514  		n := n.(*ir.UnaryExpr)
  3515  		a := s.expr(n.X)
  3516  		return s.newValue1(ssa.OpITab, n.Type(), a)
  3517  
  3518  	case ir.OIDATA:
  3519  		n := n.(*ir.UnaryExpr)
  3520  		a := s.expr(n.X)
  3521  		return s.newValue1(ssa.OpIData, n.Type(), a)
  3522  
  3523  	case ir.OMAKEFACE:
  3524  		n := n.(*ir.BinaryExpr)
  3525  		tab := s.expr(n.X)
  3526  		data := s.expr(n.Y)
  3527  		return s.newValue2(ssa.OpIMake, n.Type(), tab, data)
  3528  
  3529  	case ir.OSLICEHEADER:
  3530  		n := n.(*ir.SliceHeaderExpr)
  3531  		p := s.expr(n.Ptr)
  3532  		l := s.expr(n.Len)
  3533  		c := s.expr(n.Cap)
  3534  		return s.newValue3(ssa.OpSliceMake, n.Type(), p, l, c)
  3535  
  3536  	case ir.OSTRINGHEADER:
  3537  		n := n.(*ir.StringHeaderExpr)
  3538  		p := s.expr(n.Ptr)
  3539  		l := s.expr(n.Len)
  3540  		return s.newValue2(ssa.OpStringMake, n.Type(), p, l)
  3541  
  3542  	case ir.OSLICE, ir.OSLICEARR, ir.OSLICE3, ir.OSLICE3ARR:
  3543  		n := n.(*ir.SliceExpr)
  3544  		check := s.checkPtrEnabled && n.Op() == ir.OSLICE3ARR && n.X.Op() == ir.OCONVNOP && n.X.(*ir.ConvExpr).X.Type().IsUnsafePtr()
  3545  		v := s.exprCheckPtr(n.X, !check)
  3546  		var i, j, k *ssa.Value
  3547  		if n.Low != nil {
  3548  			i = s.expr(n.Low)
  3549  		}
  3550  		if n.High != nil {
  3551  			j = s.expr(n.High)
  3552  		}
  3553  		if n.Max != nil {
  3554  			k = s.expr(n.Max)
  3555  		}
  3556  		p, l, c := s.slice(v, i, j, k, n.Bounded())
  3557  		if check {
  3558  			// Emit checkptr instrumentation after bound check to prevent false positive, see #46938.
  3559  			s.checkPtrAlignment(n.X.(*ir.ConvExpr), v, s.conv(n.Max, k, k.Type, types.Types[types.TUINTPTR]))
  3560  		}
  3561  		return s.newValue3(ssa.OpSliceMake, n.Type(), p, l, c)
  3562  
  3563  	case ir.OSLICESTR:
  3564  		n := n.(*ir.SliceExpr)
  3565  		v := s.expr(n.X)
  3566  		var i, j *ssa.Value
  3567  		if n.Low != nil {
  3568  			i = s.expr(n.Low)
  3569  		}
  3570  		if n.High != nil {
  3571  			j = s.expr(n.High)
  3572  		}
  3573  		p, l, _ := s.slice(v, i, j, nil, n.Bounded())
  3574  		return s.newValue2(ssa.OpStringMake, n.Type(), p, l)
  3575  
  3576  	case ir.OSLICE2ARRPTR:
  3577  		// if arrlen > slice.len {
  3578  		//   panic(...)
  3579  		// }
  3580  		// slice.ptr
  3581  		n := n.(*ir.ConvExpr)
  3582  		v := s.expr(n.X)
  3583  		nelem := n.Type().Elem().NumElem()
  3584  		arrlen := s.constInt(types.Types[types.TINT], nelem)
  3585  		cap := s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], v)
  3586  		s.boundsCheck(arrlen, cap, ssa.BoundsConvert, false)
  3587  		op := ssa.OpSlicePtr
  3588  		if nelem == 0 {
  3589  			op = ssa.OpSlicePtrUnchecked
  3590  		}
  3591  		return s.newValue1(op, n.Type(), v)
  3592  
  3593  	case ir.OCALLFUNC:
  3594  		n := n.(*ir.CallExpr)
  3595  		if ir.IsIntrinsicCall(n) {
  3596  			return s.intrinsicCall(n)
  3597  		}
  3598  		fallthrough
  3599  
  3600  	case ir.OCALLINTER:
  3601  		n := n.(*ir.CallExpr)
  3602  		return s.callResult(n, callNormal)
  3603  
  3604  	case ir.OGETG:
  3605  		n := n.(*ir.CallExpr)
  3606  		return s.newValue1(ssa.OpGetG, n.Type(), s.mem())
  3607  
  3608  	case ir.OGETCALLERSP:
  3609  		n := n.(*ir.CallExpr)
  3610  		return s.newValue1(ssa.OpGetCallerSP, n.Type(), s.mem())
  3611  
  3612  	case ir.OAPPEND:
  3613  		return s.append(n.(*ir.CallExpr), false)
  3614  
  3615  	case ir.OMIN, ir.OMAX:
  3616  		return s.minMax(n.(*ir.CallExpr))
  3617  
  3618  	case ir.OSTRUCTLIT, ir.OARRAYLIT:
  3619  		// All literals with nonzero fields have already been
  3620  		// rewritten during walk. Any that remain are just T{}
  3621  		// or equivalents. Use the zero value.
  3622  		n := n.(*ir.CompLitExpr)
  3623  		if !ir.IsZero(n) {
  3624  			s.Fatalf("literal with nonzero value in SSA: %v", n)
  3625  		}
  3626  		return s.zeroVal(n.Type())
  3627  
  3628  	case ir.ONEW:
  3629  		n := n.(*ir.UnaryExpr)
  3630  		var rtype *ssa.Value
  3631  		if x, ok := n.X.(*ir.DynamicType); ok && x.Op() == ir.ODYNAMICTYPE {
  3632  			rtype = s.expr(x.RType)
  3633  		}
  3634  		return s.newObject(n.Type().Elem(), rtype)
  3635  
  3636  	case ir.OUNSAFEADD:
  3637  		n := n.(*ir.BinaryExpr)
  3638  		ptr := s.expr(n.X)
  3639  		len := s.expr(n.Y)
  3640  
  3641  		// Force len to uintptr to prevent misuse of garbage bits in the
  3642  		// upper part of the register (#48536).
  3643  		len = s.conv(n, len, len.Type, types.Types[types.TUINTPTR])
  3644  
  3645  		return s.newValue2(ssa.OpAddPtr, n.Type(), ptr, len)
  3646  
  3647  	default:
  3648  		s.Fatalf("unhandled expr %v", n.Op())
  3649  		return nil
  3650  	}
  3651  }
  3652  
  3653  func (s *state) resultOfCall(c *ssa.Value, which int64, t *types.Type) *ssa.Value {
  3654  	aux := c.Aux.(*ssa.AuxCall)
  3655  	pa := aux.ParamAssignmentForResult(which)
  3656  	// TODO(register args) determine if in-memory TypeOK is better loaded early from SelectNAddr or later when SelectN is expanded.
  3657  	// SelectN is better for pattern-matching and possible call-aware analysis we might want to do in the future.
  3658  	if len(pa.Registers) == 0 && !ssa.CanSSA(t) {
  3659  		addr := s.newValue1I(ssa.OpSelectNAddr, types.NewPtr(t), which, c)
  3660  		return s.rawLoad(t, addr)
  3661  	}
  3662  	return s.newValue1I(ssa.OpSelectN, t, which, c)
  3663  }
  3664  
  3665  func (s *state) resultAddrOfCall(c *ssa.Value, which int64, t *types.Type) *ssa.Value {
  3666  	aux := c.Aux.(*ssa.AuxCall)
  3667  	pa := aux.ParamAssignmentForResult(which)
  3668  	if len(pa.Registers) == 0 {
  3669  		return s.newValue1I(ssa.OpSelectNAddr, types.NewPtr(t), which, c)
  3670  	}
  3671  	_, addr := s.temp(c.Pos, t)
  3672  	rval := s.newValue1I(ssa.OpSelectN, t, which, c)
  3673  	s.vars[memVar] = s.newValue3Apos(ssa.OpStore, types.TypeMem, t, addr, rval, s.mem(), false)
  3674  	return addr
  3675  }
  3676  
  3677  // append converts an OAPPEND node to SSA.
  3678  // If inplace is false, it converts the OAPPEND expression n to an ssa.Value,
  3679  // adds it to s, and returns the Value.
  3680  // If inplace is true, it writes the result of the OAPPEND expression n
  3681  // back to the slice being appended to, and returns nil.
  3682  // inplace MUST be set to false if the slice can be SSA'd.
  3683  // Note: this code only handles fixed-count appends. Dotdotdot appends
  3684  // have already been rewritten at this point (by walk).
  3685  func (s *state) append(n *ir.CallExpr, inplace bool) *ssa.Value {
  3686  	// If inplace is false, process as expression "append(s, e1, e2, e3)":
  3687  	//
  3688  	// ptr, len, cap := s
  3689  	// len += 3
  3690  	// if uint(len) > uint(cap) {
  3691  	//     ptr, len, cap = growslice(ptr, len, cap, 3, typ)
  3692  	//     Note that len is unmodified by growslice.
  3693  	// }
  3694  	// // with write barriers, if needed:
  3695  	// *(ptr+(len-3)) = e1
  3696  	// *(ptr+(len-2)) = e2
  3697  	// *(ptr+(len-1)) = e3
  3698  	// return makeslice(ptr, len, cap)
  3699  	//
  3700  	//
  3701  	// If inplace is true, process as statement "s = append(s, e1, e2, e3)":
  3702  	//
  3703  	// a := &s
  3704  	// ptr, len, cap := s
  3705  	// len += 3
  3706  	// if uint(len) > uint(cap) {
  3707  	//    ptr, len, cap = growslice(ptr, len, cap, 3, typ)
  3708  	//    vardef(a)    // if necessary, advise liveness we are writing a new a
  3709  	//    *a.cap = cap // write before ptr to avoid a spill
  3710  	//    *a.ptr = ptr // with write barrier
  3711  	// }
  3712  	// *a.len = len
  3713  	// // with write barriers, if needed:
  3714  	// *(ptr+(len-3)) = e1
  3715  	// *(ptr+(len-2)) = e2
  3716  	// *(ptr+(len-1)) = e3
  3717  
  3718  	et := n.Type().Elem()
  3719  	pt := types.NewPtr(et)
  3720  
  3721  	// Evaluate slice
  3722  	sn := n.Args[0] // the slice node is the first in the list
  3723  	var slice, addr *ssa.Value
  3724  	if inplace {
  3725  		addr = s.addr(sn)
  3726  		slice = s.load(n.Type(), addr)
  3727  	} else {
  3728  		slice = s.expr(sn)
  3729  	}
  3730  
  3731  	// Allocate new blocks
  3732  	grow := s.f.NewBlock(ssa.BlockPlain)
  3733  	assign := s.f.NewBlock(ssa.BlockPlain)
  3734  
  3735  	// Decomposse input slice.
  3736  	p := s.newValue1(ssa.OpSlicePtr, pt, slice)
  3737  	l := s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], slice)
  3738  	c := s.newValue1(ssa.OpSliceCap, types.Types[types.TINT], slice)
  3739  
  3740  	// Add number of new elements to length.
  3741  	nargs := s.constInt(types.Types[types.TINT], int64(len(n.Args)-1))
  3742  	oldLen := l
  3743  	l = s.newValue2(s.ssaOp(ir.OADD, types.Types[types.TINT]), types.Types[types.TINT], l, nargs)
  3744  
  3745  	// Decide if we need to grow
  3746  	cmp := s.newValue2(s.ssaOp(ir.OLT, types.Types[types.TUINT]), types.Types[types.TBOOL], c, l)
  3747  
  3748  	// Record values of ptr/len/cap before branch.
  3749  	s.vars[ptrVar] = p
  3750  	s.vars[lenVar] = l
  3751  	if !inplace {
  3752  		s.vars[capVar] = c
  3753  	}
  3754  
  3755  	b := s.endBlock()
  3756  	b.Kind = ssa.BlockIf
  3757  	b.Likely = ssa.BranchUnlikely
  3758  	b.SetControl(cmp)
  3759  	b.AddEdgeTo(grow)
  3760  	b.AddEdgeTo(assign)
  3761  
  3762  	// If the result of the append does not escape, we can use
  3763  	// a stack-allocated backing store if len is small enough.
  3764  	// A stack-allocated backing store could be used at every
  3765  	// append that qualifies, but we limit it in some cases to
  3766  	// avoid wasted code and stack space.
  3767  	// TODO: handle ... append case.
  3768  	maxStackSize := int64(base.Debug.VariableMakeThreshold)
  3769  	if !inplace && n.Esc() == ir.EscNone && et.Size() > 0 && et.Size() <= maxStackSize && base.Flag.N == 0 && base.VariableMakeHash.MatchPos(n.Pos(), nil) && !s.appendTargets[sn] {
  3770  		// if l <= K {
  3771  		//   if !used {
  3772  		//     if oldLen == 0 {
  3773  		//       var store [K]T
  3774  		//       s = store[:l:K]
  3775  		//       used = true
  3776  		//     }
  3777  		//   }
  3778  		// }
  3779  		// ... if we didn't use the stack backing store, call growslice ...
  3780  		//
  3781  		// oldLen==0 is not strictly necessary, but requiring it means
  3782  		// we don't have to worry about copying existing elements.
  3783  		// Allowing oldLen>0 would add complication. Worth it? I would guess not.
  3784  		//
  3785  		// TODO: instead of the used boolean, we could insist that this only applies
  3786  		// to monotonic slices, those which once they have >0 entries never go back
  3787  		// to 0 entries. Then oldLen==0 is enough.
  3788  		//
  3789  		// We also do this for append(x, ...) once for every x.
  3790  		// It is ok to do it more often, but it is probably helpful only for
  3791  		// the first instance. TODO: this could use more tuning. Using ir.Node
  3792  		// as the key works for *ir.Name instances but probably nothing else.
  3793  		if s.appendTargets == nil {
  3794  			s.appendTargets = map[ir.Node]bool{}
  3795  		}
  3796  		s.appendTargets[sn] = true
  3797  
  3798  		K := maxStackSize / et.Size() // rounds down
  3799  		KT := types.NewArray(et, K)
  3800  		KT.SetNoalg(true)
  3801  		types.CalcArraySize(KT)
  3802  		// Align more than naturally for the type KT. See issue 73199.
  3803  		align := types.NewArray(types.Types[types.TUINTPTR], 0)
  3804  		types.CalcArraySize(align)
  3805  		storeTyp := types.NewStruct([]*types.Field{
  3806  			{Sym: types.BlankSym, Type: align},
  3807  			{Sym: types.BlankSym, Type: KT},
  3808  		})
  3809  		storeTyp.SetNoalg(true)
  3810  		types.CalcStructSize(storeTyp)
  3811  
  3812  		usedTestBlock := s.f.NewBlock(ssa.BlockPlain)
  3813  		oldLenTestBlock := s.f.NewBlock(ssa.BlockPlain)
  3814  		bodyBlock := s.f.NewBlock(ssa.BlockPlain)
  3815  		growSlice := s.f.NewBlock(ssa.BlockPlain)
  3816  
  3817  		// Make "used" boolean.
  3818  		tBool := types.Types[types.TBOOL]
  3819  		used := typecheck.TempAt(n.Pos(), s.curfn, tBool)
  3820  		s.defvars[s.f.Entry.ID][used] = s.constBool(false) // initialize this variable at fn entry
  3821  
  3822  		// Make backing store variable.
  3823  		tInt := types.Types[types.TINT]
  3824  		backingStore := typecheck.TempAt(n.Pos(), s.curfn, storeTyp)
  3825  		backingStore.SetAddrtaken(true)
  3826  
  3827  		// if l <= K
  3828  		s.startBlock(grow)
  3829  		kTest := s.newValue2(s.ssaOp(ir.OLE, tInt), tBool, l, s.constInt(tInt, K))
  3830  		b := s.endBlock()
  3831  		b.Kind = ssa.BlockIf
  3832  		b.SetControl(kTest)
  3833  		b.AddEdgeTo(usedTestBlock)
  3834  		b.AddEdgeTo(growSlice)
  3835  		b.Likely = ssa.BranchLikely
  3836  
  3837  		// if !used
  3838  		s.startBlock(usedTestBlock)
  3839  		usedTest := s.newValue1(ssa.OpNot, tBool, s.expr(used))
  3840  		b = s.endBlock()
  3841  		b.Kind = ssa.BlockIf
  3842  		b.SetControl(usedTest)
  3843  		b.AddEdgeTo(oldLenTestBlock)
  3844  		b.AddEdgeTo(growSlice)
  3845  		b.Likely = ssa.BranchLikely
  3846  
  3847  		// if oldLen == 0
  3848  		s.startBlock(oldLenTestBlock)
  3849  		oldLenTest := s.newValue2(s.ssaOp(ir.OEQ, tInt), tBool, oldLen, s.constInt(tInt, 0))
  3850  		b = s.endBlock()
  3851  		b.Kind = ssa.BlockIf
  3852  		b.SetControl(oldLenTest)
  3853  		b.AddEdgeTo(bodyBlock)
  3854  		b.AddEdgeTo(growSlice)
  3855  		b.Likely = ssa.BranchLikely
  3856  
  3857  		// var store struct { _ [0]uintptr; arr [K]T }
  3858  		s.startBlock(bodyBlock)
  3859  		if et.HasPointers() {
  3860  			s.vars[memVar] = s.newValue1A(ssa.OpVarDef, types.TypeMem, backingStore, s.mem())
  3861  		}
  3862  		addr := s.addr(backingStore)
  3863  		s.zero(storeTyp, addr)
  3864  
  3865  		// s = store.arr[:l:K]
  3866  		s.vars[ptrVar] = addr
  3867  		s.vars[lenVar] = l // nargs would also be ok because of the oldLen==0 test.
  3868  		s.vars[capVar] = s.constInt(tInt, K)
  3869  
  3870  		// used = true
  3871  		s.assign(used, s.constBool(true), false, 0)
  3872  		b = s.endBlock()
  3873  		b.AddEdgeTo(assign)
  3874  
  3875  		// New block to use for growslice call.
  3876  		grow = growSlice
  3877  	}
  3878  
  3879  	// Call growslice
  3880  	s.startBlock(grow)
  3881  	taddr := s.expr(n.Fun)
  3882  	r := s.rtcall(ir.Syms.Growslice, true, []*types.Type{n.Type()}, p, l, c, nargs, taddr)
  3883  
  3884  	// Decompose output slice
  3885  	p = s.newValue1(ssa.OpSlicePtr, pt, r[0])
  3886  	l = s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], r[0])
  3887  	c = s.newValue1(ssa.OpSliceCap, types.Types[types.TINT], r[0])
  3888  
  3889  	s.vars[ptrVar] = p
  3890  	s.vars[lenVar] = l
  3891  	s.vars[capVar] = c
  3892  	if inplace {
  3893  		if sn.Op() == ir.ONAME {
  3894  			sn := sn.(*ir.Name)
  3895  			if sn.Class != ir.PEXTERN {
  3896  				// Tell liveness we're about to build a new slice
  3897  				s.vars[memVar] = s.newValue1A(ssa.OpVarDef, types.TypeMem, sn, s.mem())
  3898  			}
  3899  		}
  3900  		capaddr := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.IntPtr, types.SliceCapOffset, addr)
  3901  		s.store(types.Types[types.TINT], capaddr, c)
  3902  		s.store(pt, addr, p)
  3903  	}
  3904  
  3905  	b = s.endBlock()
  3906  	b.AddEdgeTo(assign)
  3907  
  3908  	// assign new elements to slots
  3909  	s.startBlock(assign)
  3910  	p = s.variable(ptrVar, pt)                      // generates phi for ptr
  3911  	l = s.variable(lenVar, types.Types[types.TINT]) // generates phi for len
  3912  	if !inplace {
  3913  		c = s.variable(capVar, types.Types[types.TINT]) // generates phi for cap
  3914  	}
  3915  
  3916  	if inplace {
  3917  		// Update length in place.
  3918  		// We have to wait until here to make sure growslice succeeded.
  3919  		lenaddr := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.IntPtr, types.SliceLenOffset, addr)
  3920  		s.store(types.Types[types.TINT], lenaddr, l)
  3921  	}
  3922  
  3923  	// Evaluate args
  3924  	type argRec struct {
  3925  		// if store is true, we're appending the value v.  If false, we're appending the
  3926  		// value at *v.
  3927  		v     *ssa.Value
  3928  		store bool
  3929  	}
  3930  	args := make([]argRec, 0, len(n.Args[1:]))
  3931  	for _, n := range n.Args[1:] {
  3932  		if ssa.CanSSA(n.Type()) {
  3933  			args = append(args, argRec{v: s.expr(n), store: true})
  3934  		} else {
  3935  			v := s.addr(n)
  3936  			args = append(args, argRec{v: v})
  3937  		}
  3938  	}
  3939  
  3940  	// Write args into slice.
  3941  	oldLen = s.newValue2(s.ssaOp(ir.OSUB, types.Types[types.TINT]), types.Types[types.TINT], l, nargs)
  3942  	p2 := s.newValue2(ssa.OpPtrIndex, pt, p, oldLen)
  3943  	for i, arg := range args {
  3944  		addr := s.newValue2(ssa.OpPtrIndex, pt, p2, s.constInt(types.Types[types.TINT], int64(i)))
  3945  		if arg.store {
  3946  			s.storeType(et, addr, arg.v, 0, true)
  3947  		} else {
  3948  			s.move(et, addr, arg.v)
  3949  		}
  3950  	}
  3951  
  3952  	// The following deletions have no practical effect at this time
  3953  	// because state.vars has been reset by the preceding state.startBlock.
  3954  	// They only enforce the fact that these variables are no longer need in
  3955  	// the current scope.
  3956  	delete(s.vars, ptrVar)
  3957  	delete(s.vars, lenVar)
  3958  	if !inplace {
  3959  		delete(s.vars, capVar)
  3960  	}
  3961  
  3962  	// make result
  3963  	if inplace {
  3964  		return nil
  3965  	}
  3966  	return s.newValue3(ssa.OpSliceMake, n.Type(), p, l, c)
  3967  }
  3968  
  3969  // minMax converts an OMIN/OMAX builtin call into SSA.
  3970  func (s *state) minMax(n *ir.CallExpr) *ssa.Value {
  3971  	// The OMIN/OMAX builtin is variadic, but its semantics are
  3972  	// equivalent to left-folding a binary min/max operation across the
  3973  	// arguments list.
  3974  	fold := func(op func(x, a *ssa.Value) *ssa.Value) *ssa.Value {
  3975  		x := s.expr(n.Args[0])
  3976  		for _, arg := range n.Args[1:] {
  3977  			x = op(x, s.expr(arg))
  3978  		}
  3979  		return x
  3980  	}
  3981  
  3982  	typ := n.Type()
  3983  
  3984  	if typ.IsFloat() || typ.IsString() {
  3985  		// min/max semantics for floats are tricky because of NaNs and
  3986  		// negative zero. Some architectures have instructions which
  3987  		// we can use to generate the right result. For others we must
  3988  		// call into the runtime instead.
  3989  		//
  3990  		// Strings are conceptually simpler, but we currently desugar
  3991  		// string comparisons during walk, not ssagen.
  3992  
  3993  		if typ.IsFloat() {
  3994  			hasIntrinsic := false
  3995  			switch Arch.LinkArch.Family {
  3996  			case sys.AMD64, sys.ARM64, sys.Loong64, sys.RISCV64:
  3997  				hasIntrinsic = true
  3998  			case sys.PPC64:
  3999  				hasIntrinsic = buildcfg.GOPPC64 >= 9
  4000  			}
  4001  
  4002  			if hasIntrinsic {
  4003  				var op ssa.Op
  4004  				switch {
  4005  				case typ.Kind() == types.TFLOAT64 && n.Op() == ir.OMIN:
  4006  					op = ssa.OpMin64F
  4007  				case typ.Kind() == types.TFLOAT64 && n.Op() == ir.OMAX:
  4008  					op = ssa.OpMax64F
  4009  				case typ.Kind() == types.TFLOAT32 && n.Op() == ir.OMIN:
  4010  					op = ssa.OpMin32F
  4011  				case typ.Kind() == types.TFLOAT32 && n.Op() == ir.OMAX:
  4012  					op = ssa.OpMax32F
  4013  				}
  4014  				return fold(func(x, a *ssa.Value) *ssa.Value {
  4015  					return s.newValue2(op, typ, x, a)
  4016  				})
  4017  			}
  4018  		}
  4019  		var name string
  4020  		switch typ.Kind() {
  4021  		case types.TFLOAT32:
  4022  			switch n.Op() {
  4023  			case ir.OMIN:
  4024  				name = "fmin32"
  4025  			case ir.OMAX:
  4026  				name = "fmax32"
  4027  			}
  4028  		case types.TFLOAT64:
  4029  			switch n.Op() {
  4030  			case ir.OMIN:
  4031  				name = "fmin64"
  4032  			case ir.OMAX:
  4033  				name = "fmax64"
  4034  			}
  4035  		case types.TSTRING:
  4036  			switch n.Op() {
  4037  			case ir.OMIN:
  4038  				name = "strmin"
  4039  			case ir.OMAX:
  4040  				name = "strmax"
  4041  			}
  4042  		}
  4043  		fn := typecheck.LookupRuntimeFunc(name)
  4044  
  4045  		return fold(func(x, a *ssa.Value) *ssa.Value {
  4046  			return s.rtcall(fn, true, []*types.Type{typ}, x, a)[0]
  4047  		})
  4048  	}
  4049  
  4050  	if typ.IsInteger() {
  4051  		if Arch.LinkArch.Family == sys.RISCV64 && buildcfg.GORISCV64 >= 22 && typ.Size() == 8 {
  4052  			var op ssa.Op
  4053  			switch {
  4054  			case typ.IsSigned() && n.Op() == ir.OMIN:
  4055  				op = ssa.OpMin64
  4056  			case typ.IsSigned() && n.Op() == ir.OMAX:
  4057  				op = ssa.OpMax64
  4058  			case typ.IsUnsigned() && n.Op() == ir.OMIN:
  4059  				op = ssa.OpMin64u
  4060  			case typ.IsUnsigned() && n.Op() == ir.OMAX:
  4061  				op = ssa.OpMax64u
  4062  			}
  4063  			return fold(func(x, a *ssa.Value) *ssa.Value {
  4064  				return s.newValue2(op, typ, x, a)
  4065  			})
  4066  		}
  4067  	}
  4068  
  4069  	lt := s.ssaOp(ir.OLT, typ)
  4070  
  4071  	return fold(func(x, a *ssa.Value) *ssa.Value {
  4072  		switch n.Op() {
  4073  		case ir.OMIN:
  4074  			// a < x ? a : x
  4075  			return s.ternary(s.newValue2(lt, types.Types[types.TBOOL], a, x), a, x)
  4076  		case ir.OMAX:
  4077  			// x < a ? a : x
  4078  			return s.ternary(s.newValue2(lt, types.Types[types.TBOOL], x, a), a, x)
  4079  		}
  4080  		panic("unreachable")
  4081  	})
  4082  }
  4083  
  4084  // ternary emits code to evaluate cond ? x : y.
  4085  func (s *state) ternary(cond, x, y *ssa.Value) *ssa.Value {
  4086  	// Note that we need a new ternaryVar each time (unlike okVar where we can
  4087  	// reuse the variable) because it might have a different type every time.
  4088  	ternaryVar := ssaMarker("ternary")
  4089  
  4090  	bThen := s.f.NewBlock(ssa.BlockPlain)
  4091  	bElse := s.f.NewBlock(ssa.BlockPlain)
  4092  	bEnd := s.f.NewBlock(ssa.BlockPlain)
  4093  
  4094  	b := s.endBlock()
  4095  	b.Kind = ssa.BlockIf
  4096  	b.SetControl(cond)
  4097  	b.AddEdgeTo(bThen)
  4098  	b.AddEdgeTo(bElse)
  4099  
  4100  	s.startBlock(bThen)
  4101  	s.vars[ternaryVar] = x
  4102  	s.endBlock().AddEdgeTo(bEnd)
  4103  
  4104  	s.startBlock(bElse)
  4105  	s.vars[ternaryVar] = y
  4106  	s.endBlock().AddEdgeTo(bEnd)
  4107  
  4108  	s.startBlock(bEnd)
  4109  	r := s.variable(ternaryVar, x.Type)
  4110  	delete(s.vars, ternaryVar)
  4111  	return r
  4112  }
  4113  
  4114  // condBranch evaluates the boolean expression cond and branches to yes
  4115  // if cond is true and no if cond is false.
  4116  // This function is intended to handle && and || better than just calling
  4117  // s.expr(cond) and branching on the result.
  4118  func (s *state) condBranch(cond ir.Node, yes, no *ssa.Block, likely int8) {
  4119  	switch cond.Op() {
  4120  	case ir.OANDAND:
  4121  		cond := cond.(*ir.LogicalExpr)
  4122  		mid := s.f.NewBlock(ssa.BlockPlain)
  4123  		s.stmtList(cond.Init())
  4124  		s.condBranch(cond.X, mid, no, max(likely, 0))
  4125  		s.startBlock(mid)
  4126  		s.condBranch(cond.Y, yes, no, likely)
  4127  		return
  4128  		// Note: if likely==1, then both recursive calls pass 1.
  4129  		// If likely==-1, then we don't have enough information to decide
  4130  		// whether the first branch is likely or not. So we pass 0 for
  4131  		// the likeliness of the first branch.
  4132  		// TODO: have the frontend give us branch prediction hints for
  4133  		// OANDAND and OOROR nodes (if it ever has such info).
  4134  	case ir.OOROR:
  4135  		cond := cond.(*ir.LogicalExpr)
  4136  		mid := s.f.NewBlock(ssa.BlockPlain)
  4137  		s.stmtList(cond.Init())
  4138  		s.condBranch(cond.X, yes, mid, min(likely, 0))
  4139  		s.startBlock(mid)
  4140  		s.condBranch(cond.Y, yes, no, likely)
  4141  		return
  4142  		// Note: if likely==-1, then both recursive calls pass -1.
  4143  		// If likely==1, then we don't have enough info to decide
  4144  		// the likelihood of the first branch.
  4145  	case ir.ONOT:
  4146  		cond := cond.(*ir.UnaryExpr)
  4147  		s.stmtList(cond.Init())
  4148  		s.condBranch(cond.X, no, yes, -likely)
  4149  		return
  4150  	case ir.OCONVNOP:
  4151  		cond := cond.(*ir.ConvExpr)
  4152  		s.stmtList(cond.Init())
  4153  		s.condBranch(cond.X, yes, no, likely)
  4154  		return
  4155  	}
  4156  	c := s.expr(cond)
  4157  	b := s.endBlock()
  4158  	b.Kind = ssa.BlockIf
  4159  	b.SetControl(c)
  4160  	b.Likely = ssa.BranchPrediction(likely) // gc and ssa both use -1/0/+1 for likeliness
  4161  	b.AddEdgeTo(yes)
  4162  	b.AddEdgeTo(no)
  4163  }
  4164  
  4165  type skipMask uint8
  4166  
  4167  const (
  4168  	skipPtr skipMask = 1 << iota
  4169  	skipLen
  4170  	skipCap
  4171  )
  4172  
  4173  // assign does left = right.
  4174  // Right has already been evaluated to ssa, left has not.
  4175  // If deref is true, then we do left = *right instead (and right has already been nil-checked).
  4176  // If deref is true and right == nil, just do left = 0.
  4177  // skip indicates assignments (at the top level) that can be avoided.
  4178  // mayOverlap indicates whether left&right might partially overlap in memory. Default is false.
  4179  func (s *state) assign(left ir.Node, right *ssa.Value, deref bool, skip skipMask) {
  4180  	s.assignWhichMayOverlap(left, right, deref, skip, false)
  4181  }
  4182  func (s *state) assignWhichMayOverlap(left ir.Node, right *ssa.Value, deref bool, skip skipMask, mayOverlap bool) {
  4183  	if left.Op() == ir.ONAME && ir.IsBlank(left) {
  4184  		return
  4185  	}
  4186  	t := left.Type()
  4187  	types.CalcSize(t)
  4188  	if s.canSSA(left) {
  4189  		if deref {
  4190  			s.Fatalf("can SSA LHS %v but not RHS %s", left, right)
  4191  		}
  4192  		if left.Op() == ir.ODOT {
  4193  			// We're assigning to a field of an ssa-able value.
  4194  			// We need to build a new structure with the new value for the
  4195  			// field we're assigning and the old values for the other fields.
  4196  			// For instance:
  4197  			//   type T struct {a, b, c int}
  4198  			//   var T x
  4199  			//   x.b = 5
  4200  			// For the x.b = 5 assignment we want to generate x = T{x.a, 5, x.c}
  4201  
  4202  			// Grab information about the structure type.
  4203  			left := left.(*ir.SelectorExpr)
  4204  			t := left.X.Type()
  4205  			nf := t.NumFields()
  4206  			idx := fieldIdx(left)
  4207  
  4208  			// Grab old value of structure.
  4209  			old := s.expr(left.X)
  4210  
  4211  			// Make new structure.
  4212  			new := s.newValue0(ssa.OpStructMake, t)
  4213  
  4214  			// Add fields as args.
  4215  			for i := 0; i < nf; i++ {
  4216  				if i == idx {
  4217  					new.AddArg(right)
  4218  				} else {
  4219  					new.AddArg(s.newValue1I(ssa.OpStructSelect, t.FieldType(i), int64(i), old))
  4220  				}
  4221  			}
  4222  
  4223  			// Recursively assign the new value we've made to the base of the dot op.
  4224  			s.assign(left.X, new, false, 0)
  4225  			// TODO: do we need to update named values here?
  4226  			return
  4227  		}
  4228  		if left.Op() == ir.OINDEX && left.(*ir.IndexExpr).X.Type().IsArray() {
  4229  			left := left.(*ir.IndexExpr)
  4230  			s.pushLine(left.Pos())
  4231  			defer s.popLine()
  4232  			// We're assigning to an element of an ssa-able array.
  4233  			// a[i] = v
  4234  			t := left.X.Type()
  4235  			n := t.NumElem()
  4236  
  4237  			i := s.expr(left.Index) // index
  4238  			if n == 0 {
  4239  				// The bounds check must fail.  Might as well
  4240  				// ignore the actual index and just use zeros.
  4241  				z := s.constInt(types.Types[types.TINT], 0)
  4242  				s.boundsCheck(z, z, ssa.BoundsIndex, false)
  4243  				return
  4244  			}
  4245  			if n != 1 {
  4246  				s.Fatalf("assigning to non-1-length array")
  4247  			}
  4248  			// Rewrite to a = [1]{v}
  4249  			len := s.constInt(types.Types[types.TINT], 1)
  4250  			s.boundsCheck(i, len, ssa.BoundsIndex, false) // checks i == 0
  4251  			v := s.newValue1(ssa.OpArrayMake1, t, right)
  4252  			s.assign(left.X, v, false, 0)
  4253  			return
  4254  		}
  4255  		left := left.(*ir.Name)
  4256  		// Update variable assignment.
  4257  		s.vars[left] = right
  4258  		s.addNamedValue(left, right)
  4259  		return
  4260  	}
  4261  
  4262  	// If this assignment clobbers an entire local variable, then emit
  4263  	// OpVarDef so liveness analysis knows the variable is redefined.
  4264  	if base, ok := clobberBase(left).(*ir.Name); ok && base.OnStack() && skip == 0 && (t.HasPointers() || ssa.IsMergeCandidate(base)) {
  4265  		s.vars[memVar] = s.newValue1Apos(ssa.OpVarDef, types.TypeMem, base, s.mem(), !ir.IsAutoTmp(base))
  4266  	}
  4267  
  4268  	// Left is not ssa-able. Compute its address.
  4269  	addr := s.addr(left)
  4270  	if ir.IsReflectHeaderDataField(left) {
  4271  		// Package unsafe's documentation says storing pointers into
  4272  		// reflect.SliceHeader and reflect.StringHeader's Data fields
  4273  		// is valid, even though they have type uintptr (#19168).
  4274  		// Mark it pointer type to signal the writebarrier pass to
  4275  		// insert a write barrier.
  4276  		t = types.Types[types.TUNSAFEPTR]
  4277  	}
  4278  	if deref {
  4279  		// Treat as a mem->mem move.
  4280  		if right == nil {
  4281  			s.zero(t, addr)
  4282  		} else {
  4283  			s.moveWhichMayOverlap(t, addr, right, mayOverlap)
  4284  		}
  4285  		return
  4286  	}
  4287  	// Treat as a store.
  4288  	s.storeType(t, addr, right, skip, !ir.IsAutoTmp(left))
  4289  }
  4290  
  4291  // zeroVal returns the zero value for type t.
  4292  func (s *state) zeroVal(t *types.Type) *ssa.Value {
  4293  	switch {
  4294  	case t.IsInteger():
  4295  		switch t.Size() {
  4296  		case 1:
  4297  			return s.constInt8(t, 0)
  4298  		case 2:
  4299  			return s.constInt16(t, 0)
  4300  		case 4:
  4301  			return s.constInt32(t, 0)
  4302  		case 8:
  4303  			return s.constInt64(t, 0)
  4304  		default:
  4305  			s.Fatalf("bad sized integer type %v", t)
  4306  		}
  4307  	case t.IsFloat():
  4308  		switch t.Size() {
  4309  		case 4:
  4310  			return s.constFloat32(t, 0)
  4311  		case 8:
  4312  			return s.constFloat64(t, 0)
  4313  		default:
  4314  			s.Fatalf("bad sized float type %v", t)
  4315  		}
  4316  	case t.IsComplex():
  4317  		switch t.Size() {
  4318  		case 8:
  4319  			z := s.constFloat32(types.Types[types.TFLOAT32], 0)
  4320  			return s.entryNewValue2(ssa.OpComplexMake, t, z, z)
  4321  		case 16:
  4322  			z := s.constFloat64(types.Types[types.TFLOAT64], 0)
  4323  			return s.entryNewValue2(ssa.OpComplexMake, t, z, z)
  4324  		default:
  4325  			s.Fatalf("bad sized complex type %v", t)
  4326  		}
  4327  
  4328  	case t.IsString():
  4329  		return s.constEmptyString(t)
  4330  	case t.IsPtrShaped():
  4331  		return s.constNil(t)
  4332  	case t.IsBoolean():
  4333  		return s.constBool(false)
  4334  	case t.IsInterface():
  4335  		return s.constInterface(t)
  4336  	case t.IsSlice():
  4337  		return s.constSlice(t)
  4338  	case t.IsStruct():
  4339  		n := t.NumFields()
  4340  		v := s.entryNewValue0(ssa.OpStructMake, t)
  4341  		for i := 0; i < n; i++ {
  4342  			v.AddArg(s.zeroVal(t.FieldType(i)))
  4343  		}
  4344  		return v
  4345  	case t.IsArray():
  4346  		switch t.NumElem() {
  4347  		case 0:
  4348  			return s.entryNewValue0(ssa.OpArrayMake0, t)
  4349  		case 1:
  4350  			return s.entryNewValue1(ssa.OpArrayMake1, t, s.zeroVal(t.Elem()))
  4351  		}
  4352  	}
  4353  	s.Fatalf("zero for type %v not implemented", t)
  4354  	return nil
  4355  }
  4356  
  4357  type callKind int8
  4358  
  4359  const (
  4360  	callNormal callKind = iota
  4361  	callDefer
  4362  	callDeferStack
  4363  	callGo
  4364  	callTail
  4365  )
  4366  
  4367  type sfRtCallDef struct {
  4368  	rtfn  *obj.LSym
  4369  	rtype types.Kind
  4370  }
  4371  
  4372  var softFloatOps map[ssa.Op]sfRtCallDef
  4373  
  4374  func softfloatInit() {
  4375  	// Some of these operations get transformed by sfcall.
  4376  	softFloatOps = map[ssa.Op]sfRtCallDef{
  4377  		ssa.OpAdd32F: {typecheck.LookupRuntimeFunc("fadd32"), types.TFLOAT32},
  4378  		ssa.OpAdd64F: {typecheck.LookupRuntimeFunc("fadd64"), types.TFLOAT64},
  4379  		ssa.OpSub32F: {typecheck.LookupRuntimeFunc("fadd32"), types.TFLOAT32},
  4380  		ssa.OpSub64F: {typecheck.LookupRuntimeFunc("fadd64"), types.TFLOAT64},
  4381  		ssa.OpMul32F: {typecheck.LookupRuntimeFunc("fmul32"), types.TFLOAT32},
  4382  		ssa.OpMul64F: {typecheck.LookupRuntimeFunc("fmul64"), types.TFLOAT64},
  4383  		ssa.OpDiv32F: {typecheck.LookupRuntimeFunc("fdiv32"), types.TFLOAT32},
  4384  		ssa.OpDiv64F: {typecheck.LookupRuntimeFunc("fdiv64"), types.TFLOAT64},
  4385  
  4386  		ssa.OpEq64F:   {typecheck.LookupRuntimeFunc("feq64"), types.TBOOL},
  4387  		ssa.OpEq32F:   {typecheck.LookupRuntimeFunc("feq32"), types.TBOOL},
  4388  		ssa.OpNeq64F:  {typecheck.LookupRuntimeFunc("feq64"), types.TBOOL},
  4389  		ssa.OpNeq32F:  {typecheck.LookupRuntimeFunc("feq32"), types.TBOOL},
  4390  		ssa.OpLess64F: {typecheck.LookupRuntimeFunc("fgt64"), types.TBOOL},
  4391  		ssa.OpLess32F: {typecheck.LookupRuntimeFunc("fgt32"), types.TBOOL},
  4392  		ssa.OpLeq64F:  {typecheck.LookupRuntimeFunc("fge64"), types.TBOOL},
  4393  		ssa.OpLeq32F:  {typecheck.LookupRuntimeFunc("fge32"), types.TBOOL},
  4394  
  4395  		ssa.OpCvt32to32F:  {typecheck.LookupRuntimeFunc("fint32to32"), types.TFLOAT32},
  4396  		ssa.OpCvt32Fto32:  {typecheck.LookupRuntimeFunc("f32toint32"), types.TINT32},
  4397  		ssa.OpCvt64to32F:  {typecheck.LookupRuntimeFunc("fint64to32"), types.TFLOAT32},
  4398  		ssa.OpCvt32Fto64:  {typecheck.LookupRuntimeFunc("f32toint64"), types.TINT64},
  4399  		ssa.OpCvt64Uto32F: {typecheck.LookupRuntimeFunc("fuint64to32"), types.TFLOAT32},
  4400  		ssa.OpCvt32Fto64U: {typecheck.LookupRuntimeFunc("f32touint64"), types.TUINT64},
  4401  		ssa.OpCvt32to64F:  {typecheck.LookupRuntimeFunc("fint32to64"), types.TFLOAT64},
  4402  		ssa.OpCvt64Fto32:  {typecheck.LookupRuntimeFunc("f64toint32"), types.TINT32},
  4403  		ssa.OpCvt64to64F:  {typecheck.LookupRuntimeFunc("fint64to64"), types.TFLOAT64},
  4404  		ssa.OpCvt64Fto64:  {typecheck.LookupRuntimeFunc("f64toint64"), types.TINT64},
  4405  		ssa.OpCvt64Uto64F: {typecheck.LookupRuntimeFunc("fuint64to64"), types.TFLOAT64},
  4406  		ssa.OpCvt64Fto64U: {typecheck.LookupRuntimeFunc("f64touint64"), types.TUINT64},
  4407  		ssa.OpCvt32Fto64F: {typecheck.LookupRuntimeFunc("f32to64"), types.TFLOAT64},
  4408  		ssa.OpCvt64Fto32F: {typecheck.LookupRuntimeFunc("f64to32"), types.TFLOAT32},
  4409  	}
  4410  }
  4411  
  4412  // TODO: do not emit sfcall if operation can be optimized to constant in later
  4413  // opt phase
  4414  func (s *state) sfcall(op ssa.Op, args ...*ssa.Value) (*ssa.Value, bool) {
  4415  	f2i := func(t *types.Type) *types.Type {
  4416  		switch t.Kind() {
  4417  		case types.TFLOAT32:
  4418  			return types.Types[types.TUINT32]
  4419  		case types.TFLOAT64:
  4420  			return types.Types[types.TUINT64]
  4421  		}
  4422  		return t
  4423  	}
  4424  
  4425  	if callDef, ok := softFloatOps[op]; ok {
  4426  		switch op {
  4427  		case ssa.OpLess32F,
  4428  			ssa.OpLess64F,
  4429  			ssa.OpLeq32F,
  4430  			ssa.OpLeq64F:
  4431  			args[0], args[1] = args[1], args[0]
  4432  		case ssa.OpSub32F,
  4433  			ssa.OpSub64F:
  4434  			args[1] = s.newValue1(s.ssaOp(ir.ONEG, types.Types[callDef.rtype]), args[1].Type, args[1])
  4435  		}
  4436  
  4437  		// runtime functions take uints for floats and returns uints.
  4438  		// Convert to uints so we use the right calling convention.
  4439  		for i, a := range args {
  4440  			if a.Type.IsFloat() {
  4441  				args[i] = s.newValue1(ssa.OpCopy, f2i(a.Type), a)
  4442  			}
  4443  		}
  4444  
  4445  		rt := types.Types[callDef.rtype]
  4446  		result := s.rtcall(callDef.rtfn, true, []*types.Type{f2i(rt)}, args...)[0]
  4447  		if rt.IsFloat() {
  4448  			result = s.newValue1(ssa.OpCopy, rt, result)
  4449  		}
  4450  		if op == ssa.OpNeq32F || op == ssa.OpNeq64F {
  4451  			result = s.newValue1(ssa.OpNot, result.Type, result)
  4452  		}
  4453  		return result, true
  4454  	}
  4455  	return nil, false
  4456  }
  4457  
  4458  // split breaks up a tuple-typed value into its 2 parts.
  4459  func (s *state) split(v *ssa.Value) (*ssa.Value, *ssa.Value) {
  4460  	p0 := s.newValue1(ssa.OpSelect0, v.Type.FieldType(0), v)
  4461  	p1 := s.newValue1(ssa.OpSelect1, v.Type.FieldType(1), v)
  4462  	return p0, p1
  4463  }
  4464  
  4465  // intrinsicCall converts a call to a recognized intrinsic function into the intrinsic SSA operation.
  4466  func (s *state) intrinsicCall(n *ir.CallExpr) *ssa.Value {
  4467  	v := findIntrinsic(n.Fun.Sym())(s, n, s.intrinsicArgs(n))
  4468  	if ssa.IntrinsicsDebug > 0 {
  4469  		x := v
  4470  		if x == nil {
  4471  			x = s.mem()
  4472  		}
  4473  		if x.Op == ssa.OpSelect0 || x.Op == ssa.OpSelect1 {
  4474  			x = x.Args[0]
  4475  		}
  4476  		base.WarnfAt(n.Pos(), "intrinsic substitution for %v with %s", n.Fun.Sym().Name, x.LongString())
  4477  	}
  4478  	return v
  4479  }
  4480  
  4481  // intrinsicArgs extracts args from n, evaluates them to SSA values, and returns them.
  4482  func (s *state) intrinsicArgs(n *ir.CallExpr) []*ssa.Value {
  4483  	args := make([]*ssa.Value, len(n.Args))
  4484  	for i, n := range n.Args {
  4485  		args[i] = s.expr(n)
  4486  	}
  4487  	return args
  4488  }
  4489  
  4490  // openDeferRecord adds code to evaluate and store the function for an open-code defer
  4491  // call, and records info about the defer, so we can generate proper code on the
  4492  // exit paths. n is the sub-node of the defer node that is the actual function
  4493  // call. We will also record funcdata information on where the function is stored
  4494  // (as well as the deferBits variable), and this will enable us to run the proper
  4495  // defer calls during panics.
  4496  func (s *state) openDeferRecord(n *ir.CallExpr) {
  4497  	if len(n.Args) != 0 || n.Op() != ir.OCALLFUNC || n.Fun.Type().NumResults() != 0 {
  4498  		s.Fatalf("defer call with arguments or results: %v", n)
  4499  	}
  4500  
  4501  	opendefer := &openDeferInfo{
  4502  		n: n,
  4503  	}
  4504  	fn := n.Fun
  4505  	// We must always store the function value in a stack slot for the
  4506  	// runtime panic code to use. But in the defer exit code, we will
  4507  	// call the function directly if it is a static function.
  4508  	closureVal := s.expr(fn)
  4509  	closure := s.openDeferSave(fn.Type(), closureVal)
  4510  	opendefer.closureNode = closure.Aux.(*ir.Name)
  4511  	if !(fn.Op() == ir.ONAME && fn.(*ir.Name).Class == ir.PFUNC) {
  4512  		opendefer.closure = closure
  4513  	}
  4514  	index := len(s.openDefers)
  4515  	s.openDefers = append(s.openDefers, opendefer)
  4516  
  4517  	// Update deferBits only after evaluation and storage to stack of
  4518  	// the function is successful.
  4519  	bitvalue := s.constInt8(types.Types[types.TUINT8], 1<<uint(index))
  4520  	newDeferBits := s.newValue2(ssa.OpOr8, types.Types[types.TUINT8], s.variable(deferBitsVar, types.Types[types.TUINT8]), bitvalue)
  4521  	s.vars[deferBitsVar] = newDeferBits
  4522  	s.store(types.Types[types.TUINT8], s.deferBitsAddr, newDeferBits)
  4523  }
  4524  
  4525  // openDeferSave generates SSA nodes to store a value (with type t) for an
  4526  // open-coded defer at an explicit autotmp location on the stack, so it can be
  4527  // reloaded and used for the appropriate call on exit. Type t must be a function type
  4528  // (therefore SSAable). val is the value to be stored. The function returns an SSA
  4529  // value representing a pointer to the autotmp location.
  4530  func (s *state) openDeferSave(t *types.Type, val *ssa.Value) *ssa.Value {
  4531  	if !ssa.CanSSA(t) {
  4532  		s.Fatalf("openDeferSave of non-SSA-able type %v val=%v", t, val)
  4533  	}
  4534  	if !t.HasPointers() {
  4535  		s.Fatalf("openDeferSave of pointerless type %v val=%v", t, val)
  4536  	}
  4537  	pos := val.Pos
  4538  	temp := typecheck.TempAt(pos.WithNotStmt(), s.curfn, t)
  4539  	temp.SetOpenDeferSlot(true)
  4540  	temp.SetFrameOffset(int64(len(s.openDefers))) // so cmpstackvarlt can order them
  4541  	var addrTemp *ssa.Value
  4542  	// Use OpVarLive to make sure stack slot for the closure is not removed by
  4543  	// dead-store elimination
  4544  	if s.curBlock.ID != s.f.Entry.ID {
  4545  		// Force the tmp storing this defer function to be declared in the entry
  4546  		// block, so that it will be live for the defer exit code (which will
  4547  		// actually access it only if the associated defer call has been activated).
  4548  		if t.HasPointers() {
  4549  			s.defvars[s.f.Entry.ID][memVar] = s.f.Entry.NewValue1A(src.NoXPos, ssa.OpVarDef, types.TypeMem, temp, s.defvars[s.f.Entry.ID][memVar])
  4550  		}
  4551  		s.defvars[s.f.Entry.ID][memVar] = s.f.Entry.NewValue1A(src.NoXPos, ssa.OpVarLive, types.TypeMem, temp, s.defvars[s.f.Entry.ID][memVar])
  4552  		addrTemp = s.f.Entry.NewValue2A(src.NoXPos, ssa.OpLocalAddr, types.NewPtr(temp.Type()), temp, s.sp, s.defvars[s.f.Entry.ID][memVar])
  4553  	} else {
  4554  		// Special case if we're still in the entry block. We can't use
  4555  		// the above code, since s.defvars[s.f.Entry.ID] isn't defined
  4556  		// until we end the entry block with s.endBlock().
  4557  		if t.HasPointers() {
  4558  			s.vars[memVar] = s.newValue1Apos(ssa.OpVarDef, types.TypeMem, temp, s.mem(), false)
  4559  		}
  4560  		s.vars[memVar] = s.newValue1Apos(ssa.OpVarLive, types.TypeMem, temp, s.mem(), false)
  4561  		addrTemp = s.newValue2Apos(ssa.OpLocalAddr, types.NewPtr(temp.Type()), temp, s.sp, s.mem(), false)
  4562  	}
  4563  	// Since we may use this temp during exit depending on the
  4564  	// deferBits, we must define it unconditionally on entry.
  4565  	// Therefore, we must make sure it is zeroed out in the entry
  4566  	// block if it contains pointers, else GC may wrongly follow an
  4567  	// uninitialized pointer value.
  4568  	temp.SetNeedzero(true)
  4569  	// We are storing to the stack, hence we can avoid the full checks in
  4570  	// storeType() (no write barrier) and do a simple store().
  4571  	s.store(t, addrTemp, val)
  4572  	return addrTemp
  4573  }
  4574  
  4575  // openDeferExit generates SSA for processing all the open coded defers at exit.
  4576  // The code involves loading deferBits, and checking each of the bits to see if
  4577  // the corresponding defer statement was executed. For each bit that is turned
  4578  // on, the associated defer call is made.
  4579  func (s *state) openDeferExit() {
  4580  	deferExit := s.f.NewBlock(ssa.BlockPlain)
  4581  	s.endBlock().AddEdgeTo(deferExit)
  4582  	s.startBlock(deferExit)
  4583  	s.lastDeferExit = deferExit
  4584  	s.lastDeferCount = len(s.openDefers)
  4585  	zeroval := s.constInt8(types.Types[types.TUINT8], 0)
  4586  	// Test for and run defers in reverse order
  4587  	for i := len(s.openDefers) - 1; i >= 0; i-- {
  4588  		r := s.openDefers[i]
  4589  		bCond := s.f.NewBlock(ssa.BlockPlain)
  4590  		bEnd := s.f.NewBlock(ssa.BlockPlain)
  4591  
  4592  		deferBits := s.variable(deferBitsVar, types.Types[types.TUINT8])
  4593  		// Generate code to check if the bit associated with the current
  4594  		// defer is set.
  4595  		bitval := s.constInt8(types.Types[types.TUINT8], 1<<uint(i))
  4596  		andval := s.newValue2(ssa.OpAnd8, types.Types[types.TUINT8], deferBits, bitval)
  4597  		eqVal := s.newValue2(ssa.OpEq8, types.Types[types.TBOOL], andval, zeroval)
  4598  		b := s.endBlock()
  4599  		b.Kind = ssa.BlockIf
  4600  		b.SetControl(eqVal)
  4601  		b.AddEdgeTo(bEnd)
  4602  		b.AddEdgeTo(bCond)
  4603  		bCond.AddEdgeTo(bEnd)
  4604  		s.startBlock(bCond)
  4605  
  4606  		// Clear this bit in deferBits and force store back to stack, so
  4607  		// we will not try to re-run this defer call if this defer call panics.
  4608  		nbitval := s.newValue1(ssa.OpCom8, types.Types[types.TUINT8], bitval)
  4609  		maskedval := s.newValue2(ssa.OpAnd8, types.Types[types.TUINT8], deferBits, nbitval)
  4610  		s.store(types.Types[types.TUINT8], s.deferBitsAddr, maskedval)
  4611  		// Use this value for following tests, so we keep previous
  4612  		// bits cleared.
  4613  		s.vars[deferBitsVar] = maskedval
  4614  
  4615  		// Generate code to call the function call of the defer, using the
  4616  		// closure that were stored in argtmps at the point of the defer
  4617  		// statement.
  4618  		fn := r.n.Fun
  4619  		stksize := fn.Type().ArgWidth()
  4620  		var callArgs []*ssa.Value
  4621  		var call *ssa.Value
  4622  		if r.closure != nil {
  4623  			v := s.load(r.closure.Type.Elem(), r.closure)
  4624  			s.maybeNilCheckClosure(v, callDefer)
  4625  			codeptr := s.rawLoad(types.Types[types.TUINTPTR], v)
  4626  			aux := ssa.ClosureAuxCall(s.f.ABIDefault.ABIAnalyzeTypes(nil, nil))
  4627  			call = s.newValue2A(ssa.OpClosureLECall, aux.LateExpansionResultType(), aux, codeptr, v)
  4628  		} else {
  4629  			aux := ssa.StaticAuxCall(fn.(*ir.Name).Linksym(), s.f.ABIDefault.ABIAnalyzeTypes(nil, nil))
  4630  			call = s.newValue0A(ssa.OpStaticLECall, aux.LateExpansionResultType(), aux)
  4631  		}
  4632  		callArgs = append(callArgs, s.mem())
  4633  		call.AddArgs(callArgs...)
  4634  		call.AuxInt = stksize
  4635  		s.vars[memVar] = s.newValue1I(ssa.OpSelectN, types.TypeMem, 0, call)
  4636  		// Make sure that the stack slots with pointers are kept live
  4637  		// through the call (which is a pre-emption point). Also, we will
  4638  		// use the first call of the last defer exit to compute liveness
  4639  		// for the deferreturn, so we want all stack slots to be live.
  4640  		if r.closureNode != nil {
  4641  			s.vars[memVar] = s.newValue1Apos(ssa.OpVarLive, types.TypeMem, r.closureNode, s.mem(), false)
  4642  		}
  4643  
  4644  		s.endBlock()
  4645  		s.startBlock(bEnd)
  4646  	}
  4647  }
  4648  
  4649  func (s *state) callResult(n *ir.CallExpr, k callKind) *ssa.Value {
  4650  	return s.call(n, k, false, nil)
  4651  }
  4652  
  4653  func (s *state) callAddr(n *ir.CallExpr, k callKind) *ssa.Value {
  4654  	return s.call(n, k, true, nil)
  4655  }
  4656  
  4657  // Calls the function n using the specified call type.
  4658  // Returns the address of the return value (or nil if none).
  4659  func (s *state) call(n *ir.CallExpr, k callKind, returnResultAddr bool, deferExtra ir.Expr) *ssa.Value {
  4660  	s.prevCall = nil
  4661  	var calleeLSym *obj.LSym // target function (if static)
  4662  	var closure *ssa.Value   // ptr to closure to run (if dynamic)
  4663  	var codeptr *ssa.Value   // ptr to target code (if dynamic)
  4664  	var dextra *ssa.Value    // defer extra arg
  4665  	var rcvr *ssa.Value      // receiver to set
  4666  	fn := n.Fun
  4667  	var ACArgs []*types.Type    // AuxCall args
  4668  	var ACResults []*types.Type // AuxCall results
  4669  	var callArgs []*ssa.Value   // For late-expansion, the args themselves (not stored, args to the call instead).
  4670  
  4671  	callABI := s.f.ABIDefault
  4672  
  4673  	if k != callNormal && k != callTail && (len(n.Args) != 0 || n.Op() == ir.OCALLINTER || n.Fun.Type().NumResults() != 0) {
  4674  		s.Fatalf("go/defer call with arguments: %v", n)
  4675  	}
  4676  
  4677  	isCallDeferRangeFunc := false
  4678  
  4679  	switch n.Op() {
  4680  	case ir.OCALLFUNC:
  4681  		if (k == callNormal || k == callTail) && fn.Op() == ir.ONAME && fn.(*ir.Name).Class == ir.PFUNC {
  4682  			fn := fn.(*ir.Name)
  4683  			calleeLSym = callTargetLSym(fn)
  4684  			if buildcfg.Experiment.RegabiArgs {
  4685  				// This is a static call, so it may be
  4686  				// a direct call to a non-ABIInternal
  4687  				// function. fn.Func may be nil for
  4688  				// some compiler-generated functions,
  4689  				// but those are all ABIInternal.
  4690  				if fn.Func != nil {
  4691  					callABI = abiForFunc(fn.Func, s.f.ABI0, s.f.ABI1)
  4692  				}
  4693  			} else {
  4694  				// TODO(register args) remove after register abi is working
  4695  				inRegistersImported := fn.Pragma()&ir.RegisterParams != 0
  4696  				inRegistersSamePackage := fn.Func != nil && fn.Func.Pragma&ir.RegisterParams != 0
  4697  				if inRegistersImported || inRegistersSamePackage {
  4698  					callABI = s.f.ABI1
  4699  				}
  4700  			}
  4701  			if fn := n.Fun.Sym().Name; n.Fun.Sym().Pkg == ir.Pkgs.Runtime && fn == "deferrangefunc" {
  4702  				isCallDeferRangeFunc = true
  4703  			}
  4704  			break
  4705  		}
  4706  		closure = s.expr(fn)
  4707  		if k != callDefer && k != callDeferStack {
  4708  			// Deferred nil function needs to panic when the function is invoked,
  4709  			// not the point of defer statement.
  4710  			s.maybeNilCheckClosure(closure, k)
  4711  		}
  4712  	case ir.OCALLINTER:
  4713  		if fn.Op() != ir.ODOTINTER {
  4714  			s.Fatalf("OCALLINTER: n.Left not an ODOTINTER: %v", fn.Op())
  4715  		}
  4716  		fn := fn.(*ir.SelectorExpr)
  4717  		var iclosure *ssa.Value
  4718  		iclosure, rcvr = s.getClosureAndRcvr(fn)
  4719  		if k == callNormal {
  4720  			codeptr = s.load(types.Types[types.TUINTPTR], iclosure)
  4721  		} else {
  4722  			closure = iclosure
  4723  		}
  4724  	}
  4725  	if deferExtra != nil {
  4726  		dextra = s.expr(deferExtra)
  4727  	}
  4728  
  4729  	params := callABI.ABIAnalyze(n.Fun.Type(), false /* Do not set (register) nNames from caller side -- can cause races. */)
  4730  	types.CalcSize(fn.Type())
  4731  	stksize := params.ArgWidth() // includes receiver, args, and results
  4732  
  4733  	res := n.Fun.Type().Results()
  4734  	if k == callNormal || k == callTail {
  4735  		for _, p := range params.OutParams() {
  4736  			ACResults = append(ACResults, p.Type)
  4737  		}
  4738  	}
  4739  
  4740  	var call *ssa.Value
  4741  	if k == callDeferStack {
  4742  		if stksize != 0 {
  4743  			s.Fatalf("deferprocStack with non-zero stack size %d: %v", stksize, n)
  4744  		}
  4745  		// Make a defer struct on the stack.
  4746  		t := deferstruct()
  4747  		n, addr := s.temp(n.Pos(), t)
  4748  		n.SetNonMergeable(true)
  4749  		s.store(closure.Type,
  4750  			s.newValue1I(ssa.OpOffPtr, closure.Type.PtrTo(), t.FieldOff(deferStructFnField), addr),
  4751  			closure)
  4752  
  4753  		// Call runtime.deferprocStack with pointer to _defer record.
  4754  		ACArgs = append(ACArgs, types.Types[types.TUINTPTR])
  4755  		aux := ssa.StaticAuxCall(ir.Syms.DeferprocStack, s.f.ABIDefault.ABIAnalyzeTypes(ACArgs, ACResults))
  4756  		callArgs = append(callArgs, addr, s.mem())
  4757  		call = s.newValue0A(ssa.OpStaticLECall, aux.LateExpansionResultType(), aux)
  4758  		call.AddArgs(callArgs...)
  4759  		call.AuxInt = int64(types.PtrSize) // deferprocStack takes a *_defer arg
  4760  	} else {
  4761  		// Store arguments to stack, including defer/go arguments and receiver for method calls.
  4762  		// These are written in SP-offset order.
  4763  		argStart := base.Ctxt.Arch.FixedFrameSize
  4764  		// Defer/go args.
  4765  		if k != callNormal && k != callTail {
  4766  			// Write closure (arg to newproc/deferproc).
  4767  			ACArgs = append(ACArgs, types.Types[types.TUINTPTR]) // not argExtra
  4768  			callArgs = append(callArgs, closure)
  4769  			stksize += int64(types.PtrSize)
  4770  			argStart += int64(types.PtrSize)
  4771  			if dextra != nil {
  4772  				// Extra token of type any for deferproc
  4773  				ACArgs = append(ACArgs, types.Types[types.TINTER])
  4774  				callArgs = append(callArgs, dextra)
  4775  				stksize += 2 * int64(types.PtrSize)
  4776  				argStart += 2 * int64(types.PtrSize)
  4777  			}
  4778  		}
  4779  
  4780  		// Set receiver (for interface calls).
  4781  		if rcvr != nil {
  4782  			callArgs = append(callArgs, rcvr)
  4783  		}
  4784  
  4785  		// Write args.
  4786  		t := n.Fun.Type()
  4787  		args := n.Args
  4788  
  4789  		for _, p := range params.InParams() { // includes receiver for interface calls
  4790  			ACArgs = append(ACArgs, p.Type)
  4791  		}
  4792  
  4793  		// Split the entry block if there are open defers, because later calls to
  4794  		// openDeferSave may cause a mismatch between the mem for an OpDereference
  4795  		// and the call site which uses it. See #49282.
  4796  		if s.curBlock.ID == s.f.Entry.ID && s.hasOpenDefers {
  4797  			b := s.endBlock()
  4798  			b.Kind = ssa.BlockPlain
  4799  			curb := s.f.NewBlock(ssa.BlockPlain)
  4800  			b.AddEdgeTo(curb)
  4801  			s.startBlock(curb)
  4802  		}
  4803  
  4804  		for i, n := range args {
  4805  			callArgs = append(callArgs, s.putArg(n, t.Param(i).Type))
  4806  		}
  4807  
  4808  		callArgs = append(callArgs, s.mem())
  4809  
  4810  		// call target
  4811  		switch {
  4812  		case k == callDefer:
  4813  			sym := ir.Syms.Deferproc
  4814  			if dextra != nil {
  4815  				sym = ir.Syms.Deferprocat
  4816  			}
  4817  			aux := ssa.StaticAuxCall(sym, s.f.ABIDefault.ABIAnalyzeTypes(ACArgs, ACResults)) // TODO paramResultInfo for Deferproc(at)
  4818  			call = s.newValue0A(ssa.OpStaticLECall, aux.LateExpansionResultType(), aux)
  4819  		case k == callGo:
  4820  			aux := ssa.StaticAuxCall(ir.Syms.Newproc, s.f.ABIDefault.ABIAnalyzeTypes(ACArgs, ACResults))
  4821  			call = s.newValue0A(ssa.OpStaticLECall, aux.LateExpansionResultType(), aux) // TODO paramResultInfo for Newproc
  4822  		case closure != nil:
  4823  			// rawLoad because loading the code pointer from a
  4824  			// closure is always safe, but IsSanitizerSafeAddr
  4825  			// can't always figure that out currently, and it's
  4826  			// critical that we not clobber any arguments already
  4827  			// stored onto the stack.
  4828  			codeptr = s.rawLoad(types.Types[types.TUINTPTR], closure)
  4829  			aux := ssa.ClosureAuxCall(callABI.ABIAnalyzeTypes(ACArgs, ACResults))
  4830  			call = s.newValue2A(ssa.OpClosureLECall, aux.LateExpansionResultType(), aux, codeptr, closure)
  4831  		case codeptr != nil:
  4832  			// Note that the "receiver" parameter is nil because the actual receiver is the first input parameter.
  4833  			aux := ssa.InterfaceAuxCall(params)
  4834  			call = s.newValue1A(ssa.OpInterLECall, aux.LateExpansionResultType(), aux, codeptr)
  4835  		case calleeLSym != nil:
  4836  			aux := ssa.StaticAuxCall(calleeLSym, params)
  4837  			call = s.newValue0A(ssa.OpStaticLECall, aux.LateExpansionResultType(), aux)
  4838  			if k == callTail {
  4839  				call.Op = ssa.OpTailLECall
  4840  				stksize = 0 // Tail call does not use stack. We reuse caller's frame.
  4841  			}
  4842  		default:
  4843  			s.Fatalf("bad call type %v %v", n.Op(), n)
  4844  		}
  4845  		call.AddArgs(callArgs...)
  4846  		call.AuxInt = stksize // Call operations carry the argsize of the callee along with them
  4847  	}
  4848  	s.prevCall = call
  4849  	s.vars[memVar] = s.newValue1I(ssa.OpSelectN, types.TypeMem, int64(len(ACResults)), call)
  4850  	// Insert VarLive opcodes.
  4851  	for _, v := range n.KeepAlive {
  4852  		if !v.Addrtaken() {
  4853  			s.Fatalf("KeepAlive variable %v must have Addrtaken set", v)
  4854  		}
  4855  		switch v.Class {
  4856  		case ir.PAUTO, ir.PPARAM, ir.PPARAMOUT:
  4857  		default:
  4858  			s.Fatalf("KeepAlive variable %v must be Auto or Arg", v)
  4859  		}
  4860  		s.vars[memVar] = s.newValue1A(ssa.OpVarLive, types.TypeMem, v, s.mem())
  4861  	}
  4862  
  4863  	// Finish block for defers
  4864  	if k == callDefer || k == callDeferStack || isCallDeferRangeFunc {
  4865  		b := s.endBlock()
  4866  		b.Kind = ssa.BlockDefer
  4867  		b.SetControl(call)
  4868  		bNext := s.f.NewBlock(ssa.BlockPlain)
  4869  		b.AddEdgeTo(bNext)
  4870  		r := s.f.DeferReturn // Share a single deferreturn among all defers
  4871  		if r == nil {
  4872  			r = s.f.NewBlock(ssa.BlockPlain)
  4873  			s.startBlock(r)
  4874  			s.exit()
  4875  			s.f.DeferReturn = r
  4876  		}
  4877  		b.AddEdgeTo(r) // Add recover edge to exit code.  This is a fake edge to keep the block live.
  4878  		b.Likely = ssa.BranchLikely
  4879  		s.startBlock(bNext)
  4880  	}
  4881  
  4882  	if len(res) == 0 || k != callNormal {
  4883  		// call has no return value. Continue with the next statement.
  4884  		return nil
  4885  	}
  4886  	fp := res[0]
  4887  	if returnResultAddr {
  4888  		return s.resultAddrOfCall(call, 0, fp.Type)
  4889  	}
  4890  	return s.newValue1I(ssa.OpSelectN, fp.Type, 0, call)
  4891  }
  4892  
  4893  // maybeNilCheckClosure checks if a nil check of a closure is needed in some
  4894  // architecture-dependent situations and, if so, emits the nil check.
  4895  func (s *state) maybeNilCheckClosure(closure *ssa.Value, k callKind) {
  4896  	if Arch.LinkArch.Family == sys.Wasm || buildcfg.GOOS == "aix" && k != callGo {
  4897  		// On AIX, the closure needs to be verified as fn can be nil, except if it's a call go. This needs to be handled by the runtime to have the "go of nil func value" error.
  4898  		// TODO(neelance): On other architectures this should be eliminated by the optimization steps
  4899  		s.nilCheck(closure)
  4900  	}
  4901  }
  4902  
  4903  // getClosureAndRcvr returns values for the appropriate closure and receiver of an
  4904  // interface call
  4905  func (s *state) getClosureAndRcvr(fn *ir.SelectorExpr) (*ssa.Value, *ssa.Value) {
  4906  	i := s.expr(fn.X)
  4907  	itab := s.newValue1(ssa.OpITab, types.Types[types.TUINTPTR], i)
  4908  	s.nilCheck(itab)
  4909  	itabidx := fn.Offset() + rttype.ITab.OffsetOf("Fun")
  4910  	closure := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.UintptrPtr, itabidx, itab)
  4911  	rcvr := s.newValue1(ssa.OpIData, s.f.Config.Types.BytePtr, i)
  4912  	return closure, rcvr
  4913  }
  4914  
  4915  // etypesign returns the signed-ness of e, for integer/pointer etypes.
  4916  // -1 means signed, +1 means unsigned, 0 means non-integer/non-pointer.
  4917  func etypesign(e types.Kind) int8 {
  4918  	switch e {
  4919  	case types.TINT8, types.TINT16, types.TINT32, types.TINT64, types.TINT:
  4920  		return -1
  4921  	case types.TUINT8, types.TUINT16, types.TUINT32, types.TUINT64, types.TUINT, types.TUINTPTR, types.TUNSAFEPTR:
  4922  		return +1
  4923  	}
  4924  	return 0
  4925  }
  4926  
  4927  // addr converts the address of the expression n to SSA, adds it to s and returns the SSA result.
  4928  // The value that the returned Value represents is guaranteed to be non-nil.
  4929  func (s *state) addr(n ir.Node) *ssa.Value {
  4930  	if n.Op() != ir.ONAME {
  4931  		s.pushLine(n.Pos())
  4932  		defer s.popLine()
  4933  	}
  4934  
  4935  	if s.canSSA(n) {
  4936  		s.Fatalf("addr of canSSA expression: %+v", n)
  4937  	}
  4938  
  4939  	t := types.NewPtr(n.Type())
  4940  	linksymOffset := func(lsym *obj.LSym, offset int64) *ssa.Value {
  4941  		v := s.entryNewValue1A(ssa.OpAddr, t, lsym, s.sb)
  4942  		// TODO: Make OpAddr use AuxInt as well as Aux.
  4943  		if offset != 0 {
  4944  			v = s.entryNewValue1I(ssa.OpOffPtr, v.Type, offset, v)
  4945  		}
  4946  		return v
  4947  	}
  4948  	switch n.Op() {
  4949  	case ir.OLINKSYMOFFSET:
  4950  		no := n.(*ir.LinksymOffsetExpr)
  4951  		return linksymOffset(no.Linksym, no.Offset_)
  4952  	case ir.ONAME:
  4953  		n := n.(*ir.Name)
  4954  		if n.Heapaddr != nil {
  4955  			return s.expr(n.Heapaddr)
  4956  		}
  4957  		switch n.Class {
  4958  		case ir.PEXTERN:
  4959  			// global variable
  4960  			return linksymOffset(n.Linksym(), 0)
  4961  		case ir.PPARAM:
  4962  			// parameter slot
  4963  			v := s.decladdrs[n]
  4964  			if v != nil {
  4965  				return v
  4966  			}
  4967  			s.Fatalf("addr of undeclared ONAME %v. declared: %v", n, s.decladdrs)
  4968  			return nil
  4969  		case ir.PAUTO:
  4970  			return s.newValue2Apos(ssa.OpLocalAddr, t, n, s.sp, s.mem(), !ir.IsAutoTmp(n))
  4971  
  4972  		case ir.PPARAMOUT: // Same as PAUTO -- cannot generate LEA early.
  4973  			// ensure that we reuse symbols for out parameters so
  4974  			// that cse works on their addresses
  4975  			return s.newValue2Apos(ssa.OpLocalAddr, t, n, s.sp, s.mem(), true)
  4976  		default:
  4977  			s.Fatalf("variable address class %v not implemented", n.Class)
  4978  			return nil
  4979  		}
  4980  	case ir.ORESULT:
  4981  		// load return from callee
  4982  		n := n.(*ir.ResultExpr)
  4983  		return s.resultAddrOfCall(s.prevCall, n.Index, n.Type())
  4984  	case ir.OINDEX:
  4985  		n := n.(*ir.IndexExpr)
  4986  		if n.X.Type().IsSlice() {
  4987  			a := s.expr(n.X)
  4988  			i := s.expr(n.Index)
  4989  			len := s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], a)
  4990  			i = s.boundsCheck(i, len, ssa.BoundsIndex, n.Bounded())
  4991  			p := s.newValue1(ssa.OpSlicePtr, t, a)
  4992  			return s.newValue2(ssa.OpPtrIndex, t, p, i)
  4993  		} else { // array
  4994  			a := s.addr(n.X)
  4995  			i := s.expr(n.Index)
  4996  			len := s.constInt(types.Types[types.TINT], n.X.Type().NumElem())
  4997  			i = s.boundsCheck(i, len, ssa.BoundsIndex, n.Bounded())
  4998  			return s.newValue2(ssa.OpPtrIndex, types.NewPtr(n.X.Type().Elem()), a, i)
  4999  		}
  5000  	case ir.ODEREF:
  5001  		n := n.(*ir.StarExpr)
  5002  		return s.exprPtr(n.X, n.Bounded(), n.Pos())
  5003  	case ir.ODOT:
  5004  		n := n.(*ir.SelectorExpr)
  5005  		p := s.addr(n.X)
  5006  		return s.newValue1I(ssa.OpOffPtr, t, n.Offset(), p)
  5007  	case ir.ODOTPTR:
  5008  		n := n.(*ir.SelectorExpr)
  5009  		p := s.exprPtr(n.X, n.Bounded(), n.Pos())
  5010  		return s.newValue1I(ssa.OpOffPtr, t, n.Offset(), p)
  5011  	case ir.OCONVNOP:
  5012  		n := n.(*ir.ConvExpr)
  5013  		if n.Type() == n.X.Type() {
  5014  			return s.addr(n.X)
  5015  		}
  5016  		addr := s.addr(n.X)
  5017  		return s.newValue1(ssa.OpCopy, t, addr) // ensure that addr has the right type
  5018  	case ir.OCALLFUNC, ir.OCALLINTER:
  5019  		n := n.(*ir.CallExpr)
  5020  		return s.callAddr(n, callNormal)
  5021  	case ir.ODOTTYPE, ir.ODYNAMICDOTTYPE:
  5022  		var v *ssa.Value
  5023  		if n.Op() == ir.ODOTTYPE {
  5024  			v, _ = s.dottype(n.(*ir.TypeAssertExpr), false)
  5025  		} else {
  5026  			v, _ = s.dynamicDottype(n.(*ir.DynamicTypeAssertExpr), false)
  5027  		}
  5028  		if v.Op != ssa.OpLoad {
  5029  			s.Fatalf("dottype of non-load")
  5030  		}
  5031  		if v.Args[1] != s.mem() {
  5032  			s.Fatalf("memory no longer live from dottype load")
  5033  		}
  5034  		return v.Args[0]
  5035  	default:
  5036  		s.Fatalf("unhandled addr %v", n.Op())
  5037  		return nil
  5038  	}
  5039  }
  5040  
  5041  // canSSA reports whether n is SSA-able.
  5042  // n must be an ONAME (or an ODOT sequence with an ONAME base).
  5043  func (s *state) canSSA(n ir.Node) bool {
  5044  	if base.Flag.N != 0 {
  5045  		return false
  5046  	}
  5047  	for {
  5048  		nn := n
  5049  		if nn.Op() == ir.ODOT {
  5050  			nn := nn.(*ir.SelectorExpr)
  5051  			n = nn.X
  5052  			continue
  5053  		}
  5054  		if nn.Op() == ir.OINDEX {
  5055  			nn := nn.(*ir.IndexExpr)
  5056  			if nn.X.Type().IsArray() {
  5057  				n = nn.X
  5058  				continue
  5059  			}
  5060  		}
  5061  		break
  5062  	}
  5063  	if n.Op() != ir.ONAME {
  5064  		return false
  5065  	}
  5066  	return s.canSSAName(n.(*ir.Name)) && ssa.CanSSA(n.Type())
  5067  }
  5068  
  5069  func (s *state) canSSAName(name *ir.Name) bool {
  5070  	if name.Addrtaken() || !name.OnStack() {
  5071  		return false
  5072  	}
  5073  	switch name.Class {
  5074  	case ir.PPARAMOUT:
  5075  		if s.hasdefer {
  5076  			// TODO: handle this case? Named return values must be
  5077  			// in memory so that the deferred function can see them.
  5078  			// Maybe do: if !strings.HasPrefix(n.String(), "~") { return false }
  5079  			// Or maybe not, see issue 18860.  Even unnamed return values
  5080  			// must be written back so if a defer recovers, the caller can see them.
  5081  			return false
  5082  		}
  5083  		if s.cgoUnsafeArgs {
  5084  			// Cgo effectively takes the address of all result args,
  5085  			// but the compiler can't see that.
  5086  			return false
  5087  		}
  5088  	}
  5089  	return true
  5090  	// TODO: try to make more variables SSAable?
  5091  }
  5092  
  5093  // exprPtr evaluates n to a pointer and nil-checks it.
  5094  func (s *state) exprPtr(n ir.Node, bounded bool, lineno src.XPos) *ssa.Value {
  5095  	p := s.expr(n)
  5096  	if bounded || n.NonNil() {
  5097  		if s.f.Frontend().Debug_checknil() && lineno.Line() > 1 {
  5098  			s.f.Warnl(lineno, "removed nil check")
  5099  		}
  5100  		return p
  5101  	}
  5102  	p = s.nilCheck(p)
  5103  	return p
  5104  }
  5105  
  5106  // nilCheck generates nil pointer checking code.
  5107  // Used only for automatically inserted nil checks,
  5108  // not for user code like 'x != nil'.
  5109  // Returns a "definitely not nil" copy of x to ensure proper ordering
  5110  // of the uses of the post-nilcheck pointer.
  5111  func (s *state) nilCheck(ptr *ssa.Value) *ssa.Value {
  5112  	if base.Debug.DisableNil != 0 || s.curfn.NilCheckDisabled() {
  5113  		return ptr
  5114  	}
  5115  	return s.newValue2(ssa.OpNilCheck, ptr.Type, ptr, s.mem())
  5116  }
  5117  
  5118  // boundsCheck generates bounds checking code. Checks if 0 <= idx <[=] len, branches to exit if not.
  5119  // Starts a new block on return.
  5120  // On input, len must be converted to full int width and be nonnegative.
  5121  // Returns idx converted to full int width.
  5122  // If bounded is true then caller guarantees the index is not out of bounds
  5123  // (but boundsCheck will still extend the index to full int width).
  5124  func (s *state) boundsCheck(idx, len *ssa.Value, kind ssa.BoundsKind, bounded bool) *ssa.Value {
  5125  	idx = s.extendIndex(idx, len, kind, bounded)
  5126  
  5127  	if bounded || base.Flag.B != 0 {
  5128  		// If bounded or bounds checking is flag-disabled, then no check necessary,
  5129  		// just return the extended index.
  5130  		//
  5131  		// Here, bounded == true if the compiler generated the index itself,
  5132  		// such as in the expansion of a slice initializer. These indexes are
  5133  		// compiler-generated, not Go program variables, so they cannot be
  5134  		// attacker-controlled, so we can omit Spectre masking as well.
  5135  		//
  5136  		// Note that we do not want to omit Spectre masking in code like:
  5137  		//
  5138  		//	if 0 <= i && i < len(x) {
  5139  		//		use(x[i])
  5140  		//	}
  5141  		//
  5142  		// Lucky for us, bounded==false for that code.
  5143  		// In that case (handled below), we emit a bound check (and Spectre mask)
  5144  		// and then the prove pass will remove the bounds check.
  5145  		// In theory the prove pass could potentially remove certain
  5146  		// Spectre masks, but it's very delicate and probably better
  5147  		// to be conservative and leave them all in.
  5148  		return idx
  5149  	}
  5150  
  5151  	bNext := s.f.NewBlock(ssa.BlockPlain)
  5152  	bPanic := s.f.NewBlock(ssa.BlockExit)
  5153  
  5154  	if !idx.Type.IsSigned() {
  5155  		switch kind {
  5156  		case ssa.BoundsIndex:
  5157  			kind = ssa.BoundsIndexU
  5158  		case ssa.BoundsSliceAlen:
  5159  			kind = ssa.BoundsSliceAlenU
  5160  		case ssa.BoundsSliceAcap:
  5161  			kind = ssa.BoundsSliceAcapU
  5162  		case ssa.BoundsSliceB:
  5163  			kind = ssa.BoundsSliceBU
  5164  		case ssa.BoundsSlice3Alen:
  5165  			kind = ssa.BoundsSlice3AlenU
  5166  		case ssa.BoundsSlice3Acap:
  5167  			kind = ssa.BoundsSlice3AcapU
  5168  		case ssa.BoundsSlice3B:
  5169  			kind = ssa.BoundsSlice3BU
  5170  		case ssa.BoundsSlice3C:
  5171  			kind = ssa.BoundsSlice3CU
  5172  		}
  5173  	}
  5174  
  5175  	var cmp *ssa.Value
  5176  	if kind == ssa.BoundsIndex || kind == ssa.BoundsIndexU {
  5177  		cmp = s.newValue2(ssa.OpIsInBounds, types.Types[types.TBOOL], idx, len)
  5178  	} else {
  5179  		cmp = s.newValue2(ssa.OpIsSliceInBounds, types.Types[types.TBOOL], idx, len)
  5180  	}
  5181  	b := s.endBlock()
  5182  	b.Kind = ssa.BlockIf
  5183  	b.SetControl(cmp)
  5184  	b.Likely = ssa.BranchLikely
  5185  	b.AddEdgeTo(bNext)
  5186  	b.AddEdgeTo(bPanic)
  5187  
  5188  	s.startBlock(bPanic)
  5189  	if Arch.LinkArch.Family == sys.Wasm {
  5190  		// TODO(khr): figure out how to do "register" based calling convention for bounds checks.
  5191  		// Should be similar to gcWriteBarrier, but I can't make it work.
  5192  		s.rtcall(BoundsCheckFunc[kind], false, nil, idx, len)
  5193  	} else {
  5194  		mem := s.newValue3I(ssa.OpPanicBounds, types.TypeMem, int64(kind), idx, len, s.mem())
  5195  		s.endBlock().SetControl(mem)
  5196  	}
  5197  	s.startBlock(bNext)
  5198  
  5199  	// In Spectre index mode, apply an appropriate mask to avoid speculative out-of-bounds accesses.
  5200  	if base.Flag.Cfg.SpectreIndex {
  5201  		op := ssa.OpSpectreIndex
  5202  		if kind != ssa.BoundsIndex && kind != ssa.BoundsIndexU {
  5203  			op = ssa.OpSpectreSliceIndex
  5204  		}
  5205  		idx = s.newValue2(op, types.Types[types.TINT], idx, len)
  5206  	}
  5207  
  5208  	return idx
  5209  }
  5210  
  5211  // If cmp (a bool) is false, panic using the given function.
  5212  func (s *state) check(cmp *ssa.Value, fn *obj.LSym) {
  5213  	b := s.endBlock()
  5214  	b.Kind = ssa.BlockIf
  5215  	b.SetControl(cmp)
  5216  	b.Likely = ssa.BranchLikely
  5217  	bNext := s.f.NewBlock(ssa.BlockPlain)
  5218  	line := s.peekPos()
  5219  	pos := base.Ctxt.PosTable.Pos(line)
  5220  	fl := funcLine{f: fn, base: pos.Base(), line: pos.Line()}
  5221  	bPanic := s.panics[fl]
  5222  	if bPanic == nil {
  5223  		bPanic = s.f.NewBlock(ssa.BlockPlain)
  5224  		s.panics[fl] = bPanic
  5225  		s.startBlock(bPanic)
  5226  		// The panic call takes/returns memory to ensure that the right
  5227  		// memory state is observed if the panic happens.
  5228  		s.rtcall(fn, false, nil)
  5229  	}
  5230  	b.AddEdgeTo(bNext)
  5231  	b.AddEdgeTo(bPanic)
  5232  	s.startBlock(bNext)
  5233  }
  5234  
  5235  func (s *state) intDivide(n ir.Node, a, b *ssa.Value) *ssa.Value {
  5236  	needcheck := true
  5237  	switch b.Op {
  5238  	case ssa.OpConst8, ssa.OpConst16, ssa.OpConst32, ssa.OpConst64:
  5239  		if b.AuxInt != 0 {
  5240  			needcheck = false
  5241  		}
  5242  	}
  5243  	if needcheck {
  5244  		// do a size-appropriate check for zero
  5245  		cmp := s.newValue2(s.ssaOp(ir.ONE, n.Type()), types.Types[types.TBOOL], b, s.zeroVal(n.Type()))
  5246  		s.check(cmp, ir.Syms.Panicdivide)
  5247  	}
  5248  	return s.newValue2(s.ssaOp(n.Op(), n.Type()), a.Type, a, b)
  5249  }
  5250  
  5251  // rtcall issues a call to the given runtime function fn with the listed args.
  5252  // Returns a slice of results of the given result types.
  5253  // The call is added to the end of the current block.
  5254  // If returns is false, the block is marked as an exit block.
  5255  func (s *state) rtcall(fn *obj.LSym, returns bool, results []*types.Type, args ...*ssa.Value) []*ssa.Value {
  5256  	s.prevCall = nil
  5257  	// Write args to the stack
  5258  	off := base.Ctxt.Arch.FixedFrameSize
  5259  	var callArgs []*ssa.Value
  5260  	var callArgTypes []*types.Type
  5261  
  5262  	for _, arg := range args {
  5263  		t := arg.Type
  5264  		off = types.RoundUp(off, t.Alignment())
  5265  		size := t.Size()
  5266  		callArgs = append(callArgs, arg)
  5267  		callArgTypes = append(callArgTypes, t)
  5268  		off += size
  5269  	}
  5270  	off = types.RoundUp(off, int64(types.RegSize))
  5271  
  5272  	// Issue call
  5273  	var call *ssa.Value
  5274  	aux := ssa.StaticAuxCall(fn, s.f.ABIDefault.ABIAnalyzeTypes(callArgTypes, results))
  5275  	callArgs = append(callArgs, s.mem())
  5276  	call = s.newValue0A(ssa.OpStaticLECall, aux.LateExpansionResultType(), aux)
  5277  	call.AddArgs(callArgs...)
  5278  	s.vars[memVar] = s.newValue1I(ssa.OpSelectN, types.TypeMem, int64(len(results)), call)
  5279  
  5280  	if !returns {
  5281  		// Finish block
  5282  		b := s.endBlock()
  5283  		b.Kind = ssa.BlockExit
  5284  		b.SetControl(call)
  5285  		call.AuxInt = off - base.Ctxt.Arch.FixedFrameSize
  5286  		if len(results) > 0 {
  5287  			s.Fatalf("panic call can't have results")
  5288  		}
  5289  		return nil
  5290  	}
  5291  
  5292  	// Load results
  5293  	res := make([]*ssa.Value, len(results))
  5294  	for i, t := range results {
  5295  		off = types.RoundUp(off, t.Alignment())
  5296  		res[i] = s.resultOfCall(call, int64(i), t)
  5297  		off += t.Size()
  5298  	}
  5299  	off = types.RoundUp(off, int64(types.PtrSize))
  5300  
  5301  	// Remember how much callee stack space we needed.
  5302  	call.AuxInt = off
  5303  
  5304  	return res
  5305  }
  5306  
  5307  // do *left = right for type t.
  5308  func (s *state) storeType(t *types.Type, left, right *ssa.Value, skip skipMask, leftIsStmt bool) {
  5309  	s.instrument(t, left, instrumentWrite)
  5310  
  5311  	if skip == 0 && (!t.HasPointers() || ssa.IsStackAddr(left)) {
  5312  		// Known to not have write barrier. Store the whole type.
  5313  		s.vars[memVar] = s.newValue3Apos(ssa.OpStore, types.TypeMem, t, left, right, s.mem(), leftIsStmt)
  5314  		return
  5315  	}
  5316  
  5317  	// store scalar fields first, so write barrier stores for
  5318  	// pointer fields can be grouped together, and scalar values
  5319  	// don't need to be live across the write barrier call.
  5320  	// TODO: if the writebarrier pass knows how to reorder stores,
  5321  	// we can do a single store here as long as skip==0.
  5322  	s.storeTypeScalars(t, left, right, skip)
  5323  	if skip&skipPtr == 0 && t.HasPointers() {
  5324  		s.storeTypePtrs(t, left, right)
  5325  	}
  5326  }
  5327  
  5328  // do *left = right for all scalar (non-pointer) parts of t.
  5329  func (s *state) storeTypeScalars(t *types.Type, left, right *ssa.Value, skip skipMask) {
  5330  	switch {
  5331  	case t.IsBoolean() || t.IsInteger() || t.IsFloat() || t.IsComplex():
  5332  		s.store(t, left, right)
  5333  	case t.IsPtrShaped():
  5334  		if t.IsPtr() && t.Elem().NotInHeap() {
  5335  			s.store(t, left, right) // see issue 42032
  5336  		}
  5337  		// otherwise, no scalar fields.
  5338  	case t.IsString():
  5339  		if skip&skipLen != 0 {
  5340  			return
  5341  		}
  5342  		len := s.newValue1(ssa.OpStringLen, types.Types[types.TINT], right)
  5343  		lenAddr := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.IntPtr, s.config.PtrSize, left)
  5344  		s.store(types.Types[types.TINT], lenAddr, len)
  5345  	case t.IsSlice():
  5346  		if skip&skipLen == 0 {
  5347  			len := s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], right)
  5348  			lenAddr := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.IntPtr, s.config.PtrSize, left)
  5349  			s.store(types.Types[types.TINT], lenAddr, len)
  5350  		}
  5351  		if skip&skipCap == 0 {
  5352  			cap := s.newValue1(ssa.OpSliceCap, types.Types[types.TINT], right)
  5353  			capAddr := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.IntPtr, 2*s.config.PtrSize, left)
  5354  			s.store(types.Types[types.TINT], capAddr, cap)
  5355  		}
  5356  	case t.IsInterface():
  5357  		// itab field doesn't need a write barrier (even though it is a pointer).
  5358  		itab := s.newValue1(ssa.OpITab, s.f.Config.Types.BytePtr, right)
  5359  		s.store(types.Types[types.TUINTPTR], left, itab)
  5360  	case t.IsStruct():
  5361  		n := t.NumFields()
  5362  		for i := 0; i < n; i++ {
  5363  			ft := t.FieldType(i)
  5364  			addr := s.newValue1I(ssa.OpOffPtr, ft.PtrTo(), t.FieldOff(i), left)
  5365  			val := s.newValue1I(ssa.OpStructSelect, ft, int64(i), right)
  5366  			s.storeTypeScalars(ft, addr, val, 0)
  5367  		}
  5368  	case t.IsArray() && t.NumElem() == 0:
  5369  		// nothing
  5370  	case t.IsArray() && t.NumElem() == 1:
  5371  		s.storeTypeScalars(t.Elem(), left, s.newValue1I(ssa.OpArraySelect, t.Elem(), 0, right), 0)
  5372  	default:
  5373  		s.Fatalf("bad write barrier type %v", t)
  5374  	}
  5375  }
  5376  
  5377  // do *left = right for all pointer parts of t.
  5378  func (s *state) storeTypePtrs(t *types.Type, left, right *ssa.Value) {
  5379  	switch {
  5380  	case t.IsPtrShaped():
  5381  		if t.IsPtr() && t.Elem().NotInHeap() {
  5382  			break // see issue 42032
  5383  		}
  5384  		s.store(t, left, right)
  5385  	case t.IsString():
  5386  		ptr := s.newValue1(ssa.OpStringPtr, s.f.Config.Types.BytePtr, right)
  5387  		s.store(s.f.Config.Types.BytePtr, left, ptr)
  5388  	case t.IsSlice():
  5389  		elType := types.NewPtr(t.Elem())
  5390  		ptr := s.newValue1(ssa.OpSlicePtr, elType, right)
  5391  		s.store(elType, left, ptr)
  5392  	case t.IsInterface():
  5393  		// itab field is treated as a scalar.
  5394  		idata := s.newValue1(ssa.OpIData, s.f.Config.Types.BytePtr, right)
  5395  		idataAddr := s.newValue1I(ssa.OpOffPtr, s.f.Config.Types.BytePtrPtr, s.config.PtrSize, left)
  5396  		s.store(s.f.Config.Types.BytePtr, idataAddr, idata)
  5397  	case t.IsStruct():
  5398  		n := t.NumFields()
  5399  		for i := 0; i < n; i++ {
  5400  			ft := t.FieldType(i)
  5401  			if !ft.HasPointers() {
  5402  				continue
  5403  			}
  5404  			addr := s.newValue1I(ssa.OpOffPtr, ft.PtrTo(), t.FieldOff(i), left)
  5405  			val := s.newValue1I(ssa.OpStructSelect, ft, int64(i), right)
  5406  			s.storeTypePtrs(ft, addr, val)
  5407  		}
  5408  	case t.IsArray() && t.NumElem() == 0:
  5409  		// nothing
  5410  	case t.IsArray() && t.NumElem() == 1:
  5411  		s.storeTypePtrs(t.Elem(), left, s.newValue1I(ssa.OpArraySelect, t.Elem(), 0, right))
  5412  	default:
  5413  		s.Fatalf("bad write barrier type %v", t)
  5414  	}
  5415  }
  5416  
  5417  // putArg evaluates n for the purpose of passing it as an argument to a function and returns the value for the call.
  5418  func (s *state) putArg(n ir.Node, t *types.Type) *ssa.Value {
  5419  	var a *ssa.Value
  5420  	if !ssa.CanSSA(t) {
  5421  		a = s.newValue2(ssa.OpDereference, t, s.addr(n), s.mem())
  5422  	} else {
  5423  		a = s.expr(n)
  5424  	}
  5425  	return a
  5426  }
  5427  
  5428  func (s *state) storeArgWithBase(n ir.Node, t *types.Type, base *ssa.Value, off int64) {
  5429  	pt := types.NewPtr(t)
  5430  	var addr *ssa.Value
  5431  	if base == s.sp {
  5432  		// Use special routine that avoids allocation on duplicate offsets.
  5433  		addr = s.constOffPtrSP(pt, off)
  5434  	} else {
  5435  		addr = s.newValue1I(ssa.OpOffPtr, pt, off, base)
  5436  	}
  5437  
  5438  	if !ssa.CanSSA(t) {
  5439  		a := s.addr(n)
  5440  		s.move(t, addr, a)
  5441  		return
  5442  	}
  5443  
  5444  	a := s.expr(n)
  5445  	s.storeType(t, addr, a, 0, false)
  5446  }
  5447  
  5448  // slice computes the slice v[i:j:k] and returns ptr, len, and cap of result.
  5449  // i,j,k may be nil, in which case they are set to their default value.
  5450  // v may be a slice, string or pointer to an array.
  5451  func (s *state) slice(v, i, j, k *ssa.Value, bounded bool) (p, l, c *ssa.Value) {
  5452  	t := v.Type
  5453  	var ptr, len, cap *ssa.Value
  5454  	switch {
  5455  	case t.IsSlice():
  5456  		ptr = s.newValue1(ssa.OpSlicePtr, types.NewPtr(t.Elem()), v)
  5457  		len = s.newValue1(ssa.OpSliceLen, types.Types[types.TINT], v)
  5458  		cap = s.newValue1(ssa.OpSliceCap, types.Types[types.TINT], v)
  5459  	case t.IsString():
  5460  		ptr = s.newValue1(ssa.OpStringPtr, types.NewPtr(types.Types[types.TUINT8]), v)
  5461  		len = s.newValue1(ssa.OpStringLen, types.Types[types.TINT], v)
  5462  		cap = len
  5463  	case t.IsPtr():
  5464  		if !t.Elem().IsArray() {
  5465  			s.Fatalf("bad ptr to array in slice %v\n", t)
  5466  		}
  5467  		nv := s.nilCheck(v)
  5468  		ptr = s.newValue1(ssa.OpCopy, types.NewPtr(t.Elem().Elem()), nv)
  5469  		len = s.constInt(types.Types[types.TINT], t.Elem().NumElem())
  5470  		cap = len
  5471  	default:
  5472  		s.Fatalf("bad type in slice %v\n", t)
  5473  	}
  5474  
  5475  	// Set default values
  5476  	if i == nil {
  5477  		i = s.constInt(types.Types[types.TINT], 0)
  5478  	}
  5479  	if j == nil {
  5480  		j = len
  5481  	}
  5482  	three := true
  5483  	if k == nil {
  5484  		three = false
  5485  		k = cap
  5486  	}
  5487  
  5488  	// Panic if slice indices are not in bounds.
  5489  	// Make sure we check these in reverse order so that we're always
  5490  	// comparing against a value known to be nonnegative. See issue 28797.
  5491  	if three {
  5492  		if k != cap {
  5493  			kind := ssa.BoundsSlice3Alen
  5494  			if t.IsSlice() {
  5495  				kind = ssa.BoundsSlice3Acap
  5496  			}
  5497  			k = s.boundsCheck(k, cap, kind, bounded)
  5498  		}
  5499  		if j != k {
  5500  			j = s.boundsCheck(j, k, ssa.BoundsSlice3B, bounded)
  5501  		}
  5502  		i = s.boundsCheck(i, j, ssa.BoundsSlice3C, bounded)
  5503  	} else {
  5504  		if j != k {
  5505  			kind := ssa.BoundsSliceAlen
  5506  			if t.IsSlice() {
  5507  				kind = ssa.BoundsSliceAcap
  5508  			}
  5509  			j = s.boundsCheck(j, k, kind, bounded)
  5510  		}
  5511  		i = s.boundsCheck(i, j, ssa.BoundsSliceB, bounded)
  5512  	}
  5513  
  5514  	// Word-sized integer operations.
  5515  	subOp := s.ssaOp(ir.OSUB, types.Types[types.TINT])
  5516  	mulOp := s.ssaOp(ir.OMUL, types.Types[types.TINT])
  5517  	andOp := s.ssaOp(ir.OAND, types.Types[types.TINT])
  5518  
  5519  	// Calculate the length (rlen) and capacity (rcap) of the new slice.
  5520  	// For strings the capacity of the result is unimportant. However,
  5521  	// we use rcap to test if we've generated a zero-length slice.
  5522  	// Use length of strings for that.
  5523  	rlen := s.newValue2(subOp, types.Types[types.TINT], j, i)
  5524  	rcap := rlen
  5525  	if j != k && !t.IsString() {
  5526  		rcap = s.newValue2(subOp, types.Types[types.TINT], k, i)
  5527  	}
  5528  
  5529  	if (i.Op == ssa.OpConst64 || i.Op == ssa.OpConst32) && i.AuxInt == 0 {
  5530  		// No pointer arithmetic necessary.
  5531  		return ptr, rlen, rcap
  5532  	}
  5533  
  5534  	// Calculate the base pointer (rptr) for the new slice.
  5535  	//
  5536  	// Generate the following code assuming that indexes are in bounds.
  5537  	// The masking is to make sure that we don't generate a slice
  5538  	// that points to the next object in memory. We cannot just set
  5539  	// the pointer to nil because then we would create a nil slice or
  5540  	// string.
  5541  	//
  5542  	//     rcap = k - i
  5543  	//     rlen = j - i
  5544  	//     rptr = ptr + (mask(rcap) & (i * stride))
  5545  	//
  5546  	// Where mask(x) is 0 if x==0 and -1 if x>0 and stride is the width
  5547  	// of the element type.
  5548  	stride := s.constInt(types.Types[types.TINT], ptr.Type.Elem().Size())
  5549  
  5550  	// The delta is the number of bytes to offset ptr by.
  5551  	delta := s.newValue2(mulOp, types.Types[types.TINT], i, stride)
  5552  
  5553  	// If we're slicing to the point where the capacity is zero,
  5554  	// zero out the delta.
  5555  	mask := s.newValue1(ssa.OpSlicemask, types.Types[types.TINT], rcap)
  5556  	delta = s.newValue2(andOp, types.Types[types.TINT], delta, mask)
  5557  
  5558  	// Compute rptr = ptr + delta.
  5559  	rptr := s.newValue2(ssa.OpAddPtr, ptr.Type, ptr, delta)
  5560  
  5561  	return rptr, rlen, rcap
  5562  }
  5563  
  5564  type u642fcvtTab struct {
  5565  	leq, cvt2F, and, rsh, or, add ssa.Op
  5566  	one                           func(*state, *types.Type, int64) *ssa.Value
  5567  }
  5568  
  5569  var u64_f64 = u642fcvtTab{
  5570  	leq:   ssa.OpLeq64,
  5571  	cvt2F: ssa.OpCvt64to64F,
  5572  	and:   ssa.OpAnd64,
  5573  	rsh:   ssa.OpRsh64Ux64,
  5574  	or:    ssa.OpOr64,
  5575  	add:   ssa.OpAdd64F,
  5576  	one:   (*state).constInt64,
  5577  }
  5578  
  5579  var u64_f32 = u642fcvtTab{
  5580  	leq:   ssa.OpLeq64,
  5581  	cvt2F: ssa.OpCvt64to32F,
  5582  	and:   ssa.OpAnd64,
  5583  	rsh:   ssa.OpRsh64Ux64,
  5584  	or:    ssa.OpOr64,
  5585  	add:   ssa.OpAdd32F,
  5586  	one:   (*state).constInt64,
  5587  }
  5588  
  5589  func (s *state) uint64Tofloat64(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5590  	return s.uint64Tofloat(&u64_f64, n, x, ft, tt)
  5591  }
  5592  
  5593  func (s *state) uint64Tofloat32(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5594  	return s.uint64Tofloat(&u64_f32, n, x, ft, tt)
  5595  }
  5596  
  5597  func (s *state) uint64Tofloat(cvttab *u642fcvtTab, n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5598  	// if x >= 0 {
  5599  	//    result = (floatY) x
  5600  	// } else {
  5601  	// 	  y = uintX(x) ; y = x & 1
  5602  	// 	  z = uintX(x) ; z = z >> 1
  5603  	// 	  z = z | y
  5604  	// 	  result = floatY(z)
  5605  	// 	  result = result + result
  5606  	// }
  5607  	//
  5608  	// Code borrowed from old code generator.
  5609  	// What's going on: large 64-bit "unsigned" looks like
  5610  	// negative number to hardware's integer-to-float
  5611  	// conversion. However, because the mantissa is only
  5612  	// 63 bits, we don't need the LSB, so instead we do an
  5613  	// unsigned right shift (divide by two), convert, and
  5614  	// double. However, before we do that, we need to be
  5615  	// sure that we do not lose a "1" if that made the
  5616  	// difference in the resulting rounding. Therefore, we
  5617  	// preserve it, and OR (not ADD) it back in. The case
  5618  	// that matters is when the eleven discarded bits are
  5619  	// equal to 10000000001; that rounds up, and the 1 cannot
  5620  	// be lost else it would round down if the LSB of the
  5621  	// candidate mantissa is 0.
  5622  	cmp := s.newValue2(cvttab.leq, types.Types[types.TBOOL], s.zeroVal(ft), x)
  5623  	b := s.endBlock()
  5624  	b.Kind = ssa.BlockIf
  5625  	b.SetControl(cmp)
  5626  	b.Likely = ssa.BranchLikely
  5627  
  5628  	bThen := s.f.NewBlock(ssa.BlockPlain)
  5629  	bElse := s.f.NewBlock(ssa.BlockPlain)
  5630  	bAfter := s.f.NewBlock(ssa.BlockPlain)
  5631  
  5632  	b.AddEdgeTo(bThen)
  5633  	s.startBlock(bThen)
  5634  	a0 := s.newValue1(cvttab.cvt2F, tt, x)
  5635  	s.vars[n] = a0
  5636  	s.endBlock()
  5637  	bThen.AddEdgeTo(bAfter)
  5638  
  5639  	b.AddEdgeTo(bElse)
  5640  	s.startBlock(bElse)
  5641  	one := cvttab.one(s, ft, 1)
  5642  	y := s.newValue2(cvttab.and, ft, x, one)
  5643  	z := s.newValue2(cvttab.rsh, ft, x, one)
  5644  	z = s.newValue2(cvttab.or, ft, z, y)
  5645  	a := s.newValue1(cvttab.cvt2F, tt, z)
  5646  	a1 := s.newValue2(cvttab.add, tt, a, a)
  5647  	s.vars[n] = a1
  5648  	s.endBlock()
  5649  	bElse.AddEdgeTo(bAfter)
  5650  
  5651  	s.startBlock(bAfter)
  5652  	return s.variable(n, n.Type())
  5653  }
  5654  
  5655  type u322fcvtTab struct {
  5656  	cvtI2F, cvtF2F ssa.Op
  5657  }
  5658  
  5659  var u32_f64 = u322fcvtTab{
  5660  	cvtI2F: ssa.OpCvt32to64F,
  5661  	cvtF2F: ssa.OpCopy,
  5662  }
  5663  
  5664  var u32_f32 = u322fcvtTab{
  5665  	cvtI2F: ssa.OpCvt32to32F,
  5666  	cvtF2F: ssa.OpCvt64Fto32F,
  5667  }
  5668  
  5669  func (s *state) uint32Tofloat64(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5670  	return s.uint32Tofloat(&u32_f64, n, x, ft, tt)
  5671  }
  5672  
  5673  func (s *state) uint32Tofloat32(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5674  	return s.uint32Tofloat(&u32_f32, n, x, ft, tt)
  5675  }
  5676  
  5677  func (s *state) uint32Tofloat(cvttab *u322fcvtTab, n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5678  	// if x >= 0 {
  5679  	// 	result = floatY(x)
  5680  	// } else {
  5681  	// 	result = floatY(float64(x) + (1<<32))
  5682  	// }
  5683  	cmp := s.newValue2(ssa.OpLeq32, types.Types[types.TBOOL], s.zeroVal(ft), x)
  5684  	b := s.endBlock()
  5685  	b.Kind = ssa.BlockIf
  5686  	b.SetControl(cmp)
  5687  	b.Likely = ssa.BranchLikely
  5688  
  5689  	bThen := s.f.NewBlock(ssa.BlockPlain)
  5690  	bElse := s.f.NewBlock(ssa.BlockPlain)
  5691  	bAfter := s.f.NewBlock(ssa.BlockPlain)
  5692  
  5693  	b.AddEdgeTo(bThen)
  5694  	s.startBlock(bThen)
  5695  	a0 := s.newValue1(cvttab.cvtI2F, tt, x)
  5696  	s.vars[n] = a0
  5697  	s.endBlock()
  5698  	bThen.AddEdgeTo(bAfter)
  5699  
  5700  	b.AddEdgeTo(bElse)
  5701  	s.startBlock(bElse)
  5702  	a1 := s.newValue1(ssa.OpCvt32to64F, types.Types[types.TFLOAT64], x)
  5703  	twoToThe32 := s.constFloat64(types.Types[types.TFLOAT64], float64(1<<32))
  5704  	a2 := s.newValue2(ssa.OpAdd64F, types.Types[types.TFLOAT64], a1, twoToThe32)
  5705  	a3 := s.newValue1(cvttab.cvtF2F, tt, a2)
  5706  
  5707  	s.vars[n] = a3
  5708  	s.endBlock()
  5709  	bElse.AddEdgeTo(bAfter)
  5710  
  5711  	s.startBlock(bAfter)
  5712  	return s.variable(n, n.Type())
  5713  }
  5714  
  5715  // referenceTypeBuiltin generates code for the len/cap builtins for maps and channels.
  5716  func (s *state) referenceTypeBuiltin(n *ir.UnaryExpr, x *ssa.Value) *ssa.Value {
  5717  	if !n.X.Type().IsMap() && !n.X.Type().IsChan() {
  5718  		s.Fatalf("node must be a map or a channel")
  5719  	}
  5720  	if n.X.Type().IsChan() && n.Op() == ir.OLEN {
  5721  		s.Fatalf("cannot inline len(chan)") // must use runtime.chanlen now
  5722  	}
  5723  	if n.X.Type().IsChan() && n.Op() == ir.OCAP {
  5724  		s.Fatalf("cannot inline cap(chan)") // must use runtime.chancap now
  5725  	}
  5726  	if n.X.Type().IsMap() && n.Op() == ir.OCAP {
  5727  		s.Fatalf("cannot inline cap(map)") // cap(map) does not exist
  5728  	}
  5729  	// if n == nil {
  5730  	//   return 0
  5731  	// } else {
  5732  	//   // len, the actual loadType depends
  5733  	//   return int(*((*loadType)n))
  5734  	//   // cap (chan only, not used for now)
  5735  	//   return *(((*int)n)+1)
  5736  	// }
  5737  	lenType := n.Type()
  5738  	nilValue := s.constNil(types.Types[types.TUINTPTR])
  5739  	cmp := s.newValue2(ssa.OpEqPtr, types.Types[types.TBOOL], x, nilValue)
  5740  	b := s.endBlock()
  5741  	b.Kind = ssa.BlockIf
  5742  	b.SetControl(cmp)
  5743  	b.Likely = ssa.BranchUnlikely
  5744  
  5745  	bThen := s.f.NewBlock(ssa.BlockPlain)
  5746  	bElse := s.f.NewBlock(ssa.BlockPlain)
  5747  	bAfter := s.f.NewBlock(ssa.BlockPlain)
  5748  
  5749  	// length/capacity of a nil map/chan is zero
  5750  	b.AddEdgeTo(bThen)
  5751  	s.startBlock(bThen)
  5752  	s.vars[n] = s.zeroVal(lenType)
  5753  	s.endBlock()
  5754  	bThen.AddEdgeTo(bAfter)
  5755  
  5756  	b.AddEdgeTo(bElse)
  5757  	s.startBlock(bElse)
  5758  	switch n.Op() {
  5759  	case ir.OLEN:
  5760  		if buildcfg.Experiment.SwissMap && n.X.Type().IsMap() {
  5761  			// length is stored in the first word.
  5762  			loadType := reflectdata.SwissMapType().Field(0).Type // uint64
  5763  			load := s.load(loadType, x)
  5764  			s.vars[n] = s.conv(nil, load, loadType, lenType) // integer conversion doesn't need Node
  5765  		} else {
  5766  			// length is stored in the first word for map/chan
  5767  			s.vars[n] = s.load(lenType, x)
  5768  		}
  5769  	case ir.OCAP:
  5770  		// capacity is stored in the second word for chan
  5771  		sw := s.newValue1I(ssa.OpOffPtr, lenType.PtrTo(), lenType.Size(), x)
  5772  		s.vars[n] = s.load(lenType, sw)
  5773  	default:
  5774  		s.Fatalf("op must be OLEN or OCAP")
  5775  	}
  5776  	s.endBlock()
  5777  	bElse.AddEdgeTo(bAfter)
  5778  
  5779  	s.startBlock(bAfter)
  5780  	return s.variable(n, lenType)
  5781  }
  5782  
  5783  type f2uCvtTab struct {
  5784  	ltf, cvt2U, subf, or ssa.Op
  5785  	floatValue           func(*state, *types.Type, float64) *ssa.Value
  5786  	intValue             func(*state, *types.Type, int64) *ssa.Value
  5787  	cutoff               uint64
  5788  }
  5789  
  5790  var f32_u64 = f2uCvtTab{
  5791  	ltf:        ssa.OpLess32F,
  5792  	cvt2U:      ssa.OpCvt32Fto64,
  5793  	subf:       ssa.OpSub32F,
  5794  	or:         ssa.OpOr64,
  5795  	floatValue: (*state).constFloat32,
  5796  	intValue:   (*state).constInt64,
  5797  	cutoff:     1 << 63,
  5798  }
  5799  
  5800  var f64_u64 = f2uCvtTab{
  5801  	ltf:        ssa.OpLess64F,
  5802  	cvt2U:      ssa.OpCvt64Fto64,
  5803  	subf:       ssa.OpSub64F,
  5804  	or:         ssa.OpOr64,
  5805  	floatValue: (*state).constFloat64,
  5806  	intValue:   (*state).constInt64,
  5807  	cutoff:     1 << 63,
  5808  }
  5809  
  5810  var f32_u32 = f2uCvtTab{
  5811  	ltf:        ssa.OpLess32F,
  5812  	cvt2U:      ssa.OpCvt32Fto32,
  5813  	subf:       ssa.OpSub32F,
  5814  	or:         ssa.OpOr32,
  5815  	floatValue: (*state).constFloat32,
  5816  	intValue:   func(s *state, t *types.Type, v int64) *ssa.Value { return s.constInt32(t, int32(v)) },
  5817  	cutoff:     1 << 31,
  5818  }
  5819  
  5820  var f64_u32 = f2uCvtTab{
  5821  	ltf:        ssa.OpLess64F,
  5822  	cvt2U:      ssa.OpCvt64Fto32,
  5823  	subf:       ssa.OpSub64F,
  5824  	or:         ssa.OpOr32,
  5825  	floatValue: (*state).constFloat64,
  5826  	intValue:   func(s *state, t *types.Type, v int64) *ssa.Value { return s.constInt32(t, int32(v)) },
  5827  	cutoff:     1 << 31,
  5828  }
  5829  
  5830  func (s *state) float32ToUint64(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5831  	return s.floatToUint(&f32_u64, n, x, ft, tt)
  5832  }
  5833  func (s *state) float64ToUint64(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5834  	return s.floatToUint(&f64_u64, n, x, ft, tt)
  5835  }
  5836  
  5837  func (s *state) float32ToUint32(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5838  	return s.floatToUint(&f32_u32, n, x, ft, tt)
  5839  }
  5840  
  5841  func (s *state) float64ToUint32(n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5842  	return s.floatToUint(&f64_u32, n, x, ft, tt)
  5843  }
  5844  
  5845  func (s *state) floatToUint(cvttab *f2uCvtTab, n ir.Node, x *ssa.Value, ft, tt *types.Type) *ssa.Value {
  5846  	// cutoff:=1<<(intY_Size-1)
  5847  	// if x < floatX(cutoff) {
  5848  	// 	result = uintY(x)
  5849  	// } else {
  5850  	// 	y = x - floatX(cutoff)
  5851  	// 	z = uintY(y)
  5852  	// 	result = z | -(cutoff)
  5853  	// }
  5854  	cutoff := cvttab.floatValue(s, ft, float64(cvttab.cutoff))
  5855  	cmp := s.newValue2(cvttab.ltf, types.Types[types.TBOOL], x, cutoff)
  5856  	b := s.endBlock()
  5857  	b.Kind = ssa.BlockIf
  5858  	b.SetControl(cmp)
  5859  	b.Likely = ssa.BranchLikely
  5860  
  5861  	bThen := s.f.NewBlock(ssa.BlockPlain)
  5862  	bElse := s.f.NewBlock(ssa.BlockPlain)
  5863  	bAfter := s.f.NewBlock(ssa.BlockPlain)
  5864  
  5865  	b.AddEdgeTo(bThen)
  5866  	s.startBlock(bThen)
  5867  	a0 := s.newValue1(cvttab.cvt2U, tt, x)
  5868  	s.vars[n] = a0
  5869  	s.endBlock()
  5870  	bThen.AddEdgeTo(bAfter)
  5871  
  5872  	b.AddEdgeTo(bElse)
  5873  	s.startBlock(bElse)
  5874  	y := s.newValue2(cvttab.subf, ft, x, cutoff)
  5875  	y = s.newValue1(cvttab.cvt2U, tt, y)
  5876  	z := cvttab.intValue(s, tt, int64(-cvttab.cutoff))
  5877  	a1 := s.newValue2(cvttab.or, tt, y, z)
  5878  	s.vars[n] = a1
  5879  	s.endBlock()
  5880  	bElse.AddEdgeTo(bAfter)
  5881  
  5882  	s.startBlock(bAfter)
  5883  	return s.variable(n, n.Type())
  5884  }
  5885  
  5886  // dottype generates SSA for a type assertion node.
  5887  // commaok indicates whether to panic or return a bool.
  5888  // If commaok is false, resok will be nil.
  5889  func (s *state) dottype(n *ir.TypeAssertExpr, commaok bool) (res, resok *ssa.Value) {
  5890  	iface := s.expr(n.X)              // input interface
  5891  	target := s.reflectType(n.Type()) // target type
  5892  	var targetItab *ssa.Value
  5893  	if n.ITab != nil {
  5894  		targetItab = s.expr(n.ITab)
  5895  	}
  5896  	return s.dottype1(n.Pos(), n.X.Type(), n.Type(), iface, nil, target, targetItab, commaok, n.Descriptor)
  5897  }
  5898  
  5899  func (s *state) dynamicDottype(n *ir.DynamicTypeAssertExpr, commaok bool) (res, resok *ssa.Value) {
  5900  	iface := s.expr(n.X)
  5901  	var source, target, targetItab *ssa.Value
  5902  	if n.SrcRType != nil {
  5903  		source = s.expr(n.SrcRType)
  5904  	}
  5905  	if !n.X.Type().IsEmptyInterface() && !n.Type().IsInterface() {
  5906  		byteptr := s.f.Config.Types.BytePtr
  5907  		targetItab = s.expr(n.ITab)
  5908  		// TODO(mdempsky): Investigate whether compiling n.RType could be
  5909  		// better than loading itab.typ.
  5910  		target = s.load(byteptr, s.newValue1I(ssa.OpOffPtr, byteptr, rttype.ITab.OffsetOf("Type"), targetItab))
  5911  	} else {
  5912  		target = s.expr(n.RType)
  5913  	}
  5914  	return s.dottype1(n.Pos(), n.X.Type(), n.Type(), iface, source, target, targetItab, commaok, nil)
  5915  }
  5916  
  5917  // dottype1 implements a x.(T) operation. iface is the argument (x), dst is the type we're asserting to (T)
  5918  // and src is the type we're asserting from.
  5919  // source is the *runtime._type of src
  5920  // target is the *runtime._type of dst.
  5921  // If src is a nonempty interface and dst is not an interface, targetItab is an itab representing (dst, src). Otherwise it is nil.
  5922  // commaok is true if the caller wants a boolean success value. Otherwise, the generated code panics if the conversion fails.
  5923  // descriptor is a compiler-allocated internal/abi.TypeAssert whose address is passed to runtime.typeAssert when
  5924  // the target type is a compile-time-known non-empty interface. It may be nil.
  5925  func (s *state) dottype1(pos src.XPos, src, dst *types.Type, iface, source, target, targetItab *ssa.Value, commaok bool, descriptor *obj.LSym) (res, resok *ssa.Value) {
  5926  	typs := s.f.Config.Types
  5927  	byteptr := typs.BytePtr
  5928  	if dst.IsInterface() {
  5929  		if dst.IsEmptyInterface() {
  5930  			// Converting to an empty interface.
  5931  			// Input could be an empty or nonempty interface.
  5932  			if base.Debug.TypeAssert > 0 {
  5933  				base.WarnfAt(pos, "type assertion inlined")
  5934  			}
  5935  
  5936  			// Get itab/type field from input.
  5937  			itab := s.newValue1(ssa.OpITab, byteptr, iface)
  5938  			// Conversion succeeds iff that field is not nil.
  5939  			cond := s.newValue2(ssa.OpNeqPtr, types.Types[types.TBOOL], itab, s.constNil(byteptr))
  5940  
  5941  			if src.IsEmptyInterface() && commaok {
  5942  				// Converting empty interface to empty interface with ,ok is just a nil check.
  5943  				return iface, cond
  5944  			}
  5945  
  5946  			// Branch on nilness.
  5947  			b := s.endBlock()
  5948  			b.Kind = ssa.BlockIf
  5949  			b.SetControl(cond)
  5950  			b.Likely = ssa.BranchLikely
  5951  			bOk := s.f.NewBlock(ssa.BlockPlain)
  5952  			bFail := s.f.NewBlock(ssa.BlockPlain)
  5953  			b.AddEdgeTo(bOk)
  5954  			b.AddEdgeTo(bFail)
  5955  
  5956  			if !commaok {
  5957  				// On failure, panic by calling panicnildottype.
  5958  				s.startBlock(bFail)
  5959  				s.rtcall(ir.Syms.Panicnildottype, false, nil, target)
  5960  
  5961  				// On success, return (perhaps modified) input interface.
  5962  				s.startBlock(bOk)
  5963  				if src.IsEmptyInterface() {
  5964  					res = iface // Use input interface unchanged.
  5965  					return
  5966  				}
  5967  				// Load type out of itab, build interface with existing idata.
  5968  				off := s.newValue1I(ssa.OpOffPtr, byteptr, rttype.ITab.OffsetOf("Type"), itab)
  5969  				typ := s.load(byteptr, off)
  5970  				idata := s.newValue1(ssa.OpIData, byteptr, iface)
  5971  				res = s.newValue2(ssa.OpIMake, dst, typ, idata)
  5972  				return
  5973  			}
  5974  
  5975  			s.startBlock(bOk)
  5976  			// nonempty -> empty
  5977  			// Need to load type from itab
  5978  			off := s.newValue1I(ssa.OpOffPtr, byteptr, rttype.ITab.OffsetOf("Type"), itab)
  5979  			s.vars[typVar] = s.load(byteptr, off)
  5980  			s.endBlock()
  5981  
  5982  			// itab is nil, might as well use that as the nil result.
  5983  			s.startBlock(bFail)
  5984  			s.vars[typVar] = itab
  5985  			s.endBlock()
  5986  
  5987  			// Merge point.
  5988  			bEnd := s.f.NewBlock(ssa.BlockPlain)
  5989  			bOk.AddEdgeTo(bEnd)
  5990  			bFail.AddEdgeTo(bEnd)
  5991  			s.startBlock(bEnd)
  5992  			idata := s.newValue1(ssa.OpIData, byteptr, iface)
  5993  			res = s.newValue2(ssa.OpIMake, dst, s.variable(typVar, byteptr), idata)
  5994  			resok = cond
  5995  			delete(s.vars, typVar) // no practical effect, just to indicate typVar is no longer live.
  5996  			return
  5997  		}
  5998  		// converting to a nonempty interface needs a runtime call.
  5999  		if base.Debug.TypeAssert > 0 {
  6000  			base.WarnfAt(pos, "type assertion not inlined")
  6001  		}
  6002  
  6003  		itab := s.newValue1(ssa.OpITab, byteptr, iface)
  6004  		data := s.newValue1(ssa.OpIData, types.Types[types.TUNSAFEPTR], iface)
  6005  
  6006  		// First, check for nil.
  6007  		bNil := s.f.NewBlock(ssa.BlockPlain)
  6008  		bNonNil := s.f.NewBlock(ssa.BlockPlain)
  6009  		bMerge := s.f.NewBlock(ssa.BlockPlain)
  6010  		cond := s.newValue2(ssa.OpNeqPtr, types.Types[types.TBOOL], itab, s.constNil(byteptr))
  6011  		b := s.endBlock()
  6012  		b.Kind = ssa.BlockIf
  6013  		b.SetControl(cond)
  6014  		b.Likely = ssa.BranchLikely
  6015  		b.AddEdgeTo(bNonNil)
  6016  		b.AddEdgeTo(bNil)
  6017  
  6018  		s.startBlock(bNil)
  6019  		if commaok {
  6020  			s.vars[typVar] = itab // which will be nil
  6021  			b := s.endBlock()
  6022  			b.AddEdgeTo(bMerge)
  6023  		} else {
  6024  			// Panic if input is nil.
  6025  			s.rtcall(ir.Syms.Panicnildottype, false, nil, target)
  6026  		}
  6027  
  6028  		// Get typ, possibly by loading out of itab.
  6029  		s.startBlock(bNonNil)
  6030  		typ := itab
  6031  		if !src.IsEmptyInterface() {
  6032  			typ = s.load(byteptr, s.newValue1I(ssa.OpOffPtr, byteptr, rttype.ITab.OffsetOf("Type"), itab))
  6033  		}
  6034  
  6035  		// Check the cache first.
  6036  		var d *ssa.Value
  6037  		if descriptor != nil {
  6038  			d = s.newValue1A(ssa.OpAddr, byteptr, descriptor, s.sb)
  6039  			if base.Flag.N == 0 && rtabi.UseInterfaceSwitchCache(Arch.LinkArch.Family) {
  6040  				// Note: we can only use the cache if we have the right atomic load instruction.
  6041  				// Double-check that here.
  6042  				if intrinsics.lookup(Arch.LinkArch.Arch, "internal/runtime/atomic", "Loadp") == nil {
  6043  					s.Fatalf("atomic load not available")
  6044  				}
  6045  				// Pick right size ops.
  6046  				var mul, and, add, zext ssa.Op
  6047  				if s.config.PtrSize == 4 {
  6048  					mul = ssa.OpMul32
  6049  					and = ssa.OpAnd32
  6050  					add = ssa.OpAdd32
  6051  					zext = ssa.OpCopy
  6052  				} else {
  6053  					mul = ssa.OpMul64
  6054  					and = ssa.OpAnd64
  6055  					add = ssa.OpAdd64
  6056  					zext = ssa.OpZeroExt32to64
  6057  				}
  6058  
  6059  				loopHead := s.f.NewBlock(ssa.BlockPlain)
  6060  				loopBody := s.f.NewBlock(ssa.BlockPlain)
  6061  				cacheHit := s.f.NewBlock(ssa.BlockPlain)
  6062  				cacheMiss := s.f.NewBlock(ssa.BlockPlain)
  6063  
  6064  				// Load cache pointer out of descriptor, with an atomic load so
  6065  				// we ensure that we see a fully written cache.
  6066  				atomicLoad := s.newValue2(ssa.OpAtomicLoadPtr, types.NewTuple(typs.BytePtr, types.TypeMem), d, s.mem())
  6067  				cache := s.newValue1(ssa.OpSelect0, typs.BytePtr, atomicLoad)
  6068  				s.vars[memVar] = s.newValue1(ssa.OpSelect1, types.TypeMem, atomicLoad)
  6069  
  6070  				// Load hash from type or itab.
  6071  				var hash *ssa.Value
  6072  				if src.IsEmptyInterface() {
  6073  					hash = s.newValue2(ssa.OpLoad, typs.UInt32, s.newValue1I(ssa.OpOffPtr, typs.UInt32Ptr, rttype.Type.OffsetOf("Hash"), typ), s.mem())
  6074  				} else {
  6075  					hash = s.newValue2(ssa.OpLoad, typs.UInt32, s.newValue1I(ssa.OpOffPtr, typs.UInt32Ptr, rttype.ITab.OffsetOf("Hash"), itab), s.mem())
  6076  				}
  6077  				hash = s.newValue1(zext, typs.Uintptr, hash)
  6078  				s.vars[hashVar] = hash
  6079  				// Load mask from cache.
  6080  				mask := s.newValue2(ssa.OpLoad, typs.Uintptr, cache, s.mem())
  6081  				// Jump to loop head.
  6082  				b := s.endBlock()
  6083  				b.AddEdgeTo(loopHead)
  6084  
  6085  				// At loop head, get pointer to the cache entry.
  6086  				//   e := &cache.Entries[hash&mask]
  6087  				s.startBlock(loopHead)
  6088  				idx := s.newValue2(and, typs.Uintptr, s.variable(hashVar, typs.Uintptr), mask)
  6089  				idx = s.newValue2(mul, typs.Uintptr, idx, s.uintptrConstant(uint64(2*s.config.PtrSize)))
  6090  				idx = s.newValue2(add, typs.Uintptr, idx, s.uintptrConstant(uint64(s.config.PtrSize)))
  6091  				e := s.newValue2(ssa.OpAddPtr, typs.UintptrPtr, cache, idx)
  6092  				//   hash++
  6093  				s.vars[hashVar] = s.newValue2(add, typs.Uintptr, s.variable(hashVar, typs.Uintptr), s.uintptrConstant(1))
  6094  
  6095  				// Look for a cache hit.
  6096  				//   if e.Typ == typ { goto hit }
  6097  				eTyp := s.newValue2(ssa.OpLoad, typs.Uintptr, e, s.mem())
  6098  				cmp1 := s.newValue2(ssa.OpEqPtr, typs.Bool, typ, eTyp)
  6099  				b = s.endBlock()
  6100  				b.Kind = ssa.BlockIf
  6101  				b.SetControl(cmp1)
  6102  				b.AddEdgeTo(cacheHit)
  6103  				b.AddEdgeTo(loopBody)
  6104  
  6105  				// Look for an empty entry, the tombstone for this hash table.
  6106  				//   if e.Typ == nil { goto miss }
  6107  				s.startBlock(loopBody)
  6108  				cmp2 := s.newValue2(ssa.OpEqPtr, typs.Bool, eTyp, s.constNil(typs.BytePtr))
  6109  				b = s.endBlock()
  6110  				b.Kind = ssa.BlockIf
  6111  				b.SetControl(cmp2)
  6112  				b.AddEdgeTo(cacheMiss)
  6113  				b.AddEdgeTo(loopHead)
  6114  
  6115  				// On a hit, load the data fields of the cache entry.
  6116  				//   Itab = e.Itab
  6117  				s.startBlock(cacheHit)
  6118  				eItab := s.newValue2(ssa.OpLoad, typs.BytePtr, s.newValue1I(ssa.OpOffPtr, typs.BytePtrPtr, s.config.PtrSize, e), s.mem())
  6119  				s.vars[typVar] = eItab
  6120  				b = s.endBlock()
  6121  				b.AddEdgeTo(bMerge)
  6122  
  6123  				// On a miss, call into the runtime to get the answer.
  6124  				s.startBlock(cacheMiss)
  6125  			}
  6126  		}
  6127  
  6128  		// Call into runtime to get itab for result.
  6129  		if descriptor != nil {
  6130  			itab = s.rtcall(ir.Syms.TypeAssert, true, []*types.Type{byteptr}, d, typ)[0]
  6131  		} else {
  6132  			var fn *obj.LSym
  6133  			if commaok {
  6134  				fn = ir.Syms.AssertE2I2
  6135  			} else {
  6136  				fn = ir.Syms.AssertE2I
  6137  			}
  6138  			itab = s.rtcall(fn, true, []*types.Type{byteptr}, target, typ)[0]
  6139  		}
  6140  		s.vars[typVar] = itab
  6141  		b = s.endBlock()
  6142  		b.AddEdgeTo(bMerge)
  6143  
  6144  		// Build resulting interface.
  6145  		s.startBlock(bMerge)
  6146  		itab = s.variable(typVar, byteptr)
  6147  		var ok *ssa.Value
  6148  		if commaok {
  6149  			ok = s.newValue2(ssa.OpNeqPtr, types.Types[types.TBOOL], itab, s.constNil(byteptr))
  6150  		}
  6151  		return s.newValue2(ssa.OpIMake, dst, itab, data), ok
  6152  	}
  6153  
  6154  	if base.Debug.TypeAssert > 0 {
  6155  		base.WarnfAt(pos, "type assertion inlined")
  6156  	}
  6157  
  6158  	// Converting to a concrete type.
  6159  	direct := types.IsDirectIface(dst)
  6160  	itab := s.newValue1(ssa.OpITab, byteptr, iface) // type word of interface
  6161  	if base.Debug.TypeAssert > 0 {
  6162  		base.WarnfAt(pos, "type assertion inlined")
  6163  	}
  6164  	var wantedFirstWord *ssa.Value
  6165  	if src.IsEmptyInterface() {
  6166  		// Looking for pointer to target type.
  6167  		wantedFirstWord = target
  6168  	} else {
  6169  		// Looking for pointer to itab for target type and source interface.
  6170  		wantedFirstWord = targetItab
  6171  	}
  6172  
  6173  	var tmp ir.Node     // temporary for use with large types
  6174  	var addr *ssa.Value // address of tmp
  6175  	if commaok && !ssa.CanSSA(dst) {
  6176  		// unSSAable type, use temporary.
  6177  		// TODO: get rid of some of these temporaries.
  6178  		tmp, addr = s.temp(pos, dst)
  6179  	}
  6180  
  6181  	cond := s.newValue2(ssa.OpEqPtr, types.Types[types.TBOOL], itab, wantedFirstWord)
  6182  	b := s.endBlock()
  6183  	b.Kind = ssa.BlockIf
  6184  	b.SetControl(cond)
  6185  	b.Likely = ssa.BranchLikely
  6186  
  6187  	bOk := s.f.NewBlock(ssa.BlockPlain)
  6188  	bFail := s.f.NewBlock(ssa.BlockPlain)
  6189  	b.AddEdgeTo(bOk)
  6190  	b.AddEdgeTo(bFail)
  6191  
  6192  	if !commaok {
  6193  		// on failure, panic by calling panicdottype
  6194  		s.startBlock(bFail)
  6195  		taddr := source
  6196  		if taddr == nil {
  6197  			taddr = s.reflectType(src)
  6198  		}
  6199  		if src.IsEmptyInterface() {
  6200  			s.rtcall(ir.Syms.PanicdottypeE, false, nil, itab, target, taddr)
  6201  		} else {
  6202  			s.rtcall(ir.Syms.PanicdottypeI, false, nil, itab, target, taddr)
  6203  		}
  6204  
  6205  		// on success, return data from interface
  6206  		s.startBlock(bOk)
  6207  		if direct {
  6208  			return s.newValue1(ssa.OpIData, dst, iface), nil
  6209  		}
  6210  		p := s.newValue1(ssa.OpIData, types.NewPtr(dst), iface)
  6211  		return s.load(dst, p), nil
  6212  	}
  6213  
  6214  	// commaok is the more complicated case because we have
  6215  	// a control flow merge point.
  6216  	bEnd := s.f.NewBlock(ssa.BlockPlain)
  6217  	// Note that we need a new valVar each time (unlike okVar where we can
  6218  	// reuse the variable) because it might have a different type every time.
  6219  	valVar := ssaMarker("val")
  6220  
  6221  	// type assertion succeeded
  6222  	s.startBlock(bOk)
  6223  	if tmp == nil {
  6224  		if direct {
  6225  			s.vars[valVar] = s.newValue1(ssa.OpIData, dst, iface)
  6226  		} else {
  6227  			p := s.newValue1(ssa.OpIData, types.NewPtr(dst), iface)
  6228  			s.vars[valVar] = s.load(dst, p)
  6229  		}
  6230  	} else {
  6231  		p := s.newValue1(ssa.OpIData, types.NewPtr(dst), iface)
  6232  		s.move(dst, addr, p)
  6233  	}
  6234  	s.vars[okVar] = s.constBool(true)
  6235  	s.endBlock()
  6236  	bOk.AddEdgeTo(bEnd)
  6237  
  6238  	// type assertion failed
  6239  	s.startBlock(bFail)
  6240  	if tmp == nil {
  6241  		s.vars[valVar] = s.zeroVal(dst)
  6242  	} else {
  6243  		s.zero(dst, addr)
  6244  	}
  6245  	s.vars[okVar] = s.constBool(false)
  6246  	s.endBlock()
  6247  	bFail.AddEdgeTo(bEnd)
  6248  
  6249  	// merge point
  6250  	s.startBlock(bEnd)
  6251  	if tmp == nil {
  6252  		res = s.variable(valVar, dst)
  6253  		delete(s.vars, valVar) // no practical effect, just to indicate typVar is no longer live.
  6254  	} else {
  6255  		res = s.load(dst, addr)
  6256  	}
  6257  	resok = s.variable(okVar, types.Types[types.TBOOL])
  6258  	delete(s.vars, okVar) // ditto
  6259  	return res, resok
  6260  }
  6261  
  6262  // temp allocates a temp of type t at position pos
  6263  func (s *state) temp(pos src.XPos, t *types.Type) (*ir.Name, *ssa.Value) {
  6264  	tmp := typecheck.TempAt(pos, s.curfn, t)
  6265  	if t.HasPointers() || (ssa.IsMergeCandidate(tmp) && t != deferstruct()) {
  6266  		s.vars[memVar] = s.newValue1A(ssa.OpVarDef, types.TypeMem, tmp, s.mem())
  6267  	}
  6268  	addr := s.addr(tmp)
  6269  	return tmp, addr
  6270  }
  6271  
  6272  // variable returns the value of a variable at the current location.
  6273  func (s *state) variable(n ir.Node, t *types.Type) *ssa.Value {
  6274  	v := s.vars[n]
  6275  	if v != nil {
  6276  		return v
  6277  	}
  6278  	v = s.fwdVars[n]
  6279  	if v != nil {
  6280  		return v
  6281  	}
  6282  
  6283  	if s.curBlock == s.f.Entry {
  6284  		// No variable should be live at entry.
  6285  		s.f.Fatalf("value %v (%v) incorrectly live at entry", n, v)
  6286  	}
  6287  	// Make a FwdRef, which records a value that's live on block input.
  6288  	// We'll find the matching definition as part of insertPhis.
  6289  	v = s.newValue0A(ssa.OpFwdRef, t, fwdRefAux{N: n})
  6290  	s.fwdVars[n] = v
  6291  	if n.Op() == ir.ONAME {
  6292  		s.addNamedValue(n.(*ir.Name), v)
  6293  	}
  6294  	return v
  6295  }
  6296  
  6297  func (s *state) mem() *ssa.Value {
  6298  	return s.variable(memVar, types.TypeMem)
  6299  }
  6300  
  6301  func (s *state) addNamedValue(n *ir.Name, v *ssa.Value) {
  6302  	if n.Class == ir.Pxxx {
  6303  		// Don't track our marker nodes (memVar etc.).
  6304  		return
  6305  	}
  6306  	if ir.IsAutoTmp(n) {
  6307  		// Don't track temporary variables.
  6308  		return
  6309  	}
  6310  	if n.Class == ir.PPARAMOUT {
  6311  		// Don't track named output values.  This prevents return values
  6312  		// from being assigned too early. See #14591 and #14762. TODO: allow this.
  6313  		return
  6314  	}
  6315  	loc := ssa.LocalSlot{N: n, Type: n.Type(), Off: 0}
  6316  	values, ok := s.f.NamedValues[loc]
  6317  	if !ok {
  6318  		s.f.Names = append(s.f.Names, &loc)
  6319  		s.f.CanonicalLocalSlots[loc] = &loc
  6320  	}
  6321  	s.f.NamedValues[loc] = append(values, v)
  6322  }
  6323  
  6324  // Branch is an unresolved branch.
  6325  type Branch struct {
  6326  	P *obj.Prog  // branch instruction
  6327  	B *ssa.Block // target
  6328  }
  6329  
  6330  // State contains state needed during Prog generation.
  6331  type State struct {
  6332  	ABI obj.ABI
  6333  
  6334  	pp *objw.Progs
  6335  
  6336  	// Branches remembers all the branch instructions we've seen
  6337  	// and where they would like to go.
  6338  	Branches []Branch
  6339  
  6340  	// JumpTables remembers all the jump tables we've seen.
  6341  	JumpTables []*ssa.Block
  6342  
  6343  	// bstart remembers where each block starts (indexed by block ID)
  6344  	bstart []*obj.Prog
  6345  
  6346  	maxarg int64 // largest frame size for arguments to calls made by the function
  6347  
  6348  	// Map from GC safe points to liveness index, generated by
  6349  	// liveness analysis.
  6350  	livenessMap liveness.Map
  6351  
  6352  	// partLiveArgs includes arguments that may be partially live, for which we
  6353  	// need to generate instructions that spill the argument registers.
  6354  	partLiveArgs map[*ir.Name]bool
  6355  
  6356  	// lineRunStart records the beginning of the current run of instructions
  6357  	// within a single block sharing the same line number
  6358  	// Used to move statement marks to the beginning of such runs.
  6359  	lineRunStart *obj.Prog
  6360  
  6361  	// wasm: The number of values on the WebAssembly stack. This is only used as a safeguard.
  6362  	OnWasmStackSkipped int
  6363  }
  6364  
  6365  func (s *State) FuncInfo() *obj.FuncInfo {
  6366  	return s.pp.CurFunc.LSym.Func()
  6367  }
  6368  
  6369  // Prog appends a new Prog.
  6370  func (s *State) Prog(as obj.As) *obj.Prog {
  6371  	p := s.pp.Prog(as)
  6372  	if objw.LosesStmtMark(as) {
  6373  		return p
  6374  	}
  6375  	// Float a statement start to the beginning of any same-line run.
  6376  	// lineRunStart is reset at block boundaries, which appears to work well.
  6377  	if s.lineRunStart == nil || s.lineRunStart.Pos.Line() != p.Pos.Line() {
  6378  		s.lineRunStart = p
  6379  	} else if p.Pos.IsStmt() == src.PosIsStmt {
  6380  		s.lineRunStart.Pos = s.lineRunStart.Pos.WithIsStmt()
  6381  		p.Pos = p.Pos.WithNotStmt()
  6382  	}
  6383  	return p
  6384  }
  6385  
  6386  // Pc returns the current Prog.
  6387  func (s *State) Pc() *obj.Prog {
  6388  	return s.pp.Next
  6389  }
  6390  
  6391  // SetPos sets the current source position.
  6392  func (s *State) SetPos(pos src.XPos) {
  6393  	s.pp.Pos = pos
  6394  }
  6395  
  6396  // Br emits a single branch instruction and returns the instruction.
  6397  // Not all architectures need the returned instruction, but otherwise
  6398  // the boilerplate is common to all.
  6399  func (s *State) Br(op obj.As, target *ssa.Block) *obj.Prog {
  6400  	p := s.Prog(op)
  6401  	p.To.Type = obj.TYPE_BRANCH
  6402  	s.Branches = append(s.Branches, Branch{P: p, B: target})
  6403  	return p
  6404  }
  6405  
  6406  // DebugFriendlySetPosFrom adjusts Pos.IsStmt subject to heuristics
  6407  // that reduce "jumpy" line number churn when debugging.
  6408  // Spill/fill/copy instructions from the register allocator,
  6409  // phi functions, and instructions with a no-pos position
  6410  // are examples of instructions that can cause churn.
  6411  func (s *State) DebugFriendlySetPosFrom(v *ssa.Value) {
  6412  	switch v.Op {
  6413  	case ssa.OpPhi, ssa.OpCopy, ssa.OpLoadReg, ssa.OpStoreReg:
  6414  		// These are not statements
  6415  		s.SetPos(v.Pos.WithNotStmt())
  6416  	default:
  6417  		p := v.Pos
  6418  		if p != src.NoXPos {
  6419  			// If the position is defined, update the position.
  6420  			// Also convert default IsStmt to NotStmt; only
  6421  			// explicit statement boundaries should appear
  6422  			// in the generated code.
  6423  			if p.IsStmt() != src.PosIsStmt {
  6424  				if s.pp.Pos.IsStmt() == src.PosIsStmt && s.pp.Pos.SameFileAndLine(p) {
  6425  					// If s.pp.Pos already has a statement mark, then it was set here (below) for
  6426  					// the previous value.  If an actual instruction had been emitted for that
  6427  					// value, then the statement mark would have been reset.  Since the statement
  6428  					// mark of s.pp.Pos was not reset, this position (file/line) still needs a
  6429  					// statement mark on an instruction.  If file and line for this value are
  6430  					// the same as the previous value, then the first instruction for this
  6431  					// value will work to take the statement mark.  Return early to avoid
  6432  					// resetting the statement mark.
  6433  					//
  6434  					// The reset of s.pp.Pos occurs in (*Progs).Prog() -- if it emits
  6435  					// an instruction, and the instruction's statement mark was set,
  6436  					// and it is not one of the LosesStmtMark instructions,
  6437  					// then Prog() resets the statement mark on the (*Progs).Pos.
  6438  					return
  6439  				}
  6440  				p = p.WithNotStmt()
  6441  				// Calls use the pos attached to v, but copy the statement mark from State
  6442  			}
  6443  			s.SetPos(p)
  6444  		} else {
  6445  			s.SetPos(s.pp.Pos.WithNotStmt())
  6446  		}
  6447  	}
  6448  }
  6449  
  6450  // emit argument info (locations on stack) for traceback.
  6451  func emitArgInfo(e *ssafn, f *ssa.Func, pp *objw.Progs) {
  6452  	ft := e.curfn.Type()
  6453  	if ft.NumRecvs() == 0 && ft.NumParams() == 0 {
  6454  		return
  6455  	}
  6456  
  6457  	x := EmitArgInfo(e.curfn, f.OwnAux.ABIInfo())
  6458  	x.Set(obj.AttrContentAddressable, true)
  6459  	e.curfn.LSym.Func().ArgInfo = x
  6460  
  6461  	// Emit a funcdata pointing at the arg info data.
  6462  	p := pp.Prog(obj.AFUNCDATA)
  6463  	p.From.SetConst(rtabi.FUNCDATA_ArgInfo)
  6464  	p.To.Type = obj.TYPE_MEM
  6465  	p.To.Name = obj.NAME_EXTERN
  6466  	p.To.Sym = x
  6467  }
  6468  
  6469  // emit argument info (locations on stack) of f for traceback.
  6470  func EmitArgInfo(f *ir.Func, abiInfo *abi.ABIParamResultInfo) *obj.LSym {
  6471  	x := base.Ctxt.Lookup(fmt.Sprintf("%s.arginfo%d", f.LSym.Name, f.ABI))
  6472  	// NOTE: do not set ContentAddressable here. This may be referenced from
  6473  	// assembly code by name (in this case f is a declaration).
  6474  	// Instead, set it in emitArgInfo above.
  6475  
  6476  	PtrSize := int64(types.PtrSize)
  6477  	uintptrTyp := types.Types[types.TUINTPTR]
  6478  
  6479  	isAggregate := func(t *types.Type) bool {
  6480  		return t.IsStruct() || t.IsArray() || t.IsComplex() || t.IsInterface() || t.IsString() || t.IsSlice()
  6481  	}
  6482  
  6483  	wOff := 0
  6484  	n := 0
  6485  	writebyte := func(o uint8) { wOff = objw.Uint8(x, wOff, o) }
  6486  
  6487  	// Write one non-aggregate arg/field/element.
  6488  	write1 := func(sz, offset int64) {
  6489  		if offset >= rtabi.TraceArgsSpecial {
  6490  			writebyte(rtabi.TraceArgsOffsetTooLarge)
  6491  		} else {
  6492  			writebyte(uint8(offset))
  6493  			writebyte(uint8(sz))
  6494  		}
  6495  		n++
  6496  	}
  6497  
  6498  	// Visit t recursively and write it out.
  6499  	// Returns whether to continue visiting.
  6500  	var visitType func(baseOffset int64, t *types.Type, depth int) bool
  6501  	visitType = func(baseOffset int64, t *types.Type, depth int) bool {
  6502  		if n >= rtabi.TraceArgsLimit {
  6503  			writebyte(rtabi.TraceArgsDotdotdot)
  6504  			return false
  6505  		}
  6506  		if !isAggregate(t) {
  6507  			write1(t.Size(), baseOffset)
  6508  			return true
  6509  		}
  6510  		writebyte(rtabi.TraceArgsStartAgg)
  6511  		depth++
  6512  		if depth >= rtabi.TraceArgsMaxDepth {
  6513  			writebyte(rtabi.TraceArgsDotdotdot)
  6514  			writebyte(rtabi.TraceArgsEndAgg)
  6515  			n++
  6516  			return true
  6517  		}
  6518  		switch {
  6519  		case t.IsInterface(), t.IsString():
  6520  			_ = visitType(baseOffset, uintptrTyp, depth) &&
  6521  				visitType(baseOffset+PtrSize, uintptrTyp, depth)
  6522  		case t.IsSlice():
  6523  			_ = visitType(baseOffset, uintptrTyp, depth) &&
  6524  				visitType(baseOffset+PtrSize, uintptrTyp, depth) &&
  6525  				visitType(baseOffset+PtrSize*2, uintptrTyp, depth)
  6526  		case t.IsComplex():
  6527  			_ = visitType(baseOffset, types.FloatForComplex(t), depth) &&
  6528  				visitType(baseOffset+t.Size()/2, types.FloatForComplex(t), depth)
  6529  		case t.IsArray():
  6530  			if t.NumElem() == 0 {
  6531  				n++ // {} counts as a component
  6532  				break
  6533  			}
  6534  			for i := int64(0); i < t.NumElem(); i++ {
  6535  				if !visitType(baseOffset, t.Elem(), depth) {
  6536  					break
  6537  				}
  6538  				baseOffset += t.Elem().Size()
  6539  			}
  6540  		case t.IsStruct():
  6541  			if t.NumFields() == 0 {
  6542  				n++ // {} counts as a component
  6543  				break
  6544  			}
  6545  			for _, field := range t.Fields() {
  6546  				if !visitType(baseOffset+field.Offset, field.Type, depth) {
  6547  					break
  6548  				}
  6549  			}
  6550  		}
  6551  		writebyte(rtabi.TraceArgsEndAgg)
  6552  		return true
  6553  	}
  6554  
  6555  	start := 0
  6556  	if strings.Contains(f.LSym.Name, "[") {
  6557  		// Skip the dictionary argument - it is implicit and the user doesn't need to see it.
  6558  		start = 1
  6559  	}
  6560  
  6561  	for _, a := range abiInfo.InParams()[start:] {
  6562  		if !visitType(a.FrameOffset(abiInfo), a.Type, 0) {
  6563  			break
  6564  		}
  6565  	}
  6566  	writebyte(rtabi.TraceArgsEndSeq)
  6567  	if wOff > rtabi.TraceArgsMaxLen {
  6568  		base.Fatalf("ArgInfo too large")
  6569  	}
  6570  
  6571  	return x
  6572  }
  6573  
  6574  // for wrapper, emit info of wrapped function.
  6575  func emitWrappedFuncInfo(e *ssafn, pp *objw.Progs) {
  6576  	if base.Ctxt.Flag_linkshared {
  6577  		// Relative reference (SymPtrOff) to another shared object doesn't work.
  6578  		// Unfortunate.
  6579  		return
  6580  	}
  6581  
  6582  	wfn := e.curfn.WrappedFunc
  6583  	if wfn == nil {
  6584  		return
  6585  	}
  6586  
  6587  	wsym := wfn.Linksym()
  6588  	x := base.Ctxt.LookupInit(fmt.Sprintf("%s.wrapinfo", wsym.Name), func(x *obj.LSym) {
  6589  		objw.SymPtrOff(x, 0, wsym)
  6590  		x.Set(obj.AttrContentAddressable, true)
  6591  	})
  6592  	e.curfn.LSym.Func().WrapInfo = x
  6593  
  6594  	// Emit a funcdata pointing at the wrap info data.
  6595  	p := pp.Prog(obj.AFUNCDATA)
  6596  	p.From.SetConst(rtabi.FUNCDATA_WrapInfo)
  6597  	p.To.Type = obj.TYPE_MEM
  6598  	p.To.Name = obj.NAME_EXTERN
  6599  	p.To.Sym = x
  6600  }
  6601  
  6602  // genssa appends entries to pp for each instruction in f.
  6603  func genssa(f *ssa.Func, pp *objw.Progs) {
  6604  	var s State
  6605  	s.ABI = f.OwnAux.Fn.ABI()
  6606  
  6607  	e := f.Frontend().(*ssafn)
  6608  
  6609  	gatherPrintInfo := f.PrintOrHtmlSSA || ssa.GenssaDump[f.Name]
  6610  
  6611  	var lv *liveness.Liveness
  6612  	s.livenessMap, s.partLiveArgs, lv = liveness.Compute(e.curfn, f, e.stkptrsize, pp, gatherPrintInfo)
  6613  	emitArgInfo(e, f, pp)
  6614  	argLiveBlockMap, argLiveValueMap := liveness.ArgLiveness(e.curfn, f, pp)
  6615  
  6616  	openDeferInfo := e.curfn.LSym.Func().OpenCodedDeferInfo
  6617  	if openDeferInfo != nil {
  6618  		// This function uses open-coded defers -- write out the funcdata
  6619  		// info that we computed at the end of genssa.
  6620  		p := pp.Prog(obj.AFUNCDATA)
  6621  		p.From.SetConst(rtabi.FUNCDATA_OpenCodedDeferInfo)
  6622  		p.To.Type = obj.TYPE_MEM
  6623  		p.To.Name = obj.NAME_EXTERN
  6624  		p.To.Sym = openDeferInfo
  6625  	}
  6626  
  6627  	emitWrappedFuncInfo(e, pp)
  6628  
  6629  	// Remember where each block starts.
  6630  	s.bstart = make([]*obj.Prog, f.NumBlocks())
  6631  	s.pp = pp
  6632  	var progToValue map[*obj.Prog]*ssa.Value
  6633  	var progToBlock map[*obj.Prog]*ssa.Block
  6634  	var valueToProgAfter []*obj.Prog // The first Prog following computation of a value v; v is visible at this point.
  6635  	if gatherPrintInfo {
  6636  		progToValue = make(map[*obj.Prog]*ssa.Value, f.NumValues())
  6637  		progToBlock = make(map[*obj.Prog]*ssa.Block, f.NumBlocks())
  6638  		f.Logf("genssa %s\n", f.Name)
  6639  		progToBlock[s.pp.Next] = f.Blocks[0]
  6640  	}
  6641  
  6642  	if base.Ctxt.Flag_locationlists {
  6643  		if cap(f.Cache.ValueToProgAfter) < f.NumValues() {
  6644  			f.Cache.ValueToProgAfter = make([]*obj.Prog, f.NumValues())
  6645  		}
  6646  		valueToProgAfter = f.Cache.ValueToProgAfter[:f.NumValues()]
  6647  		clear(valueToProgAfter)
  6648  	}
  6649  
  6650  	// If the very first instruction is not tagged as a statement,
  6651  	// debuggers may attribute it to previous function in program.
  6652  	firstPos := src.NoXPos
  6653  	for _, v := range f.Entry.Values {
  6654  		if v.Pos.IsStmt() == src.PosIsStmt && v.Op != ssa.OpArg && v.Op != ssa.OpArgIntReg && v.Op != ssa.OpArgFloatReg && v.Op != ssa.OpLoadReg && v.Op != ssa.OpStoreReg {
  6655  			firstPos = v.Pos
  6656  			v.Pos = firstPos.WithDefaultStmt()
  6657  			break
  6658  		}
  6659  	}
  6660  
  6661  	// inlMarks has an entry for each Prog that implements an inline mark.
  6662  	// It maps from that Prog to the global inlining id of the inlined body
  6663  	// which should unwind to this Prog's location.
  6664  	var inlMarks map[*obj.Prog]int32
  6665  	var inlMarkList []*obj.Prog
  6666  
  6667  	// inlMarksByPos maps from a (column 1) source position to the set of
  6668  	// Progs that are in the set above and have that source position.
  6669  	var inlMarksByPos map[src.XPos][]*obj.Prog
  6670  
  6671  	var argLiveIdx int = -1 // argument liveness info index
  6672  
  6673  	// These control cache line alignment; if the required portion of
  6674  	// a cache line is not available, then pad to obtain cache line
  6675  	// alignment.  Not implemented on all architectures, may not be
  6676  	// useful on all architectures.
  6677  	var hotAlign, hotRequire int64
  6678  
  6679  	if base.Debug.AlignHot > 0 {
  6680  		switch base.Ctxt.Arch.Name {
  6681  		// enable this on a case-by-case basis, with benchmarking.
  6682  		// currently shown:
  6683  		//   good for amd64
  6684  		//   not helpful for Apple Silicon
  6685  		//
  6686  		case "amd64", "386":
  6687  			// Align to 64 if 31 or fewer bytes remain in a cache line
  6688  			// benchmarks a little better than always aligning, and also
  6689  			// adds slightly less to the (PGO-compiled) binary size.
  6690  			hotAlign = 64
  6691  			hotRequire = 31
  6692  		}
  6693  	}
  6694  
  6695  	// Emit basic blocks
  6696  	for i, b := range f.Blocks {
  6697  
  6698  		s.lineRunStart = nil
  6699  		s.SetPos(s.pp.Pos.WithNotStmt()) // It needs a non-empty Pos, but cannot be a statement boundary (yet).
  6700  
  6701  		if hotAlign > 0 && b.Hotness&ssa.HotPgoInitial == ssa.HotPgoInitial {
  6702  			// So far this has only been shown profitable for PGO-hot loop headers.
  6703  			// The Hotness values allows distinctions between initial blocks that are "hot" or not, and "flow-in" or not.
  6704  			// Currently only the initial blocks of loops are tagged in this way;
  6705  			// there are no blocks tagged "pgo-hot" that are not also tagged "initial".
  6706  			// TODO more heuristics, more architectures.
  6707  			p := s.pp.Prog(obj.APCALIGNMAX)
  6708  			p.From.SetConst(hotAlign)
  6709  			p.To.SetConst(hotRequire)
  6710  		}
  6711  
  6712  		s.bstart[b.ID] = s.pp.Next
  6713  
  6714  		if idx, ok := argLiveBlockMap[b.ID]; ok && idx != argLiveIdx {
  6715  			argLiveIdx = idx
  6716  			p := s.pp.Prog(obj.APCDATA)
  6717  			p.From.SetConst(rtabi.PCDATA_ArgLiveIndex)
  6718  			p.To.SetConst(int64(idx))
  6719  		}
  6720  
  6721  		// Emit values in block
  6722  		Arch.SSAMarkMoves(&s, b)
  6723  		for _, v := range b.Values {
  6724  			x := s.pp.Next
  6725  			s.DebugFriendlySetPosFrom(v)
  6726  
  6727  			if v.Op.ResultInArg0() && v.ResultReg() != v.Args[0].Reg() {
  6728  				v.Fatalf("input[0] and output not in same register %s", v.LongString())
  6729  			}
  6730  
  6731  			switch v.Op {
  6732  			case ssa.OpInitMem:
  6733  				// memory arg needs no code
  6734  			case ssa.OpArg:
  6735  				// input args need no code
  6736  			case ssa.OpSP, ssa.OpSB:
  6737  				// nothing to do
  6738  			case ssa.OpSelect0, ssa.OpSelect1, ssa.OpSelectN, ssa.OpMakeResult:
  6739  				// nothing to do
  6740  			case ssa.OpGetG:
  6741  				// nothing to do when there's a g register,
  6742  				// and checkLower complains if there's not
  6743  			case ssa.OpVarDef, ssa.OpVarLive, ssa.OpKeepAlive, ssa.OpWBend:
  6744  				// nothing to do; already used by liveness
  6745  			case ssa.OpPhi:
  6746  				CheckLoweredPhi(v)
  6747  			case ssa.OpConvert:
  6748  				// nothing to do; no-op conversion for liveness
  6749  				if v.Args[0].Reg() != v.Reg() {
  6750  					v.Fatalf("OpConvert should be a no-op: %s; %s", v.Args[0].LongString(), v.LongString())
  6751  				}
  6752  			case ssa.OpInlMark:
  6753  				p := Arch.Ginsnop(s.pp)
  6754  				if inlMarks == nil {
  6755  					inlMarks = map[*obj.Prog]int32{}
  6756  					inlMarksByPos = map[src.XPos][]*obj.Prog{}
  6757  				}
  6758  				inlMarks[p] = v.AuxInt32()
  6759  				inlMarkList = append(inlMarkList, p)
  6760  				pos := v.Pos.AtColumn1()
  6761  				inlMarksByPos[pos] = append(inlMarksByPos[pos], p)
  6762  				firstPos = src.NoXPos
  6763  
  6764  			default:
  6765  				// Special case for first line in function; move it to the start (which cannot be a register-valued instruction)
  6766  				if firstPos != src.NoXPos && v.Op != ssa.OpArgIntReg && v.Op != ssa.OpArgFloatReg && v.Op != ssa.OpLoadReg && v.Op != ssa.OpStoreReg {
  6767  					s.SetPos(firstPos)
  6768  					firstPos = src.NoXPos
  6769  				}
  6770  				// Attach this safe point to the next
  6771  				// instruction.
  6772  				s.pp.NextLive = s.livenessMap.Get(v)
  6773  				s.pp.NextUnsafe = s.livenessMap.GetUnsafe(v)
  6774  
  6775  				// let the backend handle it
  6776  				Arch.SSAGenValue(&s, v)
  6777  			}
  6778  
  6779  			if idx, ok := argLiveValueMap[v.ID]; ok && idx != argLiveIdx {
  6780  				argLiveIdx = idx
  6781  				p := s.pp.Prog(obj.APCDATA)
  6782  				p.From.SetConst(rtabi.PCDATA_ArgLiveIndex)
  6783  				p.To.SetConst(int64(idx))
  6784  			}
  6785  
  6786  			if base.Ctxt.Flag_locationlists {
  6787  				valueToProgAfter[v.ID] = s.pp.Next
  6788  			}
  6789  
  6790  			if gatherPrintInfo {
  6791  				for ; x != s.pp.Next; x = x.Link {
  6792  					progToValue[x] = v
  6793  				}
  6794  			}
  6795  		}
  6796  		// If this is an empty infinite loop, stick a hardware NOP in there so that debuggers are less confused.
  6797  		if s.bstart[b.ID] == s.pp.Next && len(b.Succs) == 1 && b.Succs[0].Block() == b {
  6798  			p := Arch.Ginsnop(s.pp)
  6799  			p.Pos = p.Pos.WithIsStmt()
  6800  			if b.Pos == src.NoXPos {
  6801  				b.Pos = p.Pos // It needs a file, otherwise a no-file non-zero line causes confusion.  See #35652.
  6802  				if b.Pos == src.NoXPos {
  6803  					b.Pos = s.pp.Text.Pos // Sometimes p.Pos is empty.  See #35695.
  6804  				}
  6805  			}
  6806  			b.Pos = b.Pos.WithBogusLine() // Debuggers are not good about infinite loops, force a change in line number
  6807  		}
  6808  
  6809  		// Set unsafe mark for any end-of-block generated instructions
  6810  		// (normally, conditional or unconditional branches).
  6811  		// This is particularly important for empty blocks, as there
  6812  		// are no values to inherit the unsafe mark from.
  6813  		s.pp.NextUnsafe = s.livenessMap.GetUnsafeBlock(b)
  6814  
  6815  		// Emit control flow instructions for block
  6816  		var next *ssa.Block
  6817  		if i < len(f.Blocks)-1 && base.Flag.N == 0 {
  6818  			// If -N, leave next==nil so every block with successors
  6819  			// ends in a JMP (except call blocks - plive doesn't like
  6820  			// select{send,recv} followed by a JMP call).  Helps keep
  6821  			// line numbers for otherwise empty blocks.
  6822  			next = f.Blocks[i+1]
  6823  		}
  6824  		x := s.pp.Next
  6825  		s.SetPos(b.Pos)
  6826  		Arch.SSAGenBlock(&s, b, next)
  6827  		if gatherPrintInfo {
  6828  			for ; x != s.pp.Next; x = x.Link {
  6829  				progToBlock[x] = b
  6830  			}
  6831  		}
  6832  	}
  6833  	if f.Blocks[len(f.Blocks)-1].Kind == ssa.BlockExit {
  6834  		// We need the return address of a panic call to
  6835  		// still be inside the function in question. So if
  6836  		// it ends in a call which doesn't return, add a
  6837  		// nop (which will never execute) after the call.
  6838  		Arch.Ginsnop(s.pp)
  6839  	}
  6840  	if openDeferInfo != nil {
  6841  		// When doing open-coded defers, generate a disconnected call to
  6842  		// deferreturn and a return. This will be used to during panic
  6843  		// recovery to unwind the stack and return back to the runtime.
  6844  
  6845  		// Note that this exit code doesn't work if a return parameter
  6846  		// is heap-allocated, but open defers aren't enabled in that case.
  6847  
  6848  		// TODO either make this handle heap-allocated return parameters or reuse the other-defers general-purpose code path.
  6849  		s.pp.NextLive = s.livenessMap.DeferReturn
  6850  		p := s.pp.Prog(obj.ACALL)
  6851  		p.To.Type = obj.TYPE_MEM
  6852  		p.To.Name = obj.NAME_EXTERN
  6853  		p.To.Sym = ir.Syms.Deferreturn
  6854  
  6855  		// Load results into registers. So when a deferred function
  6856  		// recovers a panic, it will return to caller with right results.
  6857  		// The results are already in memory, because they are not SSA'd
  6858  		// when the function has defers (see canSSAName).
  6859  		for _, o := range f.OwnAux.ABIInfo().OutParams() {
  6860  			n := o.Name
  6861  			rts, offs := o.RegisterTypesAndOffsets()
  6862  			for i := range o.Registers {
  6863  				Arch.LoadRegResult(&s, f, rts[i], ssa.ObjRegForAbiReg(o.Registers[i], f.Config), n, offs[i])
  6864  			}
  6865  		}
  6866  
  6867  		s.pp.Prog(obj.ARET)
  6868  	}
  6869  
  6870  	if inlMarks != nil {
  6871  		hasCall := false
  6872  
  6873  		// We have some inline marks. Try to find other instructions we're
  6874  		// going to emit anyway, and use those instructions instead of the
  6875  		// inline marks.
  6876  		for p := s.pp.Text; p != nil; p = p.Link {
  6877  			if p.As == obj.ANOP || p.As == obj.AFUNCDATA || p.As == obj.APCDATA || p.As == obj.ATEXT ||
  6878  				p.As == obj.APCALIGN || p.As == obj.APCALIGNMAX || Arch.LinkArch.Family == sys.Wasm {
  6879  				// Don't use 0-sized instructions as inline marks, because we need
  6880  				// to identify inline mark instructions by pc offset.
  6881  				// (Some of these instructions are sometimes zero-sized, sometimes not.
  6882  				// We must not use anything that even might be zero-sized.)
  6883  				// TODO: are there others?
  6884  				continue
  6885  			}
  6886  			if _, ok := inlMarks[p]; ok {
  6887  				// Don't use inline marks themselves. We don't know
  6888  				// whether they will be zero-sized or not yet.
  6889  				continue
  6890  			}
  6891  			if p.As == obj.ACALL || p.As == obj.ADUFFCOPY || p.As == obj.ADUFFZERO {
  6892  				hasCall = true
  6893  			}
  6894  			pos := p.Pos.AtColumn1()
  6895  			marks := inlMarksByPos[pos]
  6896  			if len(marks) == 0 {
  6897  				continue
  6898  			}
  6899  			for _, m := range marks {
  6900  				// We found an instruction with the same source position as
  6901  				// some of the inline marks.
  6902  				// Use this instruction instead.
  6903  				p.Pos = p.Pos.WithIsStmt() // promote position to a statement
  6904  				s.pp.CurFunc.LSym.Func().AddInlMark(p, inlMarks[m])
  6905  				// Make the inline mark a real nop, so it doesn't generate any code.
  6906  				m.As = obj.ANOP
  6907  				m.Pos = src.NoXPos
  6908  				m.From = obj.Addr{}
  6909  				m.To = obj.Addr{}
  6910  			}
  6911  			delete(inlMarksByPos, pos)
  6912  		}
  6913  		// Any unmatched inline marks now need to be added to the inlining tree (and will generate a nop instruction).
  6914  		for _, p := range inlMarkList {
  6915  			if p.As != obj.ANOP {
  6916  				s.pp.CurFunc.LSym.Func().AddInlMark(p, inlMarks[p])
  6917  			}
  6918  		}
  6919  
  6920  		if e.stksize == 0 && !hasCall {
  6921  			// Frameless leaf function. It doesn't need any preamble,
  6922  			// so make sure its first instruction isn't from an inlined callee.
  6923  			// If it is, add a nop at the start of the function with a position
  6924  			// equal to the start of the function.
  6925  			// This ensures that runtime.FuncForPC(uintptr(reflect.ValueOf(fn).Pointer())).Name()
  6926  			// returns the right answer. See issue 58300.
  6927  			for p := s.pp.Text; p != nil; p = p.Link {
  6928  				if p.As == obj.AFUNCDATA || p.As == obj.APCDATA || p.As == obj.ATEXT || p.As == obj.ANOP {
  6929  					continue
  6930  				}
  6931  				if base.Ctxt.PosTable.Pos(p.Pos).Base().InliningIndex() >= 0 {
  6932  					// Make a real (not 0-sized) nop.
  6933  					nop := Arch.Ginsnop(s.pp)
  6934  					nop.Pos = e.curfn.Pos().WithIsStmt()
  6935  
  6936  					// Unfortunately, Ginsnop puts the instruction at the
  6937  					// end of the list. Move it up to just before p.
  6938  
  6939  					// Unlink from the current list.
  6940  					for x := s.pp.Text; x != nil; x = x.Link {
  6941  						if x.Link == nop {
  6942  							x.Link = nop.Link
  6943  							break
  6944  						}
  6945  					}
  6946  					// Splice in right before p.
  6947  					for x := s.pp.Text; x != nil; x = x.Link {
  6948  						if x.Link == p {
  6949  							nop.Link = p
  6950  							x.Link = nop
  6951  							break
  6952  						}
  6953  					}
  6954  				}
  6955  				break
  6956  			}
  6957  		}
  6958  	}
  6959  
  6960  	if base.Ctxt.Flag_locationlists {
  6961  		var debugInfo *ssa.FuncDebug
  6962  		debugInfo = e.curfn.DebugInfo.(*ssa.FuncDebug)
  6963  		// Save off entry ID in case we need it later for DWARF generation
  6964  		// for return values promoted to the heap.
  6965  		debugInfo.EntryID = f.Entry.ID
  6966  		if e.curfn.ABI == obj.ABIInternal && base.Flag.N != 0 {
  6967  			ssa.BuildFuncDebugNoOptimized(base.Ctxt, f, base.Debug.LocationLists > 1, StackOffset, debugInfo)
  6968  		} else {
  6969  			ssa.BuildFuncDebug(base.Ctxt, f, base.Debug.LocationLists, StackOffset, debugInfo)
  6970  		}
  6971  		bstart := s.bstart
  6972  		idToIdx := make([]int, f.NumBlocks())
  6973  		for i, b := range f.Blocks {
  6974  			idToIdx[b.ID] = i
  6975  		}
  6976  		// Register a callback that will be used later to fill in PCs into location
  6977  		// lists. At the moment, Prog.Pc is a sequence number; it's not a real PC
  6978  		// until after assembly, so the translation needs to be deferred.
  6979  		debugInfo.GetPC = func(b, v ssa.ID) int64 {
  6980  			switch v {
  6981  			case ssa.BlockStart.ID:
  6982  				if b == f.Entry.ID {
  6983  					return 0 // Start at the very beginning, at the assembler-generated prologue.
  6984  					// this should only happen for function args (ssa.OpArg)
  6985  				}
  6986  				return bstart[b].Pc
  6987  			case ssa.BlockEnd.ID:
  6988  				blk := f.Blocks[idToIdx[b]]
  6989  				nv := len(blk.Values)
  6990  				return valueToProgAfter[blk.Values[nv-1].ID].Pc
  6991  			case ssa.FuncEnd.ID:
  6992  				return e.curfn.LSym.Size
  6993  			default:
  6994  				return valueToProgAfter[v].Pc
  6995  			}
  6996  		}
  6997  	}
  6998  
  6999  	// Resolve branches, and relax DefaultStmt into NotStmt
  7000  	for _, br := range s.Branches {
  7001  		br.P.To.SetTarget(s.bstart[br.B.ID])
  7002  		if br.P.Pos.IsStmt() != src.PosIsStmt {
  7003  			br.P.Pos = br.P.Pos.WithNotStmt()
  7004  		} else if v0 := br.B.FirstPossibleStmtValue(); v0 != nil && v0.Pos.Line() == br.P.Pos.Line() && v0.Pos.IsStmt() == src.PosIsStmt {
  7005  			br.P.Pos = br.P.Pos.WithNotStmt()
  7006  		}
  7007  
  7008  	}
  7009  
  7010  	// Resolve jump table destinations.
  7011  	for _, jt := range s.JumpTables {
  7012  		// Convert from *Block targets to *Prog targets.
  7013  		targets := make([]*obj.Prog, len(jt.Succs))
  7014  		for i, e := range jt.Succs {
  7015  			targets[i] = s.bstart[e.Block().ID]
  7016  		}
  7017  		// Add to list of jump tables to be resolved at assembly time.
  7018  		// The assembler converts from *Prog entries to absolute addresses
  7019  		// once it knows instruction byte offsets.
  7020  		fi := s.pp.CurFunc.LSym.Func()
  7021  		fi.JumpTables = append(fi.JumpTables, obj.JumpTable{Sym: jt.Aux.(*obj.LSym), Targets: targets})
  7022  	}
  7023  
  7024  	if e.log { // spew to stdout
  7025  		filename := ""
  7026  		for p := s.pp.Text; p != nil; p = p.Link {
  7027  			if p.Pos.IsKnown() && p.InnermostFilename() != filename {
  7028  				filename = p.InnermostFilename()
  7029  				f.Logf("# %s\n", filename)
  7030  			}
  7031  
  7032  			var s string
  7033  			if v, ok := progToValue[p]; ok {
  7034  				s = v.String()
  7035  			} else if b, ok := progToBlock[p]; ok {
  7036  				s = b.String()
  7037  			} else {
  7038  				s = "   " // most value and branch strings are 2-3 characters long
  7039  			}
  7040  			f.Logf(" %-6s\t%.5d (%s)\t%s\n", s, p.Pc, p.InnermostLineNumber(), p.InstructionString())
  7041  		}
  7042  	}
  7043  	if f.HTMLWriter != nil { // spew to ssa.html
  7044  		var buf strings.Builder
  7045  		buf.WriteString("<code>")
  7046  		buf.WriteString("<dl class=\"ssa-gen\">")
  7047  		filename := ""
  7048  
  7049  		liveness := lv.Format(nil)
  7050  		if liveness != "" {
  7051  			buf.WriteString("<dt class=\"ssa-prog-src\"></dt><dd class=\"ssa-prog\">")
  7052  			buf.WriteString(html.EscapeString("# " + liveness))
  7053  			buf.WriteString("</dd>")
  7054  		}
  7055  
  7056  		for p := s.pp.Text; p != nil; p = p.Link {
  7057  			// Don't spam every line with the file name, which is often huge.
  7058  			// Only print changes, and "unknown" is not a change.
  7059  			if p.Pos.IsKnown() && p.InnermostFilename() != filename {
  7060  				filename = p.InnermostFilename()
  7061  				buf.WriteString("<dt class=\"ssa-prog-src\"></dt><dd class=\"ssa-prog\">")
  7062  				buf.WriteString(html.EscapeString("# " + filename))
  7063  				buf.WriteString("</dd>")
  7064  			}
  7065  
  7066  			buf.WriteString("<dt class=\"ssa-prog-src\">")
  7067  			if v, ok := progToValue[p]; ok {
  7068  
  7069  				// Prefix calls with their liveness, if any
  7070  				if p.As != obj.APCDATA {
  7071  					if liveness := lv.Format(v); liveness != "" {
  7072  						// Steal this line, and restart a line
  7073  						buf.WriteString("</dt><dd class=\"ssa-prog\">")
  7074  						buf.WriteString(html.EscapeString("# " + liveness))
  7075  						buf.WriteString("</dd>")
  7076  						// restarting a line
  7077  						buf.WriteString("<dt class=\"ssa-prog-src\">")
  7078  					}
  7079  				}
  7080  
  7081  				buf.WriteString(v.HTML())
  7082  			} else if b, ok := progToBlock[p]; ok {
  7083  				buf.WriteString("<b>" + b.HTML() + "</b>")
  7084  			}
  7085  			buf.WriteString("</dt>")
  7086  			buf.WriteString("<dd class=\"ssa-prog\">")
  7087  			fmt.Fprintf(&buf, "%.5d <span class=\"l%v line-number\">(%s)</span> %s", p.Pc, p.InnermostLineNumber(), p.InnermostLineNumberHTML(), html.EscapeString(p.InstructionString()))
  7088  			buf.WriteString("</dd>")
  7089  		}
  7090  		buf.WriteString("</dl>")
  7091  		buf.WriteString("</code>")
  7092  		f.HTMLWriter.WriteColumn("genssa", "genssa", "ssa-prog", buf.String())
  7093  	}
  7094  	if ssa.GenssaDump[f.Name] {
  7095  		fi := f.DumpFileForPhase("genssa")
  7096  		if fi != nil {
  7097  
  7098  			// inliningDiffers if any filename changes or if any line number except the innermost (last index) changes.
  7099  			inliningDiffers := func(a, b []src.Pos) bool {
  7100  				if len(a) != len(b) {
  7101  					return true
  7102  				}
  7103  				for i := range a {
  7104  					if a[i].Filename() != b[i].Filename() {
  7105  						return true
  7106  					}
  7107  					if i != len(a)-1 && a[i].Line() != b[i].Line() {
  7108  						return true
  7109  					}
  7110  				}
  7111  				return false
  7112  			}
  7113  
  7114  			var allPosOld []src.Pos
  7115  			var allPos []src.Pos
  7116  
  7117  			for p := s.pp.Text; p != nil; p = p.Link {
  7118  				if p.Pos.IsKnown() {
  7119  					allPos = allPos[:0]
  7120  					p.Ctxt.AllPos(p.Pos, func(pos src.Pos) { allPos = append(allPos, pos) })
  7121  					if inliningDiffers(allPos, allPosOld) {
  7122  						for _, pos := range allPos {
  7123  							fmt.Fprintf(fi, "# %s:%d\n", pos.Filename(), pos.Line())
  7124  						}
  7125  						allPos, allPosOld = allPosOld, allPos // swap, not copy, so that they do not share slice storage.
  7126  					}
  7127  				}
  7128  
  7129  				var s string
  7130  				if v, ok := progToValue[p]; ok {
  7131  					s = v.String()
  7132  				} else if b, ok := progToBlock[p]; ok {
  7133  					s = b.String()
  7134  				} else {
  7135  					s = "   " // most value and branch strings are 2-3 characters long
  7136  				}
  7137  				fmt.Fprintf(fi, " %-6s\t%.5d %s\t%s\n", s, p.Pc, ssa.StmtString(p.Pos), p.InstructionString())
  7138  			}
  7139  			fi.Close()
  7140  		}
  7141  	}
  7142  
  7143  	defframe(&s, e, f)
  7144  
  7145  	f.HTMLWriter.Close()
  7146  	f.HTMLWriter = nil
  7147  }
  7148  
  7149  func defframe(s *State, e *ssafn, f *ssa.Func) {
  7150  	pp := s.pp
  7151  
  7152  	s.maxarg = types.RoundUp(s.maxarg, e.stkalign)
  7153  	frame := s.maxarg + e.stksize
  7154  	if Arch.PadFrame != nil {
  7155  		frame = Arch.PadFrame(frame)
  7156  	}
  7157  
  7158  	// Fill in argument and frame size.
  7159  	pp.Text.To.Type = obj.TYPE_TEXTSIZE
  7160  	pp.Text.To.Val = int32(types.RoundUp(f.OwnAux.ArgWidth(), int64(types.RegSize)))
  7161  	pp.Text.To.Offset = frame
  7162  
  7163  	p := pp.Text
  7164  
  7165  	// Insert code to spill argument registers if the named slot may be partially
  7166  	// live. That is, the named slot is considered live by liveness analysis,
  7167  	// (because a part of it is live), but we may not spill all parts into the
  7168  	// slot. This can only happen with aggregate-typed arguments that are SSA-able
  7169  	// and not address-taken (for non-SSA-able or address-taken arguments we always
  7170  	// spill upfront).
  7171  	// Note: spilling is unnecessary in the -N/no-optimize case, since all values
  7172  	// will be considered non-SSAable and spilled up front.
  7173  	// TODO(register args) Make liveness more fine-grained to that partial spilling is okay.
  7174  	if f.OwnAux.ABIInfo().InRegistersUsed() != 0 && base.Flag.N == 0 {
  7175  		// First, see if it is already spilled before it may be live. Look for a spill
  7176  		// in the entry block up to the first safepoint.
  7177  		type nameOff struct {
  7178  			n   *ir.Name
  7179  			off int64
  7180  		}
  7181  		partLiveArgsSpilled := make(map[nameOff]bool)
  7182  		for _, v := range f.Entry.Values {
  7183  			if v.Op.IsCall() {
  7184  				break
  7185  			}
  7186  			if v.Op != ssa.OpStoreReg || v.Args[0].Op != ssa.OpArgIntReg {
  7187  				continue
  7188  			}
  7189  			n, off := ssa.AutoVar(v)
  7190  			if n.Class != ir.PPARAM || n.Addrtaken() || !ssa.CanSSA(n.Type()) || !s.partLiveArgs[n] {
  7191  				continue
  7192  			}
  7193  			partLiveArgsSpilled[nameOff{n, off}] = true
  7194  		}
  7195  
  7196  		// Then, insert code to spill registers if not already.
  7197  		for _, a := range f.OwnAux.ABIInfo().InParams() {
  7198  			n := a.Name
  7199  			if n == nil || n.Addrtaken() || !ssa.CanSSA(n.Type()) || !s.partLiveArgs[n] || len(a.Registers) <= 1 {
  7200  				continue
  7201  			}
  7202  			rts, offs := a.RegisterTypesAndOffsets()
  7203  			for i := range a.Registers {
  7204  				if !rts[i].HasPointers() {
  7205  					continue
  7206  				}
  7207  				if partLiveArgsSpilled[nameOff{n, offs[i]}] {
  7208  					continue // already spilled
  7209  				}
  7210  				reg := ssa.ObjRegForAbiReg(a.Registers[i], f.Config)
  7211  				p = Arch.SpillArgReg(pp, p, f, rts[i], reg, n, offs[i])
  7212  			}
  7213  		}
  7214  	}
  7215  
  7216  	// Insert code to zero ambiguously live variables so that the
  7217  	// garbage collector only sees initialized values when it
  7218  	// looks for pointers.
  7219  	var lo, hi int64
  7220  
  7221  	// Opaque state for backend to use. Current backends use it to
  7222  	// keep track of which helper registers have been zeroed.
  7223  	var state uint32
  7224  
  7225  	// Iterate through declarations. Autos are sorted in decreasing
  7226  	// frame offset order.
  7227  	for _, n := range e.curfn.Dcl {
  7228  		if !n.Needzero() {
  7229  			continue
  7230  		}
  7231  		if n.Class != ir.PAUTO {
  7232  			e.Fatalf(n.Pos(), "needzero class %d", n.Class)
  7233  		}
  7234  		if n.Type().Size()%int64(types.PtrSize) != 0 || n.FrameOffset()%int64(types.PtrSize) != 0 || n.Type().Size() == 0 {
  7235  			e.Fatalf(n.Pos(), "var %L has size %d offset %d", n, n.Type().Size(), n.Offset_)
  7236  		}
  7237  
  7238  		if lo != hi && n.FrameOffset()+n.Type().Size() >= lo-int64(2*types.RegSize) {
  7239  			// Merge with range we already have.
  7240  			lo = n.FrameOffset()
  7241  			continue
  7242  		}
  7243  
  7244  		// Zero old range
  7245  		p = Arch.ZeroRange(pp, p, frame+lo, hi-lo, &state)
  7246  
  7247  		// Set new range.
  7248  		lo = n.FrameOffset()
  7249  		hi = lo + n.Type().Size()
  7250  	}
  7251  
  7252  	// Zero final range.
  7253  	Arch.ZeroRange(pp, p, frame+lo, hi-lo, &state)
  7254  }
  7255  
  7256  // For generating consecutive jump instructions to model a specific branching
  7257  type IndexJump struct {
  7258  	Jump  obj.As
  7259  	Index int
  7260  }
  7261  
  7262  func (s *State) oneJump(b *ssa.Block, jump *IndexJump) {
  7263  	p := s.Br(jump.Jump, b.Succs[jump.Index].Block())
  7264  	p.Pos = b.Pos
  7265  }
  7266  
  7267  // CombJump generates combinational instructions (2 at present) for a block jump,
  7268  // thereby the behaviour of non-standard condition codes could be simulated
  7269  func (s *State) CombJump(b, next *ssa.Block, jumps *[2][2]IndexJump) {
  7270  	switch next {
  7271  	case b.Succs[0].Block():
  7272  		s.oneJump(b, &jumps[0][0])
  7273  		s.oneJump(b, &jumps[0][1])
  7274  	case b.Succs[1].Block():
  7275  		s.oneJump(b, &jumps[1][0])
  7276  		s.oneJump(b, &jumps[1][1])
  7277  	default:
  7278  		var q *obj.Prog
  7279  		if b.Likely != ssa.BranchUnlikely {
  7280  			s.oneJump(b, &jumps[1][0])
  7281  			s.oneJump(b, &jumps[1][1])
  7282  			q = s.Br(obj.AJMP, b.Succs[1].Block())
  7283  		} else {
  7284  			s.oneJump(b, &jumps[0][0])
  7285  			s.oneJump(b, &jumps[0][1])
  7286  			q = s.Br(obj.AJMP, b.Succs[0].Block())
  7287  		}
  7288  		q.Pos = b.Pos
  7289  	}
  7290  }
  7291  
  7292  // AddAux adds the offset in the aux fields (AuxInt and Aux) of v to a.
  7293  func AddAux(a *obj.Addr, v *ssa.Value) {
  7294  	AddAux2(a, v, v.AuxInt)
  7295  }
  7296  func AddAux2(a *obj.Addr, v *ssa.Value, offset int64) {
  7297  	if a.Type != obj.TYPE_MEM && a.Type != obj.TYPE_ADDR {
  7298  		v.Fatalf("bad AddAux addr %v", a)
  7299  	}
  7300  	// add integer offset
  7301  	a.Offset += offset
  7302  
  7303  	// If no additional symbol offset, we're done.
  7304  	if v.Aux == nil {
  7305  		return
  7306  	}
  7307  	// Add symbol's offset from its base register.
  7308  	switch n := v.Aux.(type) {
  7309  	case *ssa.AuxCall:
  7310  		a.Name = obj.NAME_EXTERN
  7311  		a.Sym = n.Fn
  7312  	case *obj.LSym:
  7313  		a.Name = obj.NAME_EXTERN
  7314  		a.Sym = n
  7315  	case *ir.Name:
  7316  		if n.Class == ir.PPARAM || (n.Class == ir.PPARAMOUT && !n.IsOutputParamInRegisters()) {
  7317  			a.Name = obj.NAME_PARAM
  7318  		} else {
  7319  			a.Name = obj.NAME_AUTO
  7320  		}
  7321  		a.Sym = n.Linksym()
  7322  		a.Offset += n.FrameOffset()
  7323  	default:
  7324  		v.Fatalf("aux in %s not implemented %#v", v, v.Aux)
  7325  	}
  7326  }
  7327  
  7328  // extendIndex extends v to a full int width.
  7329  // panic with the given kind if v does not fit in an int (only on 32-bit archs).
  7330  func (s *state) extendIndex(idx, len *ssa.Value, kind ssa.BoundsKind, bounded bool) *ssa.Value {
  7331  	size := idx.Type.Size()
  7332  	if size == s.config.PtrSize {
  7333  		return idx
  7334  	}
  7335  	if size > s.config.PtrSize {
  7336  		// truncate 64-bit indexes on 32-bit pointer archs. Test the
  7337  		// high word and branch to out-of-bounds failure if it is not 0.
  7338  		var lo *ssa.Value
  7339  		if idx.Type.IsSigned() {
  7340  			lo = s.newValue1(ssa.OpInt64Lo, types.Types[types.TINT], idx)
  7341  		} else {
  7342  			lo = s.newValue1(ssa.OpInt64Lo, types.Types[types.TUINT], idx)
  7343  		}
  7344  		if bounded || base.Flag.B != 0 {
  7345  			return lo
  7346  		}
  7347  		bNext := s.f.NewBlock(ssa.BlockPlain)
  7348  		bPanic := s.f.NewBlock(ssa.BlockExit)
  7349  		hi := s.newValue1(ssa.OpInt64Hi, types.Types[types.TUINT32], idx)
  7350  		cmp := s.newValue2(ssa.OpEq32, types.Types[types.TBOOL], hi, s.constInt32(types.Types[types.TUINT32], 0))
  7351  		if !idx.Type.IsSigned() {
  7352  			switch kind {
  7353  			case ssa.BoundsIndex:
  7354  				kind = ssa.BoundsIndexU
  7355  			case ssa.BoundsSliceAlen:
  7356  				kind = ssa.BoundsSliceAlenU
  7357  			case ssa.BoundsSliceAcap:
  7358  				kind = ssa.BoundsSliceAcapU
  7359  			case ssa.BoundsSliceB:
  7360  				kind = ssa.BoundsSliceBU
  7361  			case ssa.BoundsSlice3Alen:
  7362  				kind = ssa.BoundsSlice3AlenU
  7363  			case ssa.BoundsSlice3Acap:
  7364  				kind = ssa.BoundsSlice3AcapU
  7365  			case ssa.BoundsSlice3B:
  7366  				kind = ssa.BoundsSlice3BU
  7367  			case ssa.BoundsSlice3C:
  7368  				kind = ssa.BoundsSlice3CU
  7369  			}
  7370  		}
  7371  		b := s.endBlock()
  7372  		b.Kind = ssa.BlockIf
  7373  		b.SetControl(cmp)
  7374  		b.Likely = ssa.BranchLikely
  7375  		b.AddEdgeTo(bNext)
  7376  		b.AddEdgeTo(bPanic)
  7377  
  7378  		s.startBlock(bPanic)
  7379  		mem := s.newValue4I(ssa.OpPanicExtend, types.TypeMem, int64(kind), hi, lo, len, s.mem())
  7380  		s.endBlock().SetControl(mem)
  7381  		s.startBlock(bNext)
  7382  
  7383  		return lo
  7384  	}
  7385  
  7386  	// Extend value to the required size
  7387  	var op ssa.Op
  7388  	if idx.Type.IsSigned() {
  7389  		switch 10*size + s.config.PtrSize {
  7390  		case 14:
  7391  			op = ssa.OpSignExt8to32
  7392  		case 18:
  7393  			op = ssa.OpSignExt8to64
  7394  		case 24:
  7395  			op = ssa.OpSignExt16to32
  7396  		case 28:
  7397  			op = ssa.OpSignExt16to64
  7398  		case 48:
  7399  			op = ssa.OpSignExt32to64
  7400  		default:
  7401  			s.Fatalf("bad signed index extension %s", idx.Type)
  7402  		}
  7403  	} else {
  7404  		switch 10*size + s.config.PtrSize {
  7405  		case 14:
  7406  			op = ssa.OpZeroExt8to32
  7407  		case 18:
  7408  			op = ssa.OpZeroExt8to64
  7409  		case 24:
  7410  			op = ssa.OpZeroExt16to32
  7411  		case 28:
  7412  			op = ssa.OpZeroExt16to64
  7413  		case 48:
  7414  			op = ssa.OpZeroExt32to64
  7415  		default:
  7416  			s.Fatalf("bad unsigned index extension %s", idx.Type)
  7417  		}
  7418  	}
  7419  	return s.newValue1(op, types.Types[types.TINT], idx)
  7420  }
  7421  
  7422  // CheckLoweredPhi checks that regalloc and stackalloc correctly handled phi values.
  7423  // Called during ssaGenValue.
  7424  func CheckLoweredPhi(v *ssa.Value) {
  7425  	if v.Op != ssa.OpPhi {
  7426  		v.Fatalf("CheckLoweredPhi called with non-phi value: %v", v.LongString())
  7427  	}
  7428  	if v.Type.IsMemory() {
  7429  		return
  7430  	}
  7431  	f := v.Block.Func
  7432  	loc := f.RegAlloc[v.ID]
  7433  	for _, a := range v.Args {
  7434  		if aloc := f.RegAlloc[a.ID]; aloc != loc { // TODO: .Equal() instead?
  7435  			v.Fatalf("phi arg at different location than phi: %v @ %s, but arg %v @ %s\n%s\n", v, loc, a, aloc, v.Block.Func)
  7436  		}
  7437  	}
  7438  }
  7439  
  7440  // CheckLoweredGetClosurePtr checks that v is the first instruction in the function's entry block,
  7441  // except for incoming in-register arguments.
  7442  // The output of LoweredGetClosurePtr is generally hardwired to the correct register.
  7443  // That register contains the closure pointer on closure entry.
  7444  func CheckLoweredGetClosurePtr(v *ssa.Value) {
  7445  	entry := v.Block.Func.Entry
  7446  	if entry != v.Block {
  7447  		base.Fatalf("in %s, badly placed LoweredGetClosurePtr: %v %v", v.Block.Func.Name, v.Block, v)
  7448  	}
  7449  	for _, w := range entry.Values {
  7450  		if w == v {
  7451  			break
  7452  		}
  7453  		switch w.Op {
  7454  		case ssa.OpArgIntReg, ssa.OpArgFloatReg:
  7455  			// okay
  7456  		default:
  7457  			base.Fatalf("in %s, badly placed LoweredGetClosurePtr: %v %v", v.Block.Func.Name, v.Block, v)
  7458  		}
  7459  	}
  7460  }
  7461  
  7462  // CheckArgReg ensures that v is in the function's entry block.
  7463  func CheckArgReg(v *ssa.Value) {
  7464  	entry := v.Block.Func.Entry
  7465  	if entry != v.Block {
  7466  		base.Fatalf("in %s, badly placed ArgIReg or ArgFReg: %v %v", v.Block.Func.Name, v.Block, v)
  7467  	}
  7468  }
  7469  
  7470  func AddrAuto(a *obj.Addr, v *ssa.Value) {
  7471  	n, off := ssa.AutoVar(v)
  7472  	a.Type = obj.TYPE_MEM
  7473  	a.Sym = n.Linksym()
  7474  	a.Reg = int16(Arch.REGSP)
  7475  	a.Offset = n.FrameOffset() + off
  7476  	if n.Class == ir.PPARAM || (n.Class == ir.PPARAMOUT && !n.IsOutputParamInRegisters()) {
  7477  		a.Name = obj.NAME_PARAM
  7478  	} else {
  7479  		a.Name = obj.NAME_AUTO
  7480  	}
  7481  }
  7482  
  7483  // Call returns a new CALL instruction for the SSA value v.
  7484  // It uses PrepareCall to prepare the call.
  7485  func (s *State) Call(v *ssa.Value) *obj.Prog {
  7486  	pPosIsStmt := s.pp.Pos.IsStmt() // The statement-ness fo the call comes from ssaGenState
  7487  	s.PrepareCall(v)
  7488  
  7489  	p := s.Prog(obj.ACALL)
  7490  	if pPosIsStmt == src.PosIsStmt {
  7491  		p.Pos = v.Pos.WithIsStmt()
  7492  	} else {
  7493  		p.Pos = v.Pos.WithNotStmt()
  7494  	}
  7495  	if sym, ok := v.Aux.(*ssa.AuxCall); ok && sym.Fn != nil {
  7496  		p.To.Type = obj.TYPE_MEM
  7497  		p.To.Name = obj.NAME_EXTERN
  7498  		p.To.Sym = sym.Fn
  7499  	} else {
  7500  		// TODO(mdempsky): Can these differences be eliminated?
  7501  		switch Arch.LinkArch.Family {
  7502  		case sys.AMD64, sys.I386, sys.PPC64, sys.RISCV64, sys.S390X, sys.Wasm:
  7503  			p.To.Type = obj.TYPE_REG
  7504  		case sys.ARM, sys.ARM64, sys.Loong64, sys.MIPS, sys.MIPS64:
  7505  			p.To.Type = obj.TYPE_MEM
  7506  		default:
  7507  			base.Fatalf("unknown indirect call family")
  7508  		}
  7509  		p.To.Reg = v.Args[0].Reg()
  7510  	}
  7511  	return p
  7512  }
  7513  
  7514  // TailCall returns a new tail call instruction for the SSA value v.
  7515  // It is like Call, but for a tail call.
  7516  func (s *State) TailCall(v *ssa.Value) *obj.Prog {
  7517  	p := s.Call(v)
  7518  	p.As = obj.ARET
  7519  	return p
  7520  }
  7521  
  7522  // PrepareCall prepares to emit a CALL instruction for v and does call-related bookkeeping.
  7523  // It must be called immediately before emitting the actual CALL instruction,
  7524  // since it emits PCDATA for the stack map at the call (calls are safe points).
  7525  func (s *State) PrepareCall(v *ssa.Value) {
  7526  	idx := s.livenessMap.Get(v)
  7527  	if !idx.StackMapValid() {
  7528  		// See Liveness.hasStackMap.
  7529  		if sym, ok := v.Aux.(*ssa.AuxCall); !ok || !(sym.Fn == ir.Syms.WBZero || sym.Fn == ir.Syms.WBMove) {
  7530  			base.Fatalf("missing stack map index for %v", v.LongString())
  7531  		}
  7532  	}
  7533  
  7534  	call, ok := v.Aux.(*ssa.AuxCall)
  7535  
  7536  	if ok {
  7537  		// Record call graph information for nowritebarrierrec
  7538  		// analysis.
  7539  		if nowritebarrierrecCheck != nil {
  7540  			nowritebarrierrecCheck.recordCall(s.pp.CurFunc, call.Fn, v.Pos)
  7541  		}
  7542  	}
  7543  
  7544  	if s.maxarg < v.AuxInt {
  7545  		s.maxarg = v.AuxInt
  7546  	}
  7547  }
  7548  
  7549  // UseArgs records the fact that an instruction needs a certain amount of
  7550  // callee args space for its use.
  7551  func (s *State) UseArgs(n int64) {
  7552  	if s.maxarg < n {
  7553  		s.maxarg = n
  7554  	}
  7555  }
  7556  
  7557  // fieldIdx finds the index of the field referred to by the ODOT node n.
  7558  func fieldIdx(n *ir.SelectorExpr) int {
  7559  	t := n.X.Type()
  7560  	if !t.IsStruct() {
  7561  		panic("ODOT's LHS is not a struct")
  7562  	}
  7563  
  7564  	for i, f := range t.Fields() {
  7565  		if f.Sym == n.Sel {
  7566  			if f.Offset != n.Offset() {
  7567  				panic("field offset doesn't match")
  7568  			}
  7569  			return i
  7570  		}
  7571  	}
  7572  	panic(fmt.Sprintf("can't find field in expr %v\n", n))
  7573  
  7574  	// TODO: keep the result of this function somewhere in the ODOT Node
  7575  	// so we don't have to recompute it each time we need it.
  7576  }
  7577  
  7578  // ssafn holds frontend information about a function that the backend is processing.
  7579  // It also exports a bunch of compiler services for the ssa backend.
  7580  type ssafn struct {
  7581  	curfn      *ir.Func
  7582  	strings    map[string]*obj.LSym // map from constant string to data symbols
  7583  	stksize    int64                // stack size for current frame
  7584  	stkptrsize int64                // prefix of stack containing pointers
  7585  
  7586  	// alignment for current frame.
  7587  	// NOTE: when stkalign > PtrSize, currently this only ensures the offsets of
  7588  	// objects in the stack frame are aligned. The stack pointer is still aligned
  7589  	// only PtrSize.
  7590  	stkalign int64
  7591  
  7592  	log bool // print ssa debug to the stdout
  7593  }
  7594  
  7595  // StringData returns a symbol which
  7596  // is the data component of a global string constant containing s.
  7597  func (e *ssafn) StringData(s string) *obj.LSym {
  7598  	if aux, ok := e.strings[s]; ok {
  7599  		return aux
  7600  	}
  7601  	if e.strings == nil {
  7602  		e.strings = make(map[string]*obj.LSym)
  7603  	}
  7604  	data := staticdata.StringSym(e.curfn.Pos(), s)
  7605  	e.strings[s] = data
  7606  	return data
  7607  }
  7608  
  7609  // SplitSlot returns a slot representing the data of parent starting at offset.
  7610  func (e *ssafn) SplitSlot(parent *ssa.LocalSlot, suffix string, offset int64, t *types.Type) ssa.LocalSlot {
  7611  	node := parent.N
  7612  
  7613  	if node.Class != ir.PAUTO || node.Addrtaken() {
  7614  		// addressed things and non-autos retain their parents (i.e., cannot truly be split)
  7615  		return ssa.LocalSlot{N: node, Type: t, Off: parent.Off + offset}
  7616  	}
  7617  
  7618  	sym := &types.Sym{Name: node.Sym().Name + suffix, Pkg: types.LocalPkg}
  7619  	n := e.curfn.NewLocal(parent.N.Pos(), sym, t)
  7620  	n.SetUsed(true)
  7621  	n.SetEsc(ir.EscNever)
  7622  	types.CalcSize(t)
  7623  	return ssa.LocalSlot{N: n, Type: t, Off: 0, SplitOf: parent, SplitOffset: offset}
  7624  }
  7625  
  7626  // Logf logs a message from the compiler.
  7627  func (e *ssafn) Logf(msg string, args ...interface{}) {
  7628  	if e.log {
  7629  		fmt.Printf(msg, args...)
  7630  	}
  7631  }
  7632  
  7633  func (e *ssafn) Log() bool {
  7634  	return e.log
  7635  }
  7636  
  7637  // Fatalf reports a compiler error and exits.
  7638  func (e *ssafn) Fatalf(pos src.XPos, msg string, args ...interface{}) {
  7639  	base.Pos = pos
  7640  	nargs := append([]interface{}{ir.FuncName(e.curfn)}, args...)
  7641  	base.Fatalf("'%s': "+msg, nargs...)
  7642  }
  7643  
  7644  // Warnl reports a "warning", which is usually flag-triggered
  7645  // logging output for the benefit of tests.
  7646  func (e *ssafn) Warnl(pos src.XPos, fmt_ string, args ...interface{}) {
  7647  	base.WarnfAt(pos, fmt_, args...)
  7648  }
  7649  
  7650  func (e *ssafn) Debug_checknil() bool {
  7651  	return base.Debug.Nil != 0
  7652  }
  7653  
  7654  func (e *ssafn) UseWriteBarrier() bool {
  7655  	return base.Flag.WB
  7656  }
  7657  
  7658  func (e *ssafn) Syslook(name string) *obj.LSym {
  7659  	switch name {
  7660  	case "goschedguarded":
  7661  		return ir.Syms.Goschedguarded
  7662  	case "writeBarrier":
  7663  		return ir.Syms.WriteBarrier
  7664  	case "wbZero":
  7665  		return ir.Syms.WBZero
  7666  	case "wbMove":
  7667  		return ir.Syms.WBMove
  7668  	case "cgoCheckMemmove":
  7669  		return ir.Syms.CgoCheckMemmove
  7670  	case "cgoCheckPtrWrite":
  7671  		return ir.Syms.CgoCheckPtrWrite
  7672  	}
  7673  	e.Fatalf(src.NoXPos, "unknown Syslook func %v", name)
  7674  	return nil
  7675  }
  7676  
  7677  func (e *ssafn) Func() *ir.Func {
  7678  	return e.curfn
  7679  }
  7680  
  7681  func clobberBase(n ir.Node) ir.Node {
  7682  	if n.Op() == ir.ODOT {
  7683  		n := n.(*ir.SelectorExpr)
  7684  		if n.X.Type().NumFields() == 1 {
  7685  			return clobberBase(n.X)
  7686  		}
  7687  	}
  7688  	if n.Op() == ir.OINDEX {
  7689  		n := n.(*ir.IndexExpr)
  7690  		if n.X.Type().IsArray() && n.X.Type().NumElem() == 1 {
  7691  			return clobberBase(n.X)
  7692  		}
  7693  	}
  7694  	return n
  7695  }
  7696  
  7697  // callTargetLSym returns the correct LSym to call 'callee' using its ABI.
  7698  func callTargetLSym(callee *ir.Name) *obj.LSym {
  7699  	if callee.Func == nil {
  7700  		// TODO(austin): This happens in case of interface method I.M from imported package.
  7701  		// It's ABIInternal, and would be better if callee.Func was never nil and we didn't
  7702  		// need this case.
  7703  		return callee.Linksym()
  7704  	}
  7705  
  7706  	return callee.LinksymABI(callee.Func.ABI)
  7707  }
  7708  
  7709  // deferStructFnField is the field index of _defer.fn.
  7710  const deferStructFnField = 4
  7711  
  7712  var deferType *types.Type
  7713  
  7714  // deferstruct returns a type interchangeable with runtime._defer.
  7715  // Make sure this stays in sync with runtime/runtime2.go:_defer.
  7716  func deferstruct() *types.Type {
  7717  	if deferType != nil {
  7718  		return deferType
  7719  	}
  7720  
  7721  	makefield := func(name string, t *types.Type) *types.Field {
  7722  		sym := (*types.Pkg)(nil).Lookup(name)
  7723  		return types.NewField(src.NoXPos, sym, t)
  7724  	}
  7725  
  7726  	fields := []*types.Field{
  7727  		makefield("heap", types.Types[types.TBOOL]),
  7728  		makefield("rangefunc", types.Types[types.TBOOL]),
  7729  		makefield("sp", types.Types[types.TUINTPTR]),
  7730  		makefield("pc", types.Types[types.TUINTPTR]),
  7731  		// Note: the types here don't really matter. Defer structures
  7732  		// are always scanned explicitly during stack copying and GC,
  7733  		// so we make them uintptr type even though they are real pointers.
  7734  		makefield("fn", types.Types[types.TUINTPTR]),
  7735  		makefield("link", types.Types[types.TUINTPTR]),
  7736  		makefield("head", types.Types[types.TUINTPTR]),
  7737  	}
  7738  	if name := fields[deferStructFnField].Sym.Name; name != "fn" {
  7739  		base.Fatalf("deferStructFnField is %q, not fn", name)
  7740  	}
  7741  
  7742  	n := ir.NewDeclNameAt(src.NoXPos, ir.OTYPE, ir.Pkgs.Runtime.Lookup("_defer"))
  7743  	typ := types.NewNamed(n)
  7744  	n.SetType(typ)
  7745  	n.SetTypecheck(1)
  7746  
  7747  	// build struct holding the above fields
  7748  	typ.SetUnderlying(types.NewStruct(fields))
  7749  	types.CalcStructSize(typ)
  7750  
  7751  	deferType = typ
  7752  	return typ
  7753  }
  7754  
  7755  // SpillSlotAddr uses LocalSlot information to initialize an obj.Addr
  7756  // The resulting addr is used in a non-standard context -- in the prologue
  7757  // of a function, before the frame has been constructed, so the standard
  7758  // addressing for the parameters will be wrong.
  7759  func SpillSlotAddr(spill ssa.Spill, baseReg int16, extraOffset int64) obj.Addr {
  7760  	return obj.Addr{
  7761  		Name:   obj.NAME_NONE,
  7762  		Type:   obj.TYPE_MEM,
  7763  		Reg:    baseReg,
  7764  		Offset: spill.Offset + extraOffset,
  7765  	}
  7766  }
  7767  
  7768  var (
  7769  	BoundsCheckFunc [ssa.BoundsKindCount]*obj.LSym
  7770  	ExtendCheckFunc [ssa.BoundsKindCount]*obj.LSym
  7771  )
  7772