//===--- AttrIterator.h - Classes for attribute iteration -------*- C++ -*-===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This file defines the Attr vector and specific_attr_iterator interfaces. // //===----------------------------------------------------------------------===// #ifndef LLVM_CLANG_AST_ATTRITERATOR_H #define LLVM_CLANG_AST_ATTRITERATOR_H #include "clang/Basic/LLVM.h" #include namespace clang { class ASTContext; class Attr; } // Defined in ASTContext.h void *operator new(size_t Bytes, const clang::ASTContext &C, size_t Alignment = 16); // FIXME: Being forced to not have a default argument here due to redeclaration // rules on default arguments sucks void *operator new[](size_t Bytes, const clang::ASTContext &C, size_t Alignment); // It is good practice to pair new/delete operators. Also, MSVC gives many // warnings if a matching delete overload is not declared, even though the // throw() spec guarantees it will not be implicitly called. void operator delete(void *Ptr, const clang::ASTContext &C, size_t); void operator delete[](void *Ptr, const clang::ASTContext &C, size_t); namespace clang { /// AttrVec - A vector of Attr, which is how they are stored on the AST. typedef SmallVector AttrVec; typedef SmallVector ConstAttrVec; /// specific_attr_iterator - Iterates over a subrange of an AttrVec, only /// providing attributes that are of a specifc type. template class specific_attr_iterator { typedef typename Container::const_iterator Iterator; /// Current - The current, underlying iterator. /// In order to ensure we don't dereference an invalid iterator unless /// specifically requested, we don't necessarily advance this all the /// way. Instead, we advance it when an operation is requested; if the /// operation is acting on what should be a past-the-end iterator, /// then we offer no guarantees, but this way we do not dererence a /// past-the-end iterator when we move to a past-the-end position. mutable Iterator Current; void AdvanceToNext() const { while (!isa(*Current)) ++Current; } void AdvanceToNext(Iterator I) const { while (Current != I && !isa(*Current)) ++Current; } public: typedef SpecificAttr* value_type; typedef SpecificAttr* reference; typedef SpecificAttr* pointer; typedef std::forward_iterator_tag iterator_category; typedef std::ptrdiff_t difference_type; specific_attr_iterator() : Current() { } explicit specific_attr_iterator(Iterator i) : Current(i) { } reference operator*() const { AdvanceToNext(); return cast(*Current); } pointer operator->() const { AdvanceToNext(); return cast(*Current); } specific_attr_iterator& operator++() { ++Current; return *this; } specific_attr_iterator operator++(int) { specific_attr_iterator Tmp(*this); ++(*this); return Tmp; } friend bool operator==(specific_attr_iterator Left, specific_attr_iterator Right) { assert((Left.Current == 0) == (Right.Current == 0)); if (Left.Current < Right.Current) Left.AdvanceToNext(Right.Current); else Right.AdvanceToNext(Left.Current); return Left.Current == Right.Current; } friend bool operator!=(specific_attr_iterator Left, specific_attr_iterator Right) { return !(Left == Right); } }; template inline specific_attr_iterator specific_attr_begin(const Container& container) { return specific_attr_iterator(container.begin()); } template inline specific_attr_iterator specific_attr_end(const Container& container) { return specific_attr_iterator(container.end()); } template inline bool hasSpecificAttr(const Container& container) { return specific_attr_begin(container) != specific_attr_end(container); } template inline SpecificAttr *getSpecificAttr(const Container& container) { specific_attr_iterator i = specific_attr_begin(container); if (i != specific_attr_end(container)) return *i; else return 0; } } // end namespace clang #endif