Directory dependency graph for ADT:
Files | |
| file | AddressRanges.h [code] |
| file | AllocatorList.h [code] |
| file | Any.h [code] |
| This file provides Any, a non-template class modeled in the spirit of std::any. | |
| file | APFixedPoint.h [code] |
| Defines the fixed point number interface. | |
| file | APFloat.h [code] |
| This file declares a class to represent arbitrary precision floating point values and provide a variety of arithmetic operations on them. | |
| file | APInt.h [code] |
| This file implements a class to represent arbitrary precision integral constant values and operations on them. | |
| file | APSInt.h [code] |
| This file implements the APSInt class, which is a simple class that represents an arbitrary sized integer that knows its signedness. | |
| file | ArrayRef.h [code] |
| file | bit.h [code] |
| This file implements the C++20 <bit> header. | |
| file | Bitfields.h [code] |
| This file implements methods to test, set and extract typed bits from packed unsigned integers. | |
| file | BitmaskEnum.h [code] |
| file | BitVector.h [code] |
| This file implements the BitVector class. | |
| file | BreadthFirstIterator.h [code] |
| This file builds on the ADT/GraphTraits.h file to build a generic breadth first graph iterator. | |
| file | CachedHashString.h [code] |
| This file defines CachedHashString and CachedHashStringRef. | |
| file | CoalescingBitVector.h [code] |
| A bitvector that uses an IntervalMap to coalesce adjacent elements into intervals. | |
| file | CombinationGenerator.h [code] |
| Combination generator. | |
| file | ConcurrentHashtable.h [code] |
| file | DAGDeltaAlgorithm.h [code] |
| file | DeltaAlgorithm.h [code] |
| file | DenseMap.h [code] |
| This file defines the DenseMap class. | |
| file | DenseMapInfo.h [code] |
| This file defines DenseMapInfo traits for DenseMap. | |
| file | DenseSet.h [code] |
| This file defines the DenseSet and SmallDenseSet classes. | |
| file | DepthFirstIterator.h [code] |
| This file builds on the ADT/GraphTraits.h file to build generic depth first graph iterator. | |
| file | DirectedGraph.h [code] |
| This file defines the interface and a base class implementation for a directed graph. | |
| file | edit_distance.h [code] |
| 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. | |
| file | EnumeratedArray.h [code] |
| This file defines an array type that can be indexed using scoped enum values. | |
| file | EpochTracker.h [code] |
| This file defines the DebugEpochBase and DebugEpochBase::HandleBase classes. | |
| file | EquivalenceClasses.h [code] |
| Generic implementation of equivalence classes through the use Tarjan's efficient union-find algorithm. | |
| file | fallible_iterator.h [code] |
| file | FloatingPointMode.h [code] |
| Utilities for dealing with flags related to floating point properties and mode controls. | |
| file | FoldingSet.h [code] |
| This file defines a hash set that can be used to remove duplication of nodes in a graph. | |
| file | FunctionExtras.h [code] |
This file provides a collection of function (or more generally, callable) type erasure utilities supplementing those provided by the standard library in <function>. | |
| file | GenericCycleImpl.h [code] |
| This template implementation resides in a separate file so that it does not get injected into every .cpp file that includes the generic header. | |
| file | GenericCycleInfo.h [code] |
| Find all cycles in a control-flow graph, including irreducible loops. | |
| file | GenericSSAContext.h [code] |
| This file defines the little GenericSSAContext<X> template class that can be used to implement IR analyses as templates. | |
| file | GenericUniformityImpl.h [code] |
| Implementation of uniformity analysis. | |
| file | GenericUniformityInfo.h [code] |
| file | GraphTraits.h [code] |
| This file defines the little GraphTraits<X> template class that should be specialized by classes that want to be iteratable by generic graph iterators. | |
| file | Hashing.h [code] |
| file | identity.h [code] |
| file | ilist.h [code] |
| This file defines classes to implement an intrusive doubly linked list class (i.e. | |
| file | ilist_base.h [code] |
| file | ilist_iterator.h [code] |
| file | ilist_node.h [code] |
| This file defines the ilist_node class template, which is a convenient base class for creating classes that can be used with ilists. | |
| file | ilist_node_base.h [code] |
| file | ilist_node_options.h [code] |
| file | ImmutableList.h [code] |
| This file defines the ImmutableList class. | |
| file | ImmutableMap.h [code] |
| This file defines the ImmutableMap class. | |
| file | ImmutableSet.h [code] |
| This file defines the ImutAVLTree and ImmutableSet classes. | |
| file | IndexedMap.h [code] |
| This file implements an indexed map. | |
| file | IntEqClasses.h [code] |
| Equivalence classes for small integers. | |
| file | IntervalMap.h [code] |
| This file implements a coalescing interval map for small objects. | |
| file | IntervalTree.h [code] |
| file | IntrusiveRefCntPtr.h [code] |
| This file defines the RefCountedBase, ThreadSafeRefCountedBase, and IntrusiveRefCntPtr classes. | |
| file | iterator.h [code] |
| file | iterator_range.h [code] |
| This provides a very simple, boring adaptor for a begin and end iterator into a range type. | |
| file | MapVector.h [code] |
| This file implements a map that provides insertion order iteration. | |
| file | None.h [code] |
| This file provides None, an enumerator for use in implicit constructors of various (usually templated) types to make such construction more terse. | |
| file | Optional.h [code] |
| This file provides Optional, a template class modeled in the spirit of OCaml's 'opt' variant. | |
| file | PackedVector.h [code] |
| This file implements the PackedVector class. | |
| file | PointerEmbeddedInt.h [code] |
| file | PointerIntPair.h [code] |
| This file defines the PointerIntPair class. | |
| file | PointerSumType.h [code] |
| file | PointerUnion.h [code] |
| This file defines the PointerUnion class, which is a discriminated union of pointer types. | |
| file | PostOrderIterator.h [code] |
| This file builds on the ADT/GraphTraits.h file to build a generic graph post order iterator. | |
| file | PriorityQueue.h [code] |
| This file defines the PriorityQueue class. | |
| file | PriorityWorklist.h [code] |
| This file provides a priority worklist. | |
| file | SCCIterator.h [code] |
| 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. | |
| file | ScopedHashTable.h [code] |
| file | ScopeExit.h [code] |
| This file defines the make_scope_exit function, which executes user-defined cleanup logic at scope exit. | |
| file | Sequence.h [code] |
| Provides some synthesis utilities to produce sequences of values. | |
| file | SetOperations.h [code] |
| This file defines generic set operations that may be used on set's of different types, and different element types. | |
| file | SetVector.h [code] |
| This file implements a set that has insertion order iteration characteristics. | |
| file | simple_ilist.h [code] |
| file | SmallBitVector.h [code] |
| This file implements the SmallBitVector class. | |
| file | SmallPtrSet.h [code] |
| This file defines the SmallPtrSet class. | |
| file | SmallSet.h [code] |
| This file defines the SmallSet class. | |
| file | SmallString.h [code] |
| This file defines the SmallString class. | |
| file | SmallVector.h [code] |
| This file defines the SmallVector class. | |
| file | SmallVectorExtras.h [code] |
| This file defines less commonly used SmallVector utilities. | |
| file | SparseBitVector.h [code] |
| This file defines the SparseBitVector class. | |
| file | SparseMultiSet.h [code] |
| This file defines the SparseMultiSet class, which adds multiset behavior to the SparseSet. | |
| file | SparseSet.h [code] |
| 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. | |
| file | Statistic.h [code] |
| This file defines the 'Statistic' class, which is designed to be an easy way to expose various metrics from passes. | |
| file | STLExtras.h [code] |
| This file contains some templates that are useful if you are working with the STL at all. | |
| file | STLForwardCompat.h [code] |
| This file contains library features backported from future STL versions. | |
| file | STLFunctionalExtras.h [code] |
| file | StringExtras.h [code] |
| This file contains some functions that are useful when dealing with strings. | |
| file | StringMap.h [code] |
| This file defines the StringMap class. | |
| file | StringMapEntry.h [code] |
| 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. | |
| file | StringRef.h [code] |
| file | StringSet.h [code] |
| StringSet - A set-like wrapper for the StringMap. | |
| file | StringSwitch.h [code] |
| This file implements the StringSwitch template, which mimics a switch() statement whose cases are string literals. | |
| file | TinyPtrVector.h [code] |
| file | Twine.h [code] |
| file | TypeSwitch.h [code] |
| This file implements the TypeSwitch template, which mimics a switch() statement whose cases are type names. | |
| file | Uniformity.h [code] |
| file | UniqueVector.h [code] |
