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) {
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 &Attr) {
333 uint64_t Mask = Attr.Raw();
335 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
336 I = Attribute::AttrKind(I + 1))
337 if ((Mask & AttributeImpl::getAttrMask(I)) != 0)
340 if (Attr.getAlignment())
341 Alignment = Attr.getAlignment();
342 if (Attr.getStackAlignment())
343 StackAlignment = Attr.getStackAlignment();
347 AttrBuilder &AttrBuilder::removeAttributes(const Attribute &A){
348 uint64_t Mask = A.Raw();
350 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
351 I = Attribute::AttrKind(I + 1)) {
352 if (Mask & AttributeImpl::getAttrMask(I)) {
355 if (I == Attribute::Alignment)
357 else if (I == Attribute::StackAlignment)
365 bool AttrBuilder::contains(Attribute::AttrKind A) const {
366 return Attrs.count(A);
369 bool AttrBuilder::hasAttributes() const {
370 return !Attrs.empty();
373 bool AttrBuilder::hasAttributes(const Attribute &A) const {
374 return Raw() & A.Raw();
377 bool AttrBuilder::hasAlignmentAttr() const {
378 return Alignment != 0;
381 uint64_t AttrBuilder::Raw() const {
384 for (DenseSet<Attribute::AttrKind>::const_iterator I = Attrs.begin(),
385 E = Attrs.end(); I != E; ++I) {
386 Attribute::AttrKind Kind = *I;
388 if (Kind == Attribute::Alignment)
389 Mask |= (Log2_32(Alignment) + 1) << 16;
390 else if (Kind == Attribute::StackAlignment)
391 Mask |= (Log2_32(StackAlignment) + 1) << 26;
393 Mask |= AttributeImpl::getAttrMask(Kind);
399 bool AttrBuilder::operator==(const AttrBuilder &B) {
400 SmallVector<Attribute::AttrKind, 8> This(Attrs.begin(), Attrs.end());
401 SmallVector<Attribute::AttrKind, 8> That(B.Attrs.begin(), B.Attrs.end());
405 //===----------------------------------------------------------------------===//
406 // AttributeImpl Definition
407 //===----------------------------------------------------------------------===//
409 AttributeImpl::AttributeImpl(LLVMContext &C, uint64_t data)
411 Data = ConstantInt::get(Type::getInt64Ty(C), data);
413 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data)
415 Data = ConstantInt::get(Type::getInt64Ty(C), data);
417 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data,
418 ArrayRef<Constant*> values)
420 Data = ConstantInt::get(Type::getInt64Ty(C), data);
421 Vals.reserve(values.size());
422 Vals.append(values.begin(), values.end());
424 AttributeImpl::AttributeImpl(LLVMContext &C, StringRef data)
426 Data = ConstantDataArray::getString(C, data);
429 bool AttributeImpl::operator==(Attribute::AttrKind Kind) const {
430 if (ConstantInt *CI = dyn_cast<ConstantInt>(Data))
431 return CI->getZExtValue() == Kind;
434 bool AttributeImpl::operator!=(Attribute::AttrKind Kind) const {
435 return !(*this == Kind);
438 bool AttributeImpl::operator==(StringRef Kind) const {
439 if (ConstantDataArray *CDA = dyn_cast<ConstantDataArray>(Data))
441 return CDA->getAsString() == Kind;
444 bool AttributeImpl::operator!=(StringRef Kind) const {
445 return !(*this == Kind);
448 uint64_t AttributeImpl::Raw() const {
449 // FIXME: Remove this.
450 return cast<ConstantInt>(Data)->getZExtValue();
453 uint64_t AttributeImpl::getAttrMask(Attribute::AttrKind Val) {
455 case Attribute::EndAttrKinds:
456 case Attribute::AttrKindEmptyKey:
457 case Attribute::AttrKindTombstoneKey:
458 llvm_unreachable("Synthetic enumerators which should never get here");
460 case Attribute::None: return 0;
461 case Attribute::ZExt: return 1 << 0;
462 case Attribute::SExt: return 1 << 1;
463 case Attribute::NoReturn: return 1 << 2;
464 case Attribute::InReg: return 1 << 3;
465 case Attribute::StructRet: return 1 << 4;
466 case Attribute::NoUnwind: return 1 << 5;
467 case Attribute::NoAlias: return 1 << 6;
468 case Attribute::ByVal: return 1 << 7;
469 case Attribute::Nest: return 1 << 8;
470 case Attribute::ReadNone: return 1 << 9;
471 case Attribute::ReadOnly: return 1 << 10;
472 case Attribute::NoInline: return 1 << 11;
473 case Attribute::AlwaysInline: return 1 << 12;
474 case Attribute::OptimizeForSize: return 1 << 13;
475 case Attribute::StackProtect: return 1 << 14;
476 case Attribute::StackProtectReq: return 1 << 15;
477 case Attribute::Alignment: return 31 << 16;
478 case Attribute::NoCapture: return 1 << 21;
479 case Attribute::NoRedZone: return 1 << 22;
480 case Attribute::NoImplicitFloat: return 1 << 23;
481 case Attribute::Naked: return 1 << 24;
482 case Attribute::InlineHint: return 1 << 25;
483 case Attribute::StackAlignment: return 7 << 26;
484 case Attribute::ReturnsTwice: return 1 << 29;
485 case Attribute::UWTable: return 1 << 30;
486 case Attribute::NonLazyBind: return 1U << 31;
487 case Attribute::AddressSafety: return 1ULL << 32;
488 case Attribute::MinSize: return 1ULL << 33;
489 case Attribute::NoDuplicate: return 1ULL << 34;
491 llvm_unreachable("Unsupported attribute type");
494 bool AttributeImpl::hasAttribute(Attribute::AttrKind A) const {
495 return (Raw() & getAttrMask(A)) != 0;
498 bool AttributeImpl::hasAttributes() const {
502 uint64_t AttributeImpl::getAlignment() const {
503 return Raw() & getAttrMask(Attribute::Alignment);
506 void AttributeImpl::setAlignment(unsigned Align) {
507 Vals.push_back(ConstantInt::get(Type::getInt64Ty(Context), Align));
510 uint64_t AttributeImpl::getStackAlignment() const {
511 return Raw() & getAttrMask(Attribute::StackAlignment);
514 void AttributeImpl::setStackAlignment(unsigned Align) {
515 Vals.push_back(ConstantInt::get(Type::getInt64Ty(Context), Align));
518 void AttributeImpl::Profile(FoldingSetNodeID &ID, Constant *Data,
519 ArrayRef<Constant*> Vals) {
520 ID.AddInteger(cast<ConstantInt>(Data)->getZExtValue());
522 // FIXME: Not yet supported.
523 for (ArrayRef<Constant*>::iterator I = Vals.begin(), E = Vals.end();
529 //===----------------------------------------------------------------------===//
530 // AttributeWithIndex Definition
531 //===----------------------------------------------------------------------===//
533 AttributeWithIndex AttributeWithIndex::get(LLVMContext &C, unsigned Idx,
535 // FIXME: This is temporary, but necessary for the conversion.
536 AttrBuilder B(AS, Idx);
537 return get(Idx, Attribute::get(C, B));
540 //===----------------------------------------------------------------------===//
541 // AttributeSetImpl Definition
542 //===----------------------------------------------------------------------===//
544 AttributeSet AttributeSet::getRetAttributes() const {
546 return AttrList && hasAttributes(ReturnIndex) ?
547 AttributeSet::get(AttrList->getContext(),
548 AttributeWithIndex::get(ReturnIndex,
549 getAttributes(ReturnIndex))) :
553 AttributeSet AttributeSet::getFnAttributes() const {
555 return AttrList && hasAttributes(FunctionIndex) ?
556 AttributeSet::get(AttrList->getContext(),
557 AttributeWithIndex::get(FunctionIndex,
558 getAttributes(FunctionIndex))) :
562 AttributeSet AttributeSet::get(LLVMContext &C,
563 ArrayRef<AttributeWithIndex> Attrs) {
564 // If there are no attributes then return a null AttributesList pointer.
566 return AttributeSet();
569 for (unsigned i = 0, e = Attrs.size(); i != e; ++i) {
570 assert(Attrs[i].Attrs.hasAttributes() &&
571 "Pointless attribute!");
572 assert((!i || Attrs[i-1].Index < Attrs[i].Index) &&
573 "Misordered AttributesList!");
577 // Otherwise, build a key to look up the existing attributes.
578 LLVMContextImpl *pImpl = C.pImpl;
580 AttributeSetImpl::Profile(ID, Attrs);
583 AttributeSetImpl *PA = pImpl->AttrsLists.FindNodeOrInsertPos(ID, InsertPoint);
585 // If we didn't find any existing attributes of the same shape then
586 // create a new one and insert it.
588 PA = new AttributeSetImpl(C, Attrs);
589 pImpl->AttrsLists.InsertNode(PA, InsertPoint);
592 // Return the AttributesList that we found or created.
593 return AttributeSet(PA);
596 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, AttrBuilder &B) {
597 // FIXME: This should be implemented as a loop that creates the
598 // AttributeWithIndexes that then are used to create the AttributeSet.
599 if (!B.hasAttributes())
600 return AttributeSet();
601 return get(C, AttributeWithIndex::get(Idx, Attribute::get(C, B)));
604 //===----------------------------------------------------------------------===//
605 // AttributeSet Method Implementations
606 //===----------------------------------------------------------------------===//
608 const AttributeSet &AttributeSet::operator=(const AttributeSet &RHS) {
609 AttrList = RHS.AttrList;
613 /// getNumSlots - Return the number of slots used in this attribute list.
614 /// This is the number of arguments that have an attribute set on them
615 /// (including the function itself).
616 unsigned AttributeSet::getNumSlots() const {
617 return AttrList ? AttrList->getNumAttributes() : 0;
620 /// getSlot - Return the AttributeWithIndex at the specified slot. This
621 /// holds a number plus a set of attributes.
622 const AttributeWithIndex &AttributeSet::getSlot(unsigned Slot) const {
623 assert(AttrList && Slot < AttrList->getNumAttributes() &&
624 "Slot # out of range!");
625 return AttrList->getAttributes()[Slot];
628 bool AttributeSet::hasAttribute(unsigned Index, Attribute::AttrKind Kind) const{
629 return getAttributes(Index).hasAttribute(Kind);
632 bool AttributeSet::hasAttributes(unsigned Index) const {
633 return getAttributes(Index).hasAttributes();
636 std::string AttributeSet::getAsString(unsigned Index) const {
637 return getAttributes(Index).getAsString();
640 unsigned AttributeSet::getParamAlignment(unsigned Idx) const {
641 return getAttributes(Idx).getAlignment();
644 unsigned AttributeSet::getStackAlignment(unsigned Index) const {
645 return getAttributes(Index).getStackAlignment();
648 uint64_t AttributeSet::Raw(unsigned Index) const {
649 // FIXME: Remove this.
650 return getAttributes(Index).Raw();
653 /// getAttributes - The attributes for the specified index are returned.
654 Attribute AttributeSet::getAttributes(unsigned Idx) const {
655 if (AttrList == 0) return Attribute();
657 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
658 for (unsigned i = 0, e = Attrs.size(); i != e && Attrs[i].Index <= Idx; ++i)
659 if (Attrs[i].Index == Idx)
660 return Attrs[i].Attrs;
665 /// hasAttrSomewhere - Return true if the specified attribute is set for at
666 /// least one parameter or for the return value.
667 bool AttributeSet::hasAttrSomewhere(Attribute::AttrKind Attr) const {
668 if (AttrList == 0) return false;
670 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
671 for (unsigned i = 0, e = Attrs.size(); i != e; ++i)
672 if (Attrs[i].Attrs.hasAttribute(Attr))
678 AttributeSet AttributeSet::addAttribute(LLVMContext &C, unsigned Idx,
679 Attribute::AttrKind Attr) const {
680 return addAttr(C, Idx, Attribute::get(C, Attr));
683 AttributeSet AttributeSet::addAttributes(LLVMContext &C, unsigned Idx,
684 AttributeSet Attrs) const {
685 return addAttr(C, Idx, Attrs.getAttributes(Idx));
688 AttributeSet AttributeSet::addAttr(LLVMContext &C, unsigned Idx,
689 Attribute Attrs) const {
690 Attribute OldAttrs = getAttributes(Idx);
692 // FIXME it is not obvious how this should work for alignment.
693 // For now, say we can't change a known alignment.
694 unsigned OldAlign = OldAttrs.getAlignment();
695 unsigned NewAlign = Attrs.getAlignment();
696 assert((!OldAlign || !NewAlign || OldAlign == NewAlign) &&
697 "Attempt to change alignment!");
700 AttrBuilder NewAttrs =
701 AttrBuilder(OldAttrs).addAttributes(Attrs);
702 if (NewAttrs == AttrBuilder(OldAttrs))
705 SmallVector<AttributeWithIndex, 8> NewAttrList;
707 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
709 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
710 unsigned i = 0, e = OldAttrList.size();
711 // Copy attributes for arguments before this one.
712 for (; i != e && OldAttrList[i].Index < Idx; ++i)
713 NewAttrList.push_back(OldAttrList[i]);
715 // If there are attributes already at this index, merge them in.
716 if (i != e && OldAttrList[i].Index == Idx) {
718 Attribute::get(C, AttrBuilder(Attrs).
719 addAttributes(OldAttrList[i].Attrs));
723 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
725 // Copy attributes for arguments after this one.
726 NewAttrList.insert(NewAttrList.end(),
727 OldAttrList.begin()+i, OldAttrList.end());
730 return get(C, NewAttrList);
733 AttributeSet AttributeSet::removeAttr(LLVMContext &C, unsigned Idx,
734 Attribute Attrs) const {
736 // FIXME it is not obvious how this should work for alignment.
737 // For now, say we can't pass in alignment, which no current use does.
738 assert(!Attrs.hasAttribute(Attribute::Alignment) &&
739 "Attempt to exclude alignment!");
741 if (AttrList == 0) return AttributeSet();
743 Attribute OldAttrs = getAttributes(Idx);
744 AttrBuilder NewAttrs =
745 AttrBuilder(OldAttrs).removeAttributes(Attrs);
746 if (NewAttrs == AttrBuilder(OldAttrs))
749 SmallVector<AttributeWithIndex, 8> NewAttrList;
750 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
751 unsigned i = 0, e = OldAttrList.size();
753 // Copy attributes for arguments before this one.
754 for (; i != e && OldAttrList[i].Index < Idx; ++i)
755 NewAttrList.push_back(OldAttrList[i]);
757 // If there are attributes already at this index, merge them in.
758 assert(OldAttrList[i].Index == Idx && "Attribute isn't set?");
759 Attrs = Attribute::get(C, AttrBuilder(OldAttrList[i].Attrs).
760 removeAttributes(Attrs));
762 if (Attrs.hasAttributes()) // If any attributes left for this param, add them.
763 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
765 // Copy attributes for arguments after this one.
766 NewAttrList.insert(NewAttrList.end(),
767 OldAttrList.begin()+i, OldAttrList.end());
769 return get(C, NewAttrList);
772 void AttributeSet::dump() const {
774 for (unsigned i = 0; i < getNumSlots(); ++i) {
775 const AttributeWithIndex &PAWI = getSlot(i);
776 dbgs() << "{ " << PAWI.Index << ", " << PAWI.Attrs.getAsString() << " } ";