This
C++ compiler back-end tool takes variable live ranges, merges compatible ranges into webs, builds an interference graph, and allocates those webs to a limited set of physical registers.
Beyond the supplied greedy baseline, our custom allocator combines graph-class shortcuts, DSatur ordering, and a bounded branch-and-bound pass for smaller graphs. When coloring cannot avoid memory, the tool supports explicit spilling and marker-preserving live-range splitting, including a free_split recovery strategy that evaluates candidate splits and keeps only measurable improvements.
Interference graph examples