view tools/binding/llvm-opt.cpp @ 1491:360a8e8eea51

Teach stack promotion to walk the CFG when a potential reuse of an allocation is found to see if it can actually happen instead of just assuming it will. This allows it to catch cases like {{{ int i; Foo f; while (cond(i)) f = new Foo(i++); return f.value; }}} where it previously wouldn't because a phi using the allocation would appear in the condition block to propagate it to the use after the loop.
author Frits van Bommel <fvbommel wxs.nl>
date Thu, 11 Jun 2009 02:04:44 +0200
parents 1ba61de8796b
children
line wrap: on
line source

// Optimizer functionality for the LLVM D binding.
//
// This file is distributed under the University of Illinois Open Source
// License. See LICENSE.TXT for details.
//
#include "llvm/PassManager.h"
#include "llvm/LinkAllPasses.h"
#include "llvm/Analysis/LoopPass.h"
#include "llvm/Target/TargetData.h"
#include "llvm-c/Core.h"

using namespace llvm;

extern "C" {

void LLVMOptimizeModule(LLVMModuleRef M, int doinline)
{
    Module* m = unwrap(M);

    PassManager pm;
    pm.add(new TargetData(m));

    //pm.add(createStripDeadPrototypesPass());
    pm.add(createGlobalDCEPass());

    pm.add(createRaiseAllocationsPass());
    pm.add(createCFGSimplificationPass());
    pm.add(createPromoteMemoryToRegisterPass());
    pm.add(createGlobalOptimizerPass());
    pm.add(createGlobalDCEPass());

    pm.add(createIPConstantPropagationPass());
    pm.add(createDeadArgEliminationPass());
    pm.add(createInstructionCombiningPass());
    pm.add(createCFGSimplificationPass());
    pm.add(createPruneEHPass());

    if (doinline)
        pm.add(createFunctionInliningPass());

    pm.add(createArgumentPromotionPass());
    pm.add(createTailDuplicationPass());
    pm.add(createInstructionCombiningPass());
    pm.add(createCFGSimplificationPass());
    pm.add(createScalarReplAggregatesPass());
    pm.add(createInstructionCombiningPass());
    pm.add(createCondPropagationPass());

    pm.add(createTailCallEliminationPass());
    pm.add(createCFGSimplificationPass());
    pm.add(createReassociatePass());
    pm.add(createLoopRotatePass());
    pm.add(createLICMPass());
    pm.add(createLoopUnswitchPass());
    pm.add(createInstructionCombiningPass());
    pm.add(createIndVarSimplifyPass());
    pm.add(createLoopUnrollPass());
    pm.add(createInstructionCombiningPass());
    pm.add(createGVNPass());
    pm.add(createSCCPPass());

    pm.add(createInstructionCombiningPass());
    pm.add(createCondPropagationPass());

    pm.add(createDeadStoreEliminationPass());
    pm.add(createAggressiveDCEPass());
    pm.add(createCFGSimplificationPass());
    pm.add(createSimplifyLibCallsPass());
    pm.add(createDeadTypeEliminationPass());
    pm.add(createConstantMergePass());

    pm.run(*m);
}

}