mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-07-16 11:24:39 +00:00
changes for 64bit gcc
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@2801 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
@@ -105,7 +105,7 @@ TimingInfo::~TimingInfo() {
|
|||||||
// Iterate over all of the data, converting it into the dual of the data map,
|
// Iterate over all of the data, converting it into the dual of the data map,
|
||||||
// so that the data is sorted by amount of time taken, instead of pointer.
|
// so that the data is sorted by amount of time taken, instead of pointer.
|
||||||
//
|
//
|
||||||
std::vector<pair<double, Pass*> > Data;
|
std::vector<std::pair<double, Pass*> > Data;
|
||||||
double TotalTime = 0;
|
double TotalTime = 0;
|
||||||
for (std::map<Pass*, double>::iterator I = TimingData.begin(),
|
for (std::map<Pass*, double>::iterator I = TimingData.begin(),
|
||||||
E = TimingData.end(); I != E; ++I)
|
E = TimingData.end(); I != E; ++I)
|
||||||
@@ -116,10 +116,10 @@ TimingInfo::~TimingInfo() {
|
|||||||
}
|
}
|
||||||
|
|
||||||
// Sort the data by time as the primary key, in reverse order...
|
// Sort the data by time as the primary key, in reverse order...
|
||||||
std::sort(Data.begin(), Data.end(), greater<pair<double, Pass*> >());
|
std::sort(Data.begin(), Data.end(), std::greater<std::pair<double, Pass*> >());
|
||||||
|
|
||||||
// Print out timing header...
|
// Print out timing header...
|
||||||
cerr << std::string(79, '=') << "\n"
|
std::cerr << std::string(79, '=') << "\n"
|
||||||
<< " ... Pass execution timing report ...\n"
|
<< " ... Pass execution timing report ...\n"
|
||||||
<< std::string(79, '=') << "\n Total Execution Time: " << TotalTime
|
<< std::string(79, '=') << "\n Total Execution Time: " << TotalTime
|
||||||
<< " seconds\n\n % Time: Seconds:\tPass Name:\n";
|
<< " seconds\n\n % Time: Seconds:\tPass Name:\n";
|
||||||
@@ -129,7 +129,7 @@ TimingInfo::~TimingInfo() {
|
|||||||
fprintf(stderr, " %6.2f%% %fs\t%s\n", Data[i].first*100 / TotalTime,
|
fprintf(stderr, " %6.2f%% %fs\t%s\n", Data[i].first*100 / TotalTime,
|
||||||
Data[i].first, Data[i].second->getPassName());
|
Data[i].first, Data[i].second->getPassName());
|
||||||
}
|
}
|
||||||
cerr << " 100.00% " << TotalTime << "s\tTOTAL\n"
|
std::cerr << " 100.00% " << TotalTime << "s\tTOTAL\n"
|
||||||
<< std::string(79, '=') << "\n";
|
<< std::string(79, '=') << "\n";
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@@ -142,7 +142,7 @@ public:
|
|||||||
|
|
||||||
#ifndef NDEBUG
|
#ifndef NDEBUG
|
||||||
// All Required analyses should be available to the pass as it runs!
|
// All Required analyses should be available to the pass as it runs!
|
||||||
for (vector<AnalysisID>::const_iterator
|
for (std::vector<AnalysisID>::const_iterator
|
||||||
I = AnUsage.getRequiredSet().begin(),
|
I = AnUsage.getRequiredSet().begin(),
|
||||||
E = AnUsage.getRequiredSet().end(); I != E; ++I) {
|
E = AnUsage.getRequiredSet().end(); I != E; ++I) {
|
||||||
assert(getAnalysisOrNullUp(*I) && "Analysis used but not available!");
|
assert(getAnalysisOrNullUp(*I) && "Analysis used but not available!");
|
||||||
|
@@ -8,7 +8,7 @@
|
|||||||
#include "llvm/SymbolTable.h"
|
#include "llvm/SymbolTable.h"
|
||||||
#include "llvm/DerivedTypes.h"
|
#include "llvm/DerivedTypes.h"
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
|
#include <iostream>
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
// Value Class
|
// Value Class
|
||||||
//===----------------------------------------------------------------------===//
|
//===----------------------------------------------------------------------===//
|
||||||
|
@@ -49,6 +49,7 @@
|
|||||||
#include "llvm/Support/InstVisitor.h"
|
#include "llvm/Support/InstVisitor.h"
|
||||||
#include "Support/STLExtras.h"
|
#include "Support/STLExtras.h"
|
||||||
#include <algorithm>
|
#include <algorithm>
|
||||||
|
#include <iostream>
|
||||||
|
|
||||||
namespace { // Anonymous namespace for class
|
namespace { // Anonymous namespace for class
|
||||||
|
|
||||||
@@ -76,7 +77,7 @@ namespace { // Anonymous namespace for class
|
|||||||
CheckFailed("Function Declaration has Internal Linkage!", I);
|
CheckFailed("Function Declaration has Internal Linkage!", I);
|
||||||
|
|
||||||
if (Broken) {
|
if (Broken) {
|
||||||
cerr << "Broken module found, compilation aborted!\n";
|
std::cerr << "Broken module found, compilation aborted!\n";
|
||||||
abort();
|
abort();
|
||||||
}
|
}
|
||||||
return false;
|
return false;
|
||||||
|
Reference in New Issue
Block a user