[PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count

Sanjoy Das via Phabricator via llvm-commits llvm-commits at lists.llvm.org
Thu Feb 9 11:57:33 PST 2017

Previous message: [PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count
Next message: [PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

sanjoy added a comment.

Sorry for the delay, I'll make sure to review this by the end of (California time) day today.  If I don't get to it by then please feel free to check this in, and I'll do a post-commit review.


https://reviews.llvm.org/D28044

Previous message: [PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count
Next message: [PATCH] D28044: [LV/LoopAccess] Check statically if an unknown dependence distance can be proven larger than the loop-count
Messages sorted by: [ date ] [ thread ] [ subject ] [ author ]

More information about the llvm-commits mailing list