| /src/external/cddl/osnet/dist/lib/libdtrace/common/ |
| 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;
|
| /src/external/gpl3/gcc/dist/gcc/ |
| lcm.cc | 169 /* Compute the earliest vector for edge based lcm. */
174 sbitmap *earliest)
187 bitmap_copy (earliest[x], antin[succ->index]);
191 bitmap_clear (earliest[x]);
197 bitmap_and_or (earliest[x], difference,
234 compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
270 same as EARLIEST for that edge. */
272 bitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]);
312 earliest[(size_t) e->aux],
376 sbitmap *antin, *antout, *earliest;
375 sbitmap *antin, *antout, *earliest; local
[all...] |
| ipa-split.cc | 1023 /* Stack entry index of earliest BB reachable from current BB
1025 int earliest; member in class:stack_entry
1042 The articulation is discovered via DFS walk. We collect earliest
1071 first.earliest = INT_MAX;
1096 if (pos <= entry->earliest && !entry->can_split
1101 if (pos <= entry->earliest && entry->can_split)
1152 new_entry.earliest = INT_MAX;
1162 /* Back edge found, record the earliest point. */
1164 && (intptr_t)dest->aux < entry->earliest)
1165 entry->earliest = (intptr_t)dest->aux
[all...] |
| early-remat.cc | 302 /* The earliest candidate in the block (i.e. the one with the
332 unsigned int earliest; member in struct:__anon13588::remat_equiv_class
496 the earliest member of the class. */
1110 ec->earliest = cand1_index;
1320 earliest instance of that value (i.e. the first one to be added
1330 return ec->earliest;
|
| modulo-sched.cc | 183 /* The earliest absolute cycle of an insn in the partial schedule. */
1793 'ASAP(u)' the earliest time at which u could be scheduled as computed in
1919 int earliest = p_st + e->latency - (e->distance * ii);
1925 "", earliest, "", latest, p_st);
1930 early_start = MAX (early_start, earliest);
1947 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN);
1953 earliest, "", latest, "", s_st);
1958 start = MAX (start, earliest);
1916 int earliest = p_st + e->latency - (e->distance * ii); local
1944 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); local
|
| ifcvt.cc | 841 /* If earliest == jump, or when the condition is complex, try to
1734 /* If earliest == jump, try to build the cmove insn directly.
2413 rtx_insn **earliest)
2422 *earliest = if_info->cond_earliest;
2535 *earliest = if_info->cond_earliest;
2541 earliest, target, have_cbranchcc4, true);
2549 for (insn = if_info->jump; insn != *earliest; insn = PREV_INSN (insn))
2554 for (insn = *earliest; insn != if_info->jump; insn = NEXT_INSN (insn))
2569 rtx_insn *earliest, *seq;
2583 cond = noce_get_alt_condition (if_info, if_info->a, &earliest);
2566 rtx_insn *earliest, *seq; local
2667 rtx_insn *earliest, *seq; local
5698 rtx_insn *earliest = NULL; local
[all...] |
| /src/external/gpl3/gcc.old/dist/gcc/ |
| lcm.cc | 167 /* Compute the earliest vector for edge based lcm. */
172 sbitmap *earliest)
185 bitmap_copy (earliest[x], antin[succ->index]);
189 bitmap_clear (earliest[x]);
195 bitmap_and_or (earliest[x], difference,
232 compute_laterin (struct edge_list *edge_list, sbitmap *earliest,
268 same as EARLIEST for that edge. */
270 bitmap_copy (later[(size_t) e->aux], earliest[(size_t) e->aux]);
311 earliest[(size_t) e->aux],
375 sbitmap *antin, *antout, *earliest;
374 sbitmap *antin, *antout, *earliest; local
[all...] |
| ipa-split.cc | 1020 /* Stack entry index of earliest BB reachable from current BB
1022 int earliest; member in class:stack_entry
1039 The articulation is discovered via DFS walk. We collect earliest
1068 first.earliest = INT_MAX;
1093 if (pos <= entry->earliest && !entry->can_split
1098 if (pos <= entry->earliest && entry->can_split)
1149 new_entry.earliest = INT_MAX;
1159 /* Back edge found, record the earliest point. */
1161 && (intptr_t)dest->aux < entry->earliest)
1162 entry->earliest = (intptr_t)dest->aux
[all...] |
| early-remat.cc | 302 /* The earliest candidate in the block (i.e. the one with the
332 unsigned int earliest; member in struct:__anon16024::remat_equiv_class
496 the earliest member of the class. */
1112 ec->earliest = cand1_index;
1322 earliest instance of that value (i.e. the first one to be added
1332 return ec->earliest;
|
| ifcvt.cc | 840 /* If earliest == jump, or when the condition is complex, try to
1731 /* If earliest == jump, try to build the cmove insn directly.
2380 rtx_insn **earliest)
2389 *earliest = if_info->cond_earliest;
2502 *earliest = if_info->cond_earliest;
2508 earliest, target, have_cbranchcc4, true);
2516 for (insn = if_info->jump; insn != *earliest; insn = PREV_INSN (insn))
2521 for (insn = *earliest; insn != if_info->jump; insn = NEXT_INSN (insn))
2536 rtx_insn *earliest, *seq;
2550 cond = noce_get_alt_condition (if_info, if_info->a, &earliest);
2533 rtx_insn *earliest, *seq; local
2634 rtx_insn *earliest, *seq; local
5502 rtx_insn *earliest = NULL; local
[all...] |
| modulo-sched.cc | 183 /* The earliest absolute cycle of an insn in the partial schedule. */
1793 'ASAP(u)' the earliest time at which u could be scheduled as computed in
1919 int earliest = p_st + e->latency - (e->distance * ii);
1925 "", earliest, "", latest, p_st);
1930 early_start = MAX (early_start, earliest);
1947 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN);
1953 earliest, "", latest, "", s_st);
1958 start = MAX (start, earliest);
1916 int earliest = p_st + e->latency - (e->distance * ii); local
1944 int earliest = (e->data_type == MEM_DEP ? s_st - ii + 1 : INT_MIN); local
|
| /src/external/bsd/ntp/dist/libntp/ |
| ntp_intres.c | 123 time_t earliest; member in struct:blocking_gai_req_tag
149 time_t earliest; member in struct:blocking_gni_req_tag
270 gai_req->earliest = max(now, child_ctx->next_dns_timeslot);
271 child_ctx->next_dns_timeslot = gai_req->earliest;
326 scheduled_sleep(gai_req->scheduled, gai_req->earliest,
547 &gai_req->scheduled, &gai_req->earliest,
663 gni_req->earliest = max(time_now, child_ctx->next_dns_timeslot);
664 child_ctx->next_dns_timeslot = gni_req->earliest;
720 scheduled_sleep(gni_req->scheduled, gni_req->earliest,
844 &gni_req->earliest, &gni_req->retry
[all...] |
| /src/external/bsd/ntp/dist/ntpd/ |
| ntp_proto.c | 3111 * and the earliest time (utemp). The earliest time is 2 s
3113 * sending in a burst, use the earliest time. When not in a
3114 * burst but with a reply pending, send at the earliest time
3118 * scheduled time and the earliest time.
3236 static u_long earliest; local
3316 if (peer->nextdate < earliest) {
3317 peer->nextdate = earliest;
3319 earliest = peer->nextdate + 1;
|
| /src/external/gpl3/gcc/dist/gcc/config/riscv/ |
| riscv-vsetvl.cc | 34 - Phase 2 (earliest fuse global vsetvl infos): The header_info and
36 earliest of each expression is computed. Based on the earliest
889 get_insn ()->bb () == get_bb (). In earliest fusion, we may fuse bb 3 and
2865 sbitmap *earliest = sbitmap_vector_alloc (num_edges, num_exprs); local
2870 earliest);
2874 fprintf (dump_file, "\n Compute LCM earliest insert data (lift %d):\n\n",
2907 fprintf (dump_file, " earliest:\n");
2912 if (bitmap_empty_p (earliest[ed]))
2916 dump_bitmap_file (dump_file, earliest[ed])
[all...] |
| /src/external/gpl3/binutils/dist/gas/config/ |
| tc-xtensa.c | 648 xtensa_setup_hw_workarounds (int earliest, int latest)
650 if (earliest > latest)
654 if (earliest < 105000 || latest < 105000)
964 int earliest, latest = 0;
969 earliest = strtol (arg, &end, 0);
972 latest = earliest;
982 xtensa_setup_hw_workarounds (earliest, latest);
11269 /* Take earliest use of this literal to avoid
963 int earliest, latest = 0; local
|
| /src/external/gpl3/binutils.old/dist/gas/config/ |
| tc-xtensa.c | 648 xtensa_setup_hw_workarounds (int earliest, int latest)
650 if (earliest > latest)
654 if (earliest < 105000 || latest < 105000)
964 int earliest, latest = 0;
969 earliest = strtol (arg, &end, 0);
972 latest = earliest;
982 xtensa_setup_hw_workarounds (earliest, latest);
11269 /* Take earliest use of this literal to avoid
963 int earliest, latest = 0; local
|
