blob: c8cf234ca46449378463d75d213cfaf2eb0b2160 [file] [log] [blame]
Dan Gohmanf17a25c2007-07-18 16:29:46 +00001//===- SubtargetEmitter.cpp - Generate subtarget enumerations -------------===//
2//
3// The LLVM Compiler Infrastructure
4//
Chris Lattnerfd6c2f02007-12-29 20:37:13 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Dan Gohmanf17a25c2007-07-18 16:29:46 +00007//
8//===----------------------------------------------------------------------===//
9//
10// This tablegen backend emits subtarget enumerations.
11//
12//===----------------------------------------------------------------------===//
13
14#include "SubtargetEmitter.h"
15#include "CodeGenTarget.h"
16#include "Record.h"
17#include "llvm/ADT/StringExtras.h"
18#include "llvm/Support/Debug.h"
19#include <algorithm>
20using namespace llvm;
21
22//
Dan Gohmanf17a25c2007-07-18 16:29:46 +000023// Enumeration - Emit the specified class as an enumeration.
24//
Daniel Dunbard4287062009-07-03 00:10:29 +000025void SubtargetEmitter::Enumeration(raw_ostream &OS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +000026 const char *ClassName,
27 bool isBits) {
28 // Get all records of class and sort
29 std::vector<Record*> DefList = Records.getAllDerivedDefinitions(ClassName);
30 std::sort(DefList.begin(), DefList.end(), LessRecord());
31
32 // Open enumeration
33 OS << "enum {\n";
34
35 // For each record
36 for (unsigned i = 0, N = DefList.size(); i < N;) {
37 // Next record
38 Record *Def = DefList[i];
39
40 // Get and emit name
41 OS << " " << Def->getName();
42
43 // If bit flags then emit expression (1 << i)
44 if (isBits) OS << " = " << " 1 << " << i;
45
46 // Depending on 'if more in the list' emit comma
47 if (++i < N) OS << ",";
48
49 OS << "\n";
50 }
51
52 // Close enumeration
53 OS << "};\n";
54}
55
56//
57// FeatureKeyValues - Emit data of all the subtarget features. Used by the
58// command line.
59//
Daniel Dunbard4287062009-07-03 00:10:29 +000060void SubtargetEmitter::FeatureKeyValues(raw_ostream &OS) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +000061 // Gather and sort all the features
62 std::vector<Record*> FeatureList =
63 Records.getAllDerivedDefinitions("SubtargetFeature");
Jim Grosbach36ed4552008-09-11 17:05:32 +000064 std::sort(FeatureList.begin(), FeatureList.end(), LessRecordFieldName());
Dan Gohmanf17a25c2007-07-18 16:29:46 +000065
66 // Begin feature table
67 OS << "// Sorted (by key) array of values for CPU features.\n"
Dan Gohman12300e12008-03-25 21:45:14 +000068 << "static const llvm::SubtargetFeatureKV FeatureKV[] = {\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +000069
70 // For each feature
71 for (unsigned i = 0, N = FeatureList.size(); i < N; ++i) {
72 // Next feature
73 Record *Feature = FeatureList[i];
74
75 const std::string &Name = Feature->getName();
76 const std::string &CommandLineName = Feature->getValueAsString("Name");
77 const std::string &Desc = Feature->getValueAsString("Desc");
78
79 if (CommandLineName.empty()) continue;
80
Jim Grosbachda95ec82009-03-26 16:17:51 +000081 // Emit as { "feature", "description", featureEnum, i1 | i2 | ... | in }
Dan Gohmanf17a25c2007-07-18 16:29:46 +000082 OS << " { "
83 << "\"" << CommandLineName << "\", "
84 << "\"" << Desc << "\", "
85 << Name << ", ";
86
87 const std::vector<Record*> &ImpliesList =
88 Feature->getValueAsListOfDefs("Implies");
89
90 if (ImpliesList.empty()) {
91 OS << "0";
92 } else {
93 for (unsigned j = 0, M = ImpliesList.size(); j < M;) {
94 OS << ImpliesList[j]->getName();
95 if (++j < M) OS << " | ";
96 }
97 }
98
99 OS << " }";
100
101 // Depending on 'if more in the list' emit comma
102 if ((i + 1) < N) OS << ",";
103
104 OS << "\n";
105 }
106
107 // End feature table
108 OS << "};\n";
109
110 // Emit size of table
111 OS<<"\nenum {\n";
112 OS<<" FeatureKVSize = sizeof(FeatureKV)/sizeof(llvm::SubtargetFeatureKV)\n";
113 OS<<"};\n";
114}
115
116//
117// CPUKeyValues - Emit data of all the subtarget processors. Used by command
118// line.
119//
Daniel Dunbard4287062009-07-03 00:10:29 +0000120void SubtargetEmitter::CPUKeyValues(raw_ostream &OS) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000121 // Gather and sort processor information
122 std::vector<Record*> ProcessorList =
123 Records.getAllDerivedDefinitions("Processor");
124 std::sort(ProcessorList.begin(), ProcessorList.end(), LessRecordFieldName());
125
126 // Begin processor table
127 OS << "// Sorted (by key) array of values for CPU subtype.\n"
128 << "static const llvm::SubtargetFeatureKV SubTypeKV[] = {\n";
129
130 // For each processor
131 for (unsigned i = 0, N = ProcessorList.size(); i < N;) {
132 // Next processor
133 Record *Processor = ProcessorList[i];
134
135 const std::string &Name = Processor->getValueAsString("Name");
136 const std::vector<Record*> &FeatureList =
137 Processor->getValueAsListOfDefs("Features");
138
139 // Emit as { "cpu", "description", f1 | f2 | ... fn },
140 OS << " { "
141 << "\"" << Name << "\", "
142 << "\"Select the " << Name << " processor\", ";
143
144 if (FeatureList.empty()) {
145 OS << "0";
146 } else {
147 for (unsigned j = 0, M = FeatureList.size(); j < M;) {
148 OS << FeatureList[j]->getName();
149 if (++j < M) OS << " | ";
150 }
151 }
152
153 // The "0" is for the "implies" section of this data structure.
154 OS << ", 0 }";
155
156 // Depending on 'if more in the list' emit comma
157 if (++i < N) OS << ",";
158
159 OS << "\n";
160 }
161
162 // End processor table
163 OS << "};\n";
164
165 // Emit size of table
166 OS<<"\nenum {\n";
167 OS<<" SubTypeKVSize = sizeof(SubTypeKV)/sizeof(llvm::SubtargetFeatureKV)\n";
168 OS<<"};\n";
169}
170
171//
172// CollectAllItinClasses - Gathers and enumerates all the itinerary classes.
173// Returns itinerary class count.
174//
Daniel Dunbard4287062009-07-03 00:10:29 +0000175unsigned SubtargetEmitter::CollectAllItinClasses(raw_ostream &OS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000176 std::map<std::string, unsigned> &ItinClassesMap) {
177 // Gather and sort all itinerary classes
178 std::vector<Record*> ItinClassList =
179 Records.getAllDerivedDefinitions("InstrItinClass");
180 std::sort(ItinClassList.begin(), ItinClassList.end(), LessRecord());
181
182 // For each itinerary class
183 unsigned N = ItinClassList.size();
184 for (unsigned i = 0; i < N; i++) {
185 // Next itinerary class
186 const Record *ItinClass = ItinClassList[i];
187 // Get name of itinerary class
188 // Assign itinerary class a unique number
189 ItinClassesMap[ItinClass->getName()] = i;
190 }
191
192 // Emit size of table
193 OS<<"\nenum {\n";
194 OS<<" ItinClassesSize = " << N << "\n";
195 OS<<"};\n";
196
197 // Return itinerary class count
198 return N;
199}
200
201//
David Goodwine0106972009-08-17 16:02:57 +0000202// FormItineraryStageString - Compose a string containing the stage
203// data initialization for the specified itinerary. N is the number
204// of stages.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000205//
David Goodwine0106972009-08-17 16:02:57 +0000206void SubtargetEmitter::FormItineraryStageString(Record *ItinData,
207 std::string &ItinString,
208 unsigned &NStages) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000209 // Get states list
210 const std::vector<Record*> &StageList =
211 ItinData->getValueAsListOfDefs("Stages");
212
213 // For each stage
214 unsigned N = NStages = StageList.size();
215 for (unsigned i = 0; i < N;) {
216 // Next stage
217 const Record *Stage = StageList[i];
218
David Goodwin4b6e4982009-08-12 18:31:53 +0000219 // Form string as ,{ cycles, u1 | u2 | ... | un, timeinc }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000220 int Cycles = Stage->getValueAsInt("Cycles");
221 ItinString += " { " + itostr(Cycles) + ", ";
222
223 // Get unit list
224 const std::vector<Record*> &UnitList = Stage->getValueAsListOfDefs("Units");
225
226 // For each unit
227 for (unsigned j = 0, M = UnitList.size(); j < M;) {
228 // Add name and bitwise or
229 ItinString += UnitList[j]->getName();
230 if (++j < M) ItinString += " | ";
231 }
232
David Goodwin4b6e4982009-08-12 18:31:53 +0000233 int TimeInc = Stage->getValueAsInt("TimeInc");
234 ItinString += ", " + itostr(TimeInc);
235
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000236 // Close off stage
237 ItinString += " }";
238 if (++i < N) ItinString += ", ";
239 }
240}
241
242//
David Goodwine0106972009-08-17 16:02:57 +0000243// FormItineraryOperandCycleString - Compose a string containing the
244// operand cycle initialization for the specified itinerary. N is the
245// number of operands that has cycles specified.
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000246//
David Goodwine0106972009-08-17 16:02:57 +0000247void SubtargetEmitter::FormItineraryOperandCycleString(Record *ItinData,
248 std::string &ItinString, unsigned &NOperandCycles) {
249 // Get operand cycle list
250 const std::vector<int64_t> &OperandCycleList =
251 ItinData->getValueAsListOfInts("OperandCycles");
252
253 // For each operand cycle
254 unsigned N = NOperandCycles = OperandCycleList.size();
255 for (unsigned i = 0; i < N;) {
256 // Next operand cycle
257 const int OCycle = OperandCycleList[i];
258
259 ItinString += " " + itostr(OCycle);
260 if (++i < N) ItinString += ", ";
261 }
262}
263
264//
265// EmitStageAndOperandCycleData - Generate unique itinerary stages and
266// operand cycle tables. Record itineraries for processors.
267//
268void SubtargetEmitter::EmitStageAndOperandCycleData(raw_ostream &OS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000269 unsigned NItinClasses,
270 std::map<std::string, unsigned> &ItinClassesMap,
271 std::vector<std::vector<InstrItinerary> > &ProcList) {
272 // Gather processor iteraries
273 std::vector<Record*> ProcItinList =
274 Records.getAllDerivedDefinitions("ProcessorItineraries");
275
276 // If just no itinerary then don't bother
277 if (ProcItinList.size() < 2) return;
278
279 // Begin stages table
David Goodwine0106972009-08-17 16:02:57 +0000280 std::string StageTable = "static const llvm::InstrStage Stages[] = {\n";
281 StageTable += " { 0, 0, 0 }, // No itinerary\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000282
David Goodwine0106972009-08-17 16:02:57 +0000283 // Begin operand cycle table
284 std::string OperandCycleTable = "static const unsigned OperandCycles[] = {\n";
285 OperandCycleTable += " 0, // No itinerary\n";
286
287 unsigned StageCount = 1, OperandCycleCount = 1;
288 unsigned ItinStageEnum = 1, ItinOperandCycleEnum = 1;
289 std::map<std::string, unsigned> ItinStageMap, ItinOperandCycleMap;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000290 for (unsigned i = 0, N = ProcItinList.size(); i < N; i++) {
291 // Next record
292 Record *Proc = ProcItinList[i];
293
294 // Get processor itinerary name
295 const std::string &Name = Proc->getName();
296
297 // Skip default
298 if (Name == "NoItineraries") continue;
299
300 // Create and expand processor itinerary to cover all itinerary classes
301 std::vector<InstrItinerary> ItinList;
302 ItinList.resize(NItinClasses);
303
304 // Get itinerary data list
305 std::vector<Record*> ItinDataList = Proc->getValueAsListOfDefs("IID");
306
307 // For each itinerary data
308 for (unsigned j = 0, M = ItinDataList.size(); j < M; j++) {
309 // Next itinerary data
310 Record *ItinData = ItinDataList[j];
311
312 // Get string and stage count
David Goodwine0106972009-08-17 16:02:57 +0000313 std::string ItinStageString;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000314 unsigned NStages;
David Goodwine0106972009-08-17 16:02:57 +0000315 FormItineraryStageString(ItinData, ItinStageString, NStages);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000316
David Goodwine0106972009-08-17 16:02:57 +0000317 // Get string and operand cycle count
318 std::string ItinOperandCycleString;
319 unsigned NOperandCycles;
320 FormItineraryOperandCycleString(ItinData, ItinOperandCycleString,
321 NOperandCycles);
322
323 // Check to see if stage already exists and create if it doesn't
324 unsigned FindStage = 0;
325 if (NStages > 0) {
326 FindStage = ItinStageMap[ItinStageString];
327 if (FindStage == 0) {
328 // Emit as { cycles, u1 | u2 | ... | un, timeinc }, // index
329 StageTable += ItinStageString + ", // " + itostr(ItinStageEnum) + "\n";
330 // Record Itin class number.
331 ItinStageMap[ItinStageString] = FindStage = StageCount;
332 StageCount += NStages;
333 ItinStageEnum++;
334 }
335 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000336
David Goodwine0106972009-08-17 16:02:57 +0000337 // Check to see if operand cycle already exists and create if it doesn't
338 unsigned FindOperandCycle = 0;
339 if (NOperandCycles > 0) {
340 FindOperandCycle = ItinOperandCycleMap[ItinOperandCycleString];
341 if (FindOperandCycle == 0) {
342 // Emit as cycle, // index
343 OperandCycleTable += ItinOperandCycleString + ", // " +
344 itostr(ItinOperandCycleEnum) + "\n";
345 // Record Itin class number.
346 ItinOperandCycleMap[ItinOperandCycleString] =
347 FindOperandCycle = OperandCycleCount;
348 OperandCycleCount += NOperandCycles;
349 ItinOperandCycleEnum++;
350 }
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000351 }
352
353 // Set up itinerary as location and location + stage count
David Goodwine0106972009-08-17 16:02:57 +0000354 InstrItinerary Intinerary = { FindStage, FindStage + NStages,
355 FindOperandCycle, FindOperandCycle + NOperandCycles};
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000356
357 // Locate where to inject into processor itinerary table
358 const std::string &Name = ItinData->getValueAsDef("TheClass")->getName();
David Goodwine0106972009-08-17 16:02:57 +0000359 unsigned Find = ItinClassesMap[Name];
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000360
361 // Inject - empty slots will be 0, 0
362 ItinList[Find] = Intinerary;
363 }
364
365 // Add process itinerary to list
366 ProcList.push_back(ItinList);
367 }
368
369 // Closing stage
David Goodwine0106972009-08-17 16:02:57 +0000370 StageTable += " { 0, 0, 0 } // End itinerary\n";
371 StageTable += "};\n";
372
373 // Closing operand cycles
374 OperandCycleTable += " 0 // End itinerary\n";
375 OperandCycleTable += "};\n";
376
377 // Emit tables.
378 OS << StageTable;
379 OS << OperandCycleTable;
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000380
David Goodwine0106972009-08-17 16:02:57 +0000381 // Emit size of tables
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000382 OS<<"\nenum {\n";
David Goodwine0106972009-08-17 16:02:57 +0000383 OS<<" StagesSize = sizeof(Stages)/sizeof(llvm::InstrStage),\n";
384 OS<<" OperandCyclesSize = sizeof(OperandCycles)/sizeof(unsigned)\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000385 OS<<"};\n";
386}
387
388//
389// EmitProcessorData - Generate data for processor itineraries.
390//
Daniel Dunbard4287062009-07-03 00:10:29 +0000391void SubtargetEmitter::EmitProcessorData(raw_ostream &OS,
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000392 std::vector<std::vector<InstrItinerary> > &ProcList) {
393 // Get an iterator for processor itinerary stages
394 std::vector<std::vector<InstrItinerary> >::iterator
395 ProcListIter = ProcList.begin();
396
397 // For each processor itinerary
398 std::vector<Record*> Itins =
399 Records.getAllDerivedDefinitions("ProcessorItineraries");
400 for (unsigned i = 0, N = Itins.size(); i < N; i++) {
401 // Next record
402 Record *Itin = Itins[i];
403
404 // Get processor itinerary name
405 const std::string &Name = Itin->getName();
406
407 // Skip default
408 if (Name == "NoItineraries") continue;
409
410 // Begin processor itinerary table
411 OS << "\n";
Dan Gohman12300e12008-03-25 21:45:14 +0000412 OS << "static const llvm::InstrItinerary " << Name << "[] = {\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000413
414 // For each itinerary class
415 std::vector<InstrItinerary> &ItinList = *ProcListIter++;
David Goodwined174992009-09-24 20:22:50 +0000416 for (unsigned j = 0, M = ItinList.size(); j < M; ++j) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000417 InstrItinerary &Intinerary = ItinList[j];
418
David Goodwine0106972009-08-17 16:02:57 +0000419 // Emit in the form of
420 // { firstStage, lastStage, firstCycle, lastCycle } // index
421 if (Intinerary.FirstStage == 0) {
422 OS << " { 0, 0, 0, 0 }";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000423 } else {
David Goodwine0106972009-08-17 16:02:57 +0000424 OS << " { " << Intinerary.FirstStage << ", " <<
425 Intinerary.LastStage << ", " <<
426 Intinerary.FirstOperandCycle << ", " <<
427 Intinerary.LastOperandCycle << " }";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000428 }
429
David Goodwined174992009-09-24 20:22:50 +0000430 OS << ", // " << j << "\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000431 }
432
433 // End processor itinerary table
David Goodwined174992009-09-24 20:22:50 +0000434 OS << " { ~0U, ~0U, ~0U, ~0U } // end marker\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000435 OS << "};\n";
436 }
437}
438
439//
440// EmitProcessorLookup - generate cpu name to itinerary lookup table.
441//
Daniel Dunbard4287062009-07-03 00:10:29 +0000442void SubtargetEmitter::EmitProcessorLookup(raw_ostream &OS) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000443 // Gather and sort processor information
444 std::vector<Record*> ProcessorList =
445 Records.getAllDerivedDefinitions("Processor");
446 std::sort(ProcessorList.begin(), ProcessorList.end(), LessRecordFieldName());
447
448 // Begin processor table
449 OS << "\n";
450 OS << "// Sorted (by key) array of itineraries for CPU subtype.\n"
451 << "static const llvm::SubtargetInfoKV ProcItinKV[] = {\n";
452
453 // For each processor
454 for (unsigned i = 0, N = ProcessorList.size(); i < N;) {
455 // Next processor
456 Record *Processor = ProcessorList[i];
457
458 const std::string &Name = Processor->getValueAsString("Name");
459 const std::string &ProcItin =
460 Processor->getValueAsDef("ProcItin")->getName();
461
462 // Emit as { "cpu", procinit },
463 OS << " { "
464 << "\"" << Name << "\", "
465 << "(void *)&" << ProcItin;
466
467 OS << " }";
468
469 // Depending on ''if more in the list'' emit comma
470 if (++i < N) OS << ",";
471
472 OS << "\n";
473 }
474
475 // End processor table
476 OS << "};\n";
477
478 // Emit size of table
479 OS<<"\nenum {\n";
480 OS<<" ProcItinKVSize = sizeof(ProcItinKV)/"
481 "sizeof(llvm::SubtargetInfoKV)\n";
482 OS<<"};\n";
483}
484
485//
486// EmitData - Emits all stages and itineries, folding common patterns.
487//
Daniel Dunbard4287062009-07-03 00:10:29 +0000488void SubtargetEmitter::EmitData(raw_ostream &OS) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000489 std::map<std::string, unsigned> ItinClassesMap;
490 std::vector<std::vector<InstrItinerary> > ProcList;
491
492 // Enumerate all the itinerary classes
493 unsigned NItinClasses = CollectAllItinClasses(OS, ItinClassesMap);
494 // Make sure the rest is worth the effort
495 HasItineraries = NItinClasses != 1; // Ignore NoItinerary.
496
497 if (HasItineraries) {
498 // Emit the stage data
David Goodwine0106972009-08-17 16:02:57 +0000499 EmitStageAndOperandCycleData(OS, NItinClasses, ItinClassesMap, ProcList);
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000500 // Emit the processor itinerary data
501 EmitProcessorData(OS, ProcList);
502 // Emit the processor lookup data
503 EmitProcessorLookup(OS);
504 }
505}
506
507//
508// ParseFeaturesFunction - Produces a subtarget specific function for parsing
509// the subtarget features string.
510//
Daniel Dunbard4287062009-07-03 00:10:29 +0000511void SubtargetEmitter::ParseFeaturesFunction(raw_ostream &OS) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000512 std::vector<Record*> Features =
513 Records.getAllDerivedDefinitions("SubtargetFeature");
514 std::sort(Features.begin(), Features.end(), LessRecord());
515
516 OS << "// ParseSubtargetFeatures - Parses features string setting specified\n"
517 << "// subtarget options.\n"
Anton Korobeynikov7357d8f2009-05-23 19:50:50 +0000518 << "std::string llvm::";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000519 OS << Target;
520 OS << "Subtarget::ParseSubtargetFeatures(const std::string &FS,\n"
521 << " const std::string &CPU) {\n"
522 << " SubtargetFeatures Features(FS);\n"
523 << " Features.setCPUIfNone(CPU);\n"
524 << " uint32_t Bits = Features.getBits(SubTypeKV, SubTypeKVSize,\n"
525 << " FeatureKV, FeatureKVSize);\n";
526
527 for (unsigned i = 0; i < Features.size(); i++) {
528 // Next record
529 Record *R = Features[i];
530 const std::string &Instance = R->getName();
531 const std::string &Value = R->getValueAsString("Value");
532 const std::string &Attribute = R->getValueAsString("Attribute");
533
Dale Johannesen161badc2008-02-14 23:35:16 +0000534 if (Value=="true" || Value=="false")
535 OS << " if ((Bits & " << Instance << ") != 0) "
536 << Attribute << " = " << Value << ";\n";
537 else
538 OS << " if ((Bits & " << Instance << ") != 0 && " << Attribute <<
539 " < " << Value << ") " << Attribute << " = " << Value << ";\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000540 }
541
542 if (HasItineraries) {
543 OS << "\n"
544 << " InstrItinerary *Itinerary = (InstrItinerary *)"
545 << "Features.getInfo(ProcItinKV, ProcItinKVSize);\n"
David Goodwine0106972009-08-17 16:02:57 +0000546 << " InstrItins = InstrItineraryData(Stages, OperandCycles, Itinerary);\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000547 }
Anton Korobeynikov7357d8f2009-05-23 19:50:50 +0000548
549 OS << " return Features.getCPU();\n"
550 << "}\n";
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000551}
552
Anton Korobeynikov7357d8f2009-05-23 19:50:50 +0000553//
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000554// SubtargetEmitter::run - Main subtarget enumeration emitter.
555//
Daniel Dunbard4287062009-07-03 00:10:29 +0000556void SubtargetEmitter::run(raw_ostream &OS) {
Dan Gohmanf17a25c2007-07-18 16:29:46 +0000557 Target = CodeGenTarget().getName();
558
559 EmitSourceFileHeader("Subtarget Enumeration Source Fragment", OS);
560
561 OS << "#include \"llvm/Target/SubtargetFeature.h\"\n";
562 OS << "#include \"llvm/Target/TargetInstrItineraries.h\"\n\n";
563
564 Enumeration(OS, "FuncUnit", true);
565 OS<<"\n";
566// Enumeration(OS, "InstrItinClass", false);
567// OS<<"\n";
568 Enumeration(OS, "SubtargetFeature", true);
569 OS<<"\n";
570 FeatureKeyValues(OS);
571 OS<<"\n";
572 CPUKeyValues(OS);
573 OS<<"\n";
574 EmitData(OS);
575 OS<<"\n";
576 ParseFeaturesFunction(OS);
577}