|
LLVM
3.7.0
|
#include <DIE.h>
Classes | |
| class | const_iterator |
| class | iterator |
Public Member Functions | |
| bool | empty () const |
| iterator | insert (BumpPtrAllocator &Alloc, DIEValue V) |
| template<class... Ts> | |
| iterator | emplace (BumpPtrAllocator &Alloc, Ts &&...Args) |
| iterator | begin () |
| iterator | end () |
| const_iterator | begin () const |
| const_iterator | end () const |
A list of DIE values.
This is a singly-linked list, but instead of reversing the order of insertion, we keep a pointer to the back of the list so we can push in order.
There are two main reasons to choose a linked list over a customized vector-like data structure.
|
inline |
Definition at line 614 of file DIE.h.
References llvm::IntrusiveBackList< T >::begin().
Referenced by llvm::DIE::values().
|
inline |
Definition at line 616 of file DIE.h.
References llvm::IntrusiveBackList< T >::begin().
|
inline |
|
inline |
Definition at line 569 of file DIE.h.
References llvm::IntrusiveBackListBase::empty().
|
inline |
Definition at line 615 of file DIE.h.
References llvm::IntrusiveBackList< T >::end().
Referenced by llvm::DIE::values().
|
inline |
Definition at line 617 of file DIE.h.
References llvm::IntrusiveBackList< T >::end().
|
inline |
Definition at line 605 of file DIE.h.
References llvm::IntrusiveBackList< T >::back(), llvm::IntrusiveBackList< T >::push_back(), and llvm::IntrusiveBackList< Node >::toIterator().
Referenced by llvm::DIE::addValue(), and emplace().
1.8.6