Things that are hard about compiling to x86

It is really hard to compile arithmetic to x86 assembly because:

* (A) add x,y requires at least one of x,y to be a register.
* (B) mul x is predefined to use eax and edx registers.

These make it hard when you're trying to do register allocation because

* (A) What if you spilled x and now need to spill y? You cannot spill both
* (B) This messes with register coloring, you want to precolor the graph but the polytime algorithms (for chordal graphs, which SSA has) break if you precolor.

I'm really stuck, any advice welcome

>>42
Another brainwashed ivory-tower academic... no wonder you can't figure it out. You're the retard here.

I bet you can't even write good Asm with your brain... so what makes you think you can write a compiler if you haven't ever written any significant amount of Asm? If you did, you'd know how to do register allocation already.