Home | History | Annotate | Download | only in gcc

Lines Matching defs:available_in

206      available_in:
220 to insert copies of required_in - available_in. Conceptually we
281 bitmap available_in;
288 the block. This might reuse available_in or available_locally. */
717 if (!empty_p (info->available_in))
720 dump_candidate_bitmap (info->available_in);
730 if (info->available_in == info->available_out)
1132 /* available_in temporarily contains the set of candidates whose
1134 if (empty_p (src->rd_out) || empty_p (dest->available_in))
1138 src->rd_out, dest->available_in);
1204 /* Use available_in to record the set of candidates whose
1206 bitmap_ior_into (get_bitmap (&info->available_in),
1904 available_in and available_locally. */
1911 info->available_in, info->rd_kill);
1915 info->available_locally, info->available_in);
1918 info->available_locally, info->available_in,
2071 if (info->available_in)
2074 bitmap_copy (info->available_in, info->rd_in);
2076 BITMAP_FREE (info->available_in);
2079 if (last_call || empty_p (info->available_in))
2086 info->available_out = info->available_in;
2116 available_in set of E->dest, when computing global availability.
2128 if (empty_p (dest->available_in))
2133 bitmap_clear (dest->available_in);
2137 return bitmap_and_into (dest->available_in, src->available_out);
2140 /* Propagate information from the available_in set of block BB_INDEX
2151 if (info->available_out == info->available_in)
2184 if (info->required_in && info->available_in)
2185 bitmap_and_compl_into (info->required_in, info->available_in);
2189 /* Make sure that INFO's available_out and available_in sets are unique. */
2194 if (info->available_in && info->available_in == info->available_out)
2196 info->available_in = alloc_bitmap ();
2197 bitmap_copy (info->available_in, info->available_out);
2452 bitmap_ior_into (get_bitmap (&dest_info->available_in), required);
2482 if (info->available_in)
2484 info->available_in));
2522 emit_remat_insns (info->required_in, info->available_in,