math.go

     1  // Copyright 2018 The Go Authors. All rights reserved.
     2  // Use of this source code is governed by a BSD-style
     3  // license that can be found in the LICENSE file.
     4  
     5  package math
     6  
     7  import "internal/goarch"
     8  
     9  const (
    10  	MaxUint16  = ^uint16(0)
    11  	MaxUint32  = ^uint32(0)
    12  	MaxUint64  = ^uint64(0)
    13  	MaxUintptr = ^uintptr(0)
    14  
    15  	MaxInt64 = int64(MaxUint64 >> 1)
    16  )
    17  
    18  // MulUintptr returns a * b and whether the multiplication overflowed.
    19  // On supported platforms this is an intrinsic lowered by the compiler.
    20  func MulUintptr(a, b uintptr) (uintptr, bool) {
    21  	if a|b < 1<<(4*goarch.PtrSize) || a == 0 {
    22  		return a * b, false
    23  	}
    24  	overflow := b > MaxUintptr/a
    25  	return a * b, overflow
    26  }
    27  
    28  // Mul64 returns the 128-bit product of x and y: (hi, lo) = x * y
    29  // with the product bits' upper half returned in hi and the lower
    30  // half returned in lo.
    31  // This is a copy from math/bits.Mul64
    32  // On supported platforms this is an intrinsic lowered by the compiler.
    33  func Mul64(x, y uint64) (hi, lo uint64) {
    34  	const mask32 = 1<<32 - 1
    35  	x0 := x & mask32
    36  	x1 := x >> 32
    37  	y0 := y & mask32
    38  	y1 := y >> 32
    39  	w0 := x0 * y0
    40  	t := x1*y0 + w0>>32
    41  	w1 := t & mask32
    42  	w2 := t >> 32
    43  	w1 += x0 * y1
    44  	hi = x1*y1 + w2 + w1>>32
    45  	lo = x * y
    46  	return
    47  }
    48  
    49  // Add64 returns the sum with carry of x, y and carry: sum = x + y + carry.
    50  // The carry input must be 0 or 1; otherwise the behavior is undefined.
    51  // The carryOut output is guaranteed to be 0 or 1.
    52  //
    53  // This function's execution time does not depend on the inputs.
    54  // On supported platforms this is an intrinsic lowered by the compiler.
    55  func Add64(x, y, carry uint64) (sum, carryOut uint64) {
    56  	sum = x + y + carry
    57  	// The sum will overflow if both top bits are set (x & y) or if one of them
    58  	// is (x | y), and a carry from the lower place happened. If such a carry
    59  	// happens, the top bit will be 1 + 0 + 1 = 0 (&^ sum).
    60  	carryOut = ((x & y) | ((x | y) &^ sum)) >> 63
    61  	return
    62  }
    63
View as plain text