{"push_id":1291585910,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"74a1e261bf10980153bb8c0ccd503ef22dc58bb8","before":"42bd726f15ca89e7dda2d1b1746d77c314e81676","commits":[{"sha":"74a1e261bf10980153bb8c0ccd503ef22dc58bb8","author":{"name":"Joe","email":"5e64743a603a731f761ff3f1c45d9635ee018e74@icloud.com"},"message":"Liveness analysis and interference graph construction\n\nWe construct an interference graph from the machine insts post\ninstruction selection. This will allow us to do the iterated register\ncoalescing register allocation algorithm.","distinct":true,"url":"https://api.github.com/repos/joewillsher/Vist/commits/74a1e261bf10980153bb8c0ccd503ef22dc58bb8"}]}
{"actor":{"display_login":"joewillsher"}}