1 //===-- Attribute.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 //===----------------------------------------------------------------------===//
10 // This file implements the Attribute, AttributeImpl, AttrBuilder,
11 // AttributeSetImpl, and AttributeSet classes.
13 //===----------------------------------------------------------------------===//
15 #include "llvm/IR/Attributes.h"
16 #include "AttributeImpl.h"
17 #include "LLVMContextImpl.h"
18 #include "llvm/ADT/FoldingSet.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 Implementation
31 //===----------------------------------------------------------------------===//
33 Attribute Attribute::get(LLVMContext &Context, ArrayRef<AttrKind> Kinds) {
35 for (ArrayRef<AttrKind>::iterator I = Kinds.begin(), E = Kinds.end();
38 return Attribute::get(Context, B);
41 Attribute Attribute::get(LLVMContext &Context, AttrBuilder &B) {
42 // If there are no attributes, return an empty Attribute class.
43 if (!B.hasAttributes())
46 // Otherwise, build a key to look up the existing attributes.
47 LLVMContextImpl *pImpl = Context.pImpl;
49 ID.AddInteger(B.Raw());
52 AttributeImpl *PA = pImpl->AttrsSet.FindNodeOrInsertPos(ID, InsertPoint);
55 // If we didn't find any existing attributes of the same shape then create a
56 // new one and insert it.
57 PA = new AttributeImpl(Context, B.Raw());
58 pImpl->AttrsSet.InsertNode(PA, InsertPoint);
61 // Return the AttributesList that we found or created.
65 bool Attribute::hasAttribute(AttrKind Val) const {
66 return pImpl && pImpl->hasAttribute(Val);
69 bool Attribute::hasAttributes() const {
70 return pImpl && pImpl->hasAttributes();
73 /// This returns the alignment field of an attribute as a byte alignment value.
74 unsigned Attribute::getAlignment() const {
75 if (!hasAttribute(Attribute::Alignment))
77 return pImpl->getAlignment();
80 /// This returns the stack alignment field of an attribute as a byte alignment
82 unsigned Attribute::getStackAlignment() const {
83 if (!hasAttribute(Attribute::StackAlignment))
85 return pImpl->getStackAlignment();
88 bool Attribute::operator==(AttrKind K) const {
89 return pImpl && *pImpl == K;
91 bool Attribute::operator!=(AttrKind K) const {
95 bool Attribute::operator<(Attribute A) const {
96 if (!pImpl && !A.pImpl) return false;
97 if (!pImpl) return true;
98 if (!A.pImpl) return false;
99 return *pImpl < *A.pImpl;
102 uint64_t Attribute::Raw() const {
103 return pImpl ? pImpl->Raw() : 0;
106 std::string Attribute::getAsString() const {
108 if (hasAttribute(Attribute::ZExt))
109 Result += "zeroext ";
110 if (hasAttribute(Attribute::SExt))
111 Result += "signext ";
112 if (hasAttribute(Attribute::NoReturn))
113 Result += "noreturn ";
114 if (hasAttribute(Attribute::NoUnwind))
115 Result += "nounwind ";
116 if (hasAttribute(Attribute::UWTable))
117 Result += "uwtable ";
118 if (hasAttribute(Attribute::ReturnsTwice))
119 Result += "returns_twice ";
120 if (hasAttribute(Attribute::InReg))
122 if (hasAttribute(Attribute::NoAlias))
123 Result += "noalias ";
124 if (hasAttribute(Attribute::NoCapture))
125 Result += "nocapture ";
126 if (hasAttribute(Attribute::StructRet))
128 if (hasAttribute(Attribute::ByVal))
130 if (hasAttribute(Attribute::Nest))
132 if (hasAttribute(Attribute::ReadNone))
133 Result += "readnone ";
134 if (hasAttribute(Attribute::ReadOnly))
135 Result += "readonly ";
136 if (hasAttribute(Attribute::OptimizeForSize))
137 Result += "optsize ";
138 if (hasAttribute(Attribute::NoInline))
139 Result += "noinline ";
140 if (hasAttribute(Attribute::InlineHint))
141 Result += "inlinehint ";
142 if (hasAttribute(Attribute::AlwaysInline))
143 Result += "alwaysinline ";
144 if (hasAttribute(Attribute::StackProtect))
146 if (hasAttribute(Attribute::StackProtectReq))
148 if (hasAttribute(Attribute::StackProtectStrong))
149 Result += "sspstrong ";
150 if (hasAttribute(Attribute::NoRedZone))
151 Result += "noredzone ";
152 if (hasAttribute(Attribute::NoImplicitFloat))
153 Result += "noimplicitfloat ";
154 if (hasAttribute(Attribute::Naked))
156 if (hasAttribute(Attribute::NonLazyBind))
157 Result += "nonlazybind ";
158 if (hasAttribute(Attribute::AddressSafety))
159 Result += "address_safety ";
160 if (hasAttribute(Attribute::MinSize))
161 Result += "minsize ";
162 if (hasAttribute(Attribute::StackAlignment)) {
163 Result += "alignstack(";
164 Result += utostr(getStackAlignment());
167 if (hasAttribute(Attribute::Alignment)) {
169 Result += utostr(getAlignment());
172 if (hasAttribute(Attribute::NoDuplicate))
173 Result += "noduplicate ";
174 // Trim the trailing space.
175 assert(!Result.empty() && "Unknown attribute!");
176 Result.erase(Result.end()-1);
180 //===----------------------------------------------------------------------===//
181 // AttrBuilder Method Implementations
182 //===----------------------------------------------------------------------===//
184 AttrBuilder::AttrBuilder(AttributeSet AS, unsigned Idx)
185 : Alignment(0), StackAlignment(0) {
186 AttributeSetImpl *pImpl = AS.AttrList;
189 ArrayRef<AttributeWithIndex> AttrList = pImpl->getAttributes();
190 const AttributeWithIndex *AWI = 0;
191 for (unsigned I = 0, E = AttrList.size(); I != E; ++I)
192 if (AttrList[I].Index == Idx) {
199 uint64_t Mask = AWI->Attrs.Raw();
201 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
202 I = Attribute::AttrKind(I + 1)) {
203 if (uint64_t A = (Mask & AttributeImpl::getAttrMask(I))) {
206 if (I == Attribute::Alignment)
207 Alignment = 1ULL << ((A >> 16) - 1);
208 else if (I == Attribute::StackAlignment)
209 StackAlignment = 1ULL << ((A >> 26)-1);
214 void AttrBuilder::clear() {
216 Alignment = StackAlignment = 0;
219 AttrBuilder &AttrBuilder::addAttribute(Attribute::AttrKind Val) {
224 AttrBuilder &AttrBuilder::removeAttribute(Attribute::AttrKind Val) {
226 if (Val == Attribute::Alignment)
228 else if (Val == Attribute::StackAlignment)
234 AttrBuilder &AttrBuilder::addAlignmentAttr(unsigned Align) {
235 if (Align == 0) return *this;
237 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
238 assert(Align <= 0x40000000 && "Alignment too large.");
240 Attrs.insert(Attribute::Alignment);
245 AttrBuilder &AttrBuilder::addStackAlignmentAttr(unsigned Align) {
246 // Default alignment, allow the target to define how to align it.
247 if (Align == 0) return *this;
249 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
250 assert(Align <= 0x100 && "Alignment too large.");
252 Attrs.insert(Attribute::StackAlignment);
253 StackAlignment = Align;
257 AttrBuilder &AttrBuilder::addRawValue(uint64_t Val) {
258 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
259 I = Attribute::AttrKind(I + 1)) {
260 if (uint64_t A = (Val & AttributeImpl::getAttrMask(I))) {
263 if (I == Attribute::Alignment)
264 Alignment = 1ULL << ((A >> 16) - 1);
265 else if (I == Attribute::StackAlignment)
266 StackAlignment = 1ULL << ((A >> 26)-1);
273 AttrBuilder &AttrBuilder::addAttributes(const Attribute &Attr) {
274 uint64_t Mask = Attr.Raw();
276 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
277 I = Attribute::AttrKind(I + 1))
278 if ((Mask & AttributeImpl::getAttrMask(I)) != 0)
281 if (Attr.getAlignment())
282 Alignment = Attr.getAlignment();
283 if (Attr.getStackAlignment())
284 StackAlignment = Attr.getStackAlignment();
288 AttrBuilder &AttrBuilder::removeAttributes(const Attribute &A){
289 uint64_t Mask = A.Raw();
291 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
292 I = Attribute::AttrKind(I + 1)) {
293 if (Mask & AttributeImpl::getAttrMask(I)) {
296 if (I == Attribute::Alignment)
298 else if (I == Attribute::StackAlignment)
306 bool AttrBuilder::contains(Attribute::AttrKind A) const {
307 return Attrs.count(A);
310 bool AttrBuilder::hasAttributes() const {
311 return !Attrs.empty();
314 bool AttrBuilder::hasAttributes(const Attribute &A) const {
315 return Raw() & A.Raw();
318 bool AttrBuilder::hasAlignmentAttr() const {
319 return Alignment != 0;
322 uint64_t AttrBuilder::Raw() const {
325 for (DenseSet<Attribute::AttrKind>::const_iterator I = Attrs.begin(),
326 E = Attrs.end(); I != E; ++I) {
327 Attribute::AttrKind Kind = *I;
329 if (Kind == Attribute::Alignment)
330 Mask |= (Log2_32(Alignment) + 1) << 16;
331 else if (Kind == Attribute::StackAlignment)
332 Mask |= (Log2_32(StackAlignment) + 1) << 26;
334 Mask |= AttributeImpl::getAttrMask(Kind);
340 bool AttrBuilder::operator==(const AttrBuilder &B) {
341 SmallVector<Attribute::AttrKind, 8> This(Attrs.begin(), Attrs.end());
342 SmallVector<Attribute::AttrKind, 8> That(B.Attrs.begin(), B.Attrs.end());
346 //===----------------------------------------------------------------------===//
347 // AttributeImpl Definition
348 //===----------------------------------------------------------------------===//
350 AttributeImpl::AttributeImpl(LLVMContext &C, uint64_t data)
352 Data = ConstantInt::get(Type::getInt64Ty(C), data);
354 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data)
356 Data = ConstantInt::get(Type::getInt64Ty(C), data);
358 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data,
359 ArrayRef<Constant*> values)
361 Data = ConstantInt::get(Type::getInt64Ty(C), data);
362 Vals.reserve(values.size());
363 Vals.append(values.begin(), values.end());
365 AttributeImpl::AttributeImpl(LLVMContext &C, StringRef data)
367 Data = ConstantDataArray::getString(C, data);
370 bool AttributeImpl::operator==(Attribute::AttrKind Kind) const {
371 if (ConstantInt *CI = dyn_cast<ConstantInt>(Data))
372 return CI->getZExtValue() == Kind;
375 bool AttributeImpl::operator!=(Attribute::AttrKind Kind) const {
376 return !(*this == Kind);
379 bool AttributeImpl::operator==(StringRef Kind) const {
380 if (ConstantDataArray *CDA = dyn_cast<ConstantDataArray>(Data))
382 return CDA->getAsString() == Kind;
386 bool AttributeImpl::operator!=(StringRef Kind) const {
387 return !(*this == Kind);
390 bool AttributeImpl::operator<(const AttributeImpl &AI) const {
391 if (!Data && !AI.Data) return false;
392 if (!Data && AI.Data) return true;
393 if (Data && !AI.Data) return false;
395 ConstantInt *ThisCI = dyn_cast<ConstantInt>(Data);
396 ConstantInt *ThatCI = dyn_cast<ConstantInt>(AI.Data);
398 ConstantDataArray *ThisCDA = dyn_cast<ConstantDataArray>(Data);
399 ConstantDataArray *ThatCDA = dyn_cast<ConstantDataArray>(AI.Data);
401 if (ThisCI && ThatCI)
402 return ThisCI->getZExtValue() < ThatCI->getZExtValue();
404 if (ThisCI && ThatCDA)
407 if (ThisCDA && ThatCI)
410 return ThisCDA->getAsString() < ThatCDA->getAsString();
413 uint64_t AttributeImpl::Raw() const {
414 // FIXME: Remove this.
415 return cast<ConstantInt>(Data)->getZExtValue();
418 uint64_t AttributeImpl::getAttrMask(Attribute::AttrKind Val) {
420 case Attribute::EndAttrKinds:
421 case Attribute::AttrKindEmptyKey:
422 case Attribute::AttrKindTombstoneKey:
423 llvm_unreachable("Synthetic enumerators which should never get here");
425 case Attribute::None: return 0;
426 case Attribute::ZExt: return 1 << 0;
427 case Attribute::SExt: return 1 << 1;
428 case Attribute::NoReturn: return 1 << 2;
429 case Attribute::InReg: return 1 << 3;
430 case Attribute::StructRet: return 1 << 4;
431 case Attribute::NoUnwind: return 1 << 5;
432 case Attribute::NoAlias: return 1 << 6;
433 case Attribute::ByVal: return 1 << 7;
434 case Attribute::Nest: return 1 << 8;
435 case Attribute::ReadNone: return 1 << 9;
436 case Attribute::ReadOnly: return 1 << 10;
437 case Attribute::NoInline: return 1 << 11;
438 case Attribute::AlwaysInline: return 1 << 12;
439 case Attribute::OptimizeForSize: return 1 << 13;
440 case Attribute::StackProtect: return 1 << 14;
441 case Attribute::StackProtectReq: return 1 << 15;
442 case Attribute::Alignment: return 31 << 16;
443 case Attribute::NoCapture: return 1 << 21;
444 case Attribute::NoRedZone: return 1 << 22;
445 case Attribute::NoImplicitFloat: return 1 << 23;
446 case Attribute::Naked: return 1 << 24;
447 case Attribute::InlineHint: return 1 << 25;
448 case Attribute::StackAlignment: return 7 << 26;
449 case Attribute::ReturnsTwice: return 1 << 29;
450 case Attribute::UWTable: return 1 << 30;
451 case Attribute::NonLazyBind: return 1U << 31;
452 case Attribute::AddressSafety: return 1ULL << 32;
453 case Attribute::MinSize: return 1ULL << 33;
454 case Attribute::NoDuplicate: return 1ULL << 34;
455 case Attribute::StackProtectStrong: return 1ULL << 35;
457 llvm_unreachable("Unsupported attribute type");
460 bool AttributeImpl::hasAttribute(Attribute::AttrKind A) const {
461 return (Raw() & getAttrMask(A)) != 0;
464 bool AttributeImpl::hasAttributes() const {
468 uint64_t AttributeImpl::getAlignment() const {
469 uint64_t Mask = Raw() & getAttrMask(Attribute::Alignment);
470 return 1ULL << ((Mask >> 16) - 1);
473 uint64_t AttributeImpl::getStackAlignment() const {
474 uint64_t Mask = Raw() & getAttrMask(Attribute::StackAlignment);
475 return 1ULL << ((Mask >> 26) - 1);
478 void AttributeImpl::Profile(FoldingSetNodeID &ID, Constant *Data,
479 ArrayRef<Constant*> Vals) {
480 ID.AddInteger(cast<ConstantInt>(Data)->getZExtValue());
482 // FIXME: Not yet supported.
483 for (ArrayRef<Constant*>::iterator I = Vals.begin(), E = Vals.end();
489 //===----------------------------------------------------------------------===//
490 // AttributeSetNode Definition
491 //===----------------------------------------------------------------------===//
493 AttributeSetNode *AttributeSetNode::get(LLVMContext &C,
494 ArrayRef<Attribute> Attrs) {
498 // Otherwise, build a key to look up the existing attributes.
499 LLVMContextImpl *pImpl = C.pImpl;
502 SmallVector<Attribute, 8> SortedAttrs(Attrs.begin(), Attrs.end());
503 std::sort(SortedAttrs.begin(), SortedAttrs.end());
505 for (SmallVectorImpl<Attribute>::iterator I = SortedAttrs.begin(),
506 E = SortedAttrs.end(); I != E; ++I)
510 AttributeSetNode *PA =
511 pImpl->AttrsSetNodes.FindNodeOrInsertPos(ID, InsertPoint);
513 // If we didn't find any existing attributes of the same shape then create a
514 // new one and insert it.
516 PA = new AttributeSetNode(SortedAttrs);
517 pImpl->AttrsSetNodes.InsertNode(PA, InsertPoint);
520 // Return the AttributesListNode that we found or created.
524 //===----------------------------------------------------------------------===//
525 // AttributeSetImpl Definition
526 //===----------------------------------------------------------------------===//
528 AttributeSet AttributeSet::getParamAttributes(unsigned Idx) const {
530 return AttrList && hasAttributes(Idx) ?
531 AttributeSet::get(AttrList->getContext(),
532 AttributeWithIndex::get(Idx, getAttributes(Idx))) :
536 AttributeSet AttributeSet::getRetAttributes() const {
538 return AttrList && hasAttributes(ReturnIndex) ?
539 AttributeSet::get(AttrList->getContext(),
540 AttributeWithIndex::get(ReturnIndex,
541 getAttributes(ReturnIndex))) :
545 AttributeSet AttributeSet::getFnAttributes() const {
547 return AttrList && hasAttributes(FunctionIndex) ?
548 AttributeSet::get(AttrList->getContext(),
549 AttributeWithIndex::get(FunctionIndex,
550 getAttributes(FunctionIndex))) :
554 AttributeSet AttributeSet::get(LLVMContext &C,
555 ArrayRef<AttributeWithIndex> Attrs) {
556 // If there are no attributes then return a null AttributesList pointer.
558 return AttributeSet();
561 for (unsigned i = 0, e = Attrs.size(); i != e; ++i) {
562 assert(Attrs[i].Attrs.hasAttributes() &&
563 "Pointless attribute!");
564 assert((!i || Attrs[i-1].Index < Attrs[i].Index) &&
565 "Misordered AttributesList!");
569 // Otherwise, build a key to look up the existing attributes.
570 LLVMContextImpl *pImpl = C.pImpl;
572 AttributeSetImpl::Profile(ID, Attrs);
575 AttributeSetImpl *PA = pImpl->AttrsLists.FindNodeOrInsertPos(ID, InsertPoint);
577 // If we didn't find any existing attributes of the same shape then
578 // create a new one and insert it.
580 PA = new AttributeSetImpl(C, Attrs);
581 pImpl->AttrsLists.InsertNode(PA, InsertPoint);
584 // Return the AttributesList that we found or created.
585 return AttributeSet(PA);
588 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, AttrBuilder &B) {
589 // FIXME: This should be implemented as a loop that creates the
590 // AttributeWithIndexes that then are used to create the AttributeSet.
591 if (!B.hasAttributes())
592 return AttributeSet();
593 return get(C, AttributeWithIndex::get(Idx, Attribute::get(C, B)));
596 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx,
597 ArrayRef<Attribute::AttrKind> Kind) {
598 // FIXME: This is temporary. Ultimately, the AttributeWithIndex will be
599 // replaced by an object that holds multiple Attribute::AttrKinds.
601 for (ArrayRef<Attribute::AttrKind>::iterator I = Kind.begin(),
602 E = Kind.end(); I != E; ++I)
604 return get(C, Idx, B);
607 AttributeSet AttributeSet::get(LLVMContext &C, ArrayRef<AttributeSet> Attrs) {
608 SmallVector<AttributeWithIndex, 8> AttrList;
609 for (ArrayRef<AttributeSet>::iterator I = Attrs.begin(), E = Attrs.end();
611 AttributeSet AS = *I;
612 if (!AS.AttrList) continue;
613 AttrList.append(AS.AttrList->AttrList.begin(), AS.AttrList->AttrList.end());
616 return get(C, AttrList);
619 //===----------------------------------------------------------------------===//
620 // AttributeSet Method Implementations
621 //===----------------------------------------------------------------------===//
623 const AttributeSet &AttributeSet::operator=(const AttributeSet &RHS) {
624 AttrList = RHS.AttrList;
628 /// getNumSlots - Return the number of slots used in this attribute list.
629 /// This is the number of arguments that have an attribute set on them
630 /// (including the function itself).
631 unsigned AttributeSet::getNumSlots() const {
632 return AttrList ? AttrList->getNumAttributes() : 0;
635 unsigned AttributeSet::getSlotIndex(unsigned Slot) const {
636 assert(AttrList && Slot < AttrList->getNumAttributes() &&
637 "Slot # out of range!");
638 return AttrList->getSlotIndex(Slot);
641 AttributeSet AttributeSet::getSlotAttributes(unsigned Slot) const {
642 assert(AttrList && Slot < AttrList->getNumAttributes() &&
643 "Slot # out of range!");
644 return AttrList->getSlotAttributes(Slot);
647 bool AttributeSet::hasAttribute(unsigned Index, Attribute::AttrKind Kind) const{
648 return getAttributes(Index).hasAttribute(Kind);
651 bool AttributeSet::hasAttributes(unsigned Index) const {
652 return getAttributes(Index).hasAttributes();
655 std::string AttributeSet::getAsString(unsigned Index) const {
656 return getAttributes(Index).getAsString();
659 unsigned AttributeSet::getParamAlignment(unsigned Idx) const {
660 return getAttributes(Idx).getAlignment();
663 unsigned AttributeSet::getStackAlignment(unsigned Index) const {
664 return getAttributes(Index).getStackAlignment();
667 uint64_t AttributeSet::Raw(unsigned Index) const {
668 // FIXME: Remove this.
669 return getAttributes(Index).Raw();
672 /// getAttributes - The attributes for the specified index are returned.
673 Attribute AttributeSet::getAttributes(unsigned Idx) const {
674 if (AttrList == 0) return Attribute();
676 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
677 for (unsigned i = 0, e = Attrs.size(); i != e && Attrs[i].Index <= Idx; ++i)
678 if (Attrs[i].Index == Idx)
679 return Attrs[i].Attrs;
684 /// hasAttrSomewhere - Return true if the specified attribute is set for at
685 /// least one parameter or for the return value.
686 bool AttributeSet::hasAttrSomewhere(Attribute::AttrKind Attr) const {
687 if (AttrList == 0) return false;
689 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
690 for (unsigned i = 0, e = Attrs.size(); i != e; ++i)
691 if (Attrs[i].Attrs.hasAttribute(Attr))
697 AttributeSet AttributeSet::addAttribute(LLVMContext &C, unsigned Idx,
698 Attribute::AttrKind Attr) const {
699 return addAttr(C, Idx, Attribute::get(C, Attr));
702 AttributeSet AttributeSet::addAttributes(LLVMContext &C, unsigned Idx,
703 AttributeSet Attrs) const {
704 return addAttr(C, Idx, Attrs.getAttributes(Idx));
707 AttributeSet AttributeSet::addAttr(LLVMContext &C, unsigned Idx,
708 Attribute Attrs) const {
709 Attribute OldAttrs = getAttributes(Idx);
711 // FIXME it is not obvious how this should work for alignment.
712 // For now, say we can't change a known alignment.
713 unsigned OldAlign = OldAttrs.getAlignment();
714 unsigned NewAlign = Attrs.getAlignment();
715 assert((!OldAlign || !NewAlign || OldAlign == NewAlign) &&
716 "Attempt to change alignment!");
719 AttrBuilder NewAttrs =
720 AttrBuilder(OldAttrs).addAttributes(Attrs);
721 if (NewAttrs == AttrBuilder(OldAttrs))
724 SmallVector<AttributeWithIndex, 8> NewAttrList;
726 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
728 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
729 unsigned i = 0, e = OldAttrList.size();
730 // Copy attributes for arguments before this one.
731 for (; i != e && OldAttrList[i].Index < Idx; ++i)
732 NewAttrList.push_back(OldAttrList[i]);
734 // If there are attributes already at this index, merge them in.
735 if (i != e && OldAttrList[i].Index == Idx) {
737 Attribute::get(C, AttrBuilder(Attrs).
738 addAttributes(OldAttrList[i].Attrs));
742 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
744 // Copy attributes for arguments after this one.
745 NewAttrList.insert(NewAttrList.end(),
746 OldAttrList.begin()+i, OldAttrList.end());
749 return get(C, NewAttrList);
752 AttributeSet AttributeSet::removeAttribute(LLVMContext &C, unsigned Idx,
753 Attribute::AttrKind Attr) const {
754 return removeAttr(C, Idx, Attribute::get(C, Attr));
757 AttributeSet AttributeSet::removeAttributes(LLVMContext &C, unsigned Idx,
758 AttributeSet Attrs) const {
759 return removeAttr(C, Idx, Attrs.getAttributes(Idx));
762 AttributeSet AttributeSet::removeAttr(LLVMContext &C, unsigned Idx,
763 Attribute Attrs) const {
765 // FIXME it is not obvious how this should work for alignment.
766 // For now, say we can't pass in alignment, which no current use does.
767 assert(!Attrs.hasAttribute(Attribute::Alignment) &&
768 "Attempt to exclude alignment!");
770 if (AttrList == 0) return AttributeSet();
772 Attribute OldAttrs = getAttributes(Idx);
773 AttrBuilder NewAttrs =
774 AttrBuilder(OldAttrs).removeAttributes(Attrs);
775 if (NewAttrs == AttrBuilder(OldAttrs))
778 SmallVector<AttributeWithIndex, 8> NewAttrList;
779 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
780 unsigned i = 0, e = OldAttrList.size();
782 // Copy attributes for arguments before this one.
783 for (; i != e && OldAttrList[i].Index < Idx; ++i)
784 NewAttrList.push_back(OldAttrList[i]);
786 // If there are attributes already at this index, merge them in.
787 assert(OldAttrList[i].Index == Idx && "Attribute isn't set?");
788 Attrs = Attribute::get(C, AttrBuilder(OldAttrList[i].Attrs).
789 removeAttributes(Attrs));
791 if (Attrs.hasAttributes()) // If any attributes left for this param, add them.
792 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
794 // Copy attributes for arguments after this one.
795 NewAttrList.insert(NewAttrList.end(),
796 OldAttrList.begin()+i, OldAttrList.end());
798 return get(C, NewAttrList);
801 void AttributeSet::dump() const {
803 for (unsigned i = 0; i < getNumSlots(); ++i) {
804 unsigned Index = getSlotIndex(i);
805 dbgs() << "{ " << Index << " => " << getAsString(Index) << " } ";
811 //===----------------------------------------------------------------------===//
812 // AttributeFuncs Function Defintions
813 //===----------------------------------------------------------------------===//
815 Attribute AttributeFuncs::typeIncompatible(Type *Ty) {
816 AttrBuilder Incompatible;
818 if (!Ty->isIntegerTy())
819 // Attribute that only apply to integers.
820 Incompatible.addAttribute(Attribute::SExt)
821 .addAttribute(Attribute::ZExt);
823 if (!Ty->isPointerTy())
824 // Attribute that only apply to pointers.
825 Incompatible.addAttribute(Attribute::ByVal)
826 .addAttribute(Attribute::Nest)
827 .addAttribute(Attribute::NoAlias)
828 .addAttribute(Attribute::NoCapture)
829 .addAttribute(Attribute::StructRet);
831 return Attribute::get(Ty->getContext(), Incompatible);
834 /// encodeLLVMAttributesForBitcode - This returns an integer containing an
835 /// encoding of all the LLVM attributes found in the given attribute bitset.
836 /// Any change to this encoding is a breaking change to bitcode compatibility.
837 uint64_t AttributeFuncs::encodeLLVMAttributesForBitcode(AttributeSet Attrs,
839 // FIXME: It doesn't make sense to store the alignment information as an
840 // expanded out value, we should store it as a log2 value. However, we can't
841 // just change that here without breaking bitcode compatibility. If this ever
842 // becomes a problem in practice, we should introduce new tag numbers in the
843 // bitcode file and have those tags use a more efficiently encoded alignment
846 // Store the alignment in the bitcode as a 16-bit raw value instead of a 5-bit
847 // log2 encoded value. Shift the bits above the alignment up by 11 bits.
848 uint64_t EncodedAttrs = Attrs.Raw(Index) & 0xffff;
849 if (Attrs.hasAttribute(Index, Attribute::Alignment))
850 EncodedAttrs |= Attrs.getParamAlignment(Index) << 16;
851 EncodedAttrs |= (Attrs.Raw(Index) & (0xffffULL << 21)) << 11;
855 /// decodeLLVMAttributesForBitcode - This returns an attribute bitset containing
856 /// the LLVM attributes that have been decoded from the given integer. This
857 /// function must stay in sync with 'encodeLLVMAttributesForBitcode'.
858 Attribute AttributeFuncs::decodeLLVMAttributesForBitcode(LLVMContext &C,
859 uint64_t EncodedAttrs){
860 // The alignment is stored as a 16-bit raw value from bits 31--16. We shift
861 // the bits above 31 down by 11 bits.
862 unsigned Alignment = (EncodedAttrs & (0xffffULL << 16)) >> 16;
863 assert((!Alignment || isPowerOf2_32(Alignment)) &&
864 "Alignment must be a power of two.");
866 AttrBuilder B(EncodedAttrs & 0xffff);
868 B.addAlignmentAttr(Alignment);
869 B.addRawValue((EncodedAttrs & (0xffffULL << 32)) >> 11);
870 return Attribute::get(C, B);