Lines Matching refs:index
92 s16 index;
154 int index;
184 * and returned the index of the next entry.
187 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
202 xad = &p->xad[index];
234 * btstack contains (bn, index) of search path traversed to the entry.
248 int base, index, lim, btindex;
270 * greater than K so that the returned index is the position of
291 (index = jfs_ip->btindex) <
293 xad = &p->xad[index];
306 index++;
307 if (index <
333 /* (index == p->header.nextindex);
342 * if hit, return index of the entry found, and
360 btsp->index = index;
364 jfs_ip->btindex = index;
381 index = base + (lim >> 1);
383 XT_CMP(cmp, xoff, &p->xad[index], t64);
407 btsp->index = index;
412 if (index == btindex ||
413 index == btindex + 1)
417 jfs_ip->btindex = index;
424 if (index < le16_to_cpu(p->header.nextindex)-1)
425 next = offsetXAD(&p->xad[index + 1]);
430 base = index + 1;
438 * base is the smallest index with key (Kj) greater than
439 * search key (K) and may be zero or maxentry index.
465 btsp->index = base;
488 index = base ? base - 1 : base;
500 /* push (bn, index) of the parent page/entry */
506 BT_PUSH(btstack, bn, index);
509 bn = addressXAD(&p->xad[index]);
543 xtpage_t *p; /* base B+-tree index page */
545 int index, nextindex;
560 * pinned, index at which to insert).
561 * n.b. xtSearch() may return index of maxentry of
568 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
583 if (index > XTENTRYSTART) {
584 xad = &p->xad[index - 1];
610 split.index = index;
640 if (index < nextindex)
641 memmove(&p->xad[index + 1], &p->xad[index],
642 (nextindex - index) * sizeof(xad_t));
645 xad = &p->xad[index];
648 /* advance next available entry index */
656 (xtlck->lwm.offset) ? min(index,
657 (int)xtlck->lwm.offset) : index;
698 int skip; /* index of entry of insertion */
699 int nextindex; /* next available entry index of p */
728 skip = split->index;
739 /* advance next available entry index */
757 * allocate new index blocks to cover index page split(s)
805 * of (bn of parent page, index of child page entry in parent page)
840 * The new key entry goes ONE AFTER the index of parent entry,
843 skip = parent->index + 1;
855 split->index = skip; /* index at insert */
908 /* advance next available entry index. */
1040 skip = split->index;
1120 * skip index in old split/left page - insert into left page:
1148 * skip index in new right page - insert into right page:
1290 * (skip index in the new right page will not change)
1292 skip = split->index;
1367 xtpage_t *p; /* base B+-tree index page */
1369 int index, nextindex, len;
1384 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1393 xad = &p->xad[index];
1433 split.index = index + 1;
1475 xad = &p->xad[index + 1];
1478 /* advance next available entry index */
1483 xad = &p->xad[index];
1496 (xtlck->lwm.offset) ? min(index,
1497 (int)xtlck->lwm.offset) : index;
1530 xtpage_t *p; /* base B+-tree index page */
1532 int index, nextindex, llen, rlen;
1551 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1561 if (index != nextindex - 1) {
1578 xad = &p->xad[index];
1599 split.index = index + 1;
1641 xad = &p->xad[index + 1];
1644 /* advance next available entry index */
1649 xad = &p->xad[index];
1665 pxdlock->index = 1;
1680 min(index, (int)xtlck->lwm.offset) : index;
1710 xtpage_t *p; /* base B+-tree index page */
1712 int index0, index, newindex, nextindex;
1765 index = index0;
1766 newindex = index + 1;
1796 if (index == XTENTRYSTART)
1800 lxad = &p->xad[index - 1];
1807 index0 = index - 1;
1827 if (index < nextindex - 1)
1828 memmove(&p->xad[index], &p->xad[index + 1],
1829 (nextindex - index -
1836 index = index0;
1837 newindex = index + 1;
1871 rxad = &p->xad[index + 1];
1896 memmove(&p->xad[index], &p->xad[index + 1],
1897 (nextindex - index - 1) << L2XTSLOTSIZE);
1924 xad = &p->xad[index];
1932 split.index = newindex;
1989 /* advance next available entry index. */
2029 index0 = index = newindex;
2031 index++;
2033 newindex = index + 1;
2055 if (index0 != index) {
2058 "xtUpdate: unexpected value of index");
2072 xad = &p->xad[index];
2086 split.index = newindex;
2133 /* advance next available entry index. */
2178 xtpage_t *p; /* base B+-tree index page */
2180 int index, nextindex;
2201 * pinned, index at which to insert).
2202 * n.b. xtSearch() may return index of maxentry of
2209 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2235 * allocate new index blocks to cover index page split(s)
2266 split.index = index;
2302 xad = &p->xad[index];
2305 /* advance next available entry index */
2309 (xtlck->lwm.offset) ? min(index,(int) xtlck->lwm.offset) : index;
2348 int index, nextindex;
2358 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2386 (xtlck->lwm.offset) ? min(index, xtlck->lwm.offset) : index;
2389 if (index < nextindex - 1)
2390 memmove(&p->xad[index], &p->xad[index + 1],
2391 (nextindex - index - 1) * sizeof(xad_t));
2417 int index, nextindex;
2455 * propagate page deletion up the index tree
2468 index = parent->index;
2520 (xtlck->lwm.offset) ? min(index,
2522 offset) : index;
2527 if (index < nextindex - 1)
2528 memmove(&p->xad[index], &p->xad[index + 1],
2529 (nextindex - index -
2534 (ulong) parent->bn, index);
2569 xtpage_t *p, *pp, *rp, *lp; /* base B+-tree index page */
2580 int index;
2609 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2617 xad = &pp->xad[index];
2630 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2639 xad = &pp->xad[index];
2713 XT_GETSEARCH(ip, btstack.top, bn, pmp, pp, index);
2844 pxdlock->index = 1;
2859 xad = &pp->xad[index];
2863 xtlck->lwm.offset = min(index, xtlck->lwm.offset);
2888 * btstack contains (bn, index) of search path traversed to the entry.
2902 int base, index, lim;
2922 * greater than K so that the returned index is the position of
2944 index = base + (lim >> 1);
2946 XT_CMP(cmp, xoff, &p->xad[index], t64);
2953 if (xaddr == addressXAD(&p->xad[index]) &&
2954 xoff == offsetXAD(&p->xad[index])) {
2960 btsp->index = index;
2971 base = index + 1;
2979 * base is the smallest index with key (Kj) greater than
2980 * search key (K) and may be zero or maxentry index.
2984 index = base ? base - 1 : base;
2991 bn = addressXAD(&p->xad[index]);
3138 * 2. truncate index table of directory when last entry removed
3152 * must write LOG_NOREDOPAGE for deleted index page;
3170 int index, nextindex;
3201 xadlock.index = 1;
3215 * free the data blocks from the leaf index blocks.
3216 * delete the parent index entries corresponding to
3217 * the freed child data/index blocks.
3218 * free the index blocks themselves which aren't needed
3221 * index blocks are updated only if the blocks are to be
3223 * if type is PMAP, the data and index pages are NOT
3224 * freed, and the data and index blocks are NOT freed
3226 * (this will allow continued access of data/index of
3250 /* process entries backward from last index */
3251 index = le16_to_cpu(p->header.nextindex) - 1;
3279 xad = &p->xad[index];
3308 for (; index >= XTENTRYSTART; index--) {
3309 xad = &p->xad[index];
3347 if (index == XTENTRYSTART)
3350 nextindex = index;
3368 min(index, (int)xtlck->lwm.offset) : index;
3369 xtlck->lwm.length = index + 1 -
3371 xtlck->twm.offset = index;
3391 nextindex = index + 1;
3403 nextindex = index + 1;
3488 index = parent->index;
3495 if (index < le16_to_cpu(p->header.nextindex) - 1) {
3513 xadlock.xdlist = &p->xad[index + 1];
3516 index - 1;
3522 p->header.nextindex = cpu_to_le16(index + 1);
3531 nfreed += lengthXAD(&p->xad[index]);
3571 if (index == XTENTRYSTART) {
3639 index--;
3657 BT_PUSH(&btstack, bn, index);
3660 xad = &p->xad[index];
3724 int index;
3750 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
3774 /* process entries backward from last index */
3775 index = le16_to_cpu(p->header.nextindex) - 1;
3790 xad = &p->xad[index];
3799 xtlck->hwm.offset = index;
3819 index = parent->index;
3824 if (index == XTENTRYSTART) {
3847 index--;
3858 BT_PUSH(&btstack, bn, index);
3861 xad = &p->xad[index];