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<MDNodeFwdDecl>(MD)) && "Expected non-temp node");
163 // Copy out uses since UseMap will get touched below.
164 typedef std::pair<void *, std::pair<OwnerTy, uint64_t>> UseTy;
165 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
166 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) {
167 return L.second.second < R.second.second;
169 for (const auto &Pair : Uses) {
170 // Check that this Ref hasn't disappeared after RAUW (when updating a
172 if (!UseMap.count(Pair.first))
175 OwnerTy Owner = Pair.second.first;
177 // Update unowned tracking references directly.
178 Metadata *&Ref = *static_cast<Metadata **>(Pair.first);
181 MetadataTracking::track(Ref);
182 UseMap.erase(Pair.first);
186 // Check for MetadataAsValue.
187 if (Owner.is<MetadataAsValue *>()) {
188 Owner.get<MetadataAsValue *>()->handleChangedMetadata(MD);
192 // There's a Metadata owner -- dispatch.
193 Metadata *OwnerMD = Owner.get<Metadata *>();
194 switch (OwnerMD->getMetadataID()) {
195 #define HANDLE_METADATA_LEAF(CLASS) \
196 case Metadata::CLASS##Kind: \
197 cast<CLASS>(OwnerMD)->handleChangedOperand(Pair.first, MD); \
199 #include "llvm/IR/Metadata.def"
201 llvm_unreachable("Invalid metadata subclass");
204 assert(UseMap.empty() && "Expected all uses to be replaced");
207 void ReplaceableMetadataImpl::resolveAllUses(bool ResolveUsers) {
216 // Copy out uses since UseMap could get touched below.
217 typedef std::pair<void *, std::pair<OwnerTy, uint64_t>> UseTy;
218 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
219 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) {
220 return L.second.second < R.second.second;
223 for (const auto &Pair : Uses) {
224 auto Owner = Pair.second.first;
227 if (Owner.is<MetadataAsValue *>())
230 // Resolve UniquableMDNodes that point at this.
231 auto *OwnerMD = dyn_cast<UniquableMDNode>(Owner.get<Metadata *>());
234 if (OwnerMD->isResolved())
236 OwnerMD->decrementUnresolvedOperandCount();
240 static Function *getLocalFunction(Value *V) {
241 assert(V && "Expected value");
242 if (auto *A = dyn_cast<Argument>(V))
243 return A->getParent();
244 if (BasicBlock *BB = cast<Instruction>(V)->getParent())
245 return BB->getParent();
249 ValueAsMetadata *ValueAsMetadata::get(Value *V) {
250 assert(V && "Unexpected null Value");
252 auto &Context = V->getContext();
253 auto *&Entry = Context.pImpl->ValuesAsMetadata[V];
255 assert((isa<Constant>(V) || isa<Argument>(V) || isa<Instruction>(V)) &&
256 "Expected constant or function-local value");
257 assert(!V->NameAndIsUsedByMD.getInt() &&
258 "Expected this to be the only metadata use");
259 V->NameAndIsUsedByMD.setInt(true);
260 if (auto *C = dyn_cast<Constant>(V))
261 Entry = new ConstantAsMetadata(C);
263 Entry = new LocalAsMetadata(V);
269 ValueAsMetadata *ValueAsMetadata::getIfExists(Value *V) {
270 assert(V && "Unexpected null Value");
271 return V->getContext().pImpl->ValuesAsMetadata.lookup(V);
274 void ValueAsMetadata::handleDeletion(Value *V) {
275 assert(V && "Expected valid value");
277 auto &Store = V->getType()->getContext().pImpl->ValuesAsMetadata;
278 auto I = Store.find(V);
279 if (I == Store.end())
282 // Remove old entry from the map.
283 ValueAsMetadata *MD = I->second;
284 assert(MD && "Expected valid metadata");
285 assert(MD->getValue() == V && "Expected valid mapping");
288 // Delete the metadata.
289 MD->replaceAllUsesWith(nullptr);
293 void ValueAsMetadata::handleRAUW(Value *From, Value *To) {
294 assert(From && "Expected valid value");
295 assert(To && "Expected valid value");
296 assert(From != To && "Expected changed value");
297 assert(From->getType() == To->getType() && "Unexpected type change");
299 LLVMContext &Context = From->getType()->getContext();
300 auto &Store = Context.pImpl->ValuesAsMetadata;
301 auto I = Store.find(From);
302 if (I == Store.end()) {
303 assert(!From->NameAndIsUsedByMD.getInt() &&
304 "Expected From not to be used by metadata");
308 // Remove old entry from the map.
309 assert(From->NameAndIsUsedByMD.getInt() &&
310 "Expected From to be used by metadata");
311 From->NameAndIsUsedByMD.setInt(false);
312 ValueAsMetadata *MD = I->second;
313 assert(MD && "Expected valid metadata");
314 assert(MD->getValue() == From && "Expected valid mapping");
317 if (isa<LocalAsMetadata>(MD)) {
318 if (auto *C = dyn_cast<Constant>(To)) {
319 // Local became a constant.
320 MD->replaceAllUsesWith(ConstantAsMetadata::get(C));
324 if (getLocalFunction(From) && getLocalFunction(To) &&
325 getLocalFunction(From) != getLocalFunction(To)) {
327 MD->replaceAllUsesWith(nullptr);
331 } else if (!isa<Constant>(To)) {
332 // Changed to function-local value.
333 MD->replaceAllUsesWith(nullptr);
338 auto *&Entry = Store[To];
340 // The target already exists.
341 MD->replaceAllUsesWith(Entry);
346 // Update MD in place (and update the map entry).
347 assert(!To->NameAndIsUsedByMD.getInt() &&
348 "Expected this to be the only metadata use");
349 To->NameAndIsUsedByMD.setInt(true);
354 //===----------------------------------------------------------------------===//
355 // MDString implementation.
358 MDString *MDString::get(LLVMContext &Context, StringRef Str) {
359 auto &Store = Context.pImpl->MDStringCache;
360 auto I = Store.find(Str);
361 if (I != Store.end())
365 StringMapEntry<MDString>::Create(Str, Store.getAllocator(), MDString());
366 bool WasInserted = Store.insert(Entry);
368 assert(WasInserted && "Expected entry to be inserted");
369 Entry->second.Entry = Entry;
370 return &Entry->second;
373 StringRef MDString::getString() const {
374 assert(Entry && "Expected to find string map entry");
375 return Entry->first();
378 //===----------------------------------------------------------------------===//
379 // MDNode implementation.
382 void *MDNode::operator new(size_t Size, unsigned NumOps) {
383 void *Ptr = ::operator new(Size + NumOps * sizeof(MDOperand));
384 MDOperand *O = static_cast<MDOperand *>(Ptr);
385 for (MDOperand *E = O + NumOps; O != E; ++O)
386 (void)new (O) MDOperand;
390 void MDNode::operator delete(void *Mem) {
391 MDNode *N = static_cast<MDNode *>(Mem);
392 MDOperand *O = static_cast<MDOperand *>(Mem);
393 for (MDOperand *E = O - N->NumOperands; O != E; --O)
394 (O - 1)->~MDOperand();
395 ::operator delete(O);
398 MDNode::MDNode(LLVMContext &Context, unsigned ID, StorageType Storage,
399 ArrayRef<Metadata *> MDs)
400 : Metadata(ID, Storage), Context(Context), NumOperands(MDs.size()),
401 MDNodeSubclassData(0) {
402 for (unsigned I = 0, E = MDs.size(); I != E; ++I)
403 setOperand(I, MDs[I]);
406 this->Context.makeReplaceable(
407 make_unique<ReplaceableMetadataImpl>(Context));
410 static bool isOperandUnresolved(Metadata *Op) {
411 if (auto *N = dyn_cast_or_null<MDNode>(Op))
412 return !N->isResolved();
416 UniquableMDNode::UniquableMDNode(LLVMContext &C, unsigned ID,
417 StorageType Storage, ArrayRef<Metadata *> Vals)
418 : MDNode(C, ID, Storage, Vals) {
422 // Check whether any operands are unresolved, requiring re-uniquing.
423 unsigned NumUnresolved = 0;
424 for (const auto &Op : operands())
425 NumUnresolved += unsigned(isOperandUnresolved(Op));
430 this->Context.makeReplaceable(make_unique<ReplaceableMetadataImpl>(C));
431 SubclassData32 = NumUnresolved;
434 void UniquableMDNode::resolve() {
435 assert(isUniqued() && "Expected this to be uniqued");
436 assert(!isResolved() && "Expected this to be unresolved");
438 // Move the map, so that this immediately looks resolved.
439 auto Uses = Context.takeReplaceableUses();
441 assert(isResolved() && "Expected this to be resolved");
443 // Drop RAUW support.
444 Uses->resolveAllUses();
447 void UniquableMDNode::resolveAfterOperandChange(Metadata *Old, Metadata *New) {
448 assert(SubclassData32 != 0 && "Expected unresolved operands");
450 // Check if an operand was resolved.
451 if (!isOperandUnresolved(Old)) {
452 if (isOperandUnresolved(New))
453 // An operand was un-resolved!
455 } else if (!isOperandUnresolved(New))
456 decrementUnresolvedOperandCount();
459 void UniquableMDNode::decrementUnresolvedOperandCount() {
460 if (!--SubclassData32)
461 // Last unresolved operand has just been resolved.
465 void UniquableMDNode::resolveCycles() {
469 // Resolve this node immediately.
472 // Resolve all operands.
473 for (const auto &Op : operands()) {
476 assert(!isa<MDNodeFwdDecl>(Op) &&
477 "Expected all forward declarations to be resolved");
478 if (auto *N = dyn_cast<UniquableMDNode>(Op))
479 if (!N->isResolved())
484 void MDTuple::recalculateHash() {
485 setHash(hash_combine_range(op_begin(), op_end()));
488 SmallVector<Metadata *, 8> MDs(op_begin(), op_end());
489 unsigned RawHash = hash_combine_range(MDs.begin(), MDs.end());
490 assert(getHash() == RawHash &&
491 "Expected hash of MDOperand to equal hash of Metadata*");
496 void MDNode::dropAllReferences() {
497 for (unsigned I = 0, E = NumOperands; I != E; ++I)
498 setOperand(I, nullptr);
499 if (auto *N = dyn_cast<UniquableMDNode>(this))
500 if (!N->isResolved()) {
501 N->Context.getReplaceableUses()->resolveAllUses(/* ResolveUsers */ false);
502 (void)N->Context.takeReplaceableUses();
507 /// \brief Make MDOperand transparent for hashing.
509 /// This overload of an implementation detail of the hashing library makes
510 /// MDOperand hash to the same value as a \a Metadata pointer.
512 /// Note that overloading \a hash_value() as follows:
515 /// size_t hash_value(const MDOperand &X) { return hash_value(X.get()); }
518 /// does not cause MDOperand to be transparent. In particular, a bare pointer
519 /// doesn't get hashed before it's combined, whereas \a MDOperand would.
520 static const Metadata *get_hashable_data(const MDOperand &X) { return X.get(); }
523 void UniquableMDNode::handleChangedOperand(void *Ref, Metadata *New) {
524 unsigned Op = static_cast<MDOperand *>(Ref) - op_begin();
525 assert(Op < getNumOperands() && "Expected valid operand");
528 // This node is not uniqued. Just set the operand and be done with it.
533 // This node is uniqued.
536 Metadata *Old = getOperand(Op);
539 // Drop uniquing for self-reference cycles.
543 storeDistinctInContext();
547 // Re-unique the node.
548 auto *Uniqued = uniquify();
549 if (Uniqued == this) {
551 resolveAfterOperandChange(Old, New);
557 // Still unresolved, so RAUW.
559 // First, clear out all operands to prevent any recursion (similar to
560 // dropAllReferences(), but we still need the use-list).
561 for (unsigned O = 0, E = getNumOperands(); O != E; ++O)
562 setOperand(O, nullptr);
563 Context.getReplaceableUses()->replaceAllUsesWith(Uniqued);
568 // Store in non-uniqued form if RAUW isn't possible.
569 storeDistinctInContext();
572 void UniquableMDNode::deleteAsSubclass() {
573 switch (getMetadataID()) {
575 llvm_unreachable("Invalid subclass of UniquableMDNode");
576 #define HANDLE_UNIQUABLE_LEAF(CLASS) \
578 delete cast<CLASS>(this); \
580 #include "llvm/IR/Metadata.def"
584 UniquableMDNode *UniquableMDNode::uniquify() {
585 switch (getMetadataID()) {
587 llvm_unreachable("Invalid subclass of UniquableMDNode");
588 #define HANDLE_UNIQUABLE_LEAF(CLASS) \
590 return cast<CLASS>(this)->uniquifyImpl();
591 #include "llvm/IR/Metadata.def"
595 void UniquableMDNode::eraseFromStore() {
596 switch (getMetadataID()) {
598 llvm_unreachable("Invalid subclass of UniquableMDNode");
599 #define HANDLE_UNIQUABLE_LEAF(CLASS) \
601 cast<CLASS>(this)->eraseFromStoreImpl(); \
603 #include "llvm/IR/Metadata.def"
607 template <class T, class InfoT>
608 static T *getUniqued(DenseSet<T *, InfoT> &Store,
609 const typename InfoT::KeyTy &Key) {
610 auto I = Store.find_as(Key);
611 return I == Store.end() ? nullptr : *I;
614 template <class T, class StoreT>
615 T *UniquableMDNode::storeImpl(T *N, StorageType Storage, StoreT &Store) {
621 N->storeDistinctInContext();
624 llvm_unreachable("Unexpected temporary node");
629 MDTuple *MDTuple::getImpl(LLVMContext &Context, ArrayRef<Metadata *> MDs,
630 StorageType Storage, bool ShouldCreate) {
632 if (Storage == Uniqued) {
633 MDTupleInfo::KeyTy Key(MDs);
634 if (auto *N = getUniqued(Context.pImpl->MDTuples, Key))
640 assert(ShouldCreate && "Expected non-uniqued nodes to always be created");
643 return storeImpl(new (MDs.size()) MDTuple(Context, Storage, Hash, MDs),
644 Storage, Context.pImpl->MDTuples);
647 MDTuple *MDTuple::uniquifyImpl() {
649 auto &Store = getContext().pImpl->MDTuples;
650 if (MDTuple *N = getUniqued(Store, this))
657 void MDTuple::eraseFromStoreImpl() { getContext().pImpl->MDTuples.erase(this); }
659 MDLocation::MDLocation(LLVMContext &C, StorageType Storage, unsigned Line,
660 unsigned Column, ArrayRef<Metadata *> MDs)
661 : UniquableMDNode(C, MDLocationKind, Storage, MDs) {
662 assert((MDs.size() == 1 || MDs.size() == 2) &&
663 "Expected a scope and optional inlined-at");
665 // Set line and column.
666 assert(Line < (1u << 24) && "Expected 24-bit line");
667 assert(Column < (1u << 16) && "Expected 16-bit column");
669 MDNodeSubclassData = Line;
670 SubclassData16 = Column;
673 static void adjustLine(unsigned &Line) {
674 // Set to unknown on overflow. Still use 24 bits for now.
675 if (Line >= (1u << 24))
679 static void adjustColumn(unsigned &Column) {
680 // Set to unknown on overflow. We only have 16 bits to play with here.
681 if (Column >= (1u << 16))
685 MDLocation *MDLocation::getImpl(LLVMContext &Context, unsigned Line,
686 unsigned Column, Metadata *Scope,
687 Metadata *InlinedAt, StorageType Storage,
689 // Fixup line/column.
691 adjustColumn(Column);
693 if (Storage == Uniqued) {
694 if (auto *N = getUniqued(
695 Context.pImpl->MDLocations,
696 MDLocationInfo::KeyTy(Line, Column, Scope, InlinedAt)))
701 assert(ShouldCreate && "Expected non-uniqued nodes to always be created");
704 SmallVector<Metadata *, 2> Ops;
705 Ops.push_back(Scope);
707 Ops.push_back(InlinedAt);
708 return storeImpl(new (Ops.size())
709 MDLocation(Context, Storage, Line, Column, Ops),
710 Storage, Context.pImpl->MDLocations);
713 MDLocation *MDLocation::uniquifyImpl() {
714 auto &Store = getContext().pImpl->MDLocations;
715 if (MDLocation *N = getUniqued(Store, this))
722 void MDLocation::eraseFromStoreImpl() {
723 getContext().pImpl->MDLocations.erase(this);
726 MDNodeFwdDecl *MDNode::getTemporary(LLVMContext &Context,
727 ArrayRef<Metadata *> MDs) {
728 return MDNodeFwdDecl::get(Context, MDs);
731 void MDNode::deleteTemporary(MDNode *N) { delete cast<MDNodeFwdDecl>(N); }
733 void UniquableMDNode::storeDistinctInContext() {
734 assert(isResolved() && "Expected resolved nodes");
736 if (auto *T = dyn_cast<MDTuple>(this))
738 getContext().pImpl->DistinctMDNodes.insert(this);
741 void MDNode::replaceOperandWith(unsigned I, Metadata *New) {
742 if (getOperand(I) == New)
750 cast<UniquableMDNode>(this)->handleChangedOperand(mutable_begin() + I, New);
753 void MDNode::setOperand(unsigned I, Metadata *New) {
754 assert(I < NumOperands);
755 mutable_begin()[I].reset(New, isUniqued() ? this : nullptr);
758 /// \brief Get a node, or a self-reference that looks like it.
760 /// Special handling for finding self-references, for use by \a
761 /// MDNode::concatenate() and \a MDNode::intersect() to maintain behaviour from
762 /// when self-referencing nodes were still uniqued. If the first operand has
763 /// the same operands as \c Ops, return the first operand instead.
764 static MDNode *getOrSelfReference(LLVMContext &Context,
765 ArrayRef<Metadata *> Ops) {
767 if (MDNode *N = dyn_cast_or_null<MDNode>(Ops[0]))
768 if (N->getNumOperands() == Ops.size() && N == N->getOperand(0)) {
769 for (unsigned I = 1, E = Ops.size(); I != E; ++I)
770 if (Ops[I] != N->getOperand(I))
771 return MDNode::get(Context, Ops);
775 return MDNode::get(Context, Ops);
778 MDNode *MDNode::concatenate(MDNode *A, MDNode *B) {
784 SmallVector<Metadata *, 4> MDs(A->getNumOperands() + B->getNumOperands());
787 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i)
788 MDs[j++] = A->getOperand(i);
789 for (unsigned i = 0, ie = B->getNumOperands(); i != ie; ++i)
790 MDs[j++] = B->getOperand(i);
792 // FIXME: This preserves long-standing behaviour, but is it really the right
793 // behaviour? Or was that an unintended side-effect of node uniquing?
794 return getOrSelfReference(A->getContext(), MDs);
797 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {
801 SmallVector<Metadata *, 4> MDs;
802 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i) {
803 Metadata *MD = A->getOperand(i);
804 for (unsigned j = 0, je = B->getNumOperands(); j != je; ++j)
805 if (MD == B->getOperand(j)) {
811 // FIXME: This preserves long-standing behaviour, but is it really the right
812 // behaviour? Or was that an unintended side-effect of node uniquing?
813 return getOrSelfReference(A->getContext(), MDs);
816 MDNode *MDNode::getMostGenericFPMath(MDNode *A, MDNode *B) {
820 APFloat AVal = mdconst::extract<ConstantFP>(A->getOperand(0))->getValueAPF();
821 APFloat BVal = mdconst::extract<ConstantFP>(B->getOperand(0))->getValueAPF();
822 if (AVal.compare(BVal) == APFloat::cmpLessThan)
827 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
828 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
831 static bool canBeMerged(const ConstantRange &A, const ConstantRange &B) {
832 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B);
835 static bool tryMergeRange(SmallVectorImpl<ConstantInt *> &EndPoints,
836 ConstantInt *Low, ConstantInt *High) {
837 ConstantRange NewRange(Low->getValue(), High->getValue());
838 unsigned Size = EndPoints.size();
839 APInt LB = EndPoints[Size - 2]->getValue();
840 APInt LE = EndPoints[Size - 1]->getValue();
841 ConstantRange LastRange(LB, LE);
842 if (canBeMerged(NewRange, LastRange)) {
843 ConstantRange Union = LastRange.unionWith(NewRange);
844 Type *Ty = High->getType();
845 EndPoints[Size - 2] =
846 cast<ConstantInt>(ConstantInt::get(Ty, Union.getLower()));
847 EndPoints[Size - 1] =
848 cast<ConstantInt>(ConstantInt::get(Ty, Union.getUpper()));
854 static void addRange(SmallVectorImpl<ConstantInt *> &EndPoints,
855 ConstantInt *Low, ConstantInt *High) {
856 if (!EndPoints.empty())
857 if (tryMergeRange(EndPoints, Low, High))
860 EndPoints.push_back(Low);
861 EndPoints.push_back(High);
864 MDNode *MDNode::getMostGenericRange(MDNode *A, MDNode *B) {
865 // Given two ranges, we want to compute the union of the ranges. This
866 // is slightly complitade by having to combine the intervals and merge
867 // the ones that overlap.
875 // First, walk both lists in older of the lower boundary of each interval.
876 // At each step, try to merge the new interval to the last one we adedd.
877 SmallVector<ConstantInt *, 4> EndPoints;
880 int AN = A->getNumOperands() / 2;
881 int BN = B->getNumOperands() / 2;
882 while (AI < AN && BI < BN) {
883 ConstantInt *ALow = mdconst::extract<ConstantInt>(A->getOperand(2 * AI));
884 ConstantInt *BLow = mdconst::extract<ConstantInt>(B->getOperand(2 * BI));
886 if (ALow->getValue().slt(BLow->getValue())) {
887 addRange(EndPoints, ALow,
888 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
891 addRange(EndPoints, BLow,
892 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
897 addRange(EndPoints, mdconst::extract<ConstantInt>(A->getOperand(2 * AI)),
898 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
902 addRange(EndPoints, mdconst::extract<ConstantInt>(B->getOperand(2 * BI)),
903 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
907 // If we have more than 2 ranges (4 endpoints) we have to try to merge
908 // the last and first ones.
909 unsigned Size = EndPoints.size();
911 ConstantInt *FB = EndPoints[0];
912 ConstantInt *FE = EndPoints[1];
913 if (tryMergeRange(EndPoints, FB, FE)) {
914 for (unsigned i = 0; i < Size - 2; ++i) {
915 EndPoints[i] = EndPoints[i + 2];
917 EndPoints.resize(Size - 2);
921 // If in the end we have a single range, it is possible that it is now the
922 // full range. Just drop the metadata in that case.
923 if (EndPoints.size() == 2) {
924 ConstantRange Range(EndPoints[0]->getValue(), EndPoints[1]->getValue());
925 if (Range.isFullSet())
929 SmallVector<Metadata *, 4> MDs;
930 MDs.reserve(EndPoints.size());
931 for (auto *I : EndPoints)
932 MDs.push_back(ConstantAsMetadata::get(I));
933 return MDNode::get(A->getContext(), MDs);
936 //===----------------------------------------------------------------------===//
937 // NamedMDNode implementation.
940 static SmallVector<TrackingMDRef, 4> &getNMDOps(void *Operands) {
941 return *(SmallVector<TrackingMDRef, 4> *)Operands;
944 NamedMDNode::NamedMDNode(const Twine &N)
945 : Name(N.str()), Parent(nullptr),
946 Operands(new SmallVector<TrackingMDRef, 4>()) {}
948 NamedMDNode::~NamedMDNode() {
950 delete &getNMDOps(Operands);
953 unsigned NamedMDNode::getNumOperands() const {
954 return (unsigned)getNMDOps(Operands).size();
957 MDNode *NamedMDNode::getOperand(unsigned i) const {
958 assert(i < getNumOperands() && "Invalid Operand number!");
959 auto *N = getNMDOps(Operands)[i].get();
960 return cast_or_null<MDNode>(N);
963 void NamedMDNode::addOperand(MDNode *M) { getNMDOps(Operands).emplace_back(M); }
965 void NamedMDNode::setOperand(unsigned I, MDNode *New) {
966 assert(I < getNumOperands() && "Invalid operand number");
967 getNMDOps(Operands)[I].reset(New);
970 void NamedMDNode::eraseFromParent() {
971 getParent()->eraseNamedMetadata(this);
974 void NamedMDNode::dropAllReferences() {
975 getNMDOps(Operands).clear();
978 StringRef NamedMDNode::getName() const {
979 return StringRef(Name);
982 //===----------------------------------------------------------------------===//
983 // Instruction Metadata method implementations.
986 void Instruction::setMetadata(StringRef Kind, MDNode *Node) {
987 if (!Node && !hasMetadata())
989 setMetadata(getContext().getMDKindID(Kind), Node);
992 MDNode *Instruction::getMetadataImpl(StringRef Kind) const {
993 return getMetadataImpl(getContext().getMDKindID(Kind));
996 void Instruction::dropUnknownMetadata(ArrayRef<unsigned> KnownIDs) {
997 SmallSet<unsigned, 5> KnownSet;
998 KnownSet.insert(KnownIDs.begin(), KnownIDs.end());
1000 // Drop debug if needed
1001 if (KnownSet.erase(LLVMContext::MD_dbg))
1002 DbgLoc = DebugLoc();
1004 if (!hasMetadataHashEntry())
1005 return; // Nothing to remove!
1007 DenseMap<const Instruction *, LLVMContextImpl::MDMapTy> &MetadataStore =
1008 getContext().pImpl->MetadataStore;
1010 if (KnownSet.empty()) {
1011 // Just drop our entry at the store.
1012 MetadataStore.erase(this);
1013 setHasMetadataHashEntry(false);
1017 LLVMContextImpl::MDMapTy &Info = MetadataStore[this];
1020 // Walk the array and drop any metadata we don't know.
1021 for (I = 0, E = Info.size(); I != E;) {
1022 if (KnownSet.count(Info[I].first)) {
1027 Info[I] = std::move(Info.back());
1031 assert(E == Info.size());
1034 // Drop our entry at the store.
1035 MetadataStore.erase(this);
1036 setHasMetadataHashEntry(false);
1040 /// setMetadata - Set the metadata of of the specified kind to the specified
1041 /// node. This updates/replaces metadata if already present, or removes it if
1043 void Instruction::setMetadata(unsigned KindID, MDNode *Node) {
1044 if (!Node && !hasMetadata())
1047 // Handle 'dbg' as a special case since it is not stored in the hash table.
1048 if (KindID == LLVMContext::MD_dbg) {
1049 DbgLoc = DebugLoc::getFromDILocation(Node);
1053 // Handle the case when we're adding/updating metadata on an instruction.
1055 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1056 assert(!Info.empty() == hasMetadataHashEntry() &&
1057 "HasMetadata bit is wonked");
1059 setHasMetadataHashEntry(true);
1061 // Handle replacement of an existing value.
1062 for (auto &P : Info)
1063 if (P.first == KindID) {
1064 P.second.reset(Node);
1069 // No replacement, just add it to the list.
1070 Info.emplace_back(std::piecewise_construct, std::make_tuple(KindID),
1071 std::make_tuple(Node));
1075 // Otherwise, we're removing metadata from an instruction.
1076 assert((hasMetadataHashEntry() ==
1077 (getContext().pImpl->MetadataStore.count(this) > 0)) &&
1078 "HasMetadata bit out of date!");
1079 if (!hasMetadataHashEntry())
1080 return; // Nothing to remove!
1081 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1083 // Common case is removing the only entry.
1084 if (Info.size() == 1 && Info[0].first == KindID) {
1085 getContext().pImpl->MetadataStore.erase(this);
1086 setHasMetadataHashEntry(false);
1090 // Handle removal of an existing value.
1091 for (unsigned i = 0, e = Info.size(); i != e; ++i)
1092 if (Info[i].first == KindID) {
1093 Info[i] = std::move(Info.back());
1095 assert(!Info.empty() && "Removing last entry should be handled above");
1098 // Otherwise, removing an entry that doesn't exist on the instruction.
1101 void Instruction::setAAMetadata(const AAMDNodes &N) {
1102 setMetadata(LLVMContext::MD_tbaa, N.TBAA);
1103 setMetadata(LLVMContext::MD_alias_scope, N.Scope);
1104 setMetadata(LLVMContext::MD_noalias, N.NoAlias);
1107 MDNode *Instruction::getMetadataImpl(unsigned KindID) const {
1108 // Handle 'dbg' as a special case since it is not stored in the hash table.
1109 if (KindID == LLVMContext::MD_dbg)
1110 return DbgLoc.getAsMDNode();
1112 if (!hasMetadataHashEntry()) return nullptr;
1114 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
1115 assert(!Info.empty() && "bit out of sync with hash table");
1117 for (const auto &I : Info)
1118 if (I.first == KindID)
1123 void Instruction::getAllMetadataImpl(
1124 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1127 // Handle 'dbg' as a special case since it is not stored in the hash table.
1128 if (!DbgLoc.isUnknown()) {
1130 std::make_pair((unsigned)LLVMContext::MD_dbg, DbgLoc.getAsMDNode()));
1131 if (!hasMetadataHashEntry()) return;
1134 assert(hasMetadataHashEntry() &&
1135 getContext().pImpl->MetadataStore.count(this) &&
1136 "Shouldn't have called this");
1137 const LLVMContextImpl::MDMapTy &Info =
1138 getContext().pImpl->MetadataStore.find(this)->second;
1139 assert(!Info.empty() && "Shouldn't have called this");
1141 Result.reserve(Result.size() + Info.size());
1142 for (auto &I : Info)
1143 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1145 // Sort the resulting array so it is stable.
1146 if (Result.size() > 1)
1147 array_pod_sort(Result.begin(), Result.end());
1150 void Instruction::getAllMetadataOtherThanDebugLocImpl(
1151 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1153 assert(hasMetadataHashEntry() &&
1154 getContext().pImpl->MetadataStore.count(this) &&
1155 "Shouldn't have called this");
1156 const LLVMContextImpl::MDMapTy &Info =
1157 getContext().pImpl->MetadataStore.find(this)->second;
1158 assert(!Info.empty() && "Shouldn't have called this");
1159 Result.reserve(Result.size() + Info.size());
1160 for (auto &I : Info)
1161 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1163 // Sort the resulting array so it is stable.
1164 if (Result.size() > 1)
1165 array_pod_sort(Result.begin(), Result.end());
1168 /// clearMetadataHashEntries - Clear all hashtable-based metadata from
1169 /// this instruction.
1170 void Instruction::clearMetadataHashEntries() {
1171 assert(hasMetadataHashEntry() && "Caller should check");
1172 getContext().pImpl->MetadataStore.erase(this);
1173 setHasMetadataHashEntry(false);