|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| • | Time to put the
infinite numbers of temporaries into |
|||||||||||||
| real registers |
||||||||||||||
| • | Using control
flow graphs |
|||||||||||||
| • | Calculating liveness
using dataflow analysis |
|||||||||||||
| – | The temporaries
are the data |
|||||||||||||
| – | Produces an interference
graph indicating which |
|||||||||||||
| temporaries are
simultaneously live |
||||||||||||||
| • | Register
allocation |
|||||||||||||
| – | By colouring
the interference graph with K colours |
|||||||||||||
| – | K colours == K
registers in the machine |
|||||||||||||
