[PATCH] D128591: Transforms: refactor pow(x, n) expansion where n is a constant integer value

[Paul Osmialowski via Phabricator via llvm-commits]

pawosm01 updated this revision to Diff 443231.
pawosm01 added a comment.

@RKSimon turned out doing a simple copy-paste wasn't the best idea. I've corrected the code proposed within one of my comments and put it into a new patch. It passes all test now, nothing runs into infinite loop.

Does this approach fits your idea of addressing this specific case?


Repository:
  rG LLVM Github Monorepo

CHANGES SINCE LAST ACTION
  https://reviews.llvm.org/D128591/new/

https://reviews.llvm.org/D128591

Files:
  llvm/lib/Transforms/Utils/SimplifyLibCalls.cpp
  llvm/test/CodeGen/AArch64/powi.ll
  llvm/test/Transforms/InstCombine/pow-4.ll
  llvm/test/Transforms/InstCombine/pow_fp_int.ll
  llvm/test/Transforms/InstCombine/pow_fp_int16.ll

-------------- next part --------------
A non-text attachment was scrubbed...
Name: D128591.443231.patch
Type: text/x-patch
Size: 26499 bytes
Desc: not available
URL: <http://lists.llvm.org/pipermail/llvm-commits/attachments/20220708/7a1f5673/attachment.bin>