1 //===-- Attributes.cpp - Implement AttributesList -------------------------===//
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 // \brief This file implements the Attribute, AttributeImpl, AttrBuilder,
12 // AttributeSetImpl, and AttributeSet classes.
14 //===----------------------------------------------------------------------===//
16 #include "llvm/IR/Attributes.h"
17 #include "AttributeImpl.h"
18 #include "LLVMContextImpl.h"
19 #include "llvm/ADT/StringExtras.h"
20 #include "llvm/IR/Type.h"
21 #include "llvm/Support/Atomic.h"
22 #include "llvm/Support/Debug.h"
23 #include "llvm/Support/ManagedStatic.h"
24 #include "llvm/Support/Mutex.h"
25 #include "llvm/Support/raw_ostream.h"
29 //===----------------------------------------------------------------------===//
30 // Attribute Construction Methods
31 //===----------------------------------------------------------------------===//
33 Attribute Attribute::get(LLVMContext &Context, AttrKind Kind) {
35 return Attribute::get(Context, B.addAttribute(Kind));
38 Attribute Attribute::get(LLVMContext &Context, AttrBuilder &B) {
39 // If there are no attributes, return an empty Attribute class.
40 if (!B.hasAttributes())
43 // Otherwise, build a key to look up the existing attributes.
44 LLVMContextImpl *pImpl = Context.pImpl;
46 ConstantInt *CI = ConstantInt::get(Type::getInt64Ty(Context), B.Raw());
50 AttributeImpl *PA = pImpl->AttrsSet.FindNodeOrInsertPos(ID, InsertPoint);
53 // If we didn't find any existing attributes of the same shape then create a
54 // new one and insert it.
55 PA = new AttributeImpl(Context, CI);
56 pImpl->AttrsSet.InsertNode(PA, InsertPoint);
59 // Return the AttributesList that we found or created.
63 Attribute Attribute::getWithAlignment(LLVMContext &Context, uint64_t Align) {
65 return get(Context, B.addAlignmentAttr(Align));
68 Attribute Attribute::getWithStackAlignment(LLVMContext &Context,
71 return get(Context, B.addStackAlignmentAttr(Align));
74 //===----------------------------------------------------------------------===//
75 // Attribute Accessor Methods
76 //===----------------------------------------------------------------------===//
78 bool Attribute::hasAttribute(AttrKind Val) const {
79 return pImpl && pImpl->hasAttribute(Val);
82 bool Attribute::hasAttributes() const {
83 return pImpl && pImpl->hasAttributes();
86 /// This returns the alignment field of an attribute as a byte alignment value.
87 unsigned Attribute::getAlignment() const {
88 if (!hasAttribute(Attribute::Alignment))
90 return pImpl->getAlignment();
93 /// This returns the stack alignment field of an attribute as a byte alignment
95 unsigned Attribute::getStackAlignment() const {
96 if (!hasAttribute(Attribute::StackAlignment))
98 return pImpl->getStackAlignment();
101 std::string Attribute::getAsString() const {
103 if (hasAttribute(Attribute::ZExt))
104 Result += "zeroext ";
105 if (hasAttribute(Attribute::SExt))
106 Result += "signext ";
107 if (hasAttribute(Attribute::NoReturn))
108 Result += "noreturn ";
109 if (hasAttribute(Attribute::NoUnwind))
110 Result += "nounwind ";
111 if (hasAttribute(Attribute::UWTable))
112 Result += "uwtable ";
113 if (hasAttribute(Attribute::ReturnsTwice))
114 Result += "returns_twice ";
115 if (hasAttribute(Attribute::InReg))
117 if (hasAttribute(Attribute::NoAlias))
118 Result += "noalias ";
119 if (hasAttribute(Attribute::NoCapture))
120 Result += "nocapture ";
121 if (hasAttribute(Attribute::StructRet))
123 if (hasAttribute(Attribute::ByVal))
125 if (hasAttribute(Attribute::Nest))
127 if (hasAttribute(Attribute::ReadNone))
128 Result += "readnone ";
129 if (hasAttribute(Attribute::ReadOnly))
130 Result += "readonly ";
131 if (hasAttribute(Attribute::OptimizeForSize))
132 Result += "optsize ";
133 if (hasAttribute(Attribute::NoInline))
134 Result += "noinline ";
135 if (hasAttribute(Attribute::InlineHint))
136 Result += "inlinehint ";
137 if (hasAttribute(Attribute::AlwaysInline))
138 Result += "alwaysinline ";
139 if (hasAttribute(Attribute::StackProtect))
141 if (hasAttribute(Attribute::StackProtectReq))
143 if (hasAttribute(Attribute::StackProtectStrong))
144 Result += "sspstrong ";
145 if (hasAttribute(Attribute::NoRedZone))
146 Result += "noredzone ";
147 if (hasAttribute(Attribute::NoImplicitFloat))
148 Result += "noimplicitfloat ";
149 if (hasAttribute(Attribute::Naked))
151 if (hasAttribute(Attribute::NonLazyBind))
152 Result += "nonlazybind ";
153 if (hasAttribute(Attribute::AddressSafety))
154 Result += "address_safety ";
155 if (hasAttribute(Attribute::MinSize))
156 Result += "minsize ";
157 if (hasAttribute(Attribute::StackAlignment)) {
158 Result += "alignstack(";
159 Result += utostr(getStackAlignment());
162 if (hasAttribute(Attribute::Alignment)) {
164 Result += utostr(getAlignment());
167 if (hasAttribute(Attribute::NoDuplicate))
168 Result += "noduplicate ";
169 // Trim the trailing space.
170 assert(!Result.empty() && "Unknown attribute!");
171 Result.erase(Result.end()-1);
175 bool Attribute::operator==(AttrKind K) const {
176 return pImpl && *pImpl == K;
178 bool Attribute::operator!=(AttrKind K) const {
179 return !(*this == K);
182 bool Attribute::operator<(Attribute A) const {
183 if (!pImpl && !A.pImpl) return false;
184 if (!pImpl) return true;
185 if (!A.pImpl) return false;
186 return *pImpl < *A.pImpl;
189 uint64_t Attribute::Raw() const {
190 return pImpl ? pImpl->Raw() : 0;
193 //===----------------------------------------------------------------------===//
194 // AttributeImpl Definition
195 //===----------------------------------------------------------------------===//
197 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data)
199 Data = ConstantInt::get(Type::getInt64Ty(C), data);
201 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data,
202 ArrayRef<Constant*> values)
204 Data = ConstantInt::get(Type::getInt64Ty(C), data);
205 Vals.reserve(values.size());
206 Vals.append(values.begin(), values.end());
208 AttributeImpl::AttributeImpl(LLVMContext &C, StringRef data)
210 Data = ConstantDataArray::getString(C, data);
213 bool AttributeImpl::hasAttribute(Attribute::AttrKind A) const {
214 return (Raw() & getAttrMask(A)) != 0;
217 bool AttributeImpl::hasAttributes() const {
221 uint64_t AttributeImpl::getAlignment() const {
222 uint64_t Mask = Raw() & getAttrMask(Attribute::Alignment);
223 return 1ULL << ((Mask >> 16) - 1);
226 uint64_t AttributeImpl::getStackAlignment() const {
227 uint64_t Mask = Raw() & getAttrMask(Attribute::StackAlignment);
228 return 1ULL << ((Mask >> 26) - 1);
231 bool AttributeImpl::operator==(Attribute::AttrKind Kind) const {
232 if (ConstantInt *CI = dyn_cast<ConstantInt>(Data))
233 return CI->getZExtValue() == Kind;
236 bool AttributeImpl::operator!=(Attribute::AttrKind Kind) const {
237 return !(*this == Kind);
240 bool AttributeImpl::operator==(StringRef Kind) const {
241 if (ConstantDataArray *CDA = dyn_cast<ConstantDataArray>(Data))
243 return CDA->getAsString() == Kind;
247 bool AttributeImpl::operator!=(StringRef Kind) const {
248 return !(*this == Kind);
251 bool AttributeImpl::operator<(const AttributeImpl &AI) const {
252 if (!Data && !AI.Data) return false;
253 if (!Data && AI.Data) return true;
254 if (Data && !AI.Data) return false;
256 ConstantInt *ThisCI = dyn_cast<ConstantInt>(Data);
257 ConstantInt *ThatCI = dyn_cast<ConstantInt>(AI.Data);
259 ConstantDataArray *ThisCDA = dyn_cast<ConstantDataArray>(Data);
260 ConstantDataArray *ThatCDA = dyn_cast<ConstantDataArray>(AI.Data);
262 if (ThisCI && ThatCI)
263 return ThisCI->getZExtValue() < ThatCI->getZExtValue();
265 if (ThisCI && ThatCDA)
268 if (ThisCDA && ThatCI)
271 return ThisCDA->getAsString() < ThatCDA->getAsString();
274 uint64_t AttributeImpl::Raw() const {
275 // FIXME: Remove this.
276 return cast<ConstantInt>(Data)->getZExtValue();
279 uint64_t AttributeImpl::getAttrMask(Attribute::AttrKind Val) {
280 // FIXME: Remove this.
282 case Attribute::EndAttrKinds:
283 case Attribute::AttrKindEmptyKey:
284 case Attribute::AttrKindTombstoneKey:
285 llvm_unreachable("Synthetic enumerators which should never get here");
287 case Attribute::None: return 0;
288 case Attribute::ZExt: return 1 << 0;
289 case Attribute::SExt: return 1 << 1;
290 case Attribute::NoReturn: return 1 << 2;
291 case Attribute::InReg: return 1 << 3;
292 case Attribute::StructRet: return 1 << 4;
293 case Attribute::NoUnwind: return 1 << 5;
294 case Attribute::NoAlias: return 1 << 6;
295 case Attribute::ByVal: return 1 << 7;
296 case Attribute::Nest: return 1 << 8;
297 case Attribute::ReadNone: return 1 << 9;
298 case Attribute::ReadOnly: return 1 << 10;
299 case Attribute::NoInline: return 1 << 11;
300 case Attribute::AlwaysInline: return 1 << 12;
301 case Attribute::OptimizeForSize: return 1 << 13;
302 case Attribute::StackProtect: return 1 << 14;
303 case Attribute::StackProtectReq: return 1 << 15;
304 case Attribute::Alignment: return 31 << 16;
305 case Attribute::NoCapture: return 1 << 21;
306 case Attribute::NoRedZone: return 1 << 22;
307 case Attribute::NoImplicitFloat: return 1 << 23;
308 case Attribute::Naked: return 1 << 24;
309 case Attribute::InlineHint: return 1 << 25;
310 case Attribute::StackAlignment: return 7 << 26;
311 case Attribute::ReturnsTwice: return 1 << 29;
312 case Attribute::UWTable: return 1 << 30;
313 case Attribute::NonLazyBind: return 1U << 31;
314 case Attribute::AddressSafety: return 1ULL << 32;
315 case Attribute::MinSize: return 1ULL << 33;
316 case Attribute::NoDuplicate: return 1ULL << 34;
317 case Attribute::StackProtectStrong: return 1ULL << 35;
319 llvm_unreachable("Unsupported attribute type");
322 //===----------------------------------------------------------------------===//
323 // AttributeSetNode Definition
324 //===----------------------------------------------------------------------===//
326 AttributeSetNode *AttributeSetNode::get(LLVMContext &C,
327 ArrayRef<Attribute> Attrs) {
331 // Otherwise, build a key to look up the existing attributes.
332 LLVMContextImpl *pImpl = C.pImpl;
335 SmallVector<Attribute, 8> SortedAttrs(Attrs.begin(), Attrs.end());
336 std::sort(SortedAttrs.begin(), SortedAttrs.end());
338 for (SmallVectorImpl<Attribute>::iterator I = SortedAttrs.begin(),
339 E = SortedAttrs.end(); I != E; ++I)
343 AttributeSetNode *PA =
344 pImpl->AttrsSetNodes.FindNodeOrInsertPos(ID, InsertPoint);
346 // If we didn't find any existing attributes of the same shape then create a
347 // new one and insert it.
349 PA = new AttributeSetNode(SortedAttrs);
350 pImpl->AttrsSetNodes.InsertNode(PA, InsertPoint);
353 // Return the AttributesListNode that we found or created.
357 //===----------------------------------------------------------------------===//
358 // AttributeSetImpl Definition
359 //===----------------------------------------------------------------------===//
361 uint64_t AttributeSetImpl::Raw(uint64_t Index) const {
362 for (unsigned I = 0, E = getNumAttributes(); I != E; ++I) {
363 if (getSlotIndex(I) != Index) continue;
364 const AttributeSetNode *ASN = AttrNodes[I].second;
367 for (AttributeSetNode::const_iterator II = ASN->begin(),
368 IE = ASN->end(); II != IE; ++II)
369 B.addAttributes(*II);
376 //===----------------------------------------------------------------------===//
377 // AttributeSet Construction and Mutation Methods
378 //===----------------------------------------------------------------------===//
380 AttributeSet AttributeSet::getImpl(LLVMContext &C,
381 ArrayRef<std::pair<unsigned,
382 AttributeSetNode*> > Attrs) {
383 LLVMContextImpl *pImpl = C.pImpl;
385 AttributeSetImpl::Profile(ID, Attrs);
388 AttributeSetImpl *PA = pImpl->AttrsLists.FindNodeOrInsertPos(ID, InsertPoint);
390 // If we didn't find any existing attributes of the same shape then
391 // create a new one and insert it.
393 PA = new AttributeSetImpl(C, Attrs);
394 pImpl->AttrsLists.InsertNode(PA, InsertPoint);
397 // Return the AttributesList that we found or created.
398 return AttributeSet(PA);
401 AttributeSet AttributeSet::get(LLVMContext &C,
402 ArrayRef<std::pair<unsigned, Attribute> > Attrs){
403 // If there are no attributes then return a null AttributesList pointer.
405 return AttributeSet();
408 for (unsigned i = 0, e = Attrs.size(); i != e; ++i) {
409 assert((!i || Attrs[i-1].first <= Attrs[i].first) &&
410 "Misordered Attributes list!");
411 assert(Attrs[i].second.hasAttributes() &&
412 "Pointless attribute!");
416 // Create a vector if (unsigned, AttributeSetNode*) pairs from the attributes
418 SmallVector<std::pair<unsigned, AttributeSetNode*>, 8> AttrPairVec;
419 for (ArrayRef<std::pair<unsigned, Attribute> >::iterator I = Attrs.begin(),
420 E = Attrs.end(); I != E; ) {
421 unsigned Index = I->first;
422 SmallVector<Attribute, 4> AttrVec;
423 while (I->first == Index && I != E) {
424 AttrVec.push_back(I->second);
428 AttrPairVec.push_back(std::make_pair(Index,
429 AttributeSetNode::get(C, AttrVec)));
432 return getImpl(C, AttrPairVec);
435 AttributeSet AttributeSet::get(LLVMContext &C,
436 ArrayRef<std::pair<unsigned,
437 AttributeSetNode*> > Attrs) {
438 // If there are no attributes then return a null AttributesList pointer.
440 return AttributeSet();
442 return getImpl(C, Attrs);
445 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, AttrBuilder &B) {
446 if (!B.hasAttributes())
447 return AttributeSet();
449 SmallVector<std::pair<unsigned, Attribute>, 8> Attrs;
450 for (AttrBuilder::iterator I = B.begin(), E = B.end(); I != E; ++I) {
451 Attribute::AttrKind Kind = *I;
452 if (Kind == Attribute::Alignment)
453 Attrs.push_back(std::make_pair(Idx, Attribute::
454 getWithAlignment(C, B.getAlignment())));
455 else if (Kind == Attribute::StackAlignment)
456 Attrs.push_back(std::make_pair(Idx, Attribute::
457 getWithStackAlignment(C, B.getStackAlignment())));
459 Attrs.push_back(std::make_pair(Idx, Attribute::get(C, Kind)));
462 return get(C, Attrs);
465 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx,
466 ArrayRef<Attribute::AttrKind> Kind) {
467 SmallVector<std::pair<unsigned, Attribute>, 8> Attrs;
468 for (ArrayRef<Attribute::AttrKind>::iterator I = Kind.begin(),
469 E = Kind.end(); I != E; ++I)
470 Attrs.push_back(std::make_pair(Idx, Attribute::get(C, *I)));
471 return get(C, Attrs);
474 AttributeSet AttributeSet::get(LLVMContext &C, ArrayRef<AttributeSet> Attrs) {
475 if (Attrs.empty()) return AttributeSet();
477 SmallVector<std::pair<unsigned, AttributeSetNode*>, 8> AttrNodeVec;
478 for (unsigned I = 0, E = Attrs.size(); I != E; ++I) {
479 AttributeSet AS = Attrs[I];
480 if (!AS.pImpl) continue;
481 AttrNodeVec.append(AS.pImpl->AttrNodes.begin(), AS.pImpl->AttrNodes.end());
484 return getImpl(C, AttrNodeVec);
487 AttributeSet AttributeSet::addAttribute(LLVMContext &C, unsigned Idx,
488 Attribute::AttrKind Attr) const {
489 return addAttributes(C, Idx, AttributeSet::get(C, Idx, Attr));
492 AttributeSet AttributeSet::addAttributes(LLVMContext &C, unsigned Idx,
493 AttributeSet Attrs) const {
494 if (!pImpl) return Attrs;
495 if (!Attrs.pImpl) return *this;
498 // FIXME it is not obvious how this should work for alignment. For now, say
499 // we can't change a known alignment.
500 unsigned OldAlign = getParamAlignment(Idx);
501 unsigned NewAlign = Attrs.getParamAlignment(Idx);
502 assert((!OldAlign || !NewAlign || OldAlign == NewAlign) &&
503 "Attempt to change alignment!");
506 // Add the attribute slots before the one we're trying to add.
507 SmallVector<AttributeSet, 4> AttrSet;
508 uint64_t NumAttrs = pImpl->getNumAttributes();
510 uint64_t LastIndex = 0;
511 for (unsigned I = 0, E = NumAttrs; I != E; ++I) {
512 if (getSlotIndex(I) >= Idx) {
513 if (getSlotIndex(I) == Idx) AS = getSlotAttributes(LastIndex++);
517 AttrSet.push_back(getSlotAttributes(I));
520 // Now add the attribute into the correct slot. There may already be an
521 // AttributeSet there.
522 AttrBuilder B(AS, Idx);
524 for (unsigned I = 0, E = Attrs.pImpl->getNumAttributes(); I != E; ++I)
525 if (Attrs.getSlotIndex(I) == Idx) {
526 for (AttributeSetImpl::const_iterator II = Attrs.pImpl->begin(I),
527 IE = Attrs.pImpl->end(I); II != IE; ++II)
528 B.addAttributes(*II);
532 AttrSet.push_back(AttributeSet::get(C, Idx, B));
534 // Add the remaining attribute slots.
535 for (unsigned I = LastIndex, E = NumAttrs; I < E; ++I)
536 AttrSet.push_back(getSlotAttributes(I));
538 return get(C, AttrSet);
541 AttributeSet AttributeSet::removeAttribute(LLVMContext &C, unsigned Idx,
542 Attribute::AttrKind Attr) const {
543 return removeAttributes(C, Idx, AttributeSet::get(C, Idx, Attr));
546 AttributeSet AttributeSet::removeAttributes(LLVMContext &C, unsigned Idx,
547 AttributeSet Attrs) const {
548 if (!pImpl) return AttributeSet();
549 if (!Attrs.pImpl) return *this;
552 // FIXME it is not obvious how this should work for alignment.
553 // For now, say we can't pass in alignment, which no current use does.
554 assert(!Attrs.hasAttribute(Idx, Attribute::Alignment) &&
555 "Attempt to change alignment!");
558 // Add the attribute slots before the one we're trying to add.
559 SmallVector<AttributeSet, 4> AttrSet;
560 uint64_t NumAttrs = pImpl->getNumAttributes();
562 uint64_t LastIndex = 0;
563 for (unsigned I = 0, E = NumAttrs; I != E; ++I) {
564 if (getSlotIndex(I) >= Idx) {
565 if (getSlotIndex(I) == Idx) AS = getSlotAttributes(LastIndex++);
569 AttrSet.push_back(getSlotAttributes(I));
572 // Now add the attribute into the correct slot. There may already be an
573 // AttributeSet there.
574 AttrBuilder B(AS, Idx);
576 for (unsigned I = 0, E = Attrs.pImpl->getNumAttributes(); I != E; ++I)
577 if (Attrs.getSlotIndex(I) == Idx) {
578 for (AttributeSetImpl::const_iterator II = Attrs.pImpl->begin(I),
579 IE = Attrs.pImpl->end(I); II != IE; ++II)
580 B.removeAttributes(*II);
584 AttrSet.push_back(AttributeSet::get(C, Idx, B));
586 // Add the remaining attribute slots.
587 for (unsigned I = LastIndex, E = NumAttrs; I < E; ++I)
588 AttrSet.push_back(getSlotAttributes(I));
590 return get(C, AttrSet);
593 //===----------------------------------------------------------------------===//
594 // AttributeSet Accessor Methods
595 //===----------------------------------------------------------------------===//
597 AttributeSet AttributeSet::getParamAttributes(unsigned Idx) const {
598 return pImpl && hasAttributes(Idx) ?
599 AttributeSet::get(pImpl->getContext(),
600 ArrayRef<std::pair<unsigned, Attribute> >(
601 std::make_pair(Idx, getAttributes(Idx)))) :
605 AttributeSet AttributeSet::getRetAttributes() const {
606 return pImpl && hasAttributes(ReturnIndex) ?
607 AttributeSet::get(pImpl->getContext(),
608 ArrayRef<std::pair<unsigned, Attribute> >(
609 std::make_pair(ReturnIndex,
610 getAttributes(ReturnIndex)))) :
614 AttributeSet AttributeSet::getFnAttributes() const {
615 return pImpl && hasAttributes(FunctionIndex) ?
616 AttributeSet::get(pImpl->getContext(),
617 ArrayRef<std::pair<unsigned, Attribute> >(
618 std::make_pair(FunctionIndex,
619 getAttributes(FunctionIndex)))) :
623 bool AttributeSet::hasAttribute(unsigned Index, Attribute::AttrKind Kind) const{
624 return getAttributes(Index).hasAttribute(Kind);
627 bool AttributeSet::hasAttributes(unsigned Index) const {
628 return getAttributes(Index).hasAttributes();
631 /// \brief Return true if the specified attribute is set for at least one
632 /// parameter or for the return value.
633 bool AttributeSet::hasAttrSomewhere(Attribute::AttrKind Attr) const {
634 if (pImpl == 0) return false;
636 for (unsigned I = 0, E = pImpl->getNumAttributes(); I != E; ++I)
637 for (AttributeSetImpl::const_iterator II = pImpl->begin(I),
638 IE = pImpl->end(I); II != IE; ++II)
639 if (II->hasAttribute(Attr))
645 unsigned AttributeSet::getParamAlignment(unsigned Idx) const {
646 return getAttributes(Idx).getAlignment();
649 unsigned AttributeSet::getStackAlignment(unsigned Index) const {
650 return getAttributes(Index).getStackAlignment();
653 std::string AttributeSet::getAsString(unsigned Index) const {
654 return getAttributes(Index).getAsString();
657 /// \brief The attributes for the specified index are returned.
659 /// FIXME: This shouldn't return 'Attribute'.
660 Attribute AttributeSet::getAttributes(unsigned Idx) const {
661 if (pImpl == 0) return Attribute();
663 // Loop through to find the attribute we want.
664 for (unsigned I = 0, E = pImpl->getNumAttributes(); I != E; ++I) {
665 if (pImpl->getSlotIndex(I) != Idx) continue;
668 for (AttributeSetImpl::const_iterator II = pImpl->begin(I),
669 IE = pImpl->end(I); II != IE; ++II)
670 B.addAttributes(*II);
671 return Attribute::get(pImpl->getContext(), B);
677 //===----------------------------------------------------------------------===//
678 // AttributeSet Introspection Methods
679 //===----------------------------------------------------------------------===//
681 /// \brief Return the number of slots used in this attribute list. This is the
682 /// number of arguments that have an attribute set on them (including the
683 /// function itself).
684 unsigned AttributeSet::getNumSlots() const {
685 return pImpl ? pImpl->getNumAttributes() : 0;
688 uint64_t AttributeSet::getSlotIndex(unsigned Slot) const {
689 assert(pImpl && Slot < pImpl->getNumAttributes() &&
690 "Slot # out of range!");
691 return pImpl->getSlotIndex(Slot);
694 AttributeSet AttributeSet::getSlotAttributes(unsigned Slot) const {
695 assert(pImpl && Slot < pImpl->getNumAttributes() &&
696 "Slot # out of range!");
697 return pImpl->getSlotAttributes(Slot);
700 uint64_t AttributeSet::Raw(unsigned Index) const {
701 // FIXME: Remove this.
702 return pImpl ? pImpl->Raw(Index) : 0;
705 void AttributeSet::dump() const {
708 for (unsigned i = 0, e = getNumSlots(); i < e; ++i) {
709 uint64_t Index = getSlotIndex(i);
715 dbgs() << " => " << getAsString(Index) << " }\n";
721 //===----------------------------------------------------------------------===//
722 // AttrBuilder Method Implementations
723 //===----------------------------------------------------------------------===//
725 AttrBuilder::AttrBuilder(AttributeSet AS, unsigned Idx)
726 : Alignment(0), StackAlignment(0) {
727 AttributeSetImpl *pImpl = AS.pImpl;
732 for (unsigned I = 0, E = pImpl->getNumAttributes(); I != E; ++I) {
733 if (pImpl->getSlotIndex(I) != Idx) continue;
735 for (AttributeSetNode::const_iterator II = pImpl->begin(I),
736 IE = pImpl->end(I); II != IE; ++II)
737 B.addAttributes(*II);
742 if (!B.hasAttributes()) return;
744 uint64_t Mask = B.Raw();
746 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
747 I = Attribute::AttrKind(I + 1)) {
748 if (uint64_t A = (Mask & AttributeImpl::getAttrMask(I))) {
751 if (I == Attribute::Alignment)
752 Alignment = 1ULL << ((A >> 16) - 1);
753 else if (I == Attribute::StackAlignment)
754 StackAlignment = 1ULL << ((A >> 26)-1);
759 void AttrBuilder::clear() {
761 Alignment = StackAlignment = 0;
764 AttrBuilder &AttrBuilder::addAttribute(Attribute::AttrKind Val) {
769 AttrBuilder &AttrBuilder::removeAttribute(Attribute::AttrKind Val) {
771 if (Val == Attribute::Alignment)
773 else if (Val == Attribute::StackAlignment)
779 AttrBuilder &AttrBuilder::addAttributes(Attribute Attr) {
780 uint64_t Mask = Attr.Raw();
782 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
783 I = Attribute::AttrKind(I + 1))
784 if ((Mask & AttributeImpl::getAttrMask(I)) != 0)
787 if (Attr.getAlignment())
788 Alignment = Attr.getAlignment();
789 if (Attr.getStackAlignment())
790 StackAlignment = Attr.getStackAlignment();
794 AttrBuilder &AttrBuilder::removeAttributes(Attribute A) {
795 uint64_t Mask = A.Raw();
797 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
798 I = Attribute::AttrKind(I + 1)) {
799 if (Mask & AttributeImpl::getAttrMask(I)) {
802 if (I == Attribute::Alignment)
804 else if (I == Attribute::StackAlignment)
812 AttrBuilder &AttrBuilder::addAlignmentAttr(unsigned Align) {
813 if (Align == 0) return *this;
815 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
816 assert(Align <= 0x40000000 && "Alignment too large.");
818 Attrs.insert(Attribute::Alignment);
823 AttrBuilder &AttrBuilder::addStackAlignmentAttr(unsigned Align) {
824 // Default alignment, allow the target to define how to align it.
825 if (Align == 0) return *this;
827 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
828 assert(Align <= 0x100 && "Alignment too large.");
830 Attrs.insert(Attribute::StackAlignment);
831 StackAlignment = Align;
835 bool AttrBuilder::contains(Attribute::AttrKind A) const {
836 return Attrs.count(A);
839 bool AttrBuilder::hasAttributes() const {
840 return !Attrs.empty();
843 bool AttrBuilder::hasAttributes(const Attribute &A) const {
844 return Raw() & A.Raw();
847 bool AttrBuilder::hasAlignmentAttr() const {
848 return Alignment != 0;
851 bool AttrBuilder::operator==(const AttrBuilder &B) {
852 SmallVector<Attribute::AttrKind, 8> This(Attrs.begin(), Attrs.end());
853 SmallVector<Attribute::AttrKind, 8> That(B.Attrs.begin(), B.Attrs.end());
857 AttrBuilder &AttrBuilder::addRawValue(uint64_t Val) {
858 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
859 I = Attribute::AttrKind(I + 1)) {
860 if (uint64_t A = (Val & AttributeImpl::getAttrMask(I))) {
863 if (I == Attribute::Alignment)
864 Alignment = 1ULL << ((A >> 16) - 1);
865 else if (I == Attribute::StackAlignment)
866 StackAlignment = 1ULL << ((A >> 26)-1);
873 uint64_t AttrBuilder::Raw() const {
876 for (DenseSet<Attribute::AttrKind>::const_iterator I = Attrs.begin(),
877 E = Attrs.end(); I != E; ++I) {
878 Attribute::AttrKind Kind = *I;
880 if (Kind == Attribute::Alignment)
881 Mask |= (Log2_32(Alignment) + 1) << 16;
882 else if (Kind == Attribute::StackAlignment)
883 Mask |= (Log2_32(StackAlignment) + 1) << 26;
885 Mask |= AttributeImpl::getAttrMask(Kind);
891 //===----------------------------------------------------------------------===//
892 // AttributeFuncs Function Defintions
893 //===----------------------------------------------------------------------===//
895 Attribute AttributeFuncs::typeIncompatible(Type *Ty) {
896 AttrBuilder Incompatible;
898 if (!Ty->isIntegerTy())
899 // Attribute that only apply to integers.
900 Incompatible.addAttribute(Attribute::SExt)
901 .addAttribute(Attribute::ZExt);
903 if (!Ty->isPointerTy())
904 // Attribute that only apply to pointers.
905 Incompatible.addAttribute(Attribute::ByVal)
906 .addAttribute(Attribute::Nest)
907 .addAttribute(Attribute::NoAlias)
908 .addAttribute(Attribute::NoCapture)
909 .addAttribute(Attribute::StructRet);
911 return Attribute::get(Ty->getContext(), Incompatible);
914 /// \brief This returns an integer containing an encoding of all the LLVM
915 /// attributes found in the given attribute bitset. Any change to this encoding
916 /// is a breaking change to bitcode compatibility.
917 uint64_t AttributeFuncs::encodeLLVMAttributesForBitcode(AttributeSet Attrs,
919 // FIXME: It doesn't make sense to store the alignment information as an
920 // expanded out value, we should store it as a log2 value. However, we can't
921 // just change that here without breaking bitcode compatibility. If this ever
922 // becomes a problem in practice, we should introduce new tag numbers in the
923 // bitcode file and have those tags use a more efficiently encoded alignment
926 // Store the alignment in the bitcode as a 16-bit raw value instead of a 5-bit
927 // log2 encoded value. Shift the bits above the alignment up by 11 bits.
928 uint64_t EncodedAttrs = Attrs.Raw(Index) & 0xffff;
929 if (Attrs.hasAttribute(Index, Attribute::Alignment))
930 EncodedAttrs |= Attrs.getParamAlignment(Index) << 16;
931 EncodedAttrs |= (Attrs.Raw(Index) & (0xffffULL << 21)) << 11;
935 /// \brief This returns an attribute bitset containing the LLVM attributes that
936 /// have been decoded from the given integer. This function must stay in sync
937 /// with 'encodeLLVMAttributesForBitcode'.
938 Attribute AttributeFuncs::decodeLLVMAttributesForBitcode(LLVMContext &C,
939 uint64_t EncodedAttrs){
940 // The alignment is stored as a 16-bit raw value from bits 31--16. We shift
941 // the bits above 31 down by 11 bits.
942 unsigned Alignment = (EncodedAttrs & (0xffffULL << 16)) >> 16;
943 assert((!Alignment || isPowerOf2_32(Alignment)) &&
944 "Alignment must be a power of two.");
946 AttrBuilder B(EncodedAttrs & 0xffff);
948 B.addAlignmentAttr(Alignment);
949 B.addRawValue((EncodedAttrs & (0xffffULL << 32)) >> 11);
950 return Attribute::get(C, B);