HomeSort by: relevance | last modified time | path
    Searched refs:sort_time (Results 1 - 5 of 5) sorted by relevancy

  /src/external/mpl/dhcp/dist/server/
leasechain.c 165 if ((lc->list[mid_index]->sort_time > lp->sort_time) ||
166 ((lc->list[mid_index]->sort_time == lp->sort_time) &&
169 /* insert in the min position, as sort_time is larger */
175 } else if ((lc->list[mid_index]->sort_time < lp->sort_time) ||
176 ((lc->list[mid_index]->sort_time == lp->sort_time) &&
179 /* insert in mid_index + 1 as sort_time is smaller *
    [all...]
mdb.c 1442 comp -> sort_time != MIN_TIME &&
1443 comp -> sort_time > cur_time &&
1444 (comp -> sort_time < comp -> pool -> next_event_time ||
1446 comp -> pool -> next_event_time = comp -> sort_time;
1500 (comp->sort_time < cur_time) &&
1990 if (lease->sort_time > cur_time) {
1991 if (lease->sort_time < next_expiry)
1992 next_expiry = lease->sort_time;
2620 * The sort key is comp->sort_time, smaller values are
2636 (last_insert_point->sort_time <= comp->sort_time))
    [all...]
failover.c 1989 l->sort_time = (l->tsfp > l->ends) ?
2003 if (l && (l->sort_time < p->next_event_time)) {
2005 p->next_event_time = l->sort_time;
  /src/external/mpl/dhcp/dist/server/tests/
leaseq_unittest.c 32 * We only care about the sort_time in the lease structure for these
61 test_lease1.sort_time = 10;
127 test_lease[i].sort_time = i;
183 test_lease[i].sort_time = i;
245 test_lease[i].sort_time = i;
305 test_lease[i].sort_time = i;
313 test_lease[0].sort_time = 4;
329 test_lease[1].sort_time = 5;
345 test_lease[2].sort_time = 6;
386 test_lease[i].sort_time = i
    [all...]
  /src/external/mpl/dhcp/dist/includes/
dhcpd.h 568 TIME starts, ends, sort_time; member in struct:lease

Completed in 33 milliseconds