/dports/devel/tigcc/tigcc-0.96.b8_10/gnu/gcc-4.1-20060728/gcc/ |
H A D | tree-eh.c | 317 struct goto_queue_node { struct 359 tree a = ((const struct goto_queue_node *)x)->stmt; in goto_queue_cmp() 360 tree b = ((const struct goto_queue_node *)y)->stmt; in goto_queue_cmp() 370 struct goto_queue_node tmp, *ret; in find_goto_replacement() 373 sizeof (struct goto_queue_node), goto_queue_cmp); in find_goto_replacement() 483 struct goto_queue_node *q; in maybe_record_in_goto_queue() 911 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 946 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1058 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1063 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/ |
H A D | tree-eh.c | 325 struct goto_queue_node struct 377 struct goto_queue_node *goto_queue; 382 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 431 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 440 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 577 struct goto_queue_node *q; in record_in_goto_queue() 1068 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1129 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1279 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1283 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc8/gcc-8.5.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
H A D | ChangeLog-2012 | 10941 * tree-eh.c (goto_queue_node): New field.
|
H A D | ChangeLog-2009 | 24016 * tree-eh.c (struct goto_queue_node): Break out of struct
|
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gnat_util/gcc-6-20180516/gcc/ |
H A D | tree-eh.c | 325 struct goto_queue_node struct 377 struct goto_queue_node *goto_queue; 382 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 431 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 440 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 577 struct goto_queue_node *q; in record_in_goto_queue() 1068 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1129 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1279 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1283 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc9/gcc-9.4.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
H A D | ChangeLog-2009 | 24016 * tree-eh.c (struct goto_queue_node): Break out of struct
|
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 381 struct goto_queue_node *goto_queue; 386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 581 struct goto_queue_node *q; in record_in_goto_queue() 1072 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1133 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1283 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1287 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc48/gcc-4.8.5/gcc/ |
H A D | tree-eh.c | 320 struct goto_queue_node struct 372 struct goto_queue_node *goto_queue; 439 return (((struct goto_queue_node *) *slot)->repl_stmt); in find_goto_replacement() 567 struct goto_queue_node *q; in record_in_goto_queue() 578 = XRESIZEVEC (struct goto_queue_node, tf->goto_queue, size); in record_in_goto_queue() 748 do_goto_redirection (struct goto_queue_node *q, tree finlab, gimple_seq mod, in do_goto_redirection() 1042 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1103 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1250 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1254 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/ |
H A D | tree-eh.c | 320 struct goto_queue_node struct 372 struct goto_queue_node *goto_queue; 439 return (((struct goto_queue_node *) *slot)->repl_stmt); in find_goto_replacement() 567 struct goto_queue_node *q; in record_in_goto_queue() 578 = XRESIZEVEC (struct goto_queue_node, tf->goto_queue, size); in record_in_goto_queue() 748 do_goto_redirection (struct goto_queue_node *q, tree finlab, gimple_seq mod, in do_goto_redirection() 1042 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1103 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1250 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1254 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 588 struct goto_queue_node *q; in record_in_goto_queue() 1068 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1129 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1279 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1283 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 588 struct goto_queue_node *q; in record_in_goto_queue() 1068 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1129 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1279 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1283 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc10/gcc-10.3.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 588 struct goto_queue_node *q; in record_in_goto_queue() 1073 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1134 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1284 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1288 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/devel/avr-gcc/gcc-10.2.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 588 struct goto_queue_node *q; in record_in_goto_queue() 1073 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1134 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1284 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1288 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 588 struct goto_queue_node *q; in record_in_goto_queue() 1068 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1129 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1279 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1283 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc11/gcc-11.2.0/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node struct 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement() 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement() 588 struct goto_queue_node *q; in record_in_goto_queue() 1068 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1129 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1279 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1283 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/ |
H A D | tree-eh.c | 329 struct goto_queue_node 384 struct goto_queue_node *goto_queue; 389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; 438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; 447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); 588 struct goto_queue_node *q; 1073 struct goto_queue_node *q, *qe; 1134 struct goto_queue_node *q, *qe; 1284 struct goto_queue_node *q, *qe; 1288 struct goto_queue_node *q; [all …]
|
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/ |
H A D | tree-eh.c | 351 struct goto_queue_node struct 403 struct goto_queue_node *goto_queue; 470 return (((struct goto_queue_node *) *slot)->repl_stmt); in find_goto_replacement() 598 struct goto_queue_node *q; in record_in_goto_queue() 609 = XRESIZEVEC (struct goto_queue_node, tf->goto_queue, size); in record_in_goto_queue() 779 do_goto_redirection (struct goto_queue_node *q, tree finlab, gimple_seq mod, in do_goto_redirection() 1073 struct goto_queue_node *q, *qe; in lower_try_finally_nofallthru() 1134 struct goto_queue_node *q, *qe; in lower_try_finally_onedest() 1281 struct goto_queue_node *q, *qe; in lower_try_finally_copy() 1285 struct goto_queue_node *q; in lower_try_finally_copy() [all …]
|