mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-23 15:29:51 +00:00
3ef1aae2b5
This change teaches LazyValueInfo to use the @llvm.assume intrinsic. Like with
the known-bits change (r217342), this requires feeding a "context" instruction
pointer through many functions. Aside from a little refactoring to reuse the
logic that turns predicates into constant ranges in LVI, the only new code is
that which can 'merge' the range from an assumption into that otherwise
computed. There is also a small addition to JumpThreading so that it can have
LVI use assumptions in the same block as the comparison feeding a conditional
branch.
With this patch, we can now simplify this as expected:
int foo(int a) {
__builtin_assume(a > 5);
if (a > 3) {
bar();
return 1;
}
return 0;
}
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@217345 91177308-0d34-0410-b5e6-96231b3b80d8
94 lines
3.3 KiB
C++
94 lines
3.3 KiB
C++
//===- LazyValueInfo.h - Value constraint analysis --------------*- C++ -*-===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
//
|
|
// This file defines the interface for lazy computation of value constraint
|
|
// information.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#ifndef LLVM_ANALYSIS_LAZYVALUEINFO_H
|
|
#define LLVM_ANALYSIS_LAZYVALUEINFO_H
|
|
|
|
#include "llvm/Pass.h"
|
|
|
|
namespace llvm {
|
|
class AssumptionTracker;
|
|
class Constant;
|
|
class DataLayout;
|
|
class DominatorTree;
|
|
class Instruction;
|
|
class TargetLibraryInfo;
|
|
class Value;
|
|
|
|
/// LazyValueInfo - This pass computes, caches, and vends lazy value constraint
|
|
/// information.
|
|
class LazyValueInfo : public FunctionPass {
|
|
AssumptionTracker *AT;
|
|
const DataLayout *DL;
|
|
class TargetLibraryInfo *TLI;
|
|
DominatorTree *DT;
|
|
void *PImpl;
|
|
LazyValueInfo(const LazyValueInfo&) LLVM_DELETED_FUNCTION;
|
|
void operator=(const LazyValueInfo&) LLVM_DELETED_FUNCTION;
|
|
public:
|
|
static char ID;
|
|
LazyValueInfo() : FunctionPass(ID), PImpl(nullptr) {
|
|
initializeLazyValueInfoPass(*PassRegistry::getPassRegistry());
|
|
}
|
|
~LazyValueInfo() { assert(!PImpl && "releaseMemory not called"); }
|
|
|
|
/// Tristate - This is used to return true/false/dunno results.
|
|
enum Tristate {
|
|
Unknown = -1, False = 0, True = 1
|
|
};
|
|
|
|
|
|
// Public query interface.
|
|
|
|
/// getPredicateOnEdge - Determine whether the specified value comparison
|
|
/// with a constant is known to be true or false on the specified CFG edge.
|
|
/// Pred is a CmpInst predicate.
|
|
Tristate getPredicateOnEdge(unsigned Pred, Value *V, Constant *C,
|
|
BasicBlock *FromBB, BasicBlock *ToBB,
|
|
Instruction *CxtI = nullptr);
|
|
|
|
/// getPredicateAt - Determine whether the specified value comparison
|
|
/// with a constant is known to be true or false at the specified instruction
|
|
/// (from an assume intrinsic). Pred is a CmpInst predicate.
|
|
Tristate getPredicateAt(unsigned Pred, Value *V, Constant *C,
|
|
Instruction *CxtI);
|
|
|
|
/// getConstant - Determine whether the specified value is known to be a
|
|
/// constant at the end of the specified block. Return null if not.
|
|
Constant *getConstant(Value *V, BasicBlock *BB, Instruction *CxtI = nullptr);
|
|
|
|
/// getConstantOnEdge - Determine whether the specified value is known to be a
|
|
/// constant on the specified edge. Return null if not.
|
|
Constant *getConstantOnEdge(Value *V, BasicBlock *FromBB, BasicBlock *ToBB,
|
|
Instruction *CxtI = nullptr);
|
|
|
|
/// threadEdge - Inform the analysis cache that we have threaded an edge from
|
|
/// PredBB to OldSucc to be from PredBB to NewSucc instead.
|
|
void threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, BasicBlock *NewSucc);
|
|
|
|
/// eraseBlock - Inform the analysis cache that we have erased a block.
|
|
void eraseBlock(BasicBlock *BB);
|
|
|
|
// Implementation boilerplate.
|
|
|
|
void getAnalysisUsage(AnalysisUsage &AU) const override;
|
|
void releaseMemory() override;
|
|
bool runOnFunction(Function &F) override;
|
|
};
|
|
|
|
} // end namespace llvm
|
|
|
|
#endif
|
|
|