sawUnmatchedErrors = true
			}
			continue
		}

		switch filename {
		case "completed":
			// Strictly speaking, there is no guarantee that seeing the error at completed:1
			// (at the end of the file) means we've seen all the errors from earlier in the file,
			// but usually it does. Certainly if we don't see the completed:1 error, we did
			// not get all the errors we expected.
			completed = true

		case "not-declared":

pkg syscall (darwin-arm64), const IPPROTO_MAXID = 52
pkg syscall (darwin-arm64), const IPPROTO_MAXID ideal-int
pkg syscall (darwin-arm64), const IPPROTO_MEAS = 19
pkg syscall (darwin-arm64), const IPPROTO_MEAS ideal-int
pkg syscall (darwin-arm64), const IPPROTO_MHRP = 48
pkg syscall (darwin-arm64), const IPPROTO_MHRP ideal-int
pkg syscall (darwin-arm64), const IPPROTO_MICP = 95

pkg syscall (freebsd-arm64), const IPPROTO_MAXID = 52
pkg syscall (freebsd-arm64), const IPPROTO_MAXID ideal-int
pkg syscall (freebsd-arm64), const IPPROTO_MEAS = 19
pkg syscall (freebsd-arm64), const IPPROTO_MEAS ideal-int
pkg syscall (freebsd-arm64), const IPPROTO_MH = 135
pkg syscall (freebsd-arm64), const IPPROTO_MH ideal-int
pkg syscall (freebsd-arm64), const IPPROTO_MHRP = 48

		} else if !test.atEOF && tok.ScanToken == scanner.EOF {
			t.Errorf("%d: %q: expected not EOF but at EOF", i, test.input)
		}
	}
}

type badExprTest struct {
	input string
	error string // Empty means no error.
}

var badExprTests = []badExprTest{
	{"0/0", "division by zero"},
	{"3/0", "division by zero"},
	{"(1<<63)/0", "divide of value with high bit set"},
	{"3%0", "modulo by zero"},

pkg syscall (darwin-386), const IPPROTO_LEAF2 ideal-int
pkg syscall (darwin-386), const IPPROTO_MAX ideal-int
pkg syscall (darwin-386), const IPPROTO_MAXID ideal-int
pkg syscall (darwin-386), const IPPROTO_MEAS ideal-int
pkg syscall (darwin-386), const IPPROTO_MHRP ideal-int
pkg syscall (darwin-386), const IPPROTO_MICP ideal-int
pkg syscall (darwin-386), const IPPROTO_MTP ideal-int

// However, we can't do that in cases where the lexer would not insert
// a semicolon. We only have to worry about cases that can occur in an
// expression passed through gofmt, which means composite literals and
// (due to the printer possibly inserting newlines because of position
// information) operators.
var gofmtLineReplacer = strings.NewReplacer(
	// Want to replace \n without ; after everything from

			advance, token, err := s.split(s.buf[s.start:s.end], s.err != nil)
			if err != nil {
				if err == ErrFinalToken {
					s.token = token
					s.done = true
					// When token is not nil, it means the scanning stops
					// with a trailing token, and thus the return value
					// should be true to indicate the existence of the token.
					return token != nil
				}
				s.setErr(err)
				return false
			}

Additional IP Rights Grant (Patents)

"This implementation" means the copyrightable works distributed by
Google as part of the Go project.

Google hereby grants to You a perpetual, worldwide, non-exclusive,
no-charge, royalty-free, irrevocable (except as stated in this section)
patent license to make, have made, use, offer to sell, sell, import,
transfer and otherwise run, modify and propagate the contents of this

pkg syscall (freebsd-riscv64), const IPPROTO_MAXID = 52 #53466
pkg syscall (freebsd-riscv64), const IPPROTO_MAXID ideal-int #53466
pkg syscall (freebsd-riscv64), const IPPROTO_MEAS = 19 #53466
pkg syscall (freebsd-riscv64), const IPPROTO_MEAS ideal-int #53466
pkg syscall (freebsd-riscv64), const IPPROTO_MH = 135 #53466
pkg syscall (freebsd-riscv64), const IPPROTO_MH ideal-int #53466

	}
	tok = in.Stack.Next()
	if tok != '\n' {
		in.Error("unexpected token at end of #line: ", tok)
	}
	pos := src.MakePos(in.Base(), uint(in.Line())+1, 1) // +1 because #line nnn means line nnn starts on next line
	in.Stack.SetBase(src.NewLinePragmaBase(pos, file, objabi.AbsFile(objabi.WorkingDir(), file, *flags.TrimPath), uint(line), 1))
}

// #undef processing
func (in *Input) undef() {