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))) { \
122 jfs_error((IP)->i_sb, \
125 RC = -EIO; \
159 loff_t * offset, struct btstack * btstack);
185 #define ciToUpper(c) UniStrupr((c)->name)
241 s64 offset; in find_index() local
249 maxWarnings--; in find_index()
254 if (index >= jfs_ip->next_index) { in find_index()
264 slot = &jfs_ip->i_dirtable[index - 2]; in find_index()
266 offset = (index - 2) * sizeof(struct dir_table_slot); in find_index()
267 page_offset = offset & (PSIZE - 1); in find_index()
268 blkno = ((offset + 1) >> L2PSIZE) << in find_index()
269 JFS_SBI(ip->i_sb)->l2nbperpage; in find_index()
285 (struct dir_table_slot *) ((char *) (*mp)->data + in find_index()
299 llck = (struct linelock *) tlck->lock; in lock_index()
301 if (llck->index >= llck->maxcnt) in lock_index()
303 lv = &llck->lv[llck->index]; in lock_index()
309 lv->offset = ((index - 2) & 511) >> 1; in lock_index()
310 lv->length = 1; in lock_index()
311 llck->index++; in lock_index()
323 struct super_block *sb = ip->i_sb; in add_index()
332 s64 offset; in add_index() local
339 if (jfs_ip->next_index < 2) { in add_index()
341 jfs_ip->next_index); in add_index()
342 jfs_ip->next_index = 2; in add_index()
345 index = jfs_ip->next_index++; in add_index()
351 ip->i_size = (loff_t) (index - 1) << 3; in add_index()
356 dirtab_slot = &jfs_ip->i_dirtable[index-2]; in add_index()
357 dirtab_slot->flag = DIR_INDEX_VALID; in add_index()
358 dirtab_slot->slot = slot; in add_index()
372 if (dquot_alloc_block(ip, sbi->nbperpage)) in add_index()
374 if (dbAlloc(ip, 0, sbi->nbperpage, &xaddr)) { in add_index()
375 dquot_free_block(ip, sbi->nbperpage); in add_index()
383 memcpy(temp_table, &jfs_ip->i_dirtable, sizeof(temp_table)); in add_index()
386 * Initialize empty x-tree in add_index()
393 if (xtInsert(tid, ip, 0, 0, sbi->nbperpage, &xaddr, 0)) { in add_index()
396 memcpy(&jfs_ip->i_dirtable, temp_table, in add_index()
398 dbFree(ip, xaddr, sbi->nbperpage); in add_index()
399 dquot_free_block(ip, sbi->nbperpage); in add_index()
402 ip->i_size = PSIZE; in add_index()
408 memcpy(&jfs_ip->i_dirtable, temp_table, in add_index()
413 llck = (struct linelock *) & tlck->lock; in add_index()
414 ASSERT(llck->index == 0); in add_index()
415 lv = &llck->lv[0]; in add_index()
417 lv->offset = 0; in add_index()
418 lv->length = 6; /* tlckDATA slot size is 16 bytes */ in add_index()
419 llck->index++; in add_index()
421 memcpy(mp->data, temp_table, sizeof(temp_table)); in add_index()
432 offset = (index - 2) * sizeof(struct dir_table_slot); in add_index()
433 page_offset = offset & (PSIZE - 1); in add_index()
434 blkno = ((offset + 1) >> L2PSIZE) << sbi->l2nbperpage; in add_index()
440 if (xtInsert(tid, ip, 0, blkno, sbi->nbperpage, &xaddr, 0)) { in add_index()
444 ip->i_size += PSIZE; in add_index()
447 memset(mp->data, 0, PSIZE); /* Just looks better */ in add_index()
449 xtTruncate(tid, ip, offset, COMMIT_PWMAP); in add_index()
461 (struct dir_table_slot *) ((char *) mp->data + page_offset); in add_index()
462 dirtab_slot->flag = DIR_INDEX_VALID; in add_index()
463 dirtab_slot->slot = slot; in add_index()
473 jfs_ip->next_index--; in add_index()
494 dirtab_slot->flag = DIR_INDEX_FREE; in free_index()
495 dirtab_slot->slot = dirtab_slot->addr1 = 0; in free_index()
496 dirtab_slot->addr2 = cpu_to_le32(next); in free_index()
522 dirtab_slot->slot = slot; in modify_index()
545 return -EIO; in read_index()
564 * return: 0 - search result on stack, leaf page pinned;
565 * errno - I/O error
579 int psize = 288; /* initial in-line directory */ in dtSearch()
582 struct super_block *sb = ip->i_sb; in dtSearch()
587 rc = -ENOMEM; in dtSearch()
592 /* uppercase search key for c-i directory */ in dtSearch()
593 UniStrcpy(ciKey.name, key->name); in dtSearch()
594 ciKey.namlen = key->namlen; in dtSearch()
596 /* only uppercase if case-insensitive support is on */ in dtSearch()
597 if ((JFS_SBI(sb)->mntflag & JFS_OS2) == JFS_OS2) { in dtSearch()
603 btstack->nsplit = 1; in dtSearch()
633 for (base = 0, lim = p->header.nextindex; lim; lim >>= 1) { in dtSearch()
637 rc = -EIO; in dtSearch()
641 if (p->header.flag & BT_LEAF) { in dtSearch()
645 JFS_SBI(sb)->mntflag); in dtSearch()
657 /* search hit - leaf page: in dtSearch()
660 if (p->header.flag & BT_LEAF) { in dtSearch()
662 ((struct ldtentry *) & p->slot[stbl[index]])->inumber); in dtSearch()
678 rc = -EEXIST; in dtSearch()
688 rc = -ESTALE; in dtSearch()
697 btsp = btstack->top; in dtSearch()
698 btsp->bn = bn; in dtSearch()
699 btsp->index = index; in dtSearch()
700 btsp->mp = mp; in dtSearch()
706 /* search hit - internal page: in dtSearch()
714 --lim; in dtSearch()
725 * search miss - leaf page in dtSearch()
730 if (p->header.flag & BT_LEAF) { in dtSearch()
736 rc = -ENOENT; in dtSearch()
746 btsp = btstack->top; in dtSearch()
747 btsp->bn = bn; in dtSearch()
748 btsp->index = base; in dtSearch()
749 btsp->mp = mp; in dtSearch()
756 * search miss - internal page in dtSearch()
758 * if base is non-zero, decrement base by one to get the parent in dtSearch()
761 index = base ? base - 1 : base; in dtSearch()
774 rc = -EIO; in dtSearch()
777 btstack->nsplit++; in dtSearch()
783 pxd = (pxd_t *) & p->slot[stbl[index]]; in dtSearch()
785 psize = lengthPXD(pxd) << JFS_SBI(ip->i_sb)->l2bsize; in dtSearch()
811 * return: 0 - success;
812 * errno - failure;
818 struct metapage *mp; /* meta-page buffer */ in dtInsert()
819 dtpage_t *p; /* base B+-tree index page */ in dtInsert()
836 DT_GETSEARCH(ip, btstack->top, bn, mp, p, index); in dtInsert()
842 if (JFS_IP(ip)->next_index == DIREND) { in dtInsert()
844 return -EMLINK; in dtInsert()
846 n = NDTLEAF(name->namlen); in dtInsert()
850 n = NDTLEAF_LEGACY(name->namlen); in dtInsert()
862 if (n > p->header.freecnt) { in dtInsert()
882 dtlck = (struct dt_lock *) & tlck->lock; in dtInsert()
883 ASSERT(dtlck->index == 0); in dtInsert()
884 lv = & dtlck->lv[0]; in dtInsert()
887 lv->offset = 0; in dtInsert()
888 lv->length = 1; in dtInsert()
889 dtlck->index++; in dtInsert()
893 /* linelock stbl of non-root leaf page */ in dtInsert()
894 if (!(p->header.flag & BT_ROOT)) { in dtInsert()
895 if (dtlck->index >= dtlck->maxcnt) in dtInsert()
897 lv = & dtlck->lv[dtlck->index]; in dtInsert()
899 lv->offset = p->header.stblindex + n; in dtInsert()
900 lv->length = in dtInsert()
901 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - n + 1; in dtInsert()
902 dtlck->index++; in dtInsert()
919 * return: 0 - success;
920 * errno - failure;
926 struct jfs_sb_info *sbi = JFS_SBI(ip->i_sb); in dtSplitUp()
928 struct metapage *smp; in dtSplitUp() local
942 ddata_t *data = split->data; in dtSplitUp()
950 smp = split->mp; in dtSplitUp()
951 sp = DT_PAGE(ip, smp); in dtSplitUp()
955 DT_PUTPAGE(smp); in dtSplitUp()
956 rc = -ENOMEM; in dtSplitUp()
969 if (sp->header.flag & BT_ROOT) { in dtSplitUp()
974 n = sbi->bsize >> L2DTSLOTSIZE; in dtSplitUp()
975 n -= (n + 31) >> L2DTSLOTSIZE; /* stbl size */ in dtSplitUp()
976 n -= DTROOTMAXSLOT - sp->header.freecnt; /* header + entries */ in dtSplitUp()
977 if (n <= split->nslot) in dtSplitUp()
980 DT_PUTPAGE(smp); in dtSplitUp()
989 split->pxdlist = &pxdlist; in dtSplitUp()
997 DT_PUTPAGE(smp); in dtSplitUp()
1000 ip->i_size = xlen << sbi->l2bsize; in dtSplitUp()
1011 pxd = &sp->header.self; in dtSplitUp()
1013 xsize = xlen << sbi->l2bsize; in dtSplitUp()
1017 n -= (n + 31) >> L2DTSLOTSIZE; /* stbl size */ in dtSplitUp()
1018 if ((n + sp->header.freecnt) <= split->nslot) in dtSplitUp()
1029 if ((rc = dbReAlloc(sbi->ipbmap, xaddr, (s64) xlen, in dtSplitUp()
1038 split->pxdlist = &pxdlist; in dtSplitUp()
1047 xlen = lengthPXD(pxd) - n; in dtSplitUp()
1052 ip->i_size = lengthPXD(pxd) << sbi->l2bsize; in dtSplitUp()
1056 DT_PUTPAGE(smp); in dtSplitUp()
1071 n = btstack->nsplit; in dtSplitUp()
1073 xlen = sbi->nbperpage; in dtSplitUp()
1074 for (pxd = pxdlist.pxd; n > 0; n--, pxd++) { in dtSplitUp()
1082 DT_PUTPAGE(smp); in dtSplitUp()
1088 split->pxdlist = &pxdlist; in dtSplitUp()
1090 DT_PUTPAGE(smp); in dtSplitUp()
1097 ip->i_size += PSIZE; in dtSplitUp()
1124 lmp = smp; in dtSplitUp()
1131 DT_GETPAGE(ip, parent->bn, smp, PSIZE, sp, rc); in dtSplitUp()
1142 skip = parent->index + 1; in dtSplitUp()
1165 * the entire key must be retained for the next-to-leftmost in dtSplitUp()
1169 switch (rp->header.flag & BT_TYPE) { in dtSplitUp()
1176 if ((sp->header.flag & BT_ROOT && skip > 1) || in dtSplitUp()
1177 sp->header.prev != 0 || skip > 1) { in dtSplitUp()
1180 lp->header.nextindex-1, in dtSplitUp()
1182 sbi->mntflag); in dtSplitUp()
1186 DT_PUTPAGE(smp); in dtSplitUp()
1194 dtGetKey(rp, 0, &key, sbi->mntflag); in dtSplitUp()
1197 if ((sbi->mntflag & JFS_OS2) == JFS_OS2) in dtSplitUp()
1205 dtGetKey(rp, 0, &key, sbi->mntflag); in dtSplitUp()
1220 data->xd = rpxd; /* child page xd */ in dtSplitUp()
1223 * parent page is full - split the parent page in dtSplitUp()
1225 if (n > sp->header.freecnt) { in dtSplitUp()
1227 split->mp = smp; in dtSplitUp()
1228 split->index = skip; /* index at insert */ in dtSplitUp()
1229 split->nslot = n; in dtSplitUp()
1230 split->key = &key; in dtSplitUp()
1231 /* split->data = data; */ in dtSplitUp()
1240 rc = (sp->header.flag & BT_ROOT) ? in dtSplitUp()
1244 DT_PUTPAGE(smp); in dtSplitUp()
1248 /* smp and rmp are pinned */ in dtSplitUp()
1251 * parent page is not full - insert router entry in parent page in dtSplitUp()
1254 BT_MARK_DIRTY(smp, ip); in dtSplitUp()
1258 tlck = txLock(tid, ip, smp, tlckDTREE | tlckENTRY); in dtSplitUp()
1259 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitUp()
1260 ASSERT(dtlck->index == 0); in dtSplitUp()
1261 lv = & dtlck->lv[0]; in dtSplitUp()
1264 lv->offset = 0; in dtSplitUp()
1265 lv->length = 1; in dtSplitUp()
1266 dtlck->index++; in dtSplitUp()
1268 /* linelock stbl of non-root parent page */ in dtSplitUp()
1269 if (!(sp->header.flag & BT_ROOT)) { in dtSplitUp()
1272 lv->offset = sp->header.stblindex + n; in dtSplitUp()
1273 lv->length = in dtSplitUp()
1274 ((sp->header.nextindex - in dtSplitUp()
1275 1) >> L2DTSLOTSIZE) - n + 1; in dtSplitUp()
1276 dtlck->index++; in dtSplitUp()
1287 DT_PUTPAGE(smp); in dtSplitUp()
1315 * function: Split a non-root page of a btree.
1319 * return: 0 - success;
1320 * errno - failure;
1327 struct metapage *smp; in dtSplitPage() local
1350 smp = split->mp; in dtSplitPage()
1351 sp = DT_PAGE(ip, smp); in dtSplitPage()
1356 pxdlist = split->pxdlist; in dtSplitPage()
1357 pxd = &pxdlist->pxd[pxdlist->npxd]; in dtSplitPage()
1358 pxdlist->npxd++; in dtSplitPage()
1362 return -EIO; in dtSplitPage()
1371 jfs_info("dtSplitPage: ip:0x%p smp:0x%p rmp:0x%p", ip, smp, rmp); in dtSplitPage()
1378 rdtlck = (struct dt_lock *) & tlck->lock; in dtSplitPage()
1380 rp = (dtpage_t *) rmp->data; in dtSplitPage()
1382 rp->header.self = *pxd; in dtSplitPage()
1384 BT_MARK_DIRTY(smp, ip); in dtSplitPage()
1390 tlck = txLock(tid, ip, smp, tlckDTREE | tlckENTRY); in dtSplitPage()
1391 sdtlck = (struct dt_lock *) & tlck->lock; in dtSplitPage()
1394 ASSERT(sdtlck->index == 0); in dtSplitPage()
1395 slv = & sdtlck->lv[0]; in dtSplitPage()
1396 slv->offset = 0; in dtSplitPage()
1397 slv->length = 1; in dtSplitPage()
1398 sdtlck->index++; in dtSplitPage()
1403 nextbn = le64_to_cpu(sp->header.next); in dtSplitPage()
1404 rp->header.next = cpu_to_le64(nextbn); in dtSplitPage()
1405 rp->header.prev = cpu_to_le64(addressPXD(&sp->header.self)); in dtSplitPage()
1406 sp->header.next = cpu_to_le64(rbn); in dtSplitPage()
1411 rp->header.flag = sp->header.flag; in dtSplitPage()
1414 rp->header.nextindex = 0; in dtSplitPage()
1415 rp->header.stblindex = 1; in dtSplitPage()
1418 rp->header.maxslot = n; in dtSplitPage()
1422 fsi = rp->header.stblindex + stblsize; in dtSplitPage()
1423 rp->header.freelist = fsi; in dtSplitPage()
1424 rp->header.freecnt = rp->header.maxslot - fsi; in dtSplitPage()
1439 if (nextbn == 0 && split->index == sp->header.nextindex) { in dtSplitPage()
1441 rlv = & rdtlck->lv[rdtlck->index]; in dtSplitPage()
1442 rlv->offset = 0; in dtSplitPage()
1443 rlv->length = 2; in dtSplitPage()
1444 rdtlck->index++; in dtSplitPage()
1449 f = &rp->slot[fsi]; in dtSplitPage()
1450 for (fsi++; fsi < rp->header.maxslot; f++, fsi++) in dtSplitPage()
1451 f->next = fsi; in dtSplitPage()
1452 f->next = -1; in dtSplitPage()
1455 dtInsertEntry(rp, 0, split->key, split->data, &rdtlck); in dtSplitPage()
1461 * non-sequential insert (at possibly middle page) in dtSplitPage()
1481 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitPage()
1484 lv = & dtlck->lv[dtlck->index]; in dtSplitPage()
1485 lv->offset = 0; in dtSplitPage()
1486 lv->length = 1; in dtSplitPage()
1487 dtlck->index++; in dtSplitPage()
1489 p->header.prev = cpu_to_le64(rbn); in dtSplitPage()
1497 skip = split->index; in dtSplitPage()
1507 stbl = (u8 *) & sp->slot[sp->header.stblindex]; in dtSplitPage()
1508 nextindex = sp->header.nextindex; in dtSplitPage()
1512 n = split->nslot; in dtSplitPage()
1515 switch (sp->header.flag & BT_TYPE) { in dtSplitPage()
1517 ldtentry = (struct ldtentry *) & sp->slot[si]; in dtSplitPage()
1519 n = NDTLEAF(ldtentry->namlen); in dtSplitPage()
1521 n = NDTLEAF_LEGACY(ldtentry-> in dtSplitPage()
1526 idtentry = (struct idtentry *) & sp->slot[si]; in dtSplitPage()
1527 n = NDTINTERNAL(idtentry->namlen); in dtSplitPage()
1553 rlv = & rdtlck->lv[rdtlck->index]; in dtSplitPage()
1554 rlv->offset = 0; in dtSplitPage()
1555 rlv->length = 5; in dtSplitPage()
1556 rdtlck->index++; in dtSplitPage()
1560 sp->header.nextindex = nxt; in dtSplitPage()
1565 fsi = rp->header.freelist; in dtSplitPage()
1566 f = &rp->slot[fsi]; in dtSplitPage()
1567 for (fsi++; fsi < rp->header.maxslot; f++, fsi++) in dtSplitPage()
1568 f->next = fsi; in dtSplitPage()
1569 f->next = -1; in dtSplitPage()
1574 if ((rp->header.flag & BT_LEAF) && DO_INDEX(ip)) { in dtSplitPage()
1579 for (n = 0; n < rp->header.nextindex; n++) { in dtSplitPage()
1580 ldtentry = (struct ldtentry *) & rp->slot[stbl[n]]; in dtSplitPage()
1581 modify_index(tid, ip, le32_to_cpu(ldtentry->index), in dtSplitPage()
1593 dtInsertEntry(sp, skip, split->key, split->data, &sdtlck); in dtSplitPage()
1596 if (sdtlck->index >= sdtlck->maxcnt) in dtSplitPage()
1598 slv = & sdtlck->lv[sdtlck->index]; in dtSplitPage()
1600 slv->offset = sp->header.stblindex + n; in dtSplitPage()
1601 slv->length = in dtSplitPage()
1602 ((sp->header.nextindex - 1) >> L2DTSLOTSIZE) - n + 1; in dtSplitPage()
1603 sdtlck->index++; in dtSplitPage()
1610 skip -= nxt; in dtSplitPage()
1613 dtInsertEntry(rp, skip, split->key, split->data, &rdtlck); in dtSplitPage()
1631 * return: 0 - success;
1632 * errno - failure;
1638 struct super_block *sb = ip->i_sb; in dtExtendPage()
1640 struct metapage *smp, *pmp, *mp; in dtExtendPage() local
1661 smp = split->mp; in dtExtendPage()
1662 sp = DT_PAGE(ip, smp); in dtExtendPage()
1666 DT_GETPAGE(ip, parent->bn, pmp, PSIZE, pp, rc); in dtExtendPage()
1673 pxdlist = split->pxdlist; in dtExtendPage()
1674 pxd = &pxdlist->pxd[pxdlist->npxd]; in dtExtendPage()
1675 pxdlist->npxd++; in dtExtendPage()
1678 tpxd = &sp->header.self; in dtExtendPage()
1680 /* in-place extension */ in dtExtendPage()
1690 pxdlock = (struct pxd_lock *) & tlck->lock; in dtExtendPage()
1691 pxdlock->flag = mlckFREEPXD; in dtExtendPage()
1692 pxdlock->pxd = sp->header.self; in dtExtendPage()
1693 pxdlock->index = 1; in dtExtendPage()
1703 for (n = 0; n < sp->header.nextindex; n++) { in dtExtendPage()
1705 (struct ldtentry *) & sp->slot[stbl[n]]; in dtExtendPage()
1707 le32_to_cpu(ldtentry->index), in dtExtendPage()
1718 sp->header.self = *pxd; in dtExtendPage()
1720 jfs_info("dtExtendPage: ip:0x%p smp:0x%p sp:0x%p", ip, smp, sp); in dtExtendPage()
1722 BT_MARK_DIRTY(smp, ip); in dtExtendPage()
1726 tlck = txLock(tid, ip, smp, tlckDTREE | type); in dtExtendPage()
1727 dtlck = (struct dt_lock *) & tlck->lock; in dtExtendPage()
1728 lv = & dtlck->lv[0]; in dtExtendPage()
1732 xsize = xlen << JFS_SBI(sb)->l2bsize; in dtExtendPage()
1737 oldstblindex = sp->header.stblindex; in dtExtendPage()
1738 oldstblsize = (sp->header.maxslot + 31) >> L2DTSLOTSIZE; in dtExtendPage()
1739 newstblindex = sp->header.maxslot; in dtExtendPage()
1742 memcpy(&sp->slot[newstblindex], &sp->slot[oldstblindex], in dtExtendPage()
1743 sp->header.nextindex); in dtExtendPage()
1746 * in-line extension: linelock old area of extended page in dtExtendPage()
1750 lv->offset = 0; in dtExtendPage()
1751 lv->length = 1; in dtExtendPage()
1752 dtlck->index++; in dtExtendPage()
1756 lv->offset = newstblindex; in dtExtendPage()
1757 lv->length = newstblsize; in dtExtendPage()
1763 lv->offset = 0; in dtExtendPage()
1764 lv->length = sp->header.maxslot + newstblsize; in dtExtendPage()
1767 dtlck->index++; in dtExtendPage()
1769 sp->header.maxslot = n; in dtExtendPage()
1770 sp->header.stblindex = newstblindex; in dtExtendPage()
1771 /* sp->header.nextindex remains the same */ in dtExtendPage()
1777 f = &sp->slot[fsi]; in dtExtendPage()
1778 last = sp->header.freelist; in dtExtendPage()
1780 f->next = last; in dtExtendPage()
1783 sp->header.freelist = last; in dtExtendPage()
1784 sp->header.freecnt += oldstblsize; in dtExtendPage()
1791 f = &sp->slot[fsi]; in dtExtendPage()
1792 for (fsi++; fsi < sp->header.maxslot; f++, fsi++) in dtExtendPage()
1793 f->next = fsi; in dtExtendPage()
1794 f->next = -1; in dtExtendPage()
1797 fsi = sp->header.freelist; in dtExtendPage()
1798 if (fsi == -1) in dtExtendPage()
1799 sp->header.freelist = n; in dtExtendPage()
1802 f = &sp->slot[fsi]; in dtExtendPage()
1803 fsi = f->next; in dtExtendPage()
1804 } while (fsi != -1); in dtExtendPage()
1806 f->next = n; in dtExtendPage()
1809 sp->header.freecnt += sp->header.maxslot - n; in dtExtendPage()
1814 dtInsertEntry(sp, split->index, split->key, split->data, &dtlck); in dtExtendPage()
1821 n = sp->header.maxslot >> 2; in dtExtendPage()
1822 if (sp->header.freelist < n) in dtExtendPage()
1833 dtlck = (struct dt_lock *) & tlck->lock; in dtExtendPage()
1834 lv = & dtlck->lv[dtlck->index]; in dtExtendPage()
1836 /* linelock parent entry - 1st slot */ in dtExtendPage()
1837 lv->offset = 1; in dtExtendPage()
1838 lv->length = 1; in dtExtendPage()
1839 dtlck->index++; in dtExtendPage()
1842 tpxd = (pxd_t *) & pp->slot[1]; in dtExtendPage()
1858 * since root page << non-root page, and
1864 * return: 0 - success;
1865 * errno - failure;
1871 struct super_block *sb = ip->i_sb; in dtSplitRoot()
1872 struct metapage *smp; in dtSplitRoot() local
1892 smp = split->mp; in dtSplitRoot()
1893 sp = &JFS_IP(ip)->i_dtroot; in dtSplitRoot()
1901 pxdlist = split->pxdlist; in dtSplitRoot()
1902 pxd = &pxdlist->pxd[pxdlist->npxd]; in dtSplitRoot()
1903 pxdlist->npxd++; in dtSplitRoot()
1906 xsize = xlen << JFS_SBI(sb)->l2bsize; in dtSplitRoot()
1909 return -EIO; in dtSplitRoot()
1911 rp = rmp->data; in dtSplitRoot()
1925 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitRoot()
1927 rp->header.flag = in dtSplitRoot()
1928 (sp->header.flag & BT_LEAF) ? BT_LEAF : BT_INTERNAL; in dtSplitRoot()
1929 rp->header.self = *pxd; in dtSplitRoot()
1932 rp->header.next = 0; in dtSplitRoot()
1933 rp->header.prev = 0; in dtSplitRoot()
1936 * move in-line root page into new right page extent in dtSplitRoot()
1939 ASSERT(dtlck->index == 0); in dtSplitRoot()
1940 lv = & dtlck->lv[0]; in dtSplitRoot()
1941 lv->offset = 0; in dtSplitRoot()
1942 lv->length = 10; /* 1 + 8 + 1 */ in dtSplitRoot()
1943 dtlck->index++; in dtSplitRoot()
1946 rp->header.maxslot = n; in dtSplitRoot()
1950 rp->header.stblindex = DTROOTMAXSLOT; in dtSplitRoot()
1951 stbl = (s8 *) & rp->slot[DTROOTMAXSLOT]; in dtSplitRoot()
1952 memcpy(stbl, sp->header.stbl, sp->header.nextindex); in dtSplitRoot()
1953 rp->header.nextindex = sp->header.nextindex; in dtSplitRoot()
1956 memcpy(&rp->slot[1], &sp->slot[1], IDATASIZE); in dtSplitRoot()
1963 f = &rp->slot[fsi]; in dtSplitRoot()
1964 for (fsi++; fsi < rp->header.maxslot; f++, fsi++) in dtSplitRoot()
1965 f->next = fsi; in dtSplitRoot()
1966 f->next = -1; in dtSplitRoot()
1969 fsi = sp->header.freelist; in dtSplitRoot()
1970 if (fsi == -1) in dtSplitRoot()
1971 rp->header.freelist = n; in dtSplitRoot()
1973 rp->header.freelist = fsi; in dtSplitRoot()
1976 f = &rp->slot[fsi]; in dtSplitRoot()
1977 fsi = f->next; in dtSplitRoot()
1980 f->next = n; in dtSplitRoot()
1983 rp->header.freecnt = sp->header.freecnt + rp->header.maxslot - n; in dtSplitRoot()
1988 if ((rp->header.flag & BT_LEAF) && DO_INDEX(ip)) { in dtSplitRoot()
1994 for (n = 0; n < rp->header.nextindex; n++) { in dtSplitRoot()
1995 ldtentry = (struct ldtentry *) & rp->slot[stbl[n]]; in dtSplitRoot()
1996 modify_index(tid, ip, le32_to_cpu(ldtentry->index), in dtSplitRoot()
2006 dtInsertEntry(rp, split->index, split->key, split->data, &dtlck); in dtSplitRoot()
2011 * set the 1st entry offset to 0, which force the left-most key in dtSplitRoot()
2014 * The btree comparison code guarantees that the left-most key on any in dtSplitRoot()
2017 BT_MARK_DIRTY(smp, ip); in dtSplitRoot()
2019 * acquire a transaction lock on the root page (in-memory inode) in dtSplitRoot()
2021 tlck = txLock(tid, ip, smp, tlckDTREE | tlckNEW | tlckBTROOT); in dtSplitRoot()
2022 dtlck = (struct dt_lock *) & tlck->lock; in dtSplitRoot()
2025 ASSERT(dtlck->index == 0); in dtSplitRoot()
2026 lv = & dtlck->lv[0]; in dtSplitRoot()
2027 lv->offset = 0; in dtSplitRoot()
2028 lv->length = DTROOTMAXSLOT; in dtSplitRoot()
2029 dtlck->index++; in dtSplitRoot()
2032 if (sp->header.flag & BT_LEAF) { in dtSplitRoot()
2033 sp->header.flag &= ~BT_LEAF; in dtSplitRoot()
2034 sp->header.flag |= BT_INTERNAL; in dtSplitRoot()
2038 s = (struct idtentry *) & sp->slot[DTENTRYSTART]; in dtSplitRoot()
2041 s->next = -1; in dtSplitRoot()
2042 s->namlen = 0; in dtSplitRoot()
2044 stbl = sp->header.stbl; in dtSplitRoot()
2046 sp->header.nextindex = 1; in dtSplitRoot()
2050 f = &sp->slot[fsi]; in dtSplitRoot()
2054 f->next = fsi; in dtSplitRoot()
2055 f->next = -1; in dtSplitRoot()
2057 sp->header.freelist = DTENTRYSTART + 1; in dtSplitRoot()
2058 sp->header.freecnt = DTROOTMAXSLOT - (DTENTRYSTART + 1); in dtSplitRoot()
2112 ldtentry = (struct ldtentry *) & p->slot[stbl[index]]; in dtDelete()
2113 table_index = le32_to_cpu(ldtentry->index); in dtDelete()
2114 if (index == (p->header.nextindex - 1)) { in dtDelete()
2118 if ((p->header.flag & BT_ROOT) in dtDelete()
2119 || (p->header.next == 0)) in dtDelete()
2120 next_index = -1; in dtDelete()
2123 DT_GETPAGE(ip, le64_to_cpu(p->header.next), in dtDelete()
2126 next_index = -1; in dtDelete()
2130 (struct ldtentry *) & np-> in dtDelete()
2133 le32_to_cpu(ldtentry->index); in dtDelete()
2139 (struct ldtentry *) & p->slot[stbl[index + 1]]; in dtDelete()
2140 next_index = le32_to_cpu(ldtentry->index); in dtDelete()
2147 if (p->header.nextindex == 1) { in dtDelete()
2162 dtlck = (struct dt_lock *) & tlck->lock; in dtDelete()
2165 * Do not assume that dtlck->index will be zero. During a in dtDelete()
2171 if (dtlck->index >= dtlck->maxcnt) in dtDelete()
2173 lv = & dtlck->lv[dtlck->index]; in dtDelete()
2174 lv->offset = 0; in dtDelete()
2175 lv->length = 1; in dtDelete()
2176 dtlck->index++; in dtDelete()
2178 /* linelock stbl of non-root leaf page */ in dtDelete()
2179 if (!(p->header.flag & BT_ROOT)) { in dtDelete()
2180 if (dtlck->index >= dtlck->maxcnt) in dtDelete()
2182 lv = & dtlck->lv[dtlck->index]; in dtDelete()
2184 lv->offset = p->header.stblindex + i; in dtDelete()
2185 lv->length = in dtDelete()
2186 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - in dtDelete()
2188 dtlck->index++; in dtDelete()
2197 if (DO_INDEX(ip) && index < p->header.nextindex) { in dtDelete()
2202 for (i = index; i < p->header.nextindex; i++) { in dtDelete()
2204 (struct ldtentry *) & p->slot[stbl[i]]; in dtDelete()
2206 le32_to_cpu(ldtentry->index), in dtDelete()
2262 * free the non-root leaf page in dtDeleteUp()
2272 pxdlock = (struct pxd_lock *) & tlck->lock; in dtDeleteUp()
2273 pxdlock->flag = mlckFREEPXD; in dtDeleteUp()
2274 pxdlock->pxd = fp->header.self; in dtDeleteUp()
2275 pxdlock->index = 1; in dtDeleteUp()
2283 xlen = lengthPXD(&fp->header.self); in dtDeleteUp()
2301 DT_GETPAGE(ip, parent->bn, mp, PSIZE, p, rc); in dtDeleteUp()
2308 index = parent->index; in dtDeleteUp()
2313 nextindex = p->header.nextindex; in dtDeleteUp()
2324 if (p->header.flag & BT_ROOT) { in dtDeleteUp()
2348 pxdlock = (struct pxd_lock *) & tlck->lock; in dtDeleteUp()
2349 pxdlock->flag = mlckFREEPXD; in dtDeleteUp()
2350 pxdlock->pxd = p->header.self; in dtDeleteUp()
2351 pxdlock->index = 1; in dtDeleteUp()
2359 xlen = lengthPXD(&p->header.self); in dtDeleteUp()
2384 dtlck = (struct dt_lock *) & tlck->lock; in dtDeleteUp()
2387 if (dtlck->index >= dtlck->maxcnt) in dtDeleteUp()
2389 lv = & dtlck->lv[dtlck->index]; in dtDeleteUp()
2390 lv->offset = 0; in dtDeleteUp()
2391 lv->length = 1; in dtDeleteUp()
2392 dtlck->index++; in dtDeleteUp()
2394 /* linelock stbl of non-root leaf page */ in dtDeleteUp()
2395 if (!(p->header.flag & BT_ROOT)) { in dtDeleteUp()
2396 if (dtlck->index < dtlck->maxcnt) in dtDeleteUp()
2400 lv = & dtlck->lv[0]; in dtDeleteUp()
2403 lv->offset = p->header.stblindex + i; in dtDeleteUp()
2404 lv->length = in dtDeleteUp()
2405 ((p->header.nextindex - 1) >> L2DTSLOTSIZE) - in dtDeleteUp()
2407 dtlck->index++; in dtDeleteUp()
2415 ((p->header.flag & BT_ROOT) || p->header.prev == 0)) in dtDeleteUp()
2426 ip->i_size -= PSIZE; in dtDeleteUp()
2451 nextbn = le64_to_cpu(p->header.next); in dtRelink()
2452 prevbn = le64_to_cpu(p->header.prev); in dtRelink()
2469 dtlck = (struct dt_lock *) & tlck->lock; in dtRelink()
2472 if (dtlck->index >= dtlck->maxcnt) in dtRelink()
2474 lv = & dtlck->lv[dtlck->index]; in dtRelink()
2475 lv->offset = 0; in dtRelink()
2476 lv->length = 1; in dtRelink()
2477 dtlck->index++; in dtRelink()
2479 p->header.prev = cpu_to_le64(prevbn); in dtRelink()
2498 dtlck = (struct dt_lock *) & tlck->lock; in dtRelink()
2501 if (dtlck->index >= dtlck->maxcnt) in dtRelink()
2503 lv = & dtlck->lv[dtlck->index]; in dtRelink()
2504 lv->offset = 0; in dtRelink()
2505 lv->length = 1; in dtRelink()
2506 dtlck->index++; in dtRelink()
2508 p->header.next = cpu_to_le64(nextbn); in dtRelink()
2533 * If this was previously an non-empty directory, we need to remove in dtInitRoot()
2545 xflag_save = tblk->xflag; in dtInitRoot()
2546 tblk->xflag = 0; in dtInitRoot()
2558 tblk->xflag = xflag_save; in dtInitRoot()
2560 ip->i_size = 1; in dtInitRoot()
2562 jfs_ip->next_index = 2; in dtInitRoot()
2564 ip->i_size = IDATASIZE; in dtInitRoot()
2571 tlck = txLock(tid, ip, (struct metapage *) & jfs_ip->bxflag, in dtInitRoot()
2573 dtlck = (struct dt_lock *) & tlck->lock; in dtInitRoot()
2576 ASSERT(dtlck->index == 0); in dtInitRoot()
2577 lv = & dtlck->lv[0]; in dtInitRoot()
2578 lv->offset = 0; in dtInitRoot()
2579 lv->length = DTROOTMAXSLOT; in dtInitRoot()
2580 dtlck->index++; in dtInitRoot()
2582 p = &jfs_ip->i_dtroot; in dtInitRoot()
2584 p->header.flag = DXD_INDEX | BT_ROOT | BT_LEAF; in dtInitRoot()
2586 p->header.nextindex = 0; in dtInitRoot()
2590 f = &p->slot[fsi]; in dtInitRoot()
2594 f->next = fsi; in dtInitRoot()
2595 f->next = -1; in dtInitRoot()
2597 p->header.freelist = 1; in dtInitRoot()
2598 p->header.freecnt = 8; in dtInitRoot()
2601 p->header.idotdot = cpu_to_le32(idotdot); in dtInitRoot()
2627 tid = txBegin(inode->i_sb, 0); in add_missing_indices()
2637 ASSERT(p->header.flag & BT_LEAF); in add_missing_indices()
2641 tlck->type |= tlckBTROOT; in add_missing_indices()
2643 dtlck = (struct dt_lock *) &tlck->lock; in add_missing_indices()
2646 for (i = 0; i < p->header.nextindex; i++) { in add_missing_indices()
2647 d = (struct ldtentry *) &p->slot[stbl[i]]; in add_missing_indices()
2648 index = le32_to_cpu(d->index); in add_missing_indices()
2649 if ((index < 2) || (index >= JFS_IP(inode)->next_index)) { in add_missing_indices()
2650 d->index = cpu_to_le32(add_index(tid, inode, bn, i)); in add_missing_indices()
2651 if (dtlck->index >= dtlck->maxcnt) in add_missing_indices()
2653 lv = &dtlck->lv[dtlck->index]; in add_missing_indices()
2654 lv->offset = stbl[i]; in add_missing_indices()
2655 lv->length = 1; in add_missing_indices()
2656 dtlck->index++; in add_missing_indices()
2678 * function to determine next variable-sized jfs_dirent in buffer
2684 ((sizeof (struct jfs_dirent) + dirent->name_len + 1 + in next_jfs_dirent()
2685 sizeof (loff_t) - 1) & in next_jfs_dirent()
2686 ~(sizeof (loff_t) - 1))); in next_jfs_dirent()
2693 * from the specified entry offset
2697 * return: offset = (pn, index) of start entry
2703 struct nls_table *codepage = JFS_SBI(ip->i_sb)->nls_tab; in jfs_readdir()
2731 if (ctx->pos == DIREND) in jfs_readdir()
2739 * -1 = End of directory in jfs_readdir()
2743 dir_index = (u32) ctx->pos; in jfs_readdir()
2751 dir_index--; in jfs_readdir()
2757 (dir_index >= JFS_IP(ip)->next_index)) { in jfs_readdir()
2759 ctx->pos = DIREND; in jfs_readdir()
2765 ctx->pos = DIREND; in jfs_readdir()
2769 if (loop_count++ > JFS_IP(ip)->next_index) { in jfs_readdir()
2771 ctx->pos = DIREND; in jfs_readdir()
2775 if (dir_index == -1) { in jfs_readdir()
2776 ctx->pos = DIREND; in jfs_readdir()
2785 ctx->pos = DIREND; in jfs_readdir()
2788 if (p->header.flag & BT_INTERNAL) { in jfs_readdir()
2791 ctx->pos = DIREND; in jfs_readdir()
2799 ctx->pos = 1; in jfs_readdir()
2800 if (!dir_emit(ctx, ".", 1, ip->i_ino, DT_DIR)) in jfs_readdir()
2806 ctx->pos = 2; in jfs_readdir()
2811 * Find first entry of left-most leaf in jfs_readdir()
2814 ctx->pos = DIREND; in jfs_readdir()
2825 * Legacy filesystem - OS/2 & Linux JFS < 0.3.6 in jfs_readdir()
2829 * pn > 0: Real entries, pn=1 -> leftmost page in jfs_readdir()
2830 * pn = index = -1: No more entries in jfs_readdir()
2832 dtpos = ctx->pos; in jfs_readdir()
2835 ctx->pos = 1; in jfs_readdir()
2836 if (!dir_emit(ctx, ".", 1, ip->i_ino, DT_DIR)) in jfs_readdir()
2838 dtoffset->index = 2; in jfs_readdir()
2839 ctx->pos = dtpos; in jfs_readdir()
2842 if (dtoffset->pn == 0) { in jfs_readdir()
2843 if (dtoffset->index == 2) { in jfs_readdir()
2848 jfs_err("jfs_readdir called with invalid offset!"); in jfs_readdir()
2850 dtoffset->pn = 1; in jfs_readdir()
2851 dtoffset->index = 0; in jfs_readdir()
2852 ctx->pos = dtpos; in jfs_readdir()
2856 ctx->pos = DIREND; in jfs_readdir()
2860 if ((rc = dtReadNext(ip, &ctx->pos, &btstack))) { in jfs_readdir()
2863 ctx->pos = DIREND; in jfs_readdir()
2869 /* offset beyond directory eof ? */ in jfs_readdir()
2871 ctx->pos = DIREND; in jfs_readdir()
2880 ctx->pos = DIREND; in jfs_readdir()
2881 return -ENOMEM; in jfs_readdir()
2891 for (i = index; i < p->header.nextindex; i++) { in jfs_readdir()
2892 d = (struct ldtentry *) & p->slot[stbl[i]]; in jfs_readdir()
2894 if (((long) jfs_dirent + d->namlen + 1) > in jfs_readdir()
2902 d_namleft = d->namlen; in jfs_readdir()
2903 name_ptr = jfs_dirent->name; in jfs_readdir()
2904 jfs_dirent->ino = le32_to_cpu(d->inumber); in jfs_readdir()
2908 jfs_dirent->position = le32_to_cpu(d->index); in jfs_readdir()
2910 * d->index should always be valid, but it in jfs_readdir()
2916 if ((jfs_dirent->position < 2) || in jfs_readdir()
2917 (jfs_dirent->position >= in jfs_readdir()
2918 JFS_IP(ip)->next_index)) { in jfs_readdir()
2931 jfs_dirent->position = unique_pos++; in jfs_readdir()
2938 jfs_dirent->position++; in jfs_readdir()
2940 jfs_dirent->position = dtpos; in jfs_readdir()
2945 outlen = jfs_strfromUCS_le(name_ptr, d->name, len, in jfs_readdir()
2947 jfs_dirent->name_len = outlen; in jfs_readdir()
2950 next = d->next; in jfs_readdir()
2952 t = (struct dtslot *) & p->slot[next]; in jfs_readdir()
2954 d_namleft -= len; in jfs_readdir()
2957 jfs_error(ip->i_sb, in jfs_readdir()
2959 (long)ip->i_ino, in jfs_readdir()
2965 outlen = jfs_strfromUCS_le(name_ptr, t->name, in jfs_readdir()
2967 jfs_dirent->name_len += outlen; in jfs_readdir()
2969 next = t->next; in jfs_readdir()
2976 dtoffset->index++; in jfs_readdir()
2981 if (p->header.flag & BT_ROOT) in jfs_readdir()
2984 bn = le64_to_cpu(p->header.next); in jfs_readdir()
2986 /* update offset (pn:index) for new page */ in jfs_readdir()
2988 dtoffset->pn++; in jfs_readdir()
2989 dtoffset->index = 0; in jfs_readdir()
2999 while (jfs_dirents--) { in jfs_readdir()
3000 ctx->pos = jfs_dirent->position; in jfs_readdir()
3001 if (!dir_emit(ctx, jfs_dirent->name, in jfs_readdir()
3002 jfs_dirent->name_len, in jfs_readdir()
3003 jfs_dirent->ino, DT_UNKNOWN)) in jfs_readdir()
3014 ctx->pos = DIREND; in jfs_readdir()
3041 int psize = 288; /* initial in-line directory */ in dtReadFirst()
3063 if (p->header.flag & BT_LEAF) { in dtReadFirst()
3065 btsp = btstack->top; in dtReadFirst()
3066 btsp->bn = bn; in dtReadFirst()
3067 btsp->index = 0; in dtReadFirst()
3068 btsp->mp = mp; in dtReadFirst()
3078 jfs_error(ip->i_sb, "btstack overrun\n"); in dtReadFirst()
3080 return -EIO; in dtReadFirst()
3087 xd = (pxd_t *) & p->slot[stbl[0]]; in dtReadFirst()
3091 psize = lengthPXD(xd) << JFS_SBI(ip->i_sb)->l2bsize; in dtReadFirst()
3102 * function: get the page of the specified offset (pn:index)
3104 * return: if (offset > eof), bn = -1;
3109 static int dtReadNext(struct inode *ip, loff_t * offset, in dtReadNext() argument
3117 } *dtoffset = (struct dtoffset *) offset; in dtReadNext()
3134 DT_GETSEARCH(ip, btstack->top, bn, mp, p, index); in dtReadNext()
3136 /* get the start offset (pn:index) */ in dtReadNext()
3137 pn = dtoffset->pn - 1; /* Now pn = 0 represents leftmost leaf */ in dtReadNext()
3138 index = dtoffset->index; in dtReadNext()
3142 /* offset beyond eof ? */ in dtReadNext()
3143 if (index < p->header.nextindex) in dtReadNext()
3146 if (p->header.flag & BT_ROOT) { in dtReadNext()
3147 bn = -1; in dtReadNext()
3152 dtoffset->pn++; in dtReadNext()
3153 dtoffset->index = index = 0; in dtReadNext()
3157 /* start at non-leftmost page: scan parent pages for large pn */ in dtReadNext()
3158 if (p->header.flag & BT_ROOT) { in dtReadNext()
3159 bn = -1; in dtReadNext()
3169 bn = le64_to_cpu(p->header.next); in dtReadNext()
3174 /* offset beyond eof ? */ in dtReadNext()
3176 bn = -1; in dtReadNext()
3190 btsp = btstack->top; in dtReadNext()
3191 parent = btsp - 1; in dtReadNext()
3192 bn = parent->bn; in dtReadNext()
3198 while (pn >= p->header.nextindex) { in dtReadNext()
3199 pn -= p->header.nextindex; in dtReadNext()
3202 bn = le64_to_cpu(p->header.next); in dtReadNext()
3207 /* offset beyond eof ? */ in dtReadNext()
3209 bn = -1; in dtReadNext()
3219 parent->bn = bn; in dtReadNext()
3224 xd = (pxd_t *) & p->slot[stbl[pn]]; in dtReadNext()
3242 if (index >= p->header.nextindex) { in dtReadNext()
3243 bn = le64_to_cpu(p->header.next); in dtReadNext()
3248 /* offset beyond eof ? */ in dtReadNext()
3250 bn = -1; in dtReadNext()
3260 dtoffset->pn++; in dtReadNext()
3261 dtoffset->index = 0; in dtReadNext()
3266 btsp = btstack->top; in dtReadNext()
3267 btsp->bn = bn; in dtReadNext()
3268 btsp->index = dtoffset->index; in dtReadNext()
3269 btsp->mp = mp; in dtReadNext()
3296 * force the left-most key on internal pages, at any level of in dtCompare()
3304 * it descends to child of the entry anyway - in dtCompare()
3307 * if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & BT_LEAF)) in dtCompare()
3311 kname = key->name; in dtCompare()
3312 klen = key->namlen; in dtCompare()
3314 ih = (struct idtentry *) & p->slot[si]; in dtCompare()
3315 si = ih->next; in dtCompare()
3316 name = ih->name; in dtCompare()
3317 namlen = ih->namlen; in dtCompare()
3325 klen -= len; in dtCompare()
3326 namlen -= len; in dtCompare()
3332 t = (struct dtslot *) & p->slot[si]; in dtCompare()
3335 name = t->name; in dtCompare()
3339 klen -= len; in dtCompare()
3340 namlen -= len; in dtCompare()
3342 si = t->next; in dtCompare()
3345 return (klen - namlen); in dtCompare()
3375 * force the left-most key on internal pages, at any level of in ciCompare()
3383 * it descends to child of the entry anyway - in ciCompare()
3386 * if (e->index == 0 && h->prevpg == P_INVALID && !(h->flags & BT_LEAF)) in ciCompare()
3390 kname = key->name; in ciCompare()
3391 klen = key->namlen; in ciCompare()
3396 if (p->header.flag & BT_LEAF) { in ciCompare()
3397 lh = (struct ldtentry *) & p->slot[si]; in ciCompare()
3398 si = lh->next; in ciCompare()
3399 name = lh->name; in ciCompare()
3400 namlen = lh->namlen; in ciCompare()
3410 ih = (struct idtentry *) & p->slot[si]; in ciCompare()
3411 si = ih->next; in ciCompare()
3412 name = ih->name; in ciCompare()
3413 namlen = ih->namlen; in ciCompare()
3420 /* only uppercase if case-insensitive support is on */ in ciCompare()
3425 if ((rc = *kname - x)) in ciCompare()
3429 klen -= len; in ciCompare()
3430 namlen -= len; in ciCompare()
3435 t = (struct dtslot *) & p->slot[si]; in ciCompare()
3438 name = t->name; in ciCompare()
3440 /* only uppercase if case-insensitive support is on */ in ciCompare()
3446 if ((rc = *kname - x)) in ciCompare()
3450 klen -= len; in ciCompare()
3451 namlen -= len; in ciCompare()
3452 si = t->next; in ciCompare()
3455 return (klen - namlen); in ciCompare()
3466 * return: non-zero on error
3480 return -ENOMEM; in ciGetLeafPrefixKey()
3486 return -ENOMEM; in ciGetLeafPrefixKey()
3505 kname = key->name; in ciGetLeafPrefixKey()
3508 namlen; pl++, pr++, namlen--, klen++, kname++) { in ciGetLeafPrefixKey()
3511 key->namlen = klen + 1; in ciGetLeafPrefixKey()
3516 /* l->namlen <= r->namlen since l <= r */ in ciGetLeafPrefixKey()
3519 key->namlen = klen + 1; in ciGetLeafPrefixKey()
3520 } else /* l->namelen == r->namelen */ in ciGetLeafPrefixKey()
3521 key->namlen = klen; in ciGetLeafPrefixKey()
3551 if (p->header.flag & BT_LEAF) { in dtGetKey()
3552 lh = (struct ldtentry *) & p->slot[si]; in dtGetKey()
3553 si = lh->next; in dtGetKey()
3554 namlen = lh->namlen; in dtGetKey()
3555 name = lh->name; in dtGetKey()
3561 ih = (struct idtentry *) & p->slot[si]; in dtGetKey()
3562 si = ih->next; in dtGetKey()
3563 namlen = ih->namlen; in dtGetKey()
3564 name = ih->name; in dtGetKey()
3568 key->namlen = namlen; in dtGetKey()
3569 kname = key->name; in dtGetKey()
3581 t = &p->slot[si]; in dtGetKey()
3583 namlen -= len; in dtGetKey()
3585 UniStrncpy_from_le(kname, t->name, len); in dtGetKey()
3587 si = t->next; in dtGetKey()
3617 klen = key->namlen; in dtInsertEntry()
3618 kname = key->name; in dtInsertEntry()
3621 hsi = fsi = p->header.freelist; in dtInsertEntry()
3622 h = &p->slot[fsi]; in dtInsertEntry()
3623 p->header.freelist = h->next; in dtInsertEntry()
3624 --p->header.freecnt; in dtInsertEntry()
3627 if (dtlck->index >= dtlck->maxcnt) in dtInsertEntry()
3630 lv = & dtlck->lv[dtlck->index]; in dtInsertEntry()
3631 lv->offset = hsi; in dtInsertEntry()
3634 if (p->header.flag & BT_LEAF) { in dtInsertEntry()
3636 lh->next = h->next; in dtInsertEntry()
3637 lh->inumber = cpu_to_le32(data->leaf.ino); in dtInsertEntry()
3638 lh->namlen = klen; in dtInsertEntry()
3639 name = lh->name; in dtInsertEntry()
3640 if (data->leaf.ip) { in dtInsertEntry()
3642 if (!(p->header.flag & BT_ROOT)) in dtInsertEntry()
3643 bn = addressPXD(&p->header.self); in dtInsertEntry()
3644 lh->index = cpu_to_le32(add_index(data->leaf.tid, in dtInsertEntry()
3645 data->leaf.ip, in dtInsertEntry()
3651 ih->next = h->next; in dtInsertEntry()
3653 *xd = data->xd; in dtInsertEntry()
3654 ih->namlen = klen; in dtInsertEntry()
3655 name = ih->name; in dtInsertEntry()
3666 klen -= len; in dtInsertEntry()
3669 fsi = p->header.freelist; in dtInsertEntry()
3670 t = &p->slot[fsi]; in dtInsertEntry()
3671 p->header.freelist = t->next; in dtInsertEntry()
3672 --p->header.freecnt; in dtInsertEntry()
3677 lv->length = n; in dtInsertEntry()
3678 dtlck->index++; in dtInsertEntry()
3681 if (dtlck->index < dtlck->maxcnt) in dtInsertEntry()
3685 lv = & dtlck->lv[0]; in dtInsertEntry()
3688 lv->offset = fsi; in dtInsertEntry()
3694 UniStrncpy_to_le(t->name, kname, len); in dtInsertEntry()
3698 klen -= len; in dtInsertEntry()
3702 lv->length = n; in dtInsertEntry()
3703 dtlck->index++; in dtInsertEntry()
3710 if (p->header.flag & BT_LEAF) in dtInsertEntry()
3711 lh->next = -1; in dtInsertEntry()
3713 ih->next = -1; in dtInsertEntry()
3715 /* multi-segment entry */ in dtInsertEntry()
3716 t->next = -1; in dtInsertEntry()
3720 nextindex = p->header.nextindex; in dtInsertEntry()
3722 memmove(stbl + index + 1, stbl + index, nextindex - index); in dtInsertEntry()
3724 if ((p->header.flag & BT_LEAF) && data->leaf.ip) { in dtInsertEntry()
3733 lh = (struct ldtentry *) & (p->slot[stbl[n]]); in dtInsertEntry()
3734 modify_index(data->leaf.tid, data->leaf.ip, in dtInsertEntry()
3735 le32_to_cpu(lh->index), bn, n, in dtInsertEntry()
3746 ++p->header.nextindex; in dtInsertEntry()
3775 sstbl = (s8 *) & sp->slot[sp->header.stblindex]; in dtMoveEntry()
3776 dstbl = (s8 *) & dp->slot[dp->header.stblindex]; in dtMoveEntry()
3778 dsi = dp->header.freelist; /* first (whole page) free slot */ in dtMoveEntry()
3779 sfsi = sp->header.freelist; in dtMoveEntry()
3782 dlv = & ddtlck->lv[ddtlck->index]; in dtMoveEntry()
3783 dlv->offset = dsi; in dtMoveEntry()
3786 slv = & sdtlck->lv[sdtlck->index]; in dtMoveEntry()
3787 slv->offset = sstbl[si]; in dtMoveEntry()
3788 xssi = slv->offset - 1; in dtMoveEntry()
3794 for (di = 0; si < sp->header.nextindex; si++, di++) { in dtMoveEntry()
3801 slv->length = ns; in dtMoveEntry()
3802 sdtlck->index++; in dtMoveEntry()
3805 if (sdtlck->index < sdtlck->maxcnt) in dtMoveEntry()
3809 slv = & sdtlck->lv[0]; in dtMoveEntry()
3812 slv->offset = ssi; in dtMoveEntry()
3820 h = d = &dp->slot[dsi]; in dtMoveEntry()
3823 s = &sp->slot[ssi]; in dtMoveEntry()
3824 if (sp->header.flag & BT_LEAF) { in dtMoveEntry()
3828 snamlen = slh->namlen; in dtMoveEntry()
3832 dlh->index = slh->index; /* little-endian */ in dtMoveEntry()
3838 next = slh->next; in dtMoveEntry()
3842 dlh->next = dsi; in dtMoveEntry()
3845 snamlen = sih->namlen; in dtMoveEntry()
3850 next = sih->next; in dtMoveEntry()
3853 dih->next = dsi; in dtMoveEntry()
3857 s->next = sfsi; in dtMoveEntry()
3858 s->cnt = 1; in dtMoveEntry()
3868 snamlen -= len; in dtMoveEntry()
3873 slv->length = ns; in dtMoveEntry()
3874 sdtlck->index++; in dtMoveEntry()
3877 if (sdtlck->index < sdtlck->maxcnt) in dtMoveEntry()
3883 slv = & sdtlck->lv[0]; in dtMoveEntry()
3886 slv->offset = ssi; in dtMoveEntry()
3891 s = &sp->slot[ssi]; in dtMoveEntry()
3897 UniStrncpy_le(d->name, s->name, len); in dtMoveEntry()
3904 d->next = dsi; in dtMoveEntry()
3907 next = s->next; in dtMoveEntry()
3908 s->next = sfsi; in dtMoveEntry()
3909 s->cnt = 1; in dtMoveEntry()
3912 snamlen -= len; in dtMoveEntry()
3918 if (dp->header.flag & BT_LEAF) in dtMoveEntry()
3919 dlh->next = -1; in dtMoveEntry()
3921 dih->next = -1; in dtMoveEntry()
3923 /* multi-segment entry */ in dtMoveEntry()
3924 d->next = -1; in dtMoveEntry()
3928 slv->length = ns; in dtMoveEntry()
3929 sdtlck->index++; in dtMoveEntry()
3932 dlv->length = nd; in dtMoveEntry()
3933 ddtlck->index++; in dtMoveEntry()
3937 sp->header.freelist = sfsi; in dtMoveEntry()
3938 sp->header.freecnt += nd; in dtMoveEntry()
3941 dp->header.nextindex = di; in dtMoveEntry()
3943 dp->header.freelist = dsi; in dtMoveEntry()
3944 dp->header.freecnt -= nd; in dtMoveEntry()
3974 if (dtlck->index >= dtlck->maxcnt) in dtDeleteEntry()
3976 lv = & dtlck->lv[dtlck->index]; in dtDeleteEntry()
3978 lv->offset = fsi; in dtDeleteEntry()
3981 t = &p->slot[fsi]; in dtDeleteEntry()
3982 if (p->header.flag & BT_LEAF) in dtDeleteEntry()
3983 si = ((struct ldtentry *) t)->next; in dtDeleteEntry()
3985 si = ((struct idtentry *) t)->next; in dtDeleteEntry()
3986 t->next = si; in dtDeleteEntry()
3987 t->cnt = 1; in dtDeleteEntry()
3997 lv->length = n; in dtDeleteEntry()
3998 dtlck->index++; in dtDeleteEntry()
4001 if (dtlck->index < dtlck->maxcnt) in dtDeleteEntry()
4005 lv = & dtlck->lv[0]; in dtDeleteEntry()
4008 lv->offset = si; in dtDeleteEntry()
4016 t = &p->slot[si]; in dtDeleteEntry()
4017 t->cnt = 1; in dtDeleteEntry()
4018 si = t->next; in dtDeleteEntry()
4022 lv->length = n; in dtDeleteEntry()
4023 dtlck->index++; in dtDeleteEntry()
4028 t->next = p->header.freelist; in dtDeleteEntry()
4029 p->header.freelist = fsi; in dtDeleteEntry()
4030 p->header.freecnt += freecnt; in dtDeleteEntry()
4035 si = p->header.nextindex; in dtDeleteEntry()
4036 if (fi < si - 1) in dtDeleteEntry()
4037 memmove(&stbl[fi], &stbl[fi + 1], si - fi - 1); in dtDeleteEntry()
4039 p->header.nextindex--; in dtDeleteEntry()
4069 if (dtlck->index >= dtlck->maxcnt) in dtTruncateEntry()
4071 lv = & dtlck->lv[dtlck->index]; in dtTruncateEntry()
4073 lv->offset = tsi; in dtTruncateEntry()
4076 t = &p->slot[tsi]; in dtTruncateEntry()
4077 ASSERT(p->header.flag & BT_INTERNAL); in dtTruncateEntry()
4078 ((struct idtentry *) t)->namlen = 0; in dtTruncateEntry()
4079 si = ((struct idtentry *) t)->next; in dtTruncateEntry()
4080 ((struct idtentry *) t)->next = -1; in dtTruncateEntry()
4092 lv->length = n; in dtTruncateEntry()
4093 dtlck->index++; in dtTruncateEntry()
4096 if (dtlck->index < dtlck->maxcnt) in dtTruncateEntry()
4100 lv = & dtlck->lv[0]; in dtTruncateEntry()
4103 lv->offset = si; in dtTruncateEntry()
4111 t = &p->slot[si]; in dtTruncateEntry()
4112 t->cnt = 1; in dtTruncateEntry()
4113 si = t->next; in dtTruncateEntry()
4117 lv->length = n; in dtTruncateEntry()
4118 dtlck->index++; in dtTruncateEntry()
4125 t->next = p->header.freelist; in dtTruncateEntry()
4126 p->header.freelist = fsi; in dtTruncateEntry()
4127 p->header.freecnt += freecnt; in dtTruncateEntry()
4146 fsi = p->header.freelist; in dtLinelockFreelist()
4149 if (dtlck->index >= dtlck->maxcnt) in dtLinelockFreelist()
4151 lv = & dtlck->lv[dtlck->index]; in dtLinelockFreelist()
4153 lv->offset = fsi; in dtLinelockFreelist()
4158 t = &p->slot[fsi]; in dtLinelockFreelist()
4159 si = t->next; in dtLinelockFreelist()
4166 lv->length = n; in dtLinelockFreelist()
4167 dtlck->index++; in dtLinelockFreelist()
4170 if (dtlck->index < dtlck->maxcnt) in dtLinelockFreelist()
4174 lv = & dtlck->lv[0]; in dtLinelockFreelist()
4177 lv->offset = si; in dtLinelockFreelist()
4184 t = &p->slot[si]; in dtLinelockFreelist()
4185 si = t->next; in dtLinelockFreelist()
4189 lv->length = n; in dtLinelockFreelist()
4190 dtlck->index++; in dtLinelockFreelist()
4202 * tid - Transaction id
4203 * ip - Inode of parent directory
4204 * key - Name of entry to be modified
4205 * orig_ino - Original inode number expected in entry
4206 * new_ino - New inode number to put into entry
4207 * flag - JFS_RENAME
4210 * -ESTALE - If entry found does not match orig_ino passed in
4211 * -ENOENT - If no entry can be found to match key
4212 * 0 - If successfully modified entry
4246 dtlck = (struct dt_lock *) & tlck->lock; in dtModify()
4253 ASSERT(dtlck->index == 0); in dtModify()
4254 lv = & dtlck->lv[0]; in dtModify()
4255 lv->offset = entry_si; in dtModify()
4256 lv->length = 1; in dtModify()
4257 dtlck->index++; in dtModify()
4260 entry = (struct ldtentry *) & p->slot[entry_si]; in dtModify()
4263 entry->inumber = cpu_to_le32(new_ino); in dtModify()