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.getBitMask());
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.getBitMask());
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::getBitMask() const {
107 return pImpl ? pImpl->getBitMask() : 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.getBitMask() & 0xffff;
143 if (Attrs.hasAttribute(Attribute::Alignment))
144 EncodedAttrs |= Attrs.getAlignment() << 16;
145 EncodedAttrs |= (Attrs.getBitMask() & (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 void AttrBuilder::clear() {
245 Alignment = StackAlignment = 0;
248 AttrBuilder &AttrBuilder::addAttribute(Attribute::AttrKind Val) {
253 AttrBuilder &AttrBuilder::removeAttribute(Attribute::AttrKind Val) {
255 if (Val == Attribute::Alignment)
257 else if (Val == Attribute::StackAlignment)
263 AttrBuilder &AttrBuilder::addAlignmentAttr(unsigned Align) {
264 if (Align == 0) return *this;
266 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
267 assert(Align <= 0x40000000 && "Alignment too large.");
269 Attrs.insert(Attribute::Alignment);
274 AttrBuilder &AttrBuilder::addStackAlignmentAttr(unsigned Align) {
275 // Default alignment, allow the target to define how to align it.
276 if (Align == 0) return *this;
278 assert(isPowerOf2_32(Align) && "Alignment must be a power of two.");
279 assert(Align <= 0x100 && "Alignment too large.");
281 Attrs.insert(Attribute::StackAlignment);
282 StackAlignment = Align;
286 AttrBuilder &AttrBuilder::addRawValue(uint64_t Val) {
287 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
288 I = Attribute::AttrKind(I + 1)) {
289 if (uint64_t A = (Val & AttributeImpl::getAttrMask(I))) {
292 if (I == Attribute::Alignment)
293 Alignment = 1ULL << ((A >> 16) - 1);
294 else if (I == Attribute::StackAlignment)
295 StackAlignment = 1ULL << ((A >> 26)-1);
302 AttrBuilder &AttrBuilder::addAttributes(const Attribute &A) {
303 uint64_t Mask = A.getBitMask();
305 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
306 I = Attribute::AttrKind(I + 1)) {
307 if (uint64_t A = (Mask & AttributeImpl::getAttrMask(I))) {
310 if (I == Attribute::Alignment)
311 Alignment = 1ULL << ((A >> 16) - 1);
312 else if (I == Attribute::StackAlignment)
313 StackAlignment = 1ULL << ((A >> 26)-1);
320 AttrBuilder &AttrBuilder::removeAttributes(const Attribute &A){
321 uint64_t Mask = A.getBitMask();
323 for (Attribute::AttrKind I = Attribute::None; I != Attribute::EndAttrKinds;
324 I = Attribute::AttrKind(I + 1)) {
325 if (Mask & AttributeImpl::getAttrMask(I)) {
328 if (I == Attribute::Alignment)
330 else if (I == Attribute::StackAlignment)
338 bool AttrBuilder::contains(Attribute::AttrKind A) const {
339 return Attrs.count(A);
342 bool AttrBuilder::hasAttributes() const {
343 return !Attrs.empty();
346 bool AttrBuilder::hasAttributes(const Attribute &A) const {
347 return getBitMask() & A.getBitMask();
350 bool AttrBuilder::hasAlignmentAttr() const {
351 return Alignment != 0;
354 uint64_t AttrBuilder::getBitMask() const {
357 for (DenseSet<Attribute::AttrKind>::const_iterator I = Attrs.begin(),
358 E = Attrs.end(); I != E; ++I) {
359 Attribute::AttrKind Kind = *I;
361 if (Kind == Attribute::Alignment)
362 Mask |= (Log2_32(Alignment) + 1) << 16;
363 else if (Kind == Attribute::StackAlignment)
364 Mask |= (Log2_32(StackAlignment) + 1) << 26;
366 Mask |= AttributeImpl::getAttrMask(Kind);
372 bool AttrBuilder::operator==(const AttrBuilder &B) {
373 SmallVector<Attribute::AttrKind, 8> This(Attrs.begin(), Attrs.end());
374 SmallVector<Attribute::AttrKind, 8> That(B.Attrs.begin(), B.Attrs.end());
378 //===----------------------------------------------------------------------===//
379 // AttributeImpl Definition
380 //===----------------------------------------------------------------------===//
382 AttributeImpl::AttributeImpl(LLVMContext &C, uint64_t data)
384 Data = ConstantInt::get(Type::getInt64Ty(C), data);
386 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data)
388 Data = ConstantInt::get(Type::getInt64Ty(C), data);
390 AttributeImpl::AttributeImpl(LLVMContext &C, Attribute::AttrKind data,
391 ArrayRef<Constant*> values)
393 Data = ConstantInt::get(Type::getInt64Ty(C), data);
394 Vals.reserve(values.size());
395 Vals.append(values.begin(), values.end());
397 AttributeImpl::AttributeImpl(LLVMContext &C, StringRef data)
399 Data = ConstantDataArray::getString(C, data);
402 bool AttributeImpl::operator==(Attribute::AttrKind Kind) const {
403 if (ConstantInt *CI = dyn_cast<ConstantInt>(Data))
404 return CI->getZExtValue() == Kind;
407 bool AttributeImpl::operator!=(Attribute::AttrKind Kind) const {
408 return !(*this == Kind);
411 bool AttributeImpl::operator==(StringRef Kind) const {
412 if (ConstantDataArray *CDA = dyn_cast<ConstantDataArray>(Data))
414 return CDA->getAsString() == Kind;
417 bool AttributeImpl::operator!=(StringRef Kind) const {
418 return !(*this == Kind);
421 uint64_t AttributeImpl::getBitMask() const {
422 // FIXME: Remove this.
423 return cast<ConstantInt>(Data)->getZExtValue();
426 uint64_t AttributeImpl::getAttrMask(Attribute::AttrKind Val) {
428 case Attribute::EndAttrKinds:
429 case Attribute::AttrKindEmptyKey:
430 case Attribute::AttrKindTombstoneKey:
431 llvm_unreachable("Synthetic enumerators which should never get here");
433 case Attribute::None: return 0;
434 case Attribute::ZExt: return 1 << 0;
435 case Attribute::SExt: return 1 << 1;
436 case Attribute::NoReturn: return 1 << 2;
437 case Attribute::InReg: return 1 << 3;
438 case Attribute::StructRet: return 1 << 4;
439 case Attribute::NoUnwind: return 1 << 5;
440 case Attribute::NoAlias: return 1 << 6;
441 case Attribute::ByVal: return 1 << 7;
442 case Attribute::Nest: return 1 << 8;
443 case Attribute::ReadNone: return 1 << 9;
444 case Attribute::ReadOnly: return 1 << 10;
445 case Attribute::NoInline: return 1 << 11;
446 case Attribute::AlwaysInline: return 1 << 12;
447 case Attribute::OptimizeForSize: return 1 << 13;
448 case Attribute::StackProtect: return 1 << 14;
449 case Attribute::StackProtectReq: return 1 << 15;
450 case Attribute::Alignment: return 31 << 16;
451 case Attribute::NoCapture: return 1 << 21;
452 case Attribute::NoRedZone: return 1 << 22;
453 case Attribute::NoImplicitFloat: return 1 << 23;
454 case Attribute::Naked: return 1 << 24;
455 case Attribute::InlineHint: return 1 << 25;
456 case Attribute::StackAlignment: return 7 << 26;
457 case Attribute::ReturnsTwice: return 1 << 29;
458 case Attribute::UWTable: return 1 << 30;
459 case Attribute::NonLazyBind: return 1U << 31;
460 case Attribute::AddressSafety: return 1ULL << 32;
461 case Attribute::MinSize: return 1ULL << 33;
462 case Attribute::NoDuplicate: return 1ULL << 34;
464 llvm_unreachable("Unsupported attribute type");
467 bool AttributeImpl::hasAttribute(Attribute::AttrKind A) const {
468 return (getBitMask() & getAttrMask(A)) != 0;
471 bool AttributeImpl::hasAttributes() const {
472 return getBitMask() != 0;
475 uint64_t AttributeImpl::getAlignment() const {
476 return getBitMask() & getAttrMask(Attribute::Alignment);
479 void AttributeImpl::setAlignment(unsigned Align) {
480 Vals.push_back(ConstantInt::get(Type::getInt64Ty(Context), Align));
483 uint64_t AttributeImpl::getStackAlignment() const {
484 return getBitMask() & getAttrMask(Attribute::StackAlignment);
487 void AttributeImpl::setStackAlignment(unsigned Align) {
488 Vals.push_back(ConstantInt::get(Type::getInt64Ty(Context), Align));
491 //===----------------------------------------------------------------------===//
492 // AttributeSetImpl Definition
493 //===----------------------------------------------------------------------===//
495 AttributeSet AttributeSet::get(LLVMContext &C,
496 ArrayRef<AttributeWithIndex> Attrs) {
497 // If there are no attributes then return a null AttributesList pointer.
499 return AttributeSet();
502 for (unsigned i = 0, e = Attrs.size(); i != e; ++i) {
503 assert(Attrs[i].Attrs.hasAttributes() &&
504 "Pointless attribute!");
505 assert((!i || Attrs[i-1].Index < Attrs[i].Index) &&
506 "Misordered AttributesList!");
510 // Otherwise, build a key to look up the existing attributes.
511 LLVMContextImpl *pImpl = C.pImpl;
513 AttributeSetImpl::Profile(ID, Attrs);
516 AttributeSetImpl *PA = pImpl->AttrsLists.FindNodeOrInsertPos(ID, InsertPoint);
518 // If we didn't find any existing attributes of the same shape then
519 // create a new one and insert it.
521 PA = new AttributeSetImpl(C, Attrs);
522 pImpl->AttrsLists.InsertNode(PA, InsertPoint);
525 // Return the AttributesList that we found or created.
526 return AttributeSet(PA);
529 AttributeSet AttributeSet::get(LLVMContext &C, unsigned Idx, AttrBuilder &B) {
530 SmallVector<AttributeWithIndex, 8> Attrs;
531 for (AttrBuilder::iterator I = B.begin(), E = B.end(); I != E; ++I) {
532 Attribute::AttrKind Kind = *I;
533 Attribute A = Attribute::get(C, Kind);
535 if (Kind == Attribute::Alignment)
536 A.setAlignment(B.getAlignment());
537 else if (Kind == Attribute::StackAlignment)
538 A.setStackAlignment(B.getStackAlignment());
540 Attrs.push_back(AttributeWithIndex::get(Idx, A));
543 return get(C, Attrs);
546 //===----------------------------------------------------------------------===//
547 // AttributeSet Method Implementations
548 //===----------------------------------------------------------------------===//
550 const AttributeSet &AttributeSet::operator=(const AttributeSet &RHS) {
551 AttrList = RHS.AttrList;
555 /// getNumSlots - Return the number of slots used in this attribute list.
556 /// This is the number of arguments that have an attribute set on them
557 /// (including the function itself).
558 unsigned AttributeSet::getNumSlots() const {
559 return AttrList ? AttrList->getNumAttributes() : 0;
562 /// getSlot - Return the AttributeWithIndex at the specified slot. This
563 /// holds a number plus a set of attributes.
564 const AttributeWithIndex &AttributeSet::getSlot(unsigned Slot) const {
565 assert(AttrList && Slot < AttrList->getNumAttributes() &&
566 "Slot # out of range!");
567 return AttrList->getAttributes()[Slot];
570 bool AttributeSet::hasAttribute(unsigned Index, Attribute::AttrKind Kind) const{
571 return getAttributes(Index).hasAttribute(Kind);
574 bool AttributeSet::hasAttributes(unsigned Index) const {
575 return getAttributes(Index).hasAttributes();
578 std::string AttributeSet::getAsString(unsigned Index) const {
579 return getAttributes(Index).getAsString();
582 unsigned AttributeSet::getStackAlignment(unsigned Index) const {
583 return getAttributes(Index).getStackAlignment();
586 uint64_t AttributeSet::getBitMask(unsigned Index) const {
587 // FIXME: Remove this.
588 return getAttributes(Index).getBitMask();
591 /// getAttributes - The attributes for the specified index are returned.
592 /// Attributes for the result are denoted with Idx = 0. Function attributes are
593 /// denoted with Idx = ~0.
594 Attribute AttributeSet::getAttributes(unsigned Idx) const {
595 if (AttrList == 0) return Attribute();
597 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
598 for (unsigned i = 0, e = Attrs.size(); i != e && Attrs[i].Index <= Idx; ++i)
599 if (Attrs[i].Index == Idx)
600 return Attrs[i].Attrs;
605 /// hasAttrSomewhere - Return true if the specified attribute is set for at
606 /// least one parameter or for the return value.
607 bool AttributeSet::hasAttrSomewhere(Attribute::AttrKind Attr) const {
608 if (AttrList == 0) return false;
610 ArrayRef<AttributeWithIndex> Attrs = AttrList->getAttributes();
611 for (unsigned i = 0, e = Attrs.size(); i != e; ++i)
612 if (Attrs[i].Attrs.hasAttribute(Attr))
618 AttributeSet AttributeSet::addAttr(LLVMContext &C, unsigned Idx,
619 Attribute Attrs) const {
620 Attribute OldAttrs = getAttributes(Idx);
622 // FIXME it is not obvious how this should work for alignment.
623 // For now, say we can't change a known alignment.
624 unsigned OldAlign = OldAttrs.getAlignment();
625 unsigned NewAlign = Attrs.getAlignment();
626 assert((!OldAlign || !NewAlign || OldAlign == NewAlign) &&
627 "Attempt to change alignment!");
630 AttrBuilder NewAttrs =
631 AttrBuilder(OldAttrs).addAttributes(Attrs);
632 if (NewAttrs == AttrBuilder(OldAttrs))
635 SmallVector<AttributeWithIndex, 8> NewAttrList;
637 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
639 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
640 unsigned i = 0, e = OldAttrList.size();
641 // Copy attributes for arguments before this one.
642 for (; i != e && OldAttrList[i].Index < Idx; ++i)
643 NewAttrList.push_back(OldAttrList[i]);
645 // If there are attributes already at this index, merge them in.
646 if (i != e && OldAttrList[i].Index == Idx) {
648 Attribute::get(C, AttrBuilder(Attrs).
649 addAttributes(OldAttrList[i].Attrs));
653 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
655 // Copy attributes for arguments after this one.
656 NewAttrList.insert(NewAttrList.end(),
657 OldAttrList.begin()+i, OldAttrList.end());
660 return get(C, NewAttrList);
663 AttributeSet AttributeSet::removeAttr(LLVMContext &C, unsigned Idx,
664 Attribute Attrs) const {
666 // FIXME it is not obvious how this should work for alignment.
667 // For now, say we can't pass in alignment, which no current use does.
668 assert(!Attrs.hasAttribute(Attribute::Alignment) &&
669 "Attempt to exclude alignment!");
671 if (AttrList == 0) return AttributeSet();
673 Attribute OldAttrs = getAttributes(Idx);
674 AttrBuilder NewAttrs =
675 AttrBuilder(OldAttrs).removeAttributes(Attrs);
676 if (NewAttrs == AttrBuilder(OldAttrs))
679 SmallVector<AttributeWithIndex, 8> NewAttrList;
680 ArrayRef<AttributeWithIndex> OldAttrList = AttrList->getAttributes();
681 unsigned i = 0, e = OldAttrList.size();
683 // Copy attributes for arguments before this one.
684 for (; i != e && OldAttrList[i].Index < Idx; ++i)
685 NewAttrList.push_back(OldAttrList[i]);
687 // If there are attributes already at this index, merge them in.
688 assert(OldAttrList[i].Index == Idx && "Attribute isn't set?");
689 Attrs = Attribute::get(C, AttrBuilder(OldAttrList[i].Attrs).
690 removeAttributes(Attrs));
692 if (Attrs.hasAttributes()) // If any attributes left for this param, add them.
693 NewAttrList.push_back(AttributeWithIndex::get(Idx, Attrs));
695 // Copy attributes for arguments after this one.
696 NewAttrList.insert(NewAttrList.end(),
697 OldAttrList.begin()+i, OldAttrList.end());
699 return get(C, NewAttrList);
702 void AttributeSet::dump() const {
704 for (unsigned i = 0; i < getNumSlots(); ++i) {
705 const AttributeWithIndex &PAWI = getSlot(i);
706 dbgs() << "{ " << PAWI.Index << ", " << PAWI.Attrs.getAsString() << " } ";