1 // $G $D/$F.go && $L $F.$A && ./$A.out >tmp.go &&
2 // $G tmp.go && $L tmp.$A && ./$A.out || echo BUG: 64bit
5 // Copyright 2009 The Go Authors. All rights reserved.
6 // Use of this source code is governed by a BSD-style
7 // license that can be found in the LICENSE file.
9 // Generate test of 64-bit arithmetic.
10 // Most synthesized routines have different cases for
11 // constants vs variables and even the generated code has
12 // different cases for large and small constants,
13 // so try a good range of inputs.
23 var bout *bufio.Writer
25 // 64-bit math without using 64-bit numbers,
26 // so that we can generate the test program even
27 // if the compiler has buggy or missing 64-bit support.
39 func (a Uint64) Int64() (c Int64) {
45 func (a Uint64) Cmp(b Uint64) int {
59 func (a Uint64) LeftShift(b uint) (c Uint64) {
65 c.hi = a.lo << (b - 32)
68 c.hi = a.hi<<b | a.lo>>(32-b)
74 func (a Uint64) RightShift(b uint) (c Uint64) {
81 c.lo = a.hi >> (b - 32)
84 c.lo = a.hi<<(32-b) | a.lo>>b
89 func (a Uint64) LeftShift64(b Uint64) (c Uint64) {
90 if b.hi != 0 || b.lo >= 64 {
93 return a.LeftShift(uint(b.lo))
96 func (a Uint64) RightShift64(b Uint64) (c Uint64) {
97 if b.hi != 0 || b.lo >= 64 {
100 return a.RightShift(uint(b.lo))
103 func (a Uint64) Plus(b Uint64) (c Uint64) {
105 if c.lo = a.lo + b.lo; c.lo < a.lo {
108 c.hi = a.hi + b.hi + carry
112 func (a Uint64) Minus(b Uint64) (c Uint64) {
114 if c.lo = a.lo - b.lo; c.lo > a.lo {
117 c.hi = a.hi - b.hi - borrow
121 func (a Uint64) Neg() (c Uint64) {
126 func (a Uint64) Com() (c Uint64) {
132 func (a Uint64) Len() int {
135 for i := 31; i >= 0; i-- {
136 if a.hi&(1<<uint(i)) != 0 {
141 for i := 31; i >= 0; i-- {
142 if a.lo&(1<<uint(i)) != 0 {
150 func (a Uint64) HasBit(b uint) bool {
155 return a.hi&(1<<(b-32)) != 0
157 return a.lo&(1<<b) != 0
160 func (a Uint64) Times(b Uint64) (c Uint64) {
161 for i := uint(0); i < 64; i++ {
163 c = c.Plus(a.LeftShift(i))
169 func (a Uint64) DivMod(b Uint64) (quo, rem Uint64) {
170 n := a.Len() - b.Len()
172 b = b.LeftShift(uint(n))
173 for i := 0; i <= n; i++ {
174 quo = quo.LeftShift(1)
175 if b.Cmp(a) <= 0 { // b <= a
186 func (a Uint64) And(b Uint64) (c Uint64) {
192 func (a Uint64) AndNot(b Uint64) (c Uint64) {
198 func (a Uint64) Or(b Uint64) (c Uint64) {
204 func (a Uint64) Xor(b Uint64) (c Uint64) {
210 func (a Uint64) String() string { return fmt.Sprintf("%#x%08x", a.hi, a.lo) }
212 func (a Int64) Uint64() (c Uint64) {
218 func (a Int64) Cmp(b Int64) int {
219 // Same body as Uint64.Cmp,
220 // but behaves differently
221 // because hi is uint32 not int32.
235 func (a Int64) LeftShift(b uint) (c Int64) { return a.Uint64().LeftShift(b).Int64() }
237 func (a Int64) RightShift(b uint) (c Int64) {
240 c.hi = a.hi >> 31 // sign extend
243 c.hi = a.hi >> 31 // sign extend
244 c.lo = uint32(a.hi >> (b - 32))
247 c.lo = uint32(a.hi<<(32-b)) | a.lo>>b
252 func (a Int64) LeftShift64(b Uint64) (c Int64) {
253 if b.hi != 0 || b.lo >= 64 {
256 return a.LeftShift(uint(b.lo))
259 func (a Int64) RightShift64(b Uint64) (c Int64) {
260 if b.hi != 0 || b.lo >= 64 {
261 return a.RightShift(64)
263 return a.RightShift(uint(b.lo))
266 func (a Int64) Plus(b Int64) (c Int64) { return a.Uint64().Plus(b.Uint64()).Int64() }
268 func (a Int64) Minus(b Int64) (c Int64) { return a.Uint64().Minus(b.Uint64()).Int64() }
270 func (a Int64) Neg() (c Int64) { return a.Uint64().Neg().Int64() }
272 func (a Int64) Com() (c Int64) { return a.Uint64().Com().Int64() }
274 func (a Int64) Times(b Int64) (c Int64) { return a.Uint64().Times(b.Uint64()).Int64() }
276 func (a Int64) DivMod(b Int64) (quo Int64, rem Int64) {
291 q, r := a.Uint64().DivMod(b.Uint64())
304 func (a Int64) And(b Int64) (c Int64) { return a.Uint64().And(b.Uint64()).Int64() }
306 func (a Int64) AndNot(b Int64) (c Int64) { return a.Uint64().AndNot(b.Uint64()).Int64() }
308 func (a Int64) Or(b Int64) (c Int64) { return a.Uint64().Or(b.Uint64()).Int64() }
310 func (a Int64) Xor(b Int64) (c Int64) { return a.Uint64().Xor(b.Uint64()).Int64() }
312 func (a Int64) String() string {
314 return fmt.Sprintf("-%s", a.Neg().Uint64())
316 return a.Uint64().String()
319 var int64Values = []Int64{
329 Int64{0, 1<<32 - 1<<30},
334 Int64{1<<31 - 1, 1<<32 - 10000},
335 Int64{1<<31 - 1, 1<<32 - 1},
336 Int64{0x789abcde, 0xf0123456},
338 Int64{-1, 1<<32 - 1},
339 Int64{-1, 1<<32 - 2},
340 Int64{-1, 1<<32 - 3},
341 Int64{-1, 1<<32 - 100},
342 Int64{-1, 1<<32 - 10001},
343 Int64{-1, 1<<32 - (1<<31 - 1)},
344 Int64{-1, 1<<32 - 1<<31},
345 Int64{-1, 1<<32 - (1<<31 + 1)},
346 Int64{-1, 1<<32 - (1<<32 - 1<<30)},
350 Int64{-(1 << 31), 10000},
351 Int64{-(1 << 31), 1},
352 Int64{-(1 << 31), 0},
353 Int64{-0x789abcde, 0xf0123456},
356 var uint64Values = []Uint64{
363 Uint64{0, 1<<31 - 1},
365 Uint64{0, 1<<31 + 1},
366 Uint64{0, 1<<32 - 1<<30},
367 Uint64{0, 1<<32 - 1},
371 Uint64{1<<31 - 1, 1<<32 - 10000},
372 Uint64{1<<31 - 1, 1<<32 - 1},
373 Uint64{1<<32 - 1<<30, 0},
374 Uint64{1<<32 - 1, 0},
375 Uint64{1<<32 - 1, 1<<32 - 100},
376 Uint64{1<<32 - 1, 1<<32 - 1},
377 Uint64{0x789abcde, 0xf0123456},
378 Uint64{0xfedcba98, 0x76543210},
381 var shiftValues = []Uint64{
397 Uint64{0, 1<<32 - 1},
402 Uint64{1<<32 - 1, 0},
403 Uint64{1<<32 - 1, 1<<32 - 1},
408 // Part 1 is tests of variable operations; generic functions
409 // called by repetitive code. Could make a table but not worth it.
411 const prolog = "\n" +
418 "func testInt64Unary(a, plus, xor, minus int64) {\n" +
419 " if n, op, want := +a, `+`, plus; n != want { ok=false; println(`int64`, op, a, `=`, n, `should be`, want); }\n" +
420 " if n, op, want := ^a, `^`, xor; n != want { ok=false; println(`int64`, op, a, `=`, n, `should be`, want); }\n" +
421 " if n, op, want := -a, `-`, minus; n != want { ok=false; println(`int64`, op, a, `=`, n, `should be`, want); }\n" +
424 "func testInt64Binary(a, b, add, sub, mul, div, mod, and, or, xor, andnot int64, dodiv bool) {\n" +
425 " if n, op, want := a + b, `+`, add; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
426 " if n, op, want := a - b, `-`, sub; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
427 " if n, op, want := a * b, `*`, mul; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
429 " if n, op, want := a / b, `/`, div; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
430 " if n, op, want := a % b, `%`, mod; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
432 " if n, op, want := a & b, `&`, and; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
433 " if n, op, want := a | b, `|`, or; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
434 " if n, op, want := a ^ b, `^`, xor; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
435 " if n, op, want := a &^ b, `&^`, andnot; n != want { ok=false; println(`int64`, a, op, b, `=`, n, `should be`, want); }\n" +
438 "func testInt64Shift(a int64, b uint64, left, right int64) {\n" +
439 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`int64`, a, op, `uint64`, s, `=`, n, `should be`, want); }\n" +
440 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`int64`, a, op, `uint64`, s, `=`, n, `should be`, want); }\n" +
441 " if uint64(uint(b)) == b {\n" +
443 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`int64`, a, op, `uint`, s, `=`, n, `should be`, want); }\n" +
444 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`int64`, a, op, `uint`, s, `=`, n, `should be`, want); }\n" +
446 " if uint64(uint32(b)) == b {\n" +
447 " b := uint32(b);\n" +
448 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`int64`, a, op, `uint32`, s, `=`, n, `should be`, want); }\n" +
449 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`int64`, a, op, `uint32`, s, `=`, n, `should be`, want); }\n" +
451 " if uint64(uint16(b)) == b {\n" +
452 " b := uint16(b);\n" +
453 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`int64`, a, op, `uint16`, s, `=`, n, `should be`, want); }\n" +
454 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`int64`, a, op, `uint16`, s, `=`, n, `should be`, want); }\n" +
456 " if uint64(uint8(b)) == b {\n" +
457 " b := uint8(b);\n" +
458 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`int64`, a, op, `uint8`, s, `=`, n, `should be`, want); }\n" +
459 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`int64`, a, op, `uint8`, s, `=`, n, `should be`, want); }\n" +
463 "func testUint64Unary(a, plus, xor, minus uint64) {\n" +
464 " if n, op, want := +a, `+`, plus; n != want { ok=false; println(`uint64`, op, a, `=`, n, `should be`, want); }\n" +
465 " if n, op, want := ^a, `^`, xor; n != want { ok=false; println(`uint64`, op, a, `=`, n, `should be`, want); }\n" +
466 " if n, op, want := -a, `-`, minus; n != want { ok=false; println(`uint64`, op, a, `=`, n, `should be`, want); }\n" +
469 "func testUint64Binary(a, b, add, sub, mul, div, mod, and, or, xor, andnot uint64, dodiv bool) {\n" +
470 " if n, op, want := a + b, `+`, add; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
471 " if n, op, want := a - b, `-`, sub; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
472 " if n, op, want := a * b, `*`, mul; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
474 " if n, op, want := a / b, `/`, div; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
475 " if n, op, want := a % b, `%`, mod; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
477 " if n, op, want := a & b, `&`, and; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
478 " if n, op, want := a | b, `|`, or; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
479 " if n, op, want := a ^ b, `^`, xor; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
480 " if n, op, want := a &^ b, `&^`, andnot; n != want { ok=false; println(`uint64`, a, op, b, `=`, n, `should be`, want); }\n" +
483 "func testUint64Shift(a, b, left, right uint64) {\n" +
484 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`uint64`, a, op, `uint64`, s, `=`, n, `should be`, want); }\n" +
485 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`uint64`, a, op, `uint64`, s, `=`, n, `should be`, want); }\n" +
486 " if uint64(uint(b)) == b {\n" +
488 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`uint64`, a, op, `uint`, s, `=`, n, `should be`, want); }\n" +
489 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`uint64`, a, op, `uint`, s, `=`, n, `should be`, want); }\n" +
491 " if uint64(uint32(b)) == b {\n" +
492 " b := uint32(b);\n" +
493 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`uint64`, a, op, `uint32`, s, `=`, n, `should be`, want); }\n" +
494 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`uint64`, a, op, `uint32`, s, `=`, n, `should be`, want); }\n" +
496 " if uint64(uint16(b)) == b {\n" +
497 " b := uint16(b);\n" +
498 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`uint64`, a, op, `uint16`, s, `=`, n, `should be`, want); }\n" +
499 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`uint64`, a, op, `uint16`, s, `=`, n, `should be`, want); }\n" +
501 " if uint64(uint8(b)) == b {\n" +
502 " b := uint8(b);\n" +
503 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(`uint64`, a, op, `uint8`, s, `=`, n, `should be`, want); }\n" +
504 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(`uint64`, a, op, `uint8`, s, `=`, n, `should be`, want); }\n" +
510 fmt.Fprint(bout, prolog)
511 for _, a := range int64Values {
512 fmt.Fprintf(bout, "func test%v() {\n", ntest)
514 fmt.Fprintf(bout, "\ttestInt64Unary(%v, %v, %v, %v);\n", a, a, a.Com(), a.Neg())
515 for _, b := range int64Values {
519 if b.Cmp(zero) != 0 { // b != 0
520 // Can't divide by zero but also can't divide -0x8000...000 by -1.
521 var bigneg = Int64{-0x80000000, 0}
522 var minus1 = Int64{-1, ^uint32(0)}
523 if a.Cmp(bigneg) != 0 || b.Cmp(minus1) != 0 { // a != -1<<63 || b != -1
524 div, mod = a.DivMod(b)
528 fmt.Fprintf(bout, "\ttestInt64Binary(%v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v);\n",
529 a, b, a.Plus(b), a.Minus(b), a.Times(b), div, mod,
530 a.And(b), a.Or(b), a.Xor(b), a.AndNot(b), dodiv)
532 for _, b := range shiftValues {
533 fmt.Fprintf(bout, "\ttestInt64Shift(%v, %v, %v, %v);\n",
534 a, b, a.LeftShift64(b), a.RightShift64(b))
536 fmt.Fprintf(bout, "}\n")
539 for _, a := range uint64Values {
540 fmt.Fprintf(bout, "func test%v() {\n", ntest)
542 fmt.Fprintf(bout, "\ttestUint64Unary(%v, %v, %v, %v);\n", a, a, a.Com(), a.Neg())
543 for _, b := range uint64Values {
547 if b.Cmp(zero) != 0 { // b != 0
548 div, mod = a.DivMod(b)
551 fmt.Fprintf(bout, "\ttestUint64Binary(%v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v);\n",
552 a, b, a.Plus(b), a.Minus(b), a.Times(b), div, mod,
553 a.And(b), a.Or(b), a.Xor(b), a.AndNot(b), dodiv)
555 for _, b := range shiftValues {
556 fmt.Fprintf(bout, "\ttestUint64Shift(%v, %v, %v, %v);\n",
557 a, b, a.LeftShift64(b), a.RightShift64(b))
559 fmt.Fprintf(bout, "}\n")
563 // Part 2 is tests of operations involving one variable and one constant.
565 const binaryConstL = "func test%vBinaryL%v(b, add, sub, mul, div, mod, and, or, xor, andnot %v, dodiv bool) {\n" +
566 " const a %v = %v;\n" +
567 " const typ = `%s`;\n" +
568 " if n, op, want := a + b, `+`, add; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
569 " if n, op, want := a - b, `-`, sub; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
570 " if n, op, want := a * b, `*`, mul; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
572 " if n, op, want := a / b, `/`, div; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
573 " if n, op, want := a %% b, `%%`, mod; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
575 " if n, op, want := a & b, `&`, and; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
576 " if n, op, want := a | b, `|`, or; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
577 " if n, op, want := a ^ b, `^`, xor; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
578 " if n, op, want := a &^ b, `&^`, andnot; n != want { ok=false; println(typ, `const`, a, op, `var`, b, `=`, n, `should be`, want); }\n" +
582 const binaryConstR = "func test%vBinaryR%v(a, add, sub, mul, div, mod, and, or, xor, andnot %v, dodiv bool) {\n" +
583 " const b %v = %v;\n" +
584 " const typ = `%s`;\n" +
585 " if n, op, want := a + b, `+`, add; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
586 " if n, op, want := a - b, `-`, sub; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
587 " if n, op, want := a * b, `*`, mul; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
589 " if n, op, want := a / b, `/`, div; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
590 " if n, op, want := a %% b, `%%`, mod; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
592 " if n, op, want := a & b, `&`, and; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
593 " if n, op, want := a | b, `|`, or; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
594 " if n, op, want := a ^ b, `^`, xor; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
595 " if n, op, want := a &^ b, `&^`, andnot; n != want { ok=false; println(typ, `var`, a, op, `const`, b, `=`, n, `should be`, want); }\n" +
599 const shiftConstL = "func test%vShiftL%v(b uint64, left, right %v) {\n" +
600 " const a %v = %v;\n" +
601 " const typ = `%s`;\n" +
602 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(typ, `const`, a, op, `var`, s, `=`, n, `should be`, want); }\n" +
603 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(typ, `const`, a, op, `var`, s, `=`, n, `should be`, want); }\n" +
604 " if uint64(uint32(b)) == b {\n" +
605 " b := uint32(b);\n" +
606 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(typ, `const`, a, op, `var`, s, `=`, n, `should be`, want); }\n" +
607 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(typ, `const`, a, op, `var`, s, `=`, n, `should be`, want); }\n" +
611 const shiftConstR = "func test%vShiftR%v(a, left, right %v) {\n" +
612 " const b uint64 = %v;\n" +
613 " const typ = `%s`;\n" +
614 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(typ, `var`, a, op, `const`, s, `=`, n, `should be`, want); }\n" +
615 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(typ, `var`, a, op, `const`, s, `=`, n, `should be`, want); }\n" +
616 " if b & 0xffffffff == b {\n" +
617 " const b = uint32(b & 0xffffffff);\n" +
618 " if n, op, s, want := a << b, `<<`, b, left; n != want { ok=false; println(typ, `var`, a, op, `const`, s, `=`, n, `should be`, want); }\n" +
619 " if n, op, s, want := a >> b, `>>`, b, right; n != want { ok=false; println(typ, `var`, a, op, `const`, s, `=`, n, `should be`, want); }\n" +
624 for i, a := range int64Values {
625 fmt.Fprintf(bout, binaryConstL, "Int64", i, "int64", "int64", a, "int64")
626 fmt.Fprintf(bout, binaryConstR, "Int64", i, "int64", "int64", a, "int64")
627 fmt.Fprintf(bout, shiftConstL, "Int64", i, "int64", "int64", a, "int64")
629 for i, a := range uint64Values {
630 fmt.Fprintf(bout, binaryConstL, "Uint64", i, "uint64", "uint64", a, "uint64")
631 fmt.Fprintf(bout, binaryConstR, "Uint64", i, "uint64", "uint64", a, "uint64")
632 fmt.Fprintf(bout, shiftConstL, "Uint64", i, "uint64", "uint64", a, "uint64")
634 for i, a := range shiftValues {
635 fmt.Fprintf(bout, shiftConstR, "Int64", i, "int64", a, "int64")
636 fmt.Fprintf(bout, shiftConstR, "Uint64", i, "uint64", a, "uint64")
638 for i, a := range int64Values {
639 fmt.Fprintf(bout, "func test%v() {\n", ntest)
641 for j, b := range int64Values {
645 if b.Cmp(zero) != 0 { // b != 0
646 // Can't divide by zero but also can't divide -0x8000...000 by -1.
647 var bigneg = Int64{-0x80000000, 0}
648 var minus1 = Int64{-1, ^uint32(0)}
649 if a.Cmp(bigneg) != 0 || b.Cmp(minus1) != 0 { // a != -1<<63 || b != -1
650 div, mod = a.DivMod(b)
654 fmt.Fprintf(bout, "\ttestInt64BinaryL%v(%v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v);\n",
655 i, b, a.Plus(b), a.Minus(b), a.Times(b), div, mod,
656 a.And(b), a.Or(b), a.Xor(b), a.AndNot(b), dodiv)
657 fmt.Fprintf(bout, "\ttestInt64BinaryR%v(%v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v);\n",
658 j, a, a.Plus(b), a.Minus(b), a.Times(b), div, mod,
659 a.And(b), a.Or(b), a.Xor(b), a.AndNot(b), dodiv)
661 for j, b := range shiftValues {
662 fmt.Fprintf(bout, "\ttestInt64ShiftL%v(%v, %v, %v);\n",
663 i, b, a.LeftShift64(b), a.RightShift64(b))
664 fmt.Fprintf(bout, "\ttestInt64ShiftR%v(%v, %v, %v);\n",
665 j, a, a.LeftShift64(b), a.RightShift64(b))
667 fmt.Fprintf(bout, "}\n")
669 for i, a := range uint64Values {
670 fmt.Fprintf(bout, "func test%v() {\n", ntest)
672 for j, b := range uint64Values {
676 if b.Cmp(zero) != 0 { // b != 0
677 div, mod = a.DivMod(b)
680 fmt.Fprintf(bout, "\ttestUint64BinaryL%v(%v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v);\n",
681 i, b, a.Plus(b), a.Minus(b), a.Times(b), div, mod,
682 a.And(b), a.Or(b), a.Xor(b), a.AndNot(b), dodiv)
683 fmt.Fprintf(bout, "\ttestUint64BinaryR%v(%v, %v, %v, %v, %v, %v, %v, %v, %v, %v, %v);\n",
684 j, a, a.Plus(b), a.Minus(b), a.Times(b), div, mod,
685 a.And(b), a.Or(b), a.Xor(b), a.AndNot(b), dodiv)
687 for j, b := range shiftValues {
688 fmt.Fprintf(bout, "\ttestUint64ShiftL%v(%v, %v, %v);\n",
689 i, b, a.LeftShift64(b), a.RightShift64(b))
690 fmt.Fprintf(bout, "\ttestUint64ShiftR%v(%v, %v, %v);\n",
691 j, a, a.LeftShift64(b), a.RightShift64(b))
693 fmt.Fprintf(bout, "}\n")
698 bout = bufio.NewWriter(os.Stdout)
702 fmt.Fprintf(bout, "func main() {\n")
703 for i := 0; i < ntest; i++ {
704 fmt.Fprintf(bout, "\ttest%v();\n", i)
706 fmt.Fprintf(bout, "\tif !ok { os.Exit(1) }\n")
707 fmt.Fprintf(bout, "}\n")