[llvm-commits] [LLVMdev] [PATCH] BasicBlock Autovectorization Pass

[Sebastian Pop]

Hi,

I see that there are two functions in your code that are O(n^2) in
number of instructions of the program: getCandidatePairs and
buildDepMap.  I think that you could make these two functions faster
if you work on some form of factored def-use chains for memory, like
the VUSE/VDEFs of GCC.

I was trying to find a similar representation in LLVM: isn't there already
a virtual SSA representation for memory references in LLVM?

Thanks,
Sebastian
--
Qualcomm Innovation Center, Inc is a member of Code Aurora Forum