var i2 interface{} = X2{}
	check(func() { _ = i2.(p.I2) }, "interface conversion: main.X2 is not p.I2: missing method foo")

	var i3 interface{} = X3{}
	check(func() { _ = i3.(p.I2) }, "interface conversion: main.X3 is not p.I2: missing method foo")

	var i4 interface{} = X4{}
	check(func() { _ = i4.(p.I2) }, "interface conversion: main.X4 is not p.I2: missing method foo")

	var i5 interface{} = X5{}

	i1 = s;		// convert S to I1
	i2 = i1.(I2);	// convert I1 to I2

	// call interface
	if i1.f() != 5 { panic(21); }
	if i2.f() != 5 { panic(22); }
	if i2.g() != 6 { panic(23); }

	g = i1.(*S);		// convert I1 to S
	if g != s { panic(31); }

	g = i2.(*S);		// convert I2 to S
	if g != s { panic(32); }

	i1 = t2 /* ERRORx `.* t2 .* as I1 .*: \*T2 does not implement I1 \(wrong type for method foo\)\n\t\thave foo\(int\)\n\t\twant foo\(\)` */
	i2 = i1 /* ERRORx `.* i1 .* as I2 .*: I1 does not implement I2 \(wrong type for method foo\)\n\t\thave foo\(\)\n\t\twant foo\(int\)` */
	i2 = t1 /* ERRORx `.* t1 .* as I2 .*: \*T1 does not implement I2 \(wrong type for method foo\)\n\t\thave foo\(\)\n\t\twant foo\(int\)` */

	type I1 interface{
		m1()
	}

	type I2 interface{
		m1()
		m2(x int)
	}

	type I3 interface{
		m1()
		m2() int
	}

	var e E
	var i1 I1
	var i2 I2
	var i3 I3

	_ = E(0)
	_ = E(nil)
	_ = E(e)
	_ = E(i1)
	_ = E(i2)

	_ = I1(0 /* ERROR "cannot convert" */ )
	_ = I1(nil)
	_ = I1(i1)
	_ = I1(e /* ERROR "cannot convert" */ )
	_ = I1(i2)

	_ = I2(nil)

// license that can be found in the LICENSE file.

package main

type I1 interface { // GC_ERROR "invalid recursive type"
	m() I2
	I2
}

type I2 interface {
	I1 // GCCGO_ERROR "loop|interface"
}


var i1 I1 = i2
var i2 I2

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package main

type	I1	interface {}
type	I2	interface { pr() }

func	e()	I1;

var	i1	I1;
var	i2	I2;

func
main() {

	i2 = e().(I2);	// bug089.go:16: fatal error: agen_inter i2i

// intact and with the same meaning, by assigning to or using them.

package main

import "./recursive1"

func main() {
	var i1 p.I1
	var i2 p.I2
	i1 = i2
	i2 = i1
	i1 = i2.F()
	i2 = i1.F()
	_, _ = i1, i2

	eq(I1.Sum(t1, a, 11), 21)
	eq(I1.Sum(t2, a, 12), 22)

	f3 := I1.Sum
	eq(f3(t1, a, 13), 23)
	eq(f3(t2, a, 14), 24)

	eq(I2.Sum(t1, a, 15), 25)
	eq(I2.Sum(t2, a, 16), 26)

	f4 := I2.Sum
	eq(f4(t1, a, 17), 27)
	eq(f4(t2, a, 18), 28)

	// issue 6723
	f5 := (interface {
		I2
	}).Sum
	eq(f5(t1, a, 19), 29)
	eq(f5(t2, a, 20), 30)

	mt1 := method4a.T1(4)
	mt2 := &method4a.T2{4}

			m0 map[G2]byte
			s1 G3
		}{((18+i2)&^i2%i2 ^ i) / i: m3[(G2(267.1)*G2(i1) > G2(i2) || (false || true || (true || false))) && func(int32, int64) bool {
			return <-ch0
		}(int32(63), ai64_2[61&^i1&i2])][i|i^i1]}
		i2 = 90 - i1
		_, _, _, _, _, _, _, _ = f0, pf2, ch5, ch6, fnc0, m7, ch7, fnc1
	} else {
		var m7 map[G1]chan uint

// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package bug250

type I1 interface {
	m() I2
}

type I2 interface {
	I1
}

var i1 I1 = i2
var i2 I2