} else if nextReg != int(reg) {
				p.errorf("incontiguous register in ARM64 register list: %s", name)
			}
			regCnt++
			nextReg = (nextReg + 1) % 32
		case sys.ARM:
			// Parse the upper and lower bounds.
			lo := p.registerNumber(tok.String())
			hi := lo
			if p.peek() == '-' {
				p.next()
				hi = p.registerNumber(p.next().String())
			}
			if hi < lo {
				lo, hi = hi, lo

</p>

<p>
For arrays or strings, the indices are <i>in range</i> if
<code>0</code> &lt;= <code>low</code> &lt;= <code>high</code> &lt;= <code>len(a)</code>,
otherwise they are <i>out of range</i>.
For slices, the upper index bound is the slice capacity <code>cap(a)</code> rather than the length.
A <a href="#Constants">constant</a> index must be non-negative and
<a href="#Representability">representable</a> by a value of type

	}
	if want := 1; want != code {
		t.Errorf("want exit code %d, got %d", want, code)
	}
}

func TestExitCodeMissing(t *testing.T) {
	var wantErr *regexp.Regexp
	check := func(text string) {
		t.Helper()
		var out strings.Builder
		f, exitStr := newExitCodeFilter(&out)
		if want := "exitcode="; want != exitStr {
			t.Fatalf("test assumes exitStr will be %q, but got %q", want, exitStr)
		}
		f.Write([]byte(text))