search for: a5bc09cf

2011/7/26 Daniel Nicácio <dnicacios at gmail.com>: > > I also would like to see why the "XOR  A,  -1" is not turned into a NOT, any > Probably because NOT (like NEG) doesn't exist :) <http://llvm.org/docs/LangRef.html#instref> I assume the decision was made that it wasn't worth adding the extra unary instructions when they can easily be handled in codegen

...tion Combining. My Optimization function is attached as a patch file. (the diff was made using the 2.9 release version of llvm). Thanks Daniel Nicacio -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110728/a5bc09cf/attachment.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: XORChain.png Type: image/png Size: 59953 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20110728/a5bc09cf/attachment.png> -------------- next part ----...

After a few more tests, I found out that if we set -unroll-threshold to a value large enough, and run "opt -std-compile-opts" or "opt -O3" 3 times, the unroll will be able to unroll the original loop 32 times, and when you have it unrolled for at least 32 times a optimization is triggered, folding it to a single "%xor.3.3.1 = xor i32 %tmp6, -1" (dont know why it does