LLVM API Documentation
#include <functional>#include <utility>#include <cstddef>#include "llvm/ADT/iterator.h"

Go to the source code of this file.
Namespaces | |
| namespace | llvm |
Classes | |
| struct | llvm::greater_ptr< Ty > |
| class | llvm::mapped_iterator< RootIt, UnaryFunc > |
Functions | |
| template<class T> | |
| static void | llvm::deleter (T *Ptr) |
| template<class _Iterator, class Func> | |
| mapped_iterator< _Iterator, Func > | llvm::operator+ (typename mapped_iterator< _Iterator, Func >::difference_type N, const mapped_iterator< _Iterator, Func > &X) |
| template<class ItTy, class FuncTy> | |
| mapped_iterator< ItTy, FuncTy > | llvm::map_iterator (const ItTy &I, FuncTy F) |
| template<typename ItTy, typename Dist> | |
| ItTy | llvm::next (ItTy it, Dist n) |
| template<typename ItTy> | |
| ItTy | llvm::next (ItTy it) |
| template<typename ItTy, typename Dist> | |
| ItTy | llvm::prior (ItTy it, Dist n) |
| template<typename ItTy> | |
| ItTy | llvm::prior (ItTy it) |
| template<typename T1, typename T2> | |
| tier< T1, T2 > | llvm::tie (T1 &f, T2 &s) |
| template<class T, std::size_t N> | |
| T * | llvm::array_endof (T(&x)[N]) |
| template<class T, std::size_t N> | |
| size_t | llvm::array_lengthof (T(&x)[N]) |
| Find the length of an array. | |
| template<typename T> | |
| static int | llvm::array_pod_sort_comparator (const void *P1, const void *P2) |
| template<typename T> | |
| static int(*)(const void *, const void *) | llvm::get_array_pad_sort_comparator (const T &X) |
| template<class IteratorTy> | |
| static void | llvm::array_pod_sort (IteratorTy Start, IteratorTy End) |
| first_type first |
Definition at line 189 of file STLExtras.h.
Referenced by llvm::cl::ValuesClass< DataType >::apply(), llvm::RegScavenger::backward(), llvm::AnalysisResolver::findImplPass(), FoldValueComparisonIntoPredecessors(), llvm::RegScavenger::forward(), llvm::ProfileInfoLoader::getBlockCounts(), llvm::TargetMachineRegistry::getClosestTargetForJIT(), llvm::ProfileInfoLoader::getFunctionCounts(), llvm::ProgramInfo::getLanguageCache(), LowerCALL(), llvm::cl::parser< const U::entry * >::parse(), llvm::cl::ParseCommandLineOptions(), llvm::CallGraphNode::removeCallEdgeFor(), llvm::CallGraphNode::replaceCallSite(), SimplifyEqualityComparisonWithOnlyPredecessor(), llvm::ValueEnumerator::ValueEnumerator(), ValuesOverlap(), and WriteModuleConstants().
| second_type second |
Definition at line 190 of file STLExtras.h.
Referenced by llvm::cl::ValuesClass< DataType >::apply(), llvm::RegScavenger::backward(), EliminateBlockCases(), FoldValueComparisonIntoPredecessors(), llvm::RegScavenger::forward(), llvm::ProfileInfoLoader::getBlockCounts(), llvm::ProgramInfo::getLanguageCache(), LowerCALL(), llvm::cl::ParseCommandLineOptions(), llvm::CallGraphNode::removeAnyCallEdgeTo(), SimplifyEqualityComparisonWithOnlyPredecessor(), llvm::MachineRegisterInfo::~MachineRegisterInfo(), and llvm::ProgramInfo::~ProgramInfo().
This web site is hosted by the Computer Science Department at the University of Illinois at Urbana-Champaign.