/dports/lang/gcc48/gcc-4.8.5/gcc/ |
H A D | tree-ssa-structalias.c | 2090 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2103 label_visit (graph, si, w); in label_visit() 2202 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
H A D | ChangeLog | 11945 * tree-ssa-structalias.c (label_visit): Consider case with 11963 (label_visit): Adjust and fix error in previous patch. 12077 * tree-ssa-structalias.c (label_visit): Reduce work for 12355 (label_visit): Free duplicate bitmaps and record the leader instead.
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
H A D | tree-ssa-structalias.c | 2083 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2096 label_visit (graph, si, w); in label_visit() 2195 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
H A D | ChangeLog | 2940 * tree-ssa-structalias.c (label_visit): Consider case with 2958 (label_visit): Adjust and fix error in previous patch. 3072 * tree-ssa-structalias.c (label_visit): Reduce work for 3350 (label_visit): Free duplicate bitmaps and record the leader instead.
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
H A D | tree-ssa-structalias.c | 2125 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2138 label_visit (graph, si, w); in label_visit() 2315 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
H A D | tree-ssa-structalias.c | 2118 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2131 label_visit (graph, si, w); in label_visit() 2307 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
H A D | ChangeLog-2013 | 7931 * tree-ssa-structalias.c (label_visit): Expand comment. 38552 * tree-ssa-structalias.c (label_visit): Consider case with 38570 (label_visit): Adjust and fix error in previous patch. 38684 * tree-ssa-structalias.c (label_visit): Reduce work for 38962 (label_visit): Free duplicate bitmaps and record the leader instead.
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/ |
H A D | tree-ssa-structalias.c | 2125 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2138 label_visit (graph, si, w); in label_visit() 2315 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc8/gcc-8.5.0/gcc/ |
H A D | tree-ssa-structalias.c | 2122 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2135 label_visit (graph, si, w); in label_visit() 2316 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc10/gcc-10.3.0/gcc/ |
H A D | tree-ssa-structalias.c | 2169 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in label_visit() function 2182 label_visit (graph, si, w); in label_visit() 2364 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | tree-ssa-structalias.c | 2122 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2135 label_visit (graph, si, w); in label_visit() 2316 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
H A D | tree-ssa-structalias.c | 2179 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in label_visit() function 2192 label_visit (graph, si, w); in label_visit() 2374 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
H A D | tree-ssa-structalias.c | 2122 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2135 label_visit (graph, si, w); in label_visit() 2316 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
H A D | tree-ssa-structalias.c | 2169 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in label_visit() function 2182 label_visit (graph, si, w); in label_visit() 2364 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
H A D | tree-ssa-structalias.c | 2129 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2142 label_visit (graph, si, w); in label_visit() 2323 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
H A D | tree-ssa-structalias.c | 2122 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2135 label_visit (graph, si, w); in label_visit() 2316 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | tree-ssa-structalias.c | 2122 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2135 label_visit (graph, si, w); in label_visit() 2316 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
H A D | ChangeLog-2013 | 7931 * tree-ssa-structalias.c (label_visit): Expand comment. 38552 * tree-ssa-structalias.c (label_visit): Consider case with 38570 (label_visit): Adjust and fix error in previous patch. 38684 * tree-ssa-structalias.c (label_visit): Reduce work for 38962 (label_visit): Free duplicate bitmaps and record the leader instead.
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
H A D | tree-ssa-structalias.c | 2179 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in label_visit() function 2192 label_visit (graph, si, w); in label_visit() 2374 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
H A D | tree-ssa-structalias.c | 2122 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2135 label_visit (graph, si, w); in label_visit() 2316 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc11/gcc-11.2.0/gcc/ |
H A D | tree-ssa-structalias.c | 2179 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in label_visit() function 2192 label_visit (graph, si, w); in label_visit() 2374 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
H A D | tree-ssa-structalias.c | 2169 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) 2182 label_visit (graph, si, w); 2364 label_visit (graph, si, si->node_mapping[i]);
|
/dports/lang/gcc9/gcc-9.4.0/gcc/ |
H A D | tree-ssa-structalias.c | 2129 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2142 label_visit (graph, si, w); in label_visit() 2323 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
H A D | tree-ssa-structalias.c | 2129 label_visit (constraint_graph_t graph, struct scc_info *si, unsigned int n) in label_visit() function 2142 label_visit (graph, si, w); in label_visit() 2323 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
H A D | tree-ssa-structalias.c | 2199 label_visit (constraint_graph_t graph, class scc_info *si, unsigned int n) in label_visit() function 2212 label_visit (graph, si, w); in label_visit() 2394 label_visit (graph, si, si->node_mapping[i]); in perform_var_substitution()
|