Home
last modified time | relevance | path

Searched refs:pe_rep (Results 1 – 25 of 42) sorted by relevance

12

/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-ssa-structalias.c534 int *pe_rep; member
1176 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1181 graph->pe_rep[j] = -1; in init_graph()
2344 graph->pe_rep[label] = node; in find_equivalent_node()
2351 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2352 graph->pe_rep[label] = node; in find_equivalent_node()
2374 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
6796 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dtree-ssa-structalias.c534 int *pe_rep; member
1173 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1178 graph->pe_rep[j] = -1; in init_graph()
2318 graph->pe_rep[label] = node; in find_equivalent_node()
2325 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2326 graph->pe_rep[label] = node; in find_equivalent_node()
2348 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
6775 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-ssa-structalias.c568 int *pe_rep; member
1199 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1204 graph->pe_rep[j] = -1; in init_graph()
2459 graph->pe_rep[label] = node; in find_equivalent_node()
2466 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2467 graph->pe_rep[label] = node; in find_equivalent_node()
2489 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7219 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dtree-ssa-structalias.c562 int *pe_rep; member
1193 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1198 graph->pe_rep[j] = -1; in init_graph()
2449 graph->pe_rep[label] = node; in find_equivalent_node()
2456 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2457 graph->pe_rep[label] = node; in find_equivalent_node()
2479 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
6942 free (graph->pe_rep); in delete_points_to_sets()
H A DChangeLog-200710733 Add pe, pe_rep, pointer_label, loc_label, pointed_by, points_to,
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-ssa-structalias.c568 int *pe_rep; member
1199 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1204 graph->pe_rep[j] = -1; in init_graph()
2459 graph->pe_rep[label] = node; in find_equivalent_node()
2466 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2467 graph->pe_rep[label] = node; in find_equivalent_node()
2489 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7219 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-ssa-structalias.c576 int *pe_rep; member
1209 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1214 graph->pe_rep[j] = -1; in init_graph()
2460 graph->pe_rep[label] = node; in find_equivalent_node()
2467 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2468 graph->pe_rep[label] = node; in find_equivalent_node()
2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7378 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dtree-ssa-structalias.c583 int *pe_rep; member
1216 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1221 graph->pe_rep[j] = -1; in init_graph()
2509 graph->pe_rep[label] = node; in find_equivalent_node()
2516 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2517 graph->pe_rep[label] = node; in find_equivalent_node()
2539 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7566 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c576 int *pe_rep; member
1209 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1214 graph->pe_rep[j] = -1; in init_graph()
2460 graph->pe_rep[label] = node; in find_equivalent_node()
2467 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2468 graph->pe_rep[label] = node; in find_equivalent_node()
2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7378 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-ssa-structalias.c587 int *pe_rep; member
1226 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1231 graph->pe_rep[j] = -1; in init_graph()
2519 graph->pe_rep[label] = node; in find_equivalent_node()
2526 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2527 graph->pe_rep[label] = node; in find_equivalent_node()
2549 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7611 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c576 int *pe_rep; member
1209 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1214 graph->pe_rep[j] = -1; in init_graph()
2460 graph->pe_rep[label] = node; in find_equivalent_node()
2467 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2468 graph->pe_rep[label] = node; in find_equivalent_node()
2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7378 free (graph->pe_rep); in delete_points_to_sets()
H A DChangeLog-200710733 Add pe, pe_rep, pointer_label, loc_label, pointed_by, points_to,
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dtree-ssa-structalias.c583 int *pe_rep; member
1216 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1221 graph->pe_rep[j] = -1; in init_graph()
2509 graph->pe_rep[label] = node; in find_equivalent_node()
2516 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2517 graph->pe_rep[label] = node; in find_equivalent_node()
2539 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7566 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dtree-ssa-structalias.c583 int *pe_rep; member
1216 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1221 graph->pe_rep[j] = -1; in init_graph()
2467 graph->pe_rep[label] = node; in find_equivalent_node()
2474 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2475 graph->pe_rep[label] = node; in find_equivalent_node()
2497 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7421 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c576 int *pe_rep; member
1209 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1214 graph->pe_rep[j] = -1; in init_graph()
2460 graph->pe_rep[label] = node; in find_equivalent_node()
2467 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2468 graph->pe_rep[label] = node; in find_equivalent_node()
2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7378 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-ssa-structalias.c576 int *pe_rep; member
1209 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1214 graph->pe_rep[j] = -1; in init_graph()
2460 graph->pe_rep[label] = node; in find_equivalent_node()
2467 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2468 graph->pe_rep[label] = node; in find_equivalent_node()
2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7378 free (graph->pe_rep); in delete_points_to_sets()
H A DChangeLog-200710733 Add pe, pe_rep, pointer_label, loc_label, pointed_by, points_to,
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-ssa-structalias.c587 int *pe_rep; member
1226 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1231 graph->pe_rep[j] = -1; in init_graph()
2519 graph->pe_rep[label] = node; in find_equivalent_node()
2526 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2527 graph->pe_rep[label] = node; in find_equivalent_node()
2549 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7611 free (graph->pe_rep); in delete_points_to_sets()
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dtree-ssa-structalias.c576 int *pe_rep; member
1209 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1214 graph->pe_rep[j] = -1; in init_graph()
2460 graph->pe_rep[label] = node; in find_equivalent_node()
2467 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2468 graph->pe_rep[label] = node; in find_equivalent_node()
2490 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7356 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-ssa-structalias.c587 int *pe_rep; member
1226 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1231 graph->pe_rep[j] = -1; in init_graph()
2519 graph->pe_rep[label] = node; in find_equivalent_node()
2526 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2527 graph->pe_rep[label] = node; in find_equivalent_node()
2549 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7611 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dtree-ssa-structalias.c583 int *pe_rep;
1216 graph->pe_rep = XNEWVEC (int, graph->size);
1221 graph->pe_rep[j] = -1;
2509 graph->pe_rep[label] = node;
2516 if (graph->pe_rep[label] == -1)
2517 graph->pe_rep[label] = node;
2539 int label_rep = graph->pe_rep[label];
7566 free (graph->pe_rep);
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dtree-ssa-structalias.c583 int *pe_rep; member
1216 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1221 graph->pe_rep[j] = -1; in init_graph()
2467 graph->pe_rep[label] = node; in find_equivalent_node()
2474 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2475 graph->pe_rep[label] = node; in find_equivalent_node()
2497 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7421 free (graph->pe_rep); in delete_points_to_sets()
H A DChangeLog-200710733 Add pe, pe_rep, pointer_label, loc_label, pointed_by, points_to,
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dtree-ssa-structalias.c583 int *pe_rep; member
1216 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1221 graph->pe_rep[j] = -1; in init_graph()
2467 graph->pe_rep[label] = node; in find_equivalent_node()
2474 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2475 graph->pe_rep[label] = node; in find_equivalent_node()
2497 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7399 free (graph->pe_rep); in delete_points_to_sets()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-ssa-structalias.c591 int *pe_rep; member
1246 graph->pe_rep = XNEWVEC (int, graph->size); in init_graph()
1251 graph->pe_rep[j] = -1; in init_graph()
2539 graph->pe_rep[label] = node; in find_equivalent_node()
2546 if (graph->pe_rep[label] == -1) in find_equivalent_node()
2547 graph->pe_rep[label] = node; in find_equivalent_node()
2569 int label_rep = graph->pe_rep[label]; in unite_pointer_equivalences()
7742 free (graph->pe_rep); in delete_points_to_sets()

12