1 //===-- Metadata.cpp - Implement Metadata classes -------------------------===//
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 implements the Metadata classes.
12 //===----------------------------------------------------------------------===//
14 #include "llvm/IR/Metadata.h"
15 #include "LLVMContextImpl.h"
16 #include "SymbolTableListTraitsImpl.h"
17 #include "llvm/ADT/DenseMap.h"
18 #include "llvm/ADT/STLExtras.h"
19 #include "llvm/ADT/SmallSet.h"
20 #include "llvm/ADT/SmallString.h"
21 #include "llvm/ADT/StringMap.h"
22 #include "llvm/IR/ConstantRange.h"
23 #include "llvm/IR/Instruction.h"
24 #include "llvm/IR/LLVMContext.h"
25 #include "llvm/IR/Module.h"
26 #include "llvm/IR/ValueHandle.h"
30 MetadataAsValue::MetadataAsValue(Type *Ty, Metadata *MD)
31 : Value(Ty, MetadataAsValueVal), MD(MD) {
35 MetadataAsValue::~MetadataAsValue() {
36 getType()->getContext().pImpl->MetadataAsValues.erase(MD);
40 /// \brief Canonicalize metadata arguments to intrinsics.
42 /// To support bitcode upgrades (and assembly semantic sugar) for \a
43 /// MetadataAsValue, we need to canonicalize certain metadata.
45 /// - nullptr is replaced by an empty MDNode.
46 /// - An MDNode with a single null operand is replaced by an empty MDNode.
47 /// - An MDNode whose only operand is a \a ConstantAsMetadata gets skipped.
49 /// This maintains readability of bitcode from when metadata was a type of
50 /// value, and these bridges were unnecessary.
51 static Metadata *canonicalizeMetadataForValue(LLVMContext &Context,
55 return MDNode::get(Context, None);
57 // Return early if this isn't a single-operand MDNode.
58 auto *N = dyn_cast<MDNode>(MD);
59 if (!N || N->getNumOperands() != 1)
62 if (!N->getOperand(0))
64 return MDNode::get(Context, None);
66 if (auto *C = dyn_cast<ConstantAsMetadata>(N->getOperand(0)))
67 // Look through the MDNode.
73 MetadataAsValue *MetadataAsValue::get(LLVMContext &Context, Metadata *MD) {
74 MD = canonicalizeMetadataForValue(Context, MD);
75 auto *&Entry = Context.pImpl->MetadataAsValues[MD];
77 Entry = new MetadataAsValue(Type::getMetadataTy(Context), MD);
81 MetadataAsValue *MetadataAsValue::getIfExists(LLVMContext &Context,
83 MD = canonicalizeMetadataForValue(Context, MD);
84 auto &Store = Context.pImpl->MetadataAsValues;
85 auto I = Store.find(MD);
86 return I == Store.end() ? nullptr : I->second;
89 void MetadataAsValue::handleChangedMetadata(Metadata *MD) {
90 LLVMContext &Context = getContext();
91 MD = canonicalizeMetadataForValue(Context, MD);
92 auto &Store = Context.pImpl->MetadataAsValues;
94 // Stop tracking the old metadata.
95 Store.erase(this->MD);
99 // Start tracking MD, or RAUW if necessary.
100 auto *&Entry = Store[MD];
102 replaceAllUsesWith(Entry);
112 void MetadataAsValue::track() {
114 MetadataTracking::track(&MD, *MD, *this);
117 void MetadataAsValue::untrack() {
119 MetadataTracking::untrack(MD);
122 void ReplaceableMetadataImpl::addRef(void *Ref, OwnerTy Owner) {
124 UseMap.insert(std::make_pair(Ref, std::make_pair(Owner, NextIndex)))
127 assert(WasInserted && "Expected to add a reference");
130 assert(NextIndex != 0 && "Unexpected overflow");
133 void ReplaceableMetadataImpl::dropRef(void *Ref) {
134 bool WasErased = UseMap.erase(Ref);
136 assert(WasErased && "Expected to drop a reference");
139 void ReplaceableMetadataImpl::moveRef(void *Ref, void *New,
140 const Metadata &MD) {
141 auto I = UseMap.find(Ref);
142 assert(I != UseMap.end() && "Expected to move a reference");
143 auto OwnerAndIndex = I->second;
145 bool WasInserted = UseMap.insert(std::make_pair(New, OwnerAndIndex)).second;
147 assert(WasInserted && "Expected to add a reference");
149 // Check that the references are direct if there's no owner.
151 assert((OwnerAndIndex.first || *static_cast<Metadata **>(Ref) == &MD) &&
152 "Reference without owner must be direct");
153 assert((OwnerAndIndex.first || *static_cast<Metadata **>(New) == &MD) &&
154 "Reference without owner must be direct");
157 void ReplaceableMetadataImpl::replaceAllUsesWith(Metadata *MD) {
158 assert(!(MD && isa<MDNode>(MD) && cast<MDNode>(MD)->isTemporary()) &&
159 "Expected non-temp node");
164 // Copy out uses since UseMap will get touched below.
165 typedef std::pair<void *, std::pair<OwnerTy, uint64_t>> UseTy;
166 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
167 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) {
168 return L.second.second < R.second.second;
170 for (const auto &Pair : Uses) {
171 // Check that this Ref hasn't disappeared after RAUW (when updating a
173 if (!UseMap.count(Pair.first))
176 OwnerTy Owner = Pair.second.first;
178 // Update unowned tracking references directly.
179 Metadata *&Ref = *static_cast<Metadata **>(Pair.first);
182 MetadataTracking::track(Ref);
183 UseMap.erase(Pair.first);
187 // Check for MetadataAsValue.
188 if (Owner.is<MetadataAsValue *>()) {
189 Owner.get<MetadataAsValue *>()->handleChangedMetadata(MD);
193 // There's a Metadata owner -- dispatch.
194 Metadata *OwnerMD = Owner.get<Metadata *>();
195 switch (OwnerMD->getMetadataID()) {
196 #define HANDLE_METADATA_LEAF(CLASS) \
197 case Metadata::CLASS##Kind: \
198 cast<CLASS>(OwnerMD)->handleChangedOperand(Pair.first, MD); \
200 #include "llvm/IR/Metadata.def"
202 llvm_unreachable("Invalid metadata subclass");
205 assert(UseMap.empty() && "Expected all uses to be replaced");
208 void ReplaceableMetadataImpl::resolveAllUses(bool ResolveUsers) {
217 // Copy out uses since UseMap could get touched below.
218 typedef std::pair<void *, std::pair<OwnerTy, uint64_t>> UseTy;
219 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
220 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) {
221 return L.second.second < R.second.second;
224 for (const auto &Pair : Uses) {
225 auto Owner = Pair.second.first;
228 if (Owner.is<MetadataAsValue *>())
231 // Resolve UniquableMDNodes that point at this.
232 auto *OwnerMD = dyn_cast<UniquableMDNode>(Owner.get<Metadata *>());
235 if (OwnerMD->isResolved())
237 OwnerMD->decrementUnresolvedOperandCount();
241 static Function *getLocalFunction(Value *V) {
242 assert(V && "Expected value");
243 if (auto *A = dyn_cast<Argument>(V))
244 return A->getParent();
245 if (BasicBlock *BB = cast<Instruction>(V)->getParent())
246 return BB->getParent();
250 ValueAsMetadata *ValueAsMetadata::get(Value *V) {
251 assert(V && "Unexpected null Value");
253 auto &Context = V->getContext();
254 auto *&Entry = Context.pImpl->ValuesAsMetadata[V];
256 assert((isa<Constant>(V) || isa<Argument>(V) || isa<Instruction>(V)) &&
257 "Expected constant or function-local value");
258 assert(!V->NameAndIsUsedByMD.getInt() &&
259 "Expected this to be the only metadata use");
260 V->NameAndIsUsedByMD.setInt(true);
261 if (auto *C = dyn_cast<Constant>(V))
262 Entry = new ConstantAsMetadata(C);
264 Entry = new LocalAsMetadata(V);
270 ValueAsMetadata *ValueAsMetadata::getIfExists(Value *V) {
271 assert(V && "Unexpected null Value");
272 return V->getContext().pImpl->ValuesAsMetadata.lookup(V);
275 void ValueAsMetadata::handleDeletion(Value *V) {
276 assert(V && "Expected valid value");
278 auto &Store = V->getType()->getContext().pImpl->ValuesAsMetadata;
279 auto I = Store.find(V);
280 if (I == Store.end())
283 // Remove old entry from the map.
284 ValueAsMetadata *MD = I->second;
285 assert(MD && "Expected valid metadata");
286 assert(MD->getValue() == V && "Expected valid mapping");
289 // Delete the metadata.
290 MD->replaceAllUsesWith(nullptr);
294 void ValueAsMetadata::handleRAUW(Value *From, Value *To) {
295 assert(From && "Expected valid value");
296 assert(To && "Expected valid value");
297 assert(From != To && "Expected changed value");
298 assert(From->getType() == To->getType() && "Unexpected type change");
300 LLVMContext &Context = From->getType()->getContext();
301 auto &Store = Context.pImpl->ValuesAsMetadata;
302 auto I = Store.find(From);
303 if (I == Store.end()) {
304 assert(!From->NameAndIsUsedByMD.getInt() &&
305 "Expected From not to be used by metadata");
309 // Remove old entry from the map.
310 assert(From->NameAndIsUsedByMD.getInt() &&
311 "Expected From to be used by metadata");
312 From->NameAndIsUsedByMD.setInt(false);
313 ValueAsMetadata *MD = I->second;
314 assert(MD && "Expected valid metadata");
315 assert(MD->getValue() == From && "Expected valid mapping");
318 if (isa<LocalAsMetadata>(MD)) {
319 if (auto *C = dyn_cast<Constant>(To)) {
320 // Local became a constant.
321 MD->replaceAllUsesWith(ConstantAsMetadata::get(C));
325 if (getLocalFunction(From) && getLocalFunction(To) &&
326 getLocalFunction(From) != getLocalFunction(To)) {
328 MD->replaceAllUsesWith(nullptr);
332 } else if (!isa<Constant>(To)) {
333 // Changed to function-local value.
334 MD->replaceAllUsesWith(nullptr);
339 auto *&Entry = Store[To];
341 // The target already exists.
342 MD->replaceAllUsesWith(Entry);
347 // Update MD in place (and update the map entry).
348 assert(!To->NameAndIsUsedByMD.getInt() &&
349 "Expected this to be the only metadata use");
350 To->NameAndIsUsedByMD.setInt(true);
355 //===----------------------------------------------------------------------===//
356 // MDString implementation.
359 MDString *MDString::get(LLVMContext &Context, StringRef Str) {
360 auto &Store = Context.pImpl->MDStringCache;
361 auto I = Store.find(Str);
362 if (I != Store.end())
366 StringMapEntry<MDString>::Create(Str, Store.getAllocator(), MDString());
367 bool WasInserted = Store.insert(Entry);
369 assert(WasInserted && "Expected entry to be inserted");
370 Entry->second.Entry = Entry;
371 return &Entry->second;
374 StringRef MDString::getString() const {
375 assert(Entry && "Expected to find string map entry");
376 return Entry->first();
379 //===----------------------------------------------------------------------===//
380 // MDNode implementation.
383 void *MDNode::operator new(size_t Size, unsigned NumOps) {
384 void *Ptr = ::operator new(Size + NumOps * sizeof(MDOperand));
385 MDOperand *O = static_cast<MDOperand *>(Ptr);
386 for (MDOperand *E = O + NumOps; O != E; ++O)
387 (void)new (O) MDOperand;
391 void MDNode::operator delete(void *Mem) {
392 MDNode *N = static_cast<MDNode *>(Mem);
393 MDOperand *O = static_cast<MDOperand *>(Mem);
394 for (MDOperand *E = O - N->NumOperands; O != E; --O)
395 (O - 1)->~MDOperand();
396 ::operator delete(O);
399 MDNode::MDNode(LLVMContext &Context, unsigned ID, StorageType Storage,
400 ArrayRef<Metadata *> MDs)
401 : Metadata(ID, Storage), Context(Context), NumOperands(MDs.size()),
402 MDNodeSubclassData(0) {
403 for (unsigned I = 0, E = MDs.size(); I != E; ++I)
404 setOperand(I, MDs[I]);
407 this->Context.makeReplaceable(
408 make_unique<ReplaceableMetadataImpl>(Context));
411 static bool isOperandUnresolved(Metadata *Op) {
412 if (auto *N = dyn_cast_or_null<MDNode>(Op))
413 return !N->isResolved();
417 UniquableMDNode::UniquableMDNode(LLVMContext &C, unsigned ID,
418 StorageType Storage, ArrayRef<Metadata *> Vals)
419 : MDNode(C, ID, Storage, Vals) {
423 // Check whether any operands are unresolved, requiring re-uniquing.
424 unsigned NumUnresolved = countUnresolvedOperands();
428 this->Context.makeReplaceable(make_unique<ReplaceableMetadataImpl>(C));
429 SubclassData32 = NumUnresolved;
432 unsigned UniquableMDNode::countUnresolvedOperands() const {
433 unsigned NumUnresolved = 0;
434 for (const auto &Op : operands())
435 NumUnresolved += unsigned(isOperandUnresolved(Op));
436 return NumUnresolved;
439 void UniquableMDNode::makeUniqued() {
440 assert(isTemporary() && "Expected this to be temporary");
441 assert(!isResolved() && "Expected this to be unresolved");
443 // Make this 'uniqued'.
445 if (unsigned NumUnresolved = countUnresolvedOperands())
446 SubclassData32 = NumUnresolved;
450 assert(isUniqued() && "Expected this to be uniqued");
453 void UniquableMDNode::makeDistinct() {
454 assert(isTemporary() && "Expected this to be temporary");
455 assert(!isResolved() && "Expected this to be unresolved");
457 // Pretend to be uniqued, resolve the node, and then store in distinct table.
460 storeDistinctInContext();
462 assert(isDistinct() && "Expected this to be distinct");
463 assert(isResolved() && "Expected this to be resolved");
466 void UniquableMDNode::resolve() {
467 assert(isUniqued() && "Expected this to be uniqued");
468 assert(!isResolved() && "Expected this to be unresolved");
470 // Move the map, so that this immediately looks resolved.
471 auto Uses = Context.takeReplaceableUses();
473 assert(isResolved() && "Expected this to be resolved");
475 // Drop RAUW support.
476 Uses->resolveAllUses();
479 void UniquableMDNode::resolveAfterOperandChange(Metadata *Old, Metadata *New) {
480 assert(SubclassData32 != 0 && "Expected unresolved operands");
482 // Check if an operand was resolved.
483 if (!isOperandUnresolved(Old)) {
484 if (isOperandUnresolved(New))
485 // An operand was un-resolved!
487 } else if (!isOperandUnresolved(New))
488 decrementUnresolvedOperandCount();
491 void UniquableMDNode::decrementUnresolvedOperandCount() {
492 if (!--SubclassData32)
493 // Last unresolved operand has just been resolved.
497 void UniquableMDNode::resolveCycles() {
501 // Resolve this node immediately.
504 // Resolve all operands.
505 for (const auto &Op : operands()) {
506 auto *N = dyn_cast_or_null<UniquableMDNode>(Op);
510 assert(!N->isTemporary() &&
511 "Expected all forward declarations to be resolved");
512 if (!N->isResolved())
517 void MDTuple::recalculateHash() {
518 setHash(hash_combine_range(op_begin(), op_end()));
521 SmallVector<Metadata *, 8> MDs(op_begin(), op_end());
522 unsigned RawHash = hash_combine_range(MDs.begin(), MDs.end());
523 assert(getHash() == RawHash &&
524 "Expected hash of MDOperand to equal hash of Metadata*");
529 void MDNode::dropAllReferences() {
530 for (unsigned I = 0, E = NumOperands; I != E; ++I)
531 setOperand(I, nullptr);
532 if (auto *N = dyn_cast<UniquableMDNode>(this))
533 if (!N->isResolved()) {
534 N->Context.getReplaceableUses()->resolveAllUses(/* ResolveUsers */ false);
535 (void)N->Context.takeReplaceableUses();
540 /// \brief Make MDOperand transparent for hashing.
542 /// This overload of an implementation detail of the hashing library makes
543 /// MDOperand hash to the same value as a \a Metadata pointer.
545 /// Note that overloading \a hash_value() as follows:
548 /// size_t hash_value(const MDOperand &X) { return hash_value(X.get()); }
551 /// does not cause MDOperand to be transparent. In particular, a bare pointer
552 /// doesn't get hashed before it's combined, whereas \a MDOperand would.
553 static const Metadata *get_hashable_data(const MDOperand &X) { return X.get(); }
556 void UniquableMDNode::handleChangedOperand(void *Ref, Metadata *New) {
557 unsigned Op = static_cast<MDOperand *>(Ref) - op_begin();
558 assert(Op < getNumOperands() && "Expected valid operand");
561 // This node is not uniqued. Just set the operand and be done with it.
566 // This node is uniqued.
569 Metadata *Old = getOperand(Op);
572 // Drop uniquing for self-reference cycles.
576 storeDistinctInContext();
580 // Re-unique the node.
581 auto *Uniqued = uniquify();
582 if (Uniqued == this) {
584 resolveAfterOperandChange(Old, New);
590 // Still unresolved, so RAUW.
592 // First, clear out all operands to prevent any recursion (similar to
593 // dropAllReferences(), but we still need the use-list).
594 for (unsigned O = 0, E = getNumOperands(); O != E; ++O)
595 setOperand(O, nullptr);
596 Context.getReplaceableUses()->replaceAllUsesWith(Uniqued);
601 // Store in non-uniqued form if RAUW isn't possible.
602 storeDistinctInContext();
605 void UniquableMDNode::deleteAsSubclass() {
606 switch (getMetadataID()) {
608 llvm_unreachable("Invalid subclass of UniquableMDNode");
609 #define HANDLE_UNIQUABLE_LEAF(CLASS) \
611 delete cast<CLASS>(this); \
613 #include "llvm/IR/Metadata.def"
617 UniquableMDNode *UniquableMDNode::uniquify() {
618 switch (getMetadataID()) {
620 llvm_unreachable("Invalid subclass of UniquableMDNode");
621 #define HANDLE_UNIQUABLE_LEAF(CLASS) \
623 return cast<CLASS>(this)->uniquifyImpl();
624 #include "llvm/IR/Metadata.def"
628 void UniquableMDNode::eraseFromStore() {
629 switch (getMetadataID()) {
631 llvm_unreachable("Invalid subclass of UniquableMDNode");
632 #define HANDLE_UNIQUABLE_LEAF(CLASS) \
634 cast<CLASS>(this)->eraseFromStoreImpl(); \
636 #include "llvm/IR/Metadata.def"
640 template <class T, class InfoT>
641 static T *getUniqued(DenseSet<T *, InfoT> &Store,
642 const typename InfoT::KeyTy &Key) {
643 auto I = Store.find_as(Key);
644 return I == Store.end() ? nullptr : *I;
647 template <class T, class StoreT>
648 T *UniquableMDNode::storeImpl(T *N, StorageType Storage, StoreT &Store) {
654 N->storeDistinctInContext();
662 MDTuple *MDTuple::getImpl(LLVMContext &Context, ArrayRef<Metadata *> MDs,
663 StorageType Storage, bool ShouldCreate) {
665 if (Storage == Uniqued) {
666 MDTupleInfo::KeyTy Key(MDs);
667 if (auto *N = getUniqued(Context.pImpl->MDTuples, Key))
673 assert(ShouldCreate && "Expected non-uniqued nodes to always be created");
676 return storeImpl(new (MDs.size()) MDTuple(Context, Storage, Hash, MDs),
677 Storage, Context.pImpl->MDTuples);
680 MDTuple *MDTuple::uniquifyImpl() {
682 auto &Store = getContext().pImpl->MDTuples;
683 if (MDTuple *N = getUniqued(Store, this))
690 void MDTuple::eraseFromStoreImpl() { getContext().pImpl->MDTuples.erase(this); }
692 MDLocation::MDLocation(LLVMContext &C, StorageType Storage, unsigned Line,
693 unsigned Column, ArrayRef<Metadata *> MDs)
694 : UniquableMDNode(C, MDLocationKind, Storage, MDs) {
695 assert((MDs.size() == 1 || MDs.size() == 2) &&
696 "Expected a scope and optional inlined-at");
698 // Set line and column.
699 assert(Line < (1u << 24) && "Expected 24-bit line");
700 assert(Column < (1u << 16) && "Expected 16-bit column");
702 MDNodeSubclassData = Line;
703 SubclassData16 = Column;
706 static void adjustLine(unsigned &Line) {
707 // Set to unknown on overflow. Still use 24 bits for now.
708 if (Line >= (1u << 24))
712 static void adjustColumn(unsigned &Column) {
713 // Set to unknown on overflow. We only have 16 bits to play with here.
714 if (Column >= (1u << 16))
718 MDLocation *MDLocation::getImpl(LLVMContext &Context, unsigned Line,
719 unsigned Column, Metadata *Scope,
720 Metadata *InlinedAt, StorageType Storage,
722 // Fixup line/column.
724 adjustColumn(Column);
726 if (Storage == Uniqued) {
727 if (auto *N = getUniqued(
728 Context.pImpl->MDLocations,
729 MDLocationInfo::KeyTy(Line, Column, Scope, InlinedAt)))
734 assert(ShouldCreate && "Expected non-uniqued nodes to always be created");
737 SmallVector<Metadata *, 2> Ops;
738 Ops.push_back(Scope);
740 Ops.push_back(InlinedAt);
741 return storeImpl(new (Ops.size())
742 MDLocation(Context, Storage, Line, Column, Ops),
743 Storage, Context.pImpl->MDLocations);
746 MDLocation *MDLocation::uniquifyImpl() {
747 auto &Store = getContext().pImpl->MDLocations;
748 if (MDLocation *N = getUniqued(Store, this))
755 void MDLocation::eraseFromStoreImpl() {
756 getContext().pImpl->MDLocations.erase(this);
759 void MDNode::deleteTemporary(MDNode *N) {
760 assert(N->isTemporary() && "Expected temporary node");
761 cast<UniquableMDNode>(N)->deleteAsSubclass();
764 void UniquableMDNode::storeDistinctInContext() {
765 assert(isResolved() && "Expected resolved nodes");
767 if (auto *T = dyn_cast<MDTuple>(this))
769 getContext().pImpl->DistinctMDNodes.insert(this);
772 void MDNode::replaceOperandWith(unsigned I, Metadata *New) {
773 if (getOperand(I) == New)
781 cast<UniquableMDNode>(this)->handleChangedOperand(mutable_begin() + I, New);
784 void MDNode::setOperand(unsigned I, Metadata *New) {
785 assert(I < NumOperands);
786 mutable_begin()[I].reset(New, isUniqued() ? this : nullptr);
789 /// \brief Get a node, or a self-reference that looks like it.
791 /// Special handling for finding self-references, for use by \a
792 /// MDNode::concatenate() and \a MDNode::intersect() to maintain behaviour from
793 /// when self-referencing nodes were still uniqued. If the first operand has
794 /// the same operands as \c Ops, return the first operand instead.
795 static MDNode *getOrSelfReference(LLVMContext &Context,
796 ArrayRef<Metadata *> Ops) {
798 if (MDNode *N = dyn_cast_or_null<MDNode>(Ops[0]))
799 if (N->getNumOperands() == Ops.size() && N == N->getOperand(0)) {
800 for (unsigned I = 1, E = Ops.size(); I != E; ++I)
801 if (Ops[I] != N->getOperand(I))
802 return MDNode::get(Context, Ops);
806 return MDNode::get(Context, Ops);
809 MDNode *MDNode::concatenate(MDNode *A, MDNode *B) {
815 SmallVector<Metadata *, 4> MDs(A->getNumOperands() + B->getNumOperands());
818 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i)
819 MDs[j++] = A->getOperand(i);
820 for (unsigned i = 0, ie = B->getNumOperands(); i != ie; ++i)
821 MDs[j++] = B->getOperand(i);
823 // FIXME: This preserves long-standing behaviour, but is it really the right
824 // behaviour? Or was that an unintended side-effect of node uniquing?
825 return getOrSelfReference(A->getContext(), MDs);
828 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {
832 SmallVector<Metadata *, 4> MDs;
833 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i) {
834 Metadata *MD = A->getOperand(i);
835 for (unsigned j = 0, je = B->getNumOperands(); j != je; ++j)
836 if (MD == B->getOperand(j)) {
842 // FIXME: This preserves long-standing behaviour, but is it really the right
843 // behaviour? Or was that an unintended side-effect of node uniquing?
844 return getOrSelfReference(A->getContext(), MDs);
847 MDNode *MDNode::getMostGenericFPMath(MDNode *A, MDNode *B) {
851 APFloat AVal = mdconst::extract<ConstantFP>(A->getOperand(0))->getValueAPF();
852 APFloat BVal = mdconst::extract<ConstantFP>(B->getOperand(0))->getValueAPF();
853 if (AVal.compare(BVal) == APFloat::cmpLessThan)
858 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
859 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
862 static bool canBeMerged(const ConstantRange &A, const ConstantRange &B) {
863 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B);
866 static bool tryMergeRange(SmallVectorImpl<ConstantInt *> &EndPoints,
867 ConstantInt *Low, ConstantInt *High) {
868 ConstantRange NewRange(Low->getValue(), High->getValue());
869 unsigned Size = EndPoints.size();
870 APInt LB = EndPoints[Size - 2]->getValue();
871 APInt LE = EndPoints[Size - 1]->getValue();
872 ConstantRange LastRange(LB, LE);
873 if (canBeMerged(NewRange, LastRange)) {
874 ConstantRange Union = LastRange.unionWith(NewRange);
875 Type *Ty = High->getType();
876 EndPoints[Size - 2] =
877 cast<ConstantInt>(ConstantInt::get(Ty, Union.getLower()));
878 EndPoints[Size - 1] =
879 cast<ConstantInt>(ConstantInt::get(Ty, Union.getUpper()));
885 static void addRange(SmallVectorImpl<ConstantInt *> &EndPoints,
886 ConstantInt *Low, ConstantInt *High) {
887 if (!EndPoints.empty())
888 if (tryMergeRange(EndPoints, Low, High))
891 EndPoints.push_back(Low);
892 EndPoints.push_back(High);
895 MDNode *MDNode::getMostGenericRange(MDNode *A, MDNode *B) {
896 // Given two ranges, we want to compute the union of the ranges. This
897 // is slightly complitade by having to combine the intervals and merge
898 // the ones that overlap.
906 // First, walk both lists in older of the lower boundary of each interval.
907 // At each step, try to merge the new interval to the last one we adedd.
908 SmallVector<ConstantInt *, 4> EndPoints;
911 int AN = A->getNumOperands() / 2;
912 int BN = B->getNumOperands() / 2;
913 while (AI < AN && BI < BN) {
914 ConstantInt *ALow = mdconst::extract<ConstantInt>(A->getOperand(2 * AI));
915 ConstantInt *BLow = mdconst::extract<ConstantInt>(B->getOperand(2 * BI));
917 if (ALow->getValue().slt(BLow->getValue())) {
918 addRange(EndPoints, ALow,
919 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
922 addRange(EndPoints, BLow,
923 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
928 addRange(EndPoints, mdconst::extract<ConstantInt>(A->getOperand(2 * AI)),
929 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
933 addRange(EndPoints, mdconst::extract<ConstantInt>(B->getOperand(2 * BI)),
934 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
938 // If we have more than 2 ranges (4 endpoints) we have to try to merge
939 // the last and first ones.
940 unsigned Size = EndPoints.size();
942 ConstantInt *FB = EndPoints[0];
943 ConstantInt *FE = EndPoints[1];
944 if (tryMergeRange(EndPoints, FB, FE)) {
945 for (unsigned i = 0; i < Size - 2; ++i) {
946 EndPoints[i] = EndPoints[i + 2];
948 EndPoints.resize(Size - 2);
952 // If in the end we have a single range, it is possible that it is now the
953 // full range. Just drop the metadata in that case.
954 if (EndPoints.size() == 2) {
955 ConstantRange Range(EndPoints[0]->getValue(), EndPoints[1]->getValue());
956 if (Range.isFullSet())
960 SmallVector<Metadata *, 4> MDs;
961 MDs.reserve(EndPoints.size());
962 for (auto *I : EndPoints)
963 MDs.push_back(ConstantAsMetadata::get(I));
964 return MDNode::get(A->getContext(), MDs);
967 //===----------------------------------------------------------------------===//
968 // NamedMDNode implementation.
971 static SmallVector<TrackingMDRef, 4> &getNMDOps(void *Operands) {
972 return *(SmallVector<TrackingMDRef, 4> *)Operands;
975 NamedMDNode::NamedMDNode(const Twine &N)
976 : Name(N.str()), Parent(nullptr),
977 Operands(new SmallVector<TrackingMDRef, 4>()) {}
979 NamedMDNode::~NamedMDNode() {
981 delete &getNMDOps(Operands);
984 unsigned NamedMDNode::getNumOperands() const {
985 return (unsigned)getNMDOps(Operands).size();
988 MDNode *NamedMDNode::getOperand(unsigned i) const {
989 assert(i < getNumOperands() && "Invalid Operand number!");
990 auto *N = getNMDOps(Operands)[i].get();
991 return cast_or_null<MDNode>(N);
994 void NamedMDNode::addOperand(MDNode *M) { getNMDOps(Operands).emplace_back(M); }
996 void NamedMDNode::setOperand(unsigned I, MDNode *New) {
997 assert(I < getNumOperands() && "Invalid operand number");
998 getNMDOps(Operands)[I].reset(New);
1001 void NamedMDNode::eraseFromParent() {
1002 getParent()->eraseNamedMetadata(this);
1005 void NamedMDNode::dropAllReferences() {
1006 getNMDOps(Operands).clear();
1009 StringRef NamedMDNode::getName() const {
1010 return StringRef(Name);
1013 //===----------------------------------------------------------------------===//
1014 // Instruction Metadata method implementations.
1017 void Instruction::setMetadata(StringRef Kind, MDNode *Node) {
1018 if (!Node && !hasMetadata())
1020 setMetadata(getContext().getMDKindID(Kind), Node);
1023 MDNode *Instruction::getMetadataImpl(StringRef Kind) const {
1024 return getMetadataImpl(getContext().getMDKindID(Kind));
1027 void Instruction::dropUnknownMetadata(ArrayRef<unsigned> KnownIDs) {
1028 SmallSet<unsigned, 5> KnownSet;
1029 KnownSet.insert(KnownIDs.begin(), KnownIDs.end());
1031 // Drop debug if needed
1032 if (KnownSet.erase(LLVMContext::MD_dbg))
1033 DbgLoc = DebugLoc();
1035 if (!hasMetadataHashEntry())
1036 return; // Nothing to remove!
1038 DenseMap<const Instruction *, LLVMContextImpl::MDMapTy> &MetadataStore =
1039 getContext().pImpl->MetadataStore;
1041 if (KnownSet.empty()) {
1042 // Just drop our entry at the store.
1043 MetadataStore.erase(this);
1044 setHasMetadataHashEntry(false);
1048 LLVMContextImpl::MDMapTy &Info = MetadataStore[this];
1051 // Walk the array and drop any metadata we don't know.
1052 for (I = 0, E = Info.size(); I != E;) {
1053 if (KnownSet.count(Info[I].first)) {
1058 Info[I] = std::move(Info.back());
1062 assert(E == Info.size());
1065 // Drop our entry at the store.
1066 MetadataStore.erase(this);
1067 setHasMetadataHashEntry(false);
1071 /// setMetadata - Set the metadata of of the specified kind to the specified
1072 /// node. This updates/replaces metadata if already present, or removes it if
1074 void Instruction::setMetadata(unsigned KindID, MDNode *Node) {
1075 if (!Node && !hasMetadata())
1078 // Handle 'dbg' as a special case since it is not stored in the hash table.
1079 if (KindID == LLVMContext::MD_dbg) {
1080 DbgLoc = DebugLoc::getFromDILocation(Node);
1084 // Handle the case when we're adding/updating metadata on an instruction.
1086 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1087 assert(!Info.empty() == hasMetadataHashEntry() &&
1088 "HasMetadata bit is wonked");
1090 setHasMetadataHashEntry(true);
1092 // Handle replacement of an existing value.
1093 for (auto &P : Info)
1094 if (P.first == KindID) {
1095 P.second.reset(Node);
1100 // No replacement, just add it to the list.
1101 Info.emplace_back(std::piecewise_construct, std::make_tuple(KindID),
1102 std::make_tuple(Node));
1106 // Otherwise, we're removing metadata from an instruction.
1107 assert((hasMetadataHashEntry() ==
1108 (getContext().pImpl->MetadataStore.count(this) > 0)) &&
1109 "HasMetadata bit out of date!");
1110 if (!hasMetadataHashEntry())
1111 return; // Nothing to remove!
1112 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1114 // Common case is removing the only entry.
1115 if (Info.size() == 1 && Info[0].first == KindID) {
1116 getContext().pImpl->MetadataStore.erase(this);
1117 setHasMetadataHashEntry(false);
1121 // Handle removal of an existing value.
1122 for (unsigned i = 0, e = Info.size(); i != e; ++i)
1123 if (Info[i].first == KindID) {
1124 Info[i] = std::move(Info.back());
1126 assert(!Info.empty() && "Removing last entry should be handled above");
1129 // Otherwise, removing an entry that doesn't exist on the instruction.
1132 void Instruction::setAAMetadata(const AAMDNodes &N) {
1133 setMetadata(LLVMContext::MD_tbaa, N.TBAA);
1134 setMetadata(LLVMContext::MD_alias_scope, N.Scope);
1135 setMetadata(LLVMContext::MD_noalias, N.NoAlias);
1138 MDNode *Instruction::getMetadataImpl(unsigned KindID) const {
1139 // Handle 'dbg' as a special case since it is not stored in the hash table.
1140 if (KindID == LLVMContext::MD_dbg)
1141 return DbgLoc.getAsMDNode();
1143 if (!hasMetadataHashEntry()) return nullptr;
1145 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1146 assert(!Info.empty() && "bit out of sync with hash table");
1148 for (const auto &I : Info)
1149 if (I.first == KindID)
1154 void Instruction::getAllMetadataImpl(
1155 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1158 // Handle 'dbg' as a special case since it is not stored in the hash table.
1159 if (!DbgLoc.isUnknown()) {
1161 std::make_pair((unsigned)LLVMContext::MD_dbg, DbgLoc.getAsMDNode()));
1162 if (!hasMetadataHashEntry()) return;
1165 assert(hasMetadataHashEntry() &&
1166 getContext().pImpl->MetadataStore.count(this) &&
1167 "Shouldn't have called this");
1168 const LLVMContextImpl::MDMapTy &Info =
1169 getContext().pImpl->MetadataStore.find(this)->second;
1170 assert(!Info.empty() && "Shouldn't have called this");
1172 Result.reserve(Result.size() + Info.size());
1173 for (auto &I : Info)
1174 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1176 // Sort the resulting array so it is stable.
1177 if (Result.size() > 1)
1178 array_pod_sort(Result.begin(), Result.end());
1181 void Instruction::getAllMetadataOtherThanDebugLocImpl(
1182 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1184 assert(hasMetadataHashEntry() &&
1185 getContext().pImpl->MetadataStore.count(this) &&
1186 "Shouldn't have called this");
1187 const LLVMContextImpl::MDMapTy &Info =
1188 getContext().pImpl->MetadataStore.find(this)->second;
1189 assert(!Info.empty() && "Shouldn't have called this");
1190 Result.reserve(Result.size() + Info.size());
1191 for (auto &I : Info)
1192 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1194 // Sort the resulting array so it is stable.
1195 if (Result.size() > 1)
1196 array_pod_sort(Result.begin(), Result.end());
1199 /// clearMetadataHashEntries - Clear all hashtable-based metadata from
1200 /// this instruction.
1201 void Instruction::clearMetadataHashEntries() {
1202 assert(hasMetadataHashEntry() && "Caller should check");
1203 getContext().pImpl->MetadataStore.erase(this);
1204 setHasMetadataHashEntry(false);