}

	// The Reader should have buffered all the content from the io.Reader.
	if n := len(eofR.buf); n != 0 {
		t.Fatalf("got %d bytes left in bufio.Reader source; want 0 bytes", n)
	}
	// To prove the point, check that there are still 5 bytes available to read.
	if n := r.Buffered(); n != 5 {
		t.Fatalf("got %d bytes buffered in bufio.Reader; want 5 bytes", n)
	}

	// This is the second read of 0 bytes.

<p>
If <code>list</code> pointed to a cyclic list,
then the original program would never access <code>*p</code> or <code>*q</code>,
but the rewritten program would.
(Moving `*p` ahead would be safe if the compiler can prove `*p` will not panic;
moving `*q` ahead would also require the compiler proving that no other
goroutine can access `*q`.)
</p>

<p>
Not introducing data races also means not assuming that called functions

pkg syscall (windows-amd64), const PROV_INTEL_SEC = 22
pkg syscall (windows-amd64), const PROV_MS_EXCHANGE = 5
pkg syscall (windows-amd64), const PROV_REPLACE_OWF = 23
pkg syscall (windows-amd64), const PROV_RNG = 21
pkg syscall (windows-amd64), const PROV_RSA_AES = 24
pkg syscall (windows-amd64), const PROV_RSA_FULL = 1
pkg syscall (windows-amd64), const PROV_RSA_SCHANNEL = 12