1 // Copyright 2014 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.
8 "cmd/compile/internal/syntax"
13 func (err *error_) recordAltDecl(obj Object) {
14 if pos := obj.Pos(); pos.IsKnown() {
15 // We use "other" rather than "previous" here because
16 // the first declaration seen may not be textually
17 // earlier in the source.
18 err.errorf(pos, "other declaration of %s", obj.Name())
22 func (check *Checker) declare(scope *Scope, id *syntax.Name, obj Object, pos syntax.Pos) {
23 // spec: "The blank identifier, represented by the underscore
24 // character _, may be used in a declaration like any other
25 // identifier but the declaration does not introduce a new
27 if obj.Name() != "_" {
28 if alt := scope.Insert(obj); alt != nil {
30 err.errorf(obj, "%s redeclared in this block", obj.Name())
31 err.recordAltDecl(alt)
38 check.recordDef(id, obj)
42 // pathString returns a string of the form a->b-> ... ->g for a path [a, b, ... g].
43 func pathString(path []Object) string {
45 for i, p := range path {
54 // objDecl type-checks the declaration of obj in its respective (file) context.
55 // For the meaning of def, see Checker.definedType, in typexpr.go.
56 func (check *Checker) objDecl(obj Object, def *Named) {
57 if check.conf.Trace && obj.Type() == nil {
58 if check.indent == 0 {
59 fmt.Println() // empty line between top-level objects for readability
61 check.trace(obj.Pos(), "-- checking %s (%s, objPath = %s)", obj, obj.color(), pathString(check.objPath))
65 check.trace(obj.Pos(), "=> %s (%s)", obj, obj.color())
69 // Funcs with m.instRecv set have not yet be completed. Complete them now
70 // so that they have a type when objDecl exits.
71 if m, _ := obj.(*Func); m != nil && m.instRecv != nil {
72 check.completeMethod(check.conf.Context, m)
75 // Checking the declaration of obj means inferring its type
76 // (and possibly its value, for constants).
77 // An object's type (and thus the object) may be in one of
78 // three states which are expressed by colors:
80 // - an object whose type is not yet known is painted white (initial color)
81 // - an object whose type is in the process of being inferred is painted grey
82 // - an object whose type is fully inferred is painted black
84 // During type inference, an object's color changes from white to grey
85 // to black (pre-declared objects are painted black from the start).
86 // A black object (i.e., its type) can only depend on (refer to) other black
87 // ones. White and grey objects may depend on white and black objects.
88 // A dependency on a grey object indicates a cycle which may or may not be
91 // When objects turn grey, they are pushed on the object path (a stack);
92 // they are popped again when they turn black. Thus, if a grey object (a
93 // cycle) is encountered, it is on the object path, and all the objects
94 // it depends on are the remaining objects on that path. Color encoding
95 // is such that the color value of a grey object indicates the index of
96 // that object in the object path.
98 // During type-checking, white objects may be assigned a type without
99 // traversing through objDecl; e.g., when initializing constants and
100 // variables. Update the colors of those objects here (rather than
101 // everywhere where we set the type) to satisfy the color invariants.
102 if obj.color() == white && obj.Type() != nil {
109 assert(obj.Type() == nil)
110 // All color values other than white and black are considered grey.
111 // Because black and white are < grey, all values >= grey are grey.
112 // Use those values to encode the object's index into the object path.
113 obj.setColor(grey + color(check.push(obj)))
115 check.pop().setColor(black)
119 assert(obj.Type() != nil)
123 // Color values other than white or black are considered grey.
127 // We have a (possibly invalid) cycle.
128 // In the existing code, this is marked by a non-nil type
129 // for the object except for constants and variables whose
130 // type may be non-nil (known), or nil if it depends on the
131 // not-yet known initialization value.
132 // In the former case, set the type to Typ[Invalid] because
133 // we have an initialization cycle. The cycle error will be
134 // reported later, when determining initialization order.
135 // TODO(gri) Report cycle here and simplify initialization
137 switch obj := obj.(type) {
139 if !check.validCycle(obj) || obj.typ == nil {
140 obj.typ = Typ[Invalid]
144 if !check.validCycle(obj) || obj.typ == nil {
145 obj.typ = Typ[Invalid]
149 if !check.validCycle(obj) {
151 // (without this, calling underlying()
152 // below may lead to an endless loop
153 // if we have a cycle for a defined
155 obj.typ = Typ[Invalid]
159 if !check.validCycle(obj) {
160 // Don't set obj.typ to Typ[Invalid] here
161 // because plenty of code type-asserts that
162 // functions have a *Signature type. Grey
163 // functions have their type set to an empty
164 // signature which makes it impossible to
165 // initialize a variable with the function.
171 assert(obj.Type() != nil)
175 d := check.objMap[obj]
177 check.dump("%v: %s should have been declared", obj.Pos(), obj)
181 // save/restore current context and setup object context
182 defer func(ctxt context) {
185 check.context = context{
189 // Const and var declarations must not have initialization
190 // cycles. We track them by remembering the current declaration
191 // in check.decl. Initialization expressions depending on other
192 // consts, vars, or functions, add dependencies to the current
194 switch obj := obj.(type) {
196 check.decl = d // new package-level const decl
197 check.constDecl(obj, d.vtyp, d.init, d.inherited)
199 check.decl = d // new package-level var decl
200 check.varDecl(obj, d.lhs, d.vtyp, d.init)
202 // invalid recursive types are detected via path
203 check.typeDecl(obj, d.tdecl, def)
204 check.collectMethods(obj) // methods can only be added to top-level types
206 // functions may be recursive - no need to track dependencies
207 check.funcDecl(obj, d)
213 // validCycle reports whether the cycle starting with obj is valid and
214 // reports an error if it is not.
215 func (check *Checker) validCycle(obj Object) (valid bool) {
216 // The object map contains the package scope objects and the non-interface methods.
218 info := check.objMap[obj]
219 inObjMap := info != nil && (info.fdecl == nil || info.fdecl.Recv == nil) // exclude methods
220 isPkgObj := obj.Parent() == check.pkg.scope
221 if isPkgObj != inObjMap {
222 check.dump("%v: inconsistent object map for %s (isPkgObj = %v, inObjMap = %v)", obj.Pos(), obj, isPkgObj, inObjMap)
227 // Count cycle objects.
228 assert(obj.color() >= grey)
229 start := obj.color() - grey // index of obj in objPath
230 cycle := check.objPath[start:]
231 tparCycle := false // if set, the cycle is through a type parameter list
232 nval := 0 // number of (constant or variable) values in the cycle; valid if !generic
233 ndef := 0 // number of type definitions in the cycle; valid if !generic
235 for _, obj := range cycle {
236 switch obj := obj.(type) {
240 // If we reach a generic type that is part of a cycle
241 // and we are in a type parameter list, we have a cycle
242 // through a type parameter list, which is invalid.
243 if check.inTParamList && isGeneric(obj.typ) {
248 // Determine if the type name is an alias or not. For
249 // package-level objects, use the object map which
250 // provides syntactic information (which doesn't rely
251 // on the order in which the objects are set up). For
252 // local objects, we can rely on the order, so use
253 // the object's predicate.
254 // TODO(gri) It would be less fragile to always access
255 // the syntactic information. We should consider storing
256 // this information explicitly in the object.
258 if d := check.objMap[obj]; d != nil {
259 alias = d.tdecl.Alias // package-level object
261 alias = obj.IsAlias() // function local object
273 if check.conf.Trace {
274 check.trace(obj.Pos(), "## cycle detected: objPath = %s->%s (len = %d)", pathString(cycle), obj.Name(), len(cycle))
276 check.trace(obj.Pos(), "## cycle contains: generic type in a type parameter list")
278 check.trace(obj.Pos(), "## cycle contains: %d values, %d type definitions", nval, ndef)
282 check.trace(obj.Pos(), "=> error: cycle is invalid")
288 // A cycle involving only constants and variables is invalid but we
289 // ignore them here because they are reported via the initialization
291 if nval == len(cycle) {
295 // A cycle involving only types (and possibly functions) must have at least
296 // one type definition to be permitted: If there is no type definition, we
297 // have a sequence of alias type names which will expand ad infinitum.
298 if nval == 0 && ndef > 0 {
303 check.cycleError(cycle)
309 // validType verifies that the given type does not "expand" infinitely
310 // producing a cycle in the type graph. Cycles are detected by marking
312 // (Cycles involving alias types, as in "type A = [10]A" are detected
313 // earlier, via the objDecl cycle detection mechanism.)
314 func (check *Checker) validType(typ Type, path []Object) typeInfo {
316 unknown typeInfo = iota
322 switch t := typ.(type) {
324 return check.validType(t.elem, path)
327 for _, f := range t.fields {
328 if check.validType(f.typ, path) == invalid {
334 for _, t := range t.terms {
335 if check.validType(t.typ, path) == invalid {
341 for _, etyp := range t.embeddeds {
342 if check.validType(etyp, path) == invalid {
348 // If t is parameterized, we should be considering the instantiated (expanded)
349 // form of t, but in general we can't with this algorithm: if t is an invalid
350 // type it may be so because it infinitely expands through a type parameter.
351 // Instantiating such a type would lead to an infinite sequence of instantiations.
352 // In general, we need "type flow analysis" to recognize those cases.
353 // Example: type A[T any] struct{ x A[*T] } (issue #48951)
354 // In this algorithm we always only consider the orginal, uninstantiated type.
355 // This won't recognize some invalid cases with parameterized types, but it
359 // don't touch the type if it is from a different package or the Universe scope
360 // (doing so would lead to a race condition - was issue #35049)
361 if t.obj.pkg != check.pkg {
365 // don't report a 2nd error if we already know the type is invalid
366 // (e.g., if a cycle was detected earlier, via under).
367 if t.underlying == Typ[Invalid] {
375 t.info = check.validType(t.fromRHS, append(path, t.obj)) // only types of current package added to path
378 for i, tn := range path {
379 if t.obj.pkg != check.pkg {
380 panic("type cycle via package-external type")
383 check.cycleError(path[i:])
385 t.underlying = Typ[Invalid]
389 panic("cycle start not found")
397 // cycleError reports a declaration cycle starting with
398 // the object in cycle that is "first" in the source.
399 func (check *Checker) cycleError(cycle []Object) {
400 // TODO(gri) Should we start with the last (rather than the first) object in the cycle
401 // since that is the earliest point in the source where we start seeing the
402 // cycle? That would be more consistent with other error messages.
403 i := firstInSrc(cycle)
406 if check.conf.CompilerErrorMessages {
407 err.errorf(obj, "invalid recursive type %s", obj.Name())
409 err.errorf(obj, "illegal cycle in declaration of %s", obj.Name())
412 err.errorf(obj, "%s refers to", obj.Name())
419 err.errorf(obj, "%s", obj.Name())
423 // firstInSrc reports the index of the object with the "smallest"
424 // source position in path. path must not be empty.
425 func firstInSrc(path []Object) int {
426 fst, pos := 0, path[0].Pos()
427 for i, t := range path[1:] {
428 if t.Pos().Cmp(pos) < 0 {
429 fst, pos = i+1, t.Pos()
435 func (check *Checker) constDecl(obj *Const, typ, init syntax.Expr, inherited bool) {
436 assert(obj.typ == nil)
438 // use the correct value of iota and errpos
439 defer func(iota constant.Value, errpos syntax.Pos) {
441 check.errpos = errpos
442 }(check.iota, check.errpos)
446 // provide valid constant value under all circumstances
447 obj.val = constant.MakeUnknown()
449 // determine type, if any
453 // don't report an error if the type is an invalid C (defined) type
455 if under(t) != Typ[Invalid] {
456 check.errorf(typ, "invalid constant type %s", t)
458 obj.typ = Typ[Invalid]
464 // check initialization
468 // The initialization expression is inherited from a previous
469 // constant declaration, and (error) positions refer to that
470 // expression and not the current constant declaration. Use
471 // the constant identifier position for any errors during
472 // init expression evaluation since that is all we have
473 // (see issues #42991, #42992).
474 check.errpos = obj.pos
478 check.initConst(obj, &x)
481 func (check *Checker) varDecl(obj *Var, lhs []*Var, typ, init syntax.Expr) {
482 assert(obj.typ == nil)
484 // If we have undefined variable types due to errors,
485 // mark variables as used to avoid follow-on errors.
486 // Matches compiler behavior.
488 if obj.typ == Typ[Invalid] {
491 for _, lhs := range lhs {
492 if lhs.typ == Typ[Invalid] {
498 // determine type, if any
500 obj.typ = check.varType(typ)
501 // We cannot spread the type to all lhs variables if there
502 // are more than one since that would mark them as checked
503 // (see Checker.objDecl) and the assignment of init exprs,
504 // if any, would not be checked.
506 // TODO(gri) If we have no init expr, we should distribute
507 // a given type otherwise we need to re-evalate the type
508 // expr for each lhs variable, leading to duplicate work.
511 // check initialization
514 // error reported before by arityMatch
515 obj.typ = Typ[Invalid]
520 if lhs == nil || len(lhs) == 1 {
521 assert(lhs == nil || lhs[0] == obj)
524 check.initVar(obj, &x, "variable declaration")
529 // obj must be one of lhs
531 for _, lhs := range lhs {
538 panic("inconsistent lhs")
542 // We have multiple variables on the lhs and one init expr.
543 // Make sure all variables have been given the same type if
544 // one was specified, otherwise they assume the type of the
545 // init expression values (was issue #15755).
547 for _, lhs := range lhs {
552 check.initVars(lhs, []syntax.Expr{init}, nopos)
555 // isImportedConstraint reports whether typ is an imported type constraint.
556 func (check *Checker) isImportedConstraint(typ Type) bool {
557 named, _ := typ.(*Named)
558 if named == nil || named.obj.pkg == check.pkg || named.obj.pkg == nil {
561 u, _ := named.under().(*Interface)
562 return u != nil && !u.IsMethodSet()
565 func (check *Checker) typeDecl(obj *TypeName, tdecl *syntax.TypeDecl, def *Named) {
566 assert(obj.typ == nil)
570 check.validType(obj.typ, nil)
571 // If typ is local, an error was already reported where typ is specified/defined.
572 if check.isImportedConstraint(rhs) && !check.allowVersion(check.pkg, 1, 18) {
573 check.versionErrorf(tdecl.Type.Pos(), "go1.18", "using type constraint %s", rhs)
575 }).describef(obj, "validType(%s)", obj.Name())
578 if alias && tdecl.TParamList != nil {
579 // The parser will ensure this but we may still get an invalid AST.
580 // Complain and continue as regular type definition.
581 check.error(tdecl, "generic type cannot be alias")
587 if !check.allowVersion(check.pkg, 1, 9) {
588 check.versionErrorf(tdecl, "go1.9", "type aliases")
591 obj.typ = Typ[Invalid]
592 rhs = check.varType(tdecl.Type)
597 // type definition or generic type declaration
598 named := check.newNamed(obj, nil, nil, nil, nil)
599 def.setUnderlying(named)
601 if tdecl.TParamList != nil {
602 check.openScope(tdecl, "type parameters")
603 defer check.closeScope()
604 check.collectTypeParams(&named.tparams, tdecl.TParamList)
607 // determine underlying type of named
608 rhs = check.definedType(tdecl.Type, named)
612 // If the underlying was not set while type-checking the right-hand side, it
613 // is invalid and an error should have been reported elsewhere.
614 if named.underlying == nil {
615 named.underlying = Typ[Invalid]
618 // Disallow a lone type parameter as the RHS of a type declaration (issue #45639).
619 // We don't need this restriction anymore if we make the underlying type of a type
620 // parameter its constraint interface: if the RHS is a lone type parameter, we will
621 // use its underlying type (like we do for any RHS in a type declaration), and its
622 // underlying type is an interface and the type declaration is well defined.
623 if isTypeParam(rhs) {
624 check.error(tdecl.Type, "cannot use a type parameter as RHS in type declaration")
625 named.underlying = Typ[Invalid]
629 func (check *Checker) collectTypeParams(dst **TypeParamList, list []*syntax.Field) {
630 tparams := make([]*TypeParam, len(list))
632 // Declare type parameters up-front.
633 // The scope of type parameters starts at the beginning of the type parameter
634 // list (so we can have mutually recursive parameterized type bounds).
635 for i, f := range list {
636 tparams[i] = check.declareTypeParam(f.Name)
639 // Set the type parameters before collecting the type constraints because
640 // the parameterized type may be used by the constraints (issue #47887).
641 // Example: type T[P T[P]] interface{}
642 *dst = bindTParams(tparams)
644 // Signal to cycle detection that we are in a type parameter list.
645 // We can only be inside one type parameter list at any given time:
646 // function closures may appear inside a type parameter list but they
647 // cannot be generic, and their bodies are processed in delayed and
648 // sequential fashion. Note that with each new declaration, we save
649 // the existing context and restore it when done; thus inTParamList
650 // is true exactly only when we are in a specific type parameter list.
651 assert(!check.inTParamList)
652 check.inTParamList = true
654 check.inTParamList = false
657 // Keep track of bounds for later validation.
661 for i, f := range list {
662 // Optimization: Re-use the previous type bound if it hasn't changed.
663 // This also preserves the grouped output of type parameter lists
664 // when printing type strings.
665 if i == 0 || f.Type != list[i-1].Type {
666 bound = check.bound(f.Type)
667 bounds = append(bounds, bound)
668 posers = append(posers, f.Type)
670 tparams[i].bound = bound
674 for i, bound := range bounds {
675 if isTypeParam(bound) {
676 // We may be able to allow this since it is now well-defined what
677 // the underlying type and thus type set of a type parameter is.
678 // But we may need some additional form of cycle detection within
679 // type parameter lists.
680 check.error(posers[i], "cannot use a type parameter as constraint")
683 for _, tpar := range tparams {
684 tpar.iface() // compute type set
689 func (check *Checker) bound(x syntax.Expr) Type {
690 // A type set literal of the form ~T and A|B may only appear as constraint;
691 // embed it in an implicit interface so that only interface type-checking
692 // needs to take care of such type expressions.
693 if op, _ := x.(*syntax.Operation); op != nil && (op.Op == syntax.Tilde || op.Op == syntax.Or) {
694 t := check.typ(&syntax.InterfaceType{MethodList: []*syntax.Field{{Type: x}}})
695 // mark t as implicit interface if all went well
696 if t, _ := t.(*Interface); t != nil {
704 func (check *Checker) declareTypeParam(name *syntax.Name) *TypeParam {
705 // Use Typ[Invalid] for the type constraint to ensure that a type
706 // is present even if the actual constraint has not been assigned
708 // TODO(gri) Need to systematically review all uses of type parameter
709 // constraints to make sure we don't rely on them if they
710 // are not properly set yet.
711 tname := NewTypeName(name.Pos(), check.pkg, name.Value, nil)
712 tpar := check.newTypeParam(tname, Typ[Invalid]) // assigns type to tname as a side-effect
713 check.declare(check.scope, name, tname, check.scope.pos) // TODO(gri) check scope position
717 func (check *Checker) collectMethods(obj *TypeName) {
718 // get associated methods
719 // (Checker.collectObjects only collects methods with non-blank names;
720 // Checker.resolveBaseTypeName ensures that obj is not an alias name
721 // if it has attached methods.)
722 methods := check.methods[obj]
726 delete(check.methods, obj)
727 assert(!check.objMap[obj].tdecl.Alias) // don't use TypeName.IsAlias (requires fully set up object)
729 // use an objset to check for name conflicts
732 // spec: "If the base type is a struct type, the non-blank method
733 // and field names must be distinct."
734 base, _ := obj.typ.(*Named) // shouldn't fail but be conservative
737 if t, _ := u.(*Struct); t != nil {
738 for _, fld := range t.fields {
740 assert(mset.insert(fld) == nil)
745 // Checker.Files may be called multiple times; additional package files
746 // may add methods to already type-checked types. Add pre-existing methods
747 // so that we can detect redeclarations.
748 for _, m := range base.methods {
749 assert(m.name != "_")
750 assert(mset.insert(m) == nil)
755 for _, m := range methods {
756 // spec: "For a base type, the non-blank names of methods bound
757 // to it must be unique."
758 assert(m.name != "_")
759 if alt := mset.insert(m); alt != nil {
763 err.errorf(m.pos, "field and method with the same name %s", m.name)
765 if check.conf.CompilerErrorMessages {
766 err.errorf(m.pos, "%s.%s redeclared in this block", obj.Name(), m.name)
768 err.errorf(m.pos, "method %s already declared for %s", m.name, obj)
773 err.recordAltDecl(alt)
779 base.resolve(nil) // TODO(mdempsky): Probably unnecessary.
780 base.methods = append(base.methods, m)
785 func (check *Checker) funcDecl(obj *Func, decl *declInfo) {
786 assert(obj.typ == nil)
788 // func declarations cannot use iota
789 assert(check.iota == nil)
791 sig := new(Signature)
792 obj.typ = sig // guard against cycles
794 // Avoid cycle error when referring to method while type-checking the signature.
795 // This avoids a nuisance in the best case (non-parameterized receiver type) and
796 // since the method is not a type, we get an error. If we have a parameterized
797 // receiver type, instantiating the receiver type leads to the instantiation of
798 // its methods, and we don't want a cycle error in that case.
799 // TODO(gri) review if this is correct and/or whether we still need this?
803 check.funcType(sig, fdecl.Recv, fdecl.TParamList, fdecl.Type)
806 if len(fdecl.TParamList) > 0 && fdecl.Body == nil {
807 check.softErrorf(fdecl, "parameterized function is missing function body")
810 // function body must be type-checked after global declarations
811 // (functions implemented elsewhere have no body)
812 if !check.conf.IgnoreFuncBodies && fdecl.Body != nil {
814 check.funcBody(decl, obj.name, sig, fdecl.Body, nil)
819 func (check *Checker) declStmt(list []syntax.Decl) {
822 first := -1 // index of first ConstDecl in the current group, or -1
823 var last *syntax.ConstDecl // last ConstDecl with init expressions, or nil
824 for index, decl := range list {
825 if _, ok := decl.(*syntax.ConstDecl); !ok {
826 first = -1 // we're not in a constant declaration
829 switch s := decl.(type) {
830 case *syntax.ConstDecl:
831 top := len(check.delayed)
833 // iota is the index of the current constDecl within the group
834 if first < 0 || list[index-1].(*syntax.ConstDecl).Group != s.Group {
838 iota := constant.MakeInt64(int64(index - first))
840 // determine which initialization expressions to use
843 case s.Type != nil || s.Values != nil:
847 last = new(syntax.ConstDecl) // make sure last exists
851 // declare all constants
852 lhs := make([]*Const, len(s.NameList))
853 values := unpackExpr(last.Values)
854 for i, name := range s.NameList {
855 obj := NewConst(name.Pos(), pkg, name.Value, nil, iota)
863 check.constDecl(obj, last.Type, init, inherited)
866 // Constants must always have init values.
867 check.arity(s.Pos(), s.NameList, values, true, inherited)
869 // process function literals in init expressions before scope changes
870 check.processDelayed(top)
872 // spec: "The scope of a constant or variable identifier declared
873 // inside a function begins at the end of the ConstSpec or VarSpec
874 // (ShortVarDecl for short variable declarations) and ends at the
875 // end of the innermost containing block."
876 scopePos := syntax.EndPos(s)
877 for i, name := range s.NameList {
878 check.declare(check.scope, name, lhs[i], scopePos)
881 case *syntax.VarDecl:
882 top := len(check.delayed)
884 lhs0 := make([]*Var, len(s.NameList))
885 for i, name := range s.NameList {
886 lhs0[i] = NewVar(name.Pos(), pkg, name.Value, nil)
889 // initialize all variables
890 values := unpackExpr(s.Values)
891 for i, obj := range lhs0 {
895 case len(s.NameList):
899 // rhs is expected to be a multi-valued expression
907 check.varDecl(obj, lhs, s.Type, init)
908 if len(values) == 1 {
909 // If we have a single lhs variable we are done either way.
910 // If we have a single rhs expression, it must be a multi-
911 // valued expression, in which case handling the first lhs
912 // variable will cause all lhs variables to have a type
913 // assigned, and we are done as well.
915 for _, obj := range lhs0 {
916 assert(obj.typ != nil)
923 // If we have no type, we must have values.
924 if s.Type == nil || values != nil {
925 check.arity(s.Pos(), s.NameList, values, false, false)
928 // process function literals in init expressions before scope changes
929 check.processDelayed(top)
931 // declare all variables
932 // (only at this point are the variable scopes (parents) set)
933 scopePos := syntax.EndPos(s) // see constant declarations
934 for i, name := range s.NameList {
935 // see constant declarations
936 check.declare(check.scope, name, lhs0[i], scopePos)
939 case *syntax.TypeDecl:
940 obj := NewTypeName(s.Name.Pos(), pkg, s.Name.Value, nil)
941 // spec: "The scope of a type identifier declared inside a function
942 // begins at the identifier in the TypeSpec and ends at the end of
943 // the innermost containing block."
944 scopePos := s.Name.Pos()
945 check.declare(check.scope, s.Name, obj, scopePos)
946 // mark and unmark type before calling typeDecl; its type is still nil (see Checker.objDecl)
947 obj.setColor(grey + color(check.push(obj)))
948 check.typeDecl(obj, s, nil)
949 check.pop().setColor(black)
952 check.errorf(s, invalidAST+"unknown syntax.Decl node %T", s)