GitHub PushEvent at 2014-04-26 09:35:40
Repository: llvm
Actor: chapuni
Payload: {"shas":[["797bbced53454aeb6bb143bcd23db5a32b4a9b06","420c9fb3407b8e11ac322a0e7703f7b1f526df04@gmail.com","[LCG] Rotate the full SCC finding algorithm to avoid round-trips through\nthe DFS stack for leaves in the call graph. As mentioned in my previous\ncommit, this is particularly interesting for graphs which have high fan\nout but low connectivity resulting in many leaves. For such graphs, this\ncan remove a large % of the DFS stack traffic even though it doesn't\nmake the stack much smaller.\n\nIt's a bit easier to formulate this for the full algorithm because that\none stops completely for each SCC. For example, I was able to directly\neliminate the \"Recurse\" boolean used to continue an outer loop from the\ninner loop.\n\ngit-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@207311 91177308-0d34-0410-b5e6-96231b3b80d8","Chandler Carruth",true]],"size":1,"ref":"refs/heads/master","head":"797bbced53454aeb6bb143bcd23db5a32b4a9b06"}