submod

See merge request !29

Fix unpinner assumption that target only in one table.

See merge request !28

Address issue with one table being unpinned, and another table not being
unpinned.

Update to fix calls for exception handling.

See merge request !27

Fixed calls break exception handling, and largely aren't needed anymore.
We were still "fixing" calls when it had no fallthrough instruction,
assuming the call is used for something else.  Except that sometimes a
"call _cxa_throw" ends a function/section and legitimately has no
fallthrough.  And this breaks the exception handling.

Testing this fix against the Zipr test suite to verify that it is OK
on a large suite of programs.

Remove ubuntu16 CI, change docker/deployment to ubuntu 22.

See merge request !26

Resolve "Generated binary crashes for varargs compiled with icc"

Closes #18

See merge request !24

Fix naming

See merge request !23

Resolve "Rida crashes if .plt section is empty"

Closes #15

See merge request !20

Also added tests.

Fix some minor bugs

See merge request !21

The main problem is the use of an addition instead of a multiplication for scale values.
In addition, to make sure the result can be used to create new instructions from assembly,
all generated numbers must be in hex.

Unpin type4

See merge request !19

Temp fix: to deal with FII creating overlapping switch table scoops
resulting from imprecision in ICX-created programs.

Todo:  Update FII to not create overlapping scoops.

Only gap-fill for original-style scoops (that is, pure-data).  R/X
scoops are added for switch tables, but may overlap because the
switch detector may make multiple guesses at ground truth.  The gap
filling algorithm wasn't expecting this, so skip these scoops as
they shouldn't result in gap-filling anyhow.

Found bug resulting from hidden static variable in ctime() function.

Improve symbol parsing speed for rida.

See merge request !18

Update free-range management to keep free ranges sorted by size and address.

See merge request !17

This was needed because sorting by address ended up being _very_ slow to
find free spaces in large programs.  E.g., if 100,000 1-byte free
ranges were created (and, likely unusable), placing every instruction
after this point will need to search thouse 100,000 free ranges.

Was previously asserting isRegister() or isMemory(), but could also be
isConstant().