Lines Matching refs:index
80 s16 index;
142 int index;
172 * and returned the index of the next entry.
175 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
190 xad = &p->xad[index];
222 * btstack contains (bn, index) of search path traversed to the entry.
236 int base, index, lim, btindex;
258 * greater than K so that the returned index is the position of
279 (index = jfs_ip->btindex) <
281 xad = &p->xad[index];
294 index++;
295 if (index <
321 /* (index == p->header.nextindex);
330 * if hit, return index of the entry found, and
348 btsp->index = index;
352 jfs_ip->btindex = index;
369 index = base + (lim >> 1);
371 XT_CMP(cmp, xoff, &p->xad[index], t64);
395 btsp->index = index;
400 if (index == btindex ||
401 index == btindex + 1)
405 jfs_ip->btindex = index;
412 if (index < le16_to_cpu(p->header.nextindex)-1)
413 next = offsetXAD(&p->xad[index + 1]);
418 base = index + 1;
426 * base is the smallest index with key (Kj) greater than
427 * search key (K) and may be zero or maxentry index.
453 btsp->index = base;
476 index = base ? base - 1 : base;
488 /* push (bn, index) of the parent page/entry */
494 BT_PUSH(btstack, bn, index);
497 bn = addressXAD(&p->xad[index]);
531 xtpage_t *p; /* base B+-tree index page */
533 int index, nextindex;
548 * pinned, index at which to insert).
549 * n.b. xtSearch() may return index of maxentry of
556 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
571 if (index > XTENTRYSTART) {
572 xad = &p->xad[index - 1];
598 split.index = index;
628 if (index < nextindex)
629 memmove(&p->xad[index + 1], &p->xad[index],
630 (nextindex - index) * sizeof(xad_t));
633 xad = &p->xad[index];
636 /* advance next available entry index */
644 (xtlck->lwm.offset) ? min(index,
645 (int)xtlck->lwm.offset) : index;
686 int skip; /* index of entry of insertion */
687 int nextindex; /* next available entry index of p */
716 skip = split->index;
727 /* advance next available entry index */
745 * allocate new index blocks to cover index page split(s)
793 * of (bn of parent page, index of child page entry in parent page)
828 * The new key entry goes ONE AFTER the index of parent entry,
831 skip = parent->index + 1;
843 split->index = skip; /* index at insert */
896 /* advance next available entry index. */
1028 skip = split->index;
1108 * skip index in old split/left page - insert into left page:
1136 * skip index in new right page - insert into right page:
1278 * (skip index in the new right page will not change)
1280 skip = split->index;
1355 xtpage_t *p; /* base B+-tree index page */
1357 int index, nextindex, len;
1372 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1381 xad = &p->xad[index];
1421 split.index = index + 1;
1463 xad = &p->xad[index + 1];
1466 /* advance next available entry index */
1471 xad = &p->xad[index];
1484 (xtlck->lwm.offset) ? min(index,
1485 (int)xtlck->lwm.offset) : index;
1518 xtpage_t *p; /* base B+-tree index page */
1520 int index, nextindex, llen, rlen;
1539 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1549 if (index != nextindex - 1) {
1565 xad = &p->xad[index];
1586 split.index = index + 1;
1628 xad = &p->xad[index + 1];
1631 /* advance next available entry index */
1636 xad = &p->xad[index];
1652 pxdlock->index = 1;
1667 min(index, (int)xtlck->lwm.offset) : index;
1697 xtpage_t *p; /* base B+-tree index page */
1699 int index0, index, newindex, nextindex;
1752 index = index0;
1753 newindex = index + 1;
1783 if (index == XTENTRYSTART)
1787 lxad = &p->xad[index - 1];
1794 index0 = index - 1;
1814 if (index < nextindex - 1)
1815 memmove(&p->xad[index], &p->xad[index + 1],
1816 (nextindex - index -
1823 index = index0;
1824 newindex = index + 1;
1858 rxad = &p->xad[index + 1];
1883 memmove(&p->xad[index], &p->xad[index + 1],
1884 (nextindex - index - 1) << L2XTSLOTSIZE);
1911 xad = &p->xad[index];
1919 split.index = newindex;
1976 /* advance next available entry index. */
2016 index0 = index = newindex;
2018 index++;
2020 newindex = index + 1;
2042 if (index0 != index) {
2044 jfs_error(ip->i_sb, "unexpected value of index\n");
2058 xad = &p->xad[index];
2072 split.index = newindex;
2119 /* advance next available entry index. */
2164 xtpage_t *p; /* base B+-tree index page */
2166 int index, nextindex;
2187 * pinned, index at which to insert).
2188 * n.b. xtSearch() may return index of maxentry of
2195 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2221 * allocate new index blocks to cover index page split(s)
2252 split.index = index;
2288 xad = &p->xad[index];
2291 /* advance next available entry index */
2295 (xtlck->lwm.offset) ? min(index,(int) xtlck->lwm.offset) : index;
2334 int index, nextindex;
2344 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2372 (xtlck->lwm.offset) ? min(index, xtlck->lwm.offset) : index;
2375 if (index < nextindex - 1)
2376 memmove(&p->xad[index], &p->xad[index + 1],
2377 (nextindex - index - 1) * sizeof(xad_t));
2403 int index, nextindex;
2441 * propagate page deletion up the index tree
2454 index = parent->index;
2506 (xtlck->lwm.offset) ? min(index,
2508 offset) : index;
2513 if (index < nextindex - 1)
2514 memmove(&p->xad[index], &p->xad[index + 1],
2515 (nextindex - index -
2520 (ulong) parent->bn, index);
2555 xtpage_t *p, *pp, *rp, *lp; /* base B+-tree index page */
2566 int index;
2595 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2603 xad = &pp->xad[index];
2616 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2625 xad = &pp->xad[index];
2699 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2830 pxdlock->index = 1;
2845 xad = &pp->xad[index];
2849 xtlck->lwm.offset = min(index, xtlck->lwm.offset);
2874 * btstack contains (bn, index) of search path traversed to the entry.
2888 int base, index, lim;
2908 * greater than K so that the returned index is the position of
2930 index = base + (lim >> 1);
2932 XT_CMP(cmp, xoff, &p->xad[index], t64);
2939 if (xaddr == addressXAD(&p->xad[index]) &&
2940 xoff == offsetXAD(&p->xad[index])) {
2946 btsp->index = index;
2957 base = index + 1;
2965 * base is the smallest index with key (Kj) greater than
2966 * search key (K) and may be zero or maxentry index.
2970 index = base ? base - 1 : base;
2977 bn = addressXAD(&p->xad[index]);
3124 * 2. truncate index table of directory when last entry removed
3138 * must write LOG_NOREDOPAGE for deleted index page;
3156 int index, nextindex;
3187 xadlock.index = 1;
3201 * free the data blocks from the leaf index blocks.
3202 * delete the parent index entries corresponding to
3203 * the freed child data/index blocks.
3204 * free the index blocks themselves which aren't needed
3207 * index blocks are updated only if the blocks are to be
3209 * if type is PMAP, the data and index pages are NOT
3210 * freed, and the data and index blocks are NOT freed
3212 * (this will allow continued access of data/index of
3236 /* process entries backward from last index */
3237 index = le16_to_cpu(p->header.nextindex) - 1;
3265 xad = &p->xad[index];
3294 for (; index >= XTENTRYSTART; index--) {
3295 xad = &p->xad[index];
3333 if (index == XTENTRYSTART)
3336 nextindex = index;
3354 min(index, (int)xtlck->lwm.offset) : index;
3355 xtlck->lwm.length = index + 1 -
3357 xtlck->twm.offset = index;
3377 nextindex = index + 1;
3389 nextindex = index + 1;
3474 index = parent->index;
3481 if (index < le16_to_cpu(p->header.nextindex) - 1) {
3499 xadlock.xdlist = &p->xad[index + 1];
3502 index - 1;
3508 p->header.nextindex = cpu_to_le16(index + 1);
3517 nfreed += lengthXAD(&p->xad[index]);
3557 if (index == XTENTRYSTART) {
3625 index--;
3643 BT_PUSH(&btstack, bn, index);
3646 xad = &p->xad[index];
3710 int index;
3736 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
3759 /* process entries backward from last index */
3760 index = le16_to_cpu(p->header.nextindex) - 1;
3775 xad = &p->xad[index];
3784 xtlck->hwm.offset = index;
3804 index = parent->index;
3809 if (index == XTENTRYSTART) {
3832 index--;
3843 BT_PUSH(&btstack, bn, index);
3846 xad = &p->xad[index];