Walter's talk on D backend

[Dibyendu Majumdar]

Hi,

I watched the talk on D backend; I thought it could have been 
very interesting but actually was very scant in details.

Two questions:

Just because expressions are in a tree, how does it make the 
backend SSA? It wasn't clear if the D backend uses virtual 
registers, and if these can be assigned only once. If that is the 
case then are their Phi instructions?

The register allocator description also did not really explain 
how it works. There was mention of coloring - was that a 
reference to graph coloring?

It seems that there is a lot of potential for Walter to do deep 
dive video recordings on the backend, where each topic is fully 
explored / explained.