Searched refs:passes (Results 1 - 25 of 40) sorted by relevance

12

/haiku-buildtools/legacy/binutils/ld/testsuite/ld-scripts/
H A Dscript.exp47 set passes 1
64 set passes 0
71 set passes 0
77 set passes 0
84 set passes 0
87 if { $passes } {
/haiku-buildtools/binutils/ld/testsuite/ld-scripts/
H A Dscript.exp49 set passes 1
66 set passes 0
73 set passes 0
80 set passes 0
86 set passes 0
93 set passes 0
100 set passes 0
103 if { $passes } {
/haiku-buildtools/gcc/gcc/testsuite/gcc.test-framework/
H A Dtest-framework.awk23 passes++;
34 BEGIN { skip = 1; passes = 0; fails = 0; }
72 printf("# of expected passes\t\t%d\n", passes);
/haiku-buildtools/legacy/gcc/gcc/
H A Dlcm.c23 passes which can be modeled as lazy code motion problems.
265 int bb, changed, passes; local
275 passes = 0;
314 passes++;
340 int bb, changed, passes; local
353 passes = 0;
391 passes++;
418 int bb, changed, passes; local
433 passes = 0;
453 passes
522 int bb, changed, passes; local
598 int bb, changed, passes; local
636 int bb, changed, passes; local
681 int bb, changed, passes; local
779 int bb, changed, passes; local
[all...]
H A Dgcse.c161 /* Maximum number of passes to perform. */
192 Two passes of copy/constant propagation are done because the first one
212 We used to support multiple passes but there are diminishing returns in
215 Experiments show any further passes don't make enough changes to justify
218 A study of spec92 using an unlimited number of passes:
2639 int bb, changed, passes;
2644 passes = 0;
2656 passes++;
2660 fprintf (gcse_file, "reaching def computation: %d passes\n", passes);
2628 int bb, changed, passes; local
2825 int bb, changed, passes; local
3507 int bb, changed, passes; local
[all...]
H A Dprofile.c460 int num_arcs, changes, passes;
907 /* To reduce the instrumentation cost, make two passes over the tree.
1013 This takes an average of slightly more than 3 passes. */
1016 passes = 0;
1019 passes++;
1102 total_num_passes += passes;
1104 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1516 fprintf (dump_file, "Total number of graph solution passes: %d\n",
1519 fprintf (dump_file, "Average number of graph solution passes
458 int num_arcs, changes, passes; local
[all...]
H A Dgcov.c589 int passes, changes, total;
613 This takes an average of slightly more than 3 passes. */
616 passes = 0;
619 passes++;
587 int passes, changes, total; local
H A Dflow.c251 loop, sched, flow and possibly other passes all need to do basically the
4710 int bb, changed, passes;
4724 passes = 0;
4744 passes++;
5117 convert many optimization passes to preserve CFG consistent.
5147 later passes. */
4693 int bb, changed, passes; local
/haiku-buildtools/gcc/contrib/regression/
H A Dobjs-gcc.sh58 PASSES=$STATE/passes
70 # everything always passes, without running any tests.
H A Dbtest-gcc.sh28 # --add-passes-despite-regression:
34 --add-passes-despite-regression)
84 PASSES=$STATE/passes
96 # everything always passes, without running any tests.
217 # --add-passes-despite-regression, is to *add* them to previous
/haiku-buildtools/gcc/gcc/
H A Dstatistics.c247 gcc::pass_manager *passes = g->get_passes (); local
256 && passes->get_pass_for_id (i) != NULL)
259 (passes->get_pass_for_id (i));
H A Dpasses.c21 It parses command args, opens files, invokes the various passes
120 /* Most passes are single-instance (within their context) and thus don't
121 need to implement cloning, but passes that support multiple instances
194 /* Global variables used to communicate with passes. */
356 /* Once this pass (and its sub-passes) are complete, all functions
358 a tad early, since the sub-passes have not yet run, but since
359 none of the sub-passes are IPA passes and do not create new
361 of IPA passes that follow. */
791 /* For any passes tha
1782 pass_manager *passes = g->get_passes (); local
2462 pass_manager *passes = g->get_passes (); local
2609 pass_manager *passes = g->get_passes (); local
2666 pass_manager *passes = g->get_passes (); local
2716 pass_manager *passes = g->get_passes (); local
2794 pass_manager *passes = g->get_passes (); local
[all...]
H A Dprofile.c568 int passes;
623 This takes an average of slightly more than 3 passes. */
626 passes = 0;
629 passes++;
729 total_num_passes += passes;
731 fprintf (dump_file, "Graph solving took %d passes.\n\n", passes);
1520 fprintf (dump_file, "Total number of graph solution passes: %d\n",
1523 fprintf (dump_file, "Average number of graph solution passes: %d\n",
567 int passes; local
H A Dcgraphunit.c62 This passes control to the back-end. Optimizations are performed and
75 a) early optimizations. These are local passes executed in
83 b) early small interprocedural passes.
85 Those are interprocedural passes executed only at compilation
89 c) IP analysis stage. All interprocedural passes do their
92 Interprocedural passes differ from small interprocedural
93 passes by their ability to operate across whole program
106 e) IP propagation stage. All IP passes execute their
121 IP passes can produce copies of existing functoins (such
128 All IP passes transfor
504 gcc::pass_manager *passes = g->get_passes (); local
2161 gcc::pass_manager *passes = g->get_passes (); local
[all...]
H A Dgcse.c197 Two passes of copy/constant propagation are done around PRE or hoisting
218 We used to support multiple passes but there are diminishing returns in
221 Experiments show any further passes don't make enough changes to justify
224 A study of spec92 using an unlimited number of passes:
234 were added. Probably, multiple passes is even less efficient now than
873 This function is typically used by code motion passes, to verify
2485 the expression into the result of the SET. It is left to later passes
2765 int changed, passes;
2771 passes = 0;
2799 passes
2751 int changed, passes; local
[all...]
H A Dlto-cgraph.c1254 gcc::pass_manager *passes = g->get_passes (); local
1281 of ipa passes is done. Alays forcingly create a fresh node. */
1301 gcc_assert (pid < passes->passes_by_id_size);
1302 pass = passes->passes_by_id[pid];
1394 of ipa passes is done. Alays forcingly create a fresh node. */
H A DMakefile.in1350 passes.o \
2063 pass-instances.def: $(srcdir)/passes.def $(srcdir)/gen-pass-instances.awk
2065 $(srcdir)/passes.def > pass-instances.def
2348 $(srcdir)/targhooks.c $(out_file) $(srcdir)/passes.c $(srcdir)/cgraphunit.c \
2930 portability.texi interface.texi passes.texi rtl.texi md.texi \
/haiku-buildtools/gcc/gcc/testsuite/go.test/test/
H A Dddd1.go42 _ = funny([]T{}) // ok because []T{} is a T; passes []T{[]T{}}
/haiku-buildtools/gcc/contrib/
H A DcompareSumTests3107 are displayed. For instance, if C<-i 1:2> is given and test A passes in
114 test A passes in run 1 and fails in runs 2 and 3, that result will not be
/haiku-buildtools/gcc/libbacktrace/
H A DMakefile.in564 if test "$$xpass" -eq 1; then passes=pass; else passes=passes; fi; \
565 banner="$$failed of $$all $$tests did not behave as expected ($$xpass unexpected $$passes)"; \
/haiku-buildtools/binutils/
H A Dltmain.sh1661 -no-suppress do not suppress compiler output for multiple passes
5207 passes="conv dlpreopen link"
5223 passes="conv scan dlopen dlpreopen link"
5225 *) passes="conv"
5229 for pass in $passes; do
/haiku-buildtools/gcc/
H A Dltmain.sh1661 -no-suppress do not suppress compiler output for multiple passes
5207 passes="conv dlpreopen link"
5223 passes="conv scan dlopen dlpreopen link"
5225 *) passes="conv"
5229 for pass in $passes; do
/haiku-buildtools/binutils/gold/
H A DMakefile.in277 # containing $f, in $tst the test, in $log the log, and passes
1102 else xpasses=passes; fi; \
/haiku-buildtools/gcc/gcc/config/rs6000/
H A Drs6000.c4337 /* Register machine-specific passes. This needs to be done at start-up.
10981 list, or passes any parameter in memory. */
11050 has a prototype is scope, has no variable argument list, and passes
26064 There's not really enough bulk here to make other passes such as
31107 int passes = (TARGET_RECIP_PRECISION) ? 1 : 3;
31109 passes++;
31125 if (passes > 1) {
31135 for (i = 0, xprev = x1, eprev = e0; i < passes - 2;
31182 int passes = (TARGET_RECIP_PRECISION) ? 1 : 3;
31184 passes
31054 int passes = (TARGET_RECIP_PRECISION) ? 1 : 3; local
31129 int passes = (TARGET_RECIP_PRECISION) ? 1 : 3; local
[all...]
/haiku-buildtools/isl/
H A Dltmain.sh3535 -no-suppress do not suppress compiler output for multiple passes
7351 passes="conv dlpreopen link"
7367 passes="conv scan dlopen dlpreopen link"
7369 *) passes="conv"
7373 for pass in $passes; do

Completed in 330 milliseconds

12