Lines Matching defs:last

654 static const char last_fmt[] =		"last.%d";
757 * We keep track of the last error reported by the system internally
2573 ctl_putcal(sys_var[CS_REVTIME].text, &(cp->last));
3746 * reslist, and ifstats responses, the first and last rows are spiced
3817 ctl_putts(tag, &mon->last);
3861 * a close approximation of the MRU list at the point in time the last
3869 * after the first request is supplied as a series of last seen
3889 * in that case the #.last timestamp can be zero.
3903 * last.0= 0x-prefixed hex l_fp timestamp of newest entry
3907 * last.1= timestamp of 2nd newest entry client has.
3911 * ntpq provides as many last/addr pairs as will fit in a single request
3916 * referred to by last.0 and addr.0, if the "0" entry has not been
3918 * next entry newer than referred to by last.1 and addr.1, and so on.
3925 * last.older= hex l_fp timestamp matching one of the input
3926 * .last timestamps, which entry now precedes the
3928 * addr.older= text of address corresponding to older.last.
3935 * last.# hex l_fp timestamp of last receipt
3958 * last.newest= hex l_fp identical to last.# of the prior
3988 l_fp last[16];
3989 sockaddr_u addr[COUNTOF(last)];
4025 for (i = 0; i < COUNTOF(last); i++) {
4042 ZERO(last);
4083 (size_t)si < COUNTOF(last)) {
4086 last[si].l_ui = ui;
4087 last[si].l_uf = uf;
4094 if (last[si].l_ui && last[si].l_uf && si == priors)
4147 if (L_ISEQU(&mon->last, &last[i]))
4162 ctl_putts("last.older", &mon->last);
4194 if (maxlstint > 0 && now.l_ui - mon->last.l_ui >
4215 /* if any entries were returned confirm the last */
4217 ctl_putts("last.newest", &prior_mon->last);
4763 * guy last set his trap. Set the trap type based on this.