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 OwnerTy Owner = Pair.second.first;
172 // Update unowned tracking references directly.
173 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(C);
260 Entry = new LocalAsMetadata(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 *O = static_cast<MDOperand *>(Ptr);
382 for (MDOperand *E = O + NumOps; O != E; ++O)
383 (void)new (O) MDOperand;
387 void MDNode::operator delete(void *Mem) {
388 MDNode *N = static_cast<MDNode *>(Mem);
389 MDOperand *O = static_cast<MDOperand *>(Mem);
390 for (MDOperand *E = O - N->NumOperands; O != E; --O)
391 (O - 1)->~MDOperand();
392 ::operator delete(O);
395 MDNode::MDNode(LLVMContext &Context, unsigned ID, ArrayRef<Metadata *> MDs)
396 : Metadata(ID), Context(Context), NumOperands(MDs.size()),
397 MDNodeSubclassData(0) {
398 for (unsigned I = 0, E = MDs.size(); I != E; ++I)
399 setOperand(I, MDs[I]);
402 bool MDNode::isResolved() const {
403 if (isa<MDNodeFwdDecl>(this))
405 return cast<GenericMDNode>(this)->isResolved();
408 static bool isOperandUnresolved(Metadata *Op) {
409 if (auto *N = dyn_cast_or_null<MDNode>(Op))
410 return !N->isResolved();
414 GenericMDNode::GenericMDNode(LLVMContext &C, ArrayRef<Metadata *> Vals,
416 : MDNode(C, GenericMDNodeKind, Vals) {
420 // Check whether any operands are unresolved, requiring re-uniquing.
421 for (const auto &Op : operands())
422 if (isOperandUnresolved(Op))
423 incrementUnresolvedOperands();
425 if (hasUnresolvedOperands())
426 ReplaceableUses.reset(new ReplaceableMetadataImpl);
429 GenericMDNode::~GenericMDNode() {
430 LLVMContextImpl *pImpl = getContext().pImpl;
431 if (isStoredDistinctInContext())
432 pImpl->NonUniquedMDNodes.erase(this);
434 pImpl->MDNodeSet.erase(this);
438 void GenericMDNode::resolve() {
439 assert(!isResolved() && "Expected this to be unresolved");
441 // Move the map, so that this immediately looks resolved.
442 auto Uses = std::move(ReplaceableUses);
444 assert(isResolved() && "Expected this to be resolved");
446 // Drop RAUW support.
447 Uses->resolveAllUses();
450 void GenericMDNode::resolveCycles() {
454 // Resolve this node immediately.
457 // Resolve all operands.
458 for (const auto &Op : operands()) {
461 assert(!isa<MDNodeFwdDecl>(Op) &&
462 "Expected all forward declarations to be resolved");
463 if (auto *N = dyn_cast<GenericMDNode>(Op))
464 if (!N->isResolved())
469 void MDNode::dropAllReferences() {
470 for (unsigned I = 0, E = NumOperands; I != E; ++I)
471 setOperand(I, nullptr);
472 if (auto *G = dyn_cast<GenericMDNode>(this))
473 if (!G->isResolved()) {
474 G->ReplaceableUses->resolveAllUses(/* ResolveUsers */ false);
475 G->ReplaceableUses.reset();
480 /// \brief Make MDOperand transparent for hashing.
482 /// This overload of an implementation detail of the hashing library makes
483 /// MDOperand hash to the same value as a \a Metadata pointer.
485 /// Note that overloading \a hash_value() as follows:
488 /// size_t hash_value(const MDOperand &X) { return hash_value(X.get()); }
491 /// does not cause MDOperand to be transparent. In particular, a bare pointer
492 /// doesn't get hashed before it's combined, whereas \a MDOperand would.
493 static const Metadata *get_hashable_data(const MDOperand &X) { return X.get(); }
496 void GenericMDNode::handleChangedOperand(void *Ref, Metadata *New) {
497 unsigned Op = static_cast<MDOperand *>(Ref) - op_begin();
498 assert(Op < getNumOperands() && "Expected valid operand");
500 if (isStoredDistinctInContext()) {
501 assert(isResolved() && "Expected distinct node to be resolved");
503 // This node is not uniqued. Just set the operand and be done with it.
508 // We just hit a recursion due to RAUW. Set the operand and move on, since
509 // we're about to be deleted.
511 // FIXME: Can this cycle really happen?
516 auto &Store = getContext().pImpl->MDNodeSet;
519 Metadata *Old = getOperand(Op);
522 // Drop uniquing for self-reference cycles.
524 storeDistinctInContext();
530 // Re-calculate the hash.
531 setHash(hash_combine_range(op_begin(), op_end()));
534 SmallVector<Metadata *, 8> MDs(op_begin(), op_end());
535 unsigned RawHash = hash_combine_range(MDs.begin(), MDs.end());
536 assert(getHash() == RawHash &&
537 "Expected hash of MDOperand to equal hash of Metadata*");
541 // Re-unique the node.
542 GenericMDNodeInfo::KeyTy Key(this);
543 auto I = Store.find_as(Key);
544 if (I == Store.end()) {
548 // Check if the last unresolved operand has just been resolved; if so,
549 // resolve this as well.
550 if (isOperandUnresolved(Old)) {
551 if (!isOperandUnresolved(New)) {
552 decrementUnresolvedOperands();
553 if (!hasUnresolvedOperands())
557 // Operands shouldn't become unresolved.
558 assert(isOperandUnresolved(New) && "Operand just became unresolved");
567 // Still unresolved, so RAUW.
569 ReplaceableUses->replaceAllUsesWith(*I);
574 // Store in non-uniqued form if this node has already been resolved.
575 storeDistinctInContext();
578 MDNode *MDNode::getMDNode(LLVMContext &Context, ArrayRef<Metadata *> MDs,
580 auto &Store = Context.pImpl->MDNodeSet;
582 GenericMDNodeInfo::KeyTy Key(MDs);
583 auto I = Store.find_as(Key);
584 if (I != Store.end())
589 // Coallocate space for the node and Operands together, then placement new.
590 auto *N = new (MDs.size()) GenericMDNode(Context, MDs, /* AllowRAUW */ true);
591 N->setHash(Key.Hash);
596 MDNode *MDNode::getDistinct(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
597 auto *N = new (MDs.size()) GenericMDNode(Context, MDs, /* AllowRAUW */ false);
598 N->storeDistinctInContext();
602 MDNodeFwdDecl *MDNode::getTemporary(LLVMContext &Context,
603 ArrayRef<Metadata *> MDs) {
604 MDNodeFwdDecl *N = new (MDs.size()) MDNodeFwdDecl(Context, MDs);
608 void MDNode::deleteTemporary(MDNode *N) {
609 assert(isa<MDNodeFwdDecl>(N) && "Expected forward declaration");
610 delete cast<MDNodeFwdDecl>(N);
613 void MDNode::storeDistinctInContext() {
614 assert(!IsDistinctInContext && "Expected newly distinct metadata");
615 IsDistinctInContext = true;
616 auto *G = cast<GenericMDNode>(this);
618 getContext().pImpl->NonUniquedMDNodes.insert(G);
621 void MDNode::replaceOperandWith(unsigned I, Metadata *New) {
622 if (getOperand(I) == New)
630 cast<GenericMDNode>(this)->handleChangedOperand(mutable_begin() + I, New);
633 void MDNode::setOperand(unsigned I, Metadata *New) {
634 assert(I < NumOperands);
635 if (isStoredDistinctInContext() || isa<MDNodeFwdDecl>(this))
636 // No need for a callback, this isn't uniqued.
637 mutable_begin()[I].reset(New, nullptr);
639 mutable_begin()[I].reset(New, this);
642 /// \brief Get a node, or a self-reference that looks like it.
644 /// Special handling for finding self-references, for use by \a
645 /// MDNode::concatenate() and \a MDNode::intersect() to maintain behaviour from
646 /// when self-referencing nodes were still uniqued. If the first operand has
647 /// the same operands as \c Ops, return the first operand instead.
648 static MDNode *getOrSelfReference(LLVMContext &Context,
649 ArrayRef<Metadata *> Ops) {
651 if (MDNode *N = dyn_cast_or_null<MDNode>(Ops[0]))
652 if (N->getNumOperands() == Ops.size() && N == N->getOperand(0)) {
653 for (unsigned I = 1, E = Ops.size(); I != E; ++I)
654 if (Ops[I] != N->getOperand(I))
655 return MDNode::get(Context, Ops);
659 return MDNode::get(Context, Ops);
662 MDNode *MDNode::concatenate(MDNode *A, MDNode *B) {
668 SmallVector<Metadata *, 4> MDs(A->getNumOperands() + B->getNumOperands());
671 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i)
672 MDs[j++] = A->getOperand(i);
673 for (unsigned i = 0, ie = B->getNumOperands(); i != ie; ++i)
674 MDs[j++] = B->getOperand(i);
676 // FIXME: This preserves long-standing behaviour, but is it really the right
677 // behaviour? Or was that an unintended side-effect of node uniquing?
678 return getOrSelfReference(A->getContext(), MDs);
681 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {
685 SmallVector<Metadata *, 4> MDs;
686 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i) {
687 Metadata *MD = A->getOperand(i);
688 for (unsigned j = 0, je = B->getNumOperands(); j != je; ++j)
689 if (MD == B->getOperand(j)) {
695 // FIXME: This preserves long-standing behaviour, but is it really the right
696 // behaviour? Or was that an unintended side-effect of node uniquing?
697 return getOrSelfReference(A->getContext(), MDs);
700 MDNode *MDNode::getMostGenericFPMath(MDNode *A, MDNode *B) {
704 APFloat AVal = mdconst::extract<ConstantFP>(A->getOperand(0))->getValueAPF();
705 APFloat BVal = mdconst::extract<ConstantFP>(B->getOperand(0))->getValueAPF();
706 if (AVal.compare(BVal) == APFloat::cmpLessThan)
711 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
712 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
715 static bool canBeMerged(const ConstantRange &A, const ConstantRange &B) {
716 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B);
719 static bool tryMergeRange(SmallVectorImpl<ConstantInt *> &EndPoints,
720 ConstantInt *Low, ConstantInt *High) {
721 ConstantRange NewRange(Low->getValue(), High->getValue());
722 unsigned Size = EndPoints.size();
723 APInt LB = EndPoints[Size - 2]->getValue();
724 APInt LE = EndPoints[Size - 1]->getValue();
725 ConstantRange LastRange(LB, LE);
726 if (canBeMerged(NewRange, LastRange)) {
727 ConstantRange Union = LastRange.unionWith(NewRange);
728 Type *Ty = High->getType();
729 EndPoints[Size - 2] =
730 cast<ConstantInt>(ConstantInt::get(Ty, Union.getLower()));
731 EndPoints[Size - 1] =
732 cast<ConstantInt>(ConstantInt::get(Ty, Union.getUpper()));
738 static void addRange(SmallVectorImpl<ConstantInt *> &EndPoints,
739 ConstantInt *Low, ConstantInt *High) {
740 if (!EndPoints.empty())
741 if (tryMergeRange(EndPoints, Low, High))
744 EndPoints.push_back(Low);
745 EndPoints.push_back(High);
748 MDNode *MDNode::getMostGenericRange(MDNode *A, MDNode *B) {
749 // Given two ranges, we want to compute the union of the ranges. This
750 // is slightly complitade by having to combine the intervals and merge
751 // the ones that overlap.
759 // First, walk both lists in older of the lower boundary of each interval.
760 // At each step, try to merge the new interval to the last one we adedd.
761 SmallVector<ConstantInt *, 4> EndPoints;
764 int AN = A->getNumOperands() / 2;
765 int BN = B->getNumOperands() / 2;
766 while (AI < AN && BI < BN) {
767 ConstantInt *ALow = mdconst::extract<ConstantInt>(A->getOperand(2 * AI));
768 ConstantInt *BLow = mdconst::extract<ConstantInt>(B->getOperand(2 * BI));
770 if (ALow->getValue().slt(BLow->getValue())) {
771 addRange(EndPoints, ALow,
772 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
775 addRange(EndPoints, BLow,
776 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
781 addRange(EndPoints, mdconst::extract<ConstantInt>(A->getOperand(2 * AI)),
782 mdconst::extract<ConstantInt>(A->getOperand(2 * AI + 1)));
786 addRange(EndPoints, mdconst::extract<ConstantInt>(B->getOperand(2 * BI)),
787 mdconst::extract<ConstantInt>(B->getOperand(2 * BI + 1)));
791 // If we have more than 2 ranges (4 endpoints) we have to try to merge
792 // the last and first ones.
793 unsigned Size = EndPoints.size();
795 ConstantInt *FB = EndPoints[0];
796 ConstantInt *FE = EndPoints[1];
797 if (tryMergeRange(EndPoints, FB, FE)) {
798 for (unsigned i = 0; i < Size - 2; ++i) {
799 EndPoints[i] = EndPoints[i + 2];
801 EndPoints.resize(Size - 2);
805 // If in the end we have a single range, it is possible that it is now the
806 // full range. Just drop the metadata in that case.
807 if (EndPoints.size() == 2) {
808 ConstantRange Range(EndPoints[0]->getValue(), EndPoints[1]->getValue());
809 if (Range.isFullSet())
813 SmallVector<Metadata *, 4> MDs;
814 MDs.reserve(EndPoints.size());
815 for (auto *I : EndPoints)
816 MDs.push_back(ConstantAsMetadata::get(I));
817 return MDNode::get(A->getContext(), MDs);
820 //===----------------------------------------------------------------------===//
821 // NamedMDNode implementation.
824 static SmallVector<TrackingMDRef, 4> &getNMDOps(void *Operands) {
825 return *(SmallVector<TrackingMDRef, 4> *)Operands;
828 NamedMDNode::NamedMDNode(const Twine &N)
829 : Name(N.str()), Parent(nullptr),
830 Operands(new SmallVector<TrackingMDRef, 4>()) {}
832 NamedMDNode::~NamedMDNode() {
834 delete &getNMDOps(Operands);
837 unsigned NamedMDNode::getNumOperands() const {
838 return (unsigned)getNMDOps(Operands).size();
841 MDNode *NamedMDNode::getOperand(unsigned i) const {
842 assert(i < getNumOperands() && "Invalid Operand number!");
843 auto *N = getNMDOps(Operands)[i].get();
844 return cast_or_null<MDNode>(N);
847 void NamedMDNode::addOperand(MDNode *M) { getNMDOps(Operands).emplace_back(M); }
849 void NamedMDNode::setOperand(unsigned I, MDNode *New) {
850 assert(I < getNumOperands() && "Invalid operand number");
851 getNMDOps(Operands)[I].reset(New);
854 void NamedMDNode::eraseFromParent() {
855 getParent()->eraseNamedMetadata(this);
858 void NamedMDNode::dropAllReferences() {
859 getNMDOps(Operands).clear();
862 StringRef NamedMDNode::getName() const {
863 return StringRef(Name);
866 //===----------------------------------------------------------------------===//
867 // Instruction Metadata method implementations.
870 void Instruction::setMetadata(StringRef Kind, MDNode *Node) {
871 if (!Node && !hasMetadata())
873 setMetadata(getContext().getMDKindID(Kind), Node);
876 MDNode *Instruction::getMetadataImpl(StringRef Kind) const {
877 return getMetadataImpl(getContext().getMDKindID(Kind));
880 void Instruction::dropUnknownMetadata(ArrayRef<unsigned> KnownIDs) {
881 SmallSet<unsigned, 5> KnownSet;
882 KnownSet.insert(KnownIDs.begin(), KnownIDs.end());
884 // Drop debug if needed
885 if (KnownSet.erase(LLVMContext::MD_dbg))
888 if (!hasMetadataHashEntry())
889 return; // Nothing to remove!
891 DenseMap<const Instruction *, LLVMContextImpl::MDMapTy> &MetadataStore =
892 getContext().pImpl->MetadataStore;
894 if (KnownSet.empty()) {
895 // Just drop our entry at the store.
896 MetadataStore.erase(this);
897 setHasMetadataHashEntry(false);
901 LLVMContextImpl::MDMapTy &Info = MetadataStore[this];
904 // Walk the array and drop any metadata we don't know.
905 for (I = 0, E = Info.size(); I != E;) {
906 if (KnownSet.count(Info[I].first)) {
911 Info[I] = std::move(Info.back());
915 assert(E == Info.size());
918 // Drop our entry at the store.
919 MetadataStore.erase(this);
920 setHasMetadataHashEntry(false);
924 /// setMetadata - Set the metadata of of the specified kind to the specified
925 /// node. This updates/replaces metadata if already present, or removes it if
927 void Instruction::setMetadata(unsigned KindID, MDNode *Node) {
928 if (!Node && !hasMetadata())
931 // Handle 'dbg' as a special case since it is not stored in the hash table.
932 if (KindID == LLVMContext::MD_dbg) {
933 DbgLoc = DebugLoc::getFromDILocation(Node);
937 // Handle the case when we're adding/updating metadata on an instruction.
939 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
940 assert(!Info.empty() == hasMetadataHashEntry() &&
941 "HasMetadata bit is wonked");
943 setHasMetadataHashEntry(true);
945 // Handle replacement of an existing value.
947 if (P.first == KindID) {
948 P.second.reset(Node);
953 // No replacement, just add it to the list.
954 Info.emplace_back(std::piecewise_construct, std::make_tuple(KindID),
955 std::make_tuple(Node));
959 // Otherwise, we're removing metadata from an instruction.
960 assert((hasMetadataHashEntry() ==
961 (getContext().pImpl->MetadataStore.count(this) > 0)) &&
962 "HasMetadata bit out of date!");
963 if (!hasMetadataHashEntry())
964 return; // Nothing to remove!
965 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
967 // Common case is removing the only entry.
968 if (Info.size() == 1 && Info[0].first == KindID) {
969 getContext().pImpl->MetadataStore.erase(this);
970 setHasMetadataHashEntry(false);
974 // Handle removal of an existing value.
975 for (unsigned i = 0, e = Info.size(); i != e; ++i)
976 if (Info[i].first == KindID) {
977 Info[i] = std::move(Info.back());
979 assert(!Info.empty() && "Removing last entry should be handled above");
982 // Otherwise, removing an entry that doesn't exist on the instruction.
985 void Instruction::setAAMetadata(const AAMDNodes &N) {
986 setMetadata(LLVMContext::MD_tbaa, N.TBAA);
987 setMetadata(LLVMContext::MD_alias_scope, N.Scope);
988 setMetadata(LLVMContext::MD_noalias, N.NoAlias);
991 MDNode *Instruction::getMetadataImpl(unsigned KindID) const {
992 // Handle 'dbg' as a special case since it is not stored in the hash table.
993 if (KindID == LLVMContext::MD_dbg)
994 return DbgLoc.getAsMDNode();
996 if (!hasMetadataHashEntry()) return nullptr;
998 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
999 assert(!Info.empty() && "bit out of sync with hash table");
1001 for (const auto &I : Info)
1002 if (I.first == KindID)
1007 void Instruction::getAllMetadataImpl(
1008 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1011 // Handle 'dbg' as a special case since it is not stored in the hash table.
1012 if (!DbgLoc.isUnknown()) {
1014 std::make_pair((unsigned)LLVMContext::MD_dbg, DbgLoc.getAsMDNode()));
1015 if (!hasMetadataHashEntry()) return;
1018 assert(hasMetadataHashEntry() &&
1019 getContext().pImpl->MetadataStore.count(this) &&
1020 "Shouldn't have called this");
1021 const LLVMContextImpl::MDMapTy &Info =
1022 getContext().pImpl->MetadataStore.find(this)->second;
1023 assert(!Info.empty() && "Shouldn't have called this");
1025 Result.reserve(Result.size() + Info.size());
1026 for (auto &I : Info)
1027 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1029 // Sort the resulting array so it is stable.
1030 if (Result.size() > 1)
1031 array_pod_sort(Result.begin(), Result.end());
1034 void Instruction::getAllMetadataOtherThanDebugLocImpl(
1035 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
1037 assert(hasMetadataHashEntry() &&
1038 getContext().pImpl->MetadataStore.count(this) &&
1039 "Shouldn't have called this");
1040 const LLVMContextImpl::MDMapTy &Info =
1041 getContext().pImpl->MetadataStore.find(this)->second;
1042 assert(!Info.empty() && "Shouldn't have called this");
1043 Result.reserve(Result.size() + Info.size());
1044 for (auto &I : Info)
1045 Result.push_back(std::make_pair(I.first, cast<MDNode>(I.second.get())));
1047 // Sort the resulting array so it is stable.
1048 if (Result.size() > 1)
1049 array_pod_sort(Result.begin(), Result.end());
1052 /// clearMetadataHashEntries - Clear all hashtable-based metadata from
1053 /// this instruction.
1054 void Instruction::clearMetadataHashEntries() {
1055 assert(hasMetadataHashEntry() && "Caller should check");
1056 getContext().pImpl->MetadataStore.erase(this);
1057 setHasMetadataHashEntry(false);