Lines Matching refs:optimizations

27 compiling simple code, we don't get obvious optimizations:
41 parsing the input. As such, this transcription lacks optimizations like
43 above) as well as other more important optimizations. Constant folding,
101 Fortunately, LLVM provides a broad range of optimizations that you can
109 hold to the mistaken notion that one set of optimizations is right for
111 to make complete decisions about what optimizations to use, in which
127 to run a few per-function optimizations as the user types the function
132 In order to get per-function optimizations going, we need to set up a
134 organize the LLVM optimizations that we want to run. Once we have that,
135 we can add a set of optimizations to run. The code looks like this:
147       (* Do simple "peephole" optimizations and bit-twiddling optzn. *)
168 optimizations know how the data structures in the program are laid out.
173 chose here are a pretty standard set of "cleanup" optimizations that are
218 LLVM provides a wide variety of optimizations that can be used in
233 applied to it. For example, you can run optimizations on it (as we did
880           (* Do simple "peephole" optimizations and bit-twiddling optzn. *)