- User Since
- Apr 11 2019, 9:55 AM (18 w, 1 d)
Tue, Aug 13
Mon, Aug 12
Fix build warning for operator<< when using GCC 7.
Fri, Aug 9
Thu, Aug 8
Tue, Aug 6
Added a command line option to specify the threshold for temporal reuse.
Wed, Jul 31
Right, are you planning on submitting a patch for loop interchange upstream?
I used the printer on some of the loop interchange tests, but the delinearization does not support some cases there yet. I hope I find some time to look into that next week and maybe also integrating it into loop interchange unless you plan to do so.
Tue, Jul 30
Run clang-format, address comments from @fhahn.
LGTM. I found a typo, you can fix it while committing.
Thu, Jul 25
Wed, Jul 24
Addressing review comment from @reames
Address remaining comments from @fhahn
Jul 16 2019
Jul 9 2019
Note: Because I removed the getLoops static function in the last path older comments in LoopCacheAnalysis.cpp are unfortunately no longer attached to the correct line.
Addressed suggestions from @fhahn and dropped the pass as an analysis. Instead I provided a static member function in the CacheCost class to compute the cache cost of a nest rooted by a given loop.
I can use breadth_first from ADT/BreadthFirstIterator.h to collect the loops in breadth-first order. Arguably the getLoopsInPreorder() member functions could also be removed in favor of using ADT/DepthFirstIterator.h (need to confirm whether that does a preorder traversal).
Addressed Michael Kruse comments.
Jul 8 2019
Jul 4 2019
Jul 3 2019
Jun 29 2019
Jun 28 2019
This looks pretty good to me. I just added some minor inline comments.
Jun 19 2019
Jun 18 2019
Addressed review comment from M. Kruse.