基于网的寄存器分配冲突图研究

提出使用网表示可分配寄存器对象，通过对网的活跃性数据流分析，构造网的冲突图。与变量冲突图相比，将基于变量的节点分裂成基于网的节点，将同一变量的冲突关系分摊到多个网上，虽增加冲突图节点数量，但降低节点度数，使得用更少颜色对冲突图着色，即可减少所需寄存器的数量，生成更加高效的可执行代码，使存器分配更为灵活。

Study on Interference Graph of Register Allocation Based on Web

This paper presents Web as the object to be assigned to registers, constructs the interference graph of Webs by data flow analysis of Web liveness. Compared with interference graph of variables, the nodes based on variables are splitted into new nodes based on Web, over which the variables’ interference is distributed. The interference graph based on Webs has more nodes, but these nodes’ degree are less. Thus the graph can be colored with less colors. It can reduce the number of required registers to produce more efficient executive code and make register allocation more flexible.