SBT_MAX
tr->deadline = SBT_MAX;
tr->deadline = SBT_MAX;
tr->deadline = SBT_MAX;
if (tr->deadline == SBT_MAX)
if (tr->deadline == SBT_MAX)
tr->deadline = SBT_MAX;
tr->deadline = SBT_MAX;
state->nextcall = state->nextcallopt = SBT_MAX;
state->nextevent = SBT_MAX;
state->nextcall = SBT_MAX;
state->nextcallopt = SBT_MAX;
if (asbt <= SBT_MAX - rsbt)
if (data > (SBT_MAX / SBT_1S))
return (SBT_MAX);
if (secs > (SBT_MAX / SBT_1S))
return (SBT_MAX);
if (secs > (SBT_MAX / SBT_1S))
return (SBT_MAX);
if (secs > (SBT_MAX / SBT_1S))
return (SBT_MAX);
cc->cc_firstevent = SBT_MAX;
if (SBT_MAX - c->c_time < c->c_precision)
c->c_precision = SBT_MAX - c->c_time;
if (SBT_MAX - to_sbt < sbt)
to_sbt = SBT_MAX;
if (bt.sec >= (SBT_MAX >> 32)) {
if (asbt <= SBT_MAX - rsbt)
if (asbt <= SBT_MAX - rsbt)
next = now > SBT_MAX - interval ? SBT_MAX : now + interval;
val = SBT_MAX;
tln->tln_expiretime = SBT_MAX;
if (cur_tln->tln_expiretime == SBT_MAX) {
tp->t_timers[i] = SBT_MAX;
if (tp->t_timers[which] != SBT_MAX) \
for (i = 0, rv = TT_N, after = before = SBT_MAX; i < TT_N; i++) {
tp->t_timers[which] = SBT_MAX;
tp->t_timers[which] = SBT_MAX;
return (tp->t_timers[which] != SBT_MAX);
tp->t_timers[i] = SBT_MAX;
if (_ts.tv_sec > SBT_MAX >> 32)
return (SBT_MAX);
if (_ts.tv_sec < -(SBT_MAX >> 32) - 1)
return (-SBT_MAX - 1);
if (_tv.tv_sec > SBT_MAX >> 32)
return (SBT_MAX);
if (_tv.tv_sec < -(SBT_MAX >> 32) - 1)
return (-SBT_MAX - 1);