search for: rugina

...ng work with alias analysis and it appears the prior CFLAA has been abandoned. There was quite a bit of refactoring done, yeah. The original CFLAA is now called CFLSteens, and graph construction was moved to its own bit. We also have CFLAnders, which is based more heavily on the paper by Zheng and Rugina (e.g. no stratifiedsets magic). > I have a variant of it where I reworked how compression was done to be less conservative, reworked the interprocedural to do simulated but bounded inlining, and added code to do on-demand testing of CFL paths on both compressed and full graphs. Awesome! >...

...lar to loop unrolling, and > > Chandler suggested we should model it as such. > > > > > > We originally thought he meant by this that the mechanics of inlining > > would stay the same, but the heuristics would have to be changed. > > This is the approach taken by Rugina & Rinard [1], which is almost > > the sum of the literature on this topic I could find, which > > surprised me. However, the actual suggestion was to remove the > > recursion entirely, and replace it with a loop. > > > > > > Before I get into the mechanics of...

...tor (number of times) to inline. In this respect it is similar to loop unrolling, and Chandler suggested we should model it as such. We originally thought he meant by this that the mechanics of inlining would stay the same, but the heuristics would have to be changed. This is the approach taken by Rugina & Rinard [1], which is almost the sum of the literature on this topic I could find, which surprised me. However, the actual suggestion was to remove the recursion entirely, and replace it with a loop. Before I get into the mechanics of this, I'd like to explain what the possible optimizati...

...ng work with alias analysis and it appears the prior CFLAA has been abandoned. There was quite a bit of refactoring done, yeah. The original CFLAA is now called CFLSteens, and graph construction was moved to its own bit. We also have CFLAnders, which is based more heavily on the paper by Zheng and Rugina (e.g. no stratifiedsets magic). > I have a variant of it where I reworked how compression was done to be less conservative, reworked the interprocedural to do simulated but bounded inlining, and added code to do on-demand testing of CFL paths on both compressed and full graphs. Awesome! >...

...een abandoned. >>> >>> There was quite a bit of refactoring done, yeah. The original CFLAA is >>> now called CFLSteens, and graph construction was moved to its own bit. We >>> also have CFLAnders, which is based more heavily on the paper by Zheng and >>> Rugina (e.g. no stratifiedsets magic). >>> >>> > I have a variant of it where I reworked how compression was done to be >>> less conservative, reworked the interprocedural to do simulated but bounded >>> inlining, and added code to do on-demand testing of CFL paths o...

...p unrolling, and > > Chandler suggested we should model it as such. > > > > > > We originally thought he meant by this that the mechanics of > > inlining would stay the same, but the heuristics would have to be > > changed. > > This is the approach taken by Rugina & Rinard [1], which is almost > > the sum of the literature on this topic I could find, which > > surprised me. However, the actual suggestion was to remove the > > recursion entirely, and replace it with a loop. > > > > > > Before I get into the mechanics of...