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
26 * $FreeBSD: src/sys/fs/hpfs/hpfs_alsubr.c,v 1.1 1999/12/09 19:09:58 semenu Exp $
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>
42 #include <fs/hpfs/hpfs.h>
43 #include <fs/hpfs/hpfs_subr.h>
45 #define AE_DONE 0 /* Nothing to change */
46 #define AE_SPLIT 2 /* Split was done, ranp is valid */
48 int hpfs_addextentr (struct hpfsmount *, lsn_t, alleaf_t *,
49 alnode_t *, u_long *);
50 int hpfs_allocalsec (struct hpfsmount *, lsn_t, struct buf **);
51 int hpfs_alblk2alsec (struct hpfsmount *, alblk_t *, alsec_t **,
53 int hpfs_splitalsec (struct hpfsmount *, alsec_t *, alsec_t **,
55 int hpfs_concatalsec (struct hpfsmount *, alsec_t *, alsec_t *,
59 * Map file offset to disk offset. hpfsnode have to be locked.
62 hpfs_hpbmap(hp, bn, bnp, runp)
74 dprintf(("hpfs_hpbmap(0x%x, 0x%x): ",hp->h_no, bn));
77 abp = &hp->h_fn.fn_ab;
78 alp = (alleaf_t *)&hp->h_fn.fn_abd;
79 anp = (alnode_t *)&hp->h_fn.fn_abd;
82 if (abp->ab_flag & AB_NODES) {
83 for (i=0; i<abp->ab_busycnt; i++, anp++) {
84 dprintf(("[0x%x,0x%x] ",anp->an_nextoff,anp->an_lsn));
85 if (bn < anp->an_nextoff) {
88 dprintf(("< found | "));
92 error = bread(hp->h_devvp, anp->an_lsn,
93 DEV_BSIZE, NOCRED, &bp);
95 printf("hpfs_hpbmap: bread error\n");
100 asp = (alsec_t *) bp->b_data;
101 if (asp->as_magic != AS_MAGIC) {
103 printf("hpfs_hpbmap: "
104 "MAGIC DOESN'T MATCH");
109 alp = (alleaf_t *)&asp->as_abd;
110 anp = (alnode_t *)&asp->as_abd;
116 for (i=0; i<abp->ab_busycnt; i++, alp++) {
117 dprintf(("[0x%x,0x%x,0x%x] ",
118 alp->al_off,alp->al_len,alp->al_lsn));
120 if ((bn >= alp->al_off) &&
121 (!alp->al_len || (bn < alp->al_off + alp->al_len))) {
122 dprintf(("found, "));
124 *bnp = bn - alp->al_off + alp->al_lsn;
126 dprintf((" 0x%x ", *bnp));
130 *runp = alp->al_off - 1 +
135 dprintf((" 0x%x cont", *runp));
147 dprintf(("END, notfound\n"));
151 dprintf(("hpfs_hpbmap: offset too big\n"));
157 * Find place and preinitialize AlSec structure
158 * AlBlk is initialized to contain AlLeafs.
162 struct hpfsmount *hpmp,
173 error = hpfs_bmfblookup(hpmp, &lsn);
175 printf("hpfs_allocalsec: CAN'T ALLOC SPACE FOR AlSec\n");
179 error = hpfs_bmmarkbusy(hpmp, lsn, 1);
183 bp = getblk(hpmp->hpm_devvp, lsn, DEV_BSIZE, 0, 0);
186 /* Fill AlSec info */
187 asp = (alsec_t *) bp->b_data;
188 asp->as_magic = AS_MAGIC;
190 asp->as_parent = parlsn;
193 asp->as_ab.ab_flag = 0;
194 asp->as_ab.ab_busycnt = 0;
195 asp->as_ab.ab_freecnt = 0x28;
196 asp->as_ab.ab_freeoff = sizeof(alblk_t);
204 * Split AlSec structure into new allocated:
205 * allocate new AlSec; then move second half of asp's entries in
206 * into it; set proper flags.
208 * IF AlSec CONTAINS AlNodes, THEN YOU ALMOST EVERYTIME HAVE TO
209 * FIX LAST AlNode in OLD AlSec (NEXTOFF TO BE 0xFFFFFFFF).
210 * TOGETHER WITH FIXING ALL CHILDREN'S AlSecs (THEY HAVE GOT NEW PARENT).
214 struct hpfsmount *hpmp,
223 int error, n1, n2, sz;
225 error = hpfs_allocalsec(hpmp, asp->as_parent, &nbp);
229 nasp = (alsec_t *)nbp->b_data;
233 n1 = (abp->ab_busycnt + 1) / 2;
234 n2 = (abp->ab_busycnt - n1);
235 sz = (abp->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
237 bcopy((caddr_t)abp + sizeof(alblk_t) + n1 * sz,
238 (caddr_t)nabp + sizeof(alblk_t), n2 * sz);
240 nabp->ab_flag = abp->ab_flag;
241 nabp->ab_busycnt = n2;
242 nabp->ab_freecnt = (0x1e0 / sz - n2);
243 nabp->ab_freeoff += n2 * sz;
245 abp->ab_busycnt -= n1;
246 abp->ab_freecnt += n1;
247 abp->ab_freeoff -= n1 * sz;
256 * Try to concatenate two AlSec's
258 * Moves all entries from AlSec corresponding (as1p, aanp[1]) into
259 * corresponding aanp[0] one. If not enought space, then return ENOSPC.
261 * WARNING! YOU HAVE TO FIX aanp VALUES YOURSELF LATER:
262 * aanp[0].an_nextoff = aanp[1].an_nextoff;
266 struct hpfsmount *hpmp,
275 dprintf(("hpfs_concatalsec: AlSecs at 0x%x and 0x%x \n",
276 as0p->as_self,as1p->as_self));
280 sz = (ab0p->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
282 if (ab0p->ab_freecnt > ab1p->ab_busycnt) {
286 if (ab0p->ab_flag & AB_NODES)
287 AB_LASTANP(ab0p)->an_nextoff = aanp[0].an_nextoff;
289 bcopy (AB_ALNODE(ab1p), AB_FREEANP(ab0p),
290 ab1p->ab_busycnt * sz);
292 AB_ADDNREC(ab0p, sz, ab1p->ab_busycnt);
296 /* Not enought space to concatenate */
302 * Transform AlBlk structure into new allocated
305 * DOESN'T SET AlSec'S PARENT LSN.
309 struct hpfsmount *hpmp,
319 error = hpfs_allocalsec(hpmp, 0, &nbp);
323 nasp = (alsec_t *)nbp->b_data;
326 sz = (abp->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
328 bcopy (abp, nabp, sizeof(alblk_t) + sz * abp->ab_busycnt);
330 nabp->ab_freecnt = 0x1e0 / sz - nabp->ab_busycnt;
339 * Allocate len blocks and concatenate them to file.
340 * If we hadn't found contignous run of len blocks, concatenate
341 * as much as we can, and return.
346 struct hpfsmount *hpmp,
357 * We don't know for now start lsn of block
361 al.al_off = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
363 rabp = &hp->h_fn.fn_ab;
365 /* Init AlBlk if this is first extent */
366 if (al.al_off == 0) {
370 dprintf(("hpfs_addextent: init AlBlk in root\n"));
372 rabp->ab_busycnt = 0;
373 rabp->ab_freecnt = 0x8;
374 rabp->ab_freeoff = sizeof(alblk_t);
377 error = hpfs_bmlookup (hpmp, 0, hp->h_no + 1, al.al_len, &nlsn, &nlen);
381 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
385 dprintf(("hpfs_addextent: new: 0x%x 0x%lx, ", nlsn, nlen));
387 AL_SET(AB_FREEALP(rabp), al.al_off, nlen, nlsn);
395 dprintf(("hpfs_addextent: AlBlk: [0x%x, 0x%x, 0x%x] need: 0x%x\n",
396 rabp->ab_freecnt, rabp->ab_busycnt, rabp->ab_flag, al.al_len));
398 while ((al.al_len) && (rabp->ab_freecnt > 0)) {
399 if (rabp->ab_flag & AB_NODES) {
402 * This is level containing AlNodes, so try to
403 * insert recursively into last entry.
405 anp = AB_LASTANP(rabp);
406 dprintf(("hpfs_addextent: AlNode: [0x%x,0x%x] \n",
407 anp->an_nextoff,anp->an_lsn));
412 error = hpfs_addextentr (hpmp, anp->an_lsn, &al, ranp, &pf);
414 printf("hpfs_addextent: FAILED %d\n",error);
420 dprintf(("hpfs_addextent: successful (split)\n"));
422 * Then hpfs_addextentr has split tree below, now
423 * we need to fix this level. Particulary:
424 * fix last AlNode and add another one.
427 bcopy(ranp, AB_LASTANP(rabp), sizeof(alnode_t) * 2);
433 dprintf(("hpfs_addextent: successful\n"));
439 alp = AB_LASTALP(rabp);
440 dprintf(("hpfs_addextent: AlLeaf: [0x%x,0x%x,0x%x] \n",
441 alp->al_off,alp->al_len,alp->al_lsn));
443 /* Check if we trying to add in right place */
444 if (alp->al_off + alp->al_len == al.al_off) {
449 * Search bitmap for block begining from
450 * alp->al_lsn + alp->al_len and long of ralp->al_len
452 error = hpfs_bmlookup (hpmp, 0,
453 alp->al_lsn + alp->al_len, al.al_len, &nlsn, &nlen);
457 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
461 dprintf(("hpfs_addextent: new: 0x%x 0x%lx, ", nlsn, nlen));
463 if (alp->al_lsn + alp->al_len == nlsn) {
464 dprintf(("extended existed leaf\n"));
468 dprintf(("created new leaf\n"));
469 AL_SET(AB_FREEALP(rabp), al.al_off, nlen, nlsn);
475 printf("hpfs_addextent: INTERNAL INCONSISTENCE\n");
482 * Move AlBlk contain to new AlSec (it will fit more
483 * entries) if overflowed (no more free entries).
485 if (rabp->ab_freecnt <= 0) {
489 dprintf(("hpfs_addextent: overflow, convt\n"));
492 * Convert AlBlk to new AlSec, it will set
495 rabp->ab_flag |= AB_FNPARENT;
496 error = hpfs_alblk2alsec (hpmp, rabp, &nrasp, &nbp);
498 printf("hpfs_addextent: CAN'T CONVT\n");
501 nrasp->as_parent = hp->h_no;
504 * Scan all childrens (if exist), set new parent and
505 * clean their AB_FNPARENT flag.
507 if (rabp->ab_flag & AB_NODES) {
513 anp = AB_ALNODE(rabp);
514 for (i=0; i<rabp->ab_busycnt; i++) {
515 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
519 asp = (alsec_t *)bp->b_data;
520 asp->as_ab.ab_flag &= ~AB_FNPARENT;
521 asp->as_parent = nrasp->as_self;
528 /* Convert AlBlk to contain AlNodes */
529 rabp->ab_flag = AB_NODES;
530 rabp->ab_busycnt = 0;
531 rabp->ab_freecnt = 0xC;
532 rabp->ab_freeoff = sizeof(alblk_t);
534 /* Add AlNode for new allocated AlSec */
535 AN_SET(AB_FREEANP(rabp), ~0, nrasp->as_self);
542 dprintf(("hpfs_addextent: root retry\n"));
550 * Descent down to the end of tree, then search for
551 * ralp->len contignous run begining from last run's end and
552 * concatenate new block! If we can't find one, then...
556 struct hpfsmount *hpmp, /* Mix info */
557 lsn_t rlsn, /* LSN containing AlSec */
558 alleaf_t *ralp, /* AlLeaf to insert */
559 alnode_t *ranp, /* New AlNodes' values */
560 u_long *resp) /* Mix returning info */
573 dprintf(("hpfs_addextentr: AlSec at 0x%x\n", rlsn));
575 error = hpfs_breadalsec(hpmp, rlsn, &rbp);
579 rasp = (alsec_t *)rbp->b_data;
583 dprintf(("hpfs_addextentr: AlBlk: [0x%x, 0x%x, 0x%x]\n",
584 rabp->ab_freecnt, rabp->ab_busycnt, rabp->ab_flag));
586 while ((ralp->al_len) && (rabp->ab_freecnt > 0)) {
587 if (rabp->ab_flag & AB_NODES) {
589 * This is level containing AlNodes, so try to
590 * insert recursively into last entry.
592 anp = AB_LASTANP(rabp);
593 dprintf(("hpfs_addextentr: AlNode: [0x%x,0x%x] \n",
594 anp->an_nextoff,anp->an_lsn));
599 error = hpfs_addextentr (hpmp, anp->an_lsn, ralp, ranp, &pf);
601 printf("hpfs_addextentr: FAILED %d\n",error);
607 dprintf(("hpfs_addextentr: successful (split)\n"));
609 * Then hpfs_addextentr has split tree below, now
610 * we need to fix this level. Particulary:
611 * fix last AlNode and add another one.
613 bcopy(ranp, AB_LASTANP(rabp), sizeof(alnode_t) * 2);
620 dprintf(("hpfs_addextentr: successful\n"));
624 alp = AB_LASTALP(rabp);
625 dprintf(("hpfs_addextentr: AlLeaf: [0x%x,0x%x,0x%x] \n",
626 alp->al_off,alp->al_len,alp->al_lsn));
628 /* Check if we trying to add in right place */
629 if (alp->al_off + alp->al_len == ralp->al_off) {
633 * Search bitmap for block begining from
634 * alp->al_lsn + alp->al_len and long of ralp->al_len
636 error = hpfs_bmlookup (hpmp, 0,
637 alp->al_lsn + alp->al_len, ralp->al_len, &nlsn, &nlen);
641 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
645 dprintf(("hpfs_addextentr: new: 0x%x 0x%lx, ", nlsn, nlen));
648 * If ending of existed entry fits the
649 * begining of the extent being added,
650 * then we add concatenate two extents.
652 if (alp->al_lsn + alp->al_len == nlsn) {
653 dprintf(("concat\n"));
656 dprintf(("created new leaf\n"));
657 AL_SET(AB_FREEALP(rabp), ralp->al_off, nlen, nlsn);
661 ralp->al_len -= nlen;
662 ralp->al_off += nlen;
664 printf("hpfs_addextentr: INTERNAL INCONSISTENCE\n");
672 * Split AlBlk if overflowed.
674 if (rabp->ab_freecnt <= 0) {
678 dprintf(("hpfs_addextentr: overflow, split\n"));
680 error = hpfs_splitalsec (hpmp, rasp, &nrasp, &nbp);
682 printf("hpfs_addextent: CAN'T SPLIT\n");
686 if (rabp->ab_flag & AB_NODES) {
693 AB_LASTANP(&rasp->as_ab)->an_nextoff;
695 /* We need to set left subtree's last entry
696 * offset to 0xFFFFFFFF for OS/2 to be able
697 * to read our files. It treats absence of
698 * 0xFFFFFFFF as error.
700 AB_LASTANP(&rasp->as_ab)->an_nextoff = ~0;
702 /* We need to fix new allocated AlSec's
703 * children, becouse their parent has changed.
705 anp = AB_ALNODE(&nrasp->as_ab);
706 for (i=0; i<nrasp->as_ab.ab_busycnt; i++) {
707 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
713 asp = (alsec_t *)bp->b_data;
714 asp->as_parent = nrasp->as_self;
721 AB_ALLEAF(&nrasp->as_ab)->al_off;
724 ranp[0].an_lsn = rasp->as_self;
725 ranp[1].an_nextoff = ~0;
726 ranp[1].an_lsn = nrasp->as_self;
748 * Recursive routine walking down the b-tree and deallocating all
749 * extents above bn. Returns *resp != 0 if alblk was totally
750 * deallocated and may be freed. Tries to keep b-tree.
752 * (XXXX) NOTE! THIS ROUTINE WILL NEVER DECREMENT DEPTH OF
757 struct hpfsmount *hpmp,
768 dprintf(("hpfs_truncatealblk: AlBlk: [0x%x,0x%x, 0x%x]\n",
769 abp->ab_freecnt, abp->ab_busycnt, abp->ab_flag));
771 if (abp->ab_flag & AB_NODES) {
773 * Scan array of AlNodes backward,
774 * diving in recursion if needed
776 anp = AB_LASTANP(abp);
778 while (abp->ab_busycnt && (bn <= anp->an_nextoff)) {
779 dprintf(("hpfs_truncatealblk: AlNode: [0x%x,0x%x] \n",
780 anp->an_nextoff,anp->an_lsn));
782 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
786 asp = (alsec_t *)bp->b_data;
788 error = hpfs_truncatealblk (hpmp,
789 &asp->as_ab, bn, resp);
798 error = hpfs_bmmarkfree(hpmp,
807 * We have deallocated some entries, some space
808 * migth been freed, then try to concat two
811 anp->an_nextoff = ~0;
812 if (abp->ab_busycnt >= 2) {
816 error = hpfs_breadalsec(hpmp,
817 (anp-1)->an_lsn, &b0p);
821 as0p = (alsec_t *)b0p->b_data;
822 error = hpfs_concatalsec(hpmp,
824 if (error == ENOSPC) {
825 /* Not enought space */
828 } else if (error == 0) {
830 (anp-1)->an_nextoff = anp->an_nextoff;
835 error = hpfs_bmmarkfree(hpmp,
848 /* Nowhere to concatenate */
852 /* There can not be any more entries
853 * over greater bn, becouse last AlSec
854 * wasn't freed totally. So go out.
860 if (abp->ab_busycnt == 0)
866 * Scan array of AlLeafs backward,
869 alp = AB_LASTALP(abp);
871 while (abp->ab_busycnt && (bn < alp->al_off + alp->al_len)){
872 dprintf(("hpfs_truncatealblk: AlLeaf: [0x%x,0x%x,0x%x] \n",
873 alp->al_off,alp->al_len,alp->al_lsn));
875 if (bn <= alp->al_off) {
876 error = hpfs_bmmarkfree(hpmp, alp->al_lsn,
883 } else if ((bn > alp->al_off) &&
884 (bn < alp->al_off + alp->al_len)){
885 error = hpfs_bmmarkfree(hpmp,
886 alp->al_lsn + bn - alp->al_off,
887 alp->al_len - bn + alp->al_off);
891 alp->al_len = bn - alp->al_off;
899 /* Signal parent deallocation, if need */
900 if (abp->ab_busycnt == 0)