Lines Matching refs:Func
36 func dcopy(a, b *Sym) {
44 func push() *Sym {
54 func pushdcl(s *Sym) *Sym {
62 func popdcl() {
80 func markdcl() {
90 func dumpdclstack() {
103 func testdclstack() {
115 func redeclare(s *Sym, where string) {
152 func declare(n *Node, ctxt Class) {
174 yyerror("cannot declare init - must be func")
185 Curfn.Func.Dcl = append(Curfn.Func.Dcl, n)
220 func addvar(n *Node, t *Type, ctxt Class) {
232 func variter(vl []*Node, t *Node, el []*Node) []*Node {
289 func constiter(vl []*Node, t *Node, cl []*Node) []*Node {
331 func newname(s *Sym) *Node {
344 func newnoname(s *Sym) *Node {
358 func newfuncname(s *Sym) *Node {
360 n.Func = new(Func)
361 n.Func.IsHiddenClosure = Curfn != nil
367 func dclname(s *Sym) *Node {
373 func typenod(t *Type) *Node {
386 func anonfield(typ *Type) *Node {
390 func namedfield(s string, typ *Type) *Node {
396 func oldname(s *Sym) *Node {
408 // Inner func is referring to var in outer func.
428 // Popped from list in func closurebody.
433 Curfn.Func.Cvars.Append(c)
444 func colasname(n *Node) bool {
457 func colasdefn(left []*Node, defn *Node) {
502 func ifacedcl(n *Node) {
516 func funchdr(n *Node) {
522 if Ctxt.Flag_dynlink && importpkg == nil && n.Func.Nname != nil {
523 makefuncsym(n.Func.Nname.Sym)
529 if n.Func.Nname != nil {
530 funcargs(n.Func.Nname.Name.Param.Ntype)
531 } else if n.Func.Ntype != nil {
532 funcargs(n.Func.Ntype)
538 func funcargs(nt *Node) {
549 // no n->defn because type checking of func header
602 // func f() (_ int)
603 // func g() int
627 func funcargs2(t *Type) {
665 func funcstart(n *Node) {
675 func funcbody(n *Node) {
689 func typedcl0(s *Sym) *Node {
699 func typedcl1(n *Node, t *Node, local bool) *Node {
707 func checkembeddedtype(t *Type) {
726 func structfield(n *Node) *Field {
776 func checkdupfields(what string, ts ...*Type) {
799 func tostruct(l []*Node) *Type {
805 func tostruct0(t *Type, l []*Node) {
827 func tofunargs(l []*Node, funarg Funarg) *Type {
849 func tofunargsfield(fields []*Field, funarg Funarg) *Type {
865 func interfacefield(n *Node) *Field {
931 func tointerface(l []*Node) *Type {
937 func tointerface0(t *Type, l []*Node) *Type {
974 func embedded(s *Sym, pkg *Pkg) *Node {
1004 func fakethis() *Node {
1011 func fakethisfield() *Field {
1023 func isifacemethod(f *Type) bool {
1028 func functype(this *Node, in, out []*Node) *Type {
1034 func functype0(t *Type, this *Node, in, out []*Node) {
1062 func functypefield(this *Field, in, out []*Field) *Type {
1068 func functypefield0(t *Type, this *Field, in, out []*Field) {
1088 func methodsym(nsym *Sym, t0 *Type, iface int) *Sym {
1156 func methodname(n *Node, t *Node) *Node {
1166 func methodname0(s *Sym, star bool, tsym *Sym) *Node {
1190 func addmethod(msym *Sym, t *Type, local, nointerface bool) {
1271 func funccompile(n *Node) {
1286 Fatalf("funccompile %v inside %v", n.Func.Nname.Sym, Curfn.Func.Nname.Sym)
1291 funcdepth = n.Func.Depth + 1
1299 Ctxt.DiagFunc = func(string, ...interface{}) {}
1304 func funcsym(s *Sym) *Sym {
1312 s1.Def.Func.Shortname = newname(s)
1319 func makefuncsym(s *Sym) {
1330 s1.Def.Func.Shortname = newname(s)
1350 func checknowritebarrierrec() {
1354 visitBottomUp(xtop, func(list []*Node, recursive bool) {
1357 if n.Func.WBLineno != 0 && n.Func.Pragma&Yeswritebarrierrec == 0 {
1358 c.best[n] = nowritebarrierrecCall{target: nil, depth: 0, lineno: n.Func.WBLineno}
1369 if n.Func.Pragma&Yeswritebarrierrec != 0 {
1375 if n.Func.WBLineno == 0 {
1387 if n.Func.Pragma&Nowritebarrierrec == 0 {
1398 err = fmt.Sprintf("\n\t%v: called by %v%s", linestr(call.lineno), n.Func.Nname, err)
1402 err = fmt.Sprintf("write barrier prohibited by caller; %v%s", n.Func.Nname, err)
1403 yyerrorl(n.Func.WBLineno, err)
1408 func (c *nowritebarrierrecChecker) visitcodelist(l Nodes) {
1414 func (c *nowritebarrierrecChecker) visitcode(n *Node) {
1431 func (c *nowritebarrierrecChecker) visitcall(n *Node) {
