Michelson.Analyzer

Static analysis of Michelson code.

Documentation

data AnalyzerRes

Constructors

AnalyzerRes

Fields

• arConstStrings :: HashMap MText Word

  All string constants and number of their occurrences.

• arConstBytes :: HashMap ByteString Word

  All bytes constants and number of their occurrences.

• arErrorTags :: HashMap MText Word

  Which strings are used as error tags and how many times. There is no notion of "error tag" in Michelson, so we use a heuristic to find out whether a string is an error tag. Specifically, we consider three patterns: 1. A constant string is pushed and then there is FAILWITH immediately. 2. A constant string is pushed, followed by PAIR instruction and then FAILWITH. 3. A constant pair is pushed where the first item is a string and then there is `FAILWITH.

Instances

Eq AnalyzerRes

Defined in Michelson.Analyzer

Methods

(==) :: AnalyzerRes -> AnalyzerRes -> Bool

(/=) :: AnalyzerRes -> AnalyzerRes -> Bool

Show AnalyzerRes

Defined in Michelson.Analyzer

Methods

showsPrec :: Int -> AnalyzerRes -> ShowS

show :: AnalyzerRes -> String

showList :: [AnalyzerRes] -> ShowS

Semigroup AnalyzerRes

Defined in Michelson.Analyzer

Methods

(<>) :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes

sconcat :: NonEmpty AnalyzerRes -> AnalyzerRes

stimes :: Integral b => b -> AnalyzerRes -> AnalyzerRes

Monoid AnalyzerRes

Defined in Michelson.Analyzer

Methods

mempty :: AnalyzerRes

mappend :: AnalyzerRes -> AnalyzerRes -> AnalyzerRes

mconcat :: [AnalyzerRes] -> AnalyzerRes

Buildable AnalyzerRes

Defined in Michelson.Analyzer

Methods

build :: AnalyzerRes -> Builder

analyze :: Instr inp out -> AnalyzerRes

Statically analyze an instruction. Typed representation is used because it's easier to analyze. It means that we can't analyze ill-typed contracts, but hopefully it's not a serious limitation.