OXIESEC PANEL

Name	Size	Modified	Perms
📁 ..	-	12/01/2022 06:13:56 PM	rwxr-xr-x
📄 api.go	17.05 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 api_test.go	81.16 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 array.go	802 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 assignments.go	12.86 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 basic.go	1.48 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 builtins.go	24.28 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 builtins_test.go	9.7 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 call.go	22.29 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 chan.go	909 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 check.go	17.32 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 check_test.go	12.11 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 context.go	4.34 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 context_test.go	2.33 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 conversions.go	8.28 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 decl.go	28.77 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 errorcodes.go	31.51 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 errorcodes_test.go	4.95 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 errors.go	9.87 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 errors_test.go	1 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 eval.go	3.05 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 eval_test.go	7.4 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 example_test.go	9.03 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 expr.go	51.97 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 exprstring.go	4.81 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 exprstring_test.go	2.36 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 gccgosizes.go	1.02 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 gotype.go	8.33 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 hilbert_test.go	3.61 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 index.go	11.03 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 infer.go	25.18 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 initorder.go	9.48 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 instantiate.go	9.94 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 instantiate_test.go	6.02 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 interface.go	8.08 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 issues_test.go	17.49 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 labels.go	7.17 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 lookup.go	16.93 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 main_test.go	335 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 map.go	658 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 methodset.go	6.75 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 methodset_test.go	5.75 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 mono.go	9.05 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 mono_test.go	2.63 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 named.go	22.37 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 named_test.go	2.69 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 object.go	17.92 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 object_test.go	5.21 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 objset.go	927 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 operand.go	10 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 package.go	2.38 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 pointer.go	634 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 predicates.go	14.71 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 resolver.go	24.38 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 resolver_test.go	4.58 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 return.go	4.21 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 scope.go	9.33 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 selection.go	3.99 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 self_test.go	2.57 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 signature.go	12.49 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 sizeof_test.go	1.26 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 sizes.go	7.56 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 sizes_test.go	3.33 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 slice.go	576 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 stdlib_test.go	9.45 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 stmt.go	26.17 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 struct.go	6.04 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 subst.go	10.76 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 termlist.go	3.68 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 termlist_test.go	7.18 KB	12/01/2022 06:12:58 PM	rw-r--r--
📁 testdata	-	12/01/2022 06:13:56 PM	rwxr-xr-x
📄 token_test.go	1.21 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 tuple.go	928 bytes	12/01/2022 06:12:58 PM	rw-r--r--
📄 type.go	2.92 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typelists.go	1.84 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typeparam.go	4.74 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typeset.go	14.22 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typeset_test.go	2.34 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typestring.go	10.64 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typestring_test.go	4.21 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typeterm.go	3.52 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typeterm_test.go	5.1 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 typexpr.go	14.64 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 unify.go	18.35 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 union.go	6.22 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 universe.go	7.66 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 validtype.go	7.77 KB	12/01/2022 06:12:58 PM	rw-r--r--
📄 version.go	2.2 KB	12/01/2022 06:12:58 PM	rw-r--r--

Editing: validtype.go

// Copyright 2022 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package types

// validType verifies that the given type does not "expand" indefinitely
// producing a cycle in the type graph.
// (Cycles involving alias types, as in "type A = [10]A" are detected
// earlier, via the objDecl cycle detection mechanism.)
func (check *Checker) validType(typ *Named) {
	check.validType0(typ, nil, nil)
}

// validType0 checks if the given type is valid. If typ is a type parameter
// its value is looked up in the type argument list of the instantiated
// (enclosing) type, if it exists. Otherwise the type parameter must be from
// an enclosing function and can be ignored.
// The nest list describes the stack (the "nest in memory") of types which
// contain (or embed in the case of interfaces) other types. For instance, a
// struct named S which contains a field of named type F contains (the memory
// of) F in S, leading to the nest S->F. If a type appears in its own nest
// (say S->F->S) we have an invalid recursive type. The path list is the full
// path of named types in a cycle, it is only needed for error reporting.
func (check *Checker) validType0(typ Type, nest, path []*Named) bool {
	switch t := typ.(type) {
	case nil:
		// We should never see a nil type but be conservative and panic
		// only in debug mode.
		if debug {
			panic("validType0(nil)")
		}

case *Array:
		return check.validType0(t.elem, nest, path)

case *Struct:
		for _, f := range t.fields {
			if !check.validType0(f.typ, nest, path) {
				return false
			}
		}

case *Union:
		for _, t := range t.terms {
			if !check.validType0(t.typ, nest, path) {
				return false
			}
		}

case *Interface:
		for _, etyp := range t.embeddeds {
			if !check.validType0(etyp, nest, path) {
				return false
			}
		}

case *Named:
		// Exit early if we already know t is valid.
		// This is purely an optimization but it prevents excessive computation
		// times in pathological cases such as testdata/fixedbugs/issue6977.go.
		// (Note: The valids map could also be allocated locally, once for each
		// validType call.)
		if check.valids.lookup(t) != nil {
			break
		}

// Don't report a 2nd error if we already know the type is invalid
		// (e.g., if a cycle was detected earlier, via under).
		// Note: ensure that t.orig is fully resolved by calling Underlying().
		if t.Underlying() == Typ[Invalid] {
			return false
		}

// If the current type t is also found in nest, (the memory of) t is
		// embedded in itself, indicating an invalid recursive type.
		for _, e := range nest {
			if Identical(e, t) {
				// t cannot be in an imported package otherwise that package
				// would have reported a type cycle and couldn't have been
				// imported in the first place.
				assert(t.obj.pkg == check.pkg)
				t.underlying = Typ[Invalid] // t is in the current package (no race possibility)
				// Find the starting point of the cycle and report it.
				// Because each type in nest must also appear in path (see invariant below),
				// type t must be in path since it was found in nest. But not every type in path
				// is in nest. Specifically t may appear in path with an earlier index than the
				// index of t in nest. Search again.
				for start, p := range path {
					if Identical(p, t) {
						check.cycleError(makeObjList(path[start:]))
						return false
					}
				}
				panic("cycle start not found")
			}
		}

// No cycle was found. Check the RHS of t.
		// Every type added to nest is also added to path; thus every type that is in nest
		// must also be in path (invariant). But not every type in path is in nest, since
		// nest may be pruned (see below, *TypeParam case).
		if !check.validType0(t.Origin().fromRHS, append(nest, t), append(path, t)) {
			return false
		}

check.valids.add(t) // t is valid

case *TypeParam:
		// A type parameter stands for the type (argument) it was instantiated with.
		// Check the corresponding type argument for validity if we are in an
		// instantiated type.
		if len(nest) > 0 {
			inst := nest[len(nest)-1] // the type instance
			// Find the corresponding type argument for the type parameter
			// and proceed with checking that type argument.
			for i, tparam := range inst.TypeParams().list() {
				// The type parameter and type argument lists should
				// match in length but be careful in case of errors.
				if t == tparam && i < inst.TypeArgs().Len() {
					targ := inst.TypeArgs().At(i)
					// The type argument must be valid in the enclosing
					// type (where inst was instantiated), hence we must
					// check targ's validity in the type nest excluding
					// the current (instantiated) type (see the example
					// at the end of this file).
					// For error reporting we keep the full path.
					return check.validType0(targ, nest[:len(nest)-1], path)
				}
			}
		}
	}

return true
}

// makeObjList returns the list of type name objects for the given
// list of named types.
func makeObjList(tlist []*Named) []Object {
	olist := make([]Object, len(tlist))
	for i, t := range tlist {
		olist[i] = t.obj
	}
	return olist
}

// Here is an example illustrating why we need to exclude the
// instantiated type from nest when evaluating the validity of
// a type parameter. Given the declarations
//
//   var _ A[A[string]]
//
//   type A[P any] struct { _ B[P] }
//   type B[P any] struct { _ P }
//
// we want to determine if the type A[A[string]] is valid.
// We start evaluating A[A[string]] outside any type nest:
//
//   A[A[string]]
//         nest =
//         path =
//
// The RHS of A is now evaluated in the A[A[string]] nest:
//
//   struct{_ B[P₁]}
//         nest = A[A[string]]
//         path = A[A[string]]
//
// The struct has a single field of type B[P₁] with which
// we continue:
//
//   B[P₁]
//         nest = A[A[string]]
//         path = A[A[string]]
//
//   struct{_ P₂}
//         nest = A[A[string]]->B[P]
//         path = A[A[string]]->B[P]
//
// Eventutally we reach the type parameter P of type B (P₂):
//
//   P₂
//         nest = A[A[string]]->B[P]
//         path = A[A[string]]->B[P]
//
// The type argument for P of B is the type parameter P of A (P₁).
// It must be evaluated in the type nest that existed when B was
// instantiated:
//
//   P₁
//         nest = A[A[string]]        <== type nest at B's instantiation time
//         path = A[A[string]]->B[P]
//
// If we'd use the current nest it would correspond to the path
// which will be wrong as we will see shortly. P's type argument
// is A[string], which again must be evaluated in the type nest
// that existed when A was instantiated with A[string]. That type
// nest is empty:
//
//   A[string]
//         nest =                     <== type nest at A's instantiation time
//         path = A[A[string]]->B[P]
//
// Evaluation then proceeds as before for A[string]:
//
//   struct{_ B[P₁]}
//         nest = A[string]
//         path = A[A[string]]->B[P]->A[string]
//
// Now we reach B[P] again. If we had not adjusted nest, it would
// correspond to path, and we would find B[P] in nest, indicating
// a cycle, which would clearly be wrong since there's no cycle in
// A[string]:
//
//   B[P₁]
//         nest = A[string]
//         path = A[A[string]]->B[P]->A[string]  <== path contains B[P]!
//
// But because we use the correct type nest, evaluation proceeds without
// errors and we get the evaluation sequence:
//
//   struct{_ P₂}
//         nest = A[string]->B[P]
//         path = A[A[string]]->B[P]->A[string]->B[P]
//   P₂
//         nest = A[string]->B[P]
//         path = A[A[string]]->B[P]->A[string]->B[P]
//   P₁
//         nest = A[string]
//         path = A[A[string]]->B[P]->A[string]->B[P]
//   string
//         nest =
//         path = A[A[string]]->B[P]->A[string]->B[P]
//
// At this point we're done and A[A[string]] and is valid.