2008-06-02 01:18:21 +00:00
|
|
|
//===- llvm/Analysis/ValueTracking.h - Walk computations --------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file contains routines that help analyze properties that chains of
|
|
|
|
// computations have.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#ifndef LLVM_ANALYSIS_VALUETRACKING_H
|
|
|
|
#define LLVM_ANALYSIS_VALUETRACKING_H
|
|
|
|
|
2009-10-26 01:35:46 +00:00
|
|
|
#include "llvm/System/DataTypes.h"
|
2008-06-26 00:31:12 +00:00
|
|
|
#include <string>
|
|
|
|
|
2008-06-02 01:18:21 +00:00
|
|
|
namespace llvm {
|
2009-11-26 17:12:50 +00:00
|
|
|
template <typename T> class SmallVectorImpl;
|
2008-06-02 01:18:21 +00:00
|
|
|
class Value;
|
2008-06-16 12:48:21 +00:00
|
|
|
class Instruction;
|
2008-06-02 01:18:21 +00:00
|
|
|
class APInt;
|
|
|
|
class TargetData;
|
|
|
|
|
|
|
|
/// ComputeMaskedBits - Determine which of the bits specified in Mask are
|
|
|
|
/// known to be either zero or one and return them in the KnownZero/KnownOne
|
|
|
|
/// bit sets. This code only analyzes bits in Mask, in order to short-circuit
|
|
|
|
/// processing.
|
2009-09-08 00:06:16 +00:00
|
|
|
///
|
|
|
|
/// This function is defined on values with integer type, values with pointer
|
|
|
|
/// type (but only if TD is non-null), and vectors of integers. In the case
|
|
|
|
/// where V is a vector, the mask, known zero, and known one values are the
|
|
|
|
/// same width as the vector element, and the bit is set only if it is true
|
|
|
|
/// for all of the elements in the vector.
|
2008-06-02 01:18:21 +00:00
|
|
|
void ComputeMaskedBits(Value *V, const APInt &Mask, APInt &KnownZero,
|
2009-08-27 17:51:25 +00:00
|
|
|
APInt &KnownOne, const TargetData *TD = 0,
|
2008-06-02 01:18:21 +00:00
|
|
|
unsigned Depth = 0);
|
|
|
|
|
2008-06-02 01:29:46 +00:00
|
|
|
/// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
|
|
|
|
/// this predicate to simplify operations downstream. Mask is known to be
|
|
|
|
/// zero for bits that V cannot have.
|
2009-09-08 00:06:16 +00:00
|
|
|
///
|
|
|
|
/// This function is defined on values with integer type, values with pointer
|
|
|
|
/// type (but only if TD is non-null), and vectors of integers. In the case
|
|
|
|
/// where V is a vector, the mask, known zero, and known one values are the
|
|
|
|
/// same width as the vector element, and the bit is set only if it is true
|
|
|
|
/// for all of the elements in the vector.
|
2008-06-02 01:18:21 +00:00
|
|
|
bool MaskedValueIsZero(Value *V, const APInt &Mask,
|
2009-08-27 17:51:25 +00:00
|
|
|
const TargetData *TD = 0, unsigned Depth = 0);
|
2008-06-02 01:18:21 +00:00
|
|
|
|
|
|
|
|
|
|
|
/// ComputeNumSignBits - Return the number of times the sign bit of the
|
|
|
|
/// register is replicated into the other bits. We know that at least 1 bit
|
|
|
|
/// is always equal to the sign bit (itself), but other cases can give us
|
|
|
|
/// information. For example, immediately after an "ashr X, 2", we know that
|
|
|
|
/// the top 3 bits are all equal to each other, so we return 3.
|
|
|
|
///
|
|
|
|
/// 'Op' must have a scalar integer type.
|
|
|
|
///
|
2009-08-27 17:51:25 +00:00
|
|
|
unsigned ComputeNumSignBits(Value *Op, const TargetData *TD = 0,
|
2008-06-02 01:18:21 +00:00
|
|
|
unsigned Depth = 0);
|
|
|
|
|
2009-11-10 08:28:35 +00:00
|
|
|
/// ComputeMultiple - This function computes the integer multiple of Base that
|
|
|
|
/// equals V. If successful, it returns true and returns the multiple in
|
|
|
|
/// Multiple. If unsuccessful, it returns false. Also, if V can be
|
|
|
|
/// simplified to an integer, then the simplified V is returned in Val. Look
|
|
|
|
/// through sext only if LookThroughSExt=true.
|
2009-11-18 00:58:27 +00:00
|
|
|
bool ComputeMultiple(Value *V, unsigned Base, Value *&Multiple,
|
|
|
|
bool LookThroughSExt = false,
|
2009-11-10 08:28:35 +00:00
|
|
|
unsigned Depth = 0);
|
|
|
|
|
2008-06-02 01:29:46 +00:00
|
|
|
/// CannotBeNegativeZero - Return true if we can prove that the specified FP
|
|
|
|
/// value is never equal to -0.0.
|
|
|
|
///
|
|
|
|
bool CannotBeNegativeZero(const Value *V, unsigned Depth = 0);
|
2008-06-16 12:48:21 +00:00
|
|
|
|
2009-11-26 17:12:50 +00:00
|
|
|
/// DecomposeGEPExpression - If V is a symbolic pointer expression, decompose
|
|
|
|
/// it into a base pointer with a constant offset and a number of scaled
|
|
|
|
/// symbolic offsets.
|
|
|
|
///
|
2009-11-26 18:53:33 +00:00
|
|
|
/// The scaled symbolic offsets (represented by pairs of a Value* and a scale
|
|
|
|
/// in the VarIndices vector) are Value*'s that are known to be scaled by the
|
|
|
|
/// specified amount, but which may have other unrepresented high bits. As
|
|
|
|
/// such, the gep cannot necessarily be reconstructed from its decomposed
|
|
|
|
/// form.
|
|
|
|
///
|
2009-11-26 17:12:50 +00:00
|
|
|
/// When TargetData is around, this function is capable of analyzing
|
|
|
|
/// everything that Value::getUnderlyingObject() can look through. When not,
|
|
|
|
/// it just looks through pointer casts.
|
|
|
|
///
|
|
|
|
const Value *DecomposeGEPExpression(const Value *V, int64_t &BaseOffs,
|
|
|
|
SmallVectorImpl<std::pair<const Value*, int64_t> > &VarIndices,
|
|
|
|
const TargetData *TD);
|
|
|
|
|
|
|
|
|
|
|
|
|
2010-05-28 16:06:09 +00:00
|
|
|
/// FindInsertedValue - Given an aggregrate and an sequence of indices, see if
|
2008-06-17 08:26:32 +00:00
|
|
|
/// the scalar value indexed is already around as a register, for example if
|
|
|
|
/// it were inserted directly into the aggregrate.
|
2008-06-16 13:28:31 +00:00
|
|
|
///
|
|
|
|
/// If InsertBefore is not null, this function will duplicate (modified)
|
|
|
|
/// insertvalues when a part of a nested struct is extracted.
|
2008-06-16 12:48:21 +00:00
|
|
|
Value *FindInsertedValue(Value *V,
|
2009-03-08 00:57:09 +00:00
|
|
|
const unsigned *idx_begin,
|
|
|
|
const unsigned *idx_end,
|
|
|
|
Instruction *InsertBefore = 0);
|
2008-06-17 13:54:33 +00:00
|
|
|
|
|
|
|
/// This is a convenience wrapper for finding values indexed by a single index
|
|
|
|
/// only.
|
|
|
|
inline Value *FindInsertedValue(Value *V, const unsigned Idx,
|
2009-03-08 00:57:09 +00:00
|
|
|
Instruction *InsertBefore = 0) {
|
2008-06-20 00:49:21 +00:00
|
|
|
const unsigned Idxs[1] = { Idx };
|
2009-11-23 03:29:18 +00:00
|
|
|
return FindInsertedValue(V, &Idxs[0], &Idxs[1], InsertBefore);
|
2008-06-30 07:31:25 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
/// GetConstantStringInfo - This function computes the length of a
|
2009-03-13 04:39:26 +00:00
|
|
|
/// null-terminated C string pointed to by V. If successful, it returns true
|
|
|
|
/// and returns the string in Str. If unsuccessful, it returns false. If
|
|
|
|
/// StopAtNul is set to true (the default), the returned string is truncated
|
|
|
|
/// by a nul character in the global. If StopAtNul is false, the nul
|
|
|
|
/// character is included in the result string.
|
2010-04-14 22:20:45 +00:00
|
|
|
bool GetConstantStringInfo(const Value *V, std::string &Str,
|
|
|
|
uint64_t Offset = 0,
|
2009-03-13 04:39:26 +00:00
|
|
|
bool StopAtNul = true);
|
2010-03-05 06:58:57 +00:00
|
|
|
|
|
|
|
/// GetStringLength - If we can compute the length of the string pointed to by
|
|
|
|
/// the specified pointer, return 'len+1'. If we can't, return 0.
|
|
|
|
uint64_t GetStringLength(Value *V);
|
2008-06-02 01:18:21 +00:00
|
|
|
} // end namespace llvm
|
|
|
|
|
|
|
|
#endif
|