lib/Target/SubtargetFeature.cpp

   1 //===- SubtargetFeature.cpp - CPU characteristics Implementation ----------===//
   2 //
   3 //                     The LLVM Compiler Infrastructure
   4 //
   5 // This file was developed by James M. Laskey and is distributed under the
   6 // University of Illinois Open Source License. See LICENSE.TXT for details.
   7 //
   8 //===----------------------------------------------------------------------===//
   9 //
  10 // This file implements the SubtargetFeature interface.
  11 //
  12 //===----------------------------------------------------------------------===//
  13
  14 #include "llvm/Target/SubtargetFeature.h"
  15 #include "llvm/ADT/StringExtras.h"
  16 #include <algorithm>
  17 #include <cassert>
  18 #include <cctype>
  19 #include <iostream>
  20 using namespace llvm;
  21
  22 //===----------------------------------------------------------------------===//
  23 //                          Static Helper Functions
  24 //===----------------------------------------------------------------------===//
  25
  26 /// hasFlag - Determine if a feature has a flag; '+' or '-'
  27 ///
  28 static inline bool hasFlag(const std::string &Feature) {
  29   assert(!Feature.empty() && "Empty string");
  30   // Get first character
  31   char Ch = Feature[0];
  32   // Check if first character is '+' or '-' flag
  33   return Ch == '+' || Ch =='-';
  34 }
  35
  36 /// StripFlag - Return string stripped of flag.
  37 ///
  38 static inline std::string StripFlag(const std::string &Feature) {
  39   return hasFlag(Feature) ? Feature.substr(1) : Feature;
  40 }
  41
  42 /// isEnabled - Return true if enable flag; '+'.
  43 ///
  44 static inline bool isEnabled(const std::string &Feature) {
  45   assert(!Feature.empty() && "Empty string");
  46   // Get first character
  47   char Ch = Feature[0];
  48   // Check if first character is '+' for enabled
  49   return Ch == '+';
  50 }
  51
  52 /// PrependFlag - Return a string with a prepended flag; '+' or '-'.
  53 ///
  54 static inline std::string PrependFlag(const std::string &Feature,
  55                                       bool IsEnabled) {
  56   assert(!Feature.empty() && "Empty string");
  57   if (hasFlag(Feature)) return Feature;
  58   return std::string(IsEnabled ? "+" : "-") + Feature;
  59 }
  60
  61 /// Split - Splits a string of comma separated items in to a vector of strings.
  62 ///
  63 static void Split(std::vector<std::string> &V, const std::string &S) {
  64   // Start at beginning of string.
  65   size_t Pos = 0;
  66   while (true) {
  67     // Find the next comma
  68     size_t Comma = S.find(',', Pos);
  69     // If no comma found then the the rest of the string is used
  70     if (Comma == std::string::npos) {
  71       // Add string to vector
  72       V.push_back(S.substr(Pos));
  73       break;
  74     }
  75     // Otherwise add substring to vector
  76     V.push_back(S.substr(Pos, Comma - Pos));
  77     // Advance to next item
  78     Pos = Comma + 1;
  79   }
  80 }
  81
  82 /// Join a vector of strings to a string with a comma separating each element.
  83 ///
  84 static std::string Join(const std::vector<std::string> &V) {
  85   // Start with empty string.
  86   std::string Result;
  87   // If the vector is not empty
  88   if (!V.empty()) {
  89     // Start with the CPU feature
  90     Result = V[0];
  91     // For each successive feature
  92     for (size_t i = 1; i < V.size(); i++) {
  93       // Add a comma
  94       Result += ",";
  95       // Add the feature
  96       Result += V[i];
  97     }
  98   }
  99   // Return the features string
 100   return Result;
 101 }
 102
 103 /// Adding features.
 104 void SubtargetFeatures::AddFeature(const std::string &String,
 105                                    bool IsEnabled) {
 106   // Don't add empty features
 107   if (!String.empty()) {
 108     // Convert to lowercase, prepend flag and add to vector
 109     Features.push_back(PrependFlag(LowercaseString(String), IsEnabled));
 110   }
 111 }
 112
 113 /// Find KV in array using binary search.
 114 template<typename T> const T *Find(const std::string &S, const T *A, size_t L) {
 115   // Make the lower bound element we're looking for
 116   T KV;
 117   KV.Key = S.c_str();
 118   // Determine the end of the array
 119   const T *Hi = A + L;
 120   // Binary search the array
 121   const T *F = std::lower_bound(A, Hi, KV);
 122   // If not found then return NULL
 123   if (F == Hi || std::string(F->Key) != S) return NULL;
 124   // Return the found array item
 125   return F;
 126 }
 127
 128 /// getLongestEntryLength - Return the length of the longest entry in the table.
 129 ///
 130 static size_t getLongestEntryLength(const SubtargetFeatureKV *Table,
 131                                     size_t Size) {
 132   size_t MaxLen = 0;
 133   for (size_t i = 0; i < Size; i++)
 134     MaxLen = std::max(MaxLen, std::strlen(Table[i].Key));
 135   return MaxLen;
 136 }
 137
 138 /// Display help for feature choices.
 139 ///
 140 static void Help(const SubtargetFeatureKV *CPUTable, size_t CPUTableSize,
 141                  const SubtargetFeatureKV *FeatTable, size_t FeatTableSize) {
 142   // Determine the length of the longest CPU and Feature entries.
 143   unsigned MaxCPULen  = getLongestEntryLength(CPUTable, CPUTableSize);
 144   unsigned MaxFeatLen = getLongestEntryLength(FeatTable, FeatTableSize);
 145
 146   // Print the CPU table.
 147   std::cerr << "Available CPUs for this target:\n\n";
 148   for (size_t i = 0; i != CPUTableSize; i++)
 149     std::cerr << "  " << CPUTable[i].Key
 150               << std::string(MaxCPULen - std::strlen(CPUTable[i].Key), ' ')
 151               << " - " << CPUTable[i].Desc << ".\n";
 152   std::cerr << "\n";
 153
 154   // Print the Feature table.
 155   std::cerr << "Available features for this target:\n\n";
 156   for (size_t i = 0; i != FeatTableSize; i++)
 157     std::cerr << "  " << FeatTable[i].Key
 158       << std::string(MaxFeatLen - std::strlen(FeatTable[i].Key), ' ')
 159       << " - " << FeatTable[i].Desc << ".\n";
 160   std::cerr << "\n";
 161
 162   std::cerr << "Use +feature to enable a feature, or -feature to disable it.\n"
 163             << "For example, llc -mcpu=mycpu -mattr=+feature1,-feature2\n";
 164   exit(1);
 165 }
 166
 167 //===----------------------------------------------------------------------===//
 168 //                    SubtargetFeatures Implementation
 169 //===----------------------------------------------------------------------===//
 170
 171 SubtargetFeatures::SubtargetFeatures(const std::string &Initial) {
 172   // Break up string into separate features
 173   Split(Features, Initial);
 174 }
 175
 176
 177 std::string SubtargetFeatures::getString() const {
 178   return Join(Features);
 179 }
 180 void SubtargetFeatures::setString(const std::string &Initial) {
 181   // Throw out old features
 182   Features.clear();
 183   // Break up string into separate features
 184   Split(Features, LowercaseString(Initial));
 185 }
 186
 187
 188 /// setCPU - Set the CPU string.  Replaces previous setting.  Setting to ""
 189 /// clears CPU.
 190 void SubtargetFeatures::setCPU(const std::string &String) {
 191   Features[0] = LowercaseString(String);
 192 }
 193
 194
 195 /// setCPUIfNone - Setting CPU string only if no string is set.
 196 ///
 197 void SubtargetFeatures::setCPUIfNone(const std::string &String) {
 198   if (Features[0].empty()) setCPU(String);
 199 }
 200
 201
 202 /// getBits - Get feature bits.
 203 ///
 204 uint32_t SubtargetFeatures::getBits(const SubtargetFeatureKV *CPUTable,
 205                                           size_t CPUTableSize,
 206                                     const SubtargetFeatureKV *FeatureTable,
 207                                           size_t FeatureTableSize) {
 208   assert(CPUTable && "missing CPU table");
 209   assert(FeatureTable && "missing features table");
 210 #ifndef NDEBUG
 211   for (size_t i = 1; i < CPUTableSize; i++) {
 212     assert(strcmp(CPUTable[i - 1].Key, CPUTable[i].Key) < 0 &&
 213            "CPU table is not sorted");
 214   }
 215   for (size_t i = 1; i < FeatureTableSize; i++) {
 216     assert(strcmp(FeatureTable[i - 1].Key, FeatureTable[i].Key) < 0 &&
 217           "CPU features table is not sorted");
 218   }
 219 #endif
 220   uint32_t Bits = 0;                    // Resulting bits
 221
 222   // Check if help is needed
 223   if (Features[0] == "help")
 224     Help(CPUTable, CPUTableSize, FeatureTable, FeatureTableSize);
 225
 226   // Find CPU entry
 227   const SubtargetFeatureKV *CPUEntry =
 228                             Find(Features[0], CPUTable, CPUTableSize);
 229   // If there is a match
 230   if (CPUEntry) {
 231     // Set base feature bits
 232     Bits = CPUEntry->Value;
 233   } else {
 234     std::cerr << "'" << Features[0]
 235               << "' is not a recognized processor for this target"
 236               << " (ignoring processor)"
 237               << "\n";
 238   }
 239   // Iterate through each feature
 240   for (size_t i = 1; i < Features.size(); i++) {
 241     const std::string &Feature = Features[i];
 242
 243     // Check for help
 244     if (Feature == "+help")
 245       Help(CPUTable, CPUTableSize, FeatureTable, FeatureTableSize);
 246
 247     // Find feature in table.
 248     const SubtargetFeatureKV *FeatureEntry =
 249                        Find(StripFlag(Feature), FeatureTable, FeatureTableSize);
 250     // If there is a match
 251     if (FeatureEntry) {
 252       // Enable/disable feature in bits
 253       if (isEnabled(Feature)) Bits |=  FeatureEntry->Value;
 254       else                    Bits &= ~FeatureEntry->Value;
 255     } else {
 256       std::cerr << "'" << Feature
 257                 << "' is not a recognized feature for this target"
 258                 << " (ignoring feature)"
 259                 << "\n";
 260     }
 261   }
 262   return Bits;
 263 }
 264
 265 /// Get info pointer
 266 void *SubtargetFeatures::getInfo(const SubtargetInfoKV *Table,
 267                                        size_t TableSize) {
 268   assert(Table && "missing table");
 269 #ifndef NDEBUG
 270   for (size_t i = 1; i < TableSize; i++) {
 271     assert(strcmp(Table[i - 1].Key, Table[i].Key) < 0 && "Table is not sorted");
 272   }
 273 #endif
 274
 275   // Find entry
 276   const SubtargetInfoKV *Entry = Find(Features[0], Table, TableSize);
 277
 278   if (Entry) {
 279     return Entry->Value;
 280   } else {
 281     std::cerr << "'" << Features[0]
 282               << "' is not a recognized processor for this target"
 283               << " (ignoring processor)"
 284               << "\n";
 285     return NULL;
 286   }
 287 }
 288
 289 /// print - Print feature string.
 290 ///
 291 void SubtargetFeatures::print(std::ostream &OS) const {
 292   for (size_t i = 0; i < Features.size(); i++) {
 293     OS << Features[i] << "  ";
 294   }
 295   OS << "\n";
 296 }
 297
 298 /// dump - Dump feature info.
 299 ///
 300 void SubtargetFeatures::dump() const {
 301   print(std::cerr);
 302 }