gen = closurename_closgen
case n.Func.Outerfunc.Op == ODCLFUNC:
// The outermost closure inside of a named function.
- outer = n.Func.Outerfunc.Func.Nname.Sym.Name
+ outer = n.Func.Outerfunc.funcname()
prefix = "func"
lineno = Ctxt.PosTable.XPos(fun.Body.Rbrace)
f.Func.Endlineno = lineno
} else {
- if pure_go || strings.HasPrefix(f.Func.Nname.Sym.Name, "init.") {
- yyerrorl(f.Pos, "missing function body for %q", f.Func.Nname.Sym.Name)
+ if pure_go || strings.HasPrefix(f.funcname(), "init.") {
+ yyerrorl(f.Pos, "missing function body for %q", f.funcname())
}
}
// "Portable" code generation.
func emitptrargsmap() {
- if Curfn.Func.Nname.Sym.Name == "_" {
+ if Curfn.funcname() == "_" {
return
}
- sym := lookup(fmt.Sprintf("%s.args_stackmap", Curfn.Func.Nname.Sym.Name))
+ sym := lookup(fmt.Sprintf("%s.args_stackmap", Curfn.funcname()))
lsym := sym.Linksym()
nptr := int(Curfn.Type.ArgWidth() / int64(Widthptr))
// Clobber only functions where the hash of the function name matches a pattern.
// Useful for binary searching for a miscompiled function.
hstr := ""
- for _, b := range sha1.Sum([]byte(lv.fn.Func.Nname.Sym.Name)) {
+ for _, b := range sha1.Sum([]byte(lv.fn.funcname())) {
hstr += fmt.Sprintf("%08b", b)
}
if !strings.HasSuffix(hstr, h) {
return
}
- fmt.Printf("\t\t\tCLOBBERDEAD %s\n", lv.fn.Func.Nname.Sym.Name)
+ fmt.Printf("\t\t\tCLOBBERDEAD %s\n", lv.fn.funcname())
}
if lv.f.Name == "forkAndExecInChild" {
// forkAndExecInChild calls vfork (on linux/amd64, anyway).
}
func (lv *Liveness) showlive(v *ssa.Value, live bvec) {
- if debuglive == 0 || lv.fn.Func.Nname.Sym.Name == "init" || strings.HasPrefix(lv.fn.Func.Nname.Sym.Name, ".") {
+ if debuglive == 0 || lv.fn.funcname() == "init" || strings.HasPrefix(lv.fn.funcname(), ".") {
return
}
if live.IsEmpty() {
s := "live at "
if v == nil {
- s += fmt.Sprintf("entry to %s:", lv.fn.Func.Nname.Sym.Name)
+ s += fmt.Sprintf("entry to %s:", lv.fn.funcname())
} else if sym, ok := v.Aux.(*obj.LSym); ok {
fn := sym.Name
if pos := strings.Index(fn, "."); pos >= 0 {
// This format synthesizes the information used during the multiple passes
// into a single presentation.
func livenessprintdebug(lv *Liveness) {
- fmt.Printf("liveness: %s\n", lv.fn.Func.Nname.Sym.Name)
+ fmt.Printf("liveness: %s\n", lv.fn.funcname())
pcdata := 0
for i, b := range lv.f.Blocks {
// buildssa builds an SSA function.
func buildssa(fn *Node) *ssa.Func {
- name := fn.Func.Nname.Sym.Name
+ name := fn.funcname()
printssa := name == os.Getenv("GOSSAFUNC")
if printssa {
fmt.Println("generating SSA for", name)
return false
}
+// funcname returns the name of the function n.
+func (n *Node) funcname() string {
+ return n.Func.Nname.Sym.Name
+}
+
// Name holds Node fields used only by named nodes (ONAME, OTYPE, OPACK, OLABEL, some OLITERAL).
type Name struct {
Pack *Node // real package for import . names
var nln, nrn Nodes
nln.Set(nl)
nrn.Set(nr)
- Fatalf("error in shape across %+v %v %+v / %d %d [%s]", nln, op, nrn, len(nl), len(nr), Curfn.Func.Nname.Sym.Name)
+ Fatalf("error in shape across %+v %v %+v / %d %d [%s]", nln, op, nrn, len(nl), len(nr), Curfn.funcname())
}
return nn
}