{"push_id":910472549,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"5d10f31b0ea5ab19e70bf302c475b1a6ded03310","before":"fd368f098580ad4bafae324dde909fdc2ce56a60","commits":[{"sha":"5d10f31b0ea5ab19e70bf302c475b1a6ded03310","author":{"email":"456aaf9c5e5893aa8a82f9b7faba2a91f1523fa7@apple.com","name":"Xin Tong"},"message":"Add a condition on what the maximum of locations there are in a function for RLE to optimize\n\nRLE is an iterative data flow. Functions with too many locations may take a long time for the\ndata flow to converge.\n\nOnce we move to a genset and killset for RLE. we should be able to lessen the condition a bit more.\n\nI have observed no difference in # of redundant loads eliminated on the stdlib (currently we\neliminate 3862 redundant loads).","distinct":true,"url":"https://api.github.com/repos/gottesmm/swift/commits/5d10f31b0ea5ab19e70bf302c475b1a6ded03310"}]}