blob: 6a55fe55f92dac29a832c956a7b70dfc57bf5214 [file] [log] [blame]
// Copyright 2020 The Wuffs Authors.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// https://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
// +build ignore
package main
// print-mpb-powers-of-10.go prints the
// wuffs_base__private_implementation__medium_prec_bin__powers_of_10 tables.
//
// Usage: go run print-mpb-powers-of-10.go -comments
import (
"flag"
"fmt"
"math/big"
"os"
)
var (
comments = flag.Bool("comments", false, "whether to print comments")
)
func main() {
if err := main1(); err != nil {
os.Stderr.WriteString(err.Error() + "\n")
os.Exit(1)
}
}
func main1() error {
flag.Parse()
const bigCount = 1 + ((+340 - -348) / 8)
fmt.Printf("static const uint32_t "+
"wuffs_base__private_implementation__big_powers_of_10[%d] = {\n", 3*bigCount)
for e := -348; e <= +340; e += 8 {
if err := do(e); err != nil {
return err
}
}
fmt.Printf("};\n\n")
fmt.Printf("static const uint32_t " +
"wuffs_base__private_implementation__small_powers_of_10[24] = {\n")
for e := 0; e <= 7; e += 1 {
if err := do(e); err != nil {
return err
}
}
fmt.Printf("};\n")
return nil
}
var (
one = big.NewInt(1)
ten = big.NewInt(10)
two64 = big.NewInt(0).Lsh(one, 64)
)
// N is large enough so that (1<<N) is bigger than 1e348.
const N = 2048
func do(e int) error {
z := big.NewInt(0).Lsh(one, N)
if e >= 0 {
exp := big.NewInt(0).Exp(ten, big.NewInt(int64(+e)), nil)
z.Mul(z, exp)
} else {
exp := big.NewInt(0).Exp(ten, big.NewInt(int64(-e)), nil)
z.Div(z, exp)
}
roundUp := false
n := int32(-N)
for z.Cmp(two64) >= 0 {
roundUp = z.Bit(0) > 0
z.Rsh(z, 1)
n++
}
if roundUp {
z.Add(z, one)
}
hex := fmt.Sprintf("%X", z)
if len(hex) != 16 {
return fmt.Errorf("invalid hexadecimal representation %q", hex)
}
fmt.Printf(" 0x%s, 0x%s, 0x%08X,", hex[8:], hex[:8], uint32(n))
if *comments {
fmt.Printf(" // 1e%-04d ≈ (0x%s ", e, hex)
if n >= 0 {
fmt.Printf("<< %4d)", +n)
} else {
fmt.Printf(">> %4d)", -n)
}
}
fmt.Println()
return nil
}