diff options
author | shadchin <shadchin@yandex-team.ru> | 2022-02-10 16:44:30 +0300 |
---|---|---|
committer | Daniil Cherednik <dcherednik@yandex-team.ru> | 2022-02-10 16:44:30 +0300 |
commit | 2598ef1d0aee359b4b6d5fdd1758916d5907d04f (patch) | |
tree | 012bb94d777798f1f56ac1cec429509766d05181 /contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp | |
parent | 6751af0b0c1b952fede40b19b71da8025b5d8bcf (diff) | |
download | ydb-2598ef1d0aee359b4b6d5fdd1758916d5907d04f.tar.gz |
Restoring authorship annotation for <shadchin@yandex-team.ru>. Commit 1 of 2.
Diffstat (limited to 'contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp')
-rw-r--r-- | contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp | 20 |
1 files changed, 10 insertions, 10 deletions
diff --git a/contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp b/contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp index 32ed0bf987..7e9a624877 100644 --- a/contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp +++ b/contrib/libs/llvm12/utils/TableGen/DAGISelEmitter.cpp @@ -23,10 +23,10 @@ namespace { /// DAGISelEmitter - The top-level class which coordinates construction /// and emission of the instruction selector. class DAGISelEmitter { - RecordKeeper &Records; // Just so we can get at the timing functions. + RecordKeeper &Records; // Just so we can get at the timing functions. CodeGenDAGPatterns CGP; public: - explicit DAGISelEmitter(RecordKeeper &R) : Records(R), CGP(R) {} + explicit DAGISelEmitter(RecordKeeper &R) : Records(R), CGP(R) {} void run(raw_ostream &OS); }; } // End anonymous namespace @@ -151,7 +151,7 @@ void DAGISelEmitter::run(raw_ostream &OS) { }); // Add all the patterns to a temporary list so we can sort them. - Records.startTimer("Sort patterns"); + Records.startTimer("Sort patterns"); std::vector<const PatternToMatch*> Patterns; for (CodeGenDAGPatterns::ptm_iterator I = CGP.ptm_begin(), E = CGP.ptm_end(); I != E; ++I) @@ -159,10 +159,10 @@ void DAGISelEmitter::run(raw_ostream &OS) { // We want to process the matches in order of minimal cost. Sort the patterns // so the least cost one is at the start. - llvm::stable_sort(Patterns, PatternSortingPredicate(CGP)); + llvm::stable_sort(Patterns, PatternSortingPredicate(CGP)); // Convert each variant of each pattern into a Matcher. - Records.startTimer("Convert to matchers"); + Records.startTimer("Convert to matchers"); std::vector<Matcher*> PatternMatchers; for (unsigned i = 0, e = Patterns.size(); i != e; ++i) { for (unsigned Variant = 0; ; ++Variant) { @@ -176,19 +176,19 @@ void DAGISelEmitter::run(raw_ostream &OS) { std::unique_ptr<Matcher> TheMatcher = std::make_unique<ScopeMatcher>(PatternMatchers); - Records.startTimer("Optimize matchers"); + Records.startTimer("Optimize matchers"); OptimizeMatcher(TheMatcher, CGP); - + //Matcher->dump(); - - Records.startTimer("Emit matcher table"); + + Records.startTimer("Emit matcher table"); EmitMatcherTable(TheMatcher.get(), CGP, OS); } namespace llvm { void EmitDAGISel(RecordKeeper &RK, raw_ostream &OS) { - RK.startTimer("Parse patterns"); + RK.startTimer("Parse patterns"); DAGISelEmitter(RK).run(OS); } |