blob: 132c3920397f3a624c0546464dbf442a4be445a9 [file] [log] [blame]
Chris Lattner51cbcbf2002-11-20 20:47:41 +00001//===- ValueMapper.cpp - Interface shared by lib/Transforms/Utils ---------===//
Misha Brukmanfd939082005-04-21 23:48:37 +00002//
John Criswellb576c942003-10-20 19:43:21 +00003// The LLVM Compiler Infrastructure
4//
Chris Lattner4ee451d2007-12-29 20:36:04 +00005// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
Misha Brukmanfd939082005-04-21 23:48:37 +00007//
John Criswellb576c942003-10-20 19:43:21 +00008//===----------------------------------------------------------------------===//
Chris Lattner51cbcbf2002-11-20 20:47:41 +00009//
10// This file defines the MapValue function, which is shared by various parts of
11// the lib/Transforms/Utils library.
12//
13//===----------------------------------------------------------------------===//
14
Dan Gohman05ea54e2010-08-24 18:50:07 +000015#include "llvm/Transforms/Utils/ValueMapper.h"
Chris Lattner839a0152010-01-21 21:29:25 +000016#include "llvm/Type.h"
Chris Lattner51cbcbf2002-11-20 20:47:41 +000017#include "llvm/Constants.h"
Chris Lattner1bb95912009-10-29 00:31:02 +000018#include "llvm/Function.h"
Devang Patel0a9f7b92009-07-28 21:49:47 +000019#include "llvm/Metadata.h"
Nick Lewycky7a0370f2009-05-30 05:06:04 +000020#include "llvm/ADT/SmallVector.h"
Chris Lattnerf7703df2004-01-09 06:12:26 +000021using namespace llvm;
Chris Lattner51cbcbf2002-11-20 20:47:41 +000022
Dan Gohman6cb8c232010-08-26 15:41:53 +000023Value *llvm::MapValue(const Value *V, ValueToValueMapTy &VM,
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000024 RemapFlags Flags) {
25 ValueToValueMapTy::iterator I = VM.find(V);
Chris Lattner5e665f52007-02-03 00:08:31 +000026
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000027 // If the value already exists in the map, use it.
28 if (I != VM.end() && I->second) return I->second;
29
Dan Gohman6cb8c232010-08-26 15:41:53 +000030 // Global values do not need to be seeded into the VM if they
31 // are using the identity mapping.
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000032 if (isa<GlobalValue>(V) || isa<InlineAsm>(V) || isa<MDString>(V))
33 return VM[V] = const_cast<Value*>(V);
Chris Lattner5f92e2b2003-10-06 15:23:43 +000034
Chris Lattner1b3ef342010-01-21 21:05:54 +000035 if (const MDNode *MD = dyn_cast<MDNode>(V)) {
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000036 // If this is a module-level metadata and we know that nothing at the module
37 // level is changing, then use an identity mapping.
38 if (!MD->isFunctionLocal() && (Flags & RF_NoModuleLevelChanges))
39 return VM[V] = const_cast<Value*>(V);
40
Dan Gohman6cb8c232010-08-26 15:41:53 +000041 // Check all operands to see if any need to be remapped.
42 for (unsigned i = 0, e = MD->getNumOperands(); i != e; ++i) {
43 Value *OP = MD->getOperand(i);
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000044 if (OP == 0 || MapValue(OP, VM, Flags) == OP) continue;
Dan Gohman6cb8c232010-08-26 15:41:53 +000045
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000046 // Ok, at least one operand needs remapping. Create a dummy node in case
47 // we have a metadata cycle.
Dan Gohman6cb8c232010-08-26 15:41:53 +000048 MDNode *Dummy = MDNode::getTemporary(V->getContext(), 0, 0);
49 VM[V] = Dummy;
50 SmallVector<Value*, 4> Elts;
51 Elts.reserve(MD->getNumOperands());
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000052 for (i = 0; i != e; ++i) {
53 Value *Op = MD->getOperand(i);
54 Elts.push_back(Op ? MapValue(Op, VM, Flags) : 0);
55 }
Dan Gohman6cb8c232010-08-26 15:41:53 +000056 MDNode *NewMD = MDNode::get(V->getContext(), Elts.data(), Elts.size());
57 Dummy->replaceAllUsesWith(NewMD);
58 MDNode::deleteTemporary(Dummy);
59 return VM[V] = NewMD;
60 }
61
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000062 // No operands needed remapping. Use an identity mapping.
63 return VM[V] = const_cast<Value*>(V);
Victor Hernandezf58c34d2010-01-20 05:49:59 +000064 }
65
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000066 // Okay, this either must be a constant (which may or may not be mappable) or
67 // is something that is not in the mapping table.
Chris Lattner77488cc2009-10-29 00:28:30 +000068 Constant *C = const_cast<Constant*>(dyn_cast<Constant>(V));
Dan Gohman6cb8c232010-08-26 15:41:53 +000069 if (C == 0)
70 return 0;
Chris Lattner77488cc2009-10-29 00:28:30 +000071
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000072 if (BlockAddress *BA = dyn_cast<BlockAddress>(C)) {
73 Function *F = cast<Function>(MapValue(BA->getFunction(), VM, Flags));
74 BasicBlock *BB = cast_or_null<BasicBlock>(MapValue(BA->getBasicBlock(), VM,
75 Flags));
76 return VM[V] = BlockAddress::get(F, BB ? BB : BA->getBasicBlock());
Chris Lattner51cbcbf2002-11-20 20:47:41 +000077 }
Chris Lattner77488cc2009-10-29 00:28:30 +000078
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000079 for (unsigned i = 0, e = C->getNumOperands(); i != e; ++i) {
80 Value *Op = C->getOperand(i);
81 Value *Mapped = MapValue(Op, VM, Flags);
82 if (Mapped == C) continue;
83
84 // Okay, the operands don't all match. We've already processed some or all
85 // of the operands, set them up now.
Chris Lattner77488cc2009-10-29 00:28:30 +000086 std::vector<Constant*> Ops;
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +000087 Ops.reserve(C->getNumOperands());
88 for (unsigned j = 0; j != i; ++j)
89 Ops.push_back(cast<Constant>(C->getOperand(i)));
90 Ops.push_back(cast<Constant>(Mapped));
91
92 // Map the rest of the operands that aren't processed yet.
93 for (++i; i != e; ++i)
94 Ops.push_back(cast<Constant>(MapValue(C->getOperand(i), VM, Flags)));
95
96 if (ConstantExpr *CE = dyn_cast<ConstantExpr>(C))
97 return VM[V] = CE->getWithOperands(Ops);
98 if (ConstantArray *CA = dyn_cast<ConstantArray>(C))
99 return VM[V] = ConstantArray::get(CA->getType(), Ops);
100 if (ConstantStruct *CS = dyn_cast<ConstantStruct>(C))
101 return VM[V] = ConstantStruct::get(CS->getType(), Ops);
102 assert(isa<ConstantVector>(C) && "Unknown mapped constant type");
103 return VM[V] = ConstantVector::get(Ops);
Chris Lattner77488cc2009-10-29 00:28:30 +0000104 }
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +0000105
106 // If we reach here, all of the operands of the constant match.
107 return VM[V] = C;
Chris Lattner51cbcbf2002-11-20 20:47:41 +0000108}
Brian Gaeke6129af32004-05-19 09:08:12 +0000109
110/// RemapInstruction - Convert the instruction operands from referencing the
Devang Patel29d3dd82010-06-23 23:55:51 +0000111/// current values into those specified by VMap.
Brian Gaeke6129af32004-05-19 09:08:12 +0000112///
Dan Gohman6cb8c232010-08-26 15:41:53 +0000113void llvm::RemapInstruction(Instruction *I, ValueToValueMapTy &VMap,
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +0000114 RemapFlags Flags) {
Dan Gohman6cb8c232010-08-26 15:41:53 +0000115 // Remap operands.
Gabor Greifba2c4872008-05-30 21:24:22 +0000116 for (User::op_iterator op = I->op_begin(), E = I->op_end(); op != E; ++op) {
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +0000117 Value *V = MapValue(*op, VMap, Flags);
118 // If we aren't ignoring missing entries, assert that something happened.
119 if (V != 0)
120 *op = V;
121 else
122 assert((Flags & RF_IgnoreMissingEntries) &&
123 "Referenced value not in value map!");
Brian Gaeke6129af32004-05-19 09:08:12 +0000124 }
Daniel Dunbarfd406f12010-08-26 03:48:08 +0000125
Dan Gohman6cb8c232010-08-26 15:41:53 +0000126 // Remap attached metadata.
127 SmallVector<std::pair<unsigned, MDNode *>, 4> MDs;
128 I->getAllMetadata(MDs);
129 for (SmallVectorImpl<std::pair<unsigned, MDNode *> >::iterator
130 MI = MDs.begin(), ME = MDs.end(); MI != ME; ++MI) {
131 Value *Old = MI->second;
Chris Lattnerb5fa5fc2011-01-08 08:15:20 +0000132 Value *New = MapValue(Old, VMap, Flags);
Dan Gohman6cb8c232010-08-26 15:41:53 +0000133 if (New != Old)
134 I->setMetadata(MI->first, cast<MDNode>(New));
135 }
136}