Lines Matching refs:nelem
98 return (lc->nelem > 0 ? 1 : 0);
114 INSIST(lc->total >= lc->nelem);
117 if (lc->nelem > 0) {
325 memcpy(p, lc->list, sizeof(struct lease *) * lc->nelem);
355 if (lc->nelem == lc->total) {
361 n, lc->nelem, MDL);
365 if (n < lc->nelem) {
368 n, (lc->nelem-n), MDL);
371 sizeof(struct lease *) * (lc->nelem-n));
380 lc->nelem++;
429 /* not the last element? we've already bumped nelem when linking
430 * into the lease chain so nelem should never be zero here */
431 if (pos < (lc->nelem-1)) {
458 for (i = 0; i < lc->nelem; i++ ) {
466 if (i < lc->nelem - 1) {
510 if (lc->nelem == 0) {
521 if (lp->sort_time > lc->list[lc->nelem-1]->sort_time) {
524 pos = lc->nelem;
525 } else if (lp->sort_time == lc->list[lc->nelem-1]->sort_time) {
527 if (lc->list[lc->nelem-1]->sort_tiebreaker < LONG_MAX)
529 lc->list[lc->nelem-1]->sort_tiebreaker+1;
532 pos = lc->nelem;
536 pos = lc_binary_search_insert_point(lc, lp, 0, lc->nelem - 1);
544 pos, lc->nelem, MDL);
566 INSIST(n < lc->nelem);
576 if ((lc->nelem-1) > n) {
578 sizeof(struct lease *) * (lc->nelem-1-n));
580 lc->nelem--;
642 size_t pos = lc_binary_search_lease(lc, lp, 0, lc->nelem-1);
667 if (lc->nelem > 0) {
669 for (i = lc->nelem - 1; ; i--) {
684 lc->nelem = 0;