1 //===-- SeparateConstOffsetFromGEP.cpp - ------------------------*- 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 // Loop unrolling may create many similar GEPs for array accesses.
11 // e.g., a 2-level loop
13 // float a[32][32]; // global variable
15 // for (int i = 0; i < 2; ++i) {
16 // for (int j = 0; j < 2; ++j) {
18 // ... = a[x + i][y + j];
23 // will probably be unrolled to:
25 // gep %a, 0, %x, %y; load
26 // gep %a, 0, %x, %y + 1; load
27 // gep %a, 0, %x + 1, %y; load
28 // gep %a, 0, %x + 1, %y + 1; load
30 // LLVM's GVN does not use partial redundancy elimination yet, and is thus
31 // unable to reuse (gep %a, 0, %x, %y). As a result, this misoptimization incurs
32 // significant slowdown in targets with limited addressing modes. For instance,
33 // because the PTX target does not support the reg+reg addressing mode, the
34 // NVPTX backend emits PTX code that literally computes the pointer address of
35 // each GEP, wasting tons of registers. It emits the following PTX for the
36 // first load and similar PTX for other loads.
40 // mul.wide.u32 %rl2, %r1, 128;
42 // add.s64 %rl4, %rl3, %rl2;
43 // mul.wide.u32 %rl5, %r2, 4;
44 // add.s64 %rl6, %rl4, %rl5;
45 // ld.global.f32 %f1, [%rl6];
47 // To reduce the register pressure, the optimization implemented in this file
48 // merges the common part of a group of GEPs, so we can compute each pointer
49 // address by adding a simple offset to the common part, saving many registers.
51 // It works by splitting each GEP into a variadic base and a constant offset.
52 // The variadic base can be computed once and reused by multiple GEPs, and the
53 // constant offsets can be nicely folded into the reg+immediate addressing mode
54 // (supported by most targets) without using any extra register.
56 // For instance, we transform the four GEPs and four loads in the above example
59 // base = gep a, 0, x, y
61 // laod base + 1 * sizeof(float)
62 // load base + 32 * sizeof(float)
63 // load base + 33 * sizeof(float)
65 // Given the transformed IR, a backend that supports the reg+immediate
66 // addressing mode can easily fold the pointer arithmetics into the loads. For
67 // example, the NVPTX backend can easily fold the pointer arithmetics into the
68 // ld.global.f32 instructions, and the resultant PTX uses much fewer registers.
70 // mov.u32 %r1, %tid.x;
71 // mov.u32 %r2, %tid.y;
72 // mul.wide.u32 %rl2, %r1, 128;
74 // add.s64 %rl4, %rl3, %rl2;
75 // mul.wide.u32 %rl5, %r2, 4;
76 // add.s64 %rl6, %rl4, %rl5;
77 // ld.global.f32 %f1, [%rl6]; // so far the same as unoptimized PTX
78 // ld.global.f32 %f2, [%rl6+4]; // much better
79 // ld.global.f32 %f3, [%rl6+128]; // much better
80 // ld.global.f32 %f4, [%rl6+132]; // much better
82 // Another improvement enabled by the LowerGEP flag is to lower a GEP with
83 // multiple indices to either multiple GEPs with a single index or arithmetic
84 // operations (depending on whether the target uses alias analysis in codegen).
85 // Such transformation can have following benefits:
86 // (1) It can always extract constants in the indices of structure type.
87 // (2) After such Lowering, there are more optimization opportunities such as
90 // E.g. The following GEPs have multiple indices:
92 // %p = getelementptr [10 x %struct]* %ptr, i64 %i, i64 %j1, i32 3
96 // %p2 = getelementptr [10 x %struct]* %ptr, i64 %i, i64 %j1, i32 2
100 // We can not do CSE for to the common part related to index "i64 %i". Lowering
101 // GEPs can achieve such goals.
102 // If the target does not use alias analysis in codegen, this pass will
103 // lower a GEP with multiple indices into arithmetic operations:
105 // %1 = ptrtoint [10 x %struct]* %ptr to i64 ; CSE opportunity
106 // %2 = mul i64 %i, length_of_10xstruct ; CSE opportunity
107 // %3 = add i64 %1, %2 ; CSE opportunity
108 // %4 = mul i64 %j1, length_of_struct
109 // %5 = add i64 %3, %4
110 // %6 = add i64 %3, struct_field_3 ; Constant offset
111 // %p = inttoptr i64 %6 to i32*
115 // %7 = ptrtoint [10 x %struct]* %ptr to i64 ; CSE opportunity
116 // %8 = mul i64 %i, length_of_10xstruct ; CSE opportunity
117 // %9 = add i64 %7, %8 ; CSE opportunity
118 // %10 = mul i64 %j2, length_of_struct
119 // %11 = add i64 %9, %10
120 // %12 = add i64 %11, struct_field_2 ; Constant offset
121 // %p = inttoptr i64 %12 to i32*
125 // If the target uses alias analysis in codegen, this pass will lower a GEP
126 // with multiple indices into multiple GEPs with a single index:
128 // %1 = bitcast [10 x %struct]* %ptr to i8* ; CSE opportunity
129 // %2 = mul i64 %i, length_of_10xstruct ; CSE opportunity
130 // %3 = getelementptr i8* %1, i64 %2 ; CSE opportunity
131 // %4 = mul i64 %j1, length_of_struct
132 // %5 = getelementptr i8* %3, i64 %4
133 // %6 = getelementptr i8* %5, struct_field_3 ; Constant offset
134 // %p = bitcast i8* %6 to i32*
138 // %7 = bitcast [10 x %struct]* %ptr to i8* ; CSE opportunity
139 // %8 = mul i64 %i, length_of_10xstruct ; CSE opportunity
140 // %9 = getelementptr i8* %7, i64 %8 ; CSE opportunity
141 // %10 = mul i64 %j2, length_of_struct
142 // %11 = getelementptr i8* %9, i64 %10
143 // %12 = getelementptr i8* %11, struct_field_2 ; Constant offset
144 // %p2 = bitcast i8* %12 to i32*
148 // Lowering GEPs can also benefit other passes such as LICM and CGP.
149 // LICM (Loop Invariant Code Motion) can not hoist/sink a GEP of multiple
150 // indices if one of the index is variant. If we lower such GEP into invariant
151 // parts and variant parts, LICM can hoist/sink those invariant parts.
152 // CGP (CodeGen Prepare) tries to sink address calculations that match the
153 // target's addressing modes. A GEP with multiple indices may not match and will
154 // not be sunk. If we lower such GEP into smaller parts, CGP may sink some of
155 // them. So we end up with a better addressing mode.
157 //===----------------------------------------------------------------------===//
159 #include "llvm/Analysis/TargetTransformInfo.h"
160 #include "llvm/Analysis/ValueTracking.h"
161 #include "llvm/IR/Constants.h"
162 #include "llvm/IR/DataLayout.h"
163 #include "llvm/IR/Instructions.h"
164 #include "llvm/IR/LLVMContext.h"
165 #include "llvm/IR/Module.h"
166 #include "llvm/IR/Operator.h"
167 #include "llvm/Support/CommandLine.h"
168 #include "llvm/Support/raw_ostream.h"
169 #include "llvm/Transforms/Scalar.h"
170 #include "llvm/Transforms/Utils/Local.h"
171 #include "llvm/Target/TargetMachine.h"
172 #include "llvm/Target/TargetSubtargetInfo.h"
173 #include "llvm/IR/IRBuilder.h"
175 using namespace llvm;
177 static cl::opt<bool> DisableSeparateConstOffsetFromGEP(
178 "disable-separate-const-offset-from-gep", cl::init(false),
179 cl::desc("Do not separate the constant offset from a GEP instruction"),
181 // Setting this flag may emit false positives when the input module already
182 // contains dead instructions. Therefore, we set it only in unit tests that are
183 // free of dead code.
185 VerifyNoDeadCode("reassociate-geps-verify-no-dead-code", cl::init(false),
186 cl::desc("Verify this pass produces no dead code"),
191 /// \brief A helper class for separating a constant offset from a GEP index.
193 /// In real programs, a GEP index may be more complicated than a simple addition
194 /// of something and a constant integer which can be trivially splitted. For
195 /// example, to split ((a << 3) | 5) + b, we need to search deeper for the
196 /// constant offset, so that we can separate the index to (a << 3) + b and 5.
198 /// Therefore, this class looks into the expression that computes a given GEP
199 /// index, and tries to find a constant integer that can be hoisted to the
200 /// outermost level of the expression as an addition. Not every constant in an
201 /// expression can jump out. e.g., we cannot transform (b * (a + 5)) to (b * a +
202 /// 5); nor can we transform (3 * (a + 5)) to (3 * a + 5), however in this case,
203 /// -instcombine probably already optimized (3 * (a + 5)) to (3 * a + 15).
204 class ConstantOffsetExtractor {
206 /// Extracts a constant offset from the given GEP index. It returns the
207 /// new index representing the remainder (equal to the original index minus
208 /// the constant offset), or nullptr if we cannot extract a constant offset.
209 /// \p Idx The given GEP index
210 /// \p GEP The given GEP
211 /// \p UserChainTail Outputs the tail of UserChain so that we can
212 /// garbage-collect unused instructions in UserChain.
213 static Value *Extract(Value *Idx, GetElementPtrInst *GEP,
214 User *&UserChainTail);
215 /// Looks for a constant offset from the given GEP index without extracting
216 /// it. It returns the numeric value of the extracted constant offset (0 if
217 /// failed). The meaning of the arguments are the same as Extract.
218 static int64_t Find(Value *Idx, GetElementPtrInst *GEP);
221 ConstantOffsetExtractor(Instruction *InsertionPt) : IP(InsertionPt) {}
222 /// Searches the expression that computes V for a non-zero constant C s.t.
223 /// V can be reassociated into the form V' + C. If the searching is
224 /// successful, returns C and update UserChain as a def-use chain from C to V;
225 /// otherwise, UserChain is empty.
227 /// \p V The given expression
228 /// \p SignExtended Whether V will be sign-extended in the computation of the
230 /// \p ZeroExtended Whether V will be zero-extended in the computation of the
232 /// \p NonNegative Whether V is guaranteed to be non-negative. For example,
233 /// an index of an inbounds GEP is guaranteed to be
234 /// non-negative. Levaraging this, we can better split
236 APInt find(Value *V, bool SignExtended, bool ZeroExtended, bool NonNegative);
237 /// A helper function to look into both operands of a binary operator.
238 APInt findInEitherOperand(BinaryOperator *BO, bool SignExtended,
240 /// After finding the constant offset C from the GEP index I, we build a new
241 /// index I' s.t. I' + C = I. This function builds and returns the new
242 /// index I' according to UserChain produced by function "find".
244 /// The building conceptually takes two steps:
245 /// 1) iteratively distribute s/zext towards the leaves of the expression tree
247 /// 2) reassociate the expression tree to the form I' + C.
249 /// For example, to extract the 5 from sext(a + (b + 5)), we first distribute
250 /// sext to a, b and 5 so that we have
251 /// sext(a) + (sext(b) + 5).
252 /// Then, we reassociate it to
253 /// (sext(a) + sext(b)) + 5.
254 /// Given this form, we know I' is sext(a) + sext(b).
255 Value *rebuildWithoutConstOffset();
256 /// After the first step of rebuilding the GEP index without the constant
257 /// offset, distribute s/zext to the operands of all operators in UserChain.
258 /// e.g., zext(sext(a + (b + 5)) (assuming no overflow) =>
259 /// zext(sext(a)) + (zext(sext(b)) + zext(sext(5))).
261 /// The function also updates UserChain to point to new subexpressions after
262 /// distributing s/zext. e.g., the old UserChain of the above example is
263 /// 5 -> b + 5 -> a + (b + 5) -> sext(...) -> zext(sext(...)),
264 /// and the new UserChain is
265 /// zext(sext(5)) -> zext(sext(b)) + zext(sext(5)) ->
266 /// zext(sext(a)) + (zext(sext(b)) + zext(sext(5))
268 /// \p ChainIndex The index to UserChain. ChainIndex is initially
269 /// UserChain.size() - 1, and is decremented during
271 Value *distributeExtsAndCloneChain(unsigned ChainIndex);
272 /// Reassociates the GEP index to the form I' + C and returns I'.
273 Value *removeConstOffset(unsigned ChainIndex);
274 /// A helper function to apply ExtInsts, a list of s/zext, to value V.
275 /// e.g., if ExtInsts = [sext i32 to i64, zext i16 to i32], this function
276 /// returns "sext i32 (zext i16 V to i32) to i64".
277 Value *applyExts(Value *V);
279 /// Returns true if LHS and RHS have no bits in common, i.e., LHS | RHS == 0.
280 bool NoCommonBits(Value *LHS, Value *RHS) const;
281 /// Computes which bits are known to be one or zero.
282 /// \p KnownOne Mask of all bits that are known to be one.
283 /// \p KnownZero Mask of all bits that are known to be zero.
284 void ComputeKnownBits(Value *V, APInt &KnownOne, APInt &KnownZero) const;
285 /// A helper function that returns whether we can trace into the operands
286 /// of binary operator BO for a constant offset.
288 /// \p SignExtended Whether BO is surrounded by sext
289 /// \p ZeroExtended Whether BO is surrounded by zext
290 /// \p NonNegative Whether BO is known to be non-negative, e.g., an in-bound
292 bool CanTraceInto(bool SignExtended, bool ZeroExtended, BinaryOperator *BO,
295 /// The path from the constant offset to the old GEP index. e.g., if the GEP
296 /// index is "a * b + (c + 5)". After running function find, UserChain[0] will
297 /// be the constant 5, UserChain[1] will be the subexpression "c + 5", and
298 /// UserChain[2] will be the entire expression "a * b + (c + 5)".
300 /// This path helps to rebuild the new GEP index.
301 SmallVector<User *, 8> UserChain;
302 /// A data structure used in rebuildWithoutConstOffset. Contains all
303 /// sext/zext instructions along UserChain.
304 SmallVector<CastInst *, 16> ExtInsts;
305 Instruction *IP; /// Insertion position of cloned instructions.
308 /// \brief A pass that tries to split every GEP in the function into a variadic
309 /// base and a constant offset. It is a FunctionPass because searching for the
310 /// constant offset may inspect other basic blocks.
311 class SeparateConstOffsetFromGEP : public FunctionPass {
314 SeparateConstOffsetFromGEP(const TargetMachine *TM = nullptr,
315 bool LowerGEP = false)
316 : FunctionPass(ID), TM(TM), LowerGEP(LowerGEP) {
317 initializeSeparateConstOffsetFromGEPPass(*PassRegistry::getPassRegistry());
320 void getAnalysisUsage(AnalysisUsage &AU) const override {
321 AU.addRequired<TargetTransformInfoWrapperPass>();
322 AU.setPreservesCFG();
325 bool runOnFunction(Function &F) override;
328 /// Tries to split the given GEP into a variadic base and a constant offset,
329 /// and returns true if the splitting succeeds.
330 bool splitGEP(GetElementPtrInst *GEP);
331 /// Lower a GEP with multiple indices into multiple GEPs with a single index.
332 /// Function splitGEP already split the original GEP into a variadic part and
333 /// a constant offset (i.e., AccumulativeByteOffset). This function lowers the
334 /// variadic part into a set of GEPs with a single index and applies
335 /// AccumulativeByteOffset to it.
336 /// \p Variadic The variadic part of the original GEP.
337 /// \p AccumulativeByteOffset The constant offset.
338 void lowerToSingleIndexGEPs(GetElementPtrInst *Variadic,
339 int64_t AccumulativeByteOffset);
340 /// Lower a GEP with multiple indices into ptrtoint+arithmetics+inttoptr form.
341 /// Function splitGEP already split the original GEP into a variadic part and
342 /// a constant offset (i.e., AccumulativeByteOffset). This function lowers the
343 /// variadic part into a set of arithmetic operations and applies
344 /// AccumulativeByteOffset to it.
345 /// \p Variadic The variadic part of the original GEP.
346 /// \p AccumulativeByteOffset The constant offset.
347 void lowerToArithmetics(GetElementPtrInst *Variadic,
348 int64_t AccumulativeByteOffset);
349 /// Finds the constant offset within each index and accumulates them. If
350 /// LowerGEP is true, it finds in indices of both sequential and structure
351 /// types, otherwise it only finds in sequential indices. The output
352 /// NeedsExtraction indicates whether we successfully find a non-zero constant
354 int64_t accumulateByteOffset(GetElementPtrInst *GEP, bool &NeedsExtraction);
355 /// Canonicalize array indices to pointer-size integers. This helps to
356 /// simplify the logic of splitting a GEP. For example, if a + b is a
357 /// pointer-size integer, we have
358 /// gep base, a + b = gep (gep base, a), b
359 /// However, this equality may not hold if the size of a + b is smaller than
360 /// the pointer size, because LLVM conceptually sign-extends GEP indices to
361 /// pointer size before computing the address
362 /// (http://llvm.org/docs/LangRef.html#id181).
364 /// This canonicalization is very likely already done in clang and
365 /// instcombine. Therefore, the program will probably remain the same.
367 /// Returns true if the module changes.
369 /// Verified in @i32_add in split-gep.ll
370 bool canonicalizeArrayIndicesToPointerSize(GetElementPtrInst *GEP);
371 /// Verify F is free of dead code.
372 void verifyNoDeadCode(Function &F);
374 const TargetMachine *TM;
375 /// Whether to lower a GEP with multiple indices into arithmetic operations or
376 /// multiple GEPs with a single index.
379 } // anonymous namespace
381 char SeparateConstOffsetFromGEP::ID = 0;
382 INITIALIZE_PASS_BEGIN(
383 SeparateConstOffsetFromGEP, "separate-const-offset-from-gep",
384 "Split GEPs to a variadic base and a constant offset for better CSE", false,
386 INITIALIZE_PASS_DEPENDENCY(TargetTransformInfoWrapperPass)
388 SeparateConstOffsetFromGEP, "separate-const-offset-from-gep",
389 "Split GEPs to a variadic base and a constant offset for better CSE", false,
393 llvm::createSeparateConstOffsetFromGEPPass(const TargetMachine *TM,
395 return new SeparateConstOffsetFromGEP(TM, LowerGEP);
398 bool ConstantOffsetExtractor::CanTraceInto(bool SignExtended,
402 // We only consider ADD, SUB and OR, because a non-zero constant found in
403 // expressions composed of these operations can be easily hoisted as a
404 // constant offset by reassociation.
405 if (BO->getOpcode() != Instruction::Add &&
406 BO->getOpcode() != Instruction::Sub &&
407 BO->getOpcode() != Instruction::Or) {
411 Value *LHS = BO->getOperand(0), *RHS = BO->getOperand(1);
412 // Do not trace into "or" unless it is equivalent to "add". If LHS and RHS
413 // don't have common bits, (LHS | RHS) is equivalent to (LHS + RHS).
414 if (BO->getOpcode() == Instruction::Or && !NoCommonBits(LHS, RHS))
417 // In addition, tracing into BO requires that its surrounding s/zext (if
418 // any) is distributable to both operands.
420 // Suppose BO = A op B.
421 // SignExtended | ZeroExtended | Distributable?
422 // --------------+--------------+----------------------------------
423 // 0 | 0 | true because no s/zext exists
424 // 0 | 1 | zext(BO) == zext(A) op zext(B)
425 // 1 | 0 | sext(BO) == sext(A) op sext(B)
426 // 1 | 1 | zext(sext(BO)) ==
427 // | | zext(sext(A)) op zext(sext(B))
428 if (BO->getOpcode() == Instruction::Add && !ZeroExtended && NonNegative) {
429 // If a + b >= 0 and (a >= 0 or b >= 0), then
430 // sext(a + b) = sext(a) + sext(b)
431 // even if the addition is not marked nsw.
433 // Leveraging this invarient, we can trace into an sext'ed inbound GEP
434 // index if the constant offset is non-negative.
436 // Verified in @sext_add in split-gep.ll.
437 if (ConstantInt *ConstLHS = dyn_cast<ConstantInt>(LHS)) {
438 if (!ConstLHS->isNegative())
441 if (ConstantInt *ConstRHS = dyn_cast<ConstantInt>(RHS)) {
442 if (!ConstRHS->isNegative())
447 // sext (add/sub nsw A, B) == add/sub nsw (sext A), (sext B)
448 // zext (add/sub nuw A, B) == add/sub nuw (zext A), (zext B)
449 if (BO->getOpcode() == Instruction::Add ||
450 BO->getOpcode() == Instruction::Sub) {
451 if (SignExtended && !BO->hasNoSignedWrap())
453 if (ZeroExtended && !BO->hasNoUnsignedWrap())
460 APInt ConstantOffsetExtractor::findInEitherOperand(BinaryOperator *BO,
463 // BO being non-negative does not shed light on whether its operands are
464 // non-negative. Clear the NonNegative flag here.
465 APInt ConstantOffset = find(BO->getOperand(0), SignExtended, ZeroExtended,
466 /* NonNegative */ false);
467 // If we found a constant offset in the left operand, stop and return that.
468 // This shortcut might cause us to miss opportunities of combining the
469 // constant offsets in both operands, e.g., (a + 4) + (b + 5) => (a + b) + 9.
470 // However, such cases are probably already handled by -instcombine,
471 // given this pass runs after the standard optimizations.
472 if (ConstantOffset != 0) return ConstantOffset;
473 ConstantOffset = find(BO->getOperand(1), SignExtended, ZeroExtended,
474 /* NonNegative */ false);
475 // If U is a sub operator, negate the constant offset found in the right
477 if (BO->getOpcode() == Instruction::Sub)
478 ConstantOffset = -ConstantOffset;
479 return ConstantOffset;
482 APInt ConstantOffsetExtractor::find(Value *V, bool SignExtended,
483 bool ZeroExtended, bool NonNegative) {
484 // TODO(jingyue): We could trace into integer/pointer casts, such as
485 // inttoptr, ptrtoint, bitcast, and addrspacecast. We choose to handle only
486 // integers because it gives good enough results for our benchmarks.
487 unsigned BitWidth = cast<IntegerType>(V->getType())->getBitWidth();
489 // We cannot do much with Values that are not a User, such as an Argument.
490 User *U = dyn_cast<User>(V);
491 if (U == nullptr) return APInt(BitWidth, 0);
493 APInt ConstantOffset(BitWidth, 0);
494 if (ConstantInt *CI = dyn_cast<ConstantInt>(V)) {
495 // Hooray, we found it!
496 ConstantOffset = CI->getValue();
497 } else if (BinaryOperator *BO = dyn_cast<BinaryOperator>(V)) {
498 // Trace into subexpressions for more hoisting opportunities.
499 if (CanTraceInto(SignExtended, ZeroExtended, BO, NonNegative)) {
500 ConstantOffset = findInEitherOperand(BO, SignExtended, ZeroExtended);
502 } else if (isa<SExtInst>(V)) {
503 ConstantOffset = find(U->getOperand(0), /* SignExtended */ true,
504 ZeroExtended, NonNegative).sext(BitWidth);
505 } else if (isa<ZExtInst>(V)) {
506 // As an optimization, we can clear the SignExtended flag because
507 // sext(zext(a)) = zext(a). Verified in @sext_zext in split-gep.ll.
509 // Clear the NonNegative flag, because zext(a) >= 0 does not imply a >= 0.
511 find(U->getOperand(0), /* SignExtended */ false,
512 /* ZeroExtended */ true, /* NonNegative */ false).zext(BitWidth);
515 // If we found a non-zero constant offset, add it to the path for
516 // rebuildWithoutConstOffset. Zero is a valid constant offset, but doesn't
517 // help this optimization.
518 if (ConstantOffset != 0)
519 UserChain.push_back(U);
520 return ConstantOffset;
523 Value *ConstantOffsetExtractor::applyExts(Value *V) {
525 // ExtInsts is built in the use-def order. Therefore, we apply them to V
526 // in the reversed order.
527 for (auto I = ExtInsts.rbegin(), E = ExtInsts.rend(); I != E; ++I) {
528 if (Constant *C = dyn_cast<Constant>(Current)) {
529 // If Current is a constant, apply s/zext using ConstantExpr::getCast.
530 // ConstantExpr::getCast emits a ConstantInt if C is a ConstantInt.
531 Current = ConstantExpr::getCast((*I)->getOpcode(), C, (*I)->getType());
533 Instruction *Ext = (*I)->clone();
534 Ext->setOperand(0, Current);
535 Ext->insertBefore(IP);
542 Value *ConstantOffsetExtractor::rebuildWithoutConstOffset() {
543 distributeExtsAndCloneChain(UserChain.size() - 1);
544 // Remove all nullptrs (used to be s/zext) from UserChain.
545 unsigned NewSize = 0;
546 for (auto I = UserChain.begin(), E = UserChain.end(); I != E; ++I) {
548 UserChain[NewSize] = *I;
552 UserChain.resize(NewSize);
553 return removeConstOffset(UserChain.size() - 1);
557 ConstantOffsetExtractor::distributeExtsAndCloneChain(unsigned ChainIndex) {
558 User *U = UserChain[ChainIndex];
559 if (ChainIndex == 0) {
560 assert(isa<ConstantInt>(U));
561 // If U is a ConstantInt, applyExts will return a ConstantInt as well.
562 return UserChain[ChainIndex] = cast<ConstantInt>(applyExts(U));
565 if (CastInst *Cast = dyn_cast<CastInst>(U)) {
566 assert((isa<SExtInst>(Cast) || isa<ZExtInst>(Cast)) &&
567 "We only traced into two types of CastInst: sext and zext");
568 ExtInsts.push_back(Cast);
569 UserChain[ChainIndex] = nullptr;
570 return distributeExtsAndCloneChain(ChainIndex - 1);
573 // Function find only trace into BinaryOperator and CastInst.
574 BinaryOperator *BO = cast<BinaryOperator>(U);
575 // OpNo = which operand of BO is UserChain[ChainIndex - 1]
576 unsigned OpNo = (BO->getOperand(0) == UserChain[ChainIndex - 1] ? 0 : 1);
577 Value *TheOther = applyExts(BO->getOperand(1 - OpNo));
578 Value *NextInChain = distributeExtsAndCloneChain(ChainIndex - 1);
580 BinaryOperator *NewBO = nullptr;
582 NewBO = BinaryOperator::Create(BO->getOpcode(), NextInChain, TheOther,
585 NewBO = BinaryOperator::Create(BO->getOpcode(), TheOther, NextInChain,
588 return UserChain[ChainIndex] = NewBO;
591 Value *ConstantOffsetExtractor::removeConstOffset(unsigned ChainIndex) {
592 if (ChainIndex == 0) {
593 assert(isa<ConstantInt>(UserChain[ChainIndex]));
594 return ConstantInt::getNullValue(UserChain[ChainIndex]->getType());
597 BinaryOperator *BO = cast<BinaryOperator>(UserChain[ChainIndex]);
598 assert(BO->getNumUses() <= 1 &&
599 "distributeExtsAndCloneChain clones each BinaryOperator in "
600 "UserChain, so no one should be used more than "
603 unsigned OpNo = (BO->getOperand(0) == UserChain[ChainIndex - 1] ? 0 : 1);
604 assert(BO->getOperand(OpNo) == UserChain[ChainIndex - 1]);
605 Value *NextInChain = removeConstOffset(ChainIndex - 1);
606 Value *TheOther = BO->getOperand(1 - OpNo);
608 // If NextInChain is 0 and not the LHS of a sub, we can simplify the
609 // sub-expression to be just TheOther.
610 if (ConstantInt *CI = dyn_cast<ConstantInt>(NextInChain)) {
611 if (CI->isZero() && !(BO->getOpcode() == Instruction::Sub && OpNo == 0))
615 BinaryOperator::BinaryOps NewOp = BO->getOpcode();
616 if (BO->getOpcode() == Instruction::Or) {
617 // Rebuild "or" as "add", because "or" may be invalid for the new
620 // For instance, given
621 // a | (b + 5) where a and b + 5 have no common bits,
622 // we can extract 5 as the constant offset.
624 // However, reusing the "or" in the new index would give us
626 // which does not equal a | (b + 5).
628 // Replacing the "or" with "add" is fine, because
629 // a | (b + 5) = a + (b + 5) = (a + b) + 5
630 NewOp = Instruction::Add;
633 BinaryOperator *NewBO;
635 NewBO = BinaryOperator::Create(NewOp, NextInChain, TheOther, "", IP);
637 NewBO = BinaryOperator::Create(NewOp, TheOther, NextInChain, "", IP);
643 Value *ConstantOffsetExtractor::Extract(Value *Idx, GetElementPtrInst *GEP,
644 User *&UserChainTail) {
645 ConstantOffsetExtractor Extractor(GEP);
646 // Find a non-zero constant offset first.
647 APInt ConstantOffset =
648 Extractor.find(Idx, /* SignExtended */ false, /* ZeroExtended */ false,
650 if (ConstantOffset == 0) {
651 UserChainTail = nullptr;
654 // Separates the constant offset from the GEP index.
655 Value *IdxWithoutConstOffset = Extractor.rebuildWithoutConstOffset();
656 UserChainTail = Extractor.UserChain.back();
657 return IdxWithoutConstOffset;
660 int64_t ConstantOffsetExtractor::Find(Value *Idx, GetElementPtrInst *GEP) {
661 // If Idx is an index of an inbound GEP, Idx is guaranteed to be non-negative.
662 return ConstantOffsetExtractor(GEP)
663 .find(Idx, /* SignExtended */ false, /* ZeroExtended */ false,
668 void ConstantOffsetExtractor::ComputeKnownBits(Value *V, APInt &KnownOne,
669 APInt &KnownZero) const {
670 IntegerType *IT = cast<IntegerType>(V->getType());
671 KnownOne = APInt(IT->getBitWidth(), 0);
672 KnownZero = APInt(IT->getBitWidth(), 0);
673 const DataLayout &DL = IP->getModule()->getDataLayout();
674 llvm::computeKnownBits(V, KnownZero, KnownOne, DL, 0);
677 bool ConstantOffsetExtractor::NoCommonBits(Value *LHS, Value *RHS) const {
678 assert(LHS->getType() == RHS->getType() &&
679 "LHS and RHS should have the same type");
680 APInt LHSKnownOne, LHSKnownZero, RHSKnownOne, RHSKnownZero;
681 ComputeKnownBits(LHS, LHSKnownOne, LHSKnownZero);
682 ComputeKnownBits(RHS, RHSKnownOne, RHSKnownZero);
683 return (LHSKnownZero | RHSKnownZero).isAllOnesValue();
686 bool SeparateConstOffsetFromGEP::canonicalizeArrayIndicesToPointerSize(
687 GetElementPtrInst *GEP) {
688 bool Changed = false;
689 const DataLayout &DL = GEP->getModule()->getDataLayout();
690 Type *IntPtrTy = DL.getIntPtrType(GEP->getType());
691 gep_type_iterator GTI = gep_type_begin(*GEP);
692 for (User::op_iterator I = GEP->op_begin() + 1, E = GEP->op_end();
693 I != E; ++I, ++GTI) {
694 // Skip struct member indices which must be i32.
695 if (isa<SequentialType>(*GTI)) {
696 if ((*I)->getType() != IntPtrTy) {
697 *I = CastInst::CreateIntegerCast(*I, IntPtrTy, true, "idxprom", GEP);
706 SeparateConstOffsetFromGEP::accumulateByteOffset(GetElementPtrInst *GEP,
707 bool &NeedsExtraction) {
708 NeedsExtraction = false;
709 int64_t AccumulativeByteOffset = 0;
710 gep_type_iterator GTI = gep_type_begin(*GEP);
711 const DataLayout &DL = GEP->getModule()->getDataLayout();
712 for (unsigned I = 1, E = GEP->getNumOperands(); I != E; ++I, ++GTI) {
713 if (isa<SequentialType>(*GTI)) {
714 // Tries to extract a constant offset from this GEP index.
715 int64_t ConstantOffset =
716 ConstantOffsetExtractor::Find(GEP->getOperand(I), GEP);
717 if (ConstantOffset != 0) {
718 NeedsExtraction = true;
719 // A GEP may have multiple indices. We accumulate the extracted
720 // constant offset to a byte offset, and later offset the remainder of
721 // the original GEP with this byte offset.
722 AccumulativeByteOffset +=
723 ConstantOffset * DL.getTypeAllocSize(GTI.getIndexedType());
725 } else if (LowerGEP) {
726 StructType *StTy = cast<StructType>(*GTI);
727 uint64_t Field = cast<ConstantInt>(GEP->getOperand(I))->getZExtValue();
728 // Skip field 0 as the offset is always 0.
730 NeedsExtraction = true;
731 AccumulativeByteOffset +=
732 DL.getStructLayout(StTy)->getElementOffset(Field);
736 return AccumulativeByteOffset;
739 void SeparateConstOffsetFromGEP::lowerToSingleIndexGEPs(
740 GetElementPtrInst *Variadic, int64_t AccumulativeByteOffset) {
741 IRBuilder<> Builder(Variadic);
742 const DataLayout &DL = Variadic->getModule()->getDataLayout();
743 Type *IntPtrTy = DL.getIntPtrType(Variadic->getType());
746 Builder.getInt8PtrTy(Variadic->getType()->getPointerAddressSpace());
747 Value *ResultPtr = Variadic->getOperand(0);
748 if (ResultPtr->getType() != I8PtrTy)
749 ResultPtr = Builder.CreateBitCast(ResultPtr, I8PtrTy);
751 gep_type_iterator GTI = gep_type_begin(*Variadic);
752 // Create an ugly GEP for each sequential index. We don't create GEPs for
753 // structure indices, as they are accumulated in the constant offset index.
754 for (unsigned I = 1, E = Variadic->getNumOperands(); I != E; ++I, ++GTI) {
755 if (isa<SequentialType>(*GTI)) {
756 Value *Idx = Variadic->getOperand(I);
757 // Skip zero indices.
758 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx))
762 APInt ElementSize = APInt(IntPtrTy->getIntegerBitWidth(),
763 DL.getTypeAllocSize(GTI.getIndexedType()));
764 // Scale the index by element size.
765 if (ElementSize != 1) {
766 if (ElementSize.isPowerOf2()) {
767 Idx = Builder.CreateShl(
768 Idx, ConstantInt::get(IntPtrTy, ElementSize.logBase2()));
770 Idx = Builder.CreateMul(Idx, ConstantInt::get(IntPtrTy, ElementSize));
773 // Create an ugly GEP with a single index for each index.
775 Builder.CreateGEP(Builder.getInt8Ty(), ResultPtr, Idx, "uglygep");
779 // Create a GEP with the constant offset index.
780 if (AccumulativeByteOffset != 0) {
781 Value *Offset = ConstantInt::get(IntPtrTy, AccumulativeByteOffset);
783 Builder.CreateGEP(Builder.getInt8Ty(), ResultPtr, Offset, "uglygep");
785 if (ResultPtr->getType() != Variadic->getType())
786 ResultPtr = Builder.CreateBitCast(ResultPtr, Variadic->getType());
788 Variadic->replaceAllUsesWith(ResultPtr);
789 Variadic->eraseFromParent();
793 SeparateConstOffsetFromGEP::lowerToArithmetics(GetElementPtrInst *Variadic,
794 int64_t AccumulativeByteOffset) {
795 IRBuilder<> Builder(Variadic);
796 const DataLayout &DL = Variadic->getModule()->getDataLayout();
797 Type *IntPtrTy = DL.getIntPtrType(Variadic->getType());
799 Value *ResultPtr = Builder.CreatePtrToInt(Variadic->getOperand(0), IntPtrTy);
800 gep_type_iterator GTI = gep_type_begin(*Variadic);
801 // Create ADD/SHL/MUL arithmetic operations for each sequential indices. We
802 // don't create arithmetics for structure indices, as they are accumulated
803 // in the constant offset index.
804 for (unsigned I = 1, E = Variadic->getNumOperands(); I != E; ++I, ++GTI) {
805 if (isa<SequentialType>(*GTI)) {
806 Value *Idx = Variadic->getOperand(I);
807 // Skip zero indices.
808 if (ConstantInt *CI = dyn_cast<ConstantInt>(Idx))
812 APInt ElementSize = APInt(IntPtrTy->getIntegerBitWidth(),
813 DL.getTypeAllocSize(GTI.getIndexedType()));
814 // Scale the index by element size.
815 if (ElementSize != 1) {
816 if (ElementSize.isPowerOf2()) {
817 Idx = Builder.CreateShl(
818 Idx, ConstantInt::get(IntPtrTy, ElementSize.logBase2()));
820 Idx = Builder.CreateMul(Idx, ConstantInt::get(IntPtrTy, ElementSize));
823 // Create an ADD for each index.
824 ResultPtr = Builder.CreateAdd(ResultPtr, Idx);
828 // Create an ADD for the constant offset index.
829 if (AccumulativeByteOffset != 0) {
830 ResultPtr = Builder.CreateAdd(
831 ResultPtr, ConstantInt::get(IntPtrTy, AccumulativeByteOffset));
834 ResultPtr = Builder.CreateIntToPtr(ResultPtr, Variadic->getType());
835 Variadic->replaceAllUsesWith(ResultPtr);
836 Variadic->eraseFromParent();
839 bool SeparateConstOffsetFromGEP::splitGEP(GetElementPtrInst *GEP) {
841 if (GEP->getType()->isVectorTy())
844 // The backend can already nicely handle the case where all indices are
846 if (GEP->hasAllConstantIndices())
849 bool Changed = canonicalizeArrayIndicesToPointerSize(GEP);
851 bool NeedsExtraction;
852 int64_t AccumulativeByteOffset = accumulateByteOffset(GEP, NeedsExtraction);
854 if (!NeedsExtraction)
856 // If LowerGEP is disabled, before really splitting the GEP, check whether the
857 // backend supports the addressing mode we are about to produce. If no, this
858 // splitting probably won't be beneficial.
859 // If LowerGEP is enabled, even the extracted constant offset can not match
860 // the addressing mode, we can still do optimizations to other lowered parts
861 // of variable indices. Therefore, we don't check for addressing modes in that
864 TargetTransformInfo &TTI =
865 getAnalysis<TargetTransformInfoWrapperPass>().getTTI(
866 *GEP->getParent()->getParent());
867 if (!TTI.isLegalAddressingMode(GEP->getType()->getElementType(),
868 /*BaseGV=*/nullptr, AccumulativeByteOffset,
869 /*HasBaseReg=*/true, /*Scale=*/0)) {
874 // Remove the constant offset in each sequential index. The resultant GEP
875 // computes the variadic base.
876 // Notice that we don't remove struct field indices here. If LowerGEP is
877 // disabled, a structure index is not accumulated and we still use the old
878 // one. If LowerGEP is enabled, a structure index is accumulated in the
879 // constant offset. LowerToSingleIndexGEPs or lowerToArithmetics will later
880 // handle the constant offset and won't need a new structure index.
881 gep_type_iterator GTI = gep_type_begin(*GEP);
882 for (unsigned I = 1, E = GEP->getNumOperands(); I != E; ++I, ++GTI) {
883 if (isa<SequentialType>(*GTI)) {
884 // Splits this GEP index into a variadic part and a constant offset, and
885 // uses the variadic part as the new index.
886 Value *OldIdx = GEP->getOperand(I);
889 ConstantOffsetExtractor::Extract(OldIdx, GEP, UserChainTail);
890 if (NewIdx != nullptr) {
891 // Switches to the index with the constant offset removed.
892 GEP->setOperand(I, NewIdx);
893 // After switching to the new index, we can garbage-collect UserChain
894 // and the old index if they are not used.
895 RecursivelyDeleteTriviallyDeadInstructions(UserChainTail);
896 RecursivelyDeleteTriviallyDeadInstructions(OldIdx);
901 // Clear the inbounds attribute because the new index may be off-bound.
905 // addr = gep inbounds float* p, i64 b
907 // is transformed to:
909 // addr2 = gep float* p, i64 a
910 // addr = gep float* addr2, i64 5
912 // If a is -4, although the old index b is in bounds, the new index a is
913 // off-bound. http://llvm.org/docs/LangRef.html#id181 says "if the
914 // inbounds keyword is not present, the offsets are added to the base
915 // address with silently-wrapping two's complement arithmetic".
916 // Therefore, the final code will be a semantically equivalent.
918 // TODO(jingyue): do some range analysis to keep as many inbounds as
919 // possible. GEPs with inbounds are more friendly to alias analysis.
920 GEP->setIsInBounds(false);
922 // Lowers a GEP to either GEPs with a single index or arithmetic operations.
924 // As currently BasicAA does not analyze ptrtoint/inttoptr, do not lower to
925 // arithmetic operations if the target uses alias analysis in codegen.
926 if (TM && TM->getSubtargetImpl(*GEP->getParent()->getParent())->useAA())
927 lowerToSingleIndexGEPs(GEP, AccumulativeByteOffset);
929 lowerToArithmetics(GEP, AccumulativeByteOffset);
933 // No need to create another GEP if the accumulative byte offset is 0.
934 if (AccumulativeByteOffset == 0)
937 // Offsets the base with the accumulative byte offset.
944 // %gep2 ; clone of %gep
945 // %new.gep = gep %gep2, <offset / sizeof(*%gep)>
946 // %gep ; will be removed
949 // => replace all uses of %gep with %new.gep and remove %gep
951 // %gep2 ; clone of %gep
952 // %new.gep = gep %gep2, <offset / sizeof(*%gep)>
955 // If AccumulativeByteOffset is not a multiple of sizeof(*%gep), we emit an
956 // uglygep (http://llvm.org/docs/GetElementPtr.html#what-s-an-uglygep):
957 // bitcast %gep2 to i8*, add the offset, and bitcast the result back to the
960 // %gep2 ; clone of %gep
961 // %0 = bitcast %gep2 to i8*
962 // %uglygep = gep %0, <offset>
963 // %new.gep = bitcast %uglygep to <type of %gep>
965 Instruction *NewGEP = GEP->clone();
966 NewGEP->insertBefore(GEP);
968 // Per ANSI C standard, signed / unsigned = unsigned and signed % unsigned =
969 // unsigned.. Therefore, we cast ElementTypeSizeOfGEP to signed because it is
970 // used with unsigned integers later.
971 const DataLayout &DL = GEP->getModule()->getDataLayout();
972 int64_t ElementTypeSizeOfGEP = static_cast<int64_t>(
973 DL.getTypeAllocSize(GEP->getType()->getElementType()));
974 Type *IntPtrTy = DL.getIntPtrType(GEP->getType());
975 if (AccumulativeByteOffset % ElementTypeSizeOfGEP == 0) {
976 // Very likely. As long as %gep is natually aligned, the byte offset we
977 // extracted should be a multiple of sizeof(*%gep).
978 int64_t Index = AccumulativeByteOffset / ElementTypeSizeOfGEP;
979 NewGEP = GetElementPtrInst::Create(GEP->getResultElementType(), NewGEP,
980 ConstantInt::get(IntPtrTy, Index, true),
981 GEP->getName(), GEP);
983 // Unlikely but possible. For example,
991 // Suppose the gep before extraction is &s[i + 1].b[j + 3]. After
992 // extraction, it becomes &s[i].b[j] and AccumulativeByteOffset is
993 // sizeof(S) + 3 * sizeof(int64) = 100, which is not a multiple of
996 // Emit an uglygep in this case.
997 Type *I8PtrTy = Type::getInt8PtrTy(GEP->getContext(),
998 GEP->getPointerAddressSpace());
999 NewGEP = new BitCastInst(NewGEP, I8PtrTy, "", GEP);
1000 NewGEP = GetElementPtrInst::Create(
1001 Type::getInt8Ty(GEP->getContext()), NewGEP,
1002 ConstantInt::get(IntPtrTy, AccumulativeByteOffset, true), "uglygep",
1004 if (GEP->getType() != I8PtrTy)
1005 NewGEP = new BitCastInst(NewGEP, GEP->getType(), GEP->getName(), GEP);
1008 GEP->replaceAllUsesWith(NewGEP);
1009 GEP->eraseFromParent();
1014 bool SeparateConstOffsetFromGEP::runOnFunction(Function &F) {
1015 if (skipOptnoneFunction(F))
1018 if (DisableSeparateConstOffsetFromGEP)
1021 bool Changed = false;
1022 for (Function::iterator B = F.begin(), BE = F.end(); B != BE; ++B) {
1023 for (BasicBlock::iterator I = B->begin(), IE = B->end(); I != IE; ) {
1024 if (GetElementPtrInst *GEP = dyn_cast<GetElementPtrInst>(I++)) {
1025 Changed |= splitGEP(GEP);
1027 // No need to split GEP ConstantExprs because all its indices are constant
1032 if (VerifyNoDeadCode)
1033 verifyNoDeadCode(F);
1038 void SeparateConstOffsetFromGEP::verifyNoDeadCode(Function &F) {
1041 if (isInstructionTriviallyDead(&I)) {
1042 std::string ErrMessage;
1043 raw_string_ostream RSO(ErrMessage);
1044 RSO << "Dead instruction detected!\n" << I << "\n";
1045 llvm_unreachable(RSO.str().c_str());