[LLVMdev] Instruction combiner: converting arithmetic into bit operations

Krzysztof Parzyszek kparzysz at codeaurora.org
Wed Oct 17 10:36:07 PDT 2012

On 10/17/2012 11:57 AM, Chris Lattner wrote:
> We do want one canonical form, but it would be an interesting experiment to see what happens when we turned 'or' into 'add' instead of the other way around.  We'd have to make sure that simplifydemandedbits and friend can handle the add case as well as the or case, but I think it is already close to smart enough to do that.

I looked in Reassociate.cpp and I saw that it internally converts shifts 
into multiplications.  I think it would be worthwhile to at least 
investigate this possibility further.


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

More information about the llvm-dev mailing list