File Manager

X7ROOT File Manager

Current Path: /opt/golang/1.17.2/test

📁 ..
📄 235.go(1.56 KB)
📄 64bit.go(24.83 KB)
📄 README.md(696 B)
📁 abi
📄 alg.go(822 B)
📄 alias.go(588 B)
📄 alias1.go(803 B)
📄 alias2.go(2.52 KB)
📁 alias3.dir
📄 alias3.go(187 B)
📄 align.go(603 B)
📄 append.go(9.09 KB)
📄 append1.go(836 B)
📄 args.go(374 B)
📄 armimm.go(3.85 KB)
📄 assign.go(1.01 KB)
📄 assign1.go(5.55 KB)
📄 atomicload.go(798 B)
📁 bench
📄 bigalg.go(2.12 KB)
📄 bigmap.go(2.46 KB)
📄 blank.go(2.1 KB)
📄 blank1.go(724 B)
📄 bom.go(406 B)
📄 bombad.go(480 B)
📄 bounds.go(6.09 KB)
📄 cannotassign.go(1.04 KB)
📁 chan
📄 chancap.go(1.57 KB)
📄 chanlinear.go(2.12 KB)
📄 char_lit.go(657 B)
📄 char_lit1.go(822 B)
📄 checkbce.go(3.56 KB)
📄 clearfat.go(1.15 KB)
📄 closedchan.go(5.79 KB)
📄 closure.go(1.69 KB)
📄 closure1.go(280 B)
📄 closure2.go(1.86 KB)
📁 closure3.dir
📄 closure3.go(321 B)
📄 closure4.go(364 B)
📁 closure5.dir
📄 closure5.go(280 B)
📄 closure6.go(346 B)
📄 closure7.go(373 B)
📄 cmp.go(7.63 KB)
📄 cmp6.go(2.16 KB)
📄 cmplx.go(1.39 KB)
📄 cmplxdivide.c(2.05 KB)
📄 cmplxdivide.go(868 B)
📄 cmplxdivide1.go(240.68 KB)
📁 codegen
📄 complit.go(1.71 KB)
📄 complit1.go(1.66 KB)
📄 compos.go(403 B)
📄 const.go(4.78 KB)
📄 const1.go(3.79 KB)
📄 const2.go(1008 B)
📄 const3.go(659 B)
📄 const4.go(1.28 KB)
📄 const5.go(835 B)
📄 const6.go(834 B)
📄 const7.go(1.9 KB)
📄 convT2X.go(3.33 KB)
📄 convert.go(833 B)
📄 convert1.go(3.41 KB)
📄 convert2.go(5.92 KB)
📄 convert3.go(544 B)
📄 convert4.go(1.63 KB)
📄 convlit.go(2.39 KB)
📄 convlit1.go(458 B)
📄 copy.go(6.6 KB)
📄 copy1.go(851 B)
📄 crlf.go(782 B)
📄 ddd.go(4.23 KB)
📄 ddd1.go(1.58 KB)
📁 ddd2.dir
📄 ddd2.go(252 B)
📄 decl.go(926 B)
📄 declbad.go(1.43 KB)
📄 defer.go(875 B)
📄 defererrcheck.go(1.4 KB)
📄 deferfin.go(1.05 KB)
📄 defernil.go(563 B)
📄 deferprint.go(586 B)
📄 deferprint.out(126 B)
📄 devirt.go(599 B)
📄 directive.go(2.24 KB)
📄 divide.go(1.22 KB)
📄 divmod.go(9.28 KB)
📁 dwarf
📄 embedfunc.go(308 B)
📄 embedvers.go(292 B)
📄 empty.go(316 B)
📄 env.go(585 B)
📄 eof.go(308 B)
📄 eof1.go(333 B)
📄 escape.go(3.79 KB)
📄 escape2.go(35.07 KB)
📄 escape2n.go(35.1 KB)
📄 escape3.go(524 B)
📄 escape4.go(1.31 KB)
📄 escape5.go(5.37 KB)
📄 escape_array.go(3.64 KB)
📄 escape_calls.go(1.26 KB)
📄 escape_closure.go(4.24 KB)
📄 escape_field.go(2.92 KB)
📄 escape_goto.go(674 B)
📄 escape_hash_maphash.go(368 B)
📄 escape_iface.go(4.47 KB)
📄 escape_indir.go(3.31 KB)
📄 escape_level.go(1.79 KB)
📄 escape_map.go(2.76 KB)
📄 escape_param.go(8.9 KB)
📄 escape_runtime_atomic.go(874 B)
📄 escape_selfassign.go(538 B)
📄 escape_slice.go(3.79 KB)
📄 escape_struct_param1.go(8.9 KB)
📄 escape_struct_param2.go(8.94 KB)
📄 escape_struct_return.go(1.04 KB)
📄 escape_sync_atomic.go(943 B)
📄 escape_unsafe.go(2.16 KB)
📄 fibo.go(6.28 KB)
📄 finprofiled.go(1.95 KB)
📁 fixedbugs
📄 float_lit.go(3.95 KB)
📄 float_lit2.go(7.88 KB)
📄 float_lit3.go(1.59 KB)
📄 floatcmp.go(3.03 KB)
📄 for.go(844 B)
📄 func.go(1.29 KB)
📄 func1.go(445 B)
📄 func2.go(578 B)
📄 func3.go(505 B)
📄 func4.go(409 B)
📄 func5.go(1.49 KB)
📄 func6.go(393 B)
📄 func7.go(477 B)
📄 func8.go(599 B)
📄 funcdup.go(1.31 KB)
📄 funcdup2.go(721 B)
📄 fuse.go(5.31 KB)
📄 gc.go(411 B)
📄 gc1.go(303 B)
📄 gc2.go(972 B)
📄 gcgort.go(34.54 KB)
📄 gcstring.go(872 B)
📄 goprint.go(722 B)
📄 goprint.out(65 B)
📄 goto.go(8.39 KB)
📄 heapsampling.go(9.53 KB)
📄 helloworld.go(269 B)
📄 helloworld.out(13 B)
📄 if.go(1.36 KB)
📄 import.go(425 B)
📄 import1.go(633 B)
📁 import2.dir
📄 import2.go(247 B)
📁 import4.dir
📄 import4.go(310 B)
📄 import5.go(722 B)
📄 import6.go(1.38 KB)
📄 index.go(6.42 KB)
📄 index0.go(301 B)
📄 index1.go(305 B)
📄 index2.go(305 B)
📄 indirect.go(1.39 KB)
📄 indirect1.go(1.53 KB)
📄 init.go(479 B)
📄 init1.go(1.08 KB)
📄 initcomma.go(1.22 KB)
📄 initempty.go(604 B)
📄 initexp.go(1.74 KB)
📄 initialize.go(1.24 KB)
📄 initializerr.go(1.04 KB)
📄 initloop.go(407 B)
📄 inline.go(7.59 KB)
📄 inline_big.go(12.67 KB)
📄 inline_caller.go(1.36 KB)
📄 inline_callers.go(1.87 KB)
📄 inline_literal.go(1.02 KB)
📄 inline_math_bits_rotate.go(569 B)
📄 inline_sync.go(1.52 KB)
📄 inline_variadic.go(513 B)
📄 int_lit.go(387 B)
📄 intcvt.go(4.26 KB)
📁 interface
📁 intrinsic.dir
📄 intrinsic.go(259 B)
📄 intrinsic_atomic.go(799 B)
📄 iota.go(1.59 KB)
📁 ken
📄 label.go(1.02 KB)
📄 label1.go(2.08 KB)
📄 linkmain.go(236 B)
📄 linkmain_run.go(1.71 KB)
📁 linkname.dir
📄 linkname.go(456 B)
📄 linkname2.go(794 B)
📄 linkobj.go(3.17 KB)
📄 linkx.go(741 B)
📄 linkx_run.go(1.65 KB)
📄 literal.go(4.99 KB)
📄 literal2.go(2.22 KB)
📄 live.go(17.96 KB)
📄 live1.go(1.29 KB)
📄 live2.go(963 B)
📄 live_regabi.go(17.93 KB)
📄 live_syscall.go(1.13 KB)
📄 locklinear.go(3.56 KB)
📄 loopbce.go(9.75 KB)
📄 mainsig.go(598 B)
📄 makechan.go(1.04 KB)
📄 makemap.go(1.3 KB)
📄 makenew.go(605 B)
📄 makeslice.go(5.49 KB)
📄 mallocfin.go(1.18 KB)
📄 map.go(14.91 KB)
📄 map1.go(1.47 KB)
📄 mapclear.go(1.49 KB)
📄 maplinear.go(3.62 KB)
📄 mergemul.go(3.16 KB)
📄 method.go(5.24 KB)
📄 method1.go(727 B)
📄 method2.go(1.16 KB)
📄 method3.go(570 B)
📁 method4.dir
📄 method4.go(230 B)
📄 method5.go(6.73 KB)
📄 method6.go(467 B)
📄 method7.go(1.15 KB)
📄 named.go(4.61 KB)
📄 named1.go(984 B)
📄 nil.go(2.23 KB)
📄 nilcheck.go(3.62 KB)
📄 nilptr.go(3.15 KB)
📄 nilptr2.go(3.6 KB)
📄 nilptr3.go(5.39 KB)
📄 nilptr4.go(428 B)
📄 nilptr5.go(814 B)
📄 nilptr5_aix.go(805 B)
📄 nilptr5_wasm.go(812 B)
📄 nilptr_aix.go(3.09 KB)
📄 nosplit.go(10.8 KB)
📄 notinheap.go(1.29 KB)
📄 notinheap2.go(1.78 KB)
📄 notinheap3.go(1.24 KB)
📄 nowritebarrier.go(1.21 KB)
📄 nul1.go(1.23 KB)
📁 oldescape_linkname.dir
📄 opt_branchlikely.go(2.08 KB)
📄 parentype.go(424 B)
📄 peano.go(2.22 KB)
📄 phiopt.go(2.02 KB)
📄 print.go(1.56 KB)
📄 print.out(247 B)
📄 printbig.go(315 B)
📄 printbig.out(41 B)
📄 prove.go(19.65 KB)
📄 range.go(8.14 KB)
📄 recover.go(10.64 KB)
📄 recover1.go(2.5 KB)
📄 recover2.go(1.22 KB)
📄 recover3.go(1.64 KB)
📄 recover4.go(2.17 KB)
📄 recover5.go(408 B)
📄 reflectmethod1.go(578 B)
📄 reflectmethod2.go(719 B)
📄 reflectmethod3.go(651 B)
📄 reflectmethod4.go(573 B)
📄 reflectmethod5.go(544 B)
📄 reflectmethod6.go(555 B)
📄 reflectmethod7.go(417 B)
📄 rename.go(1.52 KB)
📄 rename1.go(1.13 KB)
📄 reorder.go(2.28 KB)
📄 reorder2.go(7.22 KB)
📁 retjmp.dir
📄 retjmp.go(252 B)
📄 return.go(32.69 KB)
📄 rotate.go(3.27 KB)
📄 rotate0.go(286 B)
📄 rotate1.go(286 B)
📄 rotate2.go(286 B)
📄 rotate3.go(286 B)
📄 run.go(56.89 KB)
📄 rune.go(603 B)
📁 runtime
📄 runtime.go(600 B)
📄 shift1.go(8.92 KB)
📄 shift2.go(1.31 KB)
📄 sieve.go(1 KB)
📄 sigchld.go(365 B)
📄 sigchld.out(17 B)
📄 simassign.go(1.12 KB)
📄 sinit.go(5.75 KB)
📄 sinit_run.go(856 B)
📄 sizeof.go(2.95 KB)
📄 slice3.go(2.92 KB)
📄 slice3err.go(5.19 KB)
📄 slicecap.go(1.85 KB)
📄 sliceopt.go(735 B)
📄 solitaire.go(2.9 KB)
📄 stack.go(1.69 KB)
📄 stackobj.go(975 B)
📄 stackobj2.go(1.55 KB)
📄 stackobj3.go(1.42 KB)
📄 strcopy.go(674 B)
📄 strength.go(1.02 KB)
📁 stress
📄 string_lit.go(3.58 KB)
📄 stringrange.go(1.45 KB)
📄 struct0.go(565 B)
📄 switch.go(6.1 KB)
📄 switch2.go(778 B)
📄 switch3.go(1.24 KB)
📄 switch4.go(526 B)
📄 switch5.go(2.25 KB)
📄 switch6.go(1.16 KB)
📄 switch7.go(796 B)
📁 syntax
📄 tinyfin.go(1.57 KB)
📄 torture.go(7.69 KB)
📄 turing.go(893 B)
📄 typecheck.go(549 B)
📄 typecheckloop.go(526 B)
📁 typeparam
📄 typeswitch.go(1.83 KB)
📄 typeswitch1.go(1.6 KB)
📄 typeswitch2.go(655 B)
📄 typeswitch2b.go(598 B)
📄 typeswitch3.go(1009 B)
📁 uintptrescapes.dir
📄 uintptrescapes.go(250 B)
📄 uintptrescapes2.go(2.18 KB)
📄 uintptrescapes3.go(1.28 KB)
📄 undef.go(758 B)
📄 unsafebuiltins.go(1.29 KB)
📄 used.go(5.96 KB)
📄 utf.go(1.19 KB)
📄 varerr.go(449 B)
📄 varinit.go(509 B)
📄 winbatch.go(1.97 KB)
📄 writebarrier.go(5.57 KB)
📄 zerodivide.go(5.71 KB)

Editing: index.go

// skip

// Copyright 2010 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

// Generate test of index and slice bounds checks.
// The actual tests are index0.go, index1.go, index2.go.

package main

import (
	"bufio"
	"fmt"
	"os"
	"unsafe"
)

const prolog = `

package main

import (
	"runtime"
)

type quad struct { x, y, z, w int }

const (
	cj = 100011
	ci int = 100012
	ci8 int8 = 115
	ci16 int16 = 10016
	ci32 int32 = 100013
	ci64 int64 = 100014
	ci64big int64 = 1<<31
	ci64bigger int64 = 1<<32
	chuge = 1<<100
	cfgood = 2.0
	cfbad = 2.1

cnj = -2
	cni int = -3
	cni8 int8 = -6
	cni16 int16 = -7
	cni32 int32 = -4
	cni64 int64 = -5
	cni64big int64 = -1<<31
	cni64bigger int64 = -1<<32
	cnhuge = -1<<100
	cnfgood = -2.0
	cnfbad = -2.1
)

var j int = 100020
var i int = 100021
var i8 int8 = 126
var i16 int16 = 10025
var i32 int32 = 100022
var i64 int64 = 100023
var i64big int64 = 1<<31
var i64bigger int64 = 1<<32
var huge uint64 = 1<<64 - 1
var fgood float64 = 2.0
var fbad float64 = 2.1

var nj int = -10
var ni int = -11
var ni8 int8 = -14
var ni16 int16 = -15
var ni32 int32 = -12
var ni64 int64 = -13
var ni64big int64 = -1<<31
var ni64bigger int64 = -1<<32
var nhuge int64 = -1<<63
var nfgood float64 = -2.0
var nfbad float64 = -2.1

var si []int = make([]int, 10)
var ai [10]int
var pai *[10]int = &ai

var sq []quad = make([]quad, 10)
var aq [10]quad
var paq *[10]quad = &aq

var sib []int = make([]int, 100000)
var aib [100000]int
var paib *[100000]int = &aib

var sqb []quad = make([]quad, 100000)
var aqb [100000]quad
var paqb *[100000]quad = &aqb

type T struct {
	si []int
	ai [10]int
	pai *[10]int
	sq []quad
	aq [10]quad
	paq *[10]quad

sib []int
	aib [100000]int
	paib *[100000]int
	sqb []quad
	aqb [100000]quad
	paqb *[100000]quad
}

var t = T{si, ai, pai, sq, aq, paq, sib, aib, paib, sqb, aqb, paqb}

var pt = &T{si, ai, pai, sq, aq, paq, sib, aib, paib, sqb, aqb, paqb}

// test that f panics
func test(f func(), s string) {
	defer func() {
		if err := recover(); err == nil {
			_, file, line, _ := runtime.Caller(2)
			bug()
			print(file, ":", line, ": ", s, " did not panic\n")
		} else if !contains(err.(error).Error(), "out of range") {
			_, file, line, _ := runtime.Caller(2)
			bug()
			print(file, ":", line, ": ", s, " unexpected panic: ", err.(error).Error(), "\n")
		}
	}()
	f()
}

func contains(x, y string) bool {
	for i := 0; i+len(y) <= len(x); i++ {
		if x[i:i+len(y)] == y {
			return true
		}
	}
	return false
}

var X interface{}
func use(y interface{}) {
	X = y
}

var didBug = false

func bug() {
	if !didBug {
		didBug = true
		println("BUG")
	}
}

func main() {
`

// pass variable set in index[012].go
//	0 - dynamic checks
//	1 - static checks of invalid constants (cannot assign to types)
//	2 - static checks of array bounds

func testExpr(b *bufio.Writer, expr string) {
	if pass == 0 {
		fmt.Fprintf(b, "\ttest(func(){use(%s)}, %q)\n", expr, expr)
	} else {
		fmt.Fprintf(b, "\tuse(%s)  // ERROR \"index|overflow|truncated|must be integer\"\n", expr)
	}
}

func main() {
	b := bufio.NewWriter(os.Stdout)

if pass == 0 {
		fmt.Fprint(b, "// run\n\n")
	} else {
		fmt.Fprint(b, "// errorcheck\n\n")
	}
	fmt.Fprint(b, prolog)

var choices = [][]string{
		// Direct value, fetch from struct, fetch from struct pointer.
		// The last two cases get us to oindex_const_sudo in gsubr.c.
		[]string{"", "t.", "pt."},

// Array, pointer to array, slice.
		[]string{"a", "pa", "s"},

// Element is int, element is quad (struct).
		// This controls whether we end up in gsubr.c (i) or cgen.c (q).
		[]string{"i", "q"},

// Small or big len.
		[]string{"", "b"},

// Variable or constant.
		[]string{"", "c"},

// Positive or negative.
		[]string{"", "n"},

// Size of index.
		[]string{"j", "i", "i8", "i16", "i32", "i64", "i64big", "i64bigger", "huge", "fgood", "fbad"},
	}

forall(choices, func(x []string) {
		p, a, e, big, c, n, i := x[0], x[1], x[2], x[3], x[4], x[5], x[6]

// Pass: dynamic=0, static=1, 2.
		// Which cases should be caught statically?
		// Only constants, obviously.
		// Beyond that, must be one of these:
		//	indexing into array or pointer to array
		//	negative constant
		//	large constant
		thisPass := 0
		if c == "c" && (a == "a" || a == "pa" || n == "n" || i == "i64big" || i == "i64bigger" || i == "huge" || i == "fbad") {
			if i == "huge" {
				// Due to a detail of gc's internals,
				// the huge constant errors happen in an
				// earlier pass than the others and inhibits
				// the next pass from running.
				// So run it as a separate check.
				thisPass = 1
			} else if a == "s" && n == "" && (i == "i64big" || i == "i64bigger") && unsafe.Sizeof(int(0)) > 4 {
				// If int is 64 bits, these huge
				// numbers do fit in an int, so they
				// are not rejected at compile time.
				thisPass = 0
			} else {
				thisPass = 2
			}
		}

pae := p + a + e + big
		cni := c + n + i

// If we're using the big-len data, positive int8 and int16 cannot overflow.
		if big == "b" && n == "" && (i == "i8" || i == "i16") {
			if pass == 0 {
				fmt.Fprintf(b, "\tuse(%s[%s])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[0:%s])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[1:%s])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[%s:])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[%s:%s])\n", pae, cni, cni)
			}
			return
		}

// Float variables cannot be used as indices.
		if c == "" && (i == "fgood" || i == "fbad") {
			return
		}
		// Integral float constant is ok.
		if c == "c" && n == "" && i == "fgood" {
			if pass == 0 {
				fmt.Fprintf(b, "\tuse(%s[%s])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[0:%s])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[1:%s])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[%s:])\n", pae, cni)
				fmt.Fprintf(b, "\tuse(%s[%s:%s])\n", pae, cni, cni)
			}
			return
		}

// Only print the test case if it is appropriate for this pass.
		if thisPass == pass {
			// Index operation
			testExpr(b, pae+"["+cni+"]")

// Slice operation.
			// Low index 0 is a special case in ggen.c
			// so test both 0 and 1.
			testExpr(b, pae+"[0:"+cni+"]")
			testExpr(b, pae+"[1:"+cni+"]")
			testExpr(b, pae+"["+cni+":]")
			testExpr(b, pae+"["+cni+":"+cni+"]")
		}
	})

fmt.Fprintln(b, "}")
	b.Flush()
}

func forall(choices [][]string, f func([]string)) {
	x := make([]string, len(choices))

var recurse func(d int)
	recurse = func(d int) {
		if d >= len(choices) {
			f(x)
			return
		}
		for _, x[d] = range choices[d] {
			recurse(d + 1)
		}
	}
	recurse(0)
}

X7ROOT File Manager

Editing: index.go

Upload File

Create Folder