Peter Goodman

Do you know if it's representable as 64 bits? One possibility could be a 64-bit literal, upcasted to a 128-bit type.

Next question: are those significant bits all `1` :-P Worst case, you could decompose into two 64-bit literals, then upcast, and merge into the final literal via a shift and...

Can you make num workers 2 times the number of cores? :-P

Can you submit a PR with these changes?

`post_inst_reg_state` is basically reaching definitions :-)

I think it'd also be interesting to do a form of equality saturation over the IRs. This is be beneficial for loads/stores being converted into things like typed field accesses.

This raises one question for me, which is: should the main binary loading / parsing be done by C++ code? If we made fcd's C++ side cooperate with a Python...

So maybe something like... ```python import cle import fcd # Memory abstraction that will let the decompiler read memory. You could # implement Memory here by invoking APIs from cle,...

I think library-ifying it is something I could pull together in a reasonable amount of time. It'd be pretty cool to expose fcd to Binary Ninja, for example.

@nickolas-pohilets There is no plan to do that. The original scope of the project was to port fcd to use Remill because the lifting approaches shared many similarities. Since then,...