2 * Copyright (c) 1998, 1999 Semen Ustimenko (semenu@FreeBSD.org)
5 * Redistribution and use in source and binary forms, with or without
6 * modification, are permitted provided that the following conditions
8 * 1. Redistributions of source code must retain the above copyright
9 * notice, this list of conditions and the following disclaimer.
10 * 2. Redistributions in binary form must reproduce the above copyright
11 * notice, this list of conditions and the following disclaimer in the
12 * documentation and/or other materials provided with the distribution.
14 * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
15 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
16 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
17 * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
18 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
19 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
20 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
21 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
22 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
23 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
29 #include <sys/param.h>
30 #include <sys/systm.h>
31 #include <sys/kernel.h>
34 #include <sys/types.h>
36 #include <sys/vnode.h>
37 #include <sys/mount.h>
38 #include <sys/namei.h>
39 #include <sys/malloc.h>
43 #include <fs/hpfs/hpfs.h>
44 #include <fs/hpfs/hpfs_subr.h>
46 #define AE_DONE 0 /* Nothing to change */
47 #define AE_SPLIT 2 /* Split was done, ranp is valid */
49 int hpfs_addextentr (struct hpfsmount *, lsn_t, alleaf_t *,
50 alnode_t *, u_long *);
51 int hpfs_allocalsec (struct hpfsmount *, lsn_t, struct buf **);
52 int hpfs_alblk2alsec (struct hpfsmount *, alblk_t *, alsec_t **,
54 int hpfs_splitalsec (struct hpfsmount *, alsec_t *, alsec_t **,
56 int hpfs_concatalsec (struct hpfsmount *, alsec_t *, alsec_t *,
60 * Map file offset to disk offset. hpfsnode have to be locked.
63 hpfs_hpbmap(hp, bn, bnp, runp)
75 dprintf(("hpfs_hpbmap(0x%x, 0x%x): ",hp->h_no, bn));
78 abp = &hp->h_fn.fn_ab;
79 alp = (alleaf_t *)&hp->h_fn.fn_abd;
80 anp = (alnode_t *)&hp->h_fn.fn_abd;
83 if (abp->ab_flag & AB_NODES) {
84 for (i=0; i<abp->ab_busycnt; i++, anp++) {
85 dprintf(("[0x%x,0x%x] ",anp->an_nextoff,anp->an_lsn));
86 if (bn < anp->an_nextoff) {
89 dprintf(("< found | "));
93 error = bread(hp->h_devvp, anp->an_lsn,
94 DEV_BSIZE, NOCRED, &bp);
96 printf("hpfs_hpbmap: bread error\n");
101 asp = (alsec_t *) bp->b_data;
102 if (asp->as_magic != AS_MAGIC) {
104 printf("hpfs_hpbmap: "
105 "MAGIC DOESN'T MATCH");
110 alp = (alleaf_t *)&asp->as_abd;
111 anp = (alnode_t *)&asp->as_abd;
117 for (i=0; i<abp->ab_busycnt; i++, alp++) {
118 dprintf(("[0x%x,0x%x,0x%x] ",
119 alp->al_off,alp->al_len,alp->al_lsn));
121 if ((bn >= alp->al_off) &&
122 (!alp->al_len || (bn < alp->al_off + alp->al_len))) {
123 dprintf(("found, "));
125 *bnp = bn - alp->al_off + alp->al_lsn;
127 dprintf((" 0x%x ", *bnp));
131 *runp = alp->al_off - 1 +
136 dprintf((" 0x%x cont", *runp));
148 dprintf(("END, notfound\n"));
152 dprintf(("hpfs_hpbmap: offset too big\n"));
158 * Find place and preinitialize AlSec structure
159 * AlBlk is initialized to contain AlLeafs.
163 struct hpfsmount *hpmp,
174 error = hpfs_bmfblookup(hpmp, &lsn);
176 printf("hpfs_allocalsec: CAN'T ALLOC SPACE FOR AlSec\n");
180 error = hpfs_bmmarkbusy(hpmp, lsn, 1);
184 bp = getblk(hpmp->hpm_devvp, lsn, DEV_BSIZE, 0, 0, 0);
187 /* Fill AlSec info */
188 asp = (alsec_t *) bp->b_data;
189 asp->as_magic = AS_MAGIC;
191 asp->as_parent = parlsn;
194 asp->as_ab.ab_flag = 0;
195 asp->as_ab.ab_busycnt = 0;
196 asp->as_ab.ab_freecnt = 0x28;
197 asp->as_ab.ab_freeoff = sizeof(alblk_t);
205 * Split AlSec structure into new allocated:
206 * allocate new AlSec; then move second half of asp's entries in
207 * into it; set proper flags.
209 * IF AlSec CONTAINS AlNodes, THEN YOU ALMOST EVERYTIME HAVE TO
210 * FIX LAST AlNode in OLD AlSec (NEXTOFF TO BE 0xFFFFFFFF).
211 * TOGETHER WITH FIXING ALL CHILDREN'S AlSecs (THEY HAVE GOT NEW PARENT).
215 struct hpfsmount *hpmp,
224 int error, n1, n2, sz;
226 error = hpfs_allocalsec(hpmp, asp->as_parent, &nbp);
230 nasp = (alsec_t *)nbp->b_data;
234 n1 = (abp->ab_busycnt + 1) / 2;
235 n2 = (abp->ab_busycnt - n1);
236 sz = (abp->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
238 bcopy((caddr_t)abp + sizeof(alblk_t) + n1 * sz,
239 (caddr_t)nabp + sizeof(alblk_t), n2 * sz);
241 nabp->ab_flag = abp->ab_flag;
242 nabp->ab_busycnt = n2;
243 nabp->ab_freecnt = (0x1e0 / sz - n2);
244 nabp->ab_freeoff += n2 * sz;
246 abp->ab_busycnt -= n1;
247 abp->ab_freecnt += n1;
248 abp->ab_freeoff -= n1 * sz;
257 * Try to concatenate two AlSec's
259 * Moves all entries from AlSec corresponding (as1p, aanp[1]) into
260 * corresponding aanp[0] one. If not enought space, then return ENOSPC.
262 * WARNING! YOU HAVE TO FIX aanp VALUES YOURSELF LATER:
263 * aanp[0].an_nextoff = aanp[1].an_nextoff;
267 struct hpfsmount *hpmp,
276 dprintf(("hpfs_concatalsec: AlSecs at 0x%x and 0x%x \n",
277 as0p->as_self,as1p->as_self));
281 sz = (ab0p->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
283 if (ab0p->ab_freecnt > ab1p->ab_busycnt) {
287 if (ab0p->ab_flag & AB_NODES)
288 AB_LASTANP(ab0p)->an_nextoff = aanp[0].an_nextoff;
290 bcopy (AB_ALNODE(ab1p), AB_FREEANP(ab0p),
291 ab1p->ab_busycnt * sz);
293 AB_ADDNREC(ab0p, sz, ab1p->ab_busycnt);
297 /* Not enought space to concatenate */
303 * Transform AlBlk structure into new allocated
306 * DOESN'T SET AlSec'S PARENT LSN.
310 struct hpfsmount *hpmp,
320 error = hpfs_allocalsec(hpmp, 0, &nbp);
324 nasp = (alsec_t *)nbp->b_data;
327 sz = (abp->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
329 bcopy (abp, nabp, sizeof(alblk_t) + sz * abp->ab_busycnt);
331 nabp->ab_freecnt = 0x1e0 / sz - nabp->ab_busycnt;
340 * Allocate len blocks and concatenate them to file.
341 * If we hadn't found contignous run of len blocks, concatenate
342 * as much as we can, and return.
347 struct hpfsmount *hpmp,
358 * We don't know for now start lsn of block
362 al.al_off = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
364 rabp = &hp->h_fn.fn_ab;
366 /* Init AlBlk if this is first extent */
367 if (al.al_off == 0) {
371 dprintf(("hpfs_addextent: init AlBlk in root\n"));
373 rabp->ab_busycnt = 0;
374 rabp->ab_freecnt = 0x8;
375 rabp->ab_freeoff = sizeof(alblk_t);
378 error = hpfs_bmlookup (hpmp, 0, hp->h_no + 1, al.al_len, &nlsn, &nlen);
382 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
386 dprintf(("hpfs_addextent: new: 0x%x 0x%lx, ", nlsn, nlen));
388 AL_SET(AB_FREEALP(rabp), al.al_off, nlen, nlsn);
396 dprintf(("hpfs_addextent: AlBlk: [0x%x, 0x%x, 0x%x] need: 0x%x\n",
397 rabp->ab_freecnt, rabp->ab_busycnt, rabp->ab_flag, al.al_len));
399 while ((al.al_len) && (rabp->ab_freecnt > 0)) {
400 if (rabp->ab_flag & AB_NODES) {
403 * This is level containing AlNodes, so try to
404 * insert recursively into last entry.
406 anp = AB_LASTANP(rabp);
407 dprintf(("hpfs_addextent: AlNode: [0x%x,0x%x] \n",
408 anp->an_nextoff,anp->an_lsn));
413 error = hpfs_addextentr (hpmp, anp->an_lsn, &al, ranp, &pf);
415 printf("hpfs_addextent: FAILED %d\n",error);
421 dprintf(("hpfs_addextent: successful (split)\n"));
423 * Then hpfs_addextentr has split tree below, now
424 * we need to fix this level. Particulary:
425 * fix last AlNode and add another one.
428 bcopy(ranp, AB_LASTANP(rabp), sizeof(alnode_t) * 2);
434 dprintf(("hpfs_addextent: successful\n"));
440 alp = AB_LASTALP(rabp);
441 dprintf(("hpfs_addextent: AlLeaf: [0x%x,0x%x,0x%x] \n",
442 alp->al_off,alp->al_len,alp->al_lsn));
444 /* Check if we trying to add in right place */
445 if (alp->al_off + alp->al_len == al.al_off) {
450 * Search bitmap for block begining from
451 * alp->al_lsn + alp->al_len and long of ralp->al_len
453 error = hpfs_bmlookup (hpmp, 0,
454 alp->al_lsn + alp->al_len, al.al_len, &nlsn, &nlen);
458 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
462 dprintf(("hpfs_addextent: new: 0x%x 0x%lx, ", nlsn, nlen));
464 if (alp->al_lsn + alp->al_len == nlsn) {
465 dprintf(("extended existed leaf\n"));
469 dprintf(("created new leaf\n"));
470 AL_SET(AB_FREEALP(rabp), al.al_off, nlen, nlsn);
476 printf("hpfs_addextent: INTERNAL INCONSISTENCE\n");
483 * Move AlBlk contain to new AlSec (it will fit more
484 * entries) if overflowed (no more free entries).
486 if (rabp->ab_freecnt <= 0) {
490 dprintf(("hpfs_addextent: overflow, convt\n"));
493 * Convert AlBlk to new AlSec, it will set
496 rabp->ab_flag |= AB_FNPARENT;
497 error = hpfs_alblk2alsec (hpmp, rabp, &nrasp, &nbp);
499 printf("hpfs_addextent: CAN'T CONVT\n");
502 nrasp->as_parent = hp->h_no;
505 * Scan all childrens (if exist), set new parent and
506 * clean their AB_FNPARENT flag.
508 if (rabp->ab_flag & AB_NODES) {
514 anp = AB_ALNODE(rabp);
515 for (i=0; i<rabp->ab_busycnt; i++) {
516 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
520 asp = (alsec_t *)bp->b_data;
521 asp->as_ab.ab_flag &= ~AB_FNPARENT;
522 asp->as_parent = nrasp->as_self;
529 /* Convert AlBlk to contain AlNodes */
530 rabp->ab_flag = AB_NODES;
531 rabp->ab_busycnt = 0;
532 rabp->ab_freecnt = 0xC;
533 rabp->ab_freeoff = sizeof(alblk_t);
535 /* Add AlNode for new allocated AlSec */
536 AN_SET(AB_FREEANP(rabp), ~0, nrasp->as_self);
543 dprintf(("hpfs_addextent: root retry\n"));
551 * Descent down to the end of tree, then search for
552 * ralp->len contignous run begining from last run's end and
553 * concatenate new block! If we can't find one, then...
557 struct hpfsmount *hpmp, /* Mix info */
558 lsn_t rlsn, /* LSN containing AlSec */
559 alleaf_t *ralp, /* AlLeaf to insert */
560 alnode_t *ranp, /* New AlNodes' values */
561 u_long *resp) /* Mix returning info */
574 dprintf(("hpfs_addextentr: AlSec at 0x%x\n", rlsn));
576 error = hpfs_breadalsec(hpmp, rlsn, &rbp);
580 rasp = (alsec_t *)rbp->b_data;
584 dprintf(("hpfs_addextentr: AlBlk: [0x%x, 0x%x, 0x%x]\n",
585 rabp->ab_freecnt, rabp->ab_busycnt, rabp->ab_flag));
587 while ((ralp->al_len) && (rabp->ab_freecnt > 0)) {
588 if (rabp->ab_flag & AB_NODES) {
590 * This is level containing AlNodes, so try to
591 * insert recursively into last entry.
593 anp = AB_LASTANP(rabp);
594 dprintf(("hpfs_addextentr: AlNode: [0x%x,0x%x] \n",
595 anp->an_nextoff,anp->an_lsn));
600 error = hpfs_addextentr (hpmp, anp->an_lsn, ralp, ranp, &pf);
602 printf("hpfs_addextentr: FAILED %d\n",error);
608 dprintf(("hpfs_addextentr: successful (split)\n"));
610 * Then hpfs_addextentr has split tree below, now
611 * we need to fix this level. Particulary:
612 * fix last AlNode and add another one.
614 bcopy(ranp, AB_LASTANP(rabp), sizeof(alnode_t) * 2);
621 dprintf(("hpfs_addextentr: successful\n"));
625 alp = AB_LASTALP(rabp);
626 dprintf(("hpfs_addextentr: AlLeaf: [0x%x,0x%x,0x%x] \n",
627 alp->al_off,alp->al_len,alp->al_lsn));
629 /* Check if we trying to add in right place */
630 if (alp->al_off + alp->al_len == ralp->al_off) {
634 * Search bitmap for block begining from
635 * alp->al_lsn + alp->al_len and long of ralp->al_len
637 error = hpfs_bmlookup (hpmp, 0,
638 alp->al_lsn + alp->al_len, ralp->al_len, &nlsn, &nlen);
642 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
646 dprintf(("hpfs_addextentr: new: 0x%x 0x%lx, ", nlsn, nlen));
649 * If ending of existed entry fits the
650 * begining of the extent being added,
651 * then we add concatenate two extents.
653 if (alp->al_lsn + alp->al_len == nlsn) {
654 dprintf(("concat\n"));
657 dprintf(("created new leaf\n"));
658 AL_SET(AB_FREEALP(rabp), ralp->al_off, nlen, nlsn);
662 ralp->al_len -= nlen;
663 ralp->al_off += nlen;
665 printf("hpfs_addextentr: INTERNAL INCONSISTENCE\n");
673 * Split AlBlk if overflowed.
675 if (rabp->ab_freecnt <= 0) {
679 dprintf(("hpfs_addextentr: overflow, split\n"));
681 error = hpfs_splitalsec (hpmp, rasp, &nrasp, &nbp);
683 printf("hpfs_addextent: CAN'T SPLIT\n");
687 if (rabp->ab_flag & AB_NODES) {
694 AB_LASTANP(&rasp->as_ab)->an_nextoff;
696 /* We need to set left subtree's last entry
697 * offset to 0xFFFFFFFF for OS/2 to be able
698 * to read our files. It treats absence of
699 * 0xFFFFFFFF as error.
701 AB_LASTANP(&rasp->as_ab)->an_nextoff = ~0;
703 /* We need to fix new allocated AlSec's
704 * children, becouse their parent has changed.
706 anp = AB_ALNODE(&nrasp->as_ab);
707 for (i=0; i<nrasp->as_ab.ab_busycnt; i++) {
708 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
714 asp = (alsec_t *)bp->b_data;
715 asp->as_parent = nrasp->as_self;
722 AB_ALLEAF(&nrasp->as_ab)->al_off;
725 ranp[0].an_lsn = rasp->as_self;
726 ranp[1].an_nextoff = ~0;
727 ranp[1].an_lsn = nrasp->as_self;
749 * Recursive routine walking down the b-tree and deallocating all
750 * extents above bn. Returns *resp != 0 if alblk was totally
751 * deallocated and may be freed. Tries to keep b-tree.
753 * (XXXX) NOTE! THIS ROUTINE WILL NEVER DECREMENT DEPTH OF
758 struct hpfsmount *hpmp,
769 dprintf(("hpfs_truncatealblk: AlBlk: [0x%x,0x%x, 0x%x]\n",
770 abp->ab_freecnt, abp->ab_busycnt, abp->ab_flag));
772 if (abp->ab_flag & AB_NODES) {
774 * Scan array of AlNodes backward,
775 * diving in recursion if needed
777 anp = AB_LASTANP(abp);
779 while (abp->ab_busycnt && (bn <= anp->an_nextoff)) {
780 dprintf(("hpfs_truncatealblk: AlNode: [0x%x,0x%x] \n",
781 anp->an_nextoff,anp->an_lsn));
783 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
787 asp = (alsec_t *)bp->b_data;
789 error = hpfs_truncatealblk (hpmp,
790 &asp->as_ab, bn, resp);
799 error = hpfs_bmmarkfree(hpmp,
808 * We have deallocated some entries, some space
809 * migth been freed, then try to concat two
812 anp->an_nextoff = ~0;
813 if (abp->ab_busycnt >= 2) {
817 error = hpfs_breadalsec(hpmp,
818 (anp-1)->an_lsn, &b0p);
822 as0p = (alsec_t *)b0p->b_data;
823 error = hpfs_concatalsec(hpmp,
825 if (error == ENOSPC) {
826 /* Not enought space */
829 } else if (error == 0) {
831 (anp-1)->an_nextoff = anp->an_nextoff;
836 error = hpfs_bmmarkfree(hpmp,
849 /* Nowhere to concatenate */
853 /* There can not be any more entries
854 * over greater bn, becouse last AlSec
855 * wasn't freed totally. So go out.
861 if (abp->ab_busycnt == 0)
867 * Scan array of AlLeafs backward,
870 alp = AB_LASTALP(abp);
872 while (abp->ab_busycnt && (bn < alp->al_off + alp->al_len)){
873 dprintf(("hpfs_truncatealblk: AlLeaf: [0x%x,0x%x,0x%x] \n",
874 alp->al_off,alp->al_len,alp->al_lsn));
876 if (bn <= alp->al_off) {
877 error = hpfs_bmmarkfree(hpmp, alp->al_lsn,
884 } else if ((bn > alp->al_off) &&
885 (bn < alp->al_off + alp->al_len)){
886 error = hpfs_bmmarkfree(hpmp,
887 alp->al_lsn + bn - alp->al_off,
888 alp->al_len - bn + alp->al_off);
892 alp->al_len = bn - alp->al_off;
900 /* Signal parent deallocation, if need */
901 if (abp->ab_busycnt == 0)