//
// The LLVM Compiler Infrastructure
//
-// This file was developed by the LLVM research group and is distributed under
-// the University of Illinois Open Source License. See LICENSE.TXT for details.
+// This file is distributed under the University of Illinois Open Source
+// License. See LICENSE.TXT for details.
//
//===----------------------------------------------------------------------===//
//
// Read the number of entries...
unsigned NumEntries;
if (fread(&NumEntries, sizeof(unsigned), 1, F) != 1) {
- llvm_cerr << ToolName << ": data packet truncated!\n";
+ cerr << ToolName << ": data packet truncated!\n";
perror(0);
exit(1);
}
// Read in the block of data...
if (fread(&TempSpace[0], sizeof(unsigned)*NumEntries, 1, F) != 1) {
- llvm_cerr << ToolName << ": data packet truncated!\n";
+ cerr << ToolName << ": data packet truncated!\n";
perror(0);
exit(1);
}
Module &TheModule) : M(TheModule) {
FILE *F = fopen(Filename.c_str(), "r");
if (F == 0) {
- llvm_cerr << ToolName << ": Error opening '" << Filename << "': ";
+ cerr << ToolName << ": Error opening '" << Filename << "': ";
perror(0);
exit(1);
}
case ArgumentInfo: {
unsigned ArgLength;
if (fread(&ArgLength, sizeof(unsigned), 1, F) != 1) {
- llvm_cerr << ToolName << ": arguments packet truncated!\n";
+ cerr << ToolName << ": arguments packet truncated!\n";
perror(0);
exit(1);
}
if (ArgLength)
if (fread(&Chars[0], (ArgLength+3) & ~3, 1, F) != 1) {
- llvm_cerr << ToolName << ": arguments packet truncated!\n";
+ cerr << ToolName << ": arguments packet truncated!\n";
perror(0);
exit(1);
}
break;
default:
- llvm_cerr << ToolName << ": Unknown packet type #" << PacketType << "!\n";
+ cerr << ToolName << ": Unknown packet type #" << PacketType << "!\n";
exit(1);
}
}
getBlockCounts(BlockCounts);
for (unsigned i = 0, e = BlockCounts.size(); i != e; ++i)
- if (&BlockCounts[i].first->getParent()->front() == BlockCounts[i].first)
+ if (&BlockCounts[i].first->getParent()->getEntryBlock() ==
+ BlockCounts[i].first)
Counts.push_back(std::make_pair(BlockCounts[i].first->getParent(),
BlockCounts[i].second));
} else {
- llvm_cerr << "Function counts are not available!\n";
+ cerr << "Function counts are not available!\n";
}
return;
}
unsigned Counter = 0;
for (Module::iterator I = M.begin(), E = M.end();
I != E && Counter != FunctionCounts.size(); ++I)
- if (!I->isExternal())
+ if (!I->isDeclaration())
Counts.push_back(std::make_pair(I, FunctionCounts[Counter++]));
}
if (SuccNum >= TI->getNumSuccessors()) {
static bool Warned = false;
if (!Warned) {
- llvm_cerr << "WARNING: profile info doesn't seem to match"
- << " the program!\n";
+ cerr << "WARNING: profile info doesn't seem to match"
+ << " the program!\n";
Warned = true;
}
} else {
}
} else {
- llvm_cerr << "Block counts are not available!\n";
+ cerr << "Block counts are not available!\n";
}
return;
}
void ProfileInfoLoader::getEdgeCounts(std::vector<std::pair<Edge,
unsigned> > &Counts) {
if (EdgeCounts.empty()) {
- llvm_cerr << "Edge counts not available, and no synthesis "
- << "is implemented yet!\n";
+ cerr << "Edge counts not available, and no synthesis "
+ << "is implemented yet!\n";
return;
}
//
void ProfileInfoLoader::getBBTrace(std::vector<BasicBlock *> &Trace) {
if (BBTrace.empty ()) {
- llvm_cerr << "Basic block trace is not available!\n";
+ cerr << "Basic block trace is not available!\n";
return;
}
- llvm_cerr << "Basic block trace loading is not implemented yet!\n";
+ cerr << "Basic block trace loading is not implemented yet!\n";
}
-