Home
last modified time | relevance | path

Searched refs:edge_locus (Results 1 – 21 of 21) sorted by relevance

/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-outof-ssa.c140 vec<source_location> edge_locus; member
407 g->edge_locus.create (10); in new_elim_graph()
423 g->edge_locus.truncate (0); in clear_elim_graph()
439 g->edge_locus.release (); in delete_elim_graph()
476 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
494 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
495 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
517 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
537 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-outof-ssa.c73 vec<source_location> edge_locus; member
343 g->edge_locus.create (10); in new_elim_graph()
359 g->edge_locus.truncate (0); in clear_elim_graph()
375 g->edge_locus.release (); in delete_elim_graph()
412 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
430 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
431 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
453 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
473 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-outof-ssa.c140 vec<source_location> edge_locus; member
407 g->edge_locus.create (10); in new_elim_graph()
423 g->edge_locus.truncate (0); in clear_elim_graph()
439 g->edge_locus.release (); in delete_elim_graph()
476 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
494 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
495 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
517 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
537 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dtree-outof-ssa.c73 vec<source_location> edge_locus; member
343 g->edge_locus.create (10); in new_elim_graph()
359 g->edge_locus.truncate (0); in clear_elim_graph()
375 g->edge_locus.release (); in delete_elim_graph()
412 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
430 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
431 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
453 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
473 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dtree-outof-ssa.c144 vec<source_location> edge_locus; member
414 g->edge_locus.create (10); in new_elim_graph()
430 g->edge_locus.truncate (0); in clear_elim_graph()
446 g->edge_locus.release (); in delete_elim_graph()
483 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
501 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
502 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
524 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
544 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-outof-ssa.c144 auto_vec<source_location> edge_locus; member
401 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
414 g->edge_locus.truncate (0); in clear_elim_graph()
449 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
467 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
468 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
490 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
510 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-outof-ssa.c144 auto_vec<source_location> edge_locus; member
401 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
414 g->edge_locus.truncate (0); in clear_elim_graph()
449 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
467 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
468 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
490 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
510 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-outof-ssa.c144 auto_vec<source_location> edge_locus; member
401 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
414 g->edge_locus.truncate (0); in clear_elim_graph()
449 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
467 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
468 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
490 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
510 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-outof-ssa.c144 auto_vec<source_location> edge_locus; member
401 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
414 g->edge_locus.truncate (0); in clear_elim_graph()
449 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
467 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
468 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
490 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
510 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-outof-ssa.c144 auto_vec<source_location> edge_locus; member
401 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
414 g->edge_locus.truncate (0); in clear_elim_graph()
449 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
467 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
468 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
490 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
510 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dtree-outof-ssa.c144 auto_vec<source_location> edge_locus; member
401 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
414 g->edge_locus.truncate (0); in clear_elim_graph()
449 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
467 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
468 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
490 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
510 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dtree-outof-ssa.c146 auto_vec<location_t> edge_locus; member
403 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
416 g->edge_locus.truncate (0); in clear_elim_graph()
451 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
469 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
470 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
492 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
512 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dtree-outof-ssa.c146 auto_vec<location_t> edge_locus; member
403 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
416 g->edge_locus.truncate (0); in clear_elim_graph()
451 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
469 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
470 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
492 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
512 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dtree-outof-ssa.c146 auto_vec<location_t> edge_locus; member
403 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
416 g->edge_locus.truncate (0); in clear_elim_graph()
451 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
469 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
470 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
492 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
512 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
446 g->edge_locus.truncate (0); in clear_elim_graph()
481 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
499 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
446 g->edge_locus.truncate (0); in clear_elim_graph()
481 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
499 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
446 g->edge_locus.truncate (0); in clear_elim_graph()
481 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
499 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
446 g->edge_locus.truncate (0); in clear_elim_graph()
481 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
499 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
446 g->edge_locus.truncate (0); in clear_elim_graph()
481 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
499 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus; variable
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions), in elim_graph()
446 g->edge_locus.truncate (0); in clear_elim_graph()
481 g->edge_locus.safe_push (locus); in elim_graph_add_edge()
499 *locus = g->edge_locus[x / 2]; in elim_graph_remove_succ_edge()
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION; in elim_graph_remove_succ_edge()
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dtree-outof-ssa.c147 auto_vec<location_t> edge_locus;
433 nodes (30), edge_list (20), edge_locus (10), visited (map->num_partitions),
446 g->edge_locus.truncate (0);
481 g->edge_locus.safe_push (locus);
499 *locus = g->edge_locus[x / 2];
500 g->edge_locus[x / 2] = UNKNOWN_LOCATION;
522 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \
542 (void) ((LOCUS) = (GRAPH)->edge_locus[x_ / 2]); \