1 //===- llvm/Analysis/ValueTracking.h - Walk computations --------*- C++ -*-===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file contains routines that help analyze properties that chains of
13 //===----------------------------------------------------------------------===//
15 #ifndef LLVM_ANALYSIS_VALUETRACKING_H
16 #define LLVM_ANALYSIS_VALUETRACKING_H
18 #include "llvm/ADT/ArrayRef.h"
19 #include "llvm/Support/DataTypes.h"
28 class AssumptionTracker;
30 class TargetLibraryInfo;
32 /// Determine which bits of V are known to be either zero or one and return
33 /// them in the KnownZero/KnownOne bit sets.
35 /// This function is defined on values with integer type, values with pointer
36 /// type (but only if TD is non-null), and vectors of integers. In the case
37 /// where V is a vector, the known zero and known one values are the
38 /// same width as the vector element, and the bit is set only if it is true
39 /// for all of the elements in the vector.
40 void computeKnownBits(Value *V, APInt &KnownZero, APInt &KnownOne,
41 const DataLayout *TD = nullptr, unsigned Depth = 0,
42 AssumptionTracker *AT = nullptr,
43 const Instruction *CxtI = nullptr,
44 const DominatorTree *DT = nullptr);
45 /// Compute known bits from the range metadata.
46 /// \p KnownZero the set of bits that are known to be zero
47 void computeKnownBitsFromRangeMetadata(const MDNode &Ranges,
50 /// ComputeSignBit - Determine whether the sign bit is known to be zero or
51 /// one. Convenience wrapper around computeKnownBits.
52 void ComputeSignBit(Value *V, bool &KnownZero, bool &KnownOne,
53 const DataLayout *TD = nullptr, unsigned Depth = 0,
54 AssumptionTracker *AT = nullptr,
55 const Instruction *CxtI = nullptr,
56 const DominatorTree *DT = nullptr);
58 /// isKnownToBeAPowerOfTwo - Return true if the given value is known to have
59 /// exactly one bit set when defined. For vectors return true if every
60 /// element is known to be a power of two when defined. Supports values with
61 /// integer or pointer type and vectors of integers. If 'OrZero' is set then
62 /// returns true if the given value is either a power of two or zero.
63 bool isKnownToBeAPowerOfTwo(Value *V, bool OrZero = false, unsigned Depth = 0,
64 AssumptionTracker *AT = nullptr,
65 const Instruction *CxtI = nullptr,
66 const DominatorTree *DT = nullptr);
68 /// isKnownNonZero - Return true if the given value is known to be non-zero
69 /// when defined. For vectors return true if every element is known to be
70 /// non-zero when defined. Supports values with integer or pointer type and
71 /// vectors of integers.
72 bool isKnownNonZero(Value *V, const DataLayout *TD = nullptr,
73 unsigned Depth = 0, AssumptionTracker *AT = nullptr,
74 const Instruction *CxtI = nullptr,
75 const DominatorTree *DT = nullptr);
77 /// MaskedValueIsZero - Return true if 'V & Mask' is known to be zero. We use
78 /// this predicate to simplify operations downstream. Mask is known to be
79 /// zero for bits that V cannot have.
81 /// This function is defined on values with integer type, values with pointer
82 /// type (but only if TD is non-null), and vectors of integers. In the case
83 /// where V is a vector, the mask, known zero, and known one values are the
84 /// same width as the vector element, and the bit is set only if it is true
85 /// for all of the elements in the vector.
86 bool MaskedValueIsZero(Value *V, const APInt &Mask,
87 const DataLayout *TD = nullptr, unsigned Depth = 0,
88 AssumptionTracker *AT = nullptr,
89 const Instruction *CxtI = nullptr,
90 const DominatorTree *DT = nullptr);
93 /// ComputeNumSignBits - Return the number of times the sign bit of the
94 /// register is replicated into the other bits. We know that at least 1 bit
95 /// is always equal to the sign bit (itself), but other cases can give us
96 /// information. For example, immediately after an "ashr X, 2", we know that
97 /// the top 3 bits are all equal to each other, so we return 3.
99 /// 'Op' must have a scalar integer type.
101 unsigned ComputeNumSignBits(Value *Op, const DataLayout *TD = nullptr,
103 AssumptionTracker *AT = nullptr,
104 const Instruction *CxtI = nullptr,
105 const DominatorTree *DT = nullptr);
107 /// ComputeMultiple - This function computes the integer multiple of Base that
108 /// equals V. If successful, it returns true and returns the multiple in
109 /// Multiple. If unsuccessful, it returns false. Also, if V can be
110 /// simplified to an integer, then the simplified V is returned in Val. Look
111 /// through sext only if LookThroughSExt=true.
112 bool ComputeMultiple(Value *V, unsigned Base, Value *&Multiple,
113 bool LookThroughSExt = false,
116 /// CannotBeNegativeZero - Return true if we can prove that the specified FP
117 /// value is never equal to -0.0.
119 bool CannotBeNegativeZero(const Value *V, unsigned Depth = 0);
121 /// isBytewiseValue - If the specified value can be set by repeating the same
122 /// byte in memory, return the i8 value that it is represented with. This is
123 /// true for all i8 values obviously, but is also true for i32 0, i32 -1,
124 /// i16 0xF0F0, double 0.0 etc. If the value can't be handled with a repeated
125 /// byte store (e.g. i16 0x1234), return null.
126 Value *isBytewiseValue(Value *V);
128 /// FindInsertedValue - Given an aggregrate and an sequence of indices, see if
129 /// the scalar value indexed is already around as a register, for example if
130 /// it were inserted directly into the aggregrate.
132 /// If InsertBefore is not null, this function will duplicate (modified)
133 /// insertvalues when a part of a nested struct is extracted.
134 Value *FindInsertedValue(Value *V,
135 ArrayRef<unsigned> idx_range,
136 Instruction *InsertBefore = nullptr);
138 /// GetPointerBaseWithConstantOffset - Analyze the specified pointer to see if
139 /// it can be expressed as a base pointer plus a constant offset. Return the
140 /// base and offset to the caller.
141 Value *GetPointerBaseWithConstantOffset(Value *Ptr, int64_t &Offset,
142 const DataLayout *TD);
143 static inline const Value *
144 GetPointerBaseWithConstantOffset(const Value *Ptr, int64_t &Offset,
145 const DataLayout *TD) {
146 return GetPointerBaseWithConstantOffset(const_cast<Value*>(Ptr), Offset,TD);
149 /// getConstantStringInfo - This function computes the length of a
150 /// null-terminated C string pointed to by V. If successful, it returns true
151 /// and returns the string in Str. If unsuccessful, it returns false. This
152 /// does not include the trailing nul character by default. If TrimAtNul is
153 /// set to false, then this returns any trailing nul characters as well as any
154 /// other characters that come after it.
155 bool getConstantStringInfo(const Value *V, StringRef &Str,
156 uint64_t Offset = 0, bool TrimAtNul = true);
158 /// GetStringLength - If we can compute the length of the string pointed to by
159 /// the specified pointer, return 'len+1'. If we can't, return 0.
160 uint64_t GetStringLength(Value *V);
162 /// GetUnderlyingObject - This method strips off any GEP address adjustments
163 /// and pointer casts from the specified value, returning the original object
164 /// being addressed. Note that the returned value has pointer type if the
165 /// specified value does. If the MaxLookup value is non-zero, it limits the
166 /// number of instructions to be stripped off.
167 Value *GetUnderlyingObject(Value *V, const DataLayout *TD = nullptr,
168 unsigned MaxLookup = 6);
169 static inline const Value *
170 GetUnderlyingObject(const Value *V, const DataLayout *TD = nullptr,
171 unsigned MaxLookup = 6) {
172 return GetUnderlyingObject(const_cast<Value *>(V), TD, MaxLookup);
175 /// GetUnderlyingObjects - This method is similar to GetUnderlyingObject
176 /// except that it can look through phi and select instructions and return
177 /// multiple objects.
178 void GetUnderlyingObjects(Value *V,
179 SmallVectorImpl<Value *> &Objects,
180 const DataLayout *TD = nullptr,
181 unsigned MaxLookup = 6);
183 /// onlyUsedByLifetimeMarkers - Return true if the only users of this pointer
184 /// are lifetime markers.
185 bool onlyUsedByLifetimeMarkers(const Value *V);
187 /// isSafeToSpeculativelyExecute - Return true if the instruction does not
188 /// have any effects besides calculating the result and does not have
189 /// undefined behavior.
191 /// This method never returns true for an instruction that returns true for
192 /// mayHaveSideEffects; however, this method also does some other checks in
193 /// addition. It checks for undefined behavior, like dividing by zero or
194 /// loading from an invalid pointer (but not for undefined results, like a
195 /// shift with a shift amount larger than the width of the result). It checks
196 /// for malloc and alloca because speculatively executing them might cause a
197 /// memory leak. It also returns false for instructions related to control
198 /// flow, specifically terminators and PHI nodes.
200 /// This method only looks at the instruction itself and its operands, so if
201 /// this method returns true, it is safe to move the instruction as long as
202 /// the correct dominance relationships for the operands and users hold.
203 /// However, this method can return true for instructions that read memory;
204 /// for such instructions, moving them may change the resulting value.
205 bool isSafeToSpeculativelyExecute(const Value *V,
206 const DataLayout *TD = nullptr);
208 /// isKnownNonNull - Return true if this pointer couldn't possibly be null by
209 /// its definition. This returns true for allocas, non-extern-weak globals
210 /// and byval arguments.
211 bool isKnownNonNull(const Value *V, const TargetLibraryInfo *TLI = nullptr);
213 /// Return true if it is valid to use the assumptions provided by an
214 /// assume intrinsic, I, at the point in the control-flow identified by the
215 /// context instruction, CxtI.
216 bool isValidAssumeForContext(const Instruction *I, const Instruction *CxtI,
217 const DataLayout *DL = nullptr,
218 const DominatorTree *DT = nullptr);
220 } // end namespace llvm