crackNum-3.7: src/CrackNum/Main.hs
---------------------------------------------------------------------------
-- |
-- Module : Main
-- Copyright : (c) Levent Erkok
-- License : BSD3
-- Maintainer : erkokl@gmail.com
-- Stability : experimental
--
-- Main entry point for the crackNum executable
-----------------------------------------------------------------------------
{-# LANGUAGE CPP #-}
{-# LANGUAGE ScopedTypeVariables #-}
{-# LANGUAGE TupleSections #-}
{-# OPTIONS_GHC -Wall -Werror #-}
module Main(main) where
import Control.Monad (when)
import Data.Char (isDigit, isSpace, toLower)
import Data.List (isPrefixOf, isSuffixOf, unfoldr)
import Data.Maybe (fromMaybe)
import Text.Read (readMaybe)
import System.Environment (getArgs, getProgName, withArgs)
import System.Console.GetOpt (ArgOrder(Permute), getOpt, ArgDescr(..), OptDescr(..), usageInfo)
import System.Exit (exitFailure)
import System.IO (hPutStr, stderr)
import LibBF
import Numeric
import Data.SBV hiding (crack)
import Data.SBV.Float hiding (FP)
import Data.SBV.Dynamic hiding (satWith)
import Data.SBV.Internals hiding (free)
import Data.Version (showVersion)
import Paths_crackNum (version)
import CrackNum.TestSuite
-- | Copyright info
copyRight :: String
copyRight = "(c) Levent Erkok. Released with a BSD3 license."
-- | Various precisions we support
data FP = SP -- Single precision
| DP -- Double precision
| FP Int Int -- Arbitrary precision with given exponent and significand sizes
deriving (Show, Eq)
-- | How many bits does this float occupy
fpSize :: FP -> Int
fpSize SP = 32
fpSize DP = 64
fpSize (FP i j) = i+j
-- | Rounding modes we support
data RM = RNE -- ^ Round nearest ties to even
| RNA -- ^ Round nearest ties to away
| RTP -- ^ Round towards positive infinity
| RTN -- ^ Round towards negative infinity
| RTZ -- ^ Round towards zero
deriving (Eq, Enum, Bounded)
-- | Show instance for RM, for descriptive purposes
instance Show RM where
show RNE = "RNE: Round nearest ties to even."
show RNA = "RNA: Round nearest ties to away."
show RTP = "RTP: Round towards positive infinity."
show RTN = "RTN: Round towards negative infinity."
show RTZ = "RTZ: Round towards zero."
-- Covert to LibBF rounding mode
toLibBFRM :: RM -> RoundMode
toLibBFRM RNE = NearEven
toLibBFRM RNA = NearAway
toLibBFRM RTP = ToPosInf
toLibBFRM RTN = ToNegInf
toLibBFRM RTZ = ToZero
-- | Options accepted by the executable
data Flag = Signed Int -- ^ Crack as a signed word with the given number of bits
| Unsigned Int -- ^ Crack as an unsigned word with the given number of bits
| Floating FP -- ^ Crack as the corresponding floating-point type
| RMode RM -- ^ Rounding mode to use
| Lanes Int -- ^ How many lanes to decode?
| BadFlag [String] -- ^ Bad input
| Version -- ^ Version
| Help -- ^ Show help
deriving (Show, Eq)
-- | Is this a rounding flag?
isRMode :: Flag -> Bool
isRMode RMode{} = True
isRMode _ = False
-- | Is this lanes flag
isLanes :: Flag -> Bool
isLanes Lanes{} = True
isLanes _ = False
-- | Given an integer flag value, turn it into a flag
getSize :: String -> (Int -> Flag) -> String -> Flag
getSize flg f n = case readMaybe n of
Just i | i > 0 -> f i
| True -> BadFlag ["Option " ++ show flg ++ " requires an integer >= 1. Received: " ++ show n]
Nothing -> BadFlag ["Option " ++ show flg ++ " requires an integer argument. Received: " ++ show n]
#include "MachDeps.h"
#define FP_MIN_EB 2
#define FP_MIN_SB 2
#if WORD_SIZE_IN_BITS == 64
#define FP_MAX_EB 61
#define FP_MAX_SB 4611686018427387902
#else
#define FP_MAX_EB 29
#define FP_MAX_SB 1073741822
#endif
-- | Given a float flag value, turn it into a flag
getFP :: String -> Flag
getFP "hp" = Floating $ FP 5 11
getFP "bp" = Floating $ FP 8 8
getFP "sp" = Floating SP
getFP "dp" = Floating DP
getFP "qp" = Floating $ FP 15 113
getFP ab = case span isDigit ab of
(eb@(_:_), '+':r) -> case span isDigit r of
(sp@(_:_), "") -> mkEBSB (read eb) (read sp)
_ -> bad
_ -> bad
where bad = BadFlag [ "Option " ++ show "-f" ++ " requires one of:"
, ""
, " hp: Half float ( 5 + 11)"
, " bp: Brain float ( 8 + 8)"
, " sp: Single precision ( 8 + 24)"
, " dp: Single precision (11 + 53)"
, " qp: Quad precision (15 + 113)"
, " a+b: Arbitrary precision ( a + b)"
, ""
, "where first number is the number of bits in the exponent"
, "and the second number is the number of bits in the significand, including the implicit bit."
]
mkEBSB :: Int -> Int -> Flag
mkEBSB eb sb
| eb >= FP_MIN_EB && eb <= FP_MAX_EB
&& sb >= FP_MIN_SB && sb <= FP_MAX_SB
= Floating $ FP eb sb
| True
= BadFlag [ "Invalid floating-point precision."
, ""
, " Exponent size must be between " ++ show (FP_MIN_EB :: Int) ++ " to " ++ show (FP_MAX_EB :: Int)
, " Significant size must be between " ++ show (FP_MIN_SB :: Int) ++ " to " ++ show (FP_MAX_SB :: Int)
, ""
, "Received: " ++ show eb ++ " " ++ show sb
]
getRM :: String -> Flag
getRM "rne" = RMode RNE
getRM "rna" = RMode RNA
getRM "rtp" = RMode RTP
getRM "rtn" = RMode RTN
getRM "rtz" = RMode RTZ
getRM m = BadFlag $ [ "Invalid rounding mode."
, ""
, " Must be one of:"
]
++ [ " " ++ show r | r <- [minBound .. maxBound::RM]]
++ [ ""
, "Received: " ++ m
]
-- | Options we accept
pgmOptions :: [OptDescr Flag]
pgmOptions = [
Option "i" [] (ReqArg (getSize "-i" Signed) "N" ) "Signed integer of N-bits"
, Option "w" [] (ReqArg (getSize "-w" Unsigned) "N" ) "Unsigned integer of N-bits"
, Option "f" [] (ReqArg getFP "fp") "Floating point format fp"
, Option "r" [] (ReqArg (getRM . map toLower) "rm") "Rounding mode to use. If not given, Nearest-ties-to-Even."
, Option "l" [] (ReqArg (getSize "-l" Lanes) "lanes") "Number of lanes to decode"
, Option "h?" ["help"] (NoArg Help) "print help, with examples"
, Option "v" ["version"] (NoArg Version) "print version info"
]
-- | Help info
helpStr :: String -> String
helpStr pn = usageInfo ("Usage: " ++ pn ++ " value OR binary/hex-pattern") pgmOptions
-- | Print usage info and examples.
usage :: String -> IO ()
usage pn = putStr $ unlines [ helpStr pn
, "Examples:"
, " Encoding:"
, " " ++ pn ++ " -i4 -- -2 -- encode as 4-bit signed integer"
, " " ++ pn ++ " -w4 2 -- encode as 4-bit unsigned integer"
, " " ++ pn ++ " -f3+4 2.5 -- encode as float with 3 bits exponent, 4 bits significand"
, " " ++ pn ++ " -f3+4 2.5 -rRTZ -- encode as above, but use RTZ rounding mode."
, " " ++ pn ++ " -fbp 2.5 -- encode as a brain-precision float"
, " " ++ pn ++ " -fdp 2.5 -- encode as a double-precision float"
, ""
, " Decoding:"
, " " ++ pn ++ " -i4 0b0110 -- decode as 4-bit signed integer, from binary"
, " " ++ pn ++ " -w4 0xE -- decode as 4-bit unsigned integer, from hex"
, " " ++ pn ++ " -f3+4 0b0111001 -- decode as float with 3 bits exponent, 4 bits significand"
, " " ++ pn ++ " -fbp 0x000F -- decode as a brain-precision float"
, " " ++ pn ++ " -fdp 0x8000000000000000 -- decode as a double-precision float"
, " " ++ pn ++ " -fhp 0x8000000000000000 -- decode as a double-precision float"
, " " ++ pn ++ " -l4 -fhp 64\\'hbdffaaffdc71fc60 -- decode as half-precision float over 4 lanes using verilog notation"
, ""
, " Notes:"
, " - For encoding:"
, " - Use -- to separate your argument if it's a negative number."
, " - For floats: You can pass in NaN, Inf, -0, -Inf etc as the argument, along with a decimal float."
, " - For decoding:"
, " - Use hexadecimal (0x) binary (0b), or N'h (verilog) notation as input."
, " Input must have one of these prefixes."
, " - You can use _,- or space as a digit to improve readability for the pattern to be decoded"
, " - With -lN parameter, you can decode multiple lanes of data."
, " - If you use verilog input format, then we will infer the number of lanes unless you provide it."
]
-- | Terminate early
die :: [String] -> IO a
die xs = do hPutStr stderr $ unlines $ "ERROR:" : map (" " ++) xs
exitFailure
-- | main entry point to crackNum
crack :: String -> [String] -> IO ()
crack pn argv = case getOpt Permute pgmOptions argv of
(_, _, errs@(_:_)) -> die $ errs ++ lines (helpStr pn)
(os, rs, [])
| Version `elem` os -> putStrLn $ pn ++ " v" ++ showVersion version ++ ", " ++ copyRight
| Help `elem` os -> usage pn
| True -> do let rm = case reverse [r | RMode r <- os] of
(r:_) -> r
_ -> RNE
(tryInfer, lanesGiven) = case reverse [l | Lanes l <- os] of
(l:_) -> (False, l)
_ -> (True, 1)
arg = dropWhile isSpace $ unwords rs
(kind, eSize) <- case ([b | BadFlag b <- os], filter (\o -> not (isRMode o || isLanes o)) os) of
(e:_, _) -> die e
(_, [Signed n]) -> pure (SInt n, n)
(_, [Unsigned n]) -> pure (SWord n, n)
(_, [Floating s]) -> pure (SFloat s, fpSize s)
_ -> do usage pn
exitFailure
let inferLanes :: Int -> IO (Maybe Int)
inferLanes prefix
| prefix `rem` eSize == 0 = pure $ Just (prefix `div` eSize)
| True = die [ "Verilog notation size mismatch:"
, " Input length: " ++ show prefix
, " Element size: " ++ show eSize
, "Length must be an exact multiple of the element size."
]
(decode, lanesInferred) <- case arg of
'0':'x':_ -> pure (True, Nothing)
'0':'b':_ -> pure (True, Nothing)
_ -> case break (`elem` "'h") arg of
(pre@(_:_), '\'':'h':_)
| all isDigit pre -> (True,) <$> inferLanes (read pre)
_ -> pure (False, Nothing)
let lanes
| tryInfer = fromMaybe lanesGiven lanesInferred
| True = lanesGiven
if decode
then decodeAllLanes lanes kind arg
else encodeLane lanes kind rm arg
decodeAllLanes :: Int -> NKind -> String -> IO ()
decodeAllLanes lanes kind arg = do
when (lanes < 0) $ die
["Number of lanes must be non-negative. Got: " ++ show lanes]
bits <- parseToBits arg
let l = length bits
bitsPerLane = l `div` lanes
header i | lanes == 1 = pure ()
| True = putStrLn $ "== Lane " ++ show i ++ " " ++ replicate 60 '='
when (l `rem` lanes /= 0) $ die
["Number of lanes is not a divisor of the bit-length: " ++ show (l, lanes)]
let laneLoop (-1) [] = pure ()
laneLoop i curBits = do header i
let (curLaneBits, remBits) = splitAt bitsPerLane curBits
when (length curLaneBits /= bitsPerLane) $ die
[ "INTERNAL ERROR: Missing lane bits: "
, " Current lane bits: " ++ show curLaneBits
, " Needed : " ++ show bitsPerLane
, ""
, "Please report this as a bug!"
]
decodeLane (if lanes == 1 then Nothing else Just i) curLaneBits kind
laneLoop (i-1) remBits
laneLoop (lanes - 1) bits
-- | Kinds of numbers we understand
data NKind = SInt Int -- ^ Signed integer of n bits
| SWord Int -- ^ Unsigned integer of n bits
| SFloat FP -- ^ Floating point with precision
-- | main entry point to crackNum
main :: IO ()
main = do argv <- getArgs
pn <- getProgName
let rt = "--runTests"
if rt `elem` argv
then withArgs (filter (`notElem` [rt, "--"]) argv) runTests
else crack pn argv
parseToBits :: String -> IO [Bool]
parseToBits inp = do
let isSkippable c = c `elem` "_-" || isSpace c
(mbPadTo, isHex, stream) <- case map toLower (filter (not . isSkippable) inp) of
'0':'x':rest -> pure (Nothing, True, rest)
'0':'b':rest -> pure (Nothing, False, rest)
_ ->
case break (`elem` "'h") inp of
(pre@(_:_), '\'' : 'h' : rest) | all isDigit pre -> pure (Just (read pre), True, rest)
_ -> die [ "Input string must start with 0b, 0x, or N'h for decoding."
, "Received prefix: " ++ show (take 2 inp)
]
let cvtBin '1' = pure [True]
cvtBin '0' = pure [False]
cvtBin c = die ["Input has a non-binary digit: " ++ show c]
cvtHex c = case readHex [c] of
[(v, "")] -> pure $ pad
$ map (== (1::Int))
$ reverse
$ unfoldr (\x -> if x == 0 then Nothing else Just (x `rem` 2, x `div` 2)) v
_ -> die ["Input has a non-hexadecimal digit: " ++ show c]
where pad p = replicate (4 - length p) False ++ p
cvt i | isHex = concat <$> mapM cvtHex i
| True = concat <$> mapM cvtBin i
res <- cvt stream
let pad = case mbPadTo of
Nothing -> []
Just n -> replicate (n - length res) False
pure $ pad ++ res
-- | Decoding
decodeLane :: Maybe Int -> [Bool] -> NKind -> IO ()
decodeLane mbLane inputBits kind = case kind of
SInt n -> print =<< di True n
SWord n -> print =<< di False n
SFloat s -> df s
where bitString n = do let bits 1 = "one bit"
bits b = show b ++ " bits"
extra = case mbLane of
Nothing -> ""
Just i -> "Lane " ++ show i ++ " "
case length inputBits `compare` n of
EQ -> pure inputBits
LT -> die [extra ++ "Input needs to be " ++ show n ++ " bits wide, it's too short by " ++ bits (n - length inputBits)]
GT -> die [extra ++ "Input needs to be " ++ show n ++ " bits wide, it's too long by " ++ bits (length inputBits - n)]
di :: Bool -> Int -> IO SatResult
di sgn n = do bs <- bitString n
satWith z3{crackNum=True} $ p bs
where p :: [Bool] -> ConstraintSet
p bs = do x <- (if sgn then sIntN else sWordN) n "DECODED"
mapM_ constrain $ zipWith (.==) (map SBV (svBlastBE x)) (map literal bs)
df :: FP -> IO ()
df fp = do allBits <- bitString (fpSize fp)
let bs = map literal allBits
config = z3{ crackNum = True
, crackNumSurfaceVals = [("DECODED", foldr (\(idx, b) sofar -> if b then setBit sofar idx
else sofar)
(0 :: Integer)
(zip [0..] (reverse allBits)))]
}
case fp of
SP -> print =<< satWith config (dFloat bs)
DP -> print =<< satWith config (dDouble bs)
FP i j -> print =<< satWith config (dFP i j bs)
dFloat :: [SBool] -> ConstraintSet
dFloat bs = do x <- sFloat "DECODED"
let (s, e, m) = blastSFloat x
mapM_ constrain $ zipWith (.==) (s : e ++ m) bs
dDouble :: [SBool] -> ConstraintSet
dDouble bs = do x <- sDouble "DECODED"
let (s, e, m) = blastSDouble x
mapM_ constrain $ zipWith (.==) (s : e ++ m) bs
dFP :: Int -> Int -> [SBool] -> ConstraintSet
dFP i j bs = do sx <- svNewVar (KFP i j) "DECODED"
let bits = svBlastBE sx
mapM_ constrain $ zipWith (.==) (map SBV bits) bs
-- | Encoding
encodeLane :: Int -> NKind -> RM -> String -> IO ()
encodeLane lanes num rm inp
| lanes /= 1
= die [ "Lanes argument is only valid with decoding values."
, "Received: " ++ show lanes
]
| True
= case num of
SInt n -> print =<< ei True n
SWord n -> print =<< ei False n
SFloat s -> ef s
where ei :: Bool -> Int -> IO SatResult
ei sgn n = case reads inp of
[(v :: Integer, "")] -> satWith z3{crackNum=True} $ p v
_ -> die ["Expected an integer value to decode, received: " ++ show inp]
where p :: Integer -> Predicate
p iv = do let k = KBounded sgn n
v = SBV $ SVal k $ Left $ mkConstCV k iv
x <- (if sgn then sIntN else sWordN) n "ENCODED"
pure $ SBV x .== v
convert :: Int -> Int -> (BigFloat, Maybe String)
convert i j = case s of
Ok -> (v, Nothing)
_ -> (v, Just (trim (show s)))
where bfOpts = allowSubnormal <> rnd (toLibBFRM rm) <> expBits (fromIntegral i) <> precBits (fromIntegral j)
(v, s) = bfFromString 10 bfOpts inp
trim xs | "[" `isPrefixOf` xs && "]" `isSuffixOf` xs = init (drop 1 xs)
| True = xs
note :: Maybe String -> IO ()
note mbs = do putStrLn $ " Rounding mode: " ++ show rm
case mbs of
Nothing -> putStrLn $ " Note: Conversion from " ++ show inp ++ " was exact. No rounding happened."
Just s -> putStrLn $ " Note: Conversion from " ++ show inp ++ " was not faithful. Status: " ++ s ++ "."
ef :: FP -> IO ()
ef SP = case reads (fixup inp) of
[(v :: Float, "")] -> do print =<< satWith z3{crackNum=True} (p v)
note $ snd $ convert 8 24
_ -> ef (FP 8 24)
where p :: Float -> Predicate
p f = do x <- sFloat "ENCODED"
pure $ x .=== literal f
ef DP = case reads (fixup inp) of
[(v :: Double, "")] -> do print =<< satWith z3{crackNum=True} (p v)
note $ snd $ convert 11 53
_ -> ef (FP 11 53)
where p :: Double -> Predicate
p d = do x <- sDouble "ENCODED"
pure $ x .=== literal d
ef (FP i j) = do let (v, mbS) = convert i j
if bfIsNaN v
then die [ "Input does not represent floating point number we recognize."
, "Saw: " ++ inp
, ""
, "For decoding bit-strings, prefix them with 0x, N'h, 0b and"
, "provide a hexadecimal or binary representation of the input."
]
else do print =<< satWith z3{crackNum=True} (p v)
note mbS
where p :: BigFloat -> Predicate
p bf = do let k = KFP i j
sx <- svNewVar k "ENCODED"
pure $ SBV $ sx `svStrongEqual` SVal k (Left (CV k (CFP (fpFromBigFloat i j bf))))
-- | Convert certain strings to more understandable format by read
fixup :: String -> String
fixup inp
| linp `elem` ["inf", "infinity"] = "Infinity"
| linp `elem` ["-inf", "-infinity"] = "-Infinity"
| linp == "nan" = "NaN"
| linp == "-nan" = "-NaN"
| True = inp
where linp = map toLower inp