Lines Matching refs:optimization

34 Link time optimization is implemented as a GCC front end for a
49 disadvantage, as the user is not informed that the optimization has
88 single translation unit for optimization.  The main entry point for
126 call-graph is partitioned to facilitate parallel optimization during
129 language and the optimization decisions.
170 object files.  This is used at link time to determine the optimization
195 cases, the same optimization may not happen during link-time
196 optimization.  This would lead to an undefined symbol if only one
219 inter-procedural optimization infrastructure.  This section stores an
253 @item Summaries and optimization summaries used by IPA passes
275 The inter-procedural optimization is organized as a sequence of
278 inter-procedural optimization pass is split into several stages
313 @item @emph{Write optimization summary}
322 @item @emph{Read optimization summary}
326 optimization decisions in exactly the same format emitted by
360 passes are useful for optimization at LGEN or LTRANS time and are
361 used, for example, to implement early optimization before writing
370 mode was addressing the interactions between optimization passes.
386 Most optimization passes split naturally into analysis,
396 representing the changes performed by the optimization passes in
445 optimization summaries updated for the @emph{Transform} stage.
461 Suppose that an optimization pass sees a function @code{A} and it
474 Link-time optimization gives relatively minor benefits when used
490 optimization.
493 whole program when doing link-time optimization.  Strictly
527 cannot be used directly by the link-time optimization in the