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 Metadata::Metadata(LLVMContext &Context, unsigned ID)
32 : Value(Type::getMetadataTy(Context), ID) {}
34 //===----------------------------------------------------------------------===//
35 // MDString implementation.
38 void MDString::anchor() { }
40 MDString *MDString::get(LLVMContext &Context, StringRef Str) {
41 auto &Store = Context.pImpl->MDStringCache;
42 auto I = Store.find(Str);
47 StringMapEntry<MDString>::Create(Str, Store.getAllocator(), Context);
48 bool WasInserted = Store.insert(Entry);
50 assert(WasInserted && "Expected entry to be inserted");
51 Entry->second.Entry = Entry;
52 return &Entry->second;
55 StringRef MDString::getString() const {
56 assert(Entry && "Expected to find string map entry");
57 return Entry->first();
60 //===----------------------------------------------------------------------===//
61 // MDNodeOperand implementation.
64 // Use CallbackVH to hold MDNode operands.
66 class MDNodeOperand : public CallbackVH {
68 MDNodeOperand *Cur = this;
70 while (Cur->getValPtrInt() != 1)
73 assert(Cur->getValPtrInt() == 1 &&
74 "Couldn't find the end of the operand list!");
75 return reinterpret_cast<MDNode *>(Cur + 1);
80 virtual ~MDNodeOperand();
83 unsigned IsLast = this->getValPtrInt();
85 this->setAsLastOperand(IsLast);
88 /// \brief Accessor method to mark the operand as the first in the list.
89 void setAsLastOperand(unsigned I) { this->setValPtrInt(I); }
91 void deleted() override;
92 void allUsesReplacedWith(Value *NV) override;
94 } // end namespace llvm.
96 // Provide out-of-line definition to prevent weak vtable.
97 MDNodeOperand::~MDNodeOperand() {}
99 void MDNodeOperand::deleted() {
100 getParent()->replaceOperand(this, nullptr);
103 void MDNodeOperand::allUsesReplacedWith(Value *NV) {
104 getParent()->replaceOperand(this, NV);
107 //===----------------------------------------------------------------------===//
108 // MDNode implementation.
111 /// \brief Get the MDNodeOperand's coallocated on the end of the MDNode.
112 static MDNodeOperand *getOperandPtr(MDNode *N, unsigned Op) {
113 // Use <= instead of < to permit a one-past-the-end address.
114 assert(Op <= N->getNumOperands() && "Invalid operand number");
115 return reinterpret_cast<MDNodeOperand *>(N) - N->getNumOperands() + Op;
118 void MDNode::replaceOperandWith(unsigned i, Value *Val) {
119 MDNodeOperand *Op = getOperandPtr(this, i);
120 replaceOperand(Op, Val);
123 void *MDNode::operator new(size_t Size, unsigned NumOps) {
124 void *Ptr = ::operator new(Size + NumOps * sizeof(MDNodeOperand));
125 MDNodeOperand *Op = static_cast<MDNodeOperand *>(Ptr);
127 MDNodeOperand *Last = Op + NumOps;
128 for (; Op != Last; ++Op)
129 new (Op) MDNodeOperand();
130 (Op - 1)->setAsLastOperand(1);
135 void MDNode::operator delete(void *Mem) {
136 MDNode *N = static_cast<MDNode *>(Mem);
137 MDNodeOperand *Op = static_cast<MDNodeOperand *>(Mem);
138 for (unsigned I = 0, E = N->NumOperands; I != E; ++I)
139 (--Op)->~MDNodeOperand();
140 ::operator delete(Op);
143 MDNode::MDNode(LLVMContext &C, unsigned ID, ArrayRef<Value *> Vals,
144 bool isFunctionLocal)
146 NumOperands = Vals.size();
149 setValueSubclassData(getSubclassDataFromValue() | FunctionLocalBit);
151 // Initialize the operand list.
153 for (MDNodeOperand *Op = getOperandPtr(this, 0), *E = Op + NumOperands;
158 GenericMDNode::~GenericMDNode() {
159 LLVMContextImpl *pImpl = getType()->getContext().pImpl;
160 if (isNotUniqued()) {
161 pImpl->NonUniquedMDNodes.erase(this);
163 pImpl->MDNodeSet.erase(this);
167 void GenericMDNode::dropAllReferences() {
168 for (MDNodeOperand *Op = getOperandPtr(this, 0), *E = Op + NumOperands;
173 static const Function *getFunctionForValue(Value *V) {
174 if (!V) return nullptr;
175 if (Instruction *I = dyn_cast<Instruction>(V)) {
176 BasicBlock *BB = I->getParent();
177 return BB ? BB->getParent() : nullptr;
179 if (Argument *A = dyn_cast<Argument>(V))
180 return A->getParent();
181 if (BasicBlock *BB = dyn_cast<BasicBlock>(V))
182 return BB->getParent();
183 if (MDNode *MD = dyn_cast<MDNode>(V))
184 return MD->getFunction();
188 // getFunction - If this metadata is function-local and recursively has a
189 // function-local operand, return the first such operand's parent function.
190 // Otherwise, return null. getFunction() should not be used for performance-
191 // critical code because it recursively visits all the MDNode's operands.
192 const Function *MDNode::getFunction() const {
193 if (!isFunctionLocal())
195 assert(getNumOperands() == 1 &&
196 "Expected one operand for function-local metadata");
197 assert(getOperand(0) &&
198 "Expected non-null operand for function-local metadata");
199 assert(!getOperand(0)->getType()->isMetadataTy() &&
200 "Expected non-metadata as operand of function-local metadata");
201 return getFunctionForValue(getOperand(0));
204 /// \brief Check if the Value would require a function-local MDNode.
205 static bool isFunctionLocalValue(Value *V) {
206 return isa<Instruction>(V) || isa<Argument>(V) || isa<BasicBlock>(V) ||
207 (isa<MDNode>(V) && cast<MDNode>(V)->isFunctionLocal());
210 MDNode *MDNode::getMDNode(LLVMContext &Context, ArrayRef<Value*> Vals,
211 FunctionLocalness FL, bool Insert) {
212 auto &Store = Context.pImpl->MDNodeSet;
214 GenericMDNodeInfo::KeyTy Key(Vals);
215 auto I = Store.find_as(Key);
216 if (I != Store.end())
221 bool isFunctionLocal = false;
224 for (Value *V : Vals) {
226 if (isFunctionLocalValue(V)) {
227 isFunctionLocal = true;
233 isFunctionLocal = false;
236 isFunctionLocal = true;
240 if (isFunctionLocal) {
241 assert(Vals.size() == 1 &&
242 "Expected exactly one operand for function-local metadata");
243 assert(Vals[0] && "Expected non-null operand for function-local metadata");
244 assert(!Vals[0]->getType()->isMetadataTy() &&
245 "Expected non-metadata as operand of function-local metadata");
248 // Coallocate space for the node and Operands together, then placement new.
250 new (Vals.size()) GenericMDNode(Context, Vals, isFunctionLocal);
257 MDNode *MDNode::get(LLVMContext &Context, ArrayRef<Value*> Vals) {
258 return getMDNode(Context, Vals, FL_Unknown);
261 MDNode *MDNode::getWhenValsUnresolved(LLVMContext &Context,
262 ArrayRef<Value*> Vals,
263 bool isFunctionLocal) {
264 return getMDNode(Context, Vals, isFunctionLocal ? FL_Yes : FL_No);
267 MDNode *MDNode::getIfExists(LLVMContext &Context, ArrayRef<Value*> Vals) {
268 return getMDNode(Context, Vals, FL_Unknown, false);
271 MDNode *MDNode::getTemporary(LLVMContext &Context, ArrayRef<Value*> Vals) {
272 MDNode *N = new (Vals.size()) MDNodeFwdDecl(Context, Vals, FL_No);
273 N->setValueSubclassData(N->getSubclassDataFromValue() | NotUniquedBit);
274 LeakDetector::addGarbageObject(N);
278 void MDNode::deleteTemporary(MDNode *N) {
279 assert(N->use_empty() && "Temporary MDNode has uses!");
280 assert(isa<MDNodeFwdDecl>(N) && "Expected forward declaration");
281 assert((N->getSubclassDataFromValue() & NotUniquedBit) &&
282 "Temporary MDNode does not have NotUniquedBit set!");
283 LeakDetector::removeGarbageObject(N);
284 delete cast<MDNodeFwdDecl>(N);
287 /// \brief Return specified operand.
288 Value *MDNode::getOperand(unsigned i) const {
289 assert(i < getNumOperands() && "Invalid operand number");
290 return *getOperandPtr(const_cast<MDNode*>(this), i);
293 void MDNode::setIsNotUniqued() {
294 setValueSubclassData(getSubclassDataFromValue() | NotUniquedBit);
295 LLVMContextImpl *pImpl = getType()->getContext().pImpl;
296 auto *G = cast<GenericMDNode>(this);
298 pImpl->NonUniquedMDNodes.insert(G);
301 // Replace value from this node's operand list.
302 void MDNode::replaceOperand(MDNodeOperand *Op, Value *To) {
305 // If is possible that someone did GV->RAUW(inst), replacing a global variable
306 // with an instruction or some other function-local object. If this is a
307 // non-function-local MDNode, it can't point to a function-local object.
308 // Handle this case by implicitly dropping the MDNode reference to null.
309 // Likewise if the MDNode is function-local but for a different function.
310 if (To && isFunctionLocalValue(To)) {
311 assert(!To->getType()->isMetadataTy() &&
312 "Expected non-metadata as operand of function-local metadata");
313 if (!isFunctionLocal())
316 const Function *F = getFunction();
317 const Function *FV = getFunctionForValue(To);
318 // Metadata can be function-local without having an associated function.
319 // So only consider functions to have changed if non-null.
320 if (F && FV && F != FV)
328 // If this MDValue was previously function-local but no longer is, clear
329 // its function-local flag.
330 if (isFunctionLocal() && !(To && isFunctionLocalValue(To))) {
331 assert(getNumOperands() == 1 &&
332 "Expected function-local metadata to have exactly one operand");
333 setValueSubclassData(getSubclassDataFromValue() & ~FunctionLocalBit);
336 // If this node is already not being uniqued (because one of the operands
337 // already went to null), then there is nothing else to do here.
338 if (isNotUniqued()) {
343 auto &Store = getContext().pImpl->MDNodeSet;
344 auto *N = cast<GenericMDNode>(this);
346 // Remove "this" from the context map.
349 // Update the operand.
352 // If we are dropping an argument to null, we choose to not unique the MDNode
353 // anymore. This commonly occurs during destruction, and uniquing these
354 // brings little reuse. Also, this means we don't need to include
355 // isFunctionLocal bits in the hash for MDNodes.
357 // Also drop uniquing if this has a reference to itself.
358 if (!To || To == this) {
363 // Now that the node is out of the table, get ready to reinsert it. First,
364 // check to see if another node with the same operands already exists in the
365 // set. If so, then this node is redundant.
366 SmallVector<Value *, 8> Vals;
367 GenericMDNodeInfo::KeyTy Key(N, Vals);
368 auto I = Store.find_as(Key);
369 if (I != Store.end()) {
370 N->replaceAllUsesWith(*I);
379 MDNode *MDNode::concatenate(MDNode *A, MDNode *B) {
385 SmallVector<Value *, 4> Vals(A->getNumOperands() +
386 B->getNumOperands());
389 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i)
390 Vals[j++] = A->getOperand(i);
391 for (unsigned i = 0, ie = B->getNumOperands(); i != ie; ++i)
392 Vals[j++] = B->getOperand(i);
394 return MDNode::get(A->getContext(), Vals);
397 MDNode *MDNode::intersect(MDNode *A, MDNode *B) {
401 SmallVector<Value *, 4> Vals;
402 for (unsigned i = 0, ie = A->getNumOperands(); i != ie; ++i) {
403 Value *V = A->getOperand(i);
404 for (unsigned j = 0, je = B->getNumOperands(); j != je; ++j)
405 if (V == B->getOperand(j)) {
411 // Handle alias scope self-references specially.
413 // FIXME: This preserves long-standing behaviour, but is it really the right
414 // behaviour? Or was that an unintended side-effect of node uniquing?
416 if (MDNode *N = dyn_cast_or_null<MDNode>(Vals[0]))
417 if (N->getNumOperands() == Vals.size() && N == N->getOperand(0)) {
418 for (unsigned I = 1, E = Vals.size(); I != E; ++I)
419 if (Vals[I] != N->getOperand(I))
420 return MDNode::get(A->getContext(), Vals);
423 return MDNode::get(A->getContext(), Vals);
426 MDNode *MDNode::getMostGenericFPMath(MDNode *A, MDNode *B) {
430 APFloat AVal = cast<ConstantFP>(A->getOperand(0))->getValueAPF();
431 APFloat BVal = cast<ConstantFP>(B->getOperand(0))->getValueAPF();
432 if (AVal.compare(BVal) == APFloat::cmpLessThan)
437 static bool isContiguous(const ConstantRange &A, const ConstantRange &B) {
438 return A.getUpper() == B.getLower() || A.getLower() == B.getUpper();
441 static bool canBeMerged(const ConstantRange &A, const ConstantRange &B) {
442 return !A.intersectWith(B).isEmptySet() || isContiguous(A, B);
445 static bool tryMergeRange(SmallVectorImpl<Value *> &EndPoints, ConstantInt *Low,
447 ConstantRange NewRange(Low->getValue(), High->getValue());
448 unsigned Size = EndPoints.size();
449 APInt LB = cast<ConstantInt>(EndPoints[Size - 2])->getValue();
450 APInt LE = cast<ConstantInt>(EndPoints[Size - 1])->getValue();
451 ConstantRange LastRange(LB, LE);
452 if (canBeMerged(NewRange, LastRange)) {
453 ConstantRange Union = LastRange.unionWith(NewRange);
454 Type *Ty = High->getType();
455 EndPoints[Size - 2] = ConstantInt::get(Ty, Union.getLower());
456 EndPoints[Size - 1] = ConstantInt::get(Ty, Union.getUpper());
462 static void addRange(SmallVectorImpl<Value *> &EndPoints, ConstantInt *Low,
464 if (!EndPoints.empty())
465 if (tryMergeRange(EndPoints, Low, High))
468 EndPoints.push_back(Low);
469 EndPoints.push_back(High);
472 MDNode *MDNode::getMostGenericRange(MDNode *A, MDNode *B) {
473 // Given two ranges, we want to compute the union of the ranges. This
474 // is slightly complitade by having to combine the intervals and merge
475 // the ones that overlap.
483 // First, walk both lists in older of the lower boundary of each interval.
484 // At each step, try to merge the new interval to the last one we adedd.
485 SmallVector<Value*, 4> EndPoints;
488 int AN = A->getNumOperands() / 2;
489 int BN = B->getNumOperands() / 2;
490 while (AI < AN && BI < BN) {
491 ConstantInt *ALow = cast<ConstantInt>(A->getOperand(2 * AI));
492 ConstantInt *BLow = cast<ConstantInt>(B->getOperand(2 * BI));
494 if (ALow->getValue().slt(BLow->getValue())) {
495 addRange(EndPoints, ALow, cast<ConstantInt>(A->getOperand(2 * AI + 1)));
498 addRange(EndPoints, BLow, cast<ConstantInt>(B->getOperand(2 * BI + 1)));
503 addRange(EndPoints, cast<ConstantInt>(A->getOperand(2 * AI)),
504 cast<ConstantInt>(A->getOperand(2 * AI + 1)));
508 addRange(EndPoints, cast<ConstantInt>(B->getOperand(2 * BI)),
509 cast<ConstantInt>(B->getOperand(2 * BI + 1)));
513 // If we have more than 2 ranges (4 endpoints) we have to try to merge
514 // the last and first ones.
515 unsigned Size = EndPoints.size();
517 ConstantInt *FB = cast<ConstantInt>(EndPoints[0]);
518 ConstantInt *FE = cast<ConstantInt>(EndPoints[1]);
519 if (tryMergeRange(EndPoints, FB, FE)) {
520 for (unsigned i = 0; i < Size - 2; ++i) {
521 EndPoints[i] = EndPoints[i + 2];
523 EndPoints.resize(Size - 2);
527 // If in the end we have a single range, it is possible that it is now the
528 // full range. Just drop the metadata in that case.
529 if (EndPoints.size() == 2) {
530 ConstantRange Range(cast<ConstantInt>(EndPoints[0])->getValue(),
531 cast<ConstantInt>(EndPoints[1])->getValue());
532 if (Range.isFullSet())
536 return MDNode::get(A->getContext(), EndPoints);
539 //===----------------------------------------------------------------------===//
540 // NamedMDNode implementation.
543 static SmallVector<TrackingVH<MDNode>, 4> &getNMDOps(void *Operands) {
544 return *(SmallVector<TrackingVH<MDNode>, 4> *)Operands;
547 NamedMDNode::NamedMDNode(const Twine &N)
548 : Name(N.str()), Parent(nullptr),
549 Operands(new SmallVector<TrackingVH<MDNode>, 4>()) {}
551 NamedMDNode::~NamedMDNode() {
553 delete &getNMDOps(Operands);
556 unsigned NamedMDNode::getNumOperands() const {
557 return (unsigned)getNMDOps(Operands).size();
560 MDNode *NamedMDNode::getOperand(unsigned i) const {
561 assert(i < getNumOperands() && "Invalid Operand number!");
562 return &*getNMDOps(Operands)[i];
565 void NamedMDNode::addOperand(MDNode *M) {
566 assert(!M->isFunctionLocal() &&
567 "NamedMDNode operands must not be function-local!");
568 getNMDOps(Operands).push_back(TrackingVH<MDNode>(M));
571 void NamedMDNode::eraseFromParent() {
572 getParent()->eraseNamedMetadata(this);
575 void NamedMDNode::dropAllReferences() {
576 getNMDOps(Operands).clear();
579 StringRef NamedMDNode::getName() const {
580 return StringRef(Name);
583 //===----------------------------------------------------------------------===//
584 // Instruction Metadata method implementations.
587 void Instruction::setMetadata(StringRef Kind, MDNode *Node) {
588 if (!Node && !hasMetadata())
590 setMetadata(getContext().getMDKindID(Kind), Node);
593 MDNode *Instruction::getMetadataImpl(StringRef Kind) const {
594 return getMetadataImpl(getContext().getMDKindID(Kind));
597 void Instruction::dropUnknownMetadata(ArrayRef<unsigned> KnownIDs) {
598 SmallSet<unsigned, 5> KnownSet;
599 KnownSet.insert(KnownIDs.begin(), KnownIDs.end());
601 // Drop debug if needed
602 if (KnownSet.erase(LLVMContext::MD_dbg))
605 if (!hasMetadataHashEntry())
606 return; // Nothing to remove!
608 DenseMap<const Instruction *, LLVMContextImpl::MDMapTy> &MetadataStore =
609 getContext().pImpl->MetadataStore;
611 if (KnownSet.empty()) {
612 // Just drop our entry at the store.
613 MetadataStore.erase(this);
614 setHasMetadataHashEntry(false);
618 LLVMContextImpl::MDMapTy &Info = MetadataStore[this];
621 // Walk the array and drop any metadata we don't know.
622 for (I = 0, E = Info.size(); I != E;) {
623 if (KnownSet.count(Info[I].first)) {
628 Info[I] = Info.back();
632 assert(E == Info.size());
635 // Drop our entry at the store.
636 MetadataStore.erase(this);
637 setHasMetadataHashEntry(false);
641 /// setMetadata - Set the metadata of of the specified kind to the specified
642 /// node. This updates/replaces metadata if already present, or removes it if
644 void Instruction::setMetadata(unsigned KindID, MDNode *Node) {
645 if (!Node && !hasMetadata())
648 // Handle 'dbg' as a special case since it is not stored in the hash table.
649 if (KindID == LLVMContext::MD_dbg) {
650 DbgLoc = DebugLoc::getFromDILocation(Node);
654 // Handle the case when we're adding/updating metadata on an instruction.
656 assert(!Node->isFunctionLocal() &&
657 "Function-local metadata cannot be attached to instructions");
658 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
659 assert(!Info.empty() == hasMetadataHashEntry() &&
660 "HasMetadata bit is wonked");
662 setHasMetadataHashEntry(true);
664 // Handle replacement of an existing value.
666 if (P.first == KindID) {
672 // No replacement, just add it to the list.
673 Info.push_back(std::make_pair(KindID, Node));
677 // Otherwise, we're removing metadata from an instruction.
678 assert((hasMetadataHashEntry() ==
679 (getContext().pImpl->MetadataStore.count(this) > 0)) &&
680 "HasMetadata bit out of date!");
681 if (!hasMetadataHashEntry())
682 return; // Nothing to remove!
683 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
685 // Common case is removing the only entry.
686 if (Info.size() == 1 && Info[0].first == KindID) {
687 getContext().pImpl->MetadataStore.erase(this);
688 setHasMetadataHashEntry(false);
692 // Handle removal of an existing value.
693 for (unsigned i = 0, e = Info.size(); i != e; ++i)
694 if (Info[i].first == KindID) {
695 Info[i] = Info.back();
697 assert(!Info.empty() && "Removing last entry should be handled above");
700 // Otherwise, removing an entry that doesn't exist on the instruction.
703 void Instruction::setAAMetadata(const AAMDNodes &N) {
704 setMetadata(LLVMContext::MD_tbaa, N.TBAA);
705 setMetadata(LLVMContext::MD_alias_scope, N.Scope);
706 setMetadata(LLVMContext::MD_noalias, N.NoAlias);
709 MDNode *Instruction::getMetadataImpl(unsigned KindID) const {
710 // Handle 'dbg' as a special case since it is not stored in the hash table.
711 if (KindID == LLVMContext::MD_dbg)
712 return DbgLoc.getAsMDNode(getContext());
714 if (!hasMetadataHashEntry()) return nullptr;
716 LLVMContextImpl::MDMapTy &Info = getContext().pImpl->MetadataStore[this];
717 assert(!Info.empty() && "bit out of sync with hash table");
719 for (const auto &I : Info)
720 if (I.first == KindID)
725 void Instruction::getAllMetadataImpl(
726 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
729 // Handle 'dbg' as a special case since it is not stored in the hash table.
730 if (!DbgLoc.isUnknown()) {
731 Result.push_back(std::make_pair((unsigned)LLVMContext::MD_dbg,
732 DbgLoc.getAsMDNode(getContext())));
733 if (!hasMetadataHashEntry()) return;
736 assert(hasMetadataHashEntry() &&
737 getContext().pImpl->MetadataStore.count(this) &&
738 "Shouldn't have called this");
739 const LLVMContextImpl::MDMapTy &Info =
740 getContext().pImpl->MetadataStore.find(this)->second;
741 assert(!Info.empty() && "Shouldn't have called this");
743 Result.append(Info.begin(), Info.end());
745 // Sort the resulting array so it is stable.
746 if (Result.size() > 1)
747 array_pod_sort(Result.begin(), Result.end());
750 void Instruction::getAllMetadataOtherThanDebugLocImpl(
751 SmallVectorImpl<std::pair<unsigned, MDNode *>> &Result) const {
753 assert(hasMetadataHashEntry() &&
754 getContext().pImpl->MetadataStore.count(this) &&
755 "Shouldn't have called this");
756 const LLVMContextImpl::MDMapTy &Info =
757 getContext().pImpl->MetadataStore.find(this)->second;
758 assert(!Info.empty() && "Shouldn't have called this");
759 Result.append(Info.begin(), Info.end());
761 // Sort the resulting array so it is stable.
762 if (Result.size() > 1)
763 array_pod_sort(Result.begin(), Result.end());
766 /// clearMetadataHashEntries - Clear all hashtable-based metadata from
767 /// this instruction.
768 void Instruction::clearMetadataHashEntries() {
769 assert(hasMetadataHashEntry() && "Caller should check");
770 getContext().pImpl->MetadataStore.erase(this);
771 setHasMetadataHashEntry(false);