Max Graey

Also instead of `std::set` or `small_set` probably better use bit packed sets like `std::bitset` / `dynamic_bitset`. It should be faster. Perhaps create `small_bitset`

Yeah, exceptions is definitely caused perf penalties. See [this comment](https://github.com/WebAssembly/binaryen/issues/2917#issuecomment-715985374)

> An optimization-free pass through wasm-opt produces I don't think it's optimization-free. It definitely -O1 or something like this which includes LICM (loop invariant code motion).

Fuzzed `ITERATION: 23237`

@tlively could you take a look at this PR please?

Oh, great! I think better if you start some basics and may be after I add additional methods/rules for that pass =)

Great! Are you plan merge this to master? Or I can just fork `oi2` and continue work in separate branch? btw I use one trick with range checking if all...

Also figure outing some useful rules for integer (sing/unsign) comparators: ``` x > x - 1 ``` could always transform to: ``` x != MIN_VALUE ``` and ``` x +...

Also wdyt using for `x != 0`: ```wat get_local $0 i32.eqz i32.eqz ``` instead ```wat get_local $0 i32.const 0 i32.ne ``` This reducing code by 1 byte, but generate worse...

@kripken Sorry, currently I busy on work but I hope I will return to this on weekend