| /dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
| H A D | tree-ssa-coalesce.c | 214 pop_best_coalesce (coalesce_list_p cl, int *p1, int *p2) in pop_best_coalesce() function
1212 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc48/gcc-4.8.5/gcc/ |
| H A D | tree-ssa-coalesce.c | 167 pop_best_coalesce (coalesce_list_p cl, int *p1, int *p2) in pop_best_coalesce() function
1243 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
| H A D | tree-ssa-coalesce.c | 167 pop_best_coalesce (coalesce_list_p cl, int *p1, int *p2) in pop_best_coalesce() function
1243 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc8/gcc-8.5.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 239 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1408 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc10/gcc-10.3.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 239 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1408 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc11/gcc-11.2.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 239 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1408 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| H A D | ChangeLog-2006 | 1920 (pop_best_coalesce): Remove the best coalesce from the list.
1979 pop_best_coalesce, add_conflicts_if_valid, set_if_valid,
3626 (pop_best_coalesce): Take pairs from the array.
|
| /dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1431 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 239 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1408 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 239 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1408 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| H A D | ChangeLog-2006 | 1920 (pop_best_coalesce): Remove the best coalesce from the list.
1979 pop_best_coalesce, add_conflicts_if_valid, set_if_valid,
3626 (pop_best_coalesce): Take pairs from the array.
|
| /dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 239 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1408 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1432 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc9/gcc-9.4.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1431 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
| H A D | tree-ssa-coalesce.c | 238 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1431 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
| H A D | tree-ssa-coalesce.c | 236 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1418 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| /dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
| H A D | tree-ssa-live.c | 1268 pop_best_coalesce (coalesce_list_p cl, int *p1, int *p2) in pop_best_coalesce() function
1503 while (pop_best_coalesce (cl, &x, &y) != NO_BEST_COALESCE) in coalesce_tpa_members()
|
| /dports/lang/gnat_util/gcc-6-20180516/gcc/ |
| H A D | tree-ssa-coalesce.c | 236 pop_best_coalesce (coalesce_list *cl, int *p1, int *p2) in pop_best_coalesce() function
1418 while ((cost = pop_best_coalesce (cl, &x, &y)) != NO_BEST_COALESCE) in coalesce_partitions()
|
| H A D | ChangeLog-2006 | 1920 (pop_best_coalesce): Remove the best coalesce from the list.
1979 pop_best_coalesce, add_conflicts_if_valid, set_if_valid,
3626 (pop_best_coalesce): Take pairs from the array.
|