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 MDNodes that point at this.
232 auto *OwnerMD = dyn_cast<MDNode>(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]);
410 // Check whether any operands are unresolved, requiring re-uniquing.
411 unsigned NumUnresolved = countUnresolvedOperands();
415 SubclassData32 = NumUnresolved;
418 this->Context.makeReplaceable(make_unique<ReplaceableMetadataImpl>(Context));
421 static bool isOperandUnresolved(Metadata *Op) {
422 if (auto *N = dyn_cast_or_null<MDNode>(Op))
423 return !N->isResolved();
427 unsigned MDNode::countUnresolvedOperands() const {
428 unsigned NumUnresolved = 0;
429 for (const auto &Op : operands())
430 NumUnresolved += unsigned(isOperandUnresolved(Op));
431 return NumUnresolved;
434 void MDNode::makeUniqued() {
435 assert(isTemporary() && "Expected this to be temporary");
436 assert(!isResolved() && "Expected this to be unresolved");
438 // Make this 'uniqued'.
440 if (unsigned NumUnresolved = countUnresolvedOperands())
441 SubclassData32 = NumUnresolved;
445 assert(isUniqued() && "Expected this to be uniqued");
448 void MDNode::makeDistinct() {
449 assert(isTemporary() && "Expected this to be temporary");
450 assert(!isResolved() && "Expected this to be unresolved");
452 // Pretend to be uniqued, resolve the node, and then store in distinct table.
455 storeDistinctInContext();
457 assert(isDistinct() && "Expected this to be distinct");
458 assert(isResolved() && "Expected this to be resolved");
461 void MDNode::resolve() {
462 assert(isUniqued() && "Expected this to be uniqued");
463 assert(!isResolved() && "Expected this to be unresolved");
465 // Move the map, so that this immediately looks resolved.
466 auto Uses = Context.takeReplaceableUses();
468 assert(isResolved() && "Expected this to be resolved");
470 // Drop RAUW support.
471 Uses->resolveAllUses();
474 void MDNode::resolveAfterOperandChange(Metadata *Old, Metadata *New) {
475 assert(SubclassData32 != 0 && "Expected unresolved operands");
477 // Check if an operand was resolved.
478 if (!isOperandUnresolved(Old)) {
479 if (isOperandUnresolved(New))
480 // An operand was un-resolved!
482 } else if (!isOperandUnresolved(New))
483 decrementUnresolvedOperandCount();
486 void MDNode::decrementUnresolvedOperandCount() {
487 if (!--SubclassData32)
488 // Last unresolved operand has just been resolved.
492 void MDNode::resolveCycles() {
496 // Resolve this node immediately.
499 // Resolve all operands.
500 for (const auto &Op : operands()) {
501 auto *N = dyn_cast_or_null<MDNode>(Op);
505 assert(!N->isTemporary() &&
506 "Expected all forward declarations to be resolved");
507 if (!N->isResolved())
512 MDNode *MDNode::replaceWithUniquedImpl() {
513 // Try to uniquify in place.
514 MDNode *UniquedNode = uniquify();
515 if (UniquedNode == this) {
520 // Collision, so RAUW instead.
521 replaceAllUsesWith(UniquedNode);
526 MDNode *MDNode::replaceWithDistinctImpl() {
531 void MDTuple::recalculateHash() {
532 setHash(MDTupleInfo::KeyTy::calculateHash(this));
535 void MDNode::dropAllReferences() {
536 for (unsigned I = 0, E = NumOperands; I != E; ++I)
537 setOperand(I, nullptr);
539 Context.getReplaceableUses()->resolveAllUses(/* ResolveUsers */ false);
540 (void)Context.takeReplaceableUses();
544 void MDNode::handleChangedOperand(void *Ref, Metadata *New) {
545 unsigned Op = static_cast<MDOperand *>(Ref) - op_begin();
546 assert(Op < getNumOperands() && "Expected valid operand");
549 // This node is not uniqued. Just set the operand and be done with it.
554 // This node is uniqued.
557 Metadata *Old = getOperand(Op);
560 // Drop uniquing for self-reference cycles.
564 storeDistinctInContext();
568 // Re-unique the node.
569 auto *Uniqued = uniquify();
570 if (Uniqued == this) {
572 resolveAfterOperandChange(Old, New);
578 // Still unresolved, so RAUW.
580 // First, clear out all operands to prevent any recursion (similar to
581 // dropAllReferences(), but we still need the use-list).
582 for (unsigned O = 0, E = getNumOperands(); O != E; ++O)
583 setOperand(O, nullptr);
584 Context.getReplaceableUses()->replaceAllUsesWith(Uniqued);
589 // Store in non-uniqued form if RAUW isn't possible.
590 storeDistinctInContext();
593 void MDNode::deleteAsSubclass() {
594 switch (getMetadataID()) {
596 llvm_unreachable("Invalid subclass of MDNode");
597 #define HANDLE_MDNODE_LEAF(CLASS) \
599 delete cast<CLASS>(this); \
601 #include "llvm/IR/Metadata.def"
605 template <class T, class InfoT>
606 static T *getUniqued(DenseSet<T *, InfoT> &Store,
607 const typename InfoT::KeyTy &Key) {
608 auto I = Store.find_as(Key);
609 return I == Store.end() ? nullptr : *I;
612 template <class T, class InfoT>
613 static T *uniquifyImpl(T *N, DenseSet<T *, InfoT> &Store) {
614 if (T *U = getUniqued(Store, N))
621 MDNode *MDNode::uniquify() {
622 // Recalculate hash, if necessary.
623 switch (getMetadataID()) {
627 cast<MDTuple>(this)->recalculateHash();
631 // Try to insert into uniquing store.
632 switch (getMetadataID()) {
634 llvm_unreachable("Invalid subclass of MDNode");
635 #define HANDLE_MDNODE_LEAF(CLASS) \
637 return uniquifyImpl(cast<CLASS>(this), getContext().pImpl->CLASS##s);
638 #include "llvm/IR/Metadata.def"
642 void MDNode::eraseFromStore() {
643 switch (getMetadataID()) {
645 llvm_unreachable("Invalid subclass of MDNode");
646 #define HANDLE_MDNODE_LEAF(CLASS) \
648 getContext().pImpl->CLASS##s.erase(cast<CLASS>(this)); \
650 #include "llvm/IR/Metadata.def"
654 template <class T, class StoreT>
655 T *MDNode::storeImpl(T *N, StorageType Storage, StoreT &Store) {
661 N->storeDistinctInContext();
669 MDTuple *MDTuple::getImpl(LLVMContext &Context, ArrayRef<Metadata *> MDs,
670 StorageType Storage, bool ShouldCreate) {
672 if (Storage == Uniqued) {
673 MDTupleInfo::KeyTy Key(MDs);
674 if (auto *N = getUniqued(Context.pImpl->MDTuples, Key))
678 Hash = Key.getHash();
680 assert(ShouldCreate && "Expected non-uniqued nodes to always be created");
683 return storeImpl(new (MDs.size()) MDTuple(Context, Storage, Hash, MDs),
684 Storage, Context.pImpl->MDTuples);
687 MDLocation::MDLocation(LLVMContext &C, StorageType Storage, unsigned Line,
688 unsigned Column, ArrayRef<Metadata *> MDs)
689 : MDNode(C, MDLocationKind, Storage, MDs) {
690 assert((MDs.size() == 1 || MDs.size() == 2) &&
691 "Expected a scope and optional inlined-at");
693 // Set line and column.
694 assert(Line < (1u << 24) && "Expected 24-bit line");
695 assert(Column < (1u << 16) && "Expected 16-bit column");
697 MDNodeSubclassData = Line;
698 SubclassData16 = Column;
701 static void adjustLine(unsigned &Line) {
702 // Set to unknown on overflow. Still use 24 bits for now.
703 if (Line >= (1u << 24))
707 static void adjustColumn(unsigned &Column) {
708 // Set to unknown on overflow. We only have 16 bits to play with here.
709 if (Column >= (1u << 16))
713 MDLocation *MDLocation::getImpl(LLVMContext &Context, unsigned Line,
714 unsigned Column, Metadata *Scope,
715 Metadata *InlinedAt, StorageType Storage,
717 // Fixup line/column.
719 adjustColumn(Column);
721 if (Storage == Uniqued) {
722 if (auto *N = getUniqued(
723 Context.pImpl->MDLocations,
724 MDLocationInfo::KeyTy(Line, Column, Scope, InlinedAt)))
729 assert(ShouldCreate && "Expected non-uniqued nodes to always be created");
732 SmallVector<Metadata *, 2> Ops;
733 Ops.push_back(Scope);
735 Ops.push_back(InlinedAt);
736 return storeImpl(new (Ops.size())
737 MDLocation(Context, Storage, Line, Column, Ops),
738 Storage, Context.pImpl->MDLocations);
741 void MDNode::deleteTemporary(MDNode *N) {
742 assert(N->isTemporary() && "Expected temporary node");
743 N->deleteAsSubclass();
746 void MDNode::storeDistinctInContext() {
747 assert(isResolved() && "Expected resolved nodes");
749 if (auto *T = dyn_cast<MDTuple>(this))
751 getContext().pImpl->DistinctMDNodes.insert(this);
754 void MDNode::replaceOperandWith(unsigned I, Metadata *New) {
755 if (getOperand(I) == New)
763 handleChangedOperand(mutable_begin() + I, New);
766 void MDNode::setOperand(unsigned I, Metadata *New) {
767 assert(I < NumOperands);
768 mutable_begin()[I].reset(New, isUniqued() ? this : nullptr);
771 /// \brief Get a node, or a self-reference that looks like it.
773 /// Special handling for finding self-references, for use by \a
774 /// MDNode::concatenate() and \a MDNode::intersect() to maintain behaviour from
775 /// when self-referencing nodes were still uniqued. If the first operand has
776 /// the same operands as \c Ops, return the first operand instead.
777 static MDNode *getOrSelfReference(LLVMContext &Context,
778 ArrayRef<Metadata *> Ops) {
780 if (MDNode *N = dyn_cast_or_null<MDNode>(Ops[0]))
781 if (N->getNumOperands() == Ops.size() && N == N->getOperand(0)) {
782 for (unsigned I = 1, E = Ops.size(); I != E; ++I)
783 if (Ops[I] != N->getOperand(I))
784 return MDNode::get(Context, Ops);
788 return MDNode::get(Context, Ops);
791 MDNode *MDNode::concatenate(MDNode *A, MDNode *B) {
797 SmallVector<Metadata *, 4> MDs(A->getNumOperands() + B->getNumOperands());
800 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i)
801 MDs[j++] = A->getOperand(i);
802 for (unsigned i = 0, ie = B->getNumOperands(); i != ie; ++i)
803 MDs[j++] = B->getOperand(i);
805 // FIXME: This preserves long-standing behaviour, but is it really the right
806 // behaviour? Or was that an unintended side-effect of node uniquing?
807 return getOrSelfReference(A->getContext(), MDs);
810 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {
814 SmallVector<Metadata *, 4> MDs;
815 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i) {
816 Metadata *MD = A->getOperand(i);
817 for (unsigned j = 0, je = B->getNumOperands(); j != je; ++j)
818 if (MD == B->getOperand(j)) {
824 // FIXME: This preserves long-standing behaviour, but is it really the right
825 // behaviour? Or was that an unintended side-effect of node uniquing?
826 return getOrSelfReference(A->getContext(), MDs);
829 MDNode *MDNode::getMostGenericFPMath(MDNode *A, MDNode *B) {
833 APFloat AVal = mdconst::extract<ConstantFP>(A->getOperand(0))->getValueAPF();
834 APFloat BVal = mdconst::extract<ConstantFP>(B->getOperand(0))->getValueAPF();
835 if (AVal.compare(BVal) == APFloat::cmpLessThan)
840 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
841 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
844 static bool canBeMerged(const ConstantRange &A, const ConstantRange &B) {
845 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B);
848 static bool tryMergeRange(SmallVectorImpl<ConstantInt *> &EndPoints,
849 ConstantInt *Low, ConstantInt *High) {
850 ConstantRange NewRange(Low->getValue(), High->getValue());
851 unsigned Size = EndPoints.size();
852 APInt LB = EndPoints[Size - 2]->getValue();
853 APInt LE = EndPoints[Size - 1]->getValue();
854 ConstantRange LastRange(LB, LE);
855 if (canBeMerged(NewRange, LastRange)) {
856 ConstantRange Union = LastRange.unionWith(NewRange);
857 Type *Ty = High->getType();
858 EndPoints[Size - 2] =
859 cast<ConstantInt>(ConstantInt::get(Ty, Union.getLower()));
860 EndPoints[Size - 1] =
861 cast<ConstantInt>(ConstantInt::get(Ty, Union.getUpper()));
867 static void addRange(SmallVectorImpl<ConstantInt *> &EndPoints,
868 ConstantInt *Low, ConstantInt *High) {
869 if (!EndPoints.empty())
870 if (tryMergeRange(EndPoints, Low, High))
873 EndPoints.push_back(Low);
874 EndPoints.push_back(High);
877 MDNode *MDNode::getMostGenericRange(MDNode *A, MDNode *B) {
878 // Given two ranges, we want to compute the union of the ranges. This
879 // is slightly complitade by having to combine the intervals and merge
880 // the ones that overlap.
888 // First, walk both lists in older of the lower boundary of each interval.
889 // At each step, try to merge the new interval to the last one we adedd.
890 SmallVector<ConstantInt *, 4> EndPoints;
893 int AN = A->getNumOperands() / 2;
894 int BN = B->getNumOperands() / 2;
895 while (AI < AN && BI < BN) {
896 ConstantInt *ALow = mdconst::extract<ConstantInt>(A->getOperand(2 * AI));
897 ConstantInt *BLow = mdconst::extract<ConstantInt>(B->getOperand(2 * BI));
899 if (ALow->getValue().slt(BLow->getValue())) {
900 addRange(EndPoints, ALow,
901 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
904 addRange(EndPoints, BLow,
905 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
910 addRange(EndPoints, mdconst::extract<ConstantInt>(A->getOperand(2 * AI)),
911 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
915 addRange(EndPoints, mdconst::extract<ConstantInt>(B->getOperand(2 * BI)),
916 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
920 // If we have more than 2 ranges (4 endpoints) we have to try to merge
921 // the last and first ones.
922 unsigned Size = EndPoints.size();
924 ConstantInt *FB = EndPoints[0];
925 ConstantInt *FE = EndPoints[1];
926 if (tryMergeRange(EndPoints, FB, FE)) {
927 for (unsigned i = 0; i < Size - 2; ++i) {
928 EndPoints[i] = EndPoints[i + 2];
930 EndPoints.resize(Size - 2);
934 // If in the end we have a single range, it is possible that it is now the
935 // full range. Just drop the metadata in that case.
936 if (EndPoints.size() == 2) {
937 ConstantRange Range(EndPoints[0]->getValue(), EndPoints[1]->getValue());
938 if (Range.isFullSet())
942 SmallVector<Metadata *, 4> MDs;
943 MDs.reserve(EndPoints.size());
944 for (auto *I : EndPoints)
945 MDs.push_back(ConstantAsMetadata::get(I));
946 return MDNode::get(A->getContext(), MDs);
949 //===----------------------------------------------------------------------===//
950 // NamedMDNode implementation.
953 static SmallVector<TrackingMDRef, 4> &getNMDOps(void *Operands) {
954 return *(SmallVector<TrackingMDRef, 4> *)Operands;
957 NamedMDNode::NamedMDNode(const Twine &N)
958 : Name(N.str()), Parent(nullptr),
959 Operands(new SmallVector<TrackingMDRef, 4>()) {}
961 NamedMDNode::~NamedMDNode() {
963 delete &getNMDOps(Operands);
966 unsigned NamedMDNode::getNumOperands() const {
967 return (unsigned)getNMDOps(Operands).size();
970 MDNode *NamedMDNode::getOperand(unsigned i) const {
971 assert(i < getNumOperands() && "Invalid Operand number!");
972 auto *N = getNMDOps(Operands)[i].get();
973 return cast_or_null<MDNode>(N);
976 void NamedMDNode::addOperand(MDNode *M) { getNMDOps(Operands).emplace_back(M); }
978 void NamedMDNode::setOperand(unsigned I, MDNode *New) {
979 assert(I < getNumOperands() && "Invalid operand number");
980 getNMDOps(Operands)[I].reset(New);
983 void NamedMDNode::eraseFromParent() {
984 getParent()->eraseNamedMetadata(this);
987 void NamedMDNode::dropAllReferences() {
988 getNMDOps(Operands).clear();
991 StringRef NamedMDNode::getName() const {
992 return StringRef(Name);
995 //===----------------------------------------------------------------------===//
996 // Instruction Metadata method implementations.
999 void Instruction::setMetadata(StringRef Kind, MDNode *Node) {
1000 if (!Node && !hasMetadata())
1002 setMetadata(getContext().getMDKindID(Kind), Node);
1005 MDNode *Instruction::getMetadataImpl(StringRef Kind) const {
1006 return getMetadataImpl(getContext().getMDKindID(Kind));
1009 void Instruction::dropUnknownMetadata(ArrayRef<unsigned> KnownIDs) {
1010 SmallSet<unsigned, 5> KnownSet;
1011 KnownSet.insert(KnownIDs.begin(), KnownIDs.end());
1013 // Drop debug if needed
1014 if (KnownSet.erase(LLVMContext::MD_dbg))
1015 DbgLoc = DebugLoc();
1017 if (!hasMetadataHashEntry())
1018 return; // Nothing to remove!
1020 DenseMap<const Instruction *, LLVMContextImpl::MDMapTy> &MetadataStore =
1021 getContext().pImpl->MetadataStore;
1023 if (KnownSet.empty()) {
1024 // Just drop our entry at the store.
1025 MetadataStore.erase(this);
1026 setHasMetadataHashEntry(false);
1030 LLVMContextImpl::MDMapTy &Info = MetadataStore[this];
1033 // Walk the array and drop any metadata we don't know.
1034 for (I = 0, E = Info.size(); I != E;) {
1035 if (KnownSet.count(Info[I].first)) {
1040 Info[I] = std::move(Info.back());
1044 assert(E == Info.size());
1047 // Drop our entry at the store.
1048 MetadataStore.erase(this);
1049 setHasMetadataHashEntry(false);
1053 /// setMetadata - Set the metadata of of the specified kind to the specified
1054 /// node. This updates/replaces metadata if already present, or removes it if
1056 void Instruction::setMetadata(unsigned KindID, MDNode *Node) {
1057 if (!Node && !hasMetadata())
1060 // Handle 'dbg' as a special case since it is not stored in the hash table.
1061 if (KindID == LLVMContext::MD_dbg) {
1062 DbgLoc = DebugLoc::getFromDILocation(Node);
1066 // Handle the case when we're adding/updating metadata on an instruction.
1068 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1069 assert(!Info.empty() == hasMetadataHashEntry() &&
1070 "HasMetadata bit is wonked");
1072 setHasMetadataHashEntry(true);
1074 // Handle replacement of an existing value.
1075 for (auto &P : Info)
1076 if (P.first == KindID) {
1077 P.second.reset(Node);
1082 // No replacement, just add it to the list.
1083 Info.emplace_back(std::piecewise_construct, std::make_tuple(KindID),
1084 std::make_tuple(Node));
1088 // Otherwise, we're removing metadata from an instruction.
1089 assert((hasMetadataHashEntry() ==
1090 (getContext().pImpl->MetadataStore.count(this) > 0)) &&
1091 "HasMetadata bit out of date!");
1092 if (!hasMetadataHashEntry())
1093 return; // Nothing to remove!
1094 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1096 // Common case is removing the only entry.
1097 if (Info.size() == 1 && Info[0].first == KindID) {
1098 getContext().pImpl->MetadataStore.erase(this);
1099 setHasMetadataHashEntry(false);
1103 // Handle removal of an existing value.
1104 for (unsigned i = 0, e = Info.size(); i != e; ++i)
1105 if (Info[i].first == KindID) {
1106 Info[i] = std::move(Info.back());
1108 assert(!Info.empty() && "Removing last entry should be handled above");
1111 // Otherwise, removing an entry that doesn't exist on the instruction.
1114 void Instruction::setAAMetadata(const AAMDNodes &N) {
1115 setMetadata(LLVMContext::MD_tbaa, N.TBAA);
1116 setMetadata(LLVMContext::MD_alias_scope, N.Scope);
1117 setMetadata(LLVMContext::MD_noalias, N.NoAlias);
1120 MDNode *Instruction::getMetadataImpl(unsigned KindID) const {
1121 // Handle 'dbg' as a special case since it is not stored in the hash table.
1122 if (KindID == LLVMContext::MD_dbg)
1123 return DbgLoc.getAsMDNode();
1125 if (!hasMetadataHashEntry()) return nullptr;
1127 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1128 assert(!Info.empty() && "bit out of sync with hash table");
1130 for (const auto &I : Info)
1131 if (I.first == KindID)
1136 void Instruction::getAllMetadataImpl(
1137 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1140 // Handle 'dbg' as a special case since it is not stored in the hash table.
1141 if (!DbgLoc.isUnknown()) {
1143 std::make_pair((unsigned)LLVMContext::MD_dbg, DbgLoc.getAsMDNode()));
1144 if (!hasMetadataHashEntry()) return;
1147 assert(hasMetadataHashEntry() &&
1148 getContext().pImpl->MetadataStore.count(this) &&
1149 "Shouldn't have called this");
1150 const LLVMContextImpl::MDMapTy &Info =
1151 getContext().pImpl->MetadataStore.find(this)->second;
1152 assert(!Info.empty() && "Shouldn't have called this");
1154 Result.reserve(Result.size() + Info.size());
1155 for (auto &I : Info)
1156 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1158 // Sort the resulting array so it is stable.
1159 if (Result.size() > 1)
1160 array_pod_sort(Result.begin(), Result.end());
1163 void Instruction::getAllMetadataOtherThanDebugLocImpl(
1164 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1166 assert(hasMetadataHashEntry() &&
1167 getContext().pImpl->MetadataStore.count(this) &&
1168 "Shouldn't have called this");
1169 const LLVMContextImpl::MDMapTy &Info =
1170 getContext().pImpl->MetadataStore.find(this)->second;
1171 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 /// clearMetadataHashEntries - Clear all hashtable-based metadata from
1182 /// this instruction.
1183 void Instruction::clearMetadataHashEntries() {
1184 assert(hasMetadataHashEntry() && "Caller should check");
1185 getContext().pImpl->MetadataStore.erase(this);
1186 setHasMetadataHashEntry(false);