Lines Matching refs:now

80 #define SM_GET_LA(now)	\
83 now = curtime(); \
84 if (Current_LA_time < now - GET_NEW_LA_TIME) \
87 Current_LA_time = now; \
232 /* first entry is a tag, for now just the size */
1313 time_t now;
1321 now = curtime();
1342 if ((runall || Queue[qgrp]->qg_nextrun <= now) && qintvl > 0)
1396 time_t now, minqintvl;
1398 now = curtime();
1410 if (Queue[qgrp]->qg_nextrun <= now - qintvl)
1697 time_t now;
1699 SM_GET_LA(now);
1795 SM_GET_LA(now);
1920 time_t now;
1934 SM_GET_LA(now);
2093 now = curtime();
2105 (Queue[qgrp]->qg_nextrun <= now &&
2209 ** the map. Therefore, close the maps now so the
2257 ** When fork()'d the child now has a private
2412 SM_GET_LA(now);
3013 ** The sort now takes place using all of the items in WorkList.
3234 sm_dprintf("grow_wlist: WorkListSize now %d\n", WorkListSize);
3611 ** the map. Therefore, close the maps now so the
3798 ** the map. Therefore, close the maps now so the
4207 time_t now;
4365 now = curtime();
4366 if (e->e_ntries > 0 && e->e_dtime <= now &&
4367 now < e->e_dtime + MinQueueAge)
4371 howlong = pintvl(now - e->e_dtime, true);
6558 time_t now;
6571 now = curtime();
6572 if (now < nextupdate)
6574 nextupdate = now + FILESYS_UPDATE_INTERVAL;
6589 nextupdate = now + 2; /* let's do this soon again */
6789 time_t now;
6813 now = curtime();
6817 exc = (bool) conn_limits(e, now, addr, SM_CLFL_EXC, occ, ratelimit,
6845 time_t now;
6858 now = curtime();
6862 (void) conn_limits(e, now, addr, SM_CLFL_EXC, occ, -1, -1);
7230 time_t now;
7304 now = curtime();
7306 Queue[i]->qg_nextrun = now;
7521 /* now scan through and assign info from the fields */
7529 /* p now points to field code */
7541 /* p now points to the field body */
7800 ** Take the now defined queue groups and assign them to work groups.
7888 ** We now know the number of work groups to pack the queue groups
8322 /* no splits? return right now. */
8887 /* Check if we actually changed anything or we can just bail now */