[llvm-dev] Loop identification

[Krzysztof Parzyszek via llvm-dev]

On 1/13/2017 10:52 AM, Hal Finkel wrote:
> but I think we need to discuss the use case.

The main case for us was recognizing polynomial multiplications. Hexagon 
has instructions that do that, and the goal was to replace loops that do 
that with intrinsics. The problem is that these loops often get unrolled 
and intertwined with other code, making the replacement hard, or 
impossible. This is especially true if some of the multiplication code 
is combined with instructions that were not originally part of it (I 
don't remember 100% if that was happening, but the loop optimizations 
were the main culprit in making it hard).

-Krzysztof

-- 
Qualcomm Innovation Center, Inc. is a member of Code Aurora Forum, 
hosted by The Linux Foundation