6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-20 12:31:40 +00:00
Code Issues Projects Releases Wiki Activity

Add debugging information

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@21781 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2005-05-08 20:09:57 +00:00
parent 989f6229bc
commit c9fd097a01
1 changed files with 18 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

18
lib/Transforms/Scalar/Reassociate.cpp
View File

@ -27,6 +27,7 @@
#include "llvm/Instructions.h" #include "llvm/Instructions.h"
#include "llvm/Pass.h" #include "llvm/Pass.h"
#include "llvm/Type.h" #include "llvm/Type.h"
#include "llvm/Assembly/Writer.h"
#include "llvm/Support/CFG.h" #include "llvm/Support/CFG.h"
#include "llvm/Support/Debug.h" #include "llvm/Support/Debug.h"
#include "llvm/ADT/PostOrderIterator.h" #include "llvm/ADT/PostOrderIterator.h"
@ -498,6 +499,17 @@ void Reassociate::OptimizeExpression(unsigned Opcode,
OptimizeExpression(Opcode, Ops); OptimizeExpression(Opcode, Ops);
} }
/// PrintOps - Print out the expression identified in the Ops list.
///
static void PrintOps(unsigned Opcode, const std::vector<ValueEntry> &Ops,
BasicBlock *BB) {
Module *M = BB->getParent()->getParent();
std::cerr << Instruction::getOpcodeName(Opcode) << " "
<< *Ops[0].Op->getType();
for (unsigned i = 0, e = Ops.size(); i != e; ++i)
WriteAsOperand(std::cerr << " ", Ops[i].Op, false, true, M)
<< "," << Ops[i].Rank;
}
/// ReassociateBB - Inspect all of the instructions in this basic block, /// ReassociateBB - Inspect all of the instructions in this basic block,
/// reassociating them as we go. /// reassociating them as we go.
@ -530,6 +542,9 @@ void Reassociate::ReassociateBB(BasicBlock *BB) {
std::vector<ValueEntry> Ops; std::vector<ValueEntry> Ops;
LinearizeExprTree(I, Ops); LinearizeExprTree(I, Ops);
DEBUG(std::cerr << "RAIn:\t"; PrintOps(I->getOpcode(), Ops, BB);
std::cerr << "\n");
// Now that we have linearized the tree to a list and have gathered all of // Now that we have linearized the tree to a list and have gathered all of
// the operands and their ranks, sort the operands by their rank. Use a // the operands and their ranks, sort the operands by their rank. Use a
// stable_sort so that values with equal ranks will have their relative // stable_sort so that values with equal ranks will have their relative
@ -542,6 +557,9 @@ void Reassociate::ReassociateBB(BasicBlock *BB) {
// sorted form, optimize it globally if possible. // sorted form, optimize it globally if possible.
OptimizeExpression(I->getOpcode(), Ops); OptimizeExpression(I->getOpcode(), Ops);
DEBUG(std::cerr << "RAOut:\t"; PrintOps(I->getOpcode(), Ops, BB);
std::cerr << "\n");
if (Ops.size() == 1) { if (Ops.size() == 1) {
// This expression tree simplified to something that isn't a tree, // This expression tree simplified to something that isn't a tree,
// eliminate it. // eliminate it.