Home
last modified time | relevance | path

Searched refs:optimization (Results 1 – 25 of 912) sorted by relevance

12345678910>>...37

/netbsd-src/external/gpl3/gcc.old/dist/gcc/doc/
H A Doptinfo.texi5 @cindex optimization dumps
8 pass dumps as well as optimization dumps. The goal for this
13 * Dump setup:: Setup of optimization dumps.
14 * Optimization groups:: Groups made up of optimization passes.
27 @file{passes.c}. During the registration, an optimization pass can
28 select its optimization group (@pxref{Optimization groups}). After
29 that optimization information corresponding to the entire group
37 case the particular pass has optimization dumps enabled. A pass could
47 @cindex optimization groups
48 The optimization passes are grouped into several categories. Currently
[all …]
H A Dlto.texi34 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
[all …]
H A Dpasses.texi14 This chapter is dedicated to giving an overview of the optimization and
22 * Pass manager:: Sequencing the optimization passes.
26 * Optimization info:: Dumping optimization information from passes.
183 @section Inter-procedural optimization passes
185 @cindex inter-procedural optimization passes
187 The inter-procedural optimization (IPA) passes use call graph
189 IPA is a critical part of link-time optimization (LTO) and
190 whole-program (WHOPR) optimization, and these passes are structured
195 The following briefly describes the inter-procedural optimization (IPA)
456 The following briefly describes the Tree optimization passes that are
[all …]
/netbsd-src/external/gpl3/gcc/dist/gcc/doc/
H A Doptinfo.texi5 @cindex optimization dumps
8 pass dumps as well as optimization dumps. The goal for this
13 * Dump setup:: Setup of optimization dumps.
14 * Optimization groups:: Groups made up of optimization passes.
27 @file{passes.cc}. During the registration, an optimization pass can
28 select its optimization group (@pxref{Optimization groups}). After
29 that optimization information corresponding to the entire group
37 case the particular pass has optimization dumps enabled. A pass could
47 @cindex optimization groups
48 The optimization passes are grouped into several categories. Currently
[all …]
H A Dlto.texi34 Link time optimization is implemented as a GCC front end for a
56 disadvantage, as the user is not informed that the optimization has
87 single translation unit for optimization. The main entry point for
125 call-graph is partitioned to facilitate parallel optimization during
128 language and the optimization decisions.
169 object files. This is used at link time to determine the optimization
194 cases, the same optimization may not happen during link-time
195 optimization. This would lead to an undefined symbol if only one
218 inter-procedural optimization infrastructure. This section stores an
252 @item Summaries and optimization summaries used by IPA passes
[all …]
H A Dpasses.texi14 This chapter is dedicated to giving an overview of the optimization and
22 * Pass manager:: Sequencing the optimization passes.
26 * Optimization info:: Dumping optimization information from passes.
183 @section Inter-procedural optimization passes
185 @cindex inter-procedural optimization passes
187 The inter-procedural optimization (IPA) passes use call graph
189 IPA is a critical part of link-time optimization (LTO) and
190 whole-program (WHOPR) optimization, and these passes are structured
195 The following briefly describes the inter-procedural optimization (IPA)
449 The following briefly describes the Tree optimization passes that are
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/docs/HistoricalNotes/
H A D2001-06-20-.NET-Differences.txt10 little lowering or optimization). Also, the templates implementation in CLR
15 analysis and optimization.
22 that this limited the link-time interprocedural optimization to modules
25 don't do anything for runtime optimization).
H A D2001-06-01-GCCOptimizations2.txt8 > optimization is severely time-constrained.
42 > optimization (step 16 in your list). Do you have a breakdown of that?
46 optimization" happens right along with other data optimizations (ie, CSE
61 9. Jump optimization
64 12. Instruction selection & peephole optimization
H A D2001-09-18-OptimizeExceptions.txt4 Subject: Idea for a simple, useful link time optimization
34 Additionally, this optimization can be implemented in a straight forward
39 I think it's a reasonable optimization that hasn't really been addressed
41 payoffs... without being a overly complex optimization.
H A D2000-12-06-MeetingSummary.txt28 information for one optimization. Alias analysis itself is typically
30 would not affect the runtime of the optimization in a significant
31 way. Additionally, this would be an unlikely optimization to do at
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A DChangeLog10 PR rtl-optimization/114924
40 PR rtl-optimization/54052
68 PR tree-optimization/115143
77 PR tree-optimization/115337
118 PR rtl-optimization/114902
119 PR rtl-optimization/115092
139 PR tree-optimization/114876
159 PR rtl-optimization/114768
204 PR tree-optimization/114566
241 PR rtl-optimization/110079
[all …]
H A DChangeLog-2016226 PR tree-optimization/78886
238 PR rtl-optimization/78580
264 PR rtl-optimization/11488
486 PR tree-optimization/78819
1443 PR tree-optimization/78788
1481 PR tree-optimization/78428
1497 PR tree-optimization/78725
1519 PR tree-optimization/78699
1552 PR tree-optimization/78777
1599 PR rtl-optimization/78669
[all …]
H A DChangeLog-20213 PR rtl-optimization/103756
29 PR rtl-optimization/103860
93 PR tree-optimization/103793
111 PR rtl-optimization/103837
219 (*movdi_internal): Remove -Oz push/pop optimization from here.
221 (peephole2): Perform -Oz push/pop optimization here, only for
436 PR tree-optimization/103759
482 PR tree-optimization/103744
496 PR tree-optimization/103741
677 PR rtl-optimization/103350
[all …]
H A DChangeLog-2018266 PR rtl-optimization/87727
286 PR rtl-optimization/88563
369 PR tree-optimization/84362
512 * doc/sourcebuild.texi (Commands for use in dg-final, Scan optimization
523 PR tree-optimization/88533
527 PR tree-optimization/28364
528 PR tree-optimization/85275
640 PR rtl-optimization/87759
834 PR rtl-optimization/88253
905 PR tree-optimization/88464
[all …]
H A DChangeLog-20203 PR tree-optimization/98302
9 PR tree-optimization/94994
14 PR rtl-optimization/98214
23 PR tree-optimization/94802
29 PR tree-optimization/94785
35 PR tree-optimization/98474
50 PR tree-optimization/56719
294 PR tree-optimization/98407
341 PR tree-optimization/98378
396 PR rtl-optimization/98347
[all …]
H A DChangeLog-2017127 PR tree-optimization/83552
138 PR rtl-optimization/83513
394 PR rtl-optimization/80747
395 PR rtl-optimization/83512
403 PR tree-optimization/83523
408 PR tree-optimization/83521
472 PR rtl-optimization/82973
743 indicating whether the optimization was possible and return
1020 PR tree-optimization/83491
2042 PR tree-optimization/83493
[all …]
H A DChangeLog-2019720 PR tree-optimization/92930
784 PR rtl-optimization/92591
798 PR rtl-optimization/90001
1018 PR tree-optimization/92891
1024 PR rtl-optimization/92796
1039 PR rtl-optimization/92882
1145 PR tree-optimization/92862
1414 PR tree-optimization/92834
1420 PR tree-optimization/89007
1495 PR tree-optimization/92860
[all …]
H A Dcif-code.def96 N_("mismatched declarations during linktime optimization"))
123 /* We can't inline because of mismatched optimization levels. */
125 N_("optimization level attribute mismatch"))
/netbsd-src/external/apache2/llvm/dist/llvm/docs/
H A DOptBisect.rst2 Using -opt-bisect-limit to debug optimization errors
11 The -opt-bisect-limit option provides a way to disable all optimization passes
14 problems where incorrect transformations during optimization result in incorrect
26 such as clang, that uses the core LLVM library for optimization and code
47 will be printed to stderr for each optimization that could be skipped
48 indicating the index value that is associated with that optimization. To skip
49 optimizations, pass the value of the last optimization to be performed as the
83 variable. Depending on how the optimization pass has been instrumented the
85 been performed by an optimization pass on an IR unit for which it is invoked
H A DRemarks.rst11 LLVM is able to emit diagnostics from passes describing whether an optimization
19 Remarks that describe a successful optimization performed by the compiler.
29 Remarks that describe an attempt to an optimization by the compiler that
54 Enabling optimization remarks
57 There are two modes that are supported for enabling optimization remarks in
69 Enables optimization remarks from passes whose name match the given (POSIX)
74 Enables missed optimization remarks from passes whose name match the given
79 Enables optimization analysis remarks from passes whose name match the given
86 refer to optimization remarks post-compilation, typically during performance
127 With PGO, include profile count in optimization remarks.
[all …]
/netbsd-src/external/apache2/llvm/dist/llvm/docs/tutorial/
H A DBuildingAJIT2.rst29 IRTransformLayer, to add IR optimization support to KaleidoscopeJIT.
42 added to it. In this Chapter we will make optimization a phase of our JIT
44 layers, but in the long term making optimization part of our JIT will yield an
47 optimization managed by our JIT will allow us to optimize lazily too, rather
48 than having to do all our optimization up-front.
50 To add optimization support to our JIT we will take the KaleidoscopeJIT from
54 layer below (as all layers do) plus an *IR optimization function* that it will
122 At the bottom of our JIT we add a private method to do the actual optimization:
128 For now we will ignore this argument and use a standard optimization
133 that chapter for a more in-depth discussion of these, and of IR optimization in
[all …]
/netbsd-src/external/mit/isl/dist/m4/
H A Dax_cc_maxopt.m411 # Try to turn on "good" C optimization flags for various compilers and
17 # disable any optimization flags that might result in a binary that only
147 # default optimization flags for nvhpc
152 # default optimization flags for gcc on all systems
162 # note that we enable "unsafe" fp optimization with other compilers, too
179 # default optimization flags for MSVC opt builds
/netbsd-src/external/apache2/llvm/dist/clang/lib/CodeGen/
H A DREADME.txt1 IRgen optimization opportunities.
27 In theory, the same optimization could be a win for block local
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtimevar.def70 DEFTIMEVAR (TV_CGRAPHOPT , "callgraph optimization")
167 DEFTIMEVAR (TV_TREE_SSA_DOMINATOR_OPTS , "dominator optimization")
186 DEFTIMEVAR (TV_TREE_LOOP , "tree loop optimization")
207 DEFTIMEVAR (TV_TREE_LOOP_IVOPTS , "tree iv optimization")
211 DEFTIMEVAR (TV_TREE_NRV , "tree NRV optimization")
221 DEFTIMEVAR (TV_TREE_STRLEN , "tree strlen optimization")
H A Dcif-code.def96 N_("mismatched declarations during linktime optimization"))
123 /* We can't inline because of mismatched optimization levels. */
125 N_("optimization level attribute mismatch"))

12345678910>>...37