func continuePlain_ssa() int {
	var n int
	for i := 0; i < 10; i++ {
		if i == 6 {
			continue
		}
		n = i
	}
	return n
}

func continueLabeled_ssa() int {
	var n int
Next:
	for i := 0; i < 10; i++ {
		if i == 6 {
			continue Next
		}
		n = i
	}
	return n
}

func continuePlainInner_ssa() int {
	var n int
	for j := 0; j < 30; j += 10 {
		for i := 0; i < 10; i++ {
			if i == 6 {

package main

func f1(a []int64, i int64) int64 {
	return a[i+1<<30]
}
func f2(a []int32, i int64) int32 {
	return a[i+1<<30]
}
func f3(a []int16, i int64) int16 {
	return a[i+1<<30]
}
func f4(a []int8, i int64) int8 {
	return a[i+1<<31]
}
func f5(a []float64, i int64) float64 {
	return a[i+1<<30]
}
func f6(a []float32, i int64) float32 {
	return a[i+1<<30]
}

	// alt of failure is other
	if f1.i == 0 {
		return f2
	}
	if f2.i == 0 {
		return f1
	}

	f := c.inst(InstAlt)
	i := &c.p.Inst[f.i]
	i.Out = f1.i
	i.Arg = f2.i
	f.out = f1.out.append(c.p, f2.out)
	f.nullable = f1.nullable || f2.nullable
	return f
}

func (c *compiler) quest(f1 frag, nongreedy bool) frag {
	f := c.inst(InstAlt)
	i := &c.p.Inst[f.i]
	if nongreedy {
		i.Arg = f1.i

	}

	// Success.
	return &Instance{
		isJSON:    i.isJSON,
		structure: value,
	}
}

func (i *Instance) appendConstraint(fn func() error) *Instance {
	i.constraints = append(i.constraints, fn)
	return i
}

func (i *Instance) Equals(expected any, path string, args ...any) *Instance {
	path = fmt.Sprintf(path, args...)
	return i.appendConstraint(func() error {
		typeOf := reflect.TypeOf(expected)

	return i.CustomIngressFor(c, name, eastWestIngressIstioLabel)
}

func (i *istioImpl) CustomIngressFor(c cluster.Cluster, service types.NamespacedName, labelSelector string) ingress.Instance {
	i.mu.Lock()
	defer i.mu.Unlock()

	if i.ingress[c.Name()] == nil {
		i.ingress[c.Name()] = map[string]ingress.Instance{}
	}
	if _, ok := i.ingress[c.Name()][labelSelector]; !ok {

}

func heapSiftUp(heap []*batchCursor, i int) int {
	for i > 0 && heap[(i-1)/2].ev.time > heap[i].ev.time {
		heap[(i-1)/2], heap[i] = heap[i], heap[(i-1)/2]
		i = (i - 1) / 2
	}
	return i
}

func heapSiftDown(heap []*batchCursor, i int) int {
	for {
		m := min3(heap, i, 2*i+1, 2*i+2)
		if m == i {
			// Heap invariant already applies.
			break
		}
		heap[i], heap[m] = heap[m], heap[i]
		i = m
	}

</p>

<ol>
	<li><i>w</i> happens before <i>r</i>.</li>
	<li><i>w</i> does not happen before any other write <i>w'</i> (to <i>x</i>) that happens before <i>r</i>.</li>
</ol>

<p>
A <i>read-write data race</i> on memory location <i>x</i>
consists of a read-like memory operation <i>r</i> on <i>x</i>
and a write-like memory operation <i>w</i> on <i>x</i>,
at least one of which is non-synchronizing,

func level5() {
	i := 0    // ERROR "moved to heap: i"
	p0 := &i  // ERROR "moved to heap: p0"
	p1 := &p0
	p2 := p1
	sink = p2
}

func level6() {
	i := 0    // ERROR "moved to heap: i"
	p0 := &i
	p1 := &p0
	p2 := p1
	sink = *p2
}

func level7() {
	i := 0    // ERROR "moved to heap: i"
	p0 := &i
	p1 := &p0
	// note *p1 == &i
	p2 := *p1  // ERROR "moved to heap: p2"
	sink = &p2
}

}

func (i Instances) NamespacedName() NamespacedName {
	return i.Config().NamespacedName()
}

func (i Instances) PortForName(name string) Port {
	return i.Config().Ports.MustForName(name)
}

func (i Instances) Config() Config {
	return i.mustGetFirst().Config()
}

func (i Instances) Instances() Instances {
	return i
}

func (i Instances) mustGetFirst() Instance {

  EinsumDimensionNumbers dnums;
  for (int64_t i = 0; i < lhs.size(); ++i) {
    auto out_index = out_map.find(lhs[i]);
    if (out_index == out_map.end()) {
      dnums.lhs.emplace_back(i);
    } else {
      dnums.lhs_out.emplace_back(i, out_index->second);
    }
  }

  for (int64_t i = 0; i < out.size(); ++i) {
    auto lhs_index = lhs_map.find(out[i]);
    if (lhs_index == lhs_map.end()) {