LLVM  13.0.0git
List of all members
llvm::IRSimilarity::IRInstructionDataList Struct Reference

#include "llvm/Analysis/IRSimilarityIdentifier.h"

Inheritance diagram for llvm::IRSimilarity::IRInstructionDataList:
Inheritance graph
Collaboration diagram for llvm::IRSimilarity::IRInstructionDataList:
Collaboration graph

Additional Inherited Members

- Public Types inherited from llvm::simple_ilist< IRInstructionData >
using value_type = typename OptionsT::value_type
using pointer = typename OptionsT::pointer
using reference = typename OptionsT::reference
using const_pointer = typename OptionsT::const_pointer
using const_reference = typename OptionsT::const_reference
using iterator = ilist_iterator< OptionsT, false, false >
using const_iterator = ilist_iterator< OptionsT, false, true >
using reverse_iterator = ilist_iterator< OptionsT, true, false >
using const_reverse_iterator = ilist_iterator< OptionsT, true, true >
using size_type = size_t
using difference_type = ptrdiff_t
- Public Member Functions inherited from llvm::simple_ilist< IRInstructionData >
 simple_ilist ()=default
 simple_ilist (const simple_ilist &)=delete
 simple_ilist (simple_ilist &&X)
 ~simple_ilist ()=default
simple_ilistoperator= (const simple_ilist &)=delete
simple_ilistoperator= (simple_ilist &&X)
iterator begin ()
const_iterator begin () const
iterator end ()
const_iterator end () const
reverse_iterator rbegin ()
const_reverse_iterator rbegin () const
reverse_iterator rend ()
const_reverse_iterator rend () const
LLVM_NODISCARD bool empty () const
 Check if the list is empty in constant time. More...
LLVM_NODISCARD size_type size () const
 Calculate the size of the list in linear time. More...
reference front ()
const_reference front () const
reference back ()
const_reference back () const
void push_front (reference Node)
 Insert a node at the front; never copies. More...
void push_back (reference Node)
 Insert a node at the back; never copies. More...
void pop_front ()
 Remove the node at the front; never deletes. More...
void pop_back ()
 Remove the node at the back; never deletes. More...
void swap (simple_ilist &X)
 Swap with another list in place using std::swap. More...
iterator insert (iterator I, reference Node)
 Insert a node by reference; never copies. More...
void insert (iterator I, Iterator First, Iterator Last)
 Insert a range of nodes; never copies. More...
void cloneFrom (const simple_ilist &L2, Cloner clone, Disposer dispose)
 Clone another list. More...
void remove (reference N)
 Remove a node by reference; never deletes. More...
void removeAndDispose (reference N, Disposer dispose)
 Remove a node by reference and dispose of it. More...
iterator erase (iterator I)
 Remove a node by iterator; never deletes. More...
iterator erase (iterator First, iterator Last)
 Remove a range of nodes; never deletes. More...
iterator eraseAndDispose (iterator I, Disposer dispose)
 Remove a node by iterator and dispose of it. More...
iterator eraseAndDispose (iterator First, iterator Last, Disposer dispose)
 Remove a range of nodes and dispose of them. More...
void clear ()
 Clear the list; never deletes. More...
void clearAndDispose (Disposer dispose)
 Clear the list and dispose of the nodes. More...
void splice (iterator I, simple_ilist &L2)
 Splice in another list. More...
void splice (iterator I, simple_ilist &L2, iterator Node)
 Splice in a node from another list. More...
void splice (iterator I, simple_ilist &, iterator First, iterator Last)
 Splice in a range of nodes from another list. More...
void merge (simple_ilist &RHS)
 Merge in another list. More...
void merge (simple_ilist &RHS, Compare comp)
void sort ()
 Sort the list. More...
void sort (Compare comp)

Detailed Description

Definition at line 201 of file IRSimilarityIdentifier.h.

The documentation for this struct was generated from the following file: