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"
28 //===----------------------------------------------------------------------===//
29 // Attribute Implementation
30 //===----------------------------------------------------------------------===//
32 Attribute Attribute::get(LLVMContext &Context, ArrayRef<AttrKind> Vals) {
34 for (ArrayRef<AttrKind>::iterator I = Vals.begin(), E = Vals.end();
37 return Attribute::get(Context, B);
40 Attribute Attribute::get(LLVMContext &Context, AttrBuilder &B) {
41 // If there are no attributes, return an empty Attribute class.
42 if (!B.hasAttributes())
45 // Otherwise, build a key to look up the existing attributes.
46 LLVMContextImpl *pImpl = Context.pImpl;
48 ID.AddInteger(B.Raw());
51 AttributeImpl *PA = pImpl->AttrsSet.FindNodeOrInsertPos(ID, InsertPoint);
54 // If we didn't find any existing attributes of the same shape then create a
55 // new one and insert it.
56 PA = new AttributeImpl(Context, B.Raw());
57 pImpl->AttrsSet.InsertNode(PA, InsertPoint);
60 // Return the AttributesList that we found or created.
64 bool Attribute::hasAttribute(AttrKind Val) const {
65 return pImpl && pImpl->hasAttribute(Val);
68 bool Attribute::hasAttributes() const {
69 return pImpl && pImpl->hasAttributes();
72 /// This returns the alignment field of an attribute as a byte alignment value.
73 unsigned Attribute::getAlignment() const {
74 if (!hasAttribute(Attribute::Alignment))
76 return 1U << ((pImpl->getAlignment() >> 16) - 1);
79 void Attribute::setAlignment(unsigned Align) {
80 assert(hasAttribute(Attribute::Alignment) &&
81 "Trying to set the alignment on a non-alignment attribute!");
82 pImpl->setAlignment(Align);
85 /// This returns the stack alignment field of an attribute as a byte alignment
87 unsigned Attribute::getStackAlignment() const {
88 if (!hasAttribute(Attribute::StackAlignment))
90 return 1U << ((pImpl->getStackAlignment() >> 26) - 1);
93 void Attribute::setStackAlignment(unsigned Align) {
94 assert(hasAttribute(Attribute::StackAlignment) &&
95 "Trying to set the stack alignment on a non-alignment attribute!");
96 pImpl->setStackAlignment(Align);
99 bool Attribute::operator==(AttrKind K) const {
100 return pImpl && *pImpl == K;
102 bool Attribute::operator!=(AttrKind K) const {
103 return !(*this == K);
106 uint64_t Attribute::Raw() const {
107 return pImpl ? pImpl->Raw() : 0;
110 Attribute Attribute::typeIncompatible(Type *Ty) {
111 AttrBuilder Incompatible;
113 if (!Ty->isIntegerTy())
114 // Attribute that only apply to integers.
115 Incompatible.addAttribute(Attribute::SExt)
116 .addAttribute(Attribute::ZExt);
118 if (!Ty->isPointerTy())
119 // Attribute that only apply to pointers.
120 Incompatible.addAttribute(Attribute::ByVal)
121 .addAttribute(Attribute::Nest)
122 .addAttribute(Attribute::NoAlias)
123 .addAttribute(Attribute::NoCapture)
124 .addAttribute(Attribute::StructRet);
126 return Attribute::get(Ty->getContext(), Incompatible);
129 /// encodeLLVMAttributesForBitcode - This returns an integer containing an
130 /// encoding of all the LLVM attributes found in the given attribute bitset.
131 /// Any change to this encoding is a breaking change to bitcode compatibility.
132 uint64_t Attribute::encodeLLVMAttributesForBitcode(Attribute Attrs) {
133 // FIXME: It doesn't make sense to store the alignment information as an
134 // expanded out value, we should store it as a log2 value. However, we can't
135 // just change that here without breaking bitcode compatibility. If this ever
136 // becomes a problem in practice, we should introduce new tag numbers in the
137 // bitcode file and have those tags use a more efficiently encoded alignment
140 // Store the alignment in the bitcode as a 16-bit raw value instead of a 5-bit
141 // log2 encoded value. Shift the bits above the alignment up by 11 bits.
142 uint64_t EncodedAttrs = Attrs.Raw() & 0xffff;
143 if (Attrs.hasAttribute(Attribute::Alignment))
144 EncodedAttrs |= Attrs.getAlignment() << 16;
145 EncodedAttrs |= (Attrs.Raw() & (0xffffULL << 21)) << 11;
149 /// decodeLLVMAttributesForBitcode - This returns an attribute bitset containing
150 /// the LLVM attributes that have been decoded from the given integer. This
151 /// function must stay in sync with 'encodeLLVMAttributesForBitcode'.
152 Attribute Attribute::decodeLLVMAttributesForBitcode(LLVMContext &C,
153 uint64_t EncodedAttrs) {
154 // The alignment is stored as a 16-bit raw value from bits 31--16. We shift
155 // the bits above 31 down by 11 bits.
156 unsigned Alignment = (EncodedAttrs & (0xffffULL << 16)) >> 16;
157 assert((!Alignment || isPowerOf2_32(Alignment)) &&
158 "Alignment must be a power of two.");
160 AttrBuilder B(EncodedAttrs & 0xffff);
162 B.addAlignmentAttr(Alignment);
163 B.addRawValue((EncodedAttrs & (0xffffULL << 32)) >> 11);
164 return Attribute::get(C, B);
167 std::string Attribute::getAsString() const {
169 if (hasAttribute(Attribute::ZExt))
170 Result += "zeroext ";
171 if (hasAttribute(Attribute::SExt))
172 Result += "signext ";
173 if (hasAttribute(Attribute::NoReturn))
174 Result += "noreturn ";
175 if (hasAttribute(Attribute::NoUnwind))
176 Result += "nounwind ";
177 if (hasAttribute(Attribute::UWTable))
178 Result += "uwtable ";
179 if (hasAttribute(Attribute::ReturnsTwice))
180 Result += "returns_twice ";
181 if (hasAttribute(Attribute::InReg))
183 if (hasAttribute(Attribute::NoAlias))
184 Result += "noalias ";
185 if (hasAttribute(Attribute::NoCapture))
186 Result += "nocapture ";
187 if (hasAttribute(Attribute::StructRet))
189 if (hasAttribute(Attribute::ByVal))
191 if (hasAttribute(Attribute::Nest))
193 if (hasAttribute(Attribute::ReadNone))
194 Result += "readnone ";
195 if (hasAttribute(Attribute::ReadOnly))
196 Result += "readonly ";
197 if (hasAttribute(Attribute::OptimizeForSize))
198 Result += "optsize ";
199 if (hasAttribute(Attribute::NoInline))
200 Result += "noinline ";
201 if (hasAttribute(Attribute::InlineHint))
202 Result += "inlinehint ";
203 if (hasAttribute(Attribute::AlwaysInline))
204 Result += "alwaysinline ";
205 if (hasAttribute(Attribute::StackProtect))
207 if (hasAttribute(Attribute::StackProtectReq))
209 if (hasAttribute(Attribute::NoRedZone))
210 Result += "noredzone ";
211 if (hasAttribute(Attribute::NoImplicitFloat))
212 Result += "noimplicitfloat ";
213 if (hasAttribute(Attribute::Naked))
215 if (hasAttribute(Attribute::NonLazyBind))
216 Result += "nonlazybind ";
217 if (hasAttribute(Attribute::AddressSafety))
218 Result += "address_safety ";
219 if (hasAttribute(Attribute::MinSize))
220 Result += "minsize ";
221 if (hasAttribute(Attribute::StackAlignment)) {
222 Result += "alignstack(";
223 Result += utostr(getStackAlignment());
226 if (hasAttribute(Attribute::Alignment)) {
228 Result += utostr(getAlignment());
231 if (hasAttribute(Attribute::NoDuplicate))
232 Result += "noduplicate ";
233 // Trim the trailing space.
234 assert(!Result.empty() && "Unknown attribute!");
235 Result.erase(Result.end()-1);
239 //===----------------------------------------------------------------------===//
240 // AttrBuilder Method Implementations
241 //===----------------------------------------------------------------------===//
243 AttrBuilder::AttrBuilder(AttributeSet AS, unsigned Idx)
244 : Alignment(0), StackAlignment(0) {
245 AttributeSetImpl *pImpl = AS.AttrList;
248 ArrayRef<AttributeWithIndex> AttrList = pImpl->getAttributes();
249 const AttributeWithIndex *AWI = 0;
250 for (unsigned I = 0, E = AttrList.size(); I != E; ++I)
251 if (AttrList[I].Index == Idx) {
256 assert(AWI && "Cannot find index in attribute set!");
258 uint64_t Mask = AWI->Attrs.Raw();
260 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
261 I = Attribute::AttrKind(I + 1)) {
262 if (uint64_t A = (Mask & AttributeImpl::getAttrMask(I))) {
265 if (I == Attribute::Alignment)
266 Alignment = 1ULL << ((A >> 16) - 1);
267 else if (I == Attribute::StackAlignment)
268 StackAlignment = 1ULL << ((A >> 26)-1);
273 void AttrBuilder::clear() {
275 Alignment = StackAlignment = 0;
278 AttrBuilder &AttrBuilder::addAttribute(Attribute::AttrKind Val) {
283 AttrBuilder &AttrBuilder::removeAttribute(Attribute::AttrKind Val) {
285 if (Val == Attribute::Alignment)
287 else if (Val == Attribute::StackAlignment)
293 AttrBuilder &AttrBuilder::addAlignmentAttr(unsigned Align) {
294 if (Align == 0) return *this;
296 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
297 assert(Align <= 0x40000000 && "Alignment too large.");
299 Attrs.insert(Attribute::Alignment);
304 AttrBuilder &AttrBuilder::addStackAlignmentAttr(unsigned Align) {
305 // Default alignment, allow the target to define how to align it.
306 if (Align == 0) return *this;
308 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
309 assert(Align <= 0x100 && "Alignment too large.");
311 Attrs.insert(Attribute::StackAlignment);
312 StackAlignment = Align;
316 AttrBuilder &AttrBuilder::addRawValue(uint64_t Val) {
317 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
318 I = Attribute::AttrKind(I + 1)) {
319 if (uint64_t A = (Val & AttributeImpl::getAttrMask(I))) {
322 if (I == Attribute::Alignment)
323 Alignment = 1ULL << ((A >> 16) - 1);
324 else if (I == Attribute::StackAlignment)
325 StackAlignment = 1ULL << ((A >> 26)-1);
332 AttrBuilder &AttrBuilder::addAttributes(const Attribute &A) {
333 uint64_t Mask = A.Raw();
335 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
336 I = Attribute::AttrKind(I + 1)) {
337 if (uint64_t A = (Mask & AttributeImpl::getAttrMask(I))) {
340 if (I == Attribute::Alignment)
341 Alignment = 1ULL << ((A >> 16) - 1);
342 else if (I == Attribute::StackAlignment)
343 StackAlignment = 1ULL << ((A >> 26)-1);
350 AttrBuilder &AttrBuilder::removeAttributes(const Attribute &A){
351 uint64_t Mask = A.Raw();
353 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
354 I = Attribute::AttrKind(I + 1)) {
355 if (Mask & AttributeImpl::getAttrMask(I)) {
358 if (I == Attribute::Alignment)
360 else if (I == Attribute::StackAlignment)
368 bool AttrBuilder::contains(Attribute::AttrKind A) const {
369 return Attrs.count(A);
372 bool AttrBuilder::hasAttributes() const {
373 return !Attrs.empty();
376 bool AttrBuilder::hasAttributes(const Attribute &A) const {
377 return Raw() & A.Raw();
380 bool AttrBuilder::hasAlignmentAttr() const {
381 return Alignment != 0;
384 uint64_t AttrBuilder::Raw() const {
387 for (DenseSet<Attribute::AttrKind>::const_iterator I = Attrs.begin(),
388 E = Attrs.end(); I != E; ++I) {
389 Attribute::AttrKind Kind = *I;
391 if (Kind == Attribute::Alignment)
392 Mask |= (Log2_32(Alignment) + 1) << 16;
393 else if (Kind == Attribute::StackAlignment)
394 Mask |= (Log2_32(StackAlignment) + 1) << 26;
396 Mask |= AttributeImpl::getAttrMask(Kind);
402 bool AttrBuilder::operator==(const AttrBuilder &B) {
403 SmallVector<Attribute::AttrKind, 8> This(Attrs.begin(), Attrs.end());
404 SmallVector<Attribute::AttrKind, 8> That(B.Attrs.begin(), B.Attrs.end());
408 //===----------------------------------------------------------------------===//
409 // AttributeImpl Definition
410 //===----------------------------------------------------------------------===//
412 AttributeImpl::AttributeImpl(LLVMContext &C, uint64_t data)
414 Data = ConstantInt::get(Type::getInt64Ty(C), data);
416 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data)
418 Data = ConstantInt::get(Type::getInt64Ty(C), data);
420 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data,
421 ArrayRef<Constant*> values)
423 Data = ConstantInt::get(Type::getInt64Ty(C), data);
424 Vals.reserve(values.size());
425 Vals.append(values.begin(), values.end());
427 AttributeImpl::AttributeImpl(LLVMContext &C, StringRef data)
429 Data = ConstantDataArray::getString(C, data);
432 bool AttributeImpl::operator==(Attribute::AttrKind Kind) const {
433 if (ConstantInt *CI = dyn_cast<ConstantInt>(Data))
434 return CI->getZExtValue() == Kind;
437 bool AttributeImpl::operator!=(Attribute::AttrKind Kind) const {
438 return !(*this == Kind);
441 bool AttributeImpl::operator==(StringRef Kind) const {
442 if (ConstantDataArray *CDA = dyn_cast<ConstantDataArray>(Data))
444 return CDA->getAsString() == Kind;
447 bool AttributeImpl::operator!=(StringRef Kind) const {
448 return !(*this == Kind);
451 uint64_t AttributeImpl::Raw() const {
452 // FIXME: Remove this.
453 return cast<ConstantInt>(Data)->getZExtValue();
456 uint64_t AttributeImpl::getAttrMask(Attribute::AttrKind Val) {
458 case Attribute::EndAttrKinds:
459 case Attribute::AttrKindEmptyKey:
460 case Attribute::AttrKindTombstoneKey:
461 llvm_unreachable("Synthetic enumerators which should never get here");
463 case Attribute::None: return 0;
464 case Attribute::ZExt: return 1 << 0;
465 case Attribute::SExt: return 1 << 1;
466 case Attribute::NoReturn: return 1 << 2;
467 case Attribute::InReg: return 1 << 3;
468 case Attribute::StructRet: return 1 << 4;
469 case Attribute::NoUnwind: return 1 << 5;
470 case Attribute::NoAlias: return 1 << 6;
471 case Attribute::ByVal: return 1 << 7;
472 case Attribute::Nest: return 1 << 8;
473 case Attribute::ReadNone: return 1 << 9;
474 case Attribute::ReadOnly: return 1 << 10;
475 case Attribute::NoInline: return 1 << 11;
476 case Attribute::AlwaysInline: return 1 << 12;
477 case Attribute::OptimizeForSize: return 1 << 13;
478 case Attribute::StackProtect: return 1 << 14;
479 case Attribute::StackProtectReq: return 1 << 15;
480 case Attribute::Alignment: return 31 << 16;
481 case Attribute::NoCapture: return 1 << 21;
482 case Attribute::NoRedZone: return 1 << 22;
483 case Attribute::NoImplicitFloat: return 1 << 23;
484 case Attribute::Naked: return 1 << 24;
485 case Attribute::InlineHint: return 1 << 25;
486 case Attribute::StackAlignment: return 7 << 26;
487 case Attribute::ReturnsTwice: return 1 << 29;
488 case Attribute::UWTable: return 1 << 30;
489 case Attribute::NonLazyBind: return 1U << 31;
490 case Attribute::AddressSafety: return 1ULL << 32;
491 case Attribute::MinSize: return 1ULL << 33;
492 case Attribute::NoDuplicate: return 1ULL << 34;
494 llvm_unreachable("Unsupported attribute type");
497 bool AttributeImpl::hasAttribute(Attribute::AttrKind A) const {
498 return (Raw() & getAttrMask(A)) != 0;
501 bool AttributeImpl::hasAttributes() const {
505 uint64_t AttributeImpl::getAlignment() const {
506 return Raw() & getAttrMask(Attribute::Alignment);
509 void AttributeImpl::setAlignment(unsigned Align) {
510 Vals.push_back(ConstantInt::get(Type::getInt64Ty(Context), Align));
513 uint64_t AttributeImpl::getStackAlignment() const {
514 return Raw() & getAttrMask(Attribute::StackAlignment);
517 void AttributeImpl::setStackAlignment(unsigned Align) {
518 Vals.push_back(ConstantInt::get(Type::getInt64Ty(Context), Align));
521 void AttributeImpl::Profile(FoldingSetNodeID &ID, Constant *Data,
522 ArrayRef<Constant*> Vals) {
523 ID.AddInteger(cast<ConstantInt>(Data)->getZExtValue());
525 // FIXME: Not yet supported.
526 for (ArrayRef<Constant*>::iterator I = Vals.begin(), E = Vals.end();
532 //===----------------------------------------------------------------------===//
533 // AttributeSetImpl Definition
534 //===----------------------------------------------------------------------===//
536 AttributeSet AttributeSet::get(LLVMContext &C,
537 ArrayRef<AttributeWithIndex> Attrs) {
538 // If there are no attributes then return a null AttributesList pointer.
540 return AttributeSet();
543 for (unsigned i = 0, e = Attrs.size(); i != e; ++i) {
544 assert(Attrs[i].Attrs.hasAttributes() &&
545 "Pointless attribute!");
546 assert((!i || Attrs[i-1].Index < Attrs[i].Index) &&
547 "Misordered AttributesList!");
551 // Otherwise, build a key to look up the existing attributes.
552 LLVMContextImpl *pImpl = C.pImpl;
554 AttributeSetImpl::Profile(ID, Attrs);
557 AttributeSetImpl *PA = pImpl->AttrsLists.FindNodeOrInsertPos(ID, InsertPoint);
559 // If we didn't find any existing attributes of the same shape then
560 // create a new one and insert it.
562 PA = new AttributeSetImpl(C, Attrs);
563 pImpl->AttrsLists.InsertNode(PA, InsertPoint);
566 // Return the AttributesList that we found or created.
567 return AttributeSet(PA);
570 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, AttrBuilder &B) {
571 SmallVector<AttributeWithIndex, 8> Attrs;
572 for (AttrBuilder::iterator I = B.begin(), E = B.end(); I != E; ++I) {
573 Attribute::AttrKind Kind = *I;
574 Attribute A = Attribute::get(C, Kind);
576 if (Kind == Attribute::Alignment)
577 A.setAlignment(B.getAlignment());
578 else if (Kind == Attribute::StackAlignment)
579 A.setStackAlignment(B.getStackAlignment());
581 Attrs.push_back(AttributeWithIndex::get(Idx, A));
584 return get(C, Attrs);
587 //===----------------------------------------------------------------------===//
588 // AttributeSet Method Implementations
589 //===----------------------------------------------------------------------===//
591 const AttributeSet &AttributeSet::operator=(const AttributeSet &RHS) {
592 AttrList = RHS.AttrList;
596 /// getNumSlots - Return the number of slots used in this attribute list.
597 /// This is the number of arguments that have an attribute set on them
598 /// (including the function itself).
599 unsigned AttributeSet::getNumSlots() const {
600 return AttrList ? AttrList->getNumAttributes() : 0;
603 /// getSlot - Return the AttributeWithIndex at the specified slot. This
604 /// holds a number plus a set of attributes.
605 const AttributeWithIndex &AttributeSet::getSlot(unsigned Slot) const {
606 assert(AttrList && Slot < AttrList->getNumAttributes() &&
607 "Slot # out of range!");
608 return AttrList->getAttributes()[Slot];
611 bool AttributeSet::hasAttribute(unsigned Index, Attribute::AttrKind Kind) const{
612 return getAttributes(Index).hasAttribute(Kind);
615 bool AttributeSet::hasAttributes(unsigned Index) const {
616 return getAttributes(Index).hasAttributes();
619 std::string AttributeSet::getAsString(unsigned Index) const {
620 return getAttributes(Index).getAsString();
623 unsigned AttributeSet::getParamAlignment(unsigned Idx) const {
624 return getAttributes(Idx).getAlignment();
627 unsigned AttributeSet::getStackAlignment(unsigned Index) const {
628 return getAttributes(Index).getStackAlignment();
631 uint64_t AttributeSet::Raw(unsigned Index) const {
632 // FIXME: Remove this.
633 return getAttributes(Index).Raw();
636 /// getAttributes - The attributes for the specified index are returned.
637 /// Attributes for the result are denoted with Idx = 0. Function attributes are
638 /// denoted with Idx = ~0.
639 Attribute AttributeSet::getAttributes(unsigned Idx) const {
640 if (AttrList == 0) return Attribute();
642 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
643 for (unsigned i = 0, e = Attrs.size(); i != e && Attrs[i].Index <= Idx; ++i)
644 if (Attrs[i].Index == Idx)
645 return Attrs[i].Attrs;
650 /// hasAttrSomewhere - Return true if the specified attribute is set for at
651 /// least one parameter or for the return value.
652 bool AttributeSet::hasAttrSomewhere(Attribute::AttrKind Attr) const {
653 if (AttrList == 0) return false;
655 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
656 for (unsigned i = 0, e = Attrs.size(); i != e; ++i)
657 if (Attrs[i].Attrs.hasAttribute(Attr))
663 AttributeSet AttributeSet::addFnAttributes(LLVMContext &C,
664 AttributeSet Attrs) const {
665 return addAttr(C, FunctionIndex, getAttributes(FunctionIndex));
668 AttributeSet AttributeSet::addAttr(LLVMContext &C, unsigned Idx,
669 Attribute Attrs) const {
670 Attribute OldAttrs = getAttributes(Idx);
672 // FIXME it is not obvious how this should work for alignment.
673 // For now, say we can't change a known alignment.
674 unsigned OldAlign = OldAttrs.getAlignment();
675 unsigned NewAlign = Attrs.getAlignment();
676 assert((!OldAlign || !NewAlign || OldAlign == NewAlign) &&
677 "Attempt to change alignment!");
680 AttrBuilder NewAttrs =
681 AttrBuilder(OldAttrs).addAttributes(Attrs);
682 if (NewAttrs == AttrBuilder(OldAttrs))
685 SmallVector<AttributeWithIndex, 8> NewAttrList;
687 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
689 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
690 unsigned i = 0, e = OldAttrList.size();
691 // Copy attributes for arguments before this one.
692 for (; i != e && OldAttrList[i].Index < Idx; ++i)
693 NewAttrList.push_back(OldAttrList[i]);
695 // If there are attributes already at this index, merge them in.
696 if (i != e && OldAttrList[i].Index == Idx) {
698 Attribute::get(C, AttrBuilder(Attrs).
699 addAttributes(OldAttrList[i].Attrs));
703 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
705 // Copy attributes for arguments after this one.
706 NewAttrList.insert(NewAttrList.end(),
707 OldAttrList.begin()+i, OldAttrList.end());
710 return get(C, NewAttrList);
713 AttributeSet AttributeSet::removeAttr(LLVMContext &C, unsigned Idx,
714 Attribute Attrs) const {
716 // FIXME it is not obvious how this should work for alignment.
717 // For now, say we can't pass in alignment, which no current use does.
718 assert(!Attrs.hasAttribute(Attribute::Alignment) &&
719 "Attempt to exclude alignment!");
721 if (AttrList == 0) return AttributeSet();
723 Attribute OldAttrs = getAttributes(Idx);
724 AttrBuilder NewAttrs =
725 AttrBuilder(OldAttrs).removeAttributes(Attrs);
726 if (NewAttrs == AttrBuilder(OldAttrs))
729 SmallVector<AttributeWithIndex, 8> NewAttrList;
730 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
731 unsigned i = 0, e = OldAttrList.size();
733 // Copy attributes for arguments before this one.
734 for (; i != e && OldAttrList[i].Index < Idx; ++i)
735 NewAttrList.push_back(OldAttrList[i]);
737 // If there are attributes already at this index, merge them in.
738 assert(OldAttrList[i].Index == Idx && "Attribute isn't set?");
739 Attrs = Attribute::get(C, AttrBuilder(OldAttrList[i].Attrs).
740 removeAttributes(Attrs));
742 if (Attrs.hasAttributes()) // If any attributes left for this param, add them.
743 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
745 // Copy attributes for arguments after this one.
746 NewAttrList.insert(NewAttrList.end(),
747 OldAttrList.begin()+i, OldAttrList.end());
749 return get(C, NewAttrList);
752 void AttributeSet::dump() const {
754 for (unsigned i = 0; i < getNumSlots(); ++i) {
755 const AttributeWithIndex &PAWI = getSlot(i);
756 dbgs() << "{ " << PAWI.Index << ", " << PAWI.Attrs.getAsString() << " } ";