| /freebsd-9.3-release/cddl/contrib/opensolaris/lib/libdtrace/common/ |
| H A D | dt_work.c | 53 hrtime_t earliest = INT64_MAX; local
72 if (*((hrtime_t *)a) + interval < earliest)
73 earliest = *((hrtime_t *)a) + interval;
80 if (earliest < now) {
86 tv.tv_sec = (earliest - now) / NANOSEC;
87 tv.tv_nsec = (earliest - now) % NANOSEC;
96 earliest -= now;
98 tv.tv_sec += earliest / NANOSEC;
99 tv.tv_nsec += earliest % NANOSEC;
|
| /freebsd-9.3-release/contrib/gcc/ |
| H A D | lcm.c | 178 /* Compute the earliest vector for edge based lcm. */
183 sbitmap *earliest)
199 sbitmap_copy (earliest[x], antin[succ->index]);
203 sbitmap_zero (earliest[x]);
209 sbitmap_a_and_b_or_c (earliest[x], difference,
249 compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
287 sbitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]);
322 earliest[(size_t) e->aux],
384 sbitmap *antin, *antout, *earliest;
426 earliest
180 compute_earliest(struct edge_list *edge_list, int n_exprs, sbitmap *antin, sbitmap *antout, sbitmap *avout, sbitmap *kill, sbitmap *earliest) argument
248 compute_laterin(struct edge_list *edge_list, sbitmap *earliest, sbitmap *antloc, sbitmap *later, sbitmap *laterin) argument
383 sbitmap *antin, *antout, *earliest; local
[all...] |
| H A D | ifcvt.c | 638 /* If earliest == jump, or when the condition is complex, try to
1189 /* If earliest == jump, try to build the cmove insn directly.
1482 rtx *earliest)
1490 *earliest = if_info->cond_earliest;
1597 *earliest = if_info->cond_earliest;
1603 earliest, target, false, true);
1611 for (insn = if_info->jump; insn != *earliest; insn = PREV_INSN (insn))
1616 for (insn = *earliest; insn != if_info->jump; insn = NEXT_INSN (insn))
1630 rtx cond, earliest, target, seq;
1645 cond = noce_get_alt_condition (if_info, if_info->a, &earliest);
1478 noce_get_alt_condition(struct noce_if_info *if_info, rtx target, rtx *earliest) argument
1627 rtx cond, earliest, target, seq; local
1724 rtx cond, earliest, target, seq, a, b, c; local
2017 noce_get_condition(rtx jump, rtx *earliest) argument
3565 rtx head, end, jump, earliest = NULL_RTX, old_dest, new_label = NULL_RTX; local
[all...] |
| H A D | rtlanal.c | 4345 If EARLIEST is nonzero, it is a pointer to a place where the earliest
4359 canonicalize_condition (rtx insn, rtx cond, int reverse, rtx *earliest,
4381 if (earliest)
4382 *earliest = insn;
4410 if (earliest)
4411 *earliest = prev;
4539 if (earliest)
4540 *earliest = prev;
4611 If EARLIEST is nonzero, it is a pointer to a place where the earliest
4623 get_condition (rtx jump, rtx *earliest, in
4333 canonicalize_condition(rtx insn, rtx cond, int reverse, rtx *earliest, rtx want_reg, int allow_cc_mode, int valid_at_insn_p) argument
4597 get_condition(rtx jump, rtx *earliest, int allow_cc_mode, int valid_at_insn_p) argument
[all...] |
| /freebsd-9.3-release/contrib/ntp/libntp/ |
| H A D | ntp_intres.c | 127 time_t earliest; member in struct:blocking_gai_req_tag
153 time_t earliest; member in struct:blocking_gni_req_tag
274 gai_req->earliest = max(now, child_ctx->next_dns_timeslot);
275 child_ctx->next_dns_timeslot = gai_req->earliest;
330 scheduled_sleep(gai_req->scheduled, gai_req->earliest,
551 &gai_req->scheduled, &gai_req->earliest,
667 gni_req->earliest = max(time_now, child_ctx->next_dns_timeslot);
668 child_ctx->next_dns_timeslot = gni_req->earliest;
724 scheduled_sleep(gni_req->scheduled, gni_req->earliest,
848 &gni_req->earliest,
1009 scheduled_sleep( time_t scheduled, time_t earliest, dnsworker_ctx * worker_ctx ) argument
[all...] |