Lines Matching refs: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),
2451 nextbn = le64_to_cpu(p->header.next);
2454 /* update prev pointer of the next page */
2462 * acquire a transaction lock on the next page
2483 /* update next pointer of the previous page */
2493 * action: update next pointer;
2508 p->header.next = cpu_to_le64(nextbn);
2594 f->next = fsi;
2595 f->next = -1;
2678 * function to determine next variable-sized jfs_dirent in buffer
2698 * of next jfs_readdir()/dtRead()
2717 int i, next;
2950 next = d->next;
2951 while (next >= 0) {
2952 t = (struct dtslot *) & p->slot[next];
2969 next = t->next;
2980 /* Point to next leaf page */
2984 bn = le64_to_cpu(p->header.next);
3107 * start with 1st entry of next leaf page;
3151 /* start with 1st entry of next leaf page */
3163 /* start after next leaf page ? */
3169 bn = le64_to_cpu(p->header.next);
3201 /* get next parent page address */
3202 bn = le64_to_cpu(p->header.next);
3213 /* get next parent page */
3240 * start with 1st entry of next leaf page
3243 bn = le64_to_cpu(p->header.next);
3254 /* get next leaf page */
3259 /* start with 1st entry of next leaf page */
3315 si = ih->next;
3331 /* compare with next name segment */
3342 si = t->next;
3398 si = lh->next;
3411 si = ih->next;
3434 /* compare with next name segment */
3452 si = t->next;
3553 si = lh->next;
3562 si = ih->next;
3580 /* get next segment */
3587 si = t->next;
3623 p->header.freelist = h->next;
3636 lh->next = h->next;
3651 ih->next = h->next;
3671 p->header.freelist = t->next;
3674 /* is next slot contiguous ? */
3711 lh->next = -1;
3713 ih->next = -1;
3716 t->next = -1;
3745 /* advance next available entry index of stbl */
3762 int ssi, next; /* src slot index */
3798 /* is next slot contiguous ? */
3838 next = slh->next;
3840 /* update dst head/only segment next field */
3842 dlh->next = dsi;
3850 next = sih->next;
3853 dih->next = dsi;
3857 s->next = sfsi;
3869 while ((ssi = next) >= 0) {
3870 /* is next slot contiguous ? */
3890 /* get next source segment */
3893 /* get next destination free slot */
3904 d->next = dsi;
3907 next = s->next;
3908 s->next = sfsi;
3919 dlh->next = -1;
3921 dih->next = -1;
3924 d->next = -1;
3954 * (even though last/only segment next field is modified,
3983 si = ((struct ldtentry *) t)->next;
3985 si = ((struct idtentry *) t)->next;
3986 t->next = si;
3994 /* is next slot contiguous ? */
4018 si = t->next;
4028 t->next = p->header.freelist;
4049 * (even though last/only segment next field is modified,
4079 si = ((struct idtentry *) t)->next;
4080 ((struct idtentry *) t)->next = -1;
4089 /* is next slot contiguous ? */
4113 si = t->next;
4125 t->next = p->header.freelist;
4159 si = t->next;
4163 /* is next slot contiguous ? */
4185 si = t->next;