Lines Matching +full:smp +full:- +full:offset
1 // SPDX-License-Identifier: GPL-2.0-or-later
3 * Copyright (C) International Business Machines Corp., 2000-2004
7 * jfs_dtree.c: directory B+-tree manager
9 * B+-tree with variable length key directory:
11 * each directory page is structured as an array of 32-byte
28 * directory starts as a root/leaf page in on-disk inode
41 * case-insensitive directory file system
43 * names are stored in case-sensitive way in leaf entry.
44 * but stored, searched and compared in case-insensitive (uppercase) order
46 * (note that case-sensitive order is BROKEN in storage, e.g.,
47 * sensitive: Ad, aB, aC, aD -> insensitive: aB, aC, aD, Ad
55 * either for, in case-insensitive search, duplicate
56 * or for, in case-sensitive search, for exact match
58 * router entry must be created/stored in case-insensitive way
66 * case-insensitive search:
70 * case-insensitive search of B-tree:
74 * if (leaf entry case-insensitive match found)
75 * if (next entry satisfies case-insensitive match)
77 * if (prev entry satisfies case-insensitive match)
118 if (((P)->header.nextindex > \
119 (((BN) == 0) ? DTROOTMAXSLOT : (P)->header.maxslot)) || \
120 ((BN) && (((P)->header.maxslot > DTPAGEMAXSLOT) || \
121 ((P)->header.stblindex >= DTPAGEMAXSLOT)))) { \
123 jfs_error((IP)->i_sb, \
126 RC = -EIO; \
160 loff_t * offset, struct btstack * btstack);
186 #define ciToUpper(c) UniStrupr((c)->name)
242 s64 offset; in find_index() local
250 maxWarnings--; in find_index()
255 if (index >= jfs_ip->next_index) { in find_index()
265 slot = &jfs_ip->i_dirtable[index - 2]; in find_index()
267 offset = (index - 2) * sizeof(struct dir_table_slot); in find_index()
268 page_offset = offset & (PSIZE - 1); in find_index()
269 blkno = ((offset + 1) >> L2PSIZE) << in find_index()
270 JFS_SBI(ip->i_sb)->l2nbperpage; in find_index()
286 (struct dir_table_slot *) ((char *) (*mp)->data + in find_index()
300 llck = (struct linelock *) tlck->lock; in lock_index()
302 if (llck->index >= llck->maxcnt) in lock_index()
304 lv = &llck->lv[llck->index]; in lock_index()
310 lv->offset = ((index - 2) & 511) >> 1; in lock_index()
311 lv->length = 1; in lock_index()
312 llck->index++; in lock_index()
324 struct super_block *sb = ip->i_sb; in add_index()
333 s64 offset; in add_index() local
340 if (jfs_ip->next_index < 2) { in add_index()
342 jfs_ip->next_index); in add_index()
343 jfs_ip->next_index = 2; in add_index()
346 index = jfs_ip->next_index++; in add_index()
352 ip->i_size = (loff_t) (index - 1) << 3; in add_index()
357 dirtab_slot = &jfs_ip->i_dirtable[index-2]; in add_index()
358 dirtab_slot->flag = DIR_INDEX_VALID; in add_index()
359 dirtab_slot->slot = slot; in add_index()
373 if (dquot_alloc_block(ip, sbi->nbperpage)) in add_index()
375 if (dbAlloc(ip, 0, sbi->nbperpage, &xaddr)) { in add_index()
376 dquot_free_block(ip, sbi->nbperpage); in add_index()
384 memcpy(temp_table, &jfs_ip->i_dirtable, sizeof(temp_table)); in add_index()
387 * Initialize empty x-tree in add_index()
394 if (xtInsert(tid, ip, 0, 0, sbi->nbperpage, &xaddr, 0)) { in add_index()
397 memcpy(&jfs_ip->i_dirtable, temp_table, in add_index()
399 dbFree(ip, xaddr, sbi->nbperpage); in add_index()
400 dquot_free_block(ip, sbi->nbperpage); in add_index()
403 ip->i_size = PSIZE; in add_index()
409 memcpy(&jfs_ip->i_dirtable, temp_table, in add_index()
414 llck = (struct linelock *) & tlck->lock; in add_index()
415 ASSERT(llck->index == 0); in add_index()
416 lv = &llck->lv[0]; in add_index()
418 lv->offset = 0; in add_index()
419 lv->length = 6; /* tlckDATA slot size is 16 bytes */ in add_index()
420 llck->index++; in add_index()
422 memcpy(mp->data, temp_table, sizeof(temp_table)); in add_index()
433 offset = (index - 2) * sizeof(struct dir_table_slot); in add_index()
434 page_offset = offset & (PSIZE - 1); in add_index()
435 blkno = ((offset + 1) >> L2PSIZE) << sbi->l2nbperpage; in add_index()
441 if (xtInsert(tid, ip, 0, blkno, sbi->nbperpage, &xaddr, 0)) { in add_index()
445 ip->i_size += PSIZE; in add_index()
448 memset(mp->data, 0, PSIZE); /* Just looks better */ in add_index()
450 xtTruncate(tid, ip, offset, COMMIT_PWMAP); in add_index()
462 (struct dir_table_slot *) ((char *) mp->data + page_offset); in add_index()
463 dirtab_slot->flag = DIR_INDEX_VALID; in add_index()
464 dirtab_slot->slot = slot; in add_index()
474 jfs_ip->next_index--; in add_index()
495 dirtab_slot->flag = DIR_INDEX_FREE; in free_index()
496 dirtab_slot->slot = dirtab_slot->addr1 = 0; in free_index()
497 dirtab_slot->addr2 = cpu_to_le32(next); in free_index()
523 dirtab_slot->slot = slot; in modify_index()
546 return -EIO; in read_index()
565 * return: 0 - search result on stack, leaf page pinned;
566 * errno - I/O error
580 int psize = 288; /* initial in-line directory */ in dtSearch()
583 struct super_block *sb = ip->i_sb; in dtSearch()
588 rc = -ENOMEM; in dtSearch()
593 /* uppercase search key for c-i directory */ in dtSearch()
594 UniStrcpy(ciKey.name, key->name); in dtSearch()
595 ciKey.namlen = key->namlen; in dtSearch()
597 /* only uppercase if case-insensitive support is on */ in dtSearch()
598 if ((JFS_SBI(sb)->mntflag & JFS_OS2) == JFS_OS2) { in dtSearch()
604 btstack->nsplit = 1; in dtSearch()
634 for (base = 0, lim = p->header.nextindex; lim; lim >>= 1) { in dtSearch()
638 rc = -EIO; in dtSearch()
642 if (p->header.flag & BT_LEAF) { in dtSearch()
646 JFS_SBI(sb)->mntflag); in dtSearch()
658 /* search hit - leaf page: in dtSearch()
661 if (p->header.flag & BT_LEAF) { in dtSearch()
663 ((struct ldtentry *) & p->slot[stbl[index]])->inumber); in dtSearch()
679 rc = -EEXIST; in dtSearch()
689 rc = -ESTALE; in dtSearch()
698 btsp = btstack->top; in dtSearch()
699 btsp->bn = bn; in dtSearch()
700 btsp->index = index; in dtSearch()
701 btsp->mp = mp; in dtSearch()
707 /* search hit - internal page: in dtSearch()
715 --lim; in dtSearch()
726 * search miss - leaf page in dtSearch()
731 if (p->header.flag & BT_LEAF) { in dtSearch()
737 rc = -ENOENT; in dtSearch()
747 btsp = btstack->top; in dtSearch()
748 btsp->bn = bn; in dtSearch()
749 btsp->index = base; in dtSearch()
750 btsp->mp = mp; in dtSearch()
757 * search miss - internal page in dtSearch()
759 * if base is non-zero, decrement base by one to get the parent in dtSearch()
762 index = base ? base - 1 : base; in dtSearch()
775 rc = -EIO; in dtSearch()
778 btstack->nsplit++; in dtSearch()
784 pxd = (pxd_t *) & p->slot[stbl[index]]; in dtSearch()
786 psize = lengthPXD(pxd) << JFS_SBI(ip->i_sb)->l2bsize; in dtSearch()
812 * return: 0 - success;
813 * errno - failure;
819 struct metapage *mp; /* meta-page buffer */ in dtInsert()
820 dtpage_t *p; /* base B+-tree index page */ in dtInsert()
837 DT_GETSEARCH(ip, btstack->top, bn, mp, p, index); in dtInsert()
838 if (p->header.freelist == 0) in dtInsert()
839 return -EINVAL; in dtInsert()
845 if (JFS_IP(ip)->next_index == DIREND) { in dtInsert()
847 return -EMLINK; in dtInsert()
849 n = NDTLEAF(name->namlen); in dtInsert()
853 n = NDTLEAF_LEGACY(name->namlen); in dtInsert()
865 if (n > p->header.freecnt) { in dtInsert()
885 dtlck = (struct dt_lock *) & tlck->lock; in dtInsert()
886 ASSERT(dtlck->index == 0); in dtInsert()
887 lv = & dtlck->lv[0]; in dtInsert()
890 lv->offset = 0; in dtInsert()
891 lv->length = 1; in dtInsert()
892 dtlck->index++; in dtInsert()
896 /* linelock stbl of non-root leaf page */ in dtInsert()
897 if (!(p->header.flag & BT_ROOT)) { in dtInsert()
898 if (dtlck->index >= dtlck->maxcnt) in dtInsert()
900 lv = & dtlck->lv[dtlck->index]; in dtInsert()
902 lv->offset = p->header.stblindex + n; in dtInsert()
903 lv->length = in dtInsert()
904 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - n + 1; in dtInsert()
905 dtlck->index++; in dtInsert()
922 * return: 0 - success;
923 * errno - failure;
929 struct jfs_sb_info *sbi = JFS_SBI(ip->i_sb); in dtSplitUp()
931 struct metapage *smp; in dtSplitUp() local
945 ddata_t *data = split->data; in dtSplitUp()
953 smp = split->mp; in dtSplitUp()
954 sp = DT_PAGE(ip, smp); in dtSplitUp()
958 DT_PUTPAGE(smp); in dtSplitUp()
959 rc = -ENOMEM; in dtSplitUp()
972 if (sp->header.flag & BT_ROOT) { in dtSplitUp()
977 n = sbi->bsize >> L2DTSLOTSIZE; in dtSplitUp()
978 n -= (n + 31) >> L2DTSLOTSIZE; /* stbl size */ in dtSplitUp()
979 n -= DTROOTMAXSLOT - sp->header.freecnt; /* header + entries */ in dtSplitUp()
980 if (n <= split->nslot) in dtSplitUp()
983 DT_PUTPAGE(smp); in dtSplitUp()
992 split->pxdlist = &pxdlist; in dtSplitUp()
1000 DT_PUTPAGE(smp); in dtSplitUp()
1003 ip->i_size = xlen << sbi->l2bsize; in dtSplitUp()
1014 pxd = &sp->header.self; in dtSplitUp()
1016 xsize = xlen << sbi->l2bsize; in dtSplitUp()
1020 n -= (n + 31) >> L2DTSLOTSIZE; /* stbl size */ in dtSplitUp()
1021 if ((n + sp->header.freecnt) <= split->nslot) in dtSplitUp()
1032 if ((rc = dbReAlloc(sbi->ipbmap, xaddr, (s64) xlen, in dtSplitUp()
1041 split->pxdlist = &pxdlist; in dtSplitUp()
1050 xlen = lengthPXD(pxd) - n; in dtSplitUp()
1055 ip->i_size = lengthPXD(pxd) << sbi->l2bsize; in dtSplitUp()
1059 DT_PUTPAGE(smp); in dtSplitUp()
1074 n = btstack->nsplit; in dtSplitUp()
1076 xlen = sbi->nbperpage; in dtSplitUp()
1077 for (pxd = pxdlist.pxd; n > 0; n--, pxd++) { in dtSplitUp()
1085 DT_PUTPAGE(smp); in dtSplitUp()
1091 split->pxdlist = &pxdlist; in dtSplitUp()
1093 DT_PUTPAGE(smp); in dtSplitUp()
1100 ip->i_size += PSIZE; in dtSplitUp()
1127 lmp = smp; in dtSplitUp()
1134 DT_GETPAGE(ip, parent->bn, smp, PSIZE, sp, rc); in dtSplitUp()
1145 skip = parent->index + 1; in dtSplitUp()
1168 * the entire key must be retained for the next-to-leftmost in dtSplitUp()
1172 switch (rp->header.flag & BT_TYPE) { in dtSplitUp()
1179 if ((sp->header.flag & BT_ROOT && skip > 1) || in dtSplitUp()
1180 sp->header.prev != 0 || skip > 1) { in dtSplitUp()
1183 lp->header.nextindex-1, in dtSplitUp()
1185 sbi->mntflag); in dtSplitUp()
1189 DT_PUTPAGE(smp); in dtSplitUp()
1197 dtGetKey(rp, 0, &key, sbi->mntflag); in dtSplitUp()
1200 if ((sbi->mntflag & JFS_OS2) == JFS_OS2) in dtSplitUp()
1208 dtGetKey(rp, 0, &key, sbi->mntflag); in dtSplitUp()
1223 data->xd = rpxd; /* child page xd */ in dtSplitUp()
1226 * parent page is full - split the parent page in dtSplitUp()
1228 if (n > sp->header.freecnt) { in dtSplitUp()
1230 split->mp = smp; in dtSplitUp()
1231 split->index = skip; /* index at insert */ in dtSplitUp()
1232 split->nslot = n; in dtSplitUp()
1233 split->key = &key; in dtSplitUp()
1234 /* split->data = data; */ in dtSplitUp()
1243 rc = (sp->header.flag & BT_ROOT) ? in dtSplitUp()
1247 DT_PUTPAGE(smp); in dtSplitUp()
1251 /* smp and rmp are pinned */ in dtSplitUp()
1254 * parent page is not full - insert router entry in parent page in dtSplitUp()
1257 BT_MARK_DIRTY(smp, ip); in dtSplitUp()
1261 tlck = txLock(tid, ip, smp, tlckDTREE | tlckENTRY); in dtSplitUp()
1262 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitUp()
1263 ASSERT(dtlck->index == 0); in dtSplitUp()
1264 lv = & dtlck->lv[0]; in dtSplitUp()
1267 lv->offset = 0; in dtSplitUp()
1268 lv->length = 1; in dtSplitUp()
1269 dtlck->index++; in dtSplitUp()
1271 /* linelock stbl of non-root parent page */ in dtSplitUp()
1272 if (!(sp->header.flag & BT_ROOT)) { in dtSplitUp()
1275 lv->offset = sp->header.stblindex + n; in dtSplitUp()
1276 lv->length = in dtSplitUp()
1277 ((sp->header.nextindex - in dtSplitUp()
1278 1) >> L2DTSLOTSIZE) - n + 1; in dtSplitUp()
1279 dtlck->index++; in dtSplitUp()
1290 DT_PUTPAGE(smp); in dtSplitUp()
1318 * function: Split a non-root page of a btree.
1322 * return: 0 - success;
1323 * errno - failure;
1330 struct metapage *smp; in dtSplitPage() local
1353 smp = split->mp; in dtSplitPage()
1354 sp = DT_PAGE(ip, smp); in dtSplitPage()
1359 pxdlist = split->pxdlist; in dtSplitPage()
1360 pxd = &pxdlist->pxd[pxdlist->npxd]; in dtSplitPage()
1361 pxdlist->npxd++; in dtSplitPage()
1365 return -EIO; in dtSplitPage()
1374 jfs_info("dtSplitPage: ip:0x%p smp:0x%p rmp:0x%p", ip, smp, rmp); in dtSplitPage()
1381 rdtlck = (struct dt_lock *) & tlck->lock; in dtSplitPage()
1383 rp = (dtpage_t *) rmp->data; in dtSplitPage()
1385 rp->header.self = *pxd; in dtSplitPage()
1387 BT_MARK_DIRTY(smp, ip); in dtSplitPage()
1393 tlck = txLock(tid, ip, smp, tlckDTREE | tlckENTRY); in dtSplitPage()
1394 sdtlck = (struct dt_lock *) & tlck->lock; in dtSplitPage()
1397 ASSERT(sdtlck->index == 0); in dtSplitPage()
1398 slv = & sdtlck->lv[0]; in dtSplitPage()
1399 slv->offset = 0; in dtSplitPage()
1400 slv->length = 1; in dtSplitPage()
1401 sdtlck->index++; in dtSplitPage()
1406 nextbn = le64_to_cpu(sp->header.next); in dtSplitPage()
1407 rp->header.next = cpu_to_le64(nextbn); in dtSplitPage()
1408 rp->header.prev = cpu_to_le64(addressPXD(&sp->header.self)); in dtSplitPage()
1409 sp->header.next = cpu_to_le64(rbn); in dtSplitPage()
1414 rp->header.flag = sp->header.flag; in dtSplitPage()
1417 rp->header.nextindex = 0; in dtSplitPage()
1418 rp->header.stblindex = 1; in dtSplitPage()
1421 rp->header.maxslot = n; in dtSplitPage()
1425 fsi = rp->header.stblindex + stblsize; in dtSplitPage()
1426 rp->header.freelist = fsi; in dtSplitPage()
1427 rp->header.freecnt = rp->header.maxslot - fsi; in dtSplitPage()
1442 if (nextbn == 0 && split->index == sp->header.nextindex) { in dtSplitPage()
1444 rlv = & rdtlck->lv[rdtlck->index]; in dtSplitPage()
1445 rlv->offset = 0; in dtSplitPage()
1446 rlv->length = 2; in dtSplitPage()
1447 rdtlck->index++; in dtSplitPage()
1452 f = &rp->slot[fsi]; in dtSplitPage()
1453 for (fsi++; fsi < rp->header.maxslot; f++, fsi++) in dtSplitPage()
1454 f->next = fsi; in dtSplitPage()
1455 f->next = -1; in dtSplitPage()
1458 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck); in dtSplitPage()
1464 * non-sequential insert (at possibly middle page) in dtSplitPage()
1484 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitPage()
1487 lv = & dtlck->lv[dtlck->index]; in dtSplitPage()
1488 lv->offset = 0; in dtSplitPage()
1489 lv->length = 1; in dtSplitPage()
1490 dtlck->index++; in dtSplitPage()
1492 p->header.prev = cpu_to_le64(rbn); in dtSplitPage()
1500 skip = split->index; in dtSplitPage()
1510 stbl = (u8 *) & sp->slot[sp->header.stblindex]; in dtSplitPage()
1511 nextindex = sp->header.nextindex; in dtSplitPage()
1515 n = split->nslot; in dtSplitPage()
1518 switch (sp->header.flag & BT_TYPE) { in dtSplitPage()
1520 ldtentry = (struct ldtentry *) & sp->slot[si]; in dtSplitPage()
1522 n = NDTLEAF(ldtentry->namlen); in dtSplitPage()
1524 n = NDTLEAF_LEGACY(ldtentry-> in dtSplitPage()
1529 idtentry = (struct idtentry *) & sp->slot[si]; in dtSplitPage()
1530 n = NDTINTERNAL(idtentry->namlen); in dtSplitPage()
1556 rlv = & rdtlck->lv[rdtlck->index]; in dtSplitPage()
1557 rlv->offset = 0; in dtSplitPage()
1558 rlv->length = 5; in dtSplitPage()
1559 rdtlck->index++; in dtSplitPage()
1563 sp->header.nextindex = nxt; in dtSplitPage()
1568 fsi = rp->header.freelist; in dtSplitPage()
1569 f = &rp->slot[fsi]; in dtSplitPage()
1570 for (fsi++; fsi < rp->header.maxslot; f++, fsi++) in dtSplitPage()
1571 f->next = fsi; in dtSplitPage()
1572 f->next = -1; in dtSplitPage()
1577 if ((rp->header.flag & BT_LEAF) && DO_INDEX(ip)) { in dtSplitPage()
1582 for (n = 0; n < rp->header.nextindex; n++) { in dtSplitPage()
1583 ldtentry = (struct ldtentry *) & rp->slot[stbl[n]]; in dtSplitPage()
1584 modify_index(tid, ip, le32_to_cpu(ldtentry->index), in dtSplitPage()
1596 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck); in dtSplitPage()
1599 if (sdtlck->index >= sdtlck->maxcnt) in dtSplitPage()
1601 slv = & sdtlck->lv[sdtlck->index]; in dtSplitPage()
1603 slv->offset = sp->header.stblindex + n; in dtSplitPage()
1604 slv->length = in dtSplitPage()
1605 ((sp->header.nextindex - 1) >> L2DTSLOTSIZE) - n + 1; in dtSplitPage()
1606 sdtlck->index++; in dtSplitPage()
1613 skip -= nxt; in dtSplitPage()
1616 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck); in dtSplitPage()
1634 * return: 0 - success;
1635 * errno - failure;
1641 struct super_block *sb = ip->i_sb; in dtExtendPage()
1643 struct metapage *smp, *pmp, *mp; in dtExtendPage() local
1664 smp = split->mp; in dtExtendPage()
1665 sp = DT_PAGE(ip, smp); in dtExtendPage()
1669 DT_GETPAGE(ip, parent->bn, pmp, PSIZE, pp, rc); in dtExtendPage()
1676 pxdlist = split->pxdlist; in dtExtendPage()
1677 pxd = &pxdlist->pxd[pxdlist->npxd]; in dtExtendPage()
1678 pxdlist->npxd++; in dtExtendPage()
1681 tpxd = &sp->header.self; in dtExtendPage()
1683 /* in-place extension */ in dtExtendPage()
1693 pxdlock = (struct pxd_lock *) & tlck->lock; in dtExtendPage()
1694 pxdlock->flag = mlckFREEPXD; in dtExtendPage()
1695 pxdlock->pxd = sp->header.self; in dtExtendPage()
1696 pxdlock->index = 1; in dtExtendPage()
1706 for (n = 0; n < sp->header.nextindex; n++) { in dtExtendPage()
1708 (struct ldtentry *) & sp->slot[stbl[n]]; in dtExtendPage()
1710 le32_to_cpu(ldtentry->index), in dtExtendPage()
1721 sp->header.self = *pxd; in dtExtendPage()
1723 jfs_info("dtExtendPage: ip:0x%p smp:0x%p sp:0x%p", ip, smp, sp); in dtExtendPage()
1725 BT_MARK_DIRTY(smp, ip); in dtExtendPage()
1729 tlck = txLock(tid, ip, smp, tlckDTREE | type); in dtExtendPage()
1730 dtlck = (struct dt_lock *) & tlck->lock; in dtExtendPage()
1731 lv = & dtlck->lv[0]; in dtExtendPage()
1735 xsize = xlen << JFS_SBI(sb)->l2bsize; in dtExtendPage()
1740 oldstblindex = sp->header.stblindex; in dtExtendPage()
1741 oldstblsize = (sp->header.maxslot + 31) >> L2DTSLOTSIZE; in dtExtendPage()
1742 newstblindex = sp->header.maxslot; in dtExtendPage()
1745 memcpy(&sp->slot[newstblindex], &sp->slot[oldstblindex], in dtExtendPage()
1746 sp->header.nextindex); in dtExtendPage()
1749 * in-line extension: linelock old area of extended page in dtExtendPage()
1753 lv->offset = 0; in dtExtendPage()
1754 lv->length = 1; in dtExtendPage()
1755 dtlck->index++; in dtExtendPage()
1759 lv->offset = newstblindex; in dtExtendPage()
1760 lv->length = newstblsize; in dtExtendPage()
1766 lv->offset = 0; in dtExtendPage()
1767 lv->length = sp->header.maxslot + newstblsize; in dtExtendPage()
1770 dtlck->index++; in dtExtendPage()
1772 sp->header.maxslot = n; in dtExtendPage()
1773 sp->header.stblindex = newstblindex; in dtExtendPage()
1774 /* sp->header.nextindex remains the same */ in dtExtendPage()
1780 f = &sp->slot[fsi]; in dtExtendPage()
1781 last = sp->header.freelist; in dtExtendPage()
1783 f->next = last; in dtExtendPage()
1786 sp->header.freelist = last; in dtExtendPage()
1787 sp->header.freecnt += oldstblsize; in dtExtendPage()
1794 f = &sp->slot[fsi]; in dtExtendPage()
1795 for (fsi++; fsi < sp->header.maxslot; f++, fsi++) in dtExtendPage()
1796 f->next = fsi; in dtExtendPage()
1797 f->next = -1; in dtExtendPage()
1800 fsi = sp->header.freelist; in dtExtendPage()
1801 if (fsi == -1) in dtExtendPage()
1802 sp->header.freelist = n; in dtExtendPage()
1805 f = &sp->slot[fsi]; in dtExtendPage()
1806 fsi = f->next; in dtExtendPage()
1807 } while (fsi != -1); in dtExtendPage()
1809 f->next = n; in dtExtendPage()
1812 sp->header.freecnt += sp->header.maxslot - n; in dtExtendPage()
1817 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck); in dtExtendPage()
1824 n = sp->header.maxslot >> 2; in dtExtendPage()
1825 if (sp->header.freelist < n) in dtExtendPage()
1836 dtlck = (struct dt_lock *) & tlck->lock; in dtExtendPage()
1837 lv = & dtlck->lv[dtlck->index]; in dtExtendPage()
1839 /* linelock parent entry - 1st slot */ in dtExtendPage()
1840 lv->offset = 1; in dtExtendPage()
1841 lv->length = 1; in dtExtendPage()
1842 dtlck->index++; in dtExtendPage()
1845 tpxd = (pxd_t *) & pp->slot[1]; in dtExtendPage()
1861 * since root page << non-root page, and
1867 * return: 0 - success;
1868 * errno - failure;
1874 struct super_block *sb = ip->i_sb; in dtSplitRoot()
1875 struct metapage *smp; in dtSplitRoot() local
1895 smp = split->mp; in dtSplitRoot()
1896 sp = &JFS_IP(ip)->i_dtroot; in dtSplitRoot()
1904 pxdlist = split->pxdlist; in dtSplitRoot()
1905 pxd = &pxdlist->pxd[pxdlist->npxd]; in dtSplitRoot()
1906 pxdlist->npxd++; in dtSplitRoot()
1909 xsize = xlen << JFS_SBI(sb)->l2bsize; in dtSplitRoot()
1912 return -EIO; in dtSplitRoot()
1914 rp = rmp->data; in dtSplitRoot()
1928 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitRoot()
1930 rp->header.flag = in dtSplitRoot()
1931 (sp->header.flag & BT_LEAF) ? BT_LEAF : BT_INTERNAL; in dtSplitRoot()
1932 rp->header.self = *pxd; in dtSplitRoot()
1935 rp->header.next = 0; in dtSplitRoot()
1936 rp->header.prev = 0; in dtSplitRoot()
1939 * move in-line root page into new right page extent in dtSplitRoot()
1942 ASSERT(dtlck->index == 0); in dtSplitRoot()
1943 lv = & dtlck->lv[0]; in dtSplitRoot()
1944 lv->offset = 0; in dtSplitRoot()
1945 lv->length = 10; /* 1 + 8 + 1 */ in dtSplitRoot()
1946 dtlck->index++; in dtSplitRoot()
1949 rp->header.maxslot = n; in dtSplitRoot()
1953 rp->header.stblindex = DTROOTMAXSLOT; in dtSplitRoot()
1954 stbl = (s8 *) & rp->slot[DTROOTMAXSLOT]; in dtSplitRoot()
1955 memcpy(stbl, sp->header.stbl, sp->header.nextindex); in dtSplitRoot()
1956 rp->header.nextindex = sp->header.nextindex; in dtSplitRoot()
1959 memcpy(&rp->slot[1], &sp->slot[1], IDATASIZE); in dtSplitRoot()
1966 f = &rp->slot[fsi]; in dtSplitRoot()
1967 for (fsi++; fsi < rp->header.maxslot; f++, fsi++) in dtSplitRoot()
1968 f->next = fsi; in dtSplitRoot()
1969 f->next = -1; in dtSplitRoot()
1972 fsi = sp->header.freelist; in dtSplitRoot()
1973 if (fsi == -1) in dtSplitRoot()
1974 rp->header.freelist = n; in dtSplitRoot()
1976 rp->header.freelist = fsi; in dtSplitRoot()
1979 f = &rp->slot[fsi]; in dtSplitRoot()
1980 fsi = f->next; in dtSplitRoot()
1983 f->next = n; in dtSplitRoot()
1986 rp->header.freecnt = sp->header.freecnt + rp->header.maxslot - n; in dtSplitRoot()
1991 if ((rp->header.flag & BT_LEAF) && DO_INDEX(ip)) { in dtSplitRoot()
1997 for (n = 0; n < rp->header.nextindex; n++) { in dtSplitRoot()
1998 ldtentry = (struct ldtentry *) & rp->slot[stbl[n]]; in dtSplitRoot()
1999 modify_index(tid, ip, le32_to_cpu(ldtentry->index), in dtSplitRoot()
2009 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck); in dtSplitRoot()
2014 * set the 1st entry offset to 0, which force the left-most key in dtSplitRoot()
2017 * The btree comparison code guarantees that the left-most key on any in dtSplitRoot()
2020 BT_MARK_DIRTY(smp, ip); in dtSplitRoot()
2022 * acquire a transaction lock on the root page (in-memory inode) in dtSplitRoot()
2024 tlck = txLock(tid, ip, smp, tlckDTREE | tlckNEW | tlckBTROOT); in dtSplitRoot()
2025 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitRoot()
2028 ASSERT(dtlck->index == 0); in dtSplitRoot()
2029 lv = & dtlck->lv[0]; in dtSplitRoot()
2030 lv->offset = 0; in dtSplitRoot()
2031 lv->length = DTROOTMAXSLOT; in dtSplitRoot()
2032 dtlck->index++; in dtSplitRoot()
2035 if (sp->header.flag & BT_LEAF) { in dtSplitRoot()
2036 sp->header.flag &= ~BT_LEAF; in dtSplitRoot()
2037 sp->header.flag |= BT_INTERNAL; in dtSplitRoot()
2041 s = (struct idtentry *) & sp->slot[DTENTRYSTART]; in dtSplitRoot()
2044 s->next = -1; in dtSplitRoot()
2045 s->namlen = 0; in dtSplitRoot()
2047 stbl = sp->header.stbl; in dtSplitRoot()
2049 sp->header.nextindex = 1; in dtSplitRoot()
2053 f = &sp->slot[fsi]; in dtSplitRoot()
2057 f->next = fsi; in dtSplitRoot()
2058 f->next = -1; in dtSplitRoot()
2060 sp->header.freelist = DTENTRYSTART + 1; in dtSplitRoot()
2061 sp->header.freecnt = DTROOTMAXSLOT - (DTENTRYSTART + 1); in dtSplitRoot()
2115 ldtentry = (struct ldtentry *) & p->slot[stbl[index]]; in dtDelete()
2116 table_index = le32_to_cpu(ldtentry->index); in dtDelete()
2117 if (index == (p->header.nextindex - 1)) { in dtDelete()
2121 if ((p->header.flag & BT_ROOT) in dtDelete()
2122 || (p->header.next == 0)) in dtDelete()
2123 next_index = -1; in dtDelete()
2126 DT_GETPAGE(ip, le64_to_cpu(p->header.next), in dtDelete()
2129 next_index = -1; in dtDelete()
2133 (struct ldtentry *) & np-> in dtDelete()
2136 le32_to_cpu(ldtentry->index); in dtDelete()
2142 (struct ldtentry *) & p->slot[stbl[index + 1]]; in dtDelete()
2143 next_index = le32_to_cpu(ldtentry->index); in dtDelete()
2150 if (p->header.nextindex == 1) { in dtDelete()
2165 dtlck = (struct dt_lock *) & tlck->lock; in dtDelete()
2168 * Do not assume that dtlck->index will be zero. During a in dtDelete()
2174 if (dtlck->index >= dtlck->maxcnt) in dtDelete()
2176 lv = & dtlck->lv[dtlck->index]; in dtDelete()
2177 lv->offset = 0; in dtDelete()
2178 lv->length = 1; in dtDelete()
2179 dtlck->index++; in dtDelete()
2181 /* linelock stbl of non-root leaf page */ in dtDelete()
2182 if (!(p->header.flag & BT_ROOT)) { in dtDelete()
2183 if (dtlck->index >= dtlck->maxcnt) in dtDelete()
2185 lv = & dtlck->lv[dtlck->index]; in dtDelete()
2187 lv->offset = p->header.stblindex + i; in dtDelete()
2188 lv->length = in dtDelete()
2189 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - in dtDelete()
2191 dtlck->index++; in dtDelete()
2200 if (DO_INDEX(ip) && index < p->header.nextindex) { in dtDelete()
2205 for (i = index; i < p->header.nextindex; i++) { in dtDelete()
2207 (struct ldtentry *) & p->slot[stbl[i]]; in dtDelete()
2209 le32_to_cpu(ldtentry->index), in dtDelete()
2265 * free the non-root leaf page in dtDeleteUp()
2275 pxdlock = (struct pxd_lock *) & tlck->lock; in dtDeleteUp()
2276 pxdlock->flag = mlckFREEPXD; in dtDeleteUp()
2277 pxdlock->pxd = fp->header.self; in dtDeleteUp()
2278 pxdlock->index = 1; in dtDeleteUp()
2286 xlen = lengthPXD(&fp->header.self); in dtDeleteUp()
2304 DT_GETPAGE(ip, parent->bn, mp, PSIZE, p, rc); in dtDeleteUp()
2311 index = parent->index; in dtDeleteUp()
2316 nextindex = p->header.nextindex; in dtDeleteUp()
2327 if (p->header.flag & BT_ROOT) { in dtDeleteUp()
2351 pxdlock = (struct pxd_lock *) & tlck->lock; in dtDeleteUp()
2352 pxdlock->flag = mlckFREEPXD; in dtDeleteUp()
2353 pxdlock->pxd = p->header.self; in dtDeleteUp()
2354 pxdlock->index = 1; in dtDeleteUp()
2362 xlen = lengthPXD(&p->header.self); in dtDeleteUp()
2387 dtlck = (struct dt_lock *) & tlck->lock; in dtDeleteUp()
2390 if (dtlck->index >= dtlck->maxcnt) in dtDeleteUp()
2392 lv = & dtlck->lv[dtlck->index]; in dtDeleteUp()
2393 lv->offset = 0; in dtDeleteUp()
2394 lv->length = 1; in dtDeleteUp()
2395 dtlck->index++; in dtDeleteUp()
2397 /* linelock stbl of non-root leaf page */ in dtDeleteUp()
2398 if (!(p->header.flag & BT_ROOT)) { in dtDeleteUp()
2399 if (dtlck->index < dtlck->maxcnt) in dtDeleteUp()
2403 lv = & dtlck->lv[0]; in dtDeleteUp()
2406 lv->offset = p->header.stblindex + i; in dtDeleteUp()
2407 lv->length = in dtDeleteUp()
2408 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - in dtDeleteUp()
2410 dtlck->index++; in dtDeleteUp()
2418 ((p->header.flag & BT_ROOT) || p->header.prev == 0)) in dtDeleteUp()
2429 ip->i_size -= PSIZE; in dtDeleteUp()
2454 nextbn = le64_to_cpu(p->header.next); in dtRelink()
2455 prevbn = le64_to_cpu(p->header.prev); in dtRelink()
2472 dtlck = (struct dt_lock *) & tlck->lock; in dtRelink()
2475 if (dtlck->index >= dtlck->maxcnt) in dtRelink()
2477 lv = & dtlck->lv[dtlck->index]; in dtRelink()
2478 lv->offset = 0; in dtRelink()
2479 lv->length = 1; in dtRelink()
2480 dtlck->index++; in dtRelink()
2482 p->header.prev = cpu_to_le64(prevbn); in dtRelink()
2501 dtlck = (struct dt_lock *) & tlck->lock; in dtRelink()
2504 if (dtlck->index >= dtlck->maxcnt) in dtRelink()
2506 lv = & dtlck->lv[dtlck->index]; in dtRelink()
2507 lv->offset = 0; in dtRelink()
2508 lv->length = 1; in dtRelink()
2509 dtlck->index++; in dtRelink()
2511 p->header.next = cpu_to_le64(nextbn); in dtRelink()
2536 * If this was previously an non-empty directory, we need to remove in dtInitRoot()
2548 xflag_save = tblk->xflag; in dtInitRoot()
2549 tblk->xflag = 0; in dtInitRoot()
2561 tblk->xflag = xflag_save; in dtInitRoot()
2563 ip->i_size = 1; in dtInitRoot()
2565 jfs_ip->next_index = 2; in dtInitRoot()
2567 ip->i_size = IDATASIZE; in dtInitRoot()
2574 tlck = txLock(tid, ip, (struct metapage *) & jfs_ip->bxflag, in dtInitRoot()
2576 dtlck = (struct dt_lock *) & tlck->lock; in dtInitRoot()
2579 ASSERT(dtlck->index == 0); in dtInitRoot()
2580 lv = & dtlck->lv[0]; in dtInitRoot()
2581 lv->offset = 0; in dtInitRoot()
2582 lv->length = DTROOTMAXSLOT; in dtInitRoot()
2583 dtlck->index++; in dtInitRoot()
2585 p = &jfs_ip->i_dtroot; in dtInitRoot()
2587 p->header.flag = DXD_INDEX | BT_ROOT | BT_LEAF; in dtInitRoot()
2589 p->header.nextindex = 0; in dtInitRoot()
2593 f = &p->slot[fsi]; in dtInitRoot()
2597 f->next = fsi; in dtInitRoot()
2598 f->next = -1; in dtInitRoot()
2600 p->header.freelist = 1; in dtInitRoot()
2601 p->header.freecnt = 8; in dtInitRoot()
2604 p->header.idotdot = cpu_to_le32(idotdot); in dtInitRoot()
2630 tid = txBegin(inode->i_sb, 0); in add_missing_indices()
2640 ASSERT(p->header.flag & BT_LEAF); in add_missing_indices()
2644 tlck->type |= tlckBTROOT; in add_missing_indices()
2646 dtlck = (struct dt_lock *) &tlck->lock; in add_missing_indices()
2649 for (i = 0; i < p->header.nextindex; i++) { in add_missing_indices()
2650 d = (struct ldtentry *) &p->slot[stbl[i]]; in add_missing_indices()
2651 index = le32_to_cpu(d->index); in add_missing_indices()
2652 if ((index < 2) || (index >= JFS_IP(inode)->next_index)) { in add_missing_indices()
2653 d->index = cpu_to_le32(add_index(tid, inode, bn, i)); in add_missing_indices()
2654 if (dtlck->index >= dtlck->maxcnt) in add_missing_indices()
2656 lv = &dtlck->lv[dtlck->index]; in add_missing_indices()
2657 lv->offset = stbl[i]; in add_missing_indices()
2658 lv->length = 1; in add_missing_indices()
2659 dtlck->index++; in add_missing_indices()
2681 * function to determine next variable-sized jfs_dirent in buffer
2687 ((sizeof (struct jfs_dirent) + dirent->name_len + 1 + in next_jfs_dirent()
2688 sizeof (loff_t) - 1) & in next_jfs_dirent()
2689 ~(sizeof (loff_t) - 1))); in next_jfs_dirent()
2696 * from the specified entry offset
2700 * return: offset = (pn, index) of start entry
2706 struct nls_table *codepage = JFS_SBI(ip->i_sb)->nls_tab; in jfs_readdir()
2734 if (ctx->pos == DIREND) in jfs_readdir()
2742 * -1 = End of directory in jfs_readdir()
2746 dir_index = (u32) ctx->pos; in jfs_readdir()
2754 dir_index--; in jfs_readdir()
2760 (dir_index >= JFS_IP(ip)->next_index)) { in jfs_readdir()
2762 ctx->pos = DIREND; in jfs_readdir()
2768 ctx->pos = DIREND; in jfs_readdir()
2772 if (loop_count++ > JFS_IP(ip)->next_index) { in jfs_readdir()
2774 ctx->pos = DIREND; in jfs_readdir()
2778 if (dir_index == -1) { in jfs_readdir()
2779 ctx->pos = DIREND; in jfs_readdir()
2788 ctx->pos = DIREND; in jfs_readdir()
2791 if (p->header.flag & BT_INTERNAL) { in jfs_readdir()
2794 ctx->pos = DIREND; in jfs_readdir()
2802 ctx->pos = 1; in jfs_readdir()
2803 if (!dir_emit(ctx, ".", 1, ip->i_ino, DT_DIR)) in jfs_readdir()
2809 ctx->pos = 2; in jfs_readdir()
2814 * Find first entry of left-most leaf in jfs_readdir()
2817 ctx->pos = DIREND; in jfs_readdir()
2828 * Legacy filesystem - OS/2 & Linux JFS < 0.3.6 in jfs_readdir()
2832 * pn > 0: Real entries, pn=1 -> leftmost page in jfs_readdir()
2833 * pn = index = -1: No more entries in jfs_readdir()
2835 dtpos = ctx->pos; in jfs_readdir()
2838 ctx->pos = 1; in jfs_readdir()
2839 if (!dir_emit(ctx, ".", 1, ip->i_ino, DT_DIR)) in jfs_readdir()
2841 dtoffset->index = 2; in jfs_readdir()
2842 ctx->pos = dtpos; in jfs_readdir()
2845 if (dtoffset->pn == 0) { in jfs_readdir()
2846 if (dtoffset->index == 2) { in jfs_readdir()
2851 jfs_err("jfs_readdir called with invalid offset!"); in jfs_readdir()
2853 dtoffset->pn = 1; in jfs_readdir()
2854 dtoffset->index = 0; in jfs_readdir()
2855 ctx->pos = dtpos; in jfs_readdir()
2859 ctx->pos = DIREND; in jfs_readdir()
2863 if ((rc = dtReadNext(ip, &ctx->pos, &btstack))) { in jfs_readdir()
2866 ctx->pos = DIREND; in jfs_readdir()
2872 /* offset beyond directory eof ? */ in jfs_readdir()
2874 ctx->pos = DIREND; in jfs_readdir()
2883 ctx->pos = DIREND; in jfs_readdir()
2884 return -ENOMEM; in jfs_readdir()
2894 for (i = index; i < p->header.nextindex; i++) { in jfs_readdir()
2897 i, stbl[i], (long)ip->i_ino, (long long)bn); in jfs_readdir()
2900 return -EIO; in jfs_readdir()
2903 d = (struct ldtentry *) & p->slot[stbl[i]]; in jfs_readdir()
2905 if (((long) jfs_dirent + d->namlen + 1) > in jfs_readdir()
2913 d_namleft = d->namlen; in jfs_readdir()
2914 name_ptr = jfs_dirent->name; in jfs_readdir()
2915 jfs_dirent->ino = le32_to_cpu(d->inumber); in jfs_readdir()
2919 jfs_dirent->position = le32_to_cpu(d->index); in jfs_readdir()
2921 * d->index should always be valid, but it in jfs_readdir()
2927 if ((jfs_dirent->position < 2) || in jfs_readdir()
2928 (jfs_dirent->position >= in jfs_readdir()
2929 JFS_IP(ip)->next_index)) { in jfs_readdir()
2942 jfs_dirent->position = unique_pos++; in jfs_readdir()
2949 jfs_dirent->position++; in jfs_readdir()
2951 jfs_dirent->position = dtpos; in jfs_readdir()
2956 outlen = jfs_strfromUCS_le(name_ptr, d->name, len, in jfs_readdir()
2958 jfs_dirent->name_len = outlen; in jfs_readdir()
2961 next = d->next; in jfs_readdir()
2963 t = (struct dtslot *) & p->slot[next]; in jfs_readdir()
2965 d_namleft -= len; in jfs_readdir()
2968 jfs_error(ip->i_sb, in jfs_readdir()
2970 (long)ip->i_ino, in jfs_readdir()
2976 outlen = jfs_strfromUCS_le(name_ptr, t->name, in jfs_readdir()
2978 jfs_dirent->name_len += outlen; in jfs_readdir()
2980 next = t->next; in jfs_readdir()
2987 dtoffset->index++; in jfs_readdir()
2992 if (p->header.flag & BT_ROOT) in jfs_readdir()
2995 bn = le64_to_cpu(p->header.next); in jfs_readdir()
2997 /* update offset (pn:index) for new page */ in jfs_readdir()
2999 dtoffset->pn++; in jfs_readdir()
3000 dtoffset->index = 0; in jfs_readdir()
3010 while (jfs_dirents--) { in jfs_readdir()
3011 ctx->pos = jfs_dirent->position; in jfs_readdir()
3012 if (!dir_emit(ctx, jfs_dirent->name, in jfs_readdir()
3013 jfs_dirent->name_len, in jfs_readdir()
3014 jfs_dirent->ino, DT_UNKNOWN)) in jfs_readdir()
3025 ctx->pos = DIREND; in jfs_readdir()
3052 int psize = 288; /* initial in-line directory */ in dtReadFirst()
3074 if (p->header.flag & BT_LEAF) { in dtReadFirst()
3076 btsp = btstack->top; in dtReadFirst()
3077 btsp->bn = bn; in dtReadFirst()
3078 btsp->index = 0; in dtReadFirst()
3079 btsp->mp = mp; in dtReadFirst()
3089 jfs_error(ip->i_sb, "btstack overrun\n"); in dtReadFirst()
3091 return -EIO; in dtReadFirst()
3101 jfs_error(ip->i_sb, "stbl[0] out of bound\n"); in dtReadFirst()
3102 return -EIO; in dtReadFirst()
3105 xd = (pxd_t *) & p->slot[stbl[0]]; in dtReadFirst()
3109 psize = lengthPXD(xd) << JFS_SBI(ip->i_sb)->l2bsize; in dtReadFirst()
3120 * function: get the page of the specified offset (pn:index)
3122 * return: if (offset > eof), bn = -1;
3127 static int dtReadNext(struct inode *ip, loff_t * offset, in dtReadNext() argument
3135 } *dtoffset = (struct dtoffset *) offset; in dtReadNext()
3152 DT_GETSEARCH(ip, btstack->top, bn, mp, p, index); in dtReadNext()
3154 /* get the start offset (pn:index) */ in dtReadNext()
3155 pn = dtoffset->pn - 1; /* Now pn = 0 represents leftmost leaf */ in dtReadNext()
3156 index = dtoffset->index; in dtReadNext()
3160 /* offset beyond eof ? */ in dtReadNext()
3161 if (index < p->header.nextindex) in dtReadNext()
3164 if (p->header.flag & BT_ROOT) { in dtReadNext()
3165 bn = -1; in dtReadNext()
3170 dtoffset->pn++; in dtReadNext()
3171 dtoffset->index = index = 0; in dtReadNext()
3175 /* start at non-leftmost page: scan parent pages for large pn */ in dtReadNext()
3176 if (p->header.flag & BT_ROOT) { in dtReadNext()
3177 bn = -1; in dtReadNext()
3187 bn = le64_to_cpu(p->header.next); in dtReadNext()
3192 /* offset beyond eof ? */ in dtReadNext()
3194 bn = -1; in dtReadNext()
3208 btsp = btstack->top; in dtReadNext()
3209 parent = btsp - 1; in dtReadNext()
3210 bn = parent->bn; in dtReadNext()
3216 while (pn >= p->header.nextindex) { in dtReadNext()
3217 pn -= p->header.nextindex; in dtReadNext()
3220 bn = le64_to_cpu(p->header.next); in dtReadNext()
3225 /* offset beyond eof ? */ in dtReadNext()
3227 bn = -1; in dtReadNext()
3237 parent->bn = bn; in dtReadNext()
3242 xd = (pxd_t *) & p->slot[stbl[pn]]; in dtReadNext()
3260 if (index >= p->header.nextindex) { in dtReadNext()
3261 bn = le64_to_cpu(p->header.next); in dtReadNext()
3266 /* offset beyond eof ? */ in dtReadNext()
3268 bn = -1; in dtReadNext()
3278 dtoffset->pn++; in dtReadNext()
3279 dtoffset->index = 0; in dtReadNext()
3284 btsp = btstack->top; in dtReadNext()
3285 btsp->bn = bn; in dtReadNext()
3286 btsp->index = dtoffset->index; in dtReadNext()
3287 btsp->mp = mp; in dtReadNext()
3314 * force the left-most key on internal pages, at any level of in dtCompare()
3322 * it descends to child of the entry anyway - in dtCompare()
3325 * if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & BT_LEAF)) in dtCompare()
3329 kname = key->name; in dtCompare()
3330 klen = key->namlen; in dtCompare()
3332 ih = (struct idtentry *) & p->slot[si]; in dtCompare()
3333 si = ih->next; in dtCompare()
3334 name = ih->name; in dtCompare()
3335 namlen = ih->namlen; in dtCompare()
3343 klen -= len; in dtCompare()
3344 namlen -= len; in dtCompare()
3350 t = (struct dtslot *) & p->slot[si]; in dtCompare()
3353 name = t->name; in dtCompare()
3357 klen -= len; in dtCompare()
3358 namlen -= len; in dtCompare()
3360 si = t->next; in dtCompare()
3363 return (klen - namlen); in dtCompare()
3393 * force the left-most key on internal pages, at any level of in ciCompare()
3401 * it descends to child of the entry anyway - in ciCompare()
3404 * if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & BT_LEAF)) in ciCompare()
3408 kname = key->name; in ciCompare()
3409 klen = key->namlen; in ciCompare()
3414 if (p->header.flag & BT_LEAF) { in ciCompare()
3415 lh = (struct ldtentry *) & p->slot[si]; in ciCompare()
3416 si = lh->next; in ciCompare()
3417 name = lh->name; in ciCompare()
3418 namlen = lh->namlen; in ciCompare()
3428 ih = (struct idtentry *) & p->slot[si]; in ciCompare()
3429 si = ih->next; in ciCompare()
3430 name = ih->name; in ciCompare()
3431 namlen = ih->namlen; in ciCompare()
3438 /* only uppercase if case-insensitive support is on */ in ciCompare()
3443 if ((rc = *kname - x)) in ciCompare()
3447 klen -= len; in ciCompare()
3448 namlen -= len; in ciCompare()
3453 t = (struct dtslot *) & p->slot[si]; in ciCompare()
3456 name = t->name; in ciCompare()
3458 /* only uppercase if case-insensitive support is on */ in ciCompare()
3464 if ((rc = *kname - x)) in ciCompare()
3468 klen -= len; in ciCompare()
3469 namlen -= len; in ciCompare()
3470 si = t->next; in ciCompare()
3473 return (klen - namlen); in ciCompare()
3484 * return: non-zero on error
3498 return -ENOMEM; in ciGetLeafPrefixKey()
3504 return -ENOMEM; in ciGetLeafPrefixKey()
3523 kname = key->name; in ciGetLeafPrefixKey()
3526 namlen; pl++, pr++, namlen--, klen++, kname++) { in ciGetLeafPrefixKey()
3529 key->namlen = klen + 1; in ciGetLeafPrefixKey()
3534 /* l->namlen <= r->namlen since l <= r */ in ciGetLeafPrefixKey()
3537 key->namlen = klen + 1; in ciGetLeafPrefixKey()
3538 } else /* l->namelen == r->namelen */ in ciGetLeafPrefixKey()
3539 key->namlen = klen; in ciGetLeafPrefixKey()
3569 if (p->header.flag & BT_LEAF) { in dtGetKey()
3570 lh = (struct ldtentry *) & p->slot[si]; in dtGetKey()
3571 si = lh->next; in dtGetKey()
3572 namlen = lh->namlen; in dtGetKey()
3573 name = lh->name; in dtGetKey()
3579 ih = (struct idtentry *) & p->slot[si]; in dtGetKey()
3580 si = ih->next; in dtGetKey()
3581 namlen = ih->namlen; in dtGetKey()
3582 name = ih->name; in dtGetKey()
3586 key->namlen = namlen; in dtGetKey()
3587 kname = key->name; in dtGetKey()
3599 t = &p->slot[si]; in dtGetKey()
3601 namlen -= len; in dtGetKey()
3603 UniStrncpy_from_le(kname, t->name, len); in dtGetKey()
3605 si = t->next; in dtGetKey()
3635 klen = key->namlen; in dtInsertEntry()
3636 kname = key->name; in dtInsertEntry()
3639 hsi = fsi = p->header.freelist; in dtInsertEntry()
3640 h = &p->slot[fsi]; in dtInsertEntry()
3641 p->header.freelist = h->next; in dtInsertEntry()
3642 --p->header.freecnt; in dtInsertEntry()
3645 if (dtlck->index >= dtlck->maxcnt) in dtInsertEntry()
3648 lv = & dtlck->lv[dtlck->index]; in dtInsertEntry()
3649 lv->offset = hsi; in dtInsertEntry()
3652 if (p->header.flag & BT_LEAF) { in dtInsertEntry()
3654 lh->next = h->next; in dtInsertEntry()
3655 lh->inumber = cpu_to_le32(data->leaf.ino); in dtInsertEntry()
3656 lh->namlen = klen; in dtInsertEntry()
3657 name = lh->name; in dtInsertEntry()
3658 if (data->leaf.ip) { in dtInsertEntry()
3660 if (!(p->header.flag & BT_ROOT)) in dtInsertEntry()
3661 bn = addressPXD(&p->header.self); in dtInsertEntry()
3662 lh->index = cpu_to_le32(add_index(data->leaf.tid, in dtInsertEntry()
3663 data->leaf.ip, in dtInsertEntry()
3669 ih->next = h->next; in dtInsertEntry()
3671 *xd = data->xd; in dtInsertEntry()
3672 ih->namlen = klen; in dtInsertEntry()
3673 name = ih->name; in dtInsertEntry()
3684 klen -= len; in dtInsertEntry()
3687 fsi = p->header.freelist; in dtInsertEntry()
3688 t = &p->slot[fsi]; in dtInsertEntry()
3689 p->header.freelist = t->next; in dtInsertEntry()
3690 --p->header.freecnt; in dtInsertEntry()
3695 lv->length = n; in dtInsertEntry()
3696 dtlck->index++; in dtInsertEntry()
3699 if (dtlck->index < dtlck->maxcnt) in dtInsertEntry()
3703 lv = & dtlck->lv[0]; in dtInsertEntry()
3706 lv->offset = fsi; in dtInsertEntry()
3712 UniStrncpy_to_le(t->name, kname, len); in dtInsertEntry()
3716 klen -= len; in dtInsertEntry()
3720 lv->length = n; in dtInsertEntry()
3721 dtlck->index++; in dtInsertEntry()
3728 if (p->header.flag & BT_LEAF) in dtInsertEntry()
3729 lh->next = -1; in dtInsertEntry()
3731 ih->next = -1; in dtInsertEntry()
3733 /* multi-segment entry */ in dtInsertEntry()
3734 t->next = -1; in dtInsertEntry()
3738 nextindex = p->header.nextindex; in dtInsertEntry()
3740 memmove(stbl + index + 1, stbl + index, nextindex - index); in dtInsertEntry()
3742 if ((p->header.flag & BT_LEAF) && data->leaf.ip) { in dtInsertEntry()
3751 lh = (struct ldtentry *) & (p->slot[stbl[n]]); in dtInsertEntry()
3752 modify_index(data->leaf.tid, data->leaf.ip, in dtInsertEntry()
3753 le32_to_cpu(lh->index), bn, n, in dtInsertEntry()
3764 ++p->header.nextindex; in dtInsertEntry()
3793 sstbl = (s8 *) & sp->slot[sp->header.stblindex]; in dtMoveEntry()
3794 dstbl = (s8 *) & dp->slot[dp->header.stblindex]; in dtMoveEntry()
3796 dsi = dp->header.freelist; /* first (whole page) free slot */ in dtMoveEntry()
3797 sfsi = sp->header.freelist; in dtMoveEntry()
3800 dlv = & ddtlck->lv[ddtlck->index]; in dtMoveEntry()
3801 dlv->offset = dsi; in dtMoveEntry()
3804 slv = & sdtlck->lv[sdtlck->index]; in dtMoveEntry()
3805 slv->offset = sstbl[si]; in dtMoveEntry()
3806 xssi = slv->offset - 1; in dtMoveEntry()
3812 for (di = 0; si < sp->header.nextindex; si++, di++) { in dtMoveEntry()
3819 slv->length = ns; in dtMoveEntry()
3820 sdtlck->index++; in dtMoveEntry()
3823 if (sdtlck->index < sdtlck->maxcnt) in dtMoveEntry()
3827 slv = & sdtlck->lv[0]; in dtMoveEntry()
3830 slv->offset = ssi; in dtMoveEntry()
3838 h = d = &dp->slot[dsi]; in dtMoveEntry()
3841 s = &sp->slot[ssi]; in dtMoveEntry()
3842 if (sp->header.flag & BT_LEAF) { in dtMoveEntry()
3846 snamlen = slh->namlen; in dtMoveEntry()
3850 dlh->index = slh->index; /* little-endian */ in dtMoveEntry()
3856 next = slh->next; in dtMoveEntry()
3860 dlh->next = dsi; in dtMoveEntry()
3863 snamlen = sih->namlen; in dtMoveEntry()
3868 next = sih->next; in dtMoveEntry()
3871 dih->next = dsi; in dtMoveEntry()
3875 s->next = sfsi; in dtMoveEntry()
3876 s->cnt = 1; in dtMoveEntry()
3886 snamlen -= len; in dtMoveEntry()
3891 slv->length = ns; in dtMoveEntry()
3892 sdtlck->index++; in dtMoveEntry()
3895 if (sdtlck->index < sdtlck->maxcnt) in dtMoveEntry()
3901 slv = & sdtlck->lv[0]; in dtMoveEntry()
3904 slv->offset = ssi; in dtMoveEntry()
3909 s = &sp->slot[ssi]; in dtMoveEntry()
3915 UniStrncpy_le(d->name, s->name, len); in dtMoveEntry()
3922 d->next = dsi; in dtMoveEntry()
3925 next = s->next; in dtMoveEntry()
3926 s->next = sfsi; in dtMoveEntry()
3927 s->cnt = 1; in dtMoveEntry()
3930 snamlen -= len; in dtMoveEntry()
3936 if (dp->header.flag & BT_LEAF) in dtMoveEntry()
3937 dlh->next = -1; in dtMoveEntry()
3939 dih->next = -1; in dtMoveEntry()
3941 /* multi-segment entry */ in dtMoveEntry()
3942 d->next = -1; in dtMoveEntry()
3946 slv->length = ns; in dtMoveEntry()
3947 sdtlck->index++; in dtMoveEntry()
3950 dlv->length = nd; in dtMoveEntry()
3951 ddtlck->index++; in dtMoveEntry()
3955 sp->header.freelist = sfsi; in dtMoveEntry()
3956 sp->header.freecnt += nd; in dtMoveEntry()
3959 dp->header.nextindex = di; in dtMoveEntry()
3961 dp->header.freelist = dsi; in dtMoveEntry()
3962 dp->header.freecnt -= nd; in dtMoveEntry()
3992 if (dtlck->index >= dtlck->maxcnt) in dtDeleteEntry()
3994 lv = & dtlck->lv[dtlck->index]; in dtDeleteEntry()
3996 lv->offset = fsi; in dtDeleteEntry()
3999 t = &p->slot[fsi]; in dtDeleteEntry()
4000 if (p->header.flag & BT_LEAF) in dtDeleteEntry()
4001 si = ((struct ldtentry *) t)->next; in dtDeleteEntry()
4003 si = ((struct idtentry *) t)->next; in dtDeleteEntry()
4004 t->next = si; in dtDeleteEntry()
4005 t->cnt = 1; in dtDeleteEntry()
4015 lv->length = n; in dtDeleteEntry()
4016 dtlck->index++; in dtDeleteEntry()
4019 if (dtlck->index < dtlck->maxcnt) in dtDeleteEntry()
4023 lv = & dtlck->lv[0]; in dtDeleteEntry()
4026 lv->offset = si; in dtDeleteEntry()
4034 t = &p->slot[si]; in dtDeleteEntry()
4035 t->cnt = 1; in dtDeleteEntry()
4036 si = t->next; in dtDeleteEntry()
4040 lv->length = n; in dtDeleteEntry()
4041 dtlck->index++; in dtDeleteEntry()
4046 t->next = p->header.freelist; in dtDeleteEntry()
4047 p->header.freelist = fsi; in dtDeleteEntry()
4048 p->header.freecnt += freecnt; in dtDeleteEntry()
4053 si = p->header.nextindex; in dtDeleteEntry()
4054 if (fi < si - 1) in dtDeleteEntry()
4055 memmove(&stbl[fi], &stbl[fi + 1], si - fi - 1); in dtDeleteEntry()
4057 p->header.nextindex--; in dtDeleteEntry()
4087 if (dtlck->index >= dtlck->maxcnt) in dtTruncateEntry()
4089 lv = & dtlck->lv[dtlck->index]; in dtTruncateEntry()
4091 lv->offset = tsi; in dtTruncateEntry()
4094 t = &p->slot[tsi]; in dtTruncateEntry()
4095 ASSERT(p->header.flag & BT_INTERNAL); in dtTruncateEntry()
4096 ((struct idtentry *) t)->namlen = 0; in dtTruncateEntry()
4097 si = ((struct idtentry *) t)->next; in dtTruncateEntry()
4098 ((struct idtentry *) t)->next = -1; in dtTruncateEntry()
4110 lv->length = n; in dtTruncateEntry()
4111 dtlck->index++; in dtTruncateEntry()
4114 if (dtlck->index < dtlck->maxcnt) in dtTruncateEntry()
4118 lv = & dtlck->lv[0]; in dtTruncateEntry()
4121 lv->offset = si; in dtTruncateEntry()
4129 t = &p->slot[si]; in dtTruncateEntry()
4130 t->cnt = 1; in dtTruncateEntry()
4131 si = t->next; in dtTruncateEntry()
4135 lv->length = n; in dtTruncateEntry()
4136 dtlck->index++; in dtTruncateEntry()
4143 t->next = p->header.freelist; in dtTruncateEntry()
4144 p->header.freelist = fsi; in dtTruncateEntry()
4145 p->header.freecnt += freecnt; in dtTruncateEntry()
4164 fsi = p->header.freelist; in dtLinelockFreelist()
4167 if (dtlck->index >= dtlck->maxcnt) in dtLinelockFreelist()
4169 lv = & dtlck->lv[dtlck->index]; in dtLinelockFreelist()
4171 lv->offset = fsi; in dtLinelockFreelist()
4176 t = &p->slot[fsi]; in dtLinelockFreelist()
4177 si = t->next; in dtLinelockFreelist()
4184 lv->length = n; in dtLinelockFreelist()
4185 dtlck->index++; in dtLinelockFreelist()
4188 if (dtlck->index < dtlck->maxcnt) in dtLinelockFreelist()
4192 lv = & dtlck->lv[0]; in dtLinelockFreelist()
4195 lv->offset = si; in dtLinelockFreelist()
4202 t = &p->slot[si]; in dtLinelockFreelist()
4203 si = t->next; in dtLinelockFreelist()
4207 lv->length = n; in dtLinelockFreelist()
4208 dtlck->index++; in dtLinelockFreelist()
4220 * tid - Transaction id
4221 * ip - Inode of parent directory
4222 * key - Name of entry to be modified
4223 * orig_ino - Original inode number expected in entry
4224 * new_ino - New inode number to put into entry
4225 * flag - JFS_RENAME
4228 * -ESTALE - If entry found does not match orig_ino passed in
4229 * -ENOENT - If no entry can be found to match key
4230 * 0 - If successfully modified entry
4264 dtlck = (struct dt_lock *) & tlck->lock; in dtModify()
4271 ASSERT(dtlck->index == 0); in dtModify()
4272 lv = & dtlck->lv[0]; in dtModify()
4273 lv->offset = entry_si; in dtModify()
4274 lv->length = 1; in dtModify()
4275 dtlck->index++; in dtModify()
4278 entry = (struct ldtentry *) & p->slot[entry_si]; in dtModify()
4281 entry->inumber = cpu_to_le32(new_ino); in dtModify()