// file support represent sparse files in the sparseDatas form. That is, they
// specify the fragments in the file that has data, and treat everything else as
// having zero bytes. As such, the encoding and decoding logic in this package
// deals with sparseDatas.
//
// However, the external API uses sparseHoles instead of sparseDatas because the

pkg syscall (darwin-arm64), const RTM_IFINFO2 ideal-int
pkg syscall (darwin-arm64), const RTM_LOCK = 8
pkg syscall (darwin-arm64), const RTM_LOCK ideal-int
pkg syscall (darwin-arm64), const RTM_LOSING = 5
pkg syscall (darwin-arm64), const RTM_LOSING ideal-int
pkg syscall (darwin-arm64), const RTM_MISS = 7
pkg syscall (darwin-arm64), const RTM_MISS ideal-int
pkg syscall (darwin-arm64), const RTM_NEWADDR = 12

pkg syscall (freebsd-arm64), const RTM_IFINFO ideal-int
pkg syscall (freebsd-arm64), const RTM_LOCK = 8
pkg syscall (freebsd-arm64), const RTM_LOCK ideal-int
pkg syscall (freebsd-arm64), const RTM_LOSING = 5
pkg syscall (freebsd-arm64), const RTM_LOSING ideal-int
pkg syscall (freebsd-arm64), const RTM_MISS = 7
pkg syscall (freebsd-arm64), const RTM_MISS ideal-int
pkg syscall (freebsd-arm64), const RTM_NEWADDR = 12

pkg syscall (darwin-386), const RTM_IFINFO ideal-int
pkg syscall (darwin-386), const RTM_IFINFO2 ideal-int
pkg syscall (darwin-386), const RTM_LOCK ideal-int
pkg syscall (darwin-386), const RTM_LOSING ideal-int
pkg syscall (darwin-386), const RTM_MISS ideal-int
pkg syscall (darwin-386), const RTM_NEWADDR ideal-int
pkg syscall (darwin-386), const RTM_NEWMADDR ideal-int

Russ Cox <******@****.***> 1692199082 -0400

shipped. Each file adds new lines but does not remove any.

except.txt lists features that may disappear without breaking true
compatibility.

Starting with go1.19.txt, each API feature line must end in "#nnnnn"
giving the GitHub issue number of the proposal issue that accepted
the new API. This helps with our end-of-cycle audit of new APIs.
The same requirement applies to next/* (described below), which will
become a go1.XX.txt for XX >= 19.

// upper case, giving priority to the special casing rules.
func ToUpperSpecial(c unicode.SpecialCase, s []byte) []byte {
	return Map(c.ToUpper, s)
}

// ToLowerSpecial treats s as UTF-8-encoded bytes and returns a copy with all the Unicode letters mapped to their
// lower case, giving priority to the special casing rules.

		return 0
	}
	r, ok := p.registerReference(name)
	if !ok {
		return 0
	}
	reg := r - p.arch.Register["R0"]
	if reg < 0 {
		// Could happen for an architecture having other registers prefixed by R
		p.errorf("expected g or R0 through R15; found %s", name)
		return 0
	}
	return uint16(reg)
}

// Note: There are two changes in the expression handling here

	<code>A</code> must have all methods of <code>C</code>, if any,
	and corresponding method types must unify exactly.
</li>
</ul>

<p>
When solving type equations from type constraints,
solving one equation may infer additional type arguments,
which in turn may enable solving other equations that depend
on those type arguments.
Type inference repeats type unification as long as new type
arguments are inferred.
</p>

Otherwise, the local stack frame must not contain pointers,
and the assembly must confirm this fact by executing the
pseudo-instruction <code>NO_LOCAL_POINTERS</code>.
Because stack resizing is implemented by moving the stack,
the stack pointer may change during any function call:
even pointers to stack data must not be kept in local variables.
</p>

<p>
Assembly functions should always be given Go prototypes,