Lines Matching defs:index
80 s16 index;
131 int index;
161 * and returned the index of the next entry.
164 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
179 xad = &p->xad[index];
211 * btstack contains (bn, index) of search path traversed to the entry.
225 int base, index, lim, btindex;
247 * greater than K so that the returned index is the position of
268 (index = jfs_ip->btindex) <
270 xad = &p->xad[index];
283 index++;
284 if (index <
310 /* (index == p->header.nextindex);
319 * if hit, return index of the entry found, and
337 btsp->index = index;
341 jfs_ip->btindex = index;
358 index = base + (lim >> 1);
360 XT_CMP(cmp, xoff, &p->xad[index], t64);
384 btsp->index = index;
389 if (index == btindex ||
390 index == btindex + 1)
394 jfs_ip->btindex = index;
401 if (index < le16_to_cpu(p->header.nextindex)-1)
402 next = offsetXAD(&p->xad[index + 1]);
407 base = index + 1;
415 * base is the smallest index with key (Kj) greater than
416 * search key (K) and may be zero or maxentry index.
442 btsp->index = base;
465 index = base ? base - 1 : base;
477 /* push (bn, index) of the parent page/entry */
483 BT_PUSH(btstack, bn, index);
486 bn = addressXAD(&p->xad[index]);
520 xtpage_t *p; /* base B+-tree index page */
522 int index, nextindex;
537 * pinned, index at which to insert).
538 * n.b. xtSearch() may return index of maxentry of
545 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
560 if (index > XTENTRYSTART) {
561 xad = &p->xad[index - 1];
587 split.index = index;
617 if (index < nextindex)
618 memmove(&p->xad[index + 1], &p->xad[index],
619 (nextindex - index) * sizeof(xad_t));
622 xad = &p->xad[index];
625 /* advance next available entry index */
633 (xtlck->lwm.offset) ? min(index,
634 (int)xtlck->lwm.offset) : index;
675 int skip; /* index of entry of insertion */
676 int nextindex; /* next available entry index of p */
705 skip = split->index;
716 /* advance next available entry index */
734 * allocate new index blocks to cover index page split(s)
782 * of (bn of parent page, index of child page entry in parent page)
817 * The new key entry goes ONE AFTER the index of parent entry,
820 skip = parent->index + 1;
832 split->index = skip; /* index at insert */
885 /* advance next available entry index. */
1017 skip = split->index;
1097 * skip index in old split/left page - insert into left page:
1125 * skip index in new right page - insert into right page:
1267 * (skip index in the new right page will not change)
1269 skip = split->index;
1344 xtpage_t *p; /* base B+-tree index page */
1346 int index, nextindex, len;
1361 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
1370 xad = &p->xad[index];
1410 split.index = index + 1;
1452 xad = &p->xad[index + 1];
1455 /* advance next available entry index */
1460 xad = &p->xad[index];
1473 (xtlck->lwm.offset) ? min(index,
1474 (int)xtlck->lwm.offset) : index;
1503 xtpage_t *p; /* base B+-tree index page */
1505 int index0, index, newindex, nextindex;
1558 index = index0;
1559 newindex = index + 1;
1569 if (index == XTENTRYSTART)
1573 lxad = &p->xad[index - 1];
1580 index0 = index - 1;
1600 if (index < nextindex - 1)
1601 memmove(&p->xad[index], &p->xad[index + 1],
1602 (nextindex - index -
1609 index = index0;
1610 newindex = index + 1;
1644 rxad = &p->xad[index + 1];
1669 memmove(&p->xad[index], &p->xad[index + 1],
1670 (nextindex - index - 1) << L2XTSLOTSIZE);
1696 xad = &p->xad[index];
1704 split.index = newindex;
1761 /* advance next available entry index. */
1801 index0 = index = newindex;
1803 index++;
1805 newindex = index + 1;
1827 if (index0 != index) {
1829 jfs_error(ip->i_sb, "unexpected value of index\n");
1843 xad = &p->xad[index];
1857 split.index = newindex;
1904 /* advance next available entry index. */
1949 xtpage_t *p; /* base B+-tree index page */
1951 int index, nextindex;
1972 * pinned, index at which to insert).
1973 * n.b. xtSearch() may return index of maxentry of
1980 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2006 * allocate new index blocks to cover index page split(s)
2037 split.index = index;
2073 xad = &p->xad[index];
2076 /* advance next available entry index */
2080 (xtlck->lwm.offset) ? min(index,(int) xtlck->lwm.offset) : index;
2163 * 2. truncate index table of directory when last entry removed
2177 * must write LOG_NOREDOPAGE for deleted index page;
2195 int index, nextindex;
2226 xadlock.index = 1;
2240 * free the data blocks from the leaf index blocks.
2241 * delete the parent index entries corresponding to
2242 * the freed child data/index blocks.
2243 * free the index blocks themselves which aren't needed
2246 * index blocks are updated only if the blocks are to be
2248 * if type is PMAP, the data and index pages are NOT
2249 * freed, and the data and index blocks are NOT freed
2251 * (this will allow continued access of data/index of
2275 /* process entries backward from last index */
2276 index = le16_to_cpu(p->header.nextindex) - 1;
2304 xad = &p->xad[index];
2333 for (; index >= XTENTRYSTART; index--) {
2334 xad = &p->xad[index];
2372 if (index == XTENTRYSTART)
2375 nextindex = index;
2393 min(index, (int)xtlck->lwm.offset) : index;
2394 xtlck->lwm.length = index + 1 -
2396 xtlck->twm.offset = index;
2416 nextindex = index + 1;
2428 nextindex = index + 1;
2513 index = parent->index;
2520 if (index < le16_to_cpu(p->header.nextindex) - 1) {
2538 xadlock.xdlist = &p->xad[index + 1];
2541 index - 1;
2547 p->header.nextindex = cpu_to_le16(index + 1);
2556 nfreed += lengthXAD(&p->xad[index]);
2596 if (index == XTENTRYSTART) {
2664 index--;
2682 BT_PUSH(&btstack, bn, index);
2685 xad = &p->xad[index];
2749 int index;
2775 XT_GETSEARCH(ip, btstack.top, bn, mp, p, index);
2798 /* process entries backward from last index */
2799 index = le16_to_cpu(p->header.nextindex) - 1;
2814 xad = &p->xad[index];
2823 xtlck->hwm.offset = index;
2843 index = parent->index;
2848 if (index == XTENTRYSTART) {
2871 index--;
2882 BT_PUSH(&btstack, bn, index);
2885 xad = &p->xad[index];