1 //===-- llvm/Metadata.h - Metadata definitions ------------------*- C++ -*-===//
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 //===----------------------------------------------------------------------===//
11 /// This file contains the declarations for metadata subclasses.
12 /// They represent the different flavors of metadata that live in LLVM.
14 //===----------------------------------------------------------------------===//
16 #ifndef LLVM_IR_METADATA_H
17 #define LLVM_IR_METADATA_H
19 #include "llvm/ADT/ArrayRef.h"
20 #include "llvm/ADT/DenseMap.h"
21 #include "llvm/ADT/ilist_node.h"
22 #include "llvm/ADT/iterator_range.h"
23 #include "llvm/IR/Constant.h"
24 #include "llvm/IR/MetadataTracking.h"
25 #include "llvm/IR/Value.h"
26 #include "llvm/Support/ErrorHandling.h"
27 #include <type_traits>
32 template<typename ValueSubClass, typename ItemParentClass>
33 class SymbolTableListTraits;
36 enum LLVMConstants : uint32_t {
37 DEBUG_METADATA_VERSION = 2 // Current debug info version number.
40 /// \brief Root of the metadata hierarchy.
42 /// This is a root class for typeless data in the IR.
44 friend class ReplaceableMetadataImpl;
47 const unsigned char SubclassID;
50 /// \brief Active type of storage.
51 enum StorageType { Uniqued, Distinct, Temporary };
53 /// \brief Storage flag for non-uniqued, otherwise unowned, metadata.
54 StorageType Storage : 2;
55 // TODO: expose remaining bits to subclasses.
57 unsigned short SubclassData16;
58 unsigned SubclassData32;
65 ConstantAsMetadataKind,
71 Metadata(unsigned ID, StorageType Storage)
72 : SubclassID(ID), Storage(Storage), SubclassData16(0), SubclassData32(0) {
76 /// \brief Default handling of a changed operand, which asserts.
78 /// If subclasses pass themselves in as owners to a tracking node reference,
79 /// they must provide an implementation of this method.
80 void handleChangedOperand(void *, Metadata *) {
81 llvm_unreachable("Unimplemented in Metadata subclass");
85 unsigned getMetadataID() const { return SubclassID; }
87 /// \brief User-friendly dump.
89 void print(raw_ostream &OS) const;
90 void printAsOperand(raw_ostream &OS, bool PrintType = true,
91 const Module *M = nullptr) const;
94 #define HANDLE_METADATA(CLASS) class CLASS;
95 #include "llvm/IR/Metadata.def"
97 inline raw_ostream &operator<<(raw_ostream &OS, const Metadata &MD) {
102 /// \brief Metadata wrapper in the Value hierarchy.
104 /// A member of the \a Value hierarchy to represent a reference to metadata.
105 /// This allows, e.g., instrinsics to have metadata as operands.
107 /// Notably, this is the only thing in either hierarchy that is allowed to
108 /// reference \a LocalAsMetadata.
109 class MetadataAsValue : public Value {
110 friend class ReplaceableMetadataImpl;
111 friend class LLVMContextImpl;
115 MetadataAsValue(Type *Ty, Metadata *MD);
118 /// \brief Drop use of metadata (during teardown).
119 void dropUse() { MD = nullptr; }
122 static MetadataAsValue *get(LLVMContext &Context, Metadata *MD);
123 static MetadataAsValue *getIfExists(LLVMContext &Context, Metadata *MD);
124 Metadata *getMetadata() const { return MD; }
126 static bool classof(const Value *V) {
127 return V->getValueID() == MetadataAsValueVal;
131 void handleChangedMetadata(Metadata *MD);
136 /// \brief Shared implementation of use-lists for replaceable metadata.
138 /// Most metadata cannot be RAUW'ed. This is a shared implementation of
139 /// use-lists and associated API for the two that support it (\a ValueAsMetadata
140 /// and \a TempMDNode).
141 class ReplaceableMetadataImpl {
142 friend class MetadataTracking;
145 typedef MetadataTracking::OwnerTy OwnerTy;
148 LLVMContext &Context;
150 SmallDenseMap<void *, std::pair<OwnerTy, uint64_t>, 4> UseMap;
153 ReplaceableMetadataImpl(LLVMContext &Context)
154 : Context(Context), NextIndex(0) {}
155 ~ReplaceableMetadataImpl() {
156 assert(UseMap.empty() && "Cannot destroy in-use replaceable metadata");
159 LLVMContext &getContext() const { return Context; }
161 /// \brief Replace all uses of this with MD.
163 /// Replace all uses of this with \c MD, which is allowed to be null.
164 void replaceAllUsesWith(Metadata *MD);
166 /// \brief Resolve all uses of this.
168 /// Resolve all uses of this, turning off RAUW permanently. If \c
169 /// ResolveUsers, call \a MDNode::resolve() on any users whose last operand
171 void resolveAllUses(bool ResolveUsers = true);
174 void addRef(void *Ref, OwnerTy Owner);
175 void dropRef(void *Ref);
176 void moveRef(void *Ref, void *New, const Metadata &MD);
178 static ReplaceableMetadataImpl *get(Metadata &MD);
181 /// \brief Value wrapper in the Metadata hierarchy.
183 /// This is a custom value handle that allows other metadata to refer to
184 /// classes in the Value hierarchy.
186 /// Because of full uniquing support, each value is only wrapped by a single \a
187 /// ValueAsMetadata object, so the lookup maps are far more efficient than
188 /// those using ValueHandleBase.
189 class ValueAsMetadata : public Metadata, ReplaceableMetadataImpl {
190 friend class ReplaceableMetadataImpl;
191 friend class LLVMContextImpl;
195 /// \brief Drop users without RAUW (during teardown).
197 ReplaceableMetadataImpl::resolveAllUses(/* ResolveUsers */ false);
201 ValueAsMetadata(unsigned ID, Value *V)
202 : Metadata(ID, Uniqued), ReplaceableMetadataImpl(V->getContext()), V(V) {
203 assert(V && "Expected valid value");
205 ~ValueAsMetadata() {}
208 static ValueAsMetadata *get(Value *V);
209 static ConstantAsMetadata *getConstant(Value *C) {
210 return cast<ConstantAsMetadata>(get(C));
212 static LocalAsMetadata *getLocal(Value *Local) {
213 return cast<LocalAsMetadata>(get(Local));
216 static ValueAsMetadata *getIfExists(Value *V);
217 static ConstantAsMetadata *getConstantIfExists(Value *C) {
218 return cast_or_null<ConstantAsMetadata>(getIfExists(C));
220 static LocalAsMetadata *getLocalIfExists(Value *Local) {
221 return cast_or_null<LocalAsMetadata>(getIfExists(Local));
224 Value *getValue() const { return V; }
225 Type *getType() const { return V->getType(); }
226 LLVMContext &getContext() const { return V->getContext(); }
228 static void handleDeletion(Value *V);
229 static void handleRAUW(Value *From, Value *To);
232 /// \brief Handle collisions after \a Value::replaceAllUsesWith().
234 /// RAUW isn't supported directly for \a ValueAsMetadata, but if the wrapped
235 /// \a Value gets RAUW'ed and the target already exists, this is used to
236 /// merge the two metadata nodes.
237 void replaceAllUsesWith(Metadata *MD) {
238 ReplaceableMetadataImpl::replaceAllUsesWith(MD);
242 static bool classof(const Metadata *MD) {
243 return MD->getMetadataID() == LocalAsMetadataKind ||
244 MD->getMetadataID() == ConstantAsMetadataKind;
248 class ConstantAsMetadata : public ValueAsMetadata {
249 friend class ValueAsMetadata;
251 ConstantAsMetadata(Constant *C)
252 : ValueAsMetadata(ConstantAsMetadataKind, C) {}
255 static ConstantAsMetadata *get(Constant *C) {
256 return ValueAsMetadata::getConstant(C);
258 static ConstantAsMetadata *getIfExists(Constant *C) {
259 return ValueAsMetadata::getConstantIfExists(C);
262 Constant *getValue() const {
263 return cast<Constant>(ValueAsMetadata::getValue());
266 static bool classof(const Metadata *MD) {
267 return MD->getMetadataID() == ConstantAsMetadataKind;
271 class LocalAsMetadata : public ValueAsMetadata {
272 friend class ValueAsMetadata;
274 LocalAsMetadata(Value *Local)
275 : ValueAsMetadata(LocalAsMetadataKind, Local) {
276 assert(!isa<Constant>(Local) && "Expected local value");
280 static LocalAsMetadata *get(Value *Local) {
281 return ValueAsMetadata::getLocal(Local);
283 static LocalAsMetadata *getIfExists(Value *Local) {
284 return ValueAsMetadata::getLocalIfExists(Local);
287 static bool classof(const Metadata *MD) {
288 return MD->getMetadataID() == LocalAsMetadataKind;
292 /// \brief Transitional API for extracting constants from Metadata.
294 /// This namespace contains transitional functions for metadata that points to
297 /// In prehistory -- when metadata was a subclass of \a Value -- \a MDNode
298 /// operands could refer to any \a Value. There's was a lot of code like this:
302 /// auto *CI = dyn_cast<ConstantInt>(N->getOperand(2));
305 /// Now that \a Value and \a Metadata are in separate hierarchies, maintaining
306 /// the semantics for \a isa(), \a cast(), \a dyn_cast() (etc.) requires three
307 /// steps: cast in the \a Metadata hierarchy, extraction of the \a Value, and
308 /// cast in the \a Value hierarchy. Besides creating boiler-plate, this
309 /// requires subtle control flow changes.
311 /// The end-goal is to create a new type of metadata, called (e.g.) \a MDInt,
312 /// so that metadata can refer to numbers without traversing a bridge to the \a
313 /// Value hierarchy. In this final state, the code above would look like this:
317 /// auto *MI = dyn_cast<MDInt>(N->getOperand(2));
320 /// The API in this namespace supports the transition. \a MDInt doesn't exist
321 /// yet, and even once it does, changing each metadata schema to use it is its
322 /// own mini-project. In the meantime this API prevents us from introducing
323 /// complex and bug-prone control flow that will disappear in the end. In
324 /// particular, the above code looks like this:
328 /// auto *CI = mdconst::dyn_extract<ConstantInt>(N->getOperand(2));
331 /// The full set of provided functions includes:
333 /// mdconst::hasa <=> isa
334 /// mdconst::extract <=> cast
335 /// mdconst::extract_or_null <=> cast_or_null
336 /// mdconst::dyn_extract <=> dyn_cast
337 /// mdconst::dyn_extract_or_null <=> dyn_cast_or_null
339 /// The target of the cast must be a subclass of \a Constant.
343 template <class T> T &make();
344 template <class T, class Result> struct HasDereference {
347 template <size_t N> struct SFINAE {};
349 template <class U, class V>
350 static Yes &hasDereference(SFINAE<sizeof(static_cast<V>(*make<U>()))> * = 0);
351 template <class U, class V> static No &hasDereference(...);
353 static const bool value =
354 sizeof(hasDereference<T, Result>(nullptr)) == sizeof(Yes);
356 template <class V, class M> struct IsValidPointer {
357 static const bool value = std::is_base_of<Constant, V>::value &&
358 HasDereference<M, const Metadata &>::value;
360 template <class V, class M> struct IsValidReference {
361 static const bool value = std::is_base_of<Constant, V>::value &&
362 std::is_convertible<M, const Metadata &>::value;
364 } // end namespace detail
366 /// \brief Check whether Metadata has a Value.
368 /// As an analogue to \a isa(), check whether \c MD has an \a Value inside of
370 template <class X, class Y>
371 inline typename std::enable_if<detail::IsValidPointer<X, Y>::value, bool>::type
373 assert(MD && "Null pointer sent into hasa");
374 if (auto *V = dyn_cast<ConstantAsMetadata>(MD))
375 return isa<X>(V->getValue());
378 template <class X, class Y>
380 typename std::enable_if<detail::IsValidReference<X, Y &>::value, bool>::type
385 /// \brief Extract a Value from Metadata.
387 /// As an analogue to \a cast(), extract the \a Value subclass \c X from \c MD.
388 template <class X, class Y>
389 inline typename std::enable_if<detail::IsValidPointer<X, Y>::value, X *>::type
391 return cast<X>(cast<ConstantAsMetadata>(MD)->getValue());
393 template <class X, class Y>
395 typename std::enable_if<detail::IsValidReference<X, Y &>::value, X *>::type
400 /// \brief Extract a Value from Metadata, allowing null.
402 /// As an analogue to \a cast_or_null(), extract the \a Value subclass \c X
403 /// from \c MD, allowing \c MD to be null.
404 template <class X, class Y>
405 inline typename std::enable_if<detail::IsValidPointer<X, Y>::value, X *>::type
406 extract_or_null(Y &&MD) {
407 if (auto *V = cast_or_null<ConstantAsMetadata>(MD))
408 return cast<X>(V->getValue());
412 /// \brief Extract a Value from Metadata, if any.
414 /// As an analogue to \a dyn_cast_or_null(), extract the \a Value subclass \c X
415 /// from \c MD, return null if \c MD doesn't contain a \a Value or if the \a
416 /// Value it does contain is of the wrong subclass.
417 template <class X, class Y>
418 inline typename std::enable_if<detail::IsValidPointer<X, Y>::value, X *>::type
419 dyn_extract(Y &&MD) {
420 if (auto *V = dyn_cast<ConstantAsMetadata>(MD))
421 return dyn_cast<X>(V->getValue());
425 /// \brief Extract a Value from Metadata, if any, allowing null.
427 /// As an analogue to \a dyn_cast_or_null(), extract the \a Value subclass \c X
428 /// from \c MD, return null if \c MD doesn't contain a \a Value or if the \a
429 /// Value it does contain is of the wrong subclass, allowing \c MD to be null.
430 template <class X, class Y>
431 inline typename std::enable_if<detail::IsValidPointer<X, Y>::value, X *>::type
432 dyn_extract_or_null(Y &&MD) {
433 if (auto *V = dyn_cast_or_null<ConstantAsMetadata>(MD))
434 return dyn_cast<X>(V->getValue());
438 } // end namespace mdconst
440 //===----------------------------------------------------------------------===//
441 /// \brief A single uniqued string.
443 /// These are used to efficiently contain a byte sequence for metadata.
444 /// MDString is always unnamed.
445 class MDString : public Metadata {
446 friend class StringMapEntry<MDString>;
448 MDString(const MDString &) LLVM_DELETED_FUNCTION;
449 MDString &operator=(MDString &&) LLVM_DELETED_FUNCTION;
450 MDString &operator=(const MDString &) LLVM_DELETED_FUNCTION;
452 StringMapEntry<MDString> *Entry;
453 MDString() : Metadata(MDStringKind, Uniqued), Entry(nullptr) {}
454 MDString(MDString &&) : Metadata(MDStringKind, Uniqued) {}
457 static MDString *get(LLVMContext &Context, StringRef Str);
458 static MDString *get(LLVMContext &Context, const char *Str) {
459 return get(Context, Str ? StringRef(Str) : StringRef());
462 StringRef getString() const;
464 unsigned getLength() const { return (unsigned)getString().size(); }
466 typedef StringRef::iterator iterator;
468 /// \brief Pointer to the first byte of the string.
469 iterator begin() const { return getString().begin(); }
471 /// \brief Pointer to one byte past the end of the string.
472 iterator end() const { return getString().end(); }
474 const unsigned char *bytes_begin() const { return getString().bytes_begin(); }
475 const unsigned char *bytes_end() const { return getString().bytes_end(); }
477 /// \brief Methods for support type inquiry through isa, cast, and dyn_cast.
478 static bool classof(const Metadata *MD) {
479 return MD->getMetadataID() == MDStringKind;
483 /// \brief A collection of metadata nodes that might be associated with a
484 /// memory access used by the alias-analysis infrastructure.
486 explicit AAMDNodes(MDNode *T = nullptr, MDNode *S = nullptr,
488 : TBAA(T), Scope(S), NoAlias(N) {}
490 bool operator==(const AAMDNodes &A) const {
491 return TBAA == A.TBAA && Scope == A.Scope && NoAlias == A.NoAlias;
494 bool operator!=(const AAMDNodes &A) const { return !(*this == A); }
496 LLVM_EXPLICIT operator bool() const { return TBAA || Scope || NoAlias; }
498 /// \brief The tag for type-based alias analysis.
501 /// \brief The tag for alias scope specification (used with noalias).
504 /// \brief The tag specifying the noalias scope.
508 // Specialize DenseMapInfo for AAMDNodes.
510 struct DenseMapInfo<AAMDNodes> {
511 static inline AAMDNodes getEmptyKey() {
512 return AAMDNodes(DenseMapInfo<MDNode *>::getEmptyKey(), 0, 0);
514 static inline AAMDNodes getTombstoneKey() {
515 return AAMDNodes(DenseMapInfo<MDNode *>::getTombstoneKey(), 0, 0);
517 static unsigned getHashValue(const AAMDNodes &Val) {
518 return DenseMapInfo<MDNode *>::getHashValue(Val.TBAA) ^
519 DenseMapInfo<MDNode *>::getHashValue(Val.Scope) ^
520 DenseMapInfo<MDNode *>::getHashValue(Val.NoAlias);
522 static bool isEqual(const AAMDNodes &LHS, const AAMDNodes &RHS) {
527 /// \brief Tracking metadata reference owned by Metadata.
529 /// Similar to \a TrackingMDRef, but it's expected to be owned by an instance
530 /// of \a Metadata, which has the option of registering itself for callbacks to
531 /// re-unique itself.
533 /// In particular, this is used by \a MDNode.
535 MDOperand(MDOperand &&) LLVM_DELETED_FUNCTION;
536 MDOperand(const MDOperand &) LLVM_DELETED_FUNCTION;
537 MDOperand &operator=(MDOperand &&) LLVM_DELETED_FUNCTION;
538 MDOperand &operator=(const MDOperand &) LLVM_DELETED_FUNCTION;
543 MDOperand() : MD(nullptr) {}
544 ~MDOperand() { untrack(); }
546 Metadata *get() const { return MD; }
547 operator Metadata *() const { return get(); }
548 Metadata *operator->() const { return get(); }
549 Metadata &operator*() const { return *get(); }
555 void reset(Metadata *MD, Metadata *Owner) {
562 void track(Metadata *Owner) {
565 MetadataTracking::track(this, *MD, *Owner);
567 MetadataTracking::track(MD);
571 assert(static_cast<void *>(this) == &MD && "Expected same address");
573 MetadataTracking::untrack(MD);
577 template <> struct simplify_type<MDOperand> {
578 typedef Metadata *SimpleType;
579 static SimpleType getSimplifiedValue(MDOperand &MD) { return MD.get(); }
582 template <> struct simplify_type<const MDOperand> {
583 typedef Metadata *SimpleType;
584 static SimpleType getSimplifiedValue(const MDOperand &MD) { return MD.get(); }
587 /// \brief Pointer to the context, with optional RAUW support.
589 /// Either a raw (non-null) pointer to the \a LLVMContext, or an owned pointer
590 /// to \a ReplaceableMetadataImpl (which has a reference to \a LLVMContext).
591 class ContextAndReplaceableUses {
592 PointerUnion<LLVMContext *, ReplaceableMetadataImpl *> Ptr;
594 ContextAndReplaceableUses() LLVM_DELETED_FUNCTION;
595 ContextAndReplaceableUses(ContextAndReplaceableUses &&)
596 LLVM_DELETED_FUNCTION;
597 ContextAndReplaceableUses(const ContextAndReplaceableUses &)
598 LLVM_DELETED_FUNCTION;
599 ContextAndReplaceableUses &
600 operator=(ContextAndReplaceableUses &&) LLVM_DELETED_FUNCTION;
601 ContextAndReplaceableUses &
602 operator=(const ContextAndReplaceableUses &) LLVM_DELETED_FUNCTION;
605 ContextAndReplaceableUses(LLVMContext &Context) : Ptr(&Context) {}
606 ContextAndReplaceableUses(
607 std::unique_ptr<ReplaceableMetadataImpl> ReplaceableUses)
608 : Ptr(ReplaceableUses.release()) {
609 assert(getReplaceableUses() && "Expected non-null replaceable uses");
611 ~ContextAndReplaceableUses() { delete getReplaceableUses(); }
613 operator LLVMContext &() { return getContext(); }
615 /// \brief Whether this contains RAUW support.
616 bool hasReplaceableUses() const {
617 return Ptr.is<ReplaceableMetadataImpl *>();
619 LLVMContext &getContext() const {
620 if (hasReplaceableUses())
621 return getReplaceableUses()->getContext();
622 return *Ptr.get<LLVMContext *>();
624 ReplaceableMetadataImpl *getReplaceableUses() const {
625 if (hasReplaceableUses())
626 return Ptr.get<ReplaceableMetadataImpl *>();
630 /// \brief Assign RAUW support to this.
632 /// Make this replaceable, taking ownership of \c ReplaceableUses (which must
635 makeReplaceable(std::unique_ptr<ReplaceableMetadataImpl> ReplaceableUses) {
636 assert(ReplaceableUses && "Expected non-null replaceable uses");
637 assert(&ReplaceableUses->getContext() == &getContext() &&
638 "Expected same context");
639 delete getReplaceableUses();
640 Ptr = ReplaceableUses.release();
643 /// \brief Drop RAUW support.
645 /// Cede ownership of RAUW support, returning it.
646 std::unique_ptr<ReplaceableMetadataImpl> takeReplaceableUses() {
647 assert(hasReplaceableUses() && "Expected to own replaceable uses");
648 std::unique_ptr<ReplaceableMetadataImpl> ReplaceableUses(
649 getReplaceableUses());
650 Ptr = &ReplaceableUses->getContext();
651 return ReplaceableUses;
655 struct TempMDNodeDeleter {
656 inline void operator()(MDNode *Node) const;
659 #define HANDLE_MDNODE_LEAF(CLASS) \
660 typedef std::unique_ptr<CLASS, TempMDNodeDeleter> Temp##CLASS;
661 #define HANDLE_MDNODE_BRANCH(CLASS) HANDLE_MDNODE_LEAF(CLASS)
662 #include "llvm/IR/Metadata.def"
664 /// \brief Metadata node.
666 /// Metadata nodes can be uniqued, like constants, or distinct. Temporary
667 /// metadata nodes (with full support for RAUW) can be used to delay uniquing
668 /// until forward references are known. The basic metadata node is an \a
671 /// There is limited support for RAUW at construction time. At construction
672 /// time, if any operand is a temporary node (or an unresolved uniqued node,
673 /// which indicates a transitive temporary operand), the node itself will be
674 /// unresolved. As soon as all operands become resolved, it will drop RAUW
675 /// support permanently.
677 /// If an unresolved node is part of a cycle, \a resolveCycles() needs
678 /// to be called on some member of the cycle once all temporary nodes have been
680 class MDNode : public Metadata {
681 friend class ReplaceableMetadataImpl;
682 friend class LLVMContextImpl;
684 MDNode(const MDNode &) LLVM_DELETED_FUNCTION;
685 void operator=(const MDNode &) LLVM_DELETED_FUNCTION;
686 void *operator new(size_t) LLVM_DELETED_FUNCTION;
688 unsigned NumOperands;
689 unsigned NumUnresolved;
692 ContextAndReplaceableUses Context;
694 void *operator new(size_t Size, unsigned NumOps);
695 void operator delete(void *Mem);
697 /// \brief Required by std, but never called.
698 void operator delete(void *, unsigned) {
699 llvm_unreachable("Constructor throws?");
702 /// \brief Required by std, but never called.
703 void operator delete(void *, unsigned, bool) {
704 llvm_unreachable("Constructor throws?");
707 MDNode(LLVMContext &Context, unsigned ID, StorageType Storage,
708 ArrayRef<Metadata *> Ops1, ArrayRef<Metadata *> Ops2 = None);
711 void dropAllReferences();
713 MDOperand *mutable_begin() { return mutable_end() - NumOperands; }
714 MDOperand *mutable_end() { return reinterpret_cast<MDOperand *>(this); }
717 static inline MDTuple *get(LLVMContext &Context, ArrayRef<Metadata *> MDs);
718 static inline MDTuple *getIfExists(LLVMContext &Context,
719 ArrayRef<Metadata *> MDs);
720 static inline MDTuple *getDistinct(LLVMContext &Context,
721 ArrayRef<Metadata *> MDs);
722 static inline TempMDTuple getTemporary(LLVMContext &Context,
723 ArrayRef<Metadata *> MDs);
725 /// \brief Create a (temporary) clone of this.
726 TempMDNode clone() const;
728 /// \brief Deallocate a node created by getTemporary.
730 /// The node must not have any users.
731 static void deleteTemporary(MDNode *N);
733 LLVMContext &getContext() const { return Context.getContext(); }
735 /// \brief Replace a specific operand.
736 void replaceOperandWith(unsigned I, Metadata *New);
738 /// \brief Check if node is fully resolved.
740 /// If \a isTemporary(), this always returns \c false; if \a isDistinct(),
741 /// this always returns \c true.
743 /// If \a isUniqued(), returns \c true if this has already dropped RAUW
744 /// support (because all operands are resolved).
746 /// As forward declarations are resolved, their containers should get
747 /// resolved automatically. However, if this (or one of its operands) is
748 /// involved in a cycle, \a resolveCycles() needs to be called explicitly.
749 bool isResolved() const { return !Context.hasReplaceableUses(); }
751 bool isUniqued() const { return Storage == Uniqued; }
752 bool isDistinct() const { return Storage == Distinct; }
753 bool isTemporary() const { return Storage == Temporary; }
755 /// \brief RAUW a temporary.
757 /// \pre \a isTemporary() must be \c true.
758 void replaceAllUsesWith(Metadata *MD) {
759 assert(isTemporary() && "Expected temporary node");
760 assert(!isResolved() && "Expected RAUW support");
761 Context.getReplaceableUses()->replaceAllUsesWith(MD);
764 /// \brief Resolve cycles.
766 /// Once all forward declarations have been resolved, force cycles to be
769 /// \pre No operands (or operands' operands, etc.) have \a isTemporary().
770 void resolveCycles();
772 /// \brief Replace a temporary node with a uniqued one.
774 /// Create a uniqued version of \c N -- in place, if possible -- and return
775 /// it. Takes ownership of the temporary node.
777 static typename std::enable_if<std::is_base_of<MDNode, T>::value, T *>::type
778 replaceWithUniqued(std::unique_ptr<T, TempMDNodeDeleter> N) {
779 return cast<T>(N.release()->replaceWithUniquedImpl());
782 /// \brief Replace a temporary node with a distinct one.
784 /// Create a distinct version of \c N -- in place, if possible -- and return
785 /// it. Takes ownership of the temporary node.
787 static typename std::enable_if<std::is_base_of<MDNode, T>::value, T *>::type
788 replaceWithDistinct(std::unique_ptr<T, TempMDNodeDeleter> N) {
789 return cast<T>(N.release()->replaceWithDistinctImpl());
793 MDNode *replaceWithUniquedImpl();
794 MDNode *replaceWithDistinctImpl();
797 /// \brief Set an operand.
799 /// Sets the operand directly, without worrying about uniquing.
800 void setOperand(unsigned I, Metadata *New);
802 void storeDistinctInContext();
803 template <class T, class StoreT>
804 static T *storeImpl(T *N, StorageType Storage, StoreT &Store);
807 void handleChangedOperand(void *Ref, Metadata *New);
810 void resolveAfterOperandChange(Metadata *Old, Metadata *New);
811 void decrementUnresolvedOperandCount();
812 unsigned countUnresolvedOperands();
814 /// \brief Mutate this to be "uniqued".
816 /// Mutate this so that \a isUniqued().
817 /// \pre \a isTemporary().
818 /// \pre already added to uniquing set.
821 /// \brief Mutate this to be "distinct".
823 /// Mutate this so that \a isDistinct().
824 /// \pre \a isTemporary().
827 void deleteAsSubclass();
829 void eraseFromStore();
831 template <class NodeTy> struct HasCachedHash;
832 template <class NodeTy>
833 static void dispatchRecalculateHash(NodeTy *N, std::true_type) {
834 N->recalculateHash();
836 template <class NodeTy>
837 static void dispatchRecalculateHash(NodeTy *N, std::false_type) {}
838 template <class NodeTy>
839 static void dispatchResetHash(NodeTy *N, std::true_type) {
842 template <class NodeTy>
843 static void dispatchResetHash(NodeTy *N, std::false_type) {}
846 typedef const MDOperand *op_iterator;
847 typedef iterator_range<op_iterator> op_range;
849 op_iterator op_begin() const {
850 return const_cast<MDNode *>(this)->mutable_begin();
852 op_iterator op_end() const {
853 return const_cast<MDNode *>(this)->mutable_end();
855 op_range operands() const { return op_range(op_begin(), op_end()); }
857 const MDOperand &getOperand(unsigned I) const {
858 assert(I < NumOperands && "Out of range");
859 return op_begin()[I];
862 /// \brief Return number of MDNode operands.
863 unsigned getNumOperands() const { return NumOperands; }
865 /// \brief Methods for support type inquiry through isa, cast, and dyn_cast:
866 static bool classof(const Metadata *MD) {
867 return MD->getMetadataID() == MDTupleKind ||
868 MD->getMetadataID() == MDLocationKind ||
869 MD->getMetadataID() == GenericDwarfNodeKind;
872 /// \brief Check whether MDNode is a vtable access.
873 bool isTBAAVtableAccess() const;
875 /// \brief Methods for metadata merging.
876 static MDNode *concatenate(MDNode *A, MDNode *B);
877 static MDNode *intersect(MDNode *A, MDNode *B);
878 static MDNode *getMostGenericTBAA(MDNode *A, MDNode *B);
879 static MDNode *getMostGenericFPMath(MDNode *A, MDNode *B);
880 static MDNode *getMostGenericRange(MDNode *A, MDNode *B);
883 /// \brief Tuple of metadata.
885 /// This is the simple \a MDNode arbitrary tuple. Nodes are uniqued by
886 /// default based on their operands.
887 class MDTuple : public MDNode {
888 friend class LLVMContextImpl;
891 MDTuple(LLVMContext &C, StorageType Storage, unsigned Hash,
892 ArrayRef<Metadata *> Vals)
893 : MDNode(C, MDTupleKind, Storage, Vals) {
896 ~MDTuple() { dropAllReferences(); }
898 void setHash(unsigned Hash) { SubclassData32 = Hash; }
899 void recalculateHash();
901 static MDTuple *getImpl(LLVMContext &Context, ArrayRef<Metadata *> MDs,
902 StorageType Storage, bool ShouldCreate = true);
904 TempMDTuple cloneImpl() const {
905 return getTemporary(getContext(),
906 SmallVector<Metadata *, 4>(op_begin(), op_end()));
910 /// \brief Get the hash, if any.
911 unsigned getHash() const { return SubclassData32; }
913 static MDTuple *get(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
914 return getImpl(Context, MDs, Uniqued);
916 static MDTuple *getIfExists(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
917 return getImpl(Context, MDs, Uniqued, /* ShouldCreate */ false);
920 /// \brief Return a distinct node.
922 /// Return a distinct node -- i.e., a node that is not uniqued.
923 static MDTuple *getDistinct(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
924 return getImpl(Context, MDs, Distinct);
927 /// \brief Return a temporary node.
929 /// For use in constructing cyclic MDNode structures. A temporary MDNode is
930 /// not uniqued, may be RAUW'd, and must be manually deleted with
932 static TempMDTuple getTemporary(LLVMContext &Context,
933 ArrayRef<Metadata *> MDs) {
934 return TempMDTuple(getImpl(Context, MDs, Temporary));
937 /// \brief Return a (temporary) clone of this.
938 TempMDTuple clone() const { return cloneImpl(); }
940 static bool classof(const Metadata *MD) {
941 return MD->getMetadataID() == MDTupleKind;
945 MDTuple *MDNode::get(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
946 return MDTuple::get(Context, MDs);
948 MDTuple *MDNode::getIfExists(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
949 return MDTuple::getIfExists(Context, MDs);
951 MDTuple *MDNode::getDistinct(LLVMContext &Context, ArrayRef<Metadata *> MDs) {
952 return MDTuple::getDistinct(Context, MDs);
954 TempMDTuple MDNode::getTemporary(LLVMContext &Context,
955 ArrayRef<Metadata *> MDs) {
956 return MDTuple::getTemporary(Context, MDs);
959 void TempMDNodeDeleter::operator()(MDNode *Node) const {
960 MDNode::deleteTemporary(Node);
963 /// \brief Debug location.
965 /// A debug location in source code, used for debug info and otherwise.
966 class MDLocation : public MDNode {
967 friend class LLVMContextImpl;
970 MDLocation(LLVMContext &C, StorageType Storage, unsigned Line,
971 unsigned Column, ArrayRef<Metadata *> MDs);
972 ~MDLocation() { dropAllReferences(); }
974 static MDLocation *getImpl(LLVMContext &Context, unsigned Line,
975 unsigned Column, Metadata *Scope,
976 Metadata *InlinedAt, StorageType Storage,
977 bool ShouldCreate = true);
979 TempMDLocation cloneImpl() const {
980 return getTemporary(getContext(), getLine(), getColumn(), getScope(),
984 // Disallow replacing operands.
985 void replaceOperandWith(unsigned I, Metadata *New) LLVM_DELETED_FUNCTION;
988 static MDLocation *get(LLVMContext &Context, unsigned Line, unsigned Column,
989 Metadata *Scope, Metadata *InlinedAt = nullptr) {
990 return getImpl(Context, Line, Column, Scope, InlinedAt, Uniqued);
992 static MDLocation *getIfExists(LLVMContext &Context, unsigned Line,
993 unsigned Column, Metadata *Scope,
994 Metadata *InlinedAt = nullptr) {
995 return getImpl(Context, Line, Column, Scope, InlinedAt, Uniqued,
996 /* ShouldCreate */ false);
998 static MDLocation *getDistinct(LLVMContext &Context, unsigned Line,
999 unsigned Column, Metadata *Scope,
1000 Metadata *InlinedAt = nullptr) {
1001 return getImpl(Context, Line, Column, Scope, InlinedAt, Distinct);
1003 static TempMDLocation getTemporary(LLVMContext &Context, unsigned Line,
1004 unsigned Column, Metadata *Scope,
1005 Metadata *InlinedAt = nullptr) {
1006 return TempMDLocation(
1007 getImpl(Context, Line, Column, Scope, InlinedAt, Temporary));
1010 /// \brief Return a (temporary) clone of this.
1011 TempMDLocation clone() const { return cloneImpl(); }
1013 unsigned getLine() const { return SubclassData32; }
1014 unsigned getColumn() const { return SubclassData16; }
1015 Metadata *getScope() const { return getOperand(0); }
1016 Metadata *getInlinedAt() const {
1017 if (getNumOperands() == 2)
1018 return getOperand(1);
1022 static bool classof(const Metadata *MD) {
1023 return MD->getMetadataID() == MDLocationKind;
1027 /// \brief Tagged dwarf node.
1029 /// A metadata node with a DWARF tag.
1030 class DwarfNode : public MDNode {
1031 friend class LLVMContextImpl;
1032 friend class MDNode;
1035 DwarfNode(LLVMContext &C, unsigned ID, StorageType Storage, unsigned Tag,
1036 ArrayRef<Metadata *> Ops1, ArrayRef<Metadata *> Ops2 = None)
1037 : MDNode(C, ID, Storage, Ops1, Ops2) {
1038 assert(Tag < 1u << 16);
1039 SubclassData16 = Tag;
1044 unsigned getTag() const { return SubclassData16; }
1046 static bool classof(const Metadata *MD) {
1047 return MD->getMetadataID() == GenericDwarfNodeKind;
1051 /// \brief Generic tagged dwarf node.
1053 /// A generic metadata node with a DWARF tag that doesn't have special
1055 class GenericDwarfNode : public DwarfNode {
1056 friend class LLVMContextImpl;
1057 friend class MDNode;
1059 GenericDwarfNode(LLVMContext &C, StorageType Storage, unsigned Hash,
1060 unsigned Tag, ArrayRef<Metadata *> Ops1,
1061 ArrayRef<Metadata *> Ops2)
1062 : DwarfNode(C, GenericDwarfNodeKind, Storage, Tag, Ops1, Ops2) {
1065 ~GenericDwarfNode() { dropAllReferences(); }
1067 void setHash(unsigned Hash) { SubclassData32 = Hash; }
1068 void recalculateHash();
1070 static GenericDwarfNode *getImpl(LLVMContext &Context, unsigned Tag,
1072 ArrayRef<Metadata *> DwarfOps,
1073 StorageType Storage,
1074 bool ShouldCreate = true);
1076 TempGenericDwarfNode cloneImpl() const {
1077 return getTemporary(
1078 getContext(), getTag(), getHeader(),
1079 SmallVector<Metadata *, 4>(dwarf_op_begin(), dwarf_op_end()));
1083 unsigned getHash() const { return SubclassData32; }
1085 static GenericDwarfNode *get(LLVMContext &Context,
1088 ArrayRef<Metadata *> DwarfOps) {
1089 return getImpl(Context, Tag, Header, DwarfOps, Uniqued);
1091 static GenericDwarfNode *getIfExists(LLVMContext &Context, unsigned Tag,
1093 ArrayRef<Metadata *> DwarfOps) {
1094 return getImpl(Context, Tag, Header, DwarfOps, Uniqued,
1095 /* ShouldCreate */ false);
1097 static GenericDwarfNode *getDistinct(LLVMContext &Context, unsigned Tag,
1099 ArrayRef<Metadata *> DwarfOps) {
1100 return getImpl(Context, Tag, Header, DwarfOps, Distinct);
1102 static TempGenericDwarfNode getTemporary(LLVMContext &Context, unsigned Tag,
1104 ArrayRef<Metadata *> DwarfOps) {
1105 return TempGenericDwarfNode(
1106 getImpl(Context, Tag, Header, DwarfOps, Temporary));
1109 /// \brief Return a (temporary) clone of this.
1110 TempGenericDwarfNode clone() const { return cloneImpl(); }
1112 unsigned getTag() const { return SubclassData16; }
1113 MDString *getHeader() const { return cast_or_null<MDString>(getOperand(0)); }
1115 op_iterator dwarf_op_begin() const { return op_begin() + 1; }
1116 op_iterator dwarf_op_end() const { return op_end(); }
1117 op_range dwarf_operands() const {
1118 return op_range(dwarf_op_begin(), dwarf_op_end());
1121 unsigned getNumDwarfOperands() const { return getNumOperands() - 1; }
1122 const MDOperand &getDwarfOperand(unsigned I) const {
1123 return getOperand(I + 1);
1125 void replaceDwarfOperandWith(unsigned I, Metadata *New) {
1126 replaceOperandWith(I + 1, New);
1129 static bool classof(const Metadata *MD) {
1130 return MD->getMetadataID() == GenericDwarfNodeKind;
1134 //===----------------------------------------------------------------------===//
1135 /// \brief A tuple of MDNodes.
1137 /// Despite its name, a NamedMDNode isn't itself an MDNode. NamedMDNodes belong
1138 /// to modules, have names, and contain lists of MDNodes.
1140 /// TODO: Inherit from Metadata.
1141 class NamedMDNode : public ilist_node<NamedMDNode> {
1142 friend class SymbolTableListTraits<NamedMDNode, Module>;
1143 friend struct ilist_traits<NamedMDNode>;
1144 friend class LLVMContextImpl;
1145 friend class Module;
1146 NamedMDNode(const NamedMDNode &) LLVM_DELETED_FUNCTION;
1150 void *Operands; // SmallVector<TrackingMDRef, 4>
1152 void setParent(Module *M) { Parent = M; }
1154 explicit NamedMDNode(const Twine &N);
1156 template<class T1, class T2>
1157 class op_iterator_impl :
1158 public std::iterator<std::bidirectional_iterator_tag, T2> {
1159 const NamedMDNode *Node;
1161 op_iterator_impl(const NamedMDNode *N, unsigned i) : Node(N), Idx(i) { }
1163 friend class NamedMDNode;
1166 op_iterator_impl() : Node(nullptr), Idx(0) { }
1168 bool operator==(const op_iterator_impl &o) const { return Idx == o.Idx; }
1169 bool operator!=(const op_iterator_impl &o) const { return Idx != o.Idx; }
1170 op_iterator_impl &operator++() {
1174 op_iterator_impl operator++(int) {
1175 op_iterator_impl tmp(*this);
1179 op_iterator_impl &operator--() {
1183 op_iterator_impl operator--(int) {
1184 op_iterator_impl tmp(*this);
1189 T1 operator*() const { return Node->getOperand(Idx); }
1193 /// \brief Drop all references and remove the node from parent module.
1194 void eraseFromParent();
1196 /// \brief Remove all uses and clear node vector.
1197 void dropAllReferences();
1201 /// \brief Get the module that holds this named metadata collection.
1202 inline Module *getParent() { return Parent; }
1203 inline const Module *getParent() const { return Parent; }
1205 MDNode *getOperand(unsigned i) const;
1206 unsigned getNumOperands() const;
1207 void addOperand(MDNode *M);
1208 void setOperand(unsigned I, MDNode *New);
1209 StringRef getName() const;
1210 void print(raw_ostream &ROS) const;
1213 // ---------------------------------------------------------------------------
1214 // Operand Iterator interface...
1216 typedef op_iterator_impl<MDNode *, MDNode> op_iterator;
1217 op_iterator op_begin() { return op_iterator(this, 0); }
1218 op_iterator op_end() { return op_iterator(this, getNumOperands()); }
1220 typedef op_iterator_impl<const MDNode *, MDNode> const_op_iterator;
1221 const_op_iterator op_begin() const { return const_op_iterator(this, 0); }
1222 const_op_iterator op_end() const { return const_op_iterator(this, getNumOperands()); }
1224 inline iterator_range<op_iterator> operands() {
1225 return iterator_range<op_iterator>(op_begin(), op_end());
1227 inline iterator_range<const_op_iterator> operands() const {
1228 return iterator_range<const_op_iterator>(op_begin(), op_end());
1232 } // end llvm namespace