var t *T
	println(t.i) // should crash
}

type T1 struct {
	T
}

type T2 struct {
	*T1
}

func p11() {
	t := &T2{}
	p := &t.i
	println(*p)
}

// ADDR(DOT(IND(p))) needs a check also
func p12() {
	var p *T = nil
	println(*(&((*p).i)))
}

// Tests suggested in golang.org/issue/6080.

func p13() {
	var x *[10]int
	y := x[:]
	_ = y
}

      <email>******@****.***</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Andrew Williams</name>
      <id>handyande</id>
      <email>andy@handyande.co.uk</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
  </developers>
  <dependencies>
    <dependency>
      <groupId>junit</groupId>

      <email>******@****.***</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Andrew Williams</name>
      <id>handyande</id>
      <email>andy@handyande.co.uk</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Rahul Thakur</name>
      <id>rahul</id>

	}

	if !formatCorrect || !ipCorrect {
		// repopulate the addresses according to the expected IPs from etcd
		e.Subsets[0].Addresses = make([]corev1.EndpointAddress, len(masterIPs))
		for ind, ip := range masterIPs {
			e.Subsets[0].Addresses[ind] = corev1.EndpointAddress{IP: ip}
		}

		// Lexicographic order is retained by this step.
		e.Subsets = endpointsv1.RepackSubsets(e.Subsets)
	}

      <email>******@****.***</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Andrew Williams</name>
      <id>handyande</id>
      <email>andy@handyande.co.uk</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Rahul Thakur</name>
      <id>rahul</id>

      <email>******@****.***</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Andrew Williams</name>
      <id>handyande</id>
      <email>andy@handyande.co.uk</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Rahul Thakur</name>
      <id>rahul</id>

      <email>******@****.***</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Andrew Williams</name>
      <id>handyande</id>
      <email>andy@handyande.co.uk</email>
      <roles>
        <role>Developer</role>
      </roles>
    </developer>
    <developer>
      <name>Rahul Thakur</name>
      <id>rahul</id>

		// Base is a power of 2 and 2 <= base <= len(digits) where len(digits) is 36.
		// The largest power of 2 below or equal to 36 is 32, which is 1 << 5;
		// i.e., the largest possible shift count is 5. By &-ind that value with
		// the constant 7 we tell the compiler that the shift count is always
		// less than 8 which is smaller than any register width. This allows
		// the compiler to generate better code for the shift operation.

					Cluster: c,
				})
				secret, _, err := createRemoteSecret(t, istioCtl, c.Name())
				g.Expect(err).To(BeNil())
				secrets[c.Name()] = secret
			}
			for ind, c := range t.Environment().Clusters() {
				// apply remote secret to be used for analysis
				for sc, secret := range secrets {
					if c.Name() == sc {
						continue
					}

* Update kube-proxy image to be based off of Debian 8.6 base image. ([#39695](https://github.com/kubernetes/kubernetes/pull/39695), [@ixdy](https://github.com/ixdy))
* Update amd64 kube-proxy base image to debian-iptables-amd64:v5 ([#39725](https://github.com/kubernetes/kubernetes/pull/39725), [@ixdy](https://github.com/ixdy))