Lines Matching defs:next
75 * if (next entry satisfies case-insensitive match)
483 static void free_index(tid_t tid, struct inode *ip, u32 index, u32 next)
496 dirtab_slot->addr2 = cpu_to_le32(next);
1165 * the entire key must be retained for the next-to-leftmost
1190 /* next to leftmost entry of
1403 nextbn = le64_to_cpu(sp->header.next);
1404 rp->header.next = cpu_to_le64(nextbn);
1406 sp->header.next = cpu_to_le64(rbn);
1434 * way next time.
1451 f->next = fsi;
1452 f->next = -1;
1476 * acquire a transaction lock on the next page
1504 * <nxt> traces the next entry to move to rp
1505 * <off> traces the next entry to stay in sp
1534 ++nxt; /* advance to next entry to move in sp */
1568 f->next = fsi;
1569 f->next = -1;
1780 f->next = last;
1793 f->next = fsi;
1794 f->next = -1;
1803 fsi = f->next;
1806 f->next = n;
1932 rp->header.next = 0;
1965 f->next = fsi;
1966 f->next = -1;
1977 fsi = f->next;
1980 f->next = n;
2041 s->next = -1;
2054 f->next = fsi;
2055 f->next = -1;
2106 * We need to find put the index of the next entry into the
2119 || (p->header.next == 0))
2122 /* Read next leaf page */
2123 DT_GETPAGE(ip, le64_to_cpu(p->header.next),
2490 if (p->header.next) {
2491 nextbn = le64_to_cpu(p->header.next);
2528 lp->header.next = cpu_to_le64(nxaddr);
2710 if (p->header.next)
2711 bn = le64_to_cpu(p->header.next);
2749 nextbn = le64_to_cpu(p->header.next);
2752 /* update prev pointer of the next page */
2760 * acquire a transaction lock on the next page
2781 /* update next pointer of the previous page */
2791 * action: update next pointer;
2806 p->header.next = cpu_to_le64(nextbn);
2892 f->next = fsi;
2893 f->next = -1;
2976 * function to determine next variable-sized jfs_dirent in buffer
2996 * of next jfs_readdir()/dtRead()
3015 int i, next;
3248 next = d->next;
3249 while (next >= 0) {
3250 t = (struct dtslot *) & p->slot[next];
3267 next = t->next;
3278 /* Point to next leaf page */
3282 bn = le64_to_cpu(p->header.next);
3405 * start with 1st entry of next leaf page;
3449 /* start with 1st entry of next leaf page */
3461 /* start after next leaf page ? */
3467 bn = le64_to_cpu(p->header.next);
3499 /* get next parent page address */
3500 bn = le64_to_cpu(p->header.next);
3511 /* get next parent page */
3538 * start with 1st entry of next leaf page
3541 bn = le64_to_cpu(p->header.next);
3552 /* get next leaf page */
3557 /* start with 1st entry of next leaf page */
3613 si = ih->next;
3629 /* compare with next name segment */
3640 si = t->next;
3696 si = lh->next;
3709 si = ih->next;
3732 /* compare with next name segment */
3750 si = t->next;
3851 si = lh->next;
3860 si = ih->next;
3878 /* get next segment */
3885 si = t->next;
3921 p->header.freelist = h->next;
3934 lh->next = h->next;
3949 ih->next = h->next;
3969 p->header.freelist = t->next;
3972 /* is next slot contiguous ? */
4009 lh->next = -1;
4011 ih->next = -1;
4014 t->next = -1;
4043 /* advance next available entry index of stbl */
4060 int ssi, next; /* src slot index */
4096 /* is next slot contiguous ? */
4136 next = slh->next;
4138 /* update dst head/only segment next field */
4140 dlh->next = dsi;
4148 next = sih->next;
4151 dih->next = dsi;
4155 s->next = sfsi;
4167 while ((ssi = next) >= 0) {
4168 /* is next slot contiguous ? */
4188 /* get next source segment */
4191 /* get next destination free slot */
4202 d->next = dsi;
4205 next = s->next;
4206 s->next = sfsi;
4217 dlh->next = -1;
4219 dih->next = -1;
4222 d->next = -1;
4252 * (even though last/only segment next field is modified,
4281 si = ((struct ldtentry *) t)->next;
4283 si = ((struct idtentry *) t)->next;
4284 t->next = si;
4292 /* is next slot contiguous ? */
4316 si = t->next;
4326 t->next = p->header.freelist;
4347 * (even though last/only segment next field is modified,
4377 si = ((struct idtentry *) t)->next;
4378 ((struct idtentry *) t)->next = -1;
4387 /* is next slot contiguous ? */
4411 si = t->next;
4423 t->next = p->header.freelist;
4457 si = t->next;
4461 /* is next slot contiguous ? */
4483 si = t->next;