Lines Matching defs:next
104 static int xtSearch(struct inode *ip, s64 xoff, s64 *next, int *cmpp,
144 s64 next, size, xoff, xend;
163 if ((rc = xtSearch(ip, lstart, &next, &cmp, &btstack, 0))) {
172 * and returned the index of the next entry.
182 if (next)
183 *plen = min(next - lstart, llen);
216 * nextp - address of next extent (if any) for search miss
240 s64 next = 0;
293 /* try next sequential entry */
309 next = t64;
355 *nextp = next;
413 next = offsetXAD(&p->xad[index + 1]);
414 goto next;
430 next = offsetXAD(&p->xad[base]);
465 *nextp = next;
481 next:
538 s64 next;
552 if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
560 if ((cmp == 0) || (next && (xlen > next - xoff))) {
636 /* advance next available entry index */
687 int nextindex; /* next available entry index of p */
727 /* advance next available entry index */
896 /* advance next available entry index. */
1023 nextbn = le64_to_cpu(sp->header.next);
1024 rp->header.next = cpu_to_le64(nextbn);
1026 sp->header.next = cpu_to_le64(rbn);
1038 * way next time.
1073 * update previous pointer of old next/right page of <sp>
1084 * acquire a transaction lock on the next page;
1266 rp->header.next = 0;
1466 /* advance next available entry index */
1631 /* advance next available entry index */
1976 /* advance next available entry index. */
2002 bn = le64_to_cpu(p->header.next);
2119 /* advance next available entry index. */
2176 s64 next;
2191 if ((rc = xtSearch(ip, xoff, &next, &cmp, &btstack, XT_INSERT)))
2202 if (next)
2203 xlen = min(xlen, (int)(next - xoff));
2291 /* advance next available entry index */
2716 if (p->header.next) {
2717 nextbn = le64_to_cpu(p->header.next);
2747 lp->header.next = cpu_to_le64(nxaddr);
2953 goto next;
2975 next:
3005 nextbn = le64_to_cpu(p->header.next);
3008 /* update prev pointer of the next page */
3029 /* update next pointer of the previous page */
3038 * action: update next pointer;
3045 p->header.next = le64_to_cpu(nextbn);
3192 * the file between newsize and next page boundary will
3242 * sure that the next pointer is zero.
3244 if (p->header.next) {
3253 p->header.next = 0;
3539 if (tblk->next == lid)
3540 tblk->next = tlck->next;
3542 for (prev = lid_to_tlock(tblk->next);
3543 prev->next != lid;
3544 prev = lid_to_tlock(prev->next)) {
3545 assert(prev->next);
3547 prev->next = tlck->next;
3549 lid_to_tlock(tblk->last)->next = lid;
3550 tlck->next = 0;