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/LeakDetector.h"
26 #include "llvm/IR/Module.h"
27 #include "llvm/IR/ValueHandle.h"
31 MetadataAsValue::MetadataAsValue(Type *Ty, Metadata *MD)
32 : Value(Ty, MetadataAsValueVal), MD(MD) {
36 MetadataAsValue::~MetadataAsValue() {
37 getType()->getContext().pImpl->MetadataAsValues.erase(MD);
41 /// \brief Canonicalize metadata arguments to intrinsics.
43 /// To support bitcode upgrades (and assembly semantic sugar) for \a
44 /// MetadataAsValue, we need to canonicalize certain metadata.
46 /// - nullptr is replaced by an empty MDNode.
47 /// - An MDNode with a single null operand is replaced by an empty MDNode.
48 /// - An MDNode whose only operand is a \a ConstantAsMetadata gets skipped.
50 /// This maintains readability of bitcode from when metadata was a type of
51 /// value, and these bridges were unnecessary.
52 static Metadata *canonicalizeMetadataForValue(LLVMContext &Context,
56 return MDNode::get(Context, None);
58 // Return early if this isn't a single-operand MDNode.
59 auto *N = dyn_cast<MDNode>(MD);
60 if (!N || N->getNumOperands() != 1)
63 if (!N->getOperand(0))
65 return MDNode::get(Context, None);
67 if (auto *C = dyn_cast<ConstantAsMetadata>(N->getOperand(0)))
68 // Look through the MDNode.
74 MetadataAsValue *MetadataAsValue::get(LLVMContext &Context, Metadata *MD) {
75 MD = canonicalizeMetadataForValue(Context, MD);
76 auto *&Entry = Context.pImpl->MetadataAsValues[MD];
78 Entry = new MetadataAsValue(Type::getMetadataTy(Context), MD);
82 MetadataAsValue *MetadataAsValue::getIfExists(LLVMContext &Context,
84 MD = canonicalizeMetadataForValue(Context, MD);
85 auto &Store = Context.pImpl->MetadataAsValues;
86 auto I = Store.find(MD);
87 return I == Store.end() ? nullptr : I->second;
90 void MetadataAsValue::handleChangedMetadata(Metadata *MD) {
91 LLVMContext &Context = getContext();
92 MD = canonicalizeMetadataForValue(Context, MD);
93 auto &Store = Context.pImpl->MetadataAsValues;
95 // Stop tracking the old metadata.
96 Store.erase(this->MD);
100 // Start tracking MD, or RAUW if necessary.
101 auto *&Entry = Store[MD];
103 replaceAllUsesWith(Entry);
113 void MetadataAsValue::track() {
115 MetadataTracking::track(&MD, *MD, *this);
118 void MetadataAsValue::untrack() {
120 MetadataTracking::untrack(MD);
123 void ReplaceableMetadataImpl::addRef(void *Ref, OwnerTy Owner) {
125 UseMap.insert(std::make_pair(Ref, std::make_pair(Owner, NextIndex)))
128 assert(WasInserted && "Expected to add a reference");
131 assert(NextIndex != 0 && "Unexpected overflow");
134 void ReplaceableMetadataImpl::dropRef(void *Ref) {
135 bool WasErased = UseMap.erase(Ref);
137 assert(WasErased && "Expected to drop a reference");
140 void ReplaceableMetadataImpl::moveRef(void *Ref, void *New,
141 const Metadata &MD) {
142 auto I = UseMap.find(Ref);
143 assert(I != UseMap.end() && "Expected to move a reference");
144 auto OwnerAndIndex = I->second;
146 bool WasInserted = UseMap.insert(std::make_pair(New, OwnerAndIndex)).second;
148 assert(WasInserted && "Expected to add a reference");
150 // Check that the references are direct if there's no owner.
152 assert((OwnerAndIndex.first || *static_cast<Metadata **>(Ref) == &MD) &&
153 "Reference without owner must be direct");
154 assert((OwnerAndIndex.first || *static_cast<Metadata **>(New) == &MD) &&
155 "Reference without owner must be direct");
158 void ReplaceableMetadataImpl::replaceAllUsesWith(Metadata *MD) {
159 assert(!(MD && isa<MDNodeFwdDecl>(MD)) && "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 OwnerTy Owner = Pair.second.first;
173 // Update unowned tracking references directly.
174 Metadata *&Ref = *static_cast<Metadata **>(Pair.first);
176 MetadataTracking::track(Ref);
177 UseMap.erase(Pair.first);
181 // Check for MetadataAsValue.
182 if (Owner.is<MetadataAsValue *>()) {
183 Owner.get<MetadataAsValue *>()->handleChangedMetadata(MD);
187 // There's a Metadata owner -- dispatch.
188 Metadata *OwnerMD = Owner.get<Metadata *>();
189 switch (OwnerMD->getMetadataID()) {
190 #define HANDLE_METADATA_LEAF(CLASS) \
191 case Metadata::CLASS##Kind: \
192 cast<CLASS>(OwnerMD)->handleChangedOperand(Pair.first, MD); \
194 #include "llvm/IR/Metadata.def"
196 llvm_unreachable("Invalid metadata subclass");
199 assert(UseMap.empty() && "Expected all uses to be replaced");
202 void ReplaceableMetadataImpl::resolveAllUses(bool ResolveUsers) {
211 // Copy out uses since UseMap could get touched below.
212 typedef std::pair<void *, std::pair<OwnerTy, uint64_t>> UseTy;
213 SmallVector<UseTy, 8> Uses(UseMap.begin(), UseMap.end());
214 std::sort(Uses.begin(), Uses.end(), [](const UseTy &L, const UseTy &R) {
215 return L.second.second < R.second.second;
218 for (const auto &Pair : Uses) {
219 auto Owner = Pair.second.first;
222 if (Owner.is<MetadataAsValue *>())
225 // Resolve GenericMDNodes that point at this.
226 auto *OwnerMD = dyn_cast<GenericMDNode>(Owner.get<Metadata *>());
229 if (OwnerMD->isResolved())
231 OwnerMD->decrementUnresolvedOperands();
232 if (!OwnerMD->hasUnresolvedOperands())
237 static Function *getLocalFunction(Value *V) {
238 assert(V && "Expected value");
239 if (auto *A = dyn_cast<Argument>(V))
240 return A->getParent();
241 if (BasicBlock *BB = cast<Instruction>(V)->getParent())
242 return BB->getParent();
246 ValueAsMetadata *ValueAsMetadata::get(Value *V) {
247 assert(V && "Unexpected null Value");
249 auto &Context = V->getContext();
250 auto *&Entry = Context.pImpl->ValuesAsMetadata[V];
252 assert((isa<Constant>(V) || isa<Argument>(V) || isa<Instruction>(V)) &&
253 "Expected constant or function-local value");
254 assert(!V->NameAndIsUsedByMD.getInt() &&
255 "Expected this to be the only metadata use");
256 V->NameAndIsUsedByMD.setInt(true);
257 if (auto *C = dyn_cast<Constant>(V))
258 Entry = new ConstantAsMetadata(Context, C);
260 Entry = new LocalAsMetadata(Context, V);
266 ValueAsMetadata *ValueAsMetadata::getIfExists(Value *V) {
267 assert(V && "Unexpected null Value");
268 return V->getContext().pImpl->ValuesAsMetadata.lookup(V);
271 void ValueAsMetadata::handleDeletion(Value *V) {
272 assert(V && "Expected valid value");
274 auto &Store = V->getType()->getContext().pImpl->ValuesAsMetadata;
275 auto I = Store.find(V);
276 if (I == Store.end())
279 // Remove old entry from the map.
280 ValueAsMetadata *MD = I->second;
281 assert(MD && "Expected valid metadata");
282 assert(MD->getValue() == V && "Expected valid mapping");
285 // Delete the metadata.
286 MD->replaceAllUsesWith(nullptr);
290 void ValueAsMetadata::handleRAUW(Value *From, Value *To) {
291 assert(From && "Expected valid value");
292 assert(To && "Expected valid value");
293 assert(From != To && "Expected changed value");
294 assert(From->getType() == To->getType() && "Unexpected type change");
296 LLVMContext &Context = From->getType()->getContext();
297 auto &Store = Context.pImpl->ValuesAsMetadata;
298 auto I = Store.find(From);
299 if (I == Store.end()) {
300 assert(!From->NameAndIsUsedByMD.getInt() &&
301 "Expected From not to be used by metadata");
305 // Remove old entry from the map.
306 assert(From->NameAndIsUsedByMD.getInt() &&
307 "Expected From to be used by metadata");
308 From->NameAndIsUsedByMD.setInt(false);
309 ValueAsMetadata *MD = I->second;
310 assert(MD && "Expected valid metadata");
311 assert(MD->getValue() == From && "Expected valid mapping");
314 if (isa<LocalAsMetadata>(MD)) {
315 if (auto *C = dyn_cast<Constant>(To)) {
316 // Local became a constant.
317 MD->replaceAllUsesWith(ConstantAsMetadata::get(C));
321 if (getLocalFunction(From) && getLocalFunction(To) &&
322 getLocalFunction(From) != getLocalFunction(To)) {
324 MD->replaceAllUsesWith(nullptr);
328 } else if (!isa<Constant>(To)) {
329 // Changed to function-local value.
330 MD->replaceAllUsesWith(nullptr);
335 auto *&Entry = Store[To];
337 // The target already exists.
338 MD->replaceAllUsesWith(Entry);
343 // Update MD in place (and update the map entry).
344 assert(!To->NameAndIsUsedByMD.getInt() &&
345 "Expected this to be the only metadata use");
346 To->NameAndIsUsedByMD.setInt(true);
351 //===----------------------------------------------------------------------===//
352 // MDString implementation.
355 MDString *MDString::get(LLVMContext &Context, StringRef Str) {
356 auto &Store = Context.pImpl->MDStringCache;
357 auto I = Store.find(Str);
358 if (I != Store.end())
362 StringMapEntry<MDString>::Create(Str, Store.getAllocator(), MDString());
363 bool WasInserted = Store.insert(Entry);
365 assert(WasInserted && "Expected entry to be inserted");
366 Entry->second.Entry = Entry;
367 return &Entry->second;
370 StringRef MDString::getString() const {
371 assert(Entry && "Expected to find string map entry");
372 return Entry->first();
375 //===----------------------------------------------------------------------===//
376 // MDNode implementation.
379 void *MDNode::operator new(size_t Size, unsigned NumOps) {
380 void *Ptr = ::operator new(Size + NumOps * sizeof(MDOperand));
381 MDOperand *First = new (Ptr) MDOperand[NumOps];
382 return First + NumOps;
385 void MDNode::operator delete(void *Mem) {
386 MDNode *N = static_cast<MDNode *>(Mem);
387 MDOperand *Last = static_cast<MDOperand *>(Mem);
388 ::operator delete(Last - N->NumOperands);
391 MDNode::MDNode(LLVMContext &Context, unsigned ID, ArrayRef<Metadata *> MDs)
392 : Metadata(ID), Context(Context), NumOperands(MDs.size()),
393 MDNodeSubclassData(0) {
394 for (unsigned I = 0, E = MDs.size(); I != E; ++I)
395 setOperand(I, MDs[I]);
398 bool MDNode::isResolved() const {
399 if (isa<MDNodeFwdDecl>(this))
401 return cast<GenericMDNode>(this)->isResolved();
404 static bool isOperandUnresolved(Metadata *Op) {
405 if (auto *N = dyn_cast_or_null<MDNode>(Op))
406 return !N->isResolved();
410 GenericMDNode::GenericMDNode(LLVMContext &C, ArrayRef<Metadata *> Vals)
411 : MDNode(C, GenericMDNodeKind, Vals) {
412 // Check whether any operands are unresolved, requiring re-uniquing.
413 for (const auto &Op : operands())
414 if (isOperandUnresolved(Op))
415 incrementUnresolvedOperands();
417 if (hasUnresolvedOperands())
418 ReplaceableUses.reset(new ReplaceableMetadataImpl);
421 GenericMDNode::~GenericMDNode() {
422 LLVMContextImpl *pImpl = getContext().pImpl;
423 if (isStoredDistinctInContext())
424 pImpl->NonUniquedMDNodes.erase(this);
426 pImpl->MDNodeSet.erase(this);
429 void GenericMDNode::resolve() {
430 assert(!isResolved() && "Expected this to be unresolved");
432 // Move the map, so that this immediately looks resolved.
433 auto Uses = std::move(ReplaceableUses);
435 assert(isResolved() && "Expected this to be resolved");
437 // Drop RAUW support.
438 Uses->resolveAllUses();
441 void GenericMDNode::resolveCycles() {
445 // Resolve this node immediately.
448 // Resolve all operands.
449 for (const auto &Op : operands()) {
452 assert(!isa<MDNodeFwdDecl>(Op) &&
453 "Expected all forward declarations to be resolved");
454 if (auto *N = dyn_cast<GenericMDNode>(Op))
455 if (!N->isResolved())
460 void MDNode::dropAllReferences() {
461 for (unsigned I = 0, E = NumOperands; I != E; ++I)
462 setOperand(I, nullptr);
463 if (auto *G = dyn_cast<GenericMDNode>(this))
464 if (!G->isResolved()) {
465 G->ReplaceableUses->resolveAllUses(/* ResolveUsers */ false);
466 G->ReplaceableUses.reset();
471 /// \brief Make MDOperand transparent for hashing.
473 /// This overload of an implementation detail of the hashing library makes
474 /// MDOperand hash to the same value as a \a Metadata pointer.
476 /// Note that overloading \a hash_value() as follows:
479 /// size_t hash_value(const MDOperand &X) { return hash_value(X.get()); }
482 /// does not cause MDOperand to be transparent. In particular, a bare pointer
483 /// doesn't get hashed before it's combined, whereas \a MDOperand would.
484 static const Metadata *get_hashable_data(const MDOperand &X) { return X.get(); }
487 void GenericMDNode::handleChangedOperand(void *Ref, Metadata *New) {
488 unsigned Op = static_cast<MDOperand *>(Ref) - op_begin();
489 assert(Op < getNumOperands() && "Expected valid operand");
491 if (isStoredDistinctInContext()) {
492 assert(isResolved() && "Expected distinct node to be resolved");
494 // This node is not uniqued. Just set the operand and be done with it.
499 auto &Store = getContext().pImpl->MDNodeSet;
502 Metadata *Old = getOperand(Op);
505 // Drop uniquing for self-reference cycles or if an operand drops to null.
507 // FIXME: Stop dropping uniquing when an operand drops to null. The original
508 // motivation was to prevent madness during teardown of LLVMContextImpl, but
509 // dropAllReferences() fixes that problem in a better way. (It's just here
510 // now for better staging of semantic changes.)
511 if (New == this || !New) {
512 storeDistinctInContext();
519 // Re-calculate the hash.
520 setHash(hash_combine_range(op_begin(), op_end()));
523 SmallVector<Metadata *, 8> MDs(op_begin(), op_end());
524 unsigned RawHash = hash_combine_range(MDs.begin(), MDs.end());
525 assert(getHash() == RawHash &&
526 "Expected hash of MDOperand to equal hash of Metadata*");
530 // Re-unique the node.
531 GenericMDNodeInfo::KeyTy Key(this);
532 auto I = Store.find_as(Key);
533 if (I == Store.end()) {
537 // Check if the last unresolved operand has just been resolved; if so,
538 // resolve this as well.
539 if (isOperandUnresolved(Old))
540 decrementUnresolvedOperands();
541 if (isOperandUnresolved(New))
542 incrementUnresolvedOperands();
543 if (!hasUnresolvedOperands())
552 // Still unresolved, so RAUW.
553 ReplaceableUses->replaceAllUsesWith(*I);
558 // Store in non-uniqued form if this node has already been resolved.
560 storeDistinctInContext();
563 MDNode *MDNode::getMDNode(LLVMContext &Context, ArrayRef<Metadata *> MDs,
565 auto &Store = Context.pImpl->MDNodeSet;
567 GenericMDNodeInfo::KeyTy Key(MDs);
568 auto I = Store.find_as(Key);
569 if (I != Store.end())
574 // Coallocate space for the node and Operands together, then placement new.
575 GenericMDNode *N = new (MDs.size()) GenericMDNode(Context, MDs);
576 N->setHash(Key.Hash);
581 MDNodeFwdDecl *MDNode::getTemporary(LLVMContext &Context,
582 ArrayRef<Metadata *> MDs) {
583 MDNodeFwdDecl *N = new (MDs.size()) MDNodeFwdDecl(Context, MDs);
584 LeakDetector::addGarbageObject(N);
588 void MDNode::deleteTemporary(MDNode *N) {
589 assert(isa<MDNodeFwdDecl>(N) && "Expected forward declaration");
590 LeakDetector::removeGarbageObject(N);
591 delete cast<MDNodeFwdDecl>(N);
594 void MDNode::storeDistinctInContext() {
595 assert(!IsDistinctInContext && "Expected newly distinct metadata");
596 IsDistinctInContext = true;
597 auto *G = cast<GenericMDNode>(this);
599 getContext().pImpl->NonUniquedMDNodes.insert(G);
602 // Replace value from this node's operand list.
603 void MDNode::replaceOperandWith(unsigned I, Metadata *New) {
604 if (getOperand(I) == New)
607 if (auto *N = dyn_cast<GenericMDNode>(this)) {
608 N->handleChangedOperand(mutable_begin() + I, New);
612 assert(isa<MDNodeFwdDecl>(this) && "Expected an MDNode");
616 void MDNode::setOperand(unsigned I, Metadata *New) {
617 assert(I < NumOperands);
618 if (isStoredDistinctInContext() || isa<MDNodeFwdDecl>(this))
619 // No need for a callback, this isn't uniqued.
620 mutable_begin()[I].reset(New, nullptr);
622 mutable_begin()[I].reset(New, this);
625 /// \brief Get a node, or a self-reference that looks like it.
627 /// Special handling for finding self-references, for use by \a
628 /// MDNode::concatenate() and \a MDNode::intersect() to maintain behaviour from
629 /// when self-referencing nodes were still uniqued. If the first operand has
630 /// the same operands as \c Ops, return the first operand instead.
631 static MDNode *getOrSelfReference(LLVMContext &Context,
632 ArrayRef<Metadata *> Ops) {
634 if (MDNode *N = dyn_cast_or_null<MDNode>(Ops[0]))
635 if (N->getNumOperands() == Ops.size() && N == N->getOperand(0)) {
636 for (unsigned I = 1, E = Ops.size(); I != E; ++I)
637 if (Ops[I] != N->getOperand(I))
638 return MDNode::get(Context, Ops);
642 return MDNode::get(Context, Ops);
645 MDNode *MDNode::concatenate(MDNode *A, MDNode *B) {
651 SmallVector<Metadata *, 4> MDs(A->getNumOperands() + B->getNumOperands());
654 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i)
655 MDs[j++] = A->getOperand(i);
656 for (unsigned i = 0, ie = B->getNumOperands(); i != ie; ++i)
657 MDs[j++] = B->getOperand(i);
659 // FIXME: This preserves long-standing behaviour, but is it really the right
660 // behaviour? Or was that an unintended side-effect of node uniquing?
661 return getOrSelfReference(A->getContext(), MDs);
664 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {
668 SmallVector<Metadata *, 4> MDs;
669 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i) {
670 Metadata *MD = A->getOperand(i);
671 for (unsigned j = 0, je = B->getNumOperands(); j != je; ++j)
672 if (MD == B->getOperand(j)) {
678 // FIXME: This preserves long-standing behaviour, but is it really the right
679 // behaviour? Or was that an unintended side-effect of node uniquing?
680 return getOrSelfReference(A->getContext(), MDs);
683 MDNode *MDNode::getMostGenericFPMath(MDNode *A, MDNode *B) {
687 APFloat AVal = mdconst::extract<ConstantFP>(A->getOperand(0))->getValueAPF();
688 APFloat BVal = mdconst::extract<ConstantFP>(B->getOperand(0))->getValueAPF();
689 if (AVal.compare(BVal) == APFloat::cmpLessThan)
694 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
695 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
698 static bool canBeMerged(const ConstantRange &A, const ConstantRange &B) {
699 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B);
702 static bool tryMergeRange(SmallVectorImpl<ConstantInt *> &EndPoints,
703 ConstantInt *Low, ConstantInt *High) {
704 ConstantRange NewRange(Low->getValue(), High->getValue());
705 unsigned Size = EndPoints.size();
706 APInt LB = EndPoints[Size - 2]->getValue();
707 APInt LE = EndPoints[Size - 1]->getValue();
708 ConstantRange LastRange(LB, LE);
709 if (canBeMerged(NewRange, LastRange)) {
710 ConstantRange Union = LastRange.unionWith(NewRange);
711 Type *Ty = High->getType();
712 EndPoints[Size - 2] =
713 cast<ConstantInt>(ConstantInt::get(Ty, Union.getLower()));
714 EndPoints[Size - 1] =
715 cast<ConstantInt>(ConstantInt::get(Ty, Union.getUpper()));
721 static void addRange(SmallVectorImpl<ConstantInt *> &EndPoints,
722 ConstantInt *Low, ConstantInt *High) {
723 if (!EndPoints.empty())
724 if (tryMergeRange(EndPoints, Low, High))
727 EndPoints.push_back(Low);
728 EndPoints.push_back(High);
731 MDNode *MDNode::getMostGenericRange(MDNode *A, MDNode *B) {
732 // Given two ranges, we want to compute the union of the ranges. This
733 // is slightly complitade by having to combine the intervals and merge
734 // the ones that overlap.
742 // First, walk both lists in older of the lower boundary of each interval.
743 // At each step, try to merge the new interval to the last one we adedd.
744 SmallVector<ConstantInt *, 4> EndPoints;
747 int AN = A->getNumOperands() / 2;
748 int BN = B->getNumOperands() / 2;
749 while (AI < AN && BI < BN) {
750 ConstantInt *ALow = mdconst::extract<ConstantInt>(A->getOperand(2 * AI));
751 ConstantInt *BLow = mdconst::extract<ConstantInt>(B->getOperand(2 * BI));
753 if (ALow->getValue().slt(BLow->getValue())) {
754 addRange(EndPoints, ALow,
755 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
758 addRange(EndPoints, BLow,
759 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
764 addRange(EndPoints, mdconst::extract<ConstantInt>(A->getOperand(2 * AI)),
765 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
769 addRange(EndPoints, mdconst::extract<ConstantInt>(B->getOperand(2 * BI)),
770 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
774 // If we have more than 2 ranges (4 endpoints) we have to try to merge
775 // the last and first ones.
776 unsigned Size = EndPoints.size();
778 ConstantInt *FB = EndPoints[0];
779 ConstantInt *FE = EndPoints[1];
780 if (tryMergeRange(EndPoints, FB, FE)) {
781 for (unsigned i = 0; i < Size - 2; ++i) {
782 EndPoints[i] = EndPoints[i + 2];
784 EndPoints.resize(Size - 2);
788 // If in the end we have a single range, it is possible that it is now the
789 // full range. Just drop the metadata in that case.
790 if (EndPoints.size() == 2) {
791 ConstantRange Range(EndPoints[0]->getValue(), EndPoints[1]->getValue());
792 if (Range.isFullSet())
796 SmallVector<Metadata *, 4> MDs;
797 MDs.reserve(EndPoints.size());
798 for (auto *I : EndPoints)
799 MDs.push_back(ConstantAsMetadata::get(I));
800 return MDNode::get(A->getContext(), MDs);
803 //===----------------------------------------------------------------------===//
804 // NamedMDNode implementation.
807 static SmallVector<TrackingMDRef, 4> &getNMDOps(void *Operands) {
808 return *(SmallVector<TrackingMDRef, 4> *)Operands;
811 NamedMDNode::NamedMDNode(const Twine &N)
812 : Name(N.str()), Parent(nullptr),
813 Operands(new SmallVector<TrackingMDRef, 4>()) {}
815 NamedMDNode::~NamedMDNode() {
817 delete &getNMDOps(Operands);
820 unsigned NamedMDNode::getNumOperands() const {
821 return (unsigned)getNMDOps(Operands).size();
824 MDNode *NamedMDNode::getOperand(unsigned i) const {
825 assert(i < getNumOperands() && "Invalid Operand number!");
826 auto *N = getNMDOps(Operands)[i].get();
829 return cast_or_null<MDNode>(N);
832 void NamedMDNode::addOperand(MDNode *M) { getNMDOps(Operands).emplace_back(M); }
834 void NamedMDNode::eraseFromParent() {
835 getParent()->eraseNamedMetadata(this);
838 void NamedMDNode::dropAllReferences() {
839 getNMDOps(Operands).clear();
842 StringRef NamedMDNode::getName() const {
843 return StringRef(Name);
846 //===----------------------------------------------------------------------===//
847 // Instruction Metadata method implementations.
850 void Instruction::setMetadata(StringRef Kind, MDNode *Node) {
851 if (!Node && !hasMetadata())
853 setMetadata(getContext().getMDKindID(Kind), Node);
856 MDNode *Instruction::getMetadataImpl(StringRef Kind) const {
857 return getMetadataImpl(getContext().getMDKindID(Kind));
860 void Instruction::dropUnknownMetadata(ArrayRef<unsigned> KnownIDs) {
861 SmallSet<unsigned, 5> KnownSet;
862 KnownSet.insert(KnownIDs.begin(), KnownIDs.end());
864 // Drop debug if needed
865 if (KnownSet.erase(LLVMContext::MD_dbg))
868 if (!hasMetadataHashEntry())
869 return; // Nothing to remove!
871 DenseMap<const Instruction *, LLVMContextImpl::MDMapTy> &MetadataStore =
872 getContext().pImpl->MetadataStore;
874 if (KnownSet.empty()) {
875 // Just drop our entry at the store.
876 MetadataStore.erase(this);
877 setHasMetadataHashEntry(false);
881 LLVMContextImpl::MDMapTy &Info = MetadataStore[this];
884 // Walk the array and drop any metadata we don't know.
885 for (I = 0, E = Info.size(); I != E;) {
886 if (KnownSet.count(Info[I].first)) {
891 Info[I] = std::move(Info.back());
895 assert(E == Info.size());
898 // Drop our entry at the store.
899 MetadataStore.erase(this);
900 setHasMetadataHashEntry(false);
904 /// setMetadata - Set the metadata of of the specified kind to the specified
905 /// node. This updates/replaces metadata if already present, or removes it if
907 void Instruction::setMetadata(unsigned KindID, MDNode *Node) {
908 if (!Node && !hasMetadata())
911 // Handle 'dbg' as a special case since it is not stored in the hash table.
912 if (KindID == LLVMContext::MD_dbg) {
913 DbgLoc = DebugLoc::getFromDILocation(Node);
917 // Handle the case when we're adding/updating metadata on an instruction.
919 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
920 assert(!Info.empty() == hasMetadataHashEntry() &&
921 "HasMetadata bit is wonked");
923 setHasMetadataHashEntry(true);
925 // Handle replacement of an existing value.
927 if (P.first == KindID) {
928 P.second.reset(Node);
933 // No replacement, just add it to the list.
934 Info.emplace_back(std::piecewise_construct, std::make_tuple(KindID),
935 std::make_tuple(Node));
939 // Otherwise, we're removing metadata from an instruction.
940 assert((hasMetadataHashEntry() ==
941 (getContext().pImpl->MetadataStore.count(this) > 0)) &&
942 "HasMetadata bit out of date!");
943 if (!hasMetadataHashEntry())
944 return; // Nothing to remove!
945 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
947 // Common case is removing the only entry.
948 if (Info.size() == 1 && Info[0].first == KindID) {
949 getContext().pImpl->MetadataStore.erase(this);
950 setHasMetadataHashEntry(false);
954 // Handle removal of an existing value.
955 for (unsigned i = 0, e = Info.size(); i != e; ++i)
956 if (Info[i].first == KindID) {
957 Info[i] = std::move(Info.back());
959 assert(!Info.empty() && "Removing last entry should be handled above");
962 // Otherwise, removing an entry that doesn't exist on the instruction.
965 void Instruction::setAAMetadata(const AAMDNodes &N) {
966 setMetadata(LLVMContext::MD_tbaa, N.TBAA);
967 setMetadata(LLVMContext::MD_alias_scope, N.Scope);
968 setMetadata(LLVMContext::MD_noalias, N.NoAlias);
971 MDNode *Instruction::getMetadataImpl(unsigned KindID) const {
972 // Handle 'dbg' as a special case since it is not stored in the hash table.
973 if (KindID == LLVMContext::MD_dbg)
974 return DbgLoc.getAsMDNode();
976 if (!hasMetadataHashEntry()) return nullptr;
978 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
979 assert(!Info.empty() && "bit out of sync with hash table");
981 for (const auto &I : Info)
982 if (I.first == KindID)
987 void Instruction::getAllMetadataImpl(
988 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
991 // Handle 'dbg' as a special case since it is not stored in the hash table.
992 if (!DbgLoc.isUnknown()) {
994 std::make_pair((unsigned)LLVMContext::MD_dbg, DbgLoc.getAsMDNode()));
995 if (!hasMetadataHashEntry()) return;
998 assert(hasMetadataHashEntry() &&
999 getContext().pImpl->MetadataStore.count(this) &&
1000 "Shouldn't have called this");
1001 const LLVMContextImpl::MDMapTy &Info =
1002 getContext().pImpl->MetadataStore.find(this)->second;
1003 assert(!Info.empty() && "Shouldn't have called this");
1005 Result.reserve(Result.size() + Info.size());
1006 for (auto &I : Info)
1007 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1009 // Sort the resulting array so it is stable.
1010 if (Result.size() > 1)
1011 array_pod_sort(Result.begin(), Result.end());
1014 void Instruction::getAllMetadataOtherThanDebugLocImpl(
1015 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1017 assert(hasMetadataHashEntry() &&
1018 getContext().pImpl->MetadataStore.count(this) &&
1019 "Shouldn't have called this");
1020 const LLVMContextImpl::MDMapTy &Info =
1021 getContext().pImpl->MetadataStore.find(this)->second;
1022 assert(!Info.empty() && "Shouldn't have called this");
1023 Result.reserve(Result.size() + Info.size());
1024 for (auto &I : Info)
1025 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1027 // Sort the resulting array so it is stable.
1028 if (Result.size() > 1)
1029 array_pod_sort(Result.begin(), Result.end());
1032 /// clearMetadataHashEntries - Clear all hashtable-based metadata from
1033 /// this instruction.
1034 void Instruction::clearMetadataHashEntries() {
1035 assert(hasMetadataHashEntry() && "Caller should check");
1036 getContext().pImpl->MetadataStore.erase(this);
1037 setHasMetadataHashEntry(false);