[all-commits] [llvm/llvm-project] c40126: [ARM] remove cost-kind predicate for most math op ...

[RotateRight via All-commits]

  Branch: refs/heads/master
  Home:   https://github.com/llvm/llvm-project
  Commit: c40126e74017deb7c8bc0b557ad95d2e73df7cc8
      https://github.com/llvm/llvm-project/commit/c40126e74017deb7c8bc0b557ad95d2e73df7cc8
  Author: Sanjay Patel <spatel at rotateright.com>
  Date:   2020-11-03 (Tue, 03 Nov 2020)

  Changed paths:
    M llvm/lib/Target/ARM/ARMTargetTransformInfo.cpp
    M llvm/test/Analysis/CostModel/ARM/arith.ll
    M llvm/test/Analysis/CostModel/ARM/intrinsic-cost-kinds.ll
    M llvm/test/Analysis/CostModel/ARM/reduce-add.ll
    M llvm/test/CodeGen/Thumb2/LowOverheadLoops/reductions.ll
    M llvm/test/Transforms/SimplifyCFG/ARM/phi-eliminate.ll

  Log Message:
  -----------
  [ARM] remove cost-kind predicate for most math op costs

This is based on the same idea that I am using for the basic model implementation
and what I have partly already done for x86: throughput cost is number of
instructions/uops, so size/blended costs are identical except in special cases
(for example, fdiv or other known-expensive machine instructions or things like
MVE that may require cracking into >1 uop)).

Differential Revision: https://reviews.llvm.org/D90692