This document is meant to highlight some of the important classes and interfaces available in the LLVM source-base. This manual is not @@ -240,24 +243,22 @@ href="/doxygen/InstVisitor_8h-source.html">InstVisitor template.
This section contains general information that is useful if you are working in the LLVM source-base, but that isn't specific to any particular API.
-LLVM makes heavy use of the C++ Standard Template Library (STL), perhaps much more than you are used to, or have seen before. Because of @@ -303,11 +304,11 @@ to write maintainable code more than where to put your curly braces.
Here we highlight some LLVM APIs that are generally useful and good to know about when writing transformations.
-The LLVM source-base makes extensive use of a custom form of RTTI. These templates have many similarities to the C++ dynamic_cast<> @@ -440,12 +441,12 @@ are lots of examples in the LLVM source base.
- + -Although LLVM generally does not do much string manipulation, we do have several important APIs which take strings. Two important examples are the @@ -459,14 +460,12 @@ clients to perform a heap allocation which is usually unnecessary. Instead, many LLVM APIs use a StringRef or a const Twine& for passing strings efficiently.
-The StringRef data type represents a reference to a constant string (a character array and a length) and supports the common operations available @@ -502,11 +501,11 @@ small and pervasive enough in LLVM that it should always be passed by value.
The Twine class is an efficient way for APIs to accept concatenated strings. For example, a common LLVM paradigm is to name one instruction based on @@ -537,13 +536,14 @@ accept concatenated strings.
Often when working on your pass you will put a bunch of debugging printouts and other code into your pass. After you get it working, you want to remove @@ -589,15 +589,13 @@ enable or disable it directly in gdb. Just use "set DebugFlag=0" or program hasn't been started yet, you can always just run it with -debug.
-Sometimes you may find yourself in a situation where enabling -debug just turns on too much information (such as when working on the code @@ -665,13 +663,15 @@ DEBUG_WITH_TYPE("", errs() << "No debug type (2)\n");
The "llvm/ADT/Statistic.h" file @@ -766,11 +766,11 @@ maintainable and useful.
Several of the important data structures in LLVM are graphs: for example CFGs made out of LLVM BasicBlocks, CFGs made out of @@ -812,15 +812,21 @@ found at Graph Attributes.) If you want to restart and clear all the current graph attributes, then you can call DAG.clearGraphAttrs().
+Note that graph visualization features are compiled out of Release builds +to reduce file size. This means that you need a Debug+Asserts or +Release+Asserts build to use these features.
+ +LLVM has a plethora of data structures in the llvm/ADT/ directory, and we commonly use STL data structures. This section describes the trade-offs @@ -876,35 +882,47 @@ elements (but could contain many), for example, it's much better to use . Doing so avoids (relatively) expensive malloc/free calls, which dwarf the cost of adding the elements to the container.
-The llvm::ArrayRef class is the preferred class to use in an interface that + accepts a sequential list of elements in memory and just reads from them. By + taking an ArrayRef, the API can be passed a fixed size array, an std::vector, + an llvm::SmallVector and anything else that is contiguous in memory. +
Fixed size arrays are very simple and very fast. They are good if you know exactly how many elements you have, or you have a (low) upper bound on how many you have.
Heap allocated arrays (new[] + delete[]) are also simple. They are good if the number of elements is variable, if you know how many elements you will need before the array is allocated, and if the array is usually large (if not, @@ -916,11 +934,27 @@ construct those elements actually used).
TinyPtrVector<Type> is a highly specialized collection class +that is optimized to avoid allocation in the case when a vector has zero or one +elements. It has two major restrictions: 1) it can only hold values of pointer +type, and 2) it cannot hold a null pointer.
+ +Since this container is highly specialized, it is rarely used.
+SmallVector<Type, N> is a simple class that looks and smells just like vector<Type>: it supports efficient iteration, lays out elements in memory order (so you can @@ -945,11 +979,11 @@ SmallVectors are most useful when on the stack.
std::vector is well loved and respected. It is useful when SmallVector isn't: when the size of the vector is often large (thus the small optimization will @@ -964,7 +998,7 @@ vector is also useful when interfacing with code that expects vectors :).
for ( ... ) {
std::vector<foo> V;
- use V;
+ // make use of V.
}
std::vector<foo> V;
for ( ... ) {
- use V;
+ // make use of V.
V.clear();
}
@@ -987,11 +1021,11 @@ the loop.
std::deque is, in some senses, a generalized version of std::vector. Like std::vector, it provides constant time random access and other similar properties, but it also provides efficient access to the front of the list. It @@ -1003,11 +1037,11 @@ something cheaper.
std::list is an extremely inefficient class that is rarely useful. It performs a heap allocation for every element inserted into it, thus having an extremely high constant factor, particularly for small data types. std::list @@ -1021,11 +1055,11 @@ not invalidate iterator or pointers to other elements in the list.
ilist<T> implements an 'intrusive' doubly-linked list. It is intrusive, because it requires the element to store and provide access to the prev/next pointers for the list.
@@ -1051,22 +1085,60 @@ Related classes of interest are explained in the following subsections:+Useful for storing a vector of values using only a few number of bits for each +value. Apart from the standard operations of a vector-like container, it can +also perform an 'or' set operation. +
+ +For example:
+ +
+enum State {
+ None = 0x0,
+ FirstCondition = 0x1,
+ SecondCondition = 0x2,
+ Both = 0x3
+};
+
+State get() {
+ PackedVector<State, 2> Vec1;
+ Vec1.push_back(FirstCondition);
+
+ PackedVector<State, 2> Vec2;
+ Vec2.push_back(SecondCondition);
+
+ Vec1 |= Vec2;
+ return Vec1[0]; // returns 'Both'.
+}
+
ilist_traits<T> is ilist<T>'s customization mechanism. iplist<T> (and consequently ilist<T>) publicly derive from this traits class.
iplist<T> is ilist<T>'s base and as such supports a slightly narrower interface. Notably, inserters from T& are absent.
@@ -1076,11 +1148,11 @@ used for a wide variety of customizations.ilist_node<T> implements a the forward and backward links that are expected by the ilist<T> (and analogous containers) in the default manner.
@@ -1091,11 +1163,11 @@ in the default manner.ilists have another specialty that must be considered. To be a good citizen in the C++ ecosystem, it needs to support the standard container operations, such as begin and end iterators, etc. Also, the @@ -1129,11 +1201,11 @@ field in the ghostly sentinel which can be legally accessed.
Other STL containers are available, such as std::string.
There are also various STL adapter classes such as std::queue, @@ -1141,28 +1213,204 @@ std::priority_queue, std::stack, etc. These provide simplified access to an underlying container but don't affect the cost of the container itself.
+There are a variety of ways to pass around and use strings in C and C++, and +LLVM adds a few new options to choose from. Pick the first option on this list +that will do what you need, they are ordered according to their relative cost. +
++Note that is is generally preferred to not pass strings around as +"const char*"'s. These have a number of problems, including the fact +that they cannot represent embedded nul ("\0") characters, and do not have a +length available efficiently. The general replacement for 'const +char*' is StringRef. +
+ +For more information on choosing string containers for APIs, please see +Passing strings.
+ + + ++The StringRef class is a simple value class that contains a pointer to a +character and a length, and is quite related to the ArrayRef class (but specialized for arrays of +characters). Because StringRef carries a length with it, it safely handles +strings with embedded nul characters in it, getting the length does not require +a strlen call, and it even has very convenient APIs for slicing and dicing the +character range that it represents. +
+ ++StringRef is ideal for passing simple strings around that are known to be live, +either because they are C string literals, std::string, a C array, or a +SmallVector. Each of these cases has an efficient implicit conversion to +StringRef, which doesn't result in a dynamic strlen being executed. +
+ +StringRef has a few major limitations which make more powerful string +containers useful:
+ +Because of its strengths and limitations, it is very common for a function to +take a StringRef and for a method on an object to return a StringRef that +points into some string that it owns.
+ ++ The Twine class is used as an intermediary datatype for APIs that want to take + a string that can be constructed inline with a series of concatenations. + Twine works by forming recursive instances of the Twine datatype (a simple + value object) on the stack as temporary objects, linking them together into a + tree which is then linearized when the Twine is consumed. Twine is only safe + to use as the argument to a function, and should always be a const reference, + e.g.: +
+ ++ void foo(const Twine &T); + ... + StringRef X = ... + unsigned i = ... + foo(X + "." + Twine(i)); ++ +
This example forms a string like "blarg.42" by concatenating the values + together, and does not form intermediate strings containing "blarg" or + "blarg.". +
+ +Because Twine is constructed with temporary objects on the stack, and + because these instances are destroyed at the end of the current statement, + it is an inherently dangerous API. For example, this simple variant contains + undefined behavior and will probably crash:
+ ++ void foo(const Twine &T); + ... + StringRef X = ... + unsigned i = ... + const Twine &Tmp = X + "." + Twine(i); + foo(Tmp); ++ +
... because the temporaries are destroyed before the call. That said, + Twine's are much more efficient than intermediate std::string temporaries, and + they work really well with StringRef. Just be aware of their limitations.
+ +SmallString is a subclass of SmallVector that +adds some convenience APIs like += that takes StringRef's. SmallString avoids +allocating memory in the case when the preallocated space is enough to hold its +data, and it calls back to general heap allocation when required. Since it owns +its data, it is very safe to use and supports full mutation of the string.
+ +Like SmallVector's, the big downside to SmallString is their sizeof. While +they are optimized for small strings, they themselves are not particularly +small. This means that they work great for temporary scratch buffers on the +stack, but should not generally be put into the heap: it is very rare to +see a SmallString as the member of a frequently-allocated heap data structure +or returned by-value. +
+ +The standard C++ std::string class is a very general class that (like + SmallString) owns its underlying data. sizeof(std::string) is very reasonable + so it can be embedded into heap data structures and returned by-value. + On the other hand, std::string is highly inefficient for inline editing (e.g. + concatenating a bunch of stuff together) and because it is provided by the + standard library, its performance characteristics depend a lot of the host + standard library (e.g. libc++ and MSVC provide a highly optimized string + class, GCC contains a really slow implementation). +
+ +The major disadvantage of std::string is that almost every operation that + makes them larger can allocate memory, which is slow. As such, it is better + to use SmallVector or Twine as a scratch buffer, but then use std::string to + persist the result.
+ + +Set-like containers are useful when you need to canonicalize multiple values into a single representation. There are several different choices for how to do this, providing various trade-offs.
-If you intend to insert a lot of elements, then do a lot of queries, a great approach is to use a vector (or other sequential container) with @@ -1180,11 +1428,11 @@ efficiently queried with a standard binary or radix search.
If you have a set-like data structure that is usually small and whose elements are reasonably small, a SmallSet<Type, N> is a good choice. This set @@ -1203,11 +1451,11 @@ and erasing, but does not support iteration.
SmallPtrSet has all the advantages of SmallSet (and a SmallSet of pointers is transparently implemented with a SmallPtrSet), but also supports iterators. If @@ -1223,11 +1471,11 @@ visited in sorted order.
DenseSet is a simple quadratically probed hash table. It excels at supporting @@ -1242,11 +1490,29 @@ href="#dss_densemap">DenseMap has.
SparseSet holds a small number of objects identified by unsigned keys of +moderate size. It uses a lot of memory, but provides operations that are +almost as fast as a vector. Typical keys are physical registers, virtual +registers, or numbered basic blocks.
+ +SparseSet is useful for algorithms that need very fast clear/find/insert/erase +and fast iteration over small sets. It is not intended for building composite +data structures.
+FoldingSet is an aggregate class that is really good at uniquing @@ -1279,11 +1545,11 @@ elements.
std::set is a reasonable all-around set class, which is decent at many things but great at nothing. std::set allocates memory for each element @@ -1304,11 +1570,11 @@ std::set is almost never a good choice.
LLVM's SetVector<Type> is an adapter class that combines your choice of a set-like container along with a Sequential Container. The important property @@ -1334,21 +1600,22 @@ elements out of (linear time), unless you use it's "pop_back" method, which is faster.
-SetVector is an adapter class that defaults to using std::vector and std::set -for the underlying containers, so it is quite expensive. However, -"llvm/ADT/SetVector.h" also provides a SmallSetVector class, which -defaults to using a SmallVector and SmallSet of a specified size. If you use -this, and if your sets are dynamically smaller than N, you will save a lot of -heap traffic.
+SetVector is an adapter class that defaults to + using std::vector and a size 16 SmallSet for the underlying + containers, so it is quite expensive. However, + "llvm/ADT/SetVector.h" also provides a SmallSetVector + class, which defaults to using a SmallVector and SmallSet + of a specified size. If you use this, and if your sets are dynamically + smaller than N, you will save a lot of heap traffic.
UniqueVector is similar to SetVector, but it @@ -1362,13 +1629,36 @@ factors, and produces a lot of malloc traffic. It should be avoided.
+ImmutableSet is an immutable (functional) set implementation based on an AVL +tree. +Adding or removing elements is done through a Factory object and results in the +creation of a new ImmutableSet object. +If an ImmutableSet already exists with the given contents, then the existing one +is returned; equality is compared with a FoldingSetNodeID. +The time and space complexity of add or remove operations is logarithmic in the +size of the original set. + +
+There is no method for returning an element of the set, you can only check for +membership. + +
The STL provides several other options, such as std::multiset and the various @@ -1384,22 +1674,23 @@ better.
If your usage pattern follows a strict insert-then-query approach, you can @@ -1412,11 +1703,11 @@ vectors for sets.
Strings are commonly used as keys in maps, and they are difficult to support @@ -1443,14 +1734,17 @@ already in the table, and each pair in the map is store in a single allocation
StringMap also provides query methods that take byte ranges, so it only ever copies a string if a value is inserted into the table.
+ +StringMap iteratation order, however, is not guaranteed to be deterministic, +so any uses which require that should instead use a std::map.
IndexedMap is a specialized container for mapping small dense integers (or values that can be mapped to small dense integers) to some other type. It is @@ -1466,11 +1760,11 @@ virtual register ID).
DenseMap is a simple quadratically probed hash table. It excels at supporting @@ -1481,7 +1775,7 @@ pointers, or map other small types to each other.
There are several aspects of DenseMap that you should be aware of, however. The -iterators in a densemap are invalidated whenever an insertion occurs, unlike +iterators in a DenseMap are invalidated whenever an insertion occurs, unlike map. Also, because DenseMap allocates space for a large number of key/value pairs (it starts with 64 by default), it will waste a lot of space if your keys or values are large. Finally, you must implement a partial specialization of @@ -1489,14 +1783,22 @@ DenseMapInfo for the key that you want, if it isn't already supported. This is required to tell DenseMap about two special marker values (which can never be inserted into the map) that it needs internally.
++DenseMap's find_as() method supports lookup operations using an alternate key +type. This is useful in cases where the normal key type is expensive to +construct, but cheap to compare against. The DenseMapInfo is responsible for +defining the appropriate comparison and hashing methods for each alternate +key type used. +
+
ValueMap is a wrapper around a DenseMap mapping
@@ -1509,11 +1811,11 @@ a Config parameter to the ValueMap template.
IntervalMap is a compact map for small keys and values. It maps key intervals instead of single keys, and it will automatically coalesce adjacent @@ -1526,11 +1828,11 @@ as STL iterators. The heavyweight iterators allow a smaller data structure.
std::map has similar characteristics to std::set: it uses @@ -1546,11 +1848,50 @@ another element takes place).
IntEqClasses provides a compact representation of equivalence classes of +small integers. Initially, each integer in the range 0..n-1 has its own +equivalence class. Classes can be joined by passing two class representatives to +the join(a, b) method. Two integers are in the same class when findLeader() +returns the same representative.
+ +Once all equivalence classes are formed, the map can be compressed so each +integer 0..n-1 maps to an equivalence class number in the range 0..m-1, where m +is the total number of equivalence classes. The map must be uncompressed before +it can be edited again.
+ ++ImmutableMap is an immutable (functional) map implementation based on an AVL +tree. +Adding or removing elements is done through a Factory object and results in the +creation of a new ImmutableMap object. +If an ImmutableMap already exists with the given key set, then the existing one +is returned; equality is compared with a FoldingSetNodeID. +The time and space complexity of add or remove operations is logarithmic in the +size of the original map. +
The STL provides several other options, such as std::multimap and the various @@ -1564,26 +1905,14 @@ always better.
-TODO: const char* vs stringref vs smallstring vs std::string. Describe twine, -xref to #string_apis. -
-Unlike the other containers, there are only two bit storage containers, and choosing when to use each is relatively straightforward.
@@ -1593,14 +1922,13 @@ implementation in many common compilers (e.g. commonly available versions of GCC) is extremely inefficient and 2) the C++ standards committee is likely to deprecate this container and/or change it significantly somehow. In any case, please don't use it. -The BitVector container provides a dynamic size set of bits for manipulation. It supports individual bit setting/testing, as well as set operations. The set operations take time O(size of bitvector), but operations are performed one word @@ -1611,11 +1939,11 @@ the number of set bits to be high (IE a dense set).
The SmallBitVector container provides the same interface as BitVector, but it is optimized for the case where only a small number of bits, less than 25 or so, are needed. It also transparently supports larger bit counts, but @@ -1630,11 +1958,11 @@ and its operator[] does not provide an assignable lvalue.
The SparseBitVector container is much like BitVector, with one major difference: Only the bits that are set, are stored. This makes the SparseBitVector much more space efficient than BitVector when the set is sparse, @@ -1644,13 +1972,17 @@ universe). The downside to the SparseBitVector is that setting and testing of r
This section describes how to perform some very simple transformations of LLVM code. This is meant to give examples of common idioms used, showing the @@ -1659,15 +1991,13 @@ you should also read about the main classes that you will be working with. The Core LLVM Class Hierarchy Reference contains details and descriptions of the main classes that you should know about.
-The LLVM compiler infrastructure have many different data structures that may be traversed. Following the example of the C++ standard template library, the @@ -1684,16 +2014,14 @@ on them, and it is easier to remember how to iterate. First we show a few common examples of the data structures that need to be traversed. Other data structures are traversed in very similar ways.
-It's quite common to have a Function instance that you'd like to transform in some way; in particular, you'd like to manipulate its @@ -1722,13 +2050,13 @@ exactly equivalent to (*i).size() just like you'd expect.
Just like when dealing with BasicBlocks in Functions, it's easy to iterate over the individual instructions that make up @@ -1753,13 +2081,13 @@ basic block itself: errs() << *blk << "\n";.
If you're finding that you commonly iterate over a Function's BasicBlocks and then that BasicBlock's Instructions, @@ -1799,12 +2127,12 @@ for (inst_iterator I = inst_begin(F), E = inst_end(F); I != E; ++I)
Sometimes, it'll be useful to grab a reference (or pointer) to a class instance when all you've got at hand is an iterator. Well, extracting @@ -1876,12 +2204,12 @@ and operator* changed to return a pointer instead of a reference.
Say that you're writing a FunctionPass and would like to count all the locations in the entire module (that is, across every Function) where a @@ -1938,11 +2266,11 @@ class OurFunctionPass : public FunctionPass {
You may have noticed that the previous example was a bit oversimplified in that it did not deal with call sites generated by 'invoke' instructions. In @@ -1965,11 +2293,11 @@ If you look at its definition, it has only a single pointer member.
Frequently, we might have an instance of the Value Class and we want to @@ -2026,12 +2354,12 @@ calling use/op_begin() on const Value*s or
Iterating over the predecessors and successors of a block is quite easy with the routines defined in "llvm/Support/CFG.h". Just use code like @@ -2054,13 +2382,14 @@ succ_iterator/succ_begin/succ_end.
There are some primitive transformation operations present in the LLVM infrastructure that are worth knowing about. When performing @@ -2068,15 +2397,13 @@ transformations, it's fairly common to manipulate the contents of basic blocks. This section describes some of the common methods for doing so and gives example code.
-Instantiating Instructions
@@ -2212,18 +2539,15 @@ Instruction* newInst = new Instruction(..., pi);Deleting an instruction from an existing sequence of instructions that form a -BasicBlock is very straight-forward. First, -you must have a pointer to the instruction that you wish to delete. Second, you -need to obtain the pointer to that instruction's basic block. You use the -pointer to the basic block to get its list of instructions and then use the -erase function to remove your instruction. For example:
+BasicBlock is very straight-forward: just +call the instruction's eraseFromParent() method. For example:@@ -2232,24 +2556,29 @@ I->eraseFromParent();
This unlinks the instruction from its containing basic block and deletes +it. If you'd just like to unlink the instruction from its containing basic +block but not delete it, you can use the removeFromParent() method.
+Replacing individual instructions
+Including "llvm/Transforms/Utils/BasicBlockUtils.h" permits use of two very useful replace functions: ReplaceInstWithValue and ReplaceInstWithInst.
-Replacing multiple uses of Users and Values
+You can use Value::replaceAllUsesWith and User::replaceUsesOfWith to change more than one use at a time. See the @@ -2301,11 +2632,11 @@ ReplaceInstWithValue, ReplaceInstWithInst -->
Deleting a global variable from a module is just as easy as deleting an Instruction. First, you must have a pointer to the global variable that you wish @@ -2322,12 +2653,14 @@ GV->eraseFromParent();
In generating IR, you may need some complex types. If you know these types statically, you can use TypeBuilder<...>::get(), defined @@ -2362,13 +2695,15 @@ comment for more details.
This section describes the interaction of the LLVM APIs with multithreading, both on the part of client applications, and in the JIT, in the hosted @@ -2391,14 +2726,13 @@ compiler, consider compiling LLVM and LLVM-GCC in single-threaded mode, and using the resultant compiler to build a copy of LLVM with multithreading support.
-In order to properly protect its internal data structures while avoiding @@ -2431,11 +2765,11 @@ result in concurrent LLVM API calls.
When you are done using the LLVM APIs, you should call llvm_shutdown() to deallocate memory used for internal structures. This will also invoke @@ -2451,11 +2785,11 @@ destructor.
ManagedStatic is a utility class in LLVM used to implement static initialization of static resources, such as the global type tables. Before the @@ -2480,11 +2814,11 @@ and only if you know what you're doing!
LLVMContext is an opaque class in the LLVM API which clients can use to operate multiple, isolated instances of LLVM concurrently within the same @@ -2524,11 +2858,11 @@ isolation is not a concern.
LLVM's "eager" JIT compiler is safe to use in threaded programs. Multiple threads can call ExecutionEngine::getPointerToFunction() or @@ -2551,199 +2885,34 @@ access, but we suggest using only the eager JIT in threaded programs.
This section describes some of the advanced or obscure API's that most clients do not need to be aware of. These API's tend manage the inner workings of the LLVM system, and only need to be accessed in unusual circumstances.
--The LLVM type system has a very simple goal: allow clients to compare types for -structural equality with a simple pointer comparison (aka a shallow compare). -This goal makes clients much simpler and faster, and is used throughout the LLVM -system. -
- --Unfortunately achieving this goal is not a simple matter. In particular, -recursive types and late resolution of opaque types makes the situation very -difficult to handle. Fortunately, for the most part, our implementation makes -most clients able to be completely unaware of the nasty internal details. The -primary case where clients are exposed to the inner workings of it are when -building a recursive type. In addition to this case, the LLVM bitcode reader, -assembly parser, and linker also have to be aware of the inner workings of this -system. -
- --For our purposes below, we need three concepts. First, an "Opaque Type" is -exactly as defined in the language -reference. Second an "Abstract Type" is any type which includes an -opaque type as part of its type graph (for example "{ opaque, i32 }"). -Third, a concrete type is a type that is not an abstract type (e.g. "{ i32, -float }"). -
- --Because the most common question is "how do I build a recursive type with LLVM", -we answer it now and explain it as we go. Here we include enough to cause this -to be emitted to an output .ll file: -
- -
-%mylist = type { %mylist*, i32 }
-
--To build this, use the following LLVM APIs: -
- --// Create the initial outer struct -PATypeHolder StructTy = OpaqueType::get(); -std::vector<const Type*> Elts; -Elts.push_back(PointerType::getUnqual(StructTy)); -Elts.push_back(Type::Int32Ty); -StructType *NewSTy = StructType::get(Elts); - -// At this point, NewSTy = "{ opaque*, i32 }". Tell VMCore that -// the struct and the opaque type are actually the same. -cast<OpaqueType>(StructTy.get())->refineAbstractTypeTo(NewSTy); - -// NewSTy is potentially invalidated, but StructTy (a PATypeHolder) is -// kept up-to-date -NewSTy = cast<StructType>(StructTy.get()); - -// Add a name for the type to the module symbol table (optional) -MyModule->addTypeName("mylist", NewSTy); --
-This code shows the basic approach used to build recursive types: build a -non-recursive type using 'opaque', then use type unification to close the cycle. -The type unification step is performed by the refineAbstractTypeTo method, which is -described next. After that, we describe the PATypeHolder class. -
- --The refineAbstractTypeTo method starts the type unification process. -While this method is actually a member of the DerivedType class, it is most -often used on OpaqueType instances. Type unification is actually a recursive -process. After unification, types can become structurally isomorphic to -existing types, and all duplicates are deleted (to preserve pointer equality). -
- --In the example above, the OpaqueType object is definitely deleted. -Additionally, if there is an "{ \2*, i32}" type already created in the system, -the pointer and struct type created are also deleted. Obviously whenever -a type is deleted, any "Type*" pointers in the program are invalidated. As -such, it is safest to avoid having any "Type*" pointers to abstract types -live across a call to refineAbstractTypeTo (note that non-abstract -types can never move or be deleted). To deal with this, the PATypeHolder class is used to maintain a stable -reference to a possibly refined type, and the AbstractTypeUser class is used to update more -complex datastructures. -
- --PATypeHolder is a form of a "smart pointer" for Type objects. When VMCore -happily goes about nuking types that become isomorphic to existing types, it -automatically updates all PATypeHolder objects to point to the new type. In the -example above, this allows the code to maintain a pointer to the resultant -resolved recursive type, even though the Type*'s are potentially invalidated. -
- --PATypeHolder is an extremely light-weight object that uses a lazy union-find -implementation to update pointers. For example the pointer from a Value to its -Type is maintained by PATypeHolder objects. -
- --Some data structures need more to perform more complex updates when types get -resolved. To support this, a class can derive from the AbstractTypeUser class. -This class -allows it to get callbacks when certain types are resolved. To register to get -callbacks for a particular type, the DerivedType::{add/remove}AbstractTypeUser -methods can be called on a type. Note that these methods only work for - abstract types. Concrete types (those that do not include any opaque -objects) can never be refined. -
-The ValueSymbolTable class provides a symbol table that the Function and Module classes use for naming value definitions. The symbol table can provide a name for any Value. -The -TypeSymbolTable class is used by the Module class to store -names for types.
+Note that the SymbolTable class should not be directly accessed by most clients. It should only be used when iteration over the symbol table @@ -2753,24 +2922,23 @@ all LLVM an empty name) do not exist in the symbol table.
-These symbol tables support iteration over the values/types in the symbol +
Symbol tables support iteration over the values in the symbol table with begin/end/iterator and supports querying to see if a specific name is in the symbol table (with lookup). The ValueSymbolTable class exposes no public mutator methods, instead, simply call setName on a value, which will autoinsert it into the -appropriate symbol table. For types, use the Module::addTypeName method to -insert entries into the symbol table.
+appropriate symbol table.The
User class provides a basis for expressing the ownership of User
towards other
@@ -2779,18 +2947,19 @@ Use helper class is employed to do the bookkeeping and to facilitate
-
+
A subclass of User can choose between incorporating its Use objects
or refer to them out-of-line by means of a pointer. A mixed variant
(some Uses inline others hung off) is impractical and breaks the invariant
that the Use objects belonging to the same User form a contiguous array.
We have 2 different layouts in the User (sub)classes:
@@ -2839,17 +3008,18 @@ enforce the following memory layouts:
Since the Use objects are deprived of the direct (back)pointer to
their User objects, there must be a fast and exact method to
recover it. This is accomplished by the following scheme:
The following literate Haskell fragment demonstrates the concept:
To maintain the invariant that the 2 LSBits of each Use** in Use
@@ -2989,13 +3164,17 @@ the LSBit set. (Portability is relying on the fact that all known compilers plac
#include "llvm/Type.h"
Type is a superclass of all type classes. Every Value has
a Type. Type cannot be instantiated directly but only
@@ -3026,14 +3203,13 @@ the lib/VMCore directory. #include "llvm/Module.h" Constructing a Module is easy. You can optionally
+ Constructing a Module is easy. You can optionally
provide a name for it (probably based on the name of the translation unit). Look up the specified function in the Module SymbolTable. If it does not exist, return
@@ -3244,13 +3407,14 @@ provide a name for it (probably based on the name of the translation unit). #include "llvm/Value.h"
#include "llvm/User.h" The User class exposes the operand list in two ways: through
an index access interface and through an iterator based interface. #include "llvm/Instruction.h" This subclasses represents all two operand instructions whose operands
@@ -3471,12 +3634,13 @@ this file confuses doxygen, so these enum values don't show up correctly in the
Constant represents a base class for different types of constants. It
is subclassed by ConstantInt, ConstantArray, etc. for representing
@@ -3509,11 +3675,9 @@ the various types of Constants. GlobalValue is also
a subclass, which represents the address of a global variable or function.
#include "llvm/GlobalValue.h" #include "llvm/Function.h" Note that Function is a GlobalValue
and therefore also a Constant. The value of the function
is its address (after linking) which is guaranteed to be constant. Constructor used when you need to create new Functions to add
- the the program. The constructor must specify the type of the function to
+ the program. The constructor must specify the type of the function to
create and what type of linkage the function should have. The FunctionType argument
specifies the formal arguments and return value for the function. The same
@@ -3769,12 +3935,14 @@ iterator #include "llvm/GlobalVariable.h"
@@ -3796,15 +3964,15 @@ variables may have an initial value (which must be a
Constant), and if they have an initializer,
they may be marked as "constant" themselves (indicating that their contents
never change at runtime). #include "llvm/BasicBlock.h" This subclass of Value defines the interface for incoming formal
arguments to a function. A Function maintains a list of its formal
@@ -3947,6 +4116,8 @@ arguments. An argument has a pointer to the parent Function.
+
+ Interaction and relationship between User and Use objects
+
+
-
@@ -2970,10 +3141,14 @@ And here is the result of <deepCheck identityProp>:
OK, passed 500 tests.
+
+ The Core LLVM Class Hierarchy Reference
+
-
doxygen info: Type Class
The Module class
-
doxygen info:
@@ -3138,23 +3303,20 @@ href="#GlobalVariable">GlobalVariables, and a SymbolTable. Additionally, it contains a few
helpful member functions that try to make common operations easy.
-
+
Module::const_iterator - Typedef for const_iterator.
@@ -3212,8 +3374,9 @@ provide a name for it (probably based on the name of the translation unit).
-
The Value class
-
@@ -3301,14 +3465,12 @@ the class that
represents this value. Although this may take some getting used to, it
simplifies the representation and makes it easier to manipulate.
The User class
-
@@ -3379,14 +3543,12 @@ Single Assignment (SSA) form, there can only be one definition referred to,
allowing this direct connection. This connection provides the use-def
information in LLVM.
@@ -3445,14 +3609,13 @@ href="#CmpInst">CmpInst). Unfortunately, the use of macros in
this file confuses doxygen, so these enum values don't show up correctly in the
doxygen output.
+
+ Important Subclasses of the Instruction class
+
+
+
+
+ Important Public Members of the Instruction class
+
+
-
Important Subclasses of Constant
+
@@ -3607,15 +3772,14 @@ dereference the pointer with GetElementPtrInst first, then its elements
can be accessed. This is explained in the LLVM
Language Reference Manual.
+
+ Important Public Members of the GlobalValue class
+
+
-
@@ -3631,12 +3795,14 @@ GlobalValue is currently embedded into.
doxygen
@@ -3683,22 +3849,22 @@ href="#Argument">Arguments in the function body.
+
+ Important Public Members of the Function class
+
+
-
+
+ Important Public Members of the GlobalVariable class
+
+
-
@@ -3873,15 +4042,14 @@ href="#Value">Values, because they are referenced by instructions
like branches and can go in the switch tables. BasicBlocks have type
label.
+
+ Important Public Members of the BasicBlock class
+
+
-
-
+
-
@@ -3957,7 +4128,7 @@ arguments. An argument has a pointer to the parent Function.
Dinakar Dhurjati and
Chris Lattner
- The LLVM Compiler Infrastructure
+ The LLVM Compiler Infrastructure
Last modified: $Date$