GitLab

Using a sarl instruction has lower register demand.

- the linked lists are introduced to get a deterministic order
- irnodehashmap instead of set should be slightly faster

- Only iterating over the graph once should be slightly faster
- We don't need to insert the middle of register allocation logic but
  can perform it once before.
- We can gather statistics on the prepared graph before spilling/regalloc has
  happened.