|
| | AddressRanges.h |
| | ADL.h |
| | AllocatorList.h |
| | Any.h |
| | This file provides Any, a non-template class modeled in the spirit of std::any.
|
| | APFixedPoint.h |
| | Defines the fixed point number interface.
|
| | APFloat.h |
| | This file declares a class to represent arbitrary precision floating point values and provide a variety of arithmetic operations on them.
|
| | APInt.h |
| | This file implements a class to represent arbitrary precision integral constant values and operations on them.
|
| | APSInt.h |
| | This file implements the APSInt class, which is a simple class that represents an arbitrary sized integer that knows its signedness.
|
| | ArrayRef.h |
| | bit.h |
| | This file implements the C++20 <bit> header.
|
| | Bitfields.h |
| | This file implements methods to test, set and extract typed bits from packed unsigned integers.
|
| | BitmaskEnum.h |
| | Bitset.h |
| | BitVector.h |
| | This file implements the BitVector class.
|
| | BreadthFirstIterator.h |
| | This file builds on the ADT/GraphTraits.h file to build a generic breadth first graph iterator.
|
| | CachedHashString.h |
| | This file defines CachedHashString and CachedHashStringRef.
|
| | CoalescingBitVector.h |
| | A bitvector that uses an IntervalMap to coalesce adjacent elements into intervals.
|
| | CombinationGenerator.h |
| | Combination generator.
|
| | ConcurrentHashtable.h |
| | DAGDeltaAlgorithm.h |
| | DeltaAlgorithm.h |
| | DeltaTree.h |
| | DenseMap.h |
| | This file defines the DenseMap class.
|
| | DenseMapInfo.h |
| | This file defines DenseMapInfo traits for DenseMap.
|
| | DenseMapInfoVariant.h |
| | This file defines DenseMapInfo traits for DenseMap<std::variant<Ts...>>.
|
| | DenseSet.h |
| | This file defines the DenseSet and SmallDenseSet classes.
|
| | DepthFirstIterator.h |
| | This file builds on the ADT/GraphTraits.h file to build generic depth first graph iterator.
|
| | DirectedGraph.h |
| | This file defines the interface and a base class implementation for a directed graph.
|
| | DynamicAPInt.h |
| | edit_distance.h |
| | This file defines a Levenshtein distance function that works for any two sequences, with each element of each sequence being analogous to a character in a string.
|
| | EnumeratedArray.h |
| | This file defines an array type that can be indexed using scoped enum values.
|
| | EpochTracker.h |
| | This file defines the DebugEpochBase and DebugEpochBase::HandleBase classes.
|
| | EquivalenceClasses.h |
| | Generic implementation of equivalence classes through the use Tarjan's efficient union-find algorithm.
|
| | fallible_iterator.h |
| | FloatingPointMode.h |
| | Utilities for dealing with flags related to floating point properties and mode controls.
|
| | FoldingSet.h |
| | This file defines a hash set that can be used to remove duplication of nodes in a graph.
|
| | GenericConvergenceVerifier.h |
| | A verifier for the static rules of convergence control tokens that works with both LLVM IR and MIR.
|
| | GenericCycleImpl.h |
| | This template implementation resides in a separate file so that it does not get injected into every .cpp file that includes the generic header.
|
| | GenericCycleInfo.h |
| | Find all cycles in a control-flow graph, including irreducible loops.
|
| | GenericSSAContext.h |
| | This file defines the little GenericSSAContext<X> template class that can be used to implement IR analyses as templates.
|
| | GenericUniformityImpl.h |
| | Implementation of uniformity analysis.
|
| | GenericUniformityInfo.h |
| | GraphTraits.h |
| | This file defines the little GraphTraits<X> template class that should be specialized by classes that want to be iteratable by generic graph iterators.
|
| | Hashing.h |
| | ilist.h |
| | This file defines classes to implement an intrusive doubly linked list class (i.e.
|
| | ilist_base.h |
| | ilist_iterator.h |
| | ilist_node.h |
| | This file defines the ilist_node class template, which is a convenient base class for creating classes that can be used with ilists.
|
| | ilist_node_base.h |
| | ilist_node_options.h |
| | ImmutableList.h |
| | This file defines the ImmutableList class.
|
| | ImmutableMap.h |
| | This file defines the ImmutableMap class.
|
| | ImmutableSet.h |
| | This file defines the ImutAVLTree and ImmutableSet classes.
|
| | IndexedMap.h |
| | This file implements an indexed map.
|
| | IntEqClasses.h |
| | Equivalence classes for small integers.
|
| | IntervalMap.h |
| | This file implements a coalescing interval map for small objects.
|
| | IntervalTree.h |
| | IntrusiveRefCntPtr.h |
| | This file defines the RefCountedBase, ThreadSafeRefCountedBase, and IntrusiveRefCntPtr classes.
|
| | iterator.h |
| | iterator_range.h |
| | This provides a very simple, boring adaptor for a begin and end iterator into a range type.
|
| | LazyAtomicPointer.h |
| | MapVector.h |
| | This file implements a map that provides insertion order iteration.
|
| | PackedVector.h |
| | This file implements the PackedVector class.
|
| | PagedVector.h |
| | PointerEmbeddedInt.h |
| | PointerIntPair.h |
| | This file defines the PointerIntPair class.
|
| | PointerSumType.h |
| | PointerUnion.h |
| | This file defines the PointerUnion class, which is a discriminated union of pointer types.
|
| | PostOrderIterator.h |
| | This file builds on the ADT/GraphTraits.h file to build a generic graph post order iterator.
|
| | PriorityQueue.h |
| | This file defines the PriorityQueue class.
|
| | PriorityWorklist.h |
| | This file provides a priority worklist.
|
| | RadixTree.h |
| | RewriteBuffer.h |
| | RewriteRope.h |
| | SCCIterator.h |
| | This builds on the llvm/ADT/GraphTraits.h file to find the strongly connected components (SCCs) of a graph in O(N+E) time using Tarjan's DFS algorithm.
|
| | ScopedHashTable.h |
| | ScopeExit.h |
| | This file defines the make_scope_exit function, which executes user-defined cleanup logic at scope exit.
|
| | Sequence.h |
| | Provides some synthesis utilities to produce sequences of values.
|
| | SetOperations.h |
| | This file defines generic set operations that may be used on set's of different types, and different element types.
|
| | SetVector.h |
| | This file implements a set that has insertion order iteration characteristics.
|
| | simple_ilist.h |
| | SlowDynamicAPInt.h |
| | SmallBitVector.h |
| | This file implements the SmallBitVector class.
|
| | SmallPtrSet.h |
| | This file defines the SmallPtrSet class.
|
| | SmallSet.h |
| | This file defines the SmallSet class.
|
| | SmallString.h |
| | This file defines the SmallString class.
|
| | SmallVector.h |
| | This file defines the SmallVector class.
|
| | SparseBitVector.h |
| | This file defines the SparseBitVector class.
|
| | SparseMultiSet.h |
| | This file defines the SparseMultiSet class, which adds multiset behavior to the SparseSet.
|
| | SparseSet.h |
| | This file defines the SparseSet class derived from the version described in Briggs, Torczon, "An efficient representation for sparse sets", ACM Letters on Programming Languages and Systems, Volume 2 Issue 1-4, March-Dec.
|
| | StableHashing.h |
| | Statistic.h |
| | This file defines the 'Statistic' class, which is designed to be an easy way to expose various metrics from passes.
|
| | STLForwardCompat.h |
| | This file contains library features backported from future STL versions.
|
| | StringMap.h |
| | This file defines the StringMap class.
|
| | StringMapEntry.h |
| | This file defines the StringMapEntry class - it is intended to be a low dependency implementation detail of StringMap that is more suitable for inclusion in public headers than StringMap.h itself is.
|
| | StringRef.h |
| | StringSet.h |
| | StringSet - A set-like wrapper for the StringMap.
|
| | StringSwitch.h |
| | This file implements the StringSwitch template, which mimics a switch() statement whose cases are string literals.
|
| | StringTable.h |
| | TinyPtrVector.h |
| | TrieHashIndexGenerator.h |
| | TrieRawHashMap.h |
| | Twine.h |
| | TypeSwitch.h |
| | This file implements the TypeSwitch template, which mimics a switch() statement whose cases are type names.
|
| | Uniformity.h |
| | UniqueVector.h |