Home
last modified time | relevance | path

Searched refs:earliest (Results 1 – 25 of 60) sorted by relevance

123

/netbsd-src/external/cddl/osnet/dist/lib/libdtrace/common/
H A Ddt_work.c53 hrtime_t earliest = INT64_MAX; in dtrace_sleep() local
72 if (*((hrtime_t *)a) + interval < earliest) in dtrace_sleep()
73 earliest = *((hrtime_t *)a) + interval; in dtrace_sleep()
80 if (earliest < now) { in dtrace_sleep()
86 tv.tv_sec = (earliest - now) / NANOSEC; in dtrace_sleep()
87 tv.tv_nsec = (earliest - now) % NANOSEC; in dtrace_sleep()
96 earliest -= now; in dtrace_sleep()
98 tv.tv_sec += earliest / NANOSEC; in dtrace_sleep()
99 tv.tv_nsec += earliest % NANOSEC; in dtrace_sleep()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dlcm.cc171 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()
419 compute_earliest (edge_list, n_exprs, antin, antout, avout, kill, earliest); in pre_edge_lcm_avs()
[all …]
H A Dipa-split.cc1022 int earliest; member in stack_entry
1068 first.earliest = INT_MAX; in find_split_points()
1093 if (pos <= entry->earliest && !entry->can_split in find_split_points()
1098 if (pos <= entry->earliest && entry->can_split) in find_split_points()
1149 new_entry.earliest = INT_MAX; in find_split_points()
1161 && (intptr_t)dest->aux < entry->earliest) in find_split_points()
1162 entry->earliest = (intptr_t)dest->aux; in find_split_points()
1179 if (prev->earliest > entry->earliest) in find_split_points()
1180 prev->earliest = entry->earliest; in find_split_points()
H A Difcvt.cc2377 rtx_insn **earliest) in noce_get_alt_condition() argument
2386 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
2499 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
2505 earliest, target, have_cbranchcc4, true); in noce_get_alt_condition()
2513 for (insn = if_info->jump; insn != *earliest; insn = PREV_INSN (insn)) in noce_get_alt_condition()
2518 for (insn = *earliest; insn != if_info->jump; insn = NEXT_INSN (insn)) in noce_get_alt_condition()
2533 rtx_insn *earliest, *seq; in noce_try_minmax() local
2547 cond = noce_get_alt_condition (if_info, if_info->a, &earliest); in noce_try_minmax()
2619 if_info->cond_earliest = earliest; in noce_try_minmax()
2634 rtx_insn *earliest, *seq; in noce_try_abs() local
[all …]
H A Dmodulo-sched.cc1916 int earliest = p_st + e->latency - (e->distance * ii); in get_sched_window() local
1922 "", earliest, "", latest, p_st); in get_sched_window()
1927 early_start = MAX (early_start, earliest); in get_sched_window()
1944 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); in get_sched_window() local
1950 earliest, "", latest, "", s_st); in get_sched_window()
1955 start = MAX (start, earliest); in get_sched_window()
H A Dearly-remat.cc332 unsigned int earliest; member
1112 ec->earliest = cand1_index; in record_equiv_candidates()
1332 return ec->earliest; in resolve_reaching_def()
H A Dhaifa-sched.cc4840 int earliest = INSN_TICK (insn); in estimate_insn_tick() local
4864 if (earliest == INVALID_TICK || t > earliest) in estimate_insn_tick()
4865 earliest = t; in estimate_insn_tick()
4869 INSN_TICK_ESTIMATE (insn) = earliest; in estimate_insn_tick()
/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dlcm.c171 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()
419 compute_earliest (edge_list, n_exprs, antin, antout, avout, kill, earliest); in pre_edge_lcm_avs()
[all …]
H A Dipa-split.c1003 int earliest; variable
1049 first.earliest = INT_MAX; in find_split_points()
1074 if (pos <= entry->earliest && !entry->can_split in find_split_points()
1079 if (pos <= entry->earliest && entry->can_split) in find_split_points()
1130 new_entry.earliest = INT_MAX; in find_split_points()
1142 && (intptr_t)dest->aux < entry->earliest) in find_split_points()
1143 entry->earliest = (intptr_t)dest->aux; in find_split_points()
1160 if (prev->earliest > entry->earliest) in find_split_points()
1161 prev->earliest = entry->earliest; in find_split_points()
H A Difcvt.c2358 rtx_insn **earliest) in noce_get_alt_condition() argument
2367 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
2480 *earliest = if_info->cond_earliest; in noce_get_alt_condition()
2486 earliest, target, have_cbranchcc4, true); in noce_get_alt_condition()
2494 for (insn = if_info->jump; insn != *earliest; insn = PREV_INSN (insn)) in noce_get_alt_condition()
2499 for (insn = *earliest; insn != if_info->jump; insn = NEXT_INSN (insn)) in noce_get_alt_condition()
2514 rtx_insn *earliest, *seq; in noce_try_minmax() local
2528 cond = noce_get_alt_condition (if_info, if_info->a, &earliest); in noce_try_minmax()
2600 if_info->cond_earliest = earliest; in noce_try_minmax()
2615 rtx_insn *earliest, *seq; in noce_try_abs() local
[all …]
H A Dmodulo-sched.c1915 int earliest = p_st + e->latency - (e->distance * ii); in get_sched_window() local
1921 "", earliest, "", latest, p_st); in get_sched_window()
1926 early_start = MAX (early_start, earliest); in get_sched_window()
1943 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); in get_sched_window() local
1949 earliest, "", latest, "", s_st); in get_sched_window()
1954 start = MAX (start, earliest); in get_sched_window()
H A Drtlanal.c5520 rtx_insn **earliest, in canonicalize_condition() argument
5542 if (earliest) in canonicalize_condition()
5543 *earliest = insn; in canonicalize_condition()
5570 if (earliest) in canonicalize_condition()
5571 *earliest = prev; in canonicalize_condition()
5703 if (earliest) in canonicalize_condition()
5704 *earliest = prev; in canonicalize_condition()
5790 get_condition (rtx_insn *jump, rtx_insn **earliest, int allow_cc_mode, in get_condition() argument
5811 return canonicalize_condition (jump, cond, reverse, earliest, NULL_RTX, in get_condition()
H A Dearly-remat.c332 unsigned int earliest; member
1112 ec->earliest = cand1_index; in record_equiv_candidates()
1332 return ec->earliest; in resolve_reaching_def()
H A Dhaifa-sched.c4838 int earliest = INSN_TICK (insn); in estimate_insn_tick() local
4862 if (earliest == INVALID_TICK || t > earliest) in estimate_insn_tick()
4863 earliest = t; in estimate_insn_tick()
4867 INSN_TICK_ESTIMATE (insn) = earliest; in estimate_insn_tick()
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/
H A DERR_get_error.pod31 ERR_get_error() returns the earliest error code from the thread's error
35 ERR_peek_error() returns the earliest error code from the thread's
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/
H A DERR_get_error.pod54 ERR_get_error() returns the earliest error code from the thread's error
58 ERR_peek_error() returns the earliest error code from the thread's
/netbsd-src/external/mit/libuv/dist/docs/src/guide/
H A Deventloops.rst13 ``uv_stop()`` can be used to stop an event loop. The earliest the loop will
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/
H A Ddarwin.opt71 The earliest macOS version on which this program will run.
110 The earliest macOS version on which this program will run (formatted for the assembler).
/netbsd-src/external/gpl3/gcc/dist/gcc/config/
H A Ddarwin.opt75 The earliest macOS version on which this program will run.
114 The earliest macOS version on which this program will run (formatted for the assembler).
/netbsd-src/usr.bin/compress/doc/
H A DNOTES64 engineer can tell you. (Chemical processes were among the earliest patents,
/netbsd-src/external/bsd/openldap/dist/doc/guide/admin/
H A Dlimits.sdf35 This feature has been present since the earliest version of X.500.
/netbsd-src/external/mpl/bind/dist/doc/arm/
H A Dintro-dns-bind.inc.rst22 …names rather than seemingly endless strings of network address digits. The earliest ARPANET systems
/netbsd-src/external/gpl2/rcs/dist/
H A DNEWS415 Add ways to specify the earliest revision, the most recent revision,
416 the earliest or latest revision on a particular branch, and
/netbsd-src/external/gpl3/gcc.old/dist/gcc/config/c6x/
H A Dc6x.c5402 int earliest = 0; in bb_earliest_end_cycle() local
5418 if (earliest < this_clock + cycles) in bb_earliest_end_cycle()
5419 earliest = this_clock + cycles; in bb_earliest_end_cycle()
5421 return earliest; in bb_earliest_end_cycle()
/netbsd-src/external/gpl3/gcc/dist/gcc/config/c6x/
H A Dc6x.cc5404 int earliest = 0; in bb_earliest_end_cycle() local
5420 if (earliest < this_clock + cycles) in bb_earliest_end_cycle()
5421 earliest = this_clock + cycles; in bb_earliest_end_cycle()
5423 return earliest; in bb_earliest_end_cycle()

123