std: remove unused declarations

One function was unused by mistake, and is now used as intended.

Change-Id: I42ae7481c6f794b310bdac656ea525bd882f146e
Reviewed-on: https://go-review.googlesource.com/c/go/+/706815
Auto-Submit: Alan Donovan <[email protected]>
Reviewed-by: Dmitri Shuralyov <[email protected]>
Reviewed-by: Dmitri Shuralyov <[email protected]>
LUCI-TryBot-Result: Go LUCI <[email protected]>

Author: adonovan

src/runtime/stack_test.go

@@ -290,7 +290,7 @@ func setBig(p *int, x int, b bigBuf) {
 func TestDeferPtrsPanic(t *testing.T) {
 	for i := 0; i < 100; i++ {
 		c := make(chan int, 1)
-		go testDeferPtrsGoexit(c, i)
+		go testDeferPtrsPanic(c, i)
 		if n := <-c; n != 42 {
 			t.Fatalf("defer's stack references were not adjusted appropriately (i=%d n=%d)", i, n)
 		}

src/runtime/string_test.go

@@ -388,8 +388,6 @@ func TestString2Slice(t *testing.T) {
 	}
 }
 
-const intSize = 32 << (^uint(0) >> 63)
-
 func TestParseByteCount(t *testing.T) {
 	for _, test := range []struct {
 		in  string

src/sort/sort_slices_benchmark_test.go

@@ -34,14 +34,6 @@ func makeSortedInts(n int) []int {
 	return ints
 }
 
-func makeReversedInts(n int) []int {
-	ints := make([]int, n)
-	for i := 0; i < n; i++ {
-		ints[i] = n - i
-	}
-	return ints
-}
-
 func makeSortedStrings(n int) []string {
 	x := make([]string, n)
 	for i := 0; i < n; i++ {

src/text/template/parse/lex_test.go

@@ -578,15 +578,3 @@ func TestPos(t *testing.T) {
 		}
 	}
 }
-
-// parseLexer is a local version of parse that lets us pass in the lexer instead of building it.
-// We expect an error, so the tree set and funcs list are explicitly nil.
-func (t *Tree) parseLexer(lex *lexer) (tree *Tree, err error) {
-	defer t.recover(&err)
-	t.ParseName = t.Name
-	t.startParse(nil, lex, map[string]*Tree{})
-	t.parse()
-	t.add()
-	t.stopParse()
-	return t, nil
-}