diff --git a/bindings-bfd.cabal b/bindings-bfd.cabal --- a/bindings-bfd.cabal +++ b/bindings-bfd.cabal @@ -1,5 +1,5 @@ name: bindings-bfd -version: 0.1.3 +version: 0.2.0 cabal-version: >= 1.4 build-type: Simple license: LGPL-3 @@ -10,7 +10,7 @@ stability: alpha homepage: http://projects.haskell.org/bindings-bfd/ bug-reports: mailto:mcnster@gmail.com -package-url: http://projects.haskell.org/bindings-bfd/bindings-bfd.cabal +package-url: darcs://code.haskell.org/bindings-bfd synopsis: Bindings for libbfd, a component of the GNU `binutils' description: These are bindings for `libbfd', a component of the GNU `binutils' package. The bindings lets a Haskell program @@ -18,15 +18,23 @@ library file format supported by the GNU Project. It also has support for disassembly of code in these files where appropriate. -category: Bindings +category: FFI tested-with: GHC==6.12.3 extra-source-files: README, LICENSE, src/cbits/disassembler.h library exposed-modules: Bindings.Bfd - Bindings.Bfd.Disassembler - Bindings.Bfd.Disassembler.Info + Bindings.Bfd.Disasm + Bindings.Bfd.Disasm.I386.Insn + Bindings.Bfd.Disasm.I386.Insn.EffectiveAddr + Bindings.Bfd.Disasm.I386.Insn.Length + Bindings.Bfd.Disasm.I386.Insn.Mnemonic + Bindings.Bfd.Disasm.I386.Insn.Operand + Bindings.Bfd.Disasm.I386.Insn.Prefix + Bindings.Bfd.Disasm.I386.Lex + Bindings.Bfd.Disasm.I386.Parse + Bindings.Bfd.Disasm.Info Bindings.Bfd.Exception Bindings.Bfd.Endian Bindings.Bfd.Flags @@ -42,14 +50,17 @@ Bindings.Bfd.Symbol.Flags Bindings.Bfd.SymbolTable Bindings.Bfd.Target - build-depends: base >= 4.1.0.0 && < 5, + build-depends: array >= 0.3, + base >= 4.1.0.0 && < 5, containers >= 0.2.0.1, unix >= 2.3.2.0 hs-source-dirs: src extensions: CPP, ForeignFunctionInterface ghc-options: -Wall - build-tools: hsc2hs >= 0.67 + build-tools: alex >= 2.3, + happy >= 1.8, + hsc2hs >= 0.67 includes: bfd.h, dis-asm.h, stdarg.h, diff --git a/dist/build/Bindings/Bfd/Disasm/I386/Lex.hs b/dist/build/Bindings/Bfd/Disasm/I386/Lex.hs new file mode 100644 --- /dev/null +++ b/dist/build/Bindings/Bfd/Disasm/I386/Lex.hs @@ -0,0 +1,383 @@ +{-# OPTIONS -fglasgow-exts -cpp #-} +{-# LINE 1 "src/Bindings/Bfd/Disasm/I386/Lex.x" #-} + +module Bindings.Bfd.Disasm.I386.Lex ( + Token(..) + , lexer +) where + +import System.IO + +#if __GLASGOW_HASKELL__ >= 603 +#include "ghcconfig.h" +#elif defined(__GLASGOW_HASKELL__) +#include "config.h" +#endif +#if __GLASGOW_HASKELL__ >= 503 +import Data.Array +import Data.Char (ord) +import Data.Array.Base (unsafeAt) +#else +import Array +import Char (ord) +#endif +#if __GLASGOW_HASKELL__ >= 503 +import GHC.Exts +#else +import GlaExts +#endif +{-# LINE 1 "templates/wrappers.hs" #-} +{-# LINE 1 "templates/wrappers.hs" #-} +{-# LINE 1 "" #-} +{-# LINE 1 "" #-} +{-# LINE 1 "templates/wrappers.hs" #-} +-- ----------------------------------------------------------------------------- +-- Alex wrapper code. +-- +-- This code is in the PUBLIC DOMAIN; you may copy it freely and use +-- it for any purpose whatsoever. + +{-# LINE 18 "templates/wrappers.hs" #-} + +-- ----------------------------------------------------------------------------- +-- The input type + +{-# LINE 35 "templates/wrappers.hs" #-} + +{-# LINE 51 "templates/wrappers.hs" #-} + +-- ----------------------------------------------------------------------------- +-- Token positions + +-- `Posn' records the location of a token in the input text. It has three +-- fields: the address (number of chacaters preceding the token), line number +-- and column of a token within the file. `start_pos' gives the position of the +-- start of the file and `eof_pos' a standard encoding for the end of file. +-- `move_pos' calculates the new position after traversing a given character, +-- assuming the usual eight character tab stops. + +{-# LINE 74 "templates/wrappers.hs" #-} + +-- ----------------------------------------------------------------------------- +-- Default monad + +{-# LINE 162 "templates/wrappers.hs" #-} + + +-- ----------------------------------------------------------------------------- +-- Monad (with ByteString input) + +{-# LINE 251 "templates/wrappers.hs" #-} + + +-- ----------------------------------------------------------------------------- +-- Basic wrapper + + +type AlexInput = (Char,String) + +alexGetChar (_, []) = Nothing +alexGetChar (_, c:cs) = Just (c, (c,cs)) + +alexInputPrevChar (c,_) = c + +-- alexScanTokens :: String -> [token] +alexScanTokens str = go ('\n',str) + where go inp@(_,str) = + case alexScan inp 0 of + AlexEOF -> [] + AlexError _ -> error "lexical error" + AlexSkip inp' len -> go inp' + AlexToken inp' len act -> act (take len str) : go inp' + + + +-- ----------------------------------------------------------------------------- +-- Basic wrapper, ByteString version + +{-# LINE 297 "templates/wrappers.hs" #-} + +{-# LINE 322 "templates/wrappers.hs" #-} + + +-- ----------------------------------------------------------------------------- +-- Posn wrapper + +-- Adds text positions to the basic model. + +{-# LINE 339 "templates/wrappers.hs" #-} + + +-- ----------------------------------------------------------------------------- +-- Posn wrapper, ByteString version + +{-# LINE 354 "templates/wrappers.hs" #-} + + +-- ----------------------------------------------------------------------------- +-- GScan wrapper + +-- For compatibility with previous versions of Alex, and because we can. + +alex_base :: AlexAddr +alex_base = AlexA# "\xf6\xff\xff\xff\xfc\xff\xff\xff\xda\xff\xff\xff\x13\x00\x00\x00\x5e\x00\x00\x00\x6a\x00\x00\x00\xd4\xff\xff\xff\x8d\xff\xff\xff\x84\x00\x00\x00\xd1\x00\x00\x00\xeb\x00\x00\x00\xf5\x00\x00\x00\xd6\xff\xff\xff\x9c\xff\xff\xff\x2c\x01\x00\x00\x36\x01\x00\x00\xe5\xff\xff\xff\x9f\xff\xff\xff\x40\x01\x00\x00\x8b\x01\x00\x00\xa5\x01\x00\x00\xf2\x01\x00\x00\x0c\x02\x00\x00\x67\x02\x00\x00\x81\x02\x00\x00\xcc\x02\x00\x00\xe6\x02\x00\x00\x33\x03\x00\x00\x4d\x03\x00\x00\x98\x03\x00\x00\xb2\x03\x00\x00\x0d\x04\x00\x00\x27\x04\x00\x00\x72\x04\x00\x00\x8c\x04\x00\x00\xe7\x04\x00\x00\x01\x05\x00\x00\x4c\x05\x00\x00\x66\x05\x00\x00\xc1\x05\x00\x00\xf8\xff\xff\xff\xc5\xff\xff\xff\x00\x00\x00\x00\xbf\xff\xff\xff\xc3\xff\xff\xff\xc1\xff\xff\xff\x08\x00\x00\x00\x00\x00\x00\x00\x09\x00\x00\x00\x1d\x00\x00\x00\xdb\x05\x00\x00\x26\x06\x00\x00\x40\x06\x00\x00\x00\x00\x00\x00\xc0\xff\xff\xff\x00\x00\x00\x00\xd3\xff\xff\xff\xd5\xff\xff\xff\xde\xff\xff\xff\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"# + +alex_table :: AlexAddr +alex_table = AlexA# "\x00\x00\x01\x00\x01\x00\x01\x00\x07\x00\x04\x00\x0d\x00\x01\x00\x01\x00\x01\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x0b\x00\x11\x00\x01\x00\x0f\x00\x25\x00\x3f\x00\x0c\x00\x33\x00\x01\x00\x28\x00\x38\x00\x3c\x00\x40\x00\x2c\x00\x3d\x00\x06\x00\x2d\x00\x2e\x00\x08\x00\x09\x00\x09\x00\x34\x00\x09\x00\x34\x00\x34\x00\x34\x00\x09\x00\x34\x00\x3e\x00\x2a\x00\x2f\x00\x35\x00\x10\x00\x39\x00\x3a\x00\x37\x00\x35\x00\x00\x00\x00\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x36\x00\x3b\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x30\x00\x30\x00\x30\x00\x30\x00\x30\x00\x30\x00\x30\x00\x30\x00\x30\x00\x30\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x14\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x1a\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x36\x00\x00\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x02\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x03\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x05\x00\x34\x00\x34\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0a\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x0e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x12\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x15\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x16\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x17\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x13\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x18\x00\x34\x00\x34\x00\x34\x00\x34\x00\x1b\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x19\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x1c\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x27\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x22\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x1f\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1d\x00\x1e\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x20\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x23\x00\x21\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x24\x00\x26\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x29\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x31\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x32\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"# + +alex_check :: AlexAddr +alex_check = AlexA# "\xff\xff\x0b\x00\x0c\x00\x0d\x00\x30\x00\x78\x00\x30\x00\x0b\x00\x0c\x00\x0d\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x78\x00\x30\x00\x20\x00\x78\x00\x20\x00\x23\x00\x24\x00\x25\x00\x20\x00\x58\x00\x28\x00\x29\x00\x2a\x00\x62\x00\x2c\x00\x2d\x00\x61\x00\x64\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x3a\x00\x29\x00\x29\x00\x73\x00\x3e\x00\x62\x00\x61\x00\x29\x00\x73\x00\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x2e\x00\x64\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x20\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\x20\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x20\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x20\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x20\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x28\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x2e\x00\xff\xff\x30\x00\x31\x00\x32\x00\x33\x00\x34\x00\x35\x00\x36\x00\x37\x00\x38\x00\x39\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\x61\x00\x62\x00\x63\x00\x64\x00\x65\x00\x66\x00\x67\x00\x68\x00\x69\x00\x6a\x00\x6b\x00\x6c\x00\x6d\x00\x6e\x00\x6f\x00\x70\x00\x71\x00\x72\x00\x73\x00\x74\x00\x75\x00\x76\x00\x77\x00\x78\x00\x79\x00\x7a\x00\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# + +alex_deflt :: AlexAddr +alex_deflt = AlexA# "\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff\xff"# + +alex_accept = listArray (0::Int,64) [[],[(AlexAccSkip)],[(AlexAcc (alex_action_1))],[(AlexAcc (alex_action_1))],[],[(AlexAcc (alex_action_13))],[],[],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_2))],[(AlexAcc (alex_action_3))],[],[],[],[(AlexAcc (alex_action_4))],[],[],[],[(AlexAcc (alex_action_5))],[],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_6))],[],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_7))],[],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_8))],[],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_9))],[],[],[(AlexAcc (alex_action_13))],[],[],[(AlexAcc (alex_action_10))],[],[],[],[],[(AlexAcc (alex_action_11))],[],[],[(AlexAcc (alex_action_12))],[],[(AlexAcc (alex_action_13))],[(AlexAcc (alex_action_13))],[],[(AlexAcc (alex_action_14))],[(AlexAcc (alex_action_15))],[],[],[],[(AlexAcc (alex_action_16))],[(AlexAcc (alex_action_17))],[(AlexAcc (alex_action_18))],[(AlexAcc (alex_action_19))],[(AlexAcc (alex_action_20))]] +{-# LINE 41 "src/Bindings/Bfd/Disasm/I386/Lex.x" #-} + +data Token = Offset Int + | Constant Int + | Address Int + | PrefixedMnemonic [String] + | Register String + | Mnemonic String + | ParensL + | ParensR + | Comma + | Colon + | Hash + | Star + deriving (Eq, Show) + +offset s = Offset $ read s +constant s = Constant $ read $ tail s +address s = Address $ read $ tail s + +prefixedMnemonic s = PrefixedMnemonic $ words s +mnemonic s = Mnemonic s + +register s = Register $ tail s + +parensL _ = ParensL +parensR _ = ParensR + +comma _ = Comma +colon _ = Colon +hash _ = Hash +star _ = Star + +lexer = alexScanTokens + +alex_action_1 = offset +alex_action_2 = offset +alex_action_3 = constant +alex_action_4 = address +alex_action_5 = prefixedMnemonic +alex_action_6 = prefixedMnemonic +alex_action_7 = prefixedMnemonic +alex_action_8 = prefixedMnemonic +alex_action_9 = prefixedMnemonic +alex_action_10 = prefixedMnemonic +alex_action_11 = register +alex_action_12 = register +alex_action_13 = mnemonic +alex_action_14 = mnemonic +alex_action_15 = parensL +alex_action_16 = parensR +alex_action_17 = comma +alex_action_18 = colon +alex_action_19 = hash +alex_action_20 = star +{-# LINE 1 "templates/GenericTemplate.hs" #-} +{-# LINE 1 "templates/GenericTemplate.hs" #-} +{-# LINE 1 "" #-} +{-# LINE 1 "" #-} +{-# LINE 1 "templates/GenericTemplate.hs" #-} +-- ----------------------------------------------------------------------------- +-- ALEX TEMPLATE +-- +-- This code is in the PUBLIC DOMAIN; you may copy it freely and use +-- it for any purpose whatsoever. + +-- ----------------------------------------------------------------------------- +-- INTERNALS and main scanner engine + +{-# LINE 37 "templates/GenericTemplate.hs" #-} + +{-# LINE 47 "templates/GenericTemplate.hs" #-} + + +data AlexAddr = AlexA# Addr# + +#if __GLASGOW_HASKELL__ < 503 +uncheckedShiftL# = shiftL# +#endif + +{-# INLINE alexIndexInt16OffAddr #-} +alexIndexInt16OffAddr (AlexA# arr) off = +#ifdef WORDS_BIGENDIAN + narrow16Int# i + where + i = word2Int# ((high `uncheckedShiftL#` 8#) `or#` low) + high = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) + low = int2Word# (ord# (indexCharOffAddr# arr off')) + off' = off *# 2# +#else + indexInt16OffAddr# arr off +#endif + + + + + +{-# INLINE alexIndexInt32OffAddr #-} +alexIndexInt32OffAddr (AlexA# arr) off = +#ifdef WORDS_BIGENDIAN + narrow32Int# i + where + i = word2Int# ((b3 `uncheckedShiftL#` 24#) `or#` + (b2 `uncheckedShiftL#` 16#) `or#` + (b1 `uncheckedShiftL#` 8#) `or#` b0) + b3 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 3#))) + b2 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 2#))) + b1 = int2Word# (ord# (indexCharOffAddr# arr (off' +# 1#))) + b0 = int2Word# (ord# (indexCharOffAddr# arr off')) + off' = off *# 4# +#else + indexInt32OffAddr# arr off +#endif + + + + + +#if __GLASGOW_HASKELL__ < 503 +quickIndex arr i = arr ! i +#else +-- GHC >= 503, unsafeAt is available from Data.Array.Base. +quickIndex = unsafeAt +#endif + + + + +-- ----------------------------------------------------------------------------- +-- Main lexing routines + +data AlexReturn a + = AlexEOF + | AlexError !AlexInput + | AlexSkip !AlexInput !Int + | AlexToken !AlexInput !Int a + +-- alexScan :: AlexInput -> StartCode -> AlexReturn a +alexScan input (I# (sc)) + = alexScanUser undefined input (I# (sc)) + +alexScanUser user input (I# (sc)) + = case alex_scan_tkn user input 0# input sc AlexNone of + (AlexNone, input') -> + case alexGetChar input of + Nothing -> + + + + AlexEOF + Just _ -> + + + + AlexError input' + + (AlexLastSkip input'' len, _) -> + + + + AlexSkip input'' len + + (AlexLastAcc k input''' len, _) -> + + + + AlexToken input''' len k + + +-- Push the input through the DFA, remembering the most recent accepting +-- state it encountered. + +alex_scan_tkn user orig_input len input s last_acc = + input `seq` -- strict in the input + let + new_acc = check_accs (alex_accept `quickIndex` (I# (s))) + in + new_acc `seq` + case alexGetChar input of + Nothing -> (new_acc, input) + Just (c, new_input) -> + + + + let + !(base) = alexIndexInt32OffAddr alex_base s + !((I# (ord_c))) = ord c + !(offset) = (base +# ord_c) + !(check) = alexIndexInt16OffAddr alex_check offset + + !(new_s) = if (offset >=# 0#) && (check ==# ord_c) + then alexIndexInt16OffAddr alex_table offset + else alexIndexInt16OffAddr alex_deflt s + in + case new_s of + -1# -> (new_acc, input) + -- on an error, we want to keep the input *before* the + -- character that failed, not after. + _ -> alex_scan_tkn user orig_input (len +# 1#) + new_input new_s new_acc + + where + check_accs [] = last_acc + check_accs (AlexAcc a : _) = AlexLastAcc a input (I# (len)) + check_accs (AlexAccSkip : _) = AlexLastSkip input (I# (len)) + check_accs (AlexAccPred a predx : rest) + | predx user orig_input (I# (len)) input + = AlexLastAcc a input (I# (len)) + check_accs (AlexAccSkipPred predx : rest) + | predx user orig_input (I# (len)) input + = AlexLastSkip input (I# (len)) + check_accs (_ : rest) = check_accs rest + +data AlexLastAcc a + = AlexNone + | AlexLastAcc a !AlexInput !Int + | AlexLastSkip !AlexInput !Int + +data AlexAcc a user + = AlexAcc a + | AlexAccSkip + | AlexAccPred a (AlexAccPred user) + | AlexAccSkipPred (AlexAccPred user) + +type AlexAccPred user = user -> AlexInput -> Int -> AlexInput -> Bool + +-- ----------------------------------------------------------------------------- +-- Predicates on a rule + +alexAndPred p1 p2 user in1 len in2 + = p1 user in1 len in2 && p2 user in1 len in2 + +--alexPrevCharIsPred :: Char -> AlexAccPred _ +alexPrevCharIs c _ input _ _ = c == alexInputPrevChar input + +--alexPrevCharIsOneOfPred :: Array Char Bool -> AlexAccPred _ +alexPrevCharIsOneOf arr _ input _ _ = arr ! alexInputPrevChar input + +--alexRightContext :: Int -> AlexAccPred _ +alexRightContext (I# (sc)) user _ _ input = + case alex_scan_tkn user input 0# input sc AlexNone of + (AlexNone, _) -> False + _ -> True + -- TODO: there's no need to find the longest + -- match when checking the right context, just + -- the first match will do. + +-- used by wrappers +iUnbox (I# (i)) = i diff --git a/dist/build/Bindings/Bfd/Disasm/I386/Parse.hs b/dist/build/Bindings/Bfd/Disasm/I386/Parse.hs new file mode 100644 --- /dev/null +++ b/dist/build/Bindings/Bfd/Disasm/I386/Parse.hs @@ -0,0 +1,765 @@ +{-# OPTIONS_GHC -fno-warn-overlapping-patterns #-} +{-# OPTIONS -fglasgow-exts -cpp #-} +module Bindings.Bfd.Disasm.I386.Parse where + +import Data.Array +import qualified Data.IntMap as IntMap +import qualified Data.Map as Map +import Data.Maybe +import Data.Word + +import Bindings.Bfd.Disasm.I386.Lex as L +import Bindings.Bfd.Disasm.I386.Insn +import Bindings.Bfd.Disasm.I386.Insn.EffectiveAddr +import Bindings.Bfd.Disasm.I386.Insn.Mnemonic as R +import Bindings.Bfd.Disasm.I386.Insn.Operand as O +import Bindings.Bfd.Disasm.I386.Insn.Prefix +import qualified Data.Array as Happy_Data_Array +import qualified GHC.Exts as Happy_GHC_Exts + +-- parser produced by Happy Version 1.18.5 + +newtype HappyAbsSyn = HappyAbsSyn HappyAny +#if __GLASGOW_HASKELL__ >= 607 +type HappyAny = Happy_GHC_Exts.Any +#else +type HappyAny = forall a . a +#endif +happyIn4 :: (Insn) -> (HappyAbsSyn ) +happyIn4 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn4 #-} +happyOut4 :: (HappyAbsSyn ) -> (Insn) +happyOut4 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut4 #-} +happyIn5 :: ([Operand]) -> (HappyAbsSyn ) +happyIn5 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn5 #-} +happyOut5 :: (HappyAbsSyn ) -> ([Operand]) +happyOut5 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut5 #-} +happyIn6 :: (Maybe Int) -> (HappyAbsSyn ) +happyIn6 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn6 #-} +happyOut6 :: (HappyAbsSyn ) -> (Maybe Int) +happyOut6 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut6 #-} +happyIn7 :: (Operand) -> (HappyAbsSyn ) +happyIn7 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn7 #-} +happyOut7 :: (HappyAbsSyn ) -> (Operand) +happyOut7 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut7 #-} +happyIn8 :: (Operand) -> (HappyAbsSyn ) +happyIn8 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn8 #-} +happyOut8 :: (HappyAbsSyn ) -> (Operand) +happyOut8 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut8 #-} +happyIn9 :: (Operand) -> (HappyAbsSyn ) +happyIn9 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn9 #-} +happyOut9 :: (HappyAbsSyn ) -> (Operand) +happyOut9 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut9 #-} +happyIn10 :: (Operand) -> (HappyAbsSyn ) +happyIn10 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn10 #-} +happyOut10 :: (HappyAbsSyn ) -> (Operand) +happyOut10 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut10 #-} +happyIn11 :: (Operand) -> (HappyAbsSyn ) +happyIn11 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn11 #-} +happyOut11 :: (HappyAbsSyn ) -> (Operand) +happyOut11 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut11 #-} +happyIn12 :: (Operand) -> (HappyAbsSyn ) +happyIn12 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn12 #-} +happyOut12 :: (HappyAbsSyn ) -> (Operand) +happyOut12 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut12 #-} +happyIn13 :: ((EffectiveAddr, Maybe Int)) -> (HappyAbsSyn ) +happyIn13 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn13 #-} +happyOut13 :: (HappyAbsSyn ) -> ((EffectiveAddr, Maybe Int)) +happyOut13 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut13 #-} +happyIn14 :: (EffectiveAddr) -> (HappyAbsSyn ) +happyIn14 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyIn14 #-} +happyOut14 :: (HappyAbsSyn ) -> (EffectiveAddr) +happyOut14 x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOut14 #-} +happyInTok :: (Token) -> (HappyAbsSyn ) +happyInTok x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyInTok #-} +happyOutTok :: (HappyAbsSyn ) -> (Token) +happyOutTok x = Happy_GHC_Exts.unsafeCoerce# x +{-# INLINE happyOutTok #-} + + +happyActOffsets :: HappyAddr +happyActOffsets = HappyA# "\x3f\x00\x59\x00\x01\x00\x55\x00\x01\x00\x00\x00\x00\x00\x57\x00\x56\x00\x00\x00\x31\x00\x53\x00\x00\x00\x00\x00\x4f\x00\x00\x00\x00\x00\x52\x00\x26\x00\x23\x00\x00\x00\x00\x00\x00\x00\x39\x00\x54\x00\x2a\x00\x00\x00\x00\x00\x51\x00\x00\x00\x21\x00\x04\x00\x21\x00\x50\x00\x2c\x00\x00\x00\x00\x00\x4d\x00\x4d\x00\x00\x00\x00\x00\x00\x00\x4c\x00\x00\x00\x4b\x00\x49\x00\x4e\x00\x00\x00\x00\x00\x00\x00\x48\x00\x48\x00\x00\x00\x00\x00\x41\x00\x45\x00\x4a\x00\x42\x00\x00\x00\x00\x00\x00\x00\x00\x00"# + +happyGotoOffsets :: HappyAddr +happyGotoOffsets = HappyA# "\x3b\x00\x00\x00\x15\x00\x00\x00\x0b\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x47\x00\x46\x00\x00\x00\x00\x00\x3d\x00\x00\x00\x00\x00\x00\x00\x00\x00\x36\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x34\x00\x00\x00\x00\x00\x00\x00\x00\x00\x2f\x00\x1c\x00\x29\x00\x00\x00\x44\x00\x00\x00\x00\x00\x43\x00\x07\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x28\x00\x12\x00\x00\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00"# + +happyDefActions :: HappyAddr +happyDefActions = HappyA# "\x00\x00\x00\x00\xfc\xff\x00\x00\xfc\xff\xfd\xff\xfb\xff\xfa\xff\xf9\xff\xf8\xff\xec\xff\xec\xff\xe6\xff\xe2\xff\xe1\xff\xe9\xff\xea\xff\xe8\xff\x00\x00\x00\x00\xfe\xff\xe4\xff\xe7\xff\x00\x00\x00\x00\x00\x00\xe3\xff\xf6\xff\x00\x00\xf7\xff\x00\x00\x00\x00\x00\x00\xf0\xff\xec\xff\xf3\xff\xf5\xff\xec\xff\xec\xff\xf1\xff\xeb\xff\xe5\xff\x00\x00\xe0\xff\x00\x00\x00\x00\x00\x00\xf2\xff\xf4\xff\xef\xff\x00\x00\x00\x00\xee\xff\xe8\xff\xec\xff\x00\x00\x00\x00\x00\x00\xdf\xff\xed\xff\xde\xff"# + +happyCheck :: HappyAddr +happyCheck = HappyA# "\xff\xff\x02\x00\x01\x00\x02\x00\x03\x00\x01\x00\x02\x00\x06\x00\x07\x00\x02\x00\x06\x00\x07\x00\x01\x00\x0c\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x01\x00\x05\x00\x03\x00\x04\x00\x05\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x04\x00\x05\x00\x01\x00\x07\x00\x01\x00\x09\x00\x0a\x00\x06\x00\x07\x00\x06\x00\x07\x00\x01\x00\x06\x00\x05\x00\x05\x00\x09\x00\x07\x00\x07\x00\x09\x00\x0a\x00\x05\x00\x09\x00\x07\x00\x0b\x00\x09\x00\x0a\x00\x09\x00\x00\x00\x0b\x00\x09\x00\x0a\x00\x09\x00\x0a\x00\x08\x00\x09\x00\x04\x00\x05\x00\x02\x00\x02\x00\x0a\x00\x02\x00\x02\x00\x08\x00\x01\x00\x0b\x00\x08\x00\x06\x00\x01\x00\xff\xff\x06\x00\x09\x00\xff\xff\x03\x00\x09\x00\x07\x00\xff\xff\x0b\x00\x09\x00\x06\x00\xff\xff\x0a\x00\x04\x00\x0b\x00\x09\x00\x09\x00\xff\xff\x0d\x00\xff\xff\xff\xff\xff\xff\xff\xff"# + +happyTable :: HappyAddr +happyTable = HappyA# "\x00\x00\x3b\x00\x0f\x00\x10\x00\x11\x00\x0f\x00\x10\x00\x12\x00\x13\x00\x2f\x00\x12\x00\x13\x00\x05\x00\x14\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x14\x00\x34\x00\x06\x00\x07\x00\x08\x00\x09\x00\x0a\x00\x0b\x00\x0c\x00\x0d\x00\x23\x00\x24\x00\x0f\x00\x25\x00\x0f\x00\x0c\x00\x0d\x00\x12\x00\x13\x00\x17\x00\x13\x00\x0f\x00\x18\x00\x36\x00\x21\x00\x19\x00\x22\x00\x13\x00\x0c\x00\x0d\x00\x26\x00\x33\x00\x27\x00\x1d\x00\x0c\x00\x0d\x00\x1f\x00\x03\x00\x1d\x00\x29\x00\x0d\x00\x15\x00\x0d\x00\x2c\x00\x2d\x00\x03\x00\x05\x00\x30\x00\x31\x00\x1a\x00\x1b\x00\x1d\x00\x3d\x00\x3a\x00\x1d\x00\x3b\x00\x36\x00\x38\x00\x00\x00\x2e\x00\x39\x00\x00\x00\x29\x00\x2f\x00\x13\x00\x00\x00\x1d\x00\x34\x00\x2b\x00\x00\x00\x1a\x00\x03\x00\x1d\x00\x20\x00\x21\x00\x00\x00\xff\xff\x00\x00\x00\x00\x00\x00\x00\x00"# + +happyReduceArr = Happy_Data_Array.array (1, 33) [ + (1 , happyReduce_1), + (2 , happyReduce_2), + (3 , happyReduce_3), + (4 , happyReduce_4), + (5 , happyReduce_5), + (6 , happyReduce_6), + (7 , happyReduce_7), + (8 , happyReduce_8), + (9 , happyReduce_9), + (10 , happyReduce_10), + (11 , happyReduce_11), + (12 , happyReduce_12), + (13 , happyReduce_13), + (14 , happyReduce_14), + (15 , happyReduce_15), + (16 , happyReduce_16), + (17 , happyReduce_17), + (18 , happyReduce_18), + (19 , happyReduce_19), + (20 , happyReduce_20), + (21 , happyReduce_21), + (22 , happyReduce_22), + (23 , happyReduce_23), + (24 , happyReduce_24), + (25 , happyReduce_25), + (26 , happyReduce_26), + (27 , happyReduce_27), + (28 , happyReduce_28), + (29 , happyReduce_29), + (30 , happyReduce_30), + (31 , happyReduce_31), + (32 , happyReduce_32), + (33 , happyReduce_33) + ] + +happy_n_terms = 14 :: Int +happy_n_nonterms = 11 :: Int + +happyReduce_1 = happySpecReduce_2 0# happyReduction_1 +happyReduction_1 happy_x_2 + happy_x_1 + = case happyOutTok happy_x_1 of { (PrefixedMnemonic happy_var_1) -> + case happyOut5 happy_x_2 of { happy_var_2 -> + happyIn4 + (Insn (Prefix $ head happy_var_1) (R.Mnemonic $ head $ tail happy_var_1) happy_var_2 + )}} + +happyReduce_2 = happySpecReduce_2 0# happyReduction_2 +happyReduction_2 happy_x_2 + happy_x_1 + = case happyOutTok happy_x_1 of { (L.Mnemonic happy_var_1) -> + case happyOut5 happy_x_2 of { happy_var_2 -> + happyIn4 + (Insn (Prefix "" ) (R.Mnemonic happy_var_1) happy_var_2 + )}} + +happyReduce_3 = happySpecReduce_0 1# happyReduction_3 +happyReduction_3 = happyIn5 + ([ ] + ) + +happyReduce_4 = happySpecReduce_1 1# happyReduction_4 +happyReduction_4 happy_x_1 + = case happyOut7 happy_x_1 of { happy_var_1 -> + happyIn5 + ([happy_var_1 ] + )} + +happyReduce_5 = happySpecReduce_1 1# happyReduction_5 +happyReduction_5 happy_x_1 + = case happyOut8 happy_x_1 of { happy_var_1 -> + happyIn5 + ([happy_var_1 ] + )} + +happyReduce_6 = happySpecReduce_1 1# happyReduction_6 +happyReduction_6 happy_x_1 + = case happyOut9 happy_x_1 of { happy_var_1 -> + happyIn5 + ([happy_var_1 ] + )} + +happyReduce_7 = happySpecReduce_1 1# happyReduction_7 +happyReduction_7 happy_x_1 + = case happyOut10 happy_x_1 of { happy_var_1 -> + happyIn5 + ([happy_var_1 ] + )} + +happyReduce_8 = happySpecReduce_2 1# happyReduction_8 +happyReduction_8 happy_x_2 + happy_x_1 + = case happyOut11 happy_x_1 of { happy_var_1 -> + case happyOut6 happy_x_2 of { happy_var_2 -> + happyIn5 + ([happy_var_1 { O.address = happy_var_2 } ] + )}} + +happyReduce_9 = happySpecReduce_2 1# happyReduction_9 +happyReduction_9 happy_x_2 + happy_x_1 + = case happyOut12 happy_x_1 of { happy_var_1 -> + case happyOut6 happy_x_2 of { happy_var_2 -> + happyIn5 + ([happy_var_1 { O.address = happy_var_2 } ] + )}} + +happyReduce_10 = happySpecReduce_3 1# happyReduction_10 +happyReduction_10 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut9 happy_x_1 of { happy_var_1 -> + case happyOut9 happy_x_3 of { happy_var_3 -> + happyIn5 + ([happy_var_1 , happy_var_3 ] + )}} + +happyReduce_11 = happyReduce 4# 1# happyReduction_11 +happyReduction_11 (happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut9 happy_x_1 of { happy_var_1 -> + case happyOut11 happy_x_3 of { happy_var_3 -> + case happyOut6 happy_x_4 of { happy_var_4 -> + happyIn5 + ([happy_var_1 , happy_var_3 { O.address = happy_var_4 } ] + ) `HappyStk` happyRest}}} + +happyReduce_12 = happySpecReduce_3 1# happyReduction_12 +happyReduction_12 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut9 happy_x_1 of { happy_var_1 -> + case happyOut8 happy_x_3 of { happy_var_3 -> + happyIn5 + ([happy_var_1 , happy_var_3 ] + )}} + +happyReduce_13 = happyReduce 4# 1# happyReduction_13 +happyReduction_13 (happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut11 happy_x_1 of { happy_var_1 -> + case happyOut9 happy_x_3 of { happy_var_3 -> + case happyOut6 happy_x_4 of { happy_var_4 -> + happyIn5 + ([happy_var_1 { O.address = happy_var_4 }, happy_var_3 ] + ) `HappyStk` happyRest}}} + +happyReduce_14 = happySpecReduce_3 1# happyReduction_14 +happyReduction_14 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut11 happy_x_1 of { happy_var_1 -> + case happyOut11 happy_x_3 of { happy_var_3 -> + happyIn5 + ([happy_var_1 , happy_var_3 ] + )}} + +happyReduce_15 = happySpecReduce_3 1# happyReduction_15 +happyReduction_15 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOut8 happy_x_1 of { happy_var_1 -> + case happyOut9 happy_x_3 of { happy_var_3 -> + happyIn5 + ([happy_var_1 , happy_var_3 ] + )}} + +happyReduce_16 = happyReduce 4# 1# happyReduction_16 +happyReduction_16 (happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut8 happy_x_1 of { happy_var_1 -> + case happyOut11 happy_x_3 of { happy_var_3 -> + case happyOut6 happy_x_4 of { happy_var_4 -> + happyIn5 + ([happy_var_1 , happy_var_3 { O.address = happy_var_4 } ] + ) `HappyStk` happyRest}}} + +happyReduce_17 = happyReduce 5# 1# happyReduction_17 +happyReduction_17 (happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut8 happy_x_1 of { happy_var_1 -> + case happyOut9 happy_x_3 of { happy_var_3 -> + case happyOut9 happy_x_5 of { happy_var_5 -> + happyIn5 + ([happy_var_1 , happy_var_3 , happy_var_5] + ) `HappyStk` happyRest}}} + +happyReduce_18 = happyReduce 6# 1# happyReduction_18 +happyReduction_18 (happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOut8 happy_x_1 of { happy_var_1 -> + case happyOut11 happy_x_3 of { happy_var_3 -> + case happyOut9 happy_x_5 of { happy_var_5 -> + happyIn5 + ([happy_var_1 , happy_var_3 , happy_var_5] + ) `HappyStk` happyRest}}} + +happyReduce_19 = happySpecReduce_0 2# happyReduction_19 +happyReduction_19 = happyIn6 + (Nothing + ) + +happyReduce_20 = happySpecReduce_2 2# happyReduction_20 +happyReduction_20 happy_x_2 + happy_x_1 + = case happyOutTok happy_x_2 of { (Address happy_var_2) -> + happyIn6 + (Just happy_var_2 + )} + +happyReduce_21 = happySpecReduce_1 3# happyReduction_21 +happyReduction_21 happy_x_1 + = case happyOutTok happy_x_1 of { (Address happy_var_1) -> + happyIn7 + (Abs happy_var_1 + )} + +happyReduce_22 = happySpecReduce_1 4# happyReduction_22 +happyReduction_22 happy_x_1 + = case happyOutTok happy_x_1 of { (Constant happy_var_1) -> + happyIn8 + (Imm happy_var_1 + )} + +happyReduce_23 = happySpecReduce_1 5# happyReduction_23 +happyReduction_23 happy_x_1 + = case happyOutTok happy_x_1 of { (Register happy_var_1) -> + happyIn9 + (DirD happy_var_1 + )} + +happyReduce_24 = happySpecReduce_2 6# happyReduction_24 +happyReduction_24 happy_x_2 + happy_x_1 + = case happyOutTok happy_x_2 of { (Register happy_var_2) -> + happyIn10 + (DirJ happy_var_2 + )} + +happyReduce_25 = happySpecReduce_1 7# happyReduction_25 +happyReduction_25 happy_x_1 + = case happyOut13 happy_x_1 of { happy_var_1 -> + happyIn11 + (IndD "" (fst happy_var_1) (snd happy_var_1) Nothing + )} + +happyReduce_26 = happySpecReduce_3 7# happyReduction_26 +happyReduction_26 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOutTok happy_x_1 of { (Register happy_var_1) -> + case happyOut13 happy_x_3 of { happy_var_3 -> + happyIn11 + (IndD happy_var_1 (fst happy_var_3) (snd happy_var_3) Nothing + )}} + +happyReduce_27 = happySpecReduce_2 8# happyReduction_27 +happyReduction_27 happy_x_2 + happy_x_1 + = case happyOut13 happy_x_2 of { happy_var_2 -> + happyIn12 + (IndJ (fst happy_var_2) (snd happy_var_2) Nothing + )} + +happyReduce_28 = happySpecReduce_2 9# happyReduction_28 +happyReduction_28 happy_x_2 + happy_x_1 + = case happyOutTok happy_x_1 of { (Offset happy_var_1) -> + case happyOut14 happy_x_2 of { happy_var_2 -> + happyIn13 + ((happy_var_2 , Just happy_var_1) + )}} + +happyReduce_29 = happySpecReduce_1 9# happyReduction_29 +happyReduction_29 happy_x_1 + = case happyOut14 happy_x_1 of { happy_var_1 -> + happyIn13 + ((happy_var_1 , Nothing) + )} + +happyReduce_30 = happySpecReduce_1 9# happyReduction_30 +happyReduction_30 happy_x_1 + = case happyOutTok happy_x_1 of { (Offset happy_var_1) -> + happyIn13 + ((NoEA, Just happy_var_1) + )} + +happyReduce_31 = happySpecReduce_3 10# happyReduction_31 +happyReduction_31 happy_x_3 + happy_x_2 + happy_x_1 + = case happyOutTok happy_x_2 of { (Register happy_var_2) -> + happyIn14 + (EA happy_var_2 "" 1 + )} + +happyReduce_32 = happyReduce 6# 10# happyReduction_32 +happyReduction_32 (happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOutTok happy_x_3 of { (Register happy_var_3) -> + case happyOutTok happy_x_5 of { (Offset happy_var_5) -> + happyIn14 + (EA "" happy_var_3 happy_var_5 + ) `HappyStk` happyRest}} + +happyReduce_33 = happyReduce 7# 10# happyReduction_33 +happyReduction_33 (happy_x_7 `HappyStk` + happy_x_6 `HappyStk` + happy_x_5 `HappyStk` + happy_x_4 `HappyStk` + happy_x_3 `HappyStk` + happy_x_2 `HappyStk` + happy_x_1 `HappyStk` + happyRest) + = case happyOutTok happy_x_2 of { (Register happy_var_2) -> + case happyOutTok happy_x_4 of { (Register happy_var_4) -> + case happyOutTok happy_x_6 of { (Offset happy_var_6) -> + happyIn14 + (EA happy_var_2 happy_var_4 happy_var_6 + ) `HappyStk` happyRest}}} + +happyNewToken action sts stk [] = + happyDoAction 13# notHappyAtAll action sts stk [] + +happyNewToken action sts stk (tk:tks) = + let cont i = happyDoAction i tk action sts stk tks in + case tk of { + Offset happy_dollar_dollar -> cont 1#; + Constant happy_dollar_dollar -> cont 2#; + Address happy_dollar_dollar -> cont 3#; + PrefixedMnemonic happy_dollar_dollar -> cont 4#; + L.Mnemonic happy_dollar_dollar -> cont 5#; + Register happy_dollar_dollar -> cont 6#; + ParensL -> cont 7#; + ParensR -> cont 8#; + Comma -> cont 9#; + Colon -> cont 10#; + Hash -> cont 11#; + Star -> cont 12#; + _ -> happyError' (tk:tks) + } + +happyError_ tk tks = happyError' (tk:tks) + +newtype HappyIdentity a = HappyIdentity a +happyIdentity = HappyIdentity +happyRunIdentity (HappyIdentity a) = a + +instance Monad HappyIdentity where + return = HappyIdentity + (HappyIdentity p) >>= q = q p + +happyThen :: () => HappyIdentity a -> (a -> HappyIdentity b) -> HappyIdentity b +happyThen = (>>=) +happyReturn :: () => a -> HappyIdentity a +happyReturn = (return) +happyThen1 m k tks = (>>=) m (\a -> k a tks) +happyReturn1 :: () => a -> b -> HappyIdentity a +happyReturn1 = \a tks -> (return) a +happyError' :: () => [(Token)] -> HappyIdentity a +happyError' = HappyIdentity . happyError + +parse tks = happyRunIdentity happySomeParser where + happySomeParser = happyThen (happyParse 0# tks) (\x -> happyReturn (happyOut4 x)) + +happySeq = happyDontSeq + + +happyError :: [Token] -> a +happyError tks = error $ "Parse.y: parse error at: " ++ (show $ take 10 tks) +{-# LINE 1 "templates/GenericTemplate.hs" #-} +{-# LINE 1 "templates/GenericTemplate.hs" #-} +{-# LINE 1 "" #-} +{-# LINE 1 "" #-} +{-# LINE 1 "templates/GenericTemplate.hs" #-} +-- Id: GenericTemplate.hs,v 1.26 2005/01/14 14:47:22 simonmar Exp + +{-# LINE 30 "templates/GenericTemplate.hs" #-} + + +data Happy_IntList = HappyCons Happy_GHC_Exts.Int# Happy_IntList + + + + + +{-# LINE 51 "templates/GenericTemplate.hs" #-} + +{-# LINE 61 "templates/GenericTemplate.hs" #-} + +{-# LINE 70 "templates/GenericTemplate.hs" #-} + +infixr 9 `HappyStk` +data HappyStk a = HappyStk a (HappyStk a) + +----------------------------------------------------------------------------- +-- starting the parse + +happyParse start_state = happyNewToken start_state notHappyAtAll notHappyAtAll + +----------------------------------------------------------------------------- +-- Accepting the parse + +-- If the current token is 0#, it means we've just accepted a partial +-- parse (a %partial parser). We must ignore the saved token on the top of +-- the stack in this case. +happyAccept 0# tk st sts (_ `HappyStk` ans `HappyStk` _) = + happyReturn1 ans +happyAccept j tk st sts (HappyStk ans _) = + (happyTcHack j (happyTcHack st)) (happyReturn1 ans) + +----------------------------------------------------------------------------- +-- Arrays only: do the next action + + + +happyDoAction i tk st + = {- nothing -} + + + case action of + 0# -> {- nothing -} + happyFail i tk st + -1# -> {- nothing -} + happyAccept i tk st + n | (n Happy_GHC_Exts.<# (0# :: Happy_GHC_Exts.Int#)) -> {- nothing -} + + (happyReduceArr Happy_Data_Array.! rule) i tk st + where rule = (Happy_GHC_Exts.I# ((Happy_GHC_Exts.negateInt# ((n Happy_GHC_Exts.+# (1# :: Happy_GHC_Exts.Int#)))))) + n -> {- nothing -} + + + happyShift new_state i tk st + where !(new_state) = (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) + where !(off) = indexShortOffAddr happyActOffsets st + !(off_i) = (off Happy_GHC_Exts.+# i) + check = if (off_i Happy_GHC_Exts.>=# (0# :: Happy_GHC_Exts.Int#)) + then (indexShortOffAddr happyCheck off_i Happy_GHC_Exts.==# i) + else False + !(action) + | check = indexShortOffAddr happyTable off_i + | otherwise = indexShortOffAddr happyDefActions st + +{-# LINE 130 "templates/GenericTemplate.hs" #-} + + +indexShortOffAddr (HappyA# arr) off = + Happy_GHC_Exts.narrow16Int# i + where + !i = Happy_GHC_Exts.word2Int# (Happy_GHC_Exts.or# (Happy_GHC_Exts.uncheckedShiftL# high 8#) low) + !high = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr (off' Happy_GHC_Exts.+# 1#))) + !low = Happy_GHC_Exts.int2Word# (Happy_GHC_Exts.ord# (Happy_GHC_Exts.indexCharOffAddr# arr off')) + !off' = off Happy_GHC_Exts.*# 2# + + + + + +data HappyAddr = HappyA# Happy_GHC_Exts.Addr# + + + + +----------------------------------------------------------------------------- +-- HappyState data type (not arrays) + +{-# LINE 163 "templates/GenericTemplate.hs" #-} + +----------------------------------------------------------------------------- +-- Shifting a token + +happyShift new_state 0# tk st sts stk@(x `HappyStk` _) = + let !(i) = (case Happy_GHC_Exts.unsafeCoerce# x of { (Happy_GHC_Exts.I# (i)) -> i }) in +-- trace "shifting the error token" $ + happyDoAction i tk new_state (HappyCons (st) (sts)) (stk) + +happyShift new_state i tk st sts stk = + happyNewToken new_state (HappyCons (st) (sts)) ((happyInTok (tk))`HappyStk`stk) + +-- happyReduce is specialised for the common cases. + +happySpecReduce_0 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_0 nt fn j tk st@((action)) sts stk + = happyGoto nt j tk st (HappyCons (st) (sts)) (fn `HappyStk` stk) + +happySpecReduce_1 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_1 nt fn j tk _ sts@((HappyCons (st@(action)) (_))) (v1`HappyStk`stk') + = let r = fn v1 in + happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk')) + +happySpecReduce_2 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_2 nt fn j tk _ (HappyCons (_) (sts@((HappyCons (st@(action)) (_))))) (v1`HappyStk`v2`HappyStk`stk') + = let r = fn v1 v2 in + happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk')) + +happySpecReduce_3 i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happySpecReduce_3 nt fn j tk _ (HappyCons (_) ((HappyCons (_) (sts@((HappyCons (st@(action)) (_))))))) (v1`HappyStk`v2`HappyStk`v3`HappyStk`stk') + = let r = fn v1 v2 v3 in + happySeq r (happyGoto nt j tk st sts (r `HappyStk` stk')) + +happyReduce k i fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happyReduce k nt fn j tk st sts stk + = case happyDrop (k Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) sts of + sts1@((HappyCons (st1@(action)) (_))) -> + let r = fn stk in -- it doesn't hurt to always seq here... + happyDoSeq r (happyGoto nt j tk st1 sts1 r) + +happyMonadReduce k nt fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happyMonadReduce k nt fn j tk st sts stk = + happyThen1 (fn stk tk) (\r -> happyGoto nt j tk st1 sts1 (r `HappyStk` drop_stk)) + where !(sts1@((HappyCons (st1@(action)) (_)))) = happyDrop k (HappyCons (st) (sts)) + drop_stk = happyDropStk k stk + +happyMonad2Reduce k nt fn 0# tk st sts stk + = happyFail 0# tk st sts stk +happyMonad2Reduce k nt fn j tk st sts stk = + happyThen1 (fn stk tk) (\r -> happyNewToken new_state sts1 (r `HappyStk` drop_stk)) + where !(sts1@((HappyCons (st1@(action)) (_)))) = happyDrop k (HappyCons (st) (sts)) + drop_stk = happyDropStk k stk + + !(off) = indexShortOffAddr happyGotoOffsets st1 + !(off_i) = (off Happy_GHC_Exts.+# nt) + !(new_state) = indexShortOffAddr happyTable off_i + + + + +happyDrop 0# l = l +happyDrop n (HappyCons (_) (t)) = happyDrop (n Happy_GHC_Exts.-# (1# :: Happy_GHC_Exts.Int#)) t + +happyDropStk 0# l = l +happyDropStk n (x `HappyStk` xs) = happyDropStk (n Happy_GHC_Exts.-# (1#::Happy_GHC_Exts.Int#)) xs + +----------------------------------------------------------------------------- +-- Moving to a new state after a reduction + + +happyGoto nt j tk st = + {- nothing -} + happyDoAction j tk new_state + where !(off) = indexShortOffAddr happyGotoOffsets st + !(off_i) = (off Happy_GHC_Exts.+# nt) + !(new_state) = indexShortOffAddr happyTable off_i + + + + +----------------------------------------------------------------------------- +-- Error recovery (0# is the error token) + +-- parse error if we are in recovery and we fail again +happyFail 0# tk old_st _ stk = +-- trace "failing" $ + happyError_ tk + +{- We don't need state discarding for our restricted implementation of + "error". In fact, it can cause some bogus parses, so I've disabled it + for now --SDM + +-- discard a state +happyFail 0# tk old_st (HappyCons ((action)) (sts)) + (saved_tok `HappyStk` _ `HappyStk` stk) = +-- trace ("discarding state, depth " ++ show (length stk)) $ + happyDoAction 0# tk action sts ((saved_tok`HappyStk`stk)) +-} + +-- Enter error recovery: generate an error token, +-- save the old token and carry on. +happyFail i tk (action) sts stk = +-- trace "entering error recovery" $ + happyDoAction 0# tk action sts ( (Happy_GHC_Exts.unsafeCoerce# (Happy_GHC_Exts.I# (i))) `HappyStk` stk) + +-- Internal happy errors: + +notHappyAtAll = error "Internal Happy error\n" + +----------------------------------------------------------------------------- +-- Hack to get the typechecker to accept our action functions + + +happyTcHack :: Happy_GHC_Exts.Int# -> a -> a +happyTcHack x y = y +{-# INLINE happyTcHack #-} + + +----------------------------------------------------------------------------- +-- Seq-ing. If the --strict flag is given, then Happy emits +-- happySeq = happyDoSeq +-- otherwise it emits +-- happySeq = happyDontSeq + +happyDoSeq, happyDontSeq :: a -> b -> b +happyDoSeq a b = a `seq` b +happyDontSeq a b = b + +----------------------------------------------------------------------------- +-- Don't inline any functions from the template. GHC has a nasty habit +-- of deciding to inline happyGoto everywhere, which increases the size of +-- the generated parser quite a bit. + + +{-# NOINLINE happyDoAction #-} +{-# NOINLINE happyTable #-} +{-# NOINLINE happyCheck #-} +{-# NOINLINE happyActOffsets #-} +{-# NOINLINE happyGotoOffsets #-} +{-# NOINLINE happyDefActions #-} + +{-# NOINLINE happyShift #-} +{-# NOINLINE happySpecReduce_0 #-} +{-# NOINLINE happySpecReduce_1 #-} +{-# NOINLINE happySpecReduce_2 #-} +{-# NOINLINE happySpecReduce_3 #-} +{-# NOINLINE happyReduce #-} +{-# NOINLINE happyMonadReduce #-} +{-# NOINLINE happyGoto #-} +{-# NOINLINE happyFail #-} + +-- end of Happy Template. diff --git a/src/Bindings/Bfd.hsc b/src/Bindings/Bfd.hsc --- a/src/Bindings/Bfd.hsc +++ b/src/Bindings/Bfd.hsc @@ -32,7 +32,7 @@ -- ** Foo , Bindings.Bfd.getByteorder , Bindings.Bfd.getHeaderByteorder - , getDisassembler + , getDisasm , getFilename , Bindings.Bfd.getFlags , Bindings.Bfd.getObjectFlags @@ -78,7 +78,7 @@ import Prelude hiding (catch, init) -import Bindings.Bfd.Disassembler +import Bindings.Bfd.Disasm import Bindings.Bfd.Endian import Bindings.Bfd.Exception import Bindings.Bfd.Flags as BfdFlags @@ -235,10 +235,10 @@ xvec <- getTarget bfd Target.getHeaderByteorder xvec -getDisassembler +getDisasm :: Bfd - -> IO Disassembler -getDisassembler = c_disassembler + -> IO Disasm +getDisasm = c_disassembler getFilename :: Bfd @@ -546,5 +546,5 @@ foreign import ccall unsafe "dis-asm.h disassembler" c_disassembler :: Bfd - -> IO Disassembler + -> IO Disasm diff --git a/src/Bindings/Bfd/Disasm.hs b/src/Bindings/Bfd/Disasm.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm.hs @@ -0,0 +1,52 @@ +-- This file is part of Bindings-bfd. +-- +-- Copyright (C) 2010 Michael Nelson +-- +-- Bindings-bfd is free software: you can redistribute it and/or modify +-- it under the terms of the GNU Lesser General Public License as published by +-- the Free Software Foundation, either version 3 of the License, or +-- (at your option) any later version. +-- +-- Bindings-bfd is distributed in the hope that it will be useful, +-- but WITHOUT ANY WARRANTY; without even the implied warranty of +-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +-- GNU Lesser General Public License for more details. + +-- You should have received a copy of the GNU Lesser General Public License +-- along with Bindings-bfd. If not, see . + +module Bindings.Bfd.Disasm where + +import Foreign.C +import Foreign.Ptr + +import System.Posix.IO + +import Bindings.Bfd.Disasm.Info +import Bindings.Bfd.Misc + + +type Disasm = FunPtr Disasm' + +type Disasm' = Vma' -> Info0 -> IO CInt + + +run + :: (Integral a) + => Disasm + -> Info + -> a + -> IO (String, Int) +run disasm (Info info fd) vma = + do + let + vma' = fromIntegral vma + f = d_run disasm vma' info + + len <- f + (str,_) <- fdRead fd 80 -- arbitrarily longer than any possible assembler expression (we hope) + + return (str, fromIntegral len :: Int) + +foreign import ccall unsafe "dynamic" d_run + :: Disasm -> Disasm' diff --git a/src/Bindings/Bfd/Disasm/I386/Insn.hs b/src/Bindings/Bfd/Disasm/I386/Insn.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Insn.hs @@ -0,0 +1,14 @@ +module Bindings.Bfd.Disasm.I386.Insn where + +import Bindings.Bfd.Disasm.I386.Insn.Mnemonic +import Bindings.Bfd.Disasm.I386.Insn.Operand +import Bindings.Bfd.Disasm.I386.Insn.Prefix + + +data Insn = Insn { + prefix :: Prefix + , mnemonic :: Mnemonic + , operands :: [Operand] + } + | NoInsn + deriving (Show) diff --git a/src/Bindings/Bfd/Disasm/I386/Insn/EffectiveAddr.hs b/src/Bindings/Bfd/Disasm/I386/Insn/EffectiveAddr.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Insn/EffectiveAddr.hs @@ -0,0 +1,10 @@ +module Bindings.Bfd.Disasm.I386.Insn.EffectiveAddr where + + +data EffectiveAddr = EA { + base :: String + , index :: String + , scale :: Int + } + | NoEA + deriving (Eq, Ord, Show) diff --git a/src/Bindings/Bfd/Disasm/I386/Insn/Length.hs b/src/Bindings/Bfd/Disasm/I386/Insn/Length.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Insn/Length.hs @@ -0,0 +1,5 @@ +module Bindings.Bfd.Disasm.I386.Insn.Length where + + +data Length = Length Int + | Unavailable diff --git a/src/Bindings/Bfd/Disasm/I386/Insn/Mnemonic.hs b/src/Bindings/Bfd/Disasm/I386/Insn/Mnemonic.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Insn/Mnemonic.hs @@ -0,0 +1,33 @@ +module Bindings.Bfd.Disasm.I386.Insn.Mnemonic where + +import Data.List + + +newtype Mnemonic = Mnemonic String + deriving (Show) + +un + :: Mnemonic + -> String +un (Mnemonic s) = s + + +isCall + :: Mnemonic + -> Bool +isCall m = isPrefixOf "call" $ un m + +isJump + :: Mnemonic + -> Bool +isJump m = isPrefixOf "jmp" $ un m + +isBranch + :: Mnemonic + -> Bool +isBranch m = ((isPrefixOf "j" $ un m) && (not $ isPrefixOf "jmp" $ un m)) || (isPrefixOf "loop" $ un m) + +isReturn + :: Mnemonic + -> Bool +isReturn m = isPrefixOf "ret" $ un m diff --git a/src/Bindings/Bfd/Disasm/I386/Insn/Operand.hs b/src/Bindings/Bfd/Disasm/I386/Insn/Operand.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Insn/Operand.hs @@ -0,0 +1,57 @@ +module Bindings.Bfd.Disasm.I386.Insn.Operand where + +import Bindings.Bfd.Disasm.I386.Insn.EffectiveAddr + + +data Operand = Imm { + immed :: Int + } + | IndD { + section :: String + , effAddr :: EffectiveAddr + , displacement :: Maybe Int + , address :: Maybe Int + } + | IndJ { + effAddr :: EffectiveAddr + , displacement :: Maybe Int + , address :: Maybe Int + } + | DirD { + direct :: String + } + | DirJ { + direct :: String + } + | Abs { + absolute :: Int + } + -- the following constructors are created by canonicalizing the above + | ImmSym { + symbolIndex :: Int + } + | IndDSym { + effAddr :: EffectiveAddr + , symbolIndex :: Int + , addend :: Int + } + | IndJSym { + effAddr :: EffectiveAddr + , symbolIndex :: Int + , addend :: Int + } + | AbsSymT { + symbolIndex :: Int + } + | AbsSymL { + symbol :: String + } + deriving (Eq, Ord, Show) + + +isAbs + :: Operand + -> Bool +isAbs (Abs _) = True +isAbs _ = False + diff --git a/src/Bindings/Bfd/Disasm/I386/Insn/Prefix.hs b/src/Bindings/Bfd/Disasm/I386/Insn/Prefix.hs new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Insn/Prefix.hs @@ -0,0 +1,11 @@ +module Bindings.Bfd.Disasm.I386.Insn.Prefix where + + +newtype Prefix = Prefix String + deriving (Show) + + +un + :: Prefix + -> String +un (Prefix s) = s diff --git a/src/Bindings/Bfd/Disasm/I386/Lex.x b/src/Bindings/Bfd/Disasm/I386/Lex.x new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Lex.x @@ -0,0 +1,74 @@ +{ +module Bindings.Bfd.Disasm.I386.Lex ( + Token(..) + , lexer +) where + +import System.IO +} + +%wrapper "basic" + +$whitestuff = [\ \f\v\r] +$decdigit = [0-9] +$hexdigit = [0-9 a-f] +$scale = [1 2 4 8] +$alphanum = [a-z 0-9] + +tokens :- + $whitestuff+ ; + "-"{0,1}"0x"$hexdigit+ { offset } + $scale { offset } + "$0x"$hexdigit+ { constant } + ">0x"$hexdigit+ { address } + "lock "$alphanum+ { prefixedMnemonic } + "rep "$alphanum+ { prefixedMnemonic } + "repz "$alphanum+ { prefixedMnemonic } + "repnz "$alphanum+ { prefixedMnemonic } + "rex"".X"{0,1}" "$alphanum+ { prefixedMnemonic } + "rex (bad)" { prefixedMnemonic } + "%"$alphanum+"("$decdigit")" { register } + "%"$alphanum+ { register } + $alphanum+".s"{0,1} { mnemonic } + "(bad)" { mnemonic } + "(" { parensL } + ")" { parensR } + "," { comma } + ":" { colon } + "#" { hash } + "*" { star } + +{ +data Token = Offset Int + | Constant Int + | Address Int + | PrefixedMnemonic [String] + | Register String + | Mnemonic String + | ParensL + | ParensR + | Comma + | Colon + | Hash + | Star + deriving (Eq, Show) + +offset s = Offset $ read s +constant s = Constant $ read $ tail s +address s = Address $ read $ tail s + +prefixedMnemonic s = PrefixedMnemonic $ words s +mnemonic s = Mnemonic s + +register s = Register $ tail s + +parensL _ = ParensL +parensR _ = ParensR + +comma _ = Comma +colon _ = Colon +hash _ = Hash +star _ = Star + +lexer = alexScanTokens +} diff --git a/src/Bindings/Bfd/Disasm/I386/Parse.y b/src/Bindings/Bfd/Disasm/I386/Parse.y new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/I386/Parse.y @@ -0,0 +1,94 @@ +{ +module Bindings.Bfd.Disasm.I386.Parse where + +import Data.Array +import qualified Data.IntMap as IntMap +import qualified Data.Map as Map +import Data.Maybe +import Data.Word + +import Bindings.Bfd.Disasm.I386.Lex as L +import Bindings.Bfd.Disasm.I386.Insn +import Bindings.Bfd.Disasm.I386.Insn.EffectiveAddr +import Bindings.Bfd.Disasm.I386.Insn.Mnemonic as R +import Bindings.Bfd.Disasm.I386.Insn.Operand as O +import Bindings.Bfd.Disasm.I386.Insn.Prefix +} + +%name parse +%tokentype { Token } + +%token OFFSET { Offset $$ } + CONSTANT { Constant $$ } + ADDRESS { Address $$ } + PREFIXEDMNEMONIC { PrefixedMnemonic $$ } + MNEMONIC { L.Mnemonic $$ } + REGISTER { Register $$ } + '(' { ParensL } + ')' { ParensR } + ',' { Comma } + ':' { Colon } + '#' { Hash } + '*' { Star } + +%% +insn :: { Insn } + : PREFIXEDMNEMONIC operands { Insn (Prefix $ head $1) (R.Mnemonic $ head $ tail $1) $2 } + | MNEMONIC operands { Insn (Prefix "" ) (R.Mnemonic $1) $2 } + +operands :: { [Operand] } + : {- empty -} { [ ]} -- nop + | absolute { [$1 ]} -- jle 12345 + | immed { [$1 ]} -- pushq $12345 + | directD { [$1 ]} -- inc %rax + | directJ { [$1 ]} -- callq *%rdx + | indirD address { [$1 { O.address = $2 } ]} -- inc 12345(%rax) + | indirJ address { [$1 { O.address = $2 } ]} -- callq *12345(%rbx) + | directD ',' directD { [$1 , $3 ]} -- mov %rax,%rbx + | directD ',' indirD address { [$1 , $3 { O.address = $4 } ]} -- mov %rax,12345(%rbx) + | directD ',' immed { [$1 , $3 ]} -- out %ax,$0x12 + | indirD ',' directD address { [$1 { O.address = $4 }, $3 ]} -- mov 12345(%rbx),%rax + | indirD ',' indirD { [$1 , $3 ]} -- rep movsq %ds:(%rsi),%es:(%rdi) + | immed ',' directD { [$1 , $3 ]} -- mov $12345,%rax + | immed ',' indirD address { [$1 , $3 { O.address = $4 } ]} -- mov $12345,12345(%rax) + | immed ',' directD ',' directD { [$1 , $3 , $5]} -- imul $12345,%rax,%rbx + | immed ',' indirD ',' directD address { [$1 , $3 , $5]} -- imul $12345,12345(%rbp),%eax + +address :: { Maybe Int } + : {- empty -} { Nothing } + | '#' ADDRESS { Just $2 } + +absolute :: { Operand } + : ADDRESS { Abs $1 } + +immed :: { Operand } + : CONSTANT { Imm $1 } + +directD :: { Operand } + : REGISTER { DirD $1 } + +directJ :: { Operand } + : '*' REGISTER { DirJ $2 } + +indirD :: { Operand } + : indir1 { IndD "" (fst $1) (snd $1) Nothing } + | REGISTER ':' indir1 { IndD $1 (fst $3) (snd $3) Nothing } + + +indirJ :: { Operand } + : '*' indir1 { IndJ (fst $2) (snd $2) Nothing } + +indir1 :: { (EffectiveAddr, Maybe Int) } + : OFFSET effAddr { ($2 , Just $1) } + | effAddr { ($1 , Nothing) } + | OFFSET { (NoEA, Just $1) } + +effAddr :: { EffectiveAddr } + : '(' REGISTER ')' { EA $2 "" 1 } + | '(' ',' REGISTER ',' OFFSET ')' { EA "" $3 $5 } + | '(' REGISTER ',' REGISTER ',' OFFSET ')' { EA $2 $4 $6 } + +{ +happyError :: [Token] -> a +happyError tks = error $ "Parse.y: parse error at: " ++ (show $ take 10 tks) +} diff --git a/src/Bindings/Bfd/Disasm/Info.hsc b/src/Bindings/Bfd/Disasm/Info.hsc new file mode 100644 --- /dev/null +++ b/src/Bindings/Bfd/Disasm/Info.hsc @@ -0,0 +1,152 @@ +-- This file is part of Bindings-bfd. +-- +-- Copyright (C) 2010 Michael Nelson +-- +-- Bindings-bfd is free software: you can redistribute it and/or modify +-- it under the terms of the GNU Lesser General Public License as published by +-- the Free Software Foundation, either version 3 of the License, or +-- (at your option) any later version. +-- +-- Bindings-bfd is distributed in the hope that it will be useful, +-- but WITHOUT ANY WARRANTY; without even the implied warranty of +-- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the +-- GNU Lesser General Public License for more details. + +-- You should have received a copy of the GNU Lesser General Public License +-- along with Bindings-bfd. If not, see . + +module Bindings.Bfd.Disasm.Info where + +import Foreign.C +import Foreign.Marshal +import Foreign.Ptr +import Foreign.Storable + +import System.Posix.IO +import System.Posix.Types + +import Bindings.Bfd.Misc + +#include + + +type FPrintfFn = FunPtr (File -> CString -> IO CInt) + + +data Info = Info Info0 Fd + deriving (Eq) + +type Info0 = Ptr Info' + +data Info' = Machine{- { + fprintfFunc :: FunPtr (Ptr Void, CString) + , stream :: Ptr Void + , flavour :: Flavour + , arch :: Architecture + , mach :: Machine + , endian :: Endian + , endianCode :: Endian + , insnSets :: Void Ptr + , section :: Maybe Section + , symbols :: [Symbol] + , numSymbols :: Int + , symtab :: [Symbol] + , symtabPos :: Int + , symtabSize :: Int + , flags :: Flags + , privateData :: Ptr Void + , readMemoryFunc :: FunPtr (CInt, Vma, Info) + , printAddressFunc :: FunPtr (Vma, Info) + , symbolAtAddressFunc :: FunPtr (Vma, Info) + , symbolIsValidFunc :: FunPtr (Symbol, Info) + , buffer :: Ptr CChar + , bufferVma :: Vma + , bufferLength :: Int + , bytesPerLine :: Int + , bytesPerChunk :: Int + , displayEndian :: Endian + , octetsPerByte :: Int + , skipZeros :: Int + , skipZerosAtEnd :: Int + , disassemblerNeedRelocs :: Bool + , insnInfoValid :: Bool + , branchDelayInsn :: Int + , dataSize :: Int + , insnType :: Type + , target :: Vma + , target2 :: Vma + , disassemblerOptions :: String + + } +-} + +instance Storable Info' where + sizeOf _ = #size struct disassemble_info + alignment = sizeOf + pokeByteOff buf off val + | off == (#offset struct disassemble_info, print_address_func) = + (#poke struct disassemble_info, print_address_func) buf val + | off == (#offset struct disassemble_info, buffer ) = + (#poke struct disassemble_info, buffer ) buf val + | off == (#offset struct disassemble_info, buffer_vma ) = + (#poke struct disassemble_info, buffer_vma ) buf val + | off == (#offset struct disassemble_info, buffer_length) = + (#poke struct disassemble_info, buffer_length) buf val + | off == (#offset struct disassemble_info, disassembler_options) = + (#poke struct disassemble_info, disassembler_options) buf val + pokeByteOff _ off _ = error $ "Info.pokeByteOff: " ++ show off + peekByteOff _ _ = error $ "Info.peekByteOff undefined" + +mk + :: IO Info +mk = + do + (pipeRead, pipeWrite) <- createPipe + setFdOption pipeRead NonBlockingRead True + let + pipeWrite' = fromIntegral pipeWrite + mode <- newCString "w" + fpWrite <- c_fdopen pipeWrite' mode + i <- malloc :: IO Info0 + c_init_disassemble_info i fpWrite c_bfd_disassembler_info_fprintf -- structure zeroed here + pokeByteOff i (#offset struct disassemble_info, print_address_func) c_bfd_disassembler_info_print_address + return $ Info i pipeRead + +setMachine + :: Info + -> Int + -> IO () +setMachine (Info info _) mach = pokeByteOff info (#offset disassemble_info, mach) mach + +setBuffer + :: Info + -> String + -> Vma + -> IO () +setBuffer (Info info _) str vma = + do + str' <- newCAStringLen str + pokeByteOff info (#offset disassemble_info, buffer) $ fst str' + pokeByteOff info (#offset disassemble_info, buffer_length) $ snd str' + pokeByteOff info (#offset disassemble_info, buffer_vma) vma + +setOptions + :: Info + -> String + -> IO () +setOptions (Info info _) str = + do + str' <- newCString str + pokeByteOff info (#offset disassemble_info, disassembler_options) str' + +foreign import ccall unsafe "dis-asm.h init_disassemble_info" c_init_disassemble_info + :: Info0 + -> File + -> FPrintfFn + -> IO () + +foreign import ccall unsafe "cbits/disassembler.h &_bfd_disassembler_info_fprintf" c_bfd_disassembler_info_fprintf + :: FPrintfFn + +foreign import ccall unsafe "cbits/disassembler.h &_bfd_disassembler_info_print_address" c_bfd_disassembler_info_print_address + :: FunPtr (Vma' -> Info0 -> IO ()) diff --git a/src/Bindings/Bfd/Disassembler.hs b/src/Bindings/Bfd/Disassembler.hs deleted file mode 100644 --- a/src/Bindings/Bfd/Disassembler.hs +++ /dev/null @@ -1,52 +0,0 @@ --- This file is part of Bindings-bfd. --- --- Copyright (C) 2010 Michael Nelson --- --- Bindings-bfd is free software: you can redistribute it and/or modify --- it under the terms of the GNU Lesser General Public License as published by --- the Free Software Foundation, either version 3 of the License, or --- (at your option) any later version. --- --- Bindings-bfd is distributed in the hope that it will be useful, --- but WITHOUT ANY WARRANTY; without even the implied warranty of --- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --- GNU Lesser General Public License for more details. - --- You should have received a copy of the GNU Lesser General Public License --- along with Bindings-bfd. If not, see . - -module Bindings.Bfd.Disassembler where - -import Foreign.C -import Foreign.Ptr - -import System.Posix.IO - -import Bindings.Bfd.Disassembler.Info -import Bindings.Bfd.Misc - - -type Disassembler = FunPtr Disassembler' - -type Disassembler' = Vma' -> Info0 -> IO CInt - - -run - :: (Integral a) - => Disassembler - -> Info - -> a - -> IO (String, Int) -run disasm (Info info fd) vma = - do - let - vma' = fromIntegral vma - f = d_run disasm vma' info - - len <- f - (str,_) <- fdRead fd 80 -- arbitrarily longer than any possible assembler expression (we hope) - - return (str, fromIntegral len :: Int) - -foreign import ccall unsafe "dynamic" d_run - :: Disassembler -> Disassembler' diff --git a/src/Bindings/Bfd/Disassembler/Info.hsc b/src/Bindings/Bfd/Disassembler/Info.hsc deleted file mode 100644 --- a/src/Bindings/Bfd/Disassembler/Info.hsc +++ /dev/null @@ -1,152 +0,0 @@ --- This file is part of Bindings-bfd. --- --- Copyright (C) 2010 Michael Nelson --- --- Bindings-bfd is free software: you can redistribute it and/or modify --- it under the terms of the GNU Lesser General Public License as published by --- the Free Software Foundation, either version 3 of the License, or --- (at your option) any later version. --- --- Bindings-bfd is distributed in the hope that it will be useful, --- but WITHOUT ANY WARRANTY; without even the implied warranty of --- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the --- GNU Lesser General Public License for more details. - --- You should have received a copy of the GNU Lesser General Public License --- along with Bindings-bfd. If not, see . - -module Bindings.Bfd.Disassembler.Info where - -import Foreign.C -import Foreign.Marshal -import Foreign.Ptr -import Foreign.Storable - -import System.Posix.IO -import System.Posix.Types - -import Bindings.Bfd.Misc - -#include - - -type FPrintfFn = FunPtr (File -> CString -> IO CInt) - - -data Info = Info Info0 Fd - deriving (Eq) - -type Info0 = Ptr Info' - -data Info' = Machine{- { - fprintfFunc :: FunPtr (Ptr Void, CString) - , stream :: Ptr Void - , flavour :: Flavour - , arch :: Architecture - , mach :: Machine - , endian :: Endian - , endianCode :: Endian - , insnSets :: Void Ptr - , section :: Maybe Section - , symbols :: [Symbol] - , numSymbols :: Int - , symtab :: [Symbol] - , symtabPos :: Int - , symtabSize :: Int - , flags :: Flags - , privateData :: Ptr Void - , readMemoryFunc :: FunPtr (CInt, Vma, Info) - , printAddressFunc :: FunPtr (Vma, Info) - , symbolAtAddressFunc :: FunPtr (Vma, Info) - , symbolIsValidFunc :: FunPtr (Symbol, Info) - , buffer :: Ptr CChar - , bufferVma :: Vma - , bufferLength :: Int - , bytesPerLine :: Int - , bytesPerChunk :: Int - , displayEndian :: Endian - , octetsPerByte :: Int - , skipZeros :: Int - , skipZerosAtEnd :: Int - , disassemblerNeedRelocs :: Bool - , insnInfoValid :: Bool - , branchDelayInsn :: Int - , dataSize :: Int - , insnType :: Type - , target :: Vma - , target2 :: Vma - , disassemblerOptions :: String - - } --} - -instance Storable Info' where - sizeOf _ = #size struct disassemble_info - alignment = sizeOf - pokeByteOff buf off val - | off == (#offset struct disassemble_info, print_address_func) = - (#poke struct disassemble_info, print_address_func) buf val - | off == (#offset struct disassemble_info, buffer ) = - (#poke struct disassemble_info, buffer ) buf val - | off == (#offset struct disassemble_info, buffer_vma ) = - (#poke struct disassemble_info, buffer_vma ) buf val - | off == (#offset struct disassemble_info, buffer_length) = - (#poke struct disassemble_info, buffer_length) buf val - | off == (#offset struct disassemble_info, disassembler_options) = - (#poke struct disassemble_info, disassembler_options) buf val - pokeByteOff _ off _ = error $ "Info.pokeByteOff: " ++ show off - peekByteOff _ _ = error $ "Info.peekByteOff undefined" - -mk - :: IO Info -mk = - do - (pipeRead, pipeWrite) <- createPipe - setFdOption pipeRead NonBlockingRead True - let - pipeWrite' = fromIntegral pipeWrite - mode <- newCString "w" - fpWrite <- c_fdopen pipeWrite' mode - i <- malloc :: IO Info0 - c_init_disassemble_info i fpWrite c_bfd_disassembler_info_fprintf -- structure zeroed here - pokeByteOff i (#offset struct disassemble_info, print_address_func) c_bfd_disassembler_info_print_address - return $ Info i pipeRead - -setMachine - :: Info - -> Int - -> IO () -setMachine (Info info _) mach = pokeByteOff info (#offset disassemble_info, mach) mach - -setBuffer - :: Info - -> String - -> Vma - -> IO () -setBuffer (Info info _) str vma = - do - str' <- newCAStringLen str - pokeByteOff info (#offset disassemble_info, buffer) $ fst str' - pokeByteOff info (#offset disassemble_info, buffer_length) $ snd str' - pokeByteOff info (#offset disassemble_info, buffer_vma) vma - -setOptions - :: Info - -> String - -> IO () -setOptions (Info info _) str = - do - str' <- newCString str - pokeByteOff info (#offset disassemble_info, disassembler_options) str' - -foreign import ccall unsafe "dis-asm.h init_disassemble_info" c_init_disassemble_info - :: Info0 - -> File - -> FPrintfFn - -> IO () - -foreign import ccall unsafe "cbits/disassembler.h &_bfd_disassembler_info_fprintf" c_bfd_disassembler_info_fprintf - :: FPrintfFn - -foreign import ccall unsafe "cbits/disassembler.h &_bfd_disassembler_info_print_address" c_bfd_disassembler_info_print_address - :: FunPtr (Vma' -> Info0 -> IO ())