Home
last modified time | relevance | path

Searched refs:compute_available (Results 1 – 16 of 16) sorted by relevance

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dlcm.h29 extern void compute_available (sbitmap *, sbitmap *, sbitmap *, sbitmap *);
H A Dlcm.c400 compute_available (avloc, kill, avout, avin); in pre_edge_lcm_avs()
494 compute_available (sbitmap *avloc, sbitmap *kill, sbitmap *avout, in compute_available() function
755 compute_available (st_avloc, kill, st_avout, st_avin); in pre_edge_rev_lcm()
H A Dcprop.c643 compute_available (cprop_avloc, cprop_kill, cprop_avout, cprop_avin); in compute_cprop_data()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dlcm.h29 extern void compute_available (sbitmap *, sbitmap *, sbitmap *, sbitmap *);
H A Dlcm.cc400 compute_available (avloc, kill, avout, avin); in pre_edge_lcm_avs()
494 compute_available (sbitmap *avloc, sbitmap *kill, sbitmap *avout, in compute_available() function
755 compute_available (st_avloc, kill, st_avout, st_avin); in pre_edge_rev_lcm()
H A Dcprop.cc644 compute_available (cprop_avloc, cprop_kill, cprop_avout, cprop_avin); in compute_cprop_data()
H A DChangeLog-19992729 * lcm.c (compute_antinout_edge, compute_available): Similarly.
2731 (compute_cprop_data): Use compute_available.
2732 (delete_null_pointer_checks_1): Use compute_available.
2734 * basic-block.h (compute_available): Returns a void now.
2735 * gcse.c (one_classic_gcse_pass): Do not expect compute_available
2737 * lcm.c (compute_available, compute_antinout_edge): Revamp to use
3243 (compute_available): Remove unused variable `last'.
4873 * basic-block.h (pre_edge_lcm, pre_edge_rev_lcm, compute_available):
4877 (compute_available): Move to lcm.c, and change parameter order.
10091 * gcse.c (compute_rdm, compute_available): Use new sbitmap routines.
H A DChangeLog-200219724 pre_edge_lcm, compute_available, compute_nearerout,
20240 compute_available, compute_nearerout, compute_rev_insert_delete,
21719 compute_insert_delete, pre_edge_lcm, compute_available,
35500 (compute_available): Rework to use iterative dataflow framework.
H A DChangeLog-20132779 * lcm.c (compute_laterin, compute_insert_delete, compute_available,
2952 compute_insert_delete, pre_edge_lcm, compute_available,
6359 (compute_available): Likewise.
7415 (compute_available): Likewise.
H A DChangeLog-20017523 (compute_laterin, compute_available, compute_nearerout): Likewise.
H A DChangeLog-200013664 * lcm.c (compute_antinout_edge,compute_laterin,compute_available):
H A DChangeLog-201217936 * lcm.c (compute_antinout_edge, compute_available): Likewise.
H A DChangeLog-2005938 compute_available): Ditto.
H A DChangeLog-201730977 (compute_available): Likewise.
H A DChangeLog-200410841 (compute_available): Likewise.
H A DChangeLog-201448664 * lcm.c (compute_available): Use inverted postorder to seed