Home
last modified time | relevance | path

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

12

/dports/lang/gcc48/gcc-4.8.5/gcc/
H A Dtree-eh.c377 struct pointer_map_t *goto_queue_map; member
425 if (!tf->goto_queue_map) in find_goto_replacement()
427 tf->goto_queue_map = pointer_map_create (); in find_goto_replacement()
430 slot = pointer_map_insert (tf->goto_queue_map, in find_goto_replacement()
437 slot = pointer_map_contains (tf->goto_queue_map, stmt.g); in find_goto_replacement()
569 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1702 if (this_tf.goto_queue_map) in lower_try_finally()
1703 pointer_map_destroy (this_tf.goto_queue_map); in lower_try_finally()
/dports/devel/mingw32-gcc/gcc-4.8.1/gcc/
H A Dtree-eh.c377 struct pointer_map_t *goto_queue_map; member
425 if (!tf->goto_queue_map) in find_goto_replacement()
427 tf->goto_queue_map = pointer_map_create (); in find_goto_replacement()
430 slot = pointer_map_insert (tf->goto_queue_map, in find_goto_replacement()
437 slot = pointer_map_contains (tf->goto_queue_map, stmt.g); in find_goto_replacement()
569 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1704 if (this_tf.goto_queue_map) in lower_try_finally()
1705 pointer_map_destroy (this_tf.goto_queue_map); in lower_try_finally()
/dports/lang/gcc6-aux/gcc-6-20180516/gcc/
H A Dtree-eh.c382 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
429 if (!tf->goto_queue_map) in find_goto_replacement()
431 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
434 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
440 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
579 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1733 if (this_tf.goto_queue_map) in lower_try_finally()
1734 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc8/gcc-8.5.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/devel/riscv64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/devel/arm-none-eabi-gcc/gcc-8.4.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
H A DChangeLog-200711250 * tree-eh.c (struct leh_tf_state): Add goto_queue_map field.
/dports/devel/arm-none-eabi-gcc492/gcc-4.9.2/gcc/
H A Dtree-eh.c408 struct pointer_map_t *goto_queue_map; member
456 if (!tf->goto_queue_map) in find_goto_replacement()
458 tf->goto_queue_map = pointer_map_create (); in find_goto_replacement()
461 slot = pointer_map_insert (tf->goto_queue_map, in find_goto_replacement()
468 slot = pointer_map_contains (tf->goto_queue_map, stmt.g); in find_goto_replacement()
600 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1733 if (this_tf.goto_queue_map) in lower_try_finally()
1734 pointer_map_destroy (this_tf.goto_queue_map); in lower_try_finally()
H A DChangeLog-200711250 * tree-eh.c (struct leh_tf_state): Add goto_queue_map field.
/dports/devel/riscv32-unknown-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc9-devel/gcc-9-20211007/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/devel/aarch64-none-elf-gcc/gcc-8.4.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
H A DChangeLog-200711250 * tree-eh.c (struct leh_tf_state): Add goto_queue_map field.
/dports/devel/riscv64-gcc/gcc-8.3.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gnat_util/gcc-6-20180516/gcc/
H A Dtree-eh.c382 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
429 if (!tf->goto_queue_map) in find_goto_replacement()
431 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
434 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
440 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
579 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1733 if (this_tf.goto_queue_map) in lower_try_finally()
1734 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc9/gcc-9.4.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
H A DChangeLog-200711250 * tree-eh.c (struct leh_tf_state): Add goto_queue_map field.
/dports/lang/gcc9-aux/gcc-9.1.0/gcc/
H A Dtree-eh.c386 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
433 if (!tf->goto_queue_map) in find_goto_replacement()
435 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
438 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
444 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
583 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1732 if (this_tf.goto_queue_map) in lower_try_finally()
1733 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc12-devel/gcc-12-20211205/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
436 if (!tf->goto_queue_map) in find_goto_replacement()
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
590 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1738 if (this_tf.goto_queue_map) in lower_try_finally()
1739 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc11-devel/gcc-11-20211009/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
436 if (!tf->goto_queue_map) in find_goto_replacement()
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
590 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1738 if (this_tf.goto_queue_map) in lower_try_finally()
1739 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc10/gcc-10.3.0/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
436 if (!tf->goto_queue_map) in find_goto_replacement()
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
590 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1743 if (this_tf.goto_queue_map) in lower_try_finally()
1744 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/devel/avr-gcc/gcc-10.2.0/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
436 if (!tf->goto_queue_map) in find_goto_replacement()
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
590 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1743 if (this_tf.goto_queue_map) in lower_try_finally()
1744 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/misc/cxx_atomics_pic/gcc-11.2.0/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
436 if (!tf->goto_queue_map) in find_goto_replacement()
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
590 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1738 if (this_tf.goto_queue_map) in lower_try_finally()
1739 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc11/gcc-11.2.0/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map; member
436 if (!tf->goto_queue_map) in find_goto_replacement()
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>; in find_goto_replacement()
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g, in find_goto_replacement()
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g); in find_goto_replacement()
590 gcc_assert (!tf->goto_queue_map); in record_in_goto_queue()
1738 if (this_tf.goto_queue_map) in lower_try_finally()
1739 delete this_tf.goto_queue_map; in lower_try_finally()
/dports/lang/gcc10-devel/gcc-10-20211008/gcc/
H A Dtree-eh.c389 hash_map<gimple *, goto_queue_node *> *goto_queue_map;
436 if (!tf->goto_queue_map)
438 tf->goto_queue_map = new hash_map<gimple *, goto_queue_node *>;
441 bool existed = tf->goto_queue_map->put (tf->goto_queue[i].stmt.g,
447 goto_queue_node **slot = tf->goto_queue_map->get (stmt.g);
590 gcc_assert (!tf->goto_queue_map);
1743 if (this_tf.goto_queue_map)
1744 delete this_tf.goto_queue_map;

12