| /dragonfly/contrib/gcc-4.7/gcc/ |
| H A D | lcm.c | 181 sbitmap *earliest) in compute_earliest() argument
197 sbitmap_copy (earliest[x], antin[succ->index]); in compute_earliest()
201 sbitmap_zero (earliest[x]); in compute_earliest()
207 sbitmap_a_and_b_or_c (earliest[x], difference, in compute_earliest()
247 compute_laterin (struct edge_list *edge_list, sbitmap *earliest, in compute_laterin() argument
285 sbitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]); in compute_laterin()
320 earliest[(size_t) e->aux], in compute_laterin()
382 sbitmap *antin, *antout, *earliest; in pre_edge_lcm() local
424 earliest = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm()
440 compute_laterin (edge_list, earliest, antloc, later, laterin); in pre_edge_lcm()
[all …]
|
| H A D | ipa-split.c | 863 int earliest; member
911 first.earliest = INT_MAX; in find_split_points()
934 if (pos <= entry->earliest && !entry->can_split in find_split_points()
939 if (pos <= entry->earliest && entry->can_split) in find_split_points()
990 new_entry.earliest = INT_MAX; in find_split_points()
1002 && (intptr_t)dest->aux < entry->earliest) in find_split_points()
1003 entry->earliest = (intptr_t)dest->aux; in find_split_points()
1021 if (prev->earliest > entry->earliest) in find_split_points()
1022 prev->earliest = entry->earliest; in find_split_points()
|
| H A D | ifcvt.c | 1702 rtx *earliest) in noce_get_alt_condition() argument
1710 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
1821 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
1827 earliest, target, false, true); in noce_get_alt_condition()
1854 rtx cond, earliest, target, seq; in noce_try_minmax() local
1937 if_info->cond_earliest = earliest; in noce_try_minmax()
1949 rtx cond, earliest, target, seq, a, b, c; in noce_try_abs() local
2002 rtx set, insn = prev_nonnote_insn (earliest); in noce_try_abs()
2084 if_info->cond_earliest = earliest; in noce_try_abs()
2303 *earliest = jump; in noce_get_condition()
[all …]
|
| H A D | rtlanal.c | 4875 canonicalize_condition (rtx insn, rtx cond, int reverse, rtx *earliest, in canonicalize_condition() argument
4897 if (earliest) in canonicalize_condition()
4898 *earliest = insn; in canonicalize_condition()
4926 if (earliest) in canonicalize_condition()
4927 *earliest = prev; in canonicalize_condition()
5049 if (earliest) in canonicalize_condition()
5050 *earliest = prev; in canonicalize_condition()
5133 get_condition (rtx jump, rtx *earliest, int allow_cc_mode, int valid_at_insn_p) in get_condition() argument
5153 return canonicalize_condition (jump, cond, reverse, earliest, NULL_RTX, in get_condition()
|
| H A D | modulo-sched.c | 1920 int earliest = p_st + e->latency - (e->distance * ii); in get_sched_window() local
1926 "", earliest, "", latest, p_st); in get_sched_window()
1931 early_start = MAX (early_start, earliest); in get_sched_window()
1948 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); in get_sched_window() local
1954 earliest, "", latest, "", s_st); in get_sched_window()
1959 start = MAX (start, earliest); in get_sched_window()
|
| H A D | haifa-sched.c | 2855 int earliest = INSN_TICK (insn); in estimate_insn_tick() local
2879 if (earliest == INVALID_TICK || t > earliest) in estimate_insn_tick()
2880 earliest = t; in estimate_insn_tick()
2884 INSN_TICK_ESTIMATE (insn) = earliest; in estimate_insn_tick()
|
| /dragonfly/contrib/gcc-8.0/gcc/ |
| H A D | lcm.c | 171 sbitmap *earliest) in compute_earliest() argument
184 bitmap_copy (earliest[x], antin[succ->index]); in compute_earliest()
188 bitmap_clear (earliest[x]); in compute_earliest()
194 bitmap_and_or (earliest[x], difference, in compute_earliest()
231 compute_laterin (struct edge_list *edge_list, sbitmap *earliest, in compute_laterin() argument
269 bitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]); in compute_laterin()
310 earliest[(size_t) e->aux], in compute_laterin()
374 sbitmap *antin, *antout, *earliest; in pre_edge_lcm_avs() local
418 earliest = sbitmap_vector_alloc (num_edges, n_exprs); in pre_edge_lcm_avs()
434 compute_laterin (edge_list, earliest, antloc, later, laterin); in pre_edge_lcm_avs()
[all …]
|
| H A D | ipa-split.c | 1039 int earliest; member
1085 first.earliest = INT_MAX; in find_split_points()
1110 if (pos <= entry->earliest && !entry->can_split in find_split_points()
1115 if (pos <= entry->earliest && entry->can_split) in find_split_points()
1166 new_entry.earliest = INT_MAX; in find_split_points()
1178 && (intptr_t)dest->aux < entry->earliest) in find_split_points()
1179 entry->earliest = (intptr_t)dest->aux; in find_split_points()
1196 if (prev->earliest > entry->earliest) in find_split_points()
1197 prev->earliest = entry->earliest; in find_split_points()
|
| H A D | ifcvt.c | 2303 rtx_insn **earliest) in noce_get_alt_condition() argument
2312 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
2425 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
2431 earliest, target, have_cbranchcc4, true); in noce_get_alt_condition()
2459 rtx_insn *earliest, *seq; in noce_try_minmax() local
2545 if_info->cond_earliest = earliest; in noce_try_minmax()
2560 rtx_insn *earliest, *seq; in noce_try_abs() local
2713 if_info->cond_earliest = earliest; in noce_try_abs()
2948 *earliest = jump; in noce_get_condition()
5041 rtx_insn *earliest = NULL; in dead_or_predicable() local
[all …]
|
| H A D | modulo-sched.c | 1908 int earliest = p_st + e->latency - (e->distance * ii); in get_sched_window() local
1914 "", earliest, "", latest, p_st); in get_sched_window()
1919 early_start = MAX (early_start, earliest); in get_sched_window()
1936 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); in get_sched_window() local
1942 earliest, "", latest, "", s_st); in get_sched_window()
1947 start = MAX (start, earliest); in get_sched_window()
|
| H A D | rtlanal.c | 5482 rtx_insn **earliest, in canonicalize_condition() argument
5504 if (earliest) in canonicalize_condition()
5505 *earliest = insn; in canonicalize_condition()
5532 if (earliest) in canonicalize_condition()
5533 *earliest = prev; in canonicalize_condition()
5665 if (earliest) in canonicalize_condition()
5666 *earliest = prev; in canonicalize_condition()
5752 get_condition (rtx_insn *jump, rtx_insn **earliest, int allow_cc_mode, in get_condition() argument
5773 return canonicalize_condition (jump, cond, reverse, earliest, NULL_RTX, in get_condition()
|
| H A D | early-remat.c | 330 unsigned int earliest; member
1122 ec->earliest = cand1_index; in record_equiv_candidates()
1343 return ec->earliest; in resolve_reaching_def()
|
| H A D | haifa-sched.c | 4805 int earliest = INSN_TICK (insn); in estimate_insn_tick() local
4829 if (earliest == INVALID_TICK || t > earliest) in estimate_insn_tick()
4830 earliest = t; in estimate_insn_tick()
4834 INSN_TICK_ESTIMATE (insn) = earliest; in estimate_insn_tick()
|
| /dragonfly/usr.bin/ktrdump/ |
| H A D | ktrdump.c | 937 int count, scan, i, earliest; in earliest_ts() local
940 earliest = buf->end_idx - 1; in earliest_ts()
941 save = &buf->ents[earliest & fifo_mask]; in earliest_ts()
946 earliest = scan; in earliest_ts()
954 return earliest; in earliest_ts()
|
| /dragonfly/usr.bin/compress/doc/ |
| H A D | NOTES | 64 engineer can tell you. (Chemical processes were among the earliest patents,
|
| /dragonfly/gnu/usr.bin/rcs/ |
| H A D | NEWS | 416 Add ways to specify the earliest revision, the most recent revision,
417 the earliest or latest revision on a particular branch, and
|
| /dragonfly/share/zoneinfo/ |
| H A D | asia | 1348 # Indonesia until 1945-09-01 00:00 at the earliest (in Jakarta) and
1351 # These would be the earliest possible times for a change.
|
| H A D | southamerica | 606 # The earliest issue of the SSIM I have is 2/91. Each issue from then until
|
| /dragonfly/contrib/ncurses/misc/ |
| H A D | terminfo.src | 17848 # version 4.3 by A.Barkus, September 1990 (earliest entry is October 1989).
19707 # The earliest UNIXes were designed to use these clunkers; nroff and a few
|
| /dragonfly/contrib/gcc-4.7/gcc/doc/ |
| H A D | extend.texi | 8187 initializers. The earliest version where it is completely safe is
|
| H A D | invoke.texi | 11991 The earliest version of MacOS X that this executable will run on
|
| /dragonfly/games/fortune/datfiles/ |
| H A D | fortunes | 1976 to put on record, at the earliest moment of regaining consciousness, the
17347 Even in the moment of our earliest kiss,
44758 belongs to the roommate with the earliest class.
|