From: Chris Lattner <sabre@nondot.org>
Date: Mon, 17 Apr 2006 05:25:16 +0000 (+0000)
Subject: Encode a cost of zero as a cost of 1.
X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=8c3e8471592bf46631bff0fab554d5ac3fedcff6;hp=586d6a808dc80abe1b00e5fe943b1042cb4422e9;p=oota-llvm.git

Encode a cost of zero as a cost of 1.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@27745 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/utils/PerfectShuffle/PerfectShuffle.cpp b/utils/PerfectShuffle/PerfectShuffle.cpp
index c2abe9b6116..b19dd0d39ac 100644
--- a/utils/PerfectShuffle/PerfectShuffle.cpp
+++ b/utils/PerfectShuffle/PerfectShuffle.cpp
@@ -381,7 +381,9 @@ int main() {
     
     // CostSat - The cost of this operation saturated to two bits.
     unsigned CostSat = ShufTab[i].Cost;
-    if (CostSat > 3) CostSat = 3;
+    if (CostSat > 4) CostSat = 4;
+    if (CostSat == 0) CostSat = 1;
+    --CostSat;  // Cost is now between 0-3.
     
     unsigned OpNum = ShufTab[i].Op ? ShufTab[i].Op->OpNum : 0;
     assert(OpNum < 16 && "Too few bits to encode operation!");