mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2024-11-24 03:33:20 +01:00
4c1f3c24db
into their new header subdirectory: include/llvm/IR. This matches the directory structure of lib, and begins to correct a long standing point of file layout clutter in LLVM. There are still more header files to move here, but I wanted to handle them in separate commits to make tracking what files make sense at each layer easier. The only really questionable files here are the target intrinsic tablegen files. But that's a battle I'd rather not fight today. I've updated both CMake and Makefile build systems (I think, and my tests think, but I may have missed something). I've also re-sorted the includes throughout the project. I'll be committing updates to Clang, DragonEgg, and Polly momentarily. llvm-svn: 171366
215 lines
5.5 KiB
C++
215 lines
5.5 KiB
C++
//===-- DiffConsumer.cpp - Difference Consumer ------------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This files implements the LLVM difference Consumer
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "DiffConsumer.h"
|
|
#include "llvm/IR/Instructions.h"
|
|
#include "llvm/IR/Module.h"
|
|
#include "llvm/Support/ErrorHandling.h"
|
|
|
|
using namespace llvm;
|
|
|
|
static void ComputeNumbering(Function *F, DenseMap<Value*,unsigned> &Numbering){
|
|
unsigned IN = 0;
|
|
|
|
// Arguments get the first numbers.
|
|
for (Function::arg_iterator
|
|
AI = F->arg_begin(), AE = F->arg_end(); AI != AE; ++AI)
|
|
if (!AI->hasName())
|
|
Numbering[&*AI] = IN++;
|
|
|
|
// Walk the basic blocks in order.
|
|
for (Function::iterator FI = F->begin(), FE = F->end(); FI != FE; ++FI) {
|
|
if (!FI->hasName())
|
|
Numbering[&*FI] = IN++;
|
|
|
|
// Walk the instructions in order.
|
|
for (BasicBlock::iterator BI = FI->begin(), BE = FI->end(); BI != BE; ++BI)
|
|
// void instructions don't get numbers.
|
|
if (!BI->hasName() && !BI->getType()->isVoidTy())
|
|
Numbering[&*BI] = IN++;
|
|
}
|
|
|
|
assert(!Numbering.empty() && "asked for numbering but numbering was no-op");
|
|
}
|
|
|
|
|
|
void Consumer::anchor() { }
|
|
|
|
void DiffConsumer::printValue(Value *V, bool isL) {
|
|
if (V->hasName()) {
|
|
out << (isa<GlobalValue>(V) ? '@' : '%') << V->getName();
|
|
return;
|
|
}
|
|
if (V->getType()->isVoidTy()) {
|
|
if (isa<StoreInst>(V)) {
|
|
out << "store to ";
|
|
printValue(cast<StoreInst>(V)->getPointerOperand(), isL);
|
|
} else if (isa<CallInst>(V)) {
|
|
out << "call to ";
|
|
printValue(cast<CallInst>(V)->getCalledValue(), isL);
|
|
} else if (isa<InvokeInst>(V)) {
|
|
out << "invoke to ";
|
|
printValue(cast<InvokeInst>(V)->getCalledValue(), isL);
|
|
} else {
|
|
out << *V;
|
|
}
|
|
return;
|
|
}
|
|
if (isa<Constant>(V)) {
|
|
out << *V;
|
|
return;
|
|
}
|
|
|
|
unsigned N = contexts.size();
|
|
while (N > 0) {
|
|
--N;
|
|
DiffContext &ctxt = contexts[N];
|
|
if (!ctxt.IsFunction) continue;
|
|
if (isL) {
|
|
if (ctxt.LNumbering.empty())
|
|
ComputeNumbering(cast<Function>(ctxt.L), ctxt.LNumbering);
|
|
out << '%' << ctxt.LNumbering[V];
|
|
return;
|
|
} else {
|
|
if (ctxt.RNumbering.empty())
|
|
ComputeNumbering(cast<Function>(ctxt.R), ctxt.RNumbering);
|
|
out << '%' << ctxt.RNumbering[V];
|
|
return;
|
|
}
|
|
}
|
|
|
|
out << "<anonymous>";
|
|
}
|
|
|
|
void DiffConsumer::header() {
|
|
if (contexts.empty()) return;
|
|
for (SmallVectorImpl<DiffContext>::iterator
|
|
I = contexts.begin(), E = contexts.end(); I != E; ++I) {
|
|
if (I->Differences) continue;
|
|
if (isa<Function>(I->L)) {
|
|
// Extra newline between functions.
|
|
if (Differences) out << "\n";
|
|
|
|
Function *L = cast<Function>(I->L);
|
|
Function *R = cast<Function>(I->R);
|
|
if (L->getName() != R->getName())
|
|
out << "in function " << L->getName()
|
|
<< " / " << R->getName() << ":\n";
|
|
else
|
|
out << "in function " << L->getName() << ":\n";
|
|
} else if (isa<BasicBlock>(I->L)) {
|
|
BasicBlock *L = cast<BasicBlock>(I->L);
|
|
BasicBlock *R = cast<BasicBlock>(I->R);
|
|
if (L->hasName() && R->hasName() && L->getName() == R->getName())
|
|
out << " in block %" << L->getName() << ":\n";
|
|
else {
|
|
out << " in block ";
|
|
printValue(L, true);
|
|
out << " / ";
|
|
printValue(R, false);
|
|
out << ":\n";
|
|
}
|
|
} else if (isa<Instruction>(I->L)) {
|
|
out << " in instruction ";
|
|
printValue(I->L, true);
|
|
out << " / ";
|
|
printValue(I->R, false);
|
|
out << ":\n";
|
|
}
|
|
|
|
I->Differences = true;
|
|
}
|
|
}
|
|
|
|
void DiffConsumer::indent() {
|
|
unsigned N = Indent;
|
|
while (N--) out << ' ';
|
|
}
|
|
|
|
bool DiffConsumer::hadDifferences() const {
|
|
return Differences;
|
|
}
|
|
|
|
void DiffConsumer::enterContext(Value *L, Value *R) {
|
|
contexts.push_back(DiffContext(L, R));
|
|
Indent += 2;
|
|
}
|
|
|
|
void DiffConsumer::exitContext() {
|
|
Differences |= contexts.back().Differences;
|
|
contexts.pop_back();
|
|
Indent -= 2;
|
|
}
|
|
|
|
void DiffConsumer::log(StringRef text) {
|
|
header();
|
|
indent();
|
|
out << text << '\n';
|
|
}
|
|
|
|
void DiffConsumer::logf(const LogBuilder &Log) {
|
|
header();
|
|
indent();
|
|
|
|
unsigned arg = 0;
|
|
|
|
StringRef format = Log.getFormat();
|
|
while (true) {
|
|
size_t percent = format.find('%');
|
|
if (percent == StringRef::npos) {
|
|
out << format;
|
|
break;
|
|
}
|
|
assert(format[percent] == '%');
|
|
|
|
if (percent > 0) out << format.substr(0, percent);
|
|
|
|
switch (format[percent+1]) {
|
|
case '%': out << '%'; break;
|
|
case 'l': printValue(Log.getArgument(arg++), true); break;
|
|
case 'r': printValue(Log.getArgument(arg++), false); break;
|
|
default: llvm_unreachable("unknown format character");
|
|
}
|
|
|
|
format = format.substr(percent+2);
|
|
}
|
|
|
|
out << '\n';
|
|
}
|
|
|
|
void DiffConsumer::logd(const DiffLogBuilder &Log) {
|
|
header();
|
|
|
|
for (unsigned I = 0, E = Log.getNumLines(); I != E; ++I) {
|
|
indent();
|
|
switch (Log.getLineKind(I)) {
|
|
case DC_match:
|
|
out << " ";
|
|
Log.getLeft(I)->dump();
|
|
//printValue(Log.getLeft(I), true);
|
|
break;
|
|
case DC_left:
|
|
out << "< ";
|
|
Log.getLeft(I)->dump();
|
|
//printValue(Log.getLeft(I), true);
|
|
break;
|
|
case DC_right:
|
|
out << "> ";
|
|
Log.getRight(I)->dump();
|
|
//printValue(Log.getRight(I), false);
|
|
break;
|
|
}
|
|
//out << "\n";
|
|
}
|
|
}
|