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 $
27 * $DragonFly: src/sys/vfs/hpfs/hpfs_alsubr.c,v 1.6 2006/01/13 21:09:27 swildner Exp $
30 #include <sys/param.h>
31 #include <sys/systm.h>
32 #include <sys/kernel.h>
35 #include <sys/types.h>
37 #include <sys/vnode.h>
38 #include <sys/mount.h>
39 #include <sys/namei.h>
40 #include <sys/malloc.h>
44 #include "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(struct hpfsnode *hp, daddr_t bn, daddr_t *bnp, int *runp)
71 dprintf(("hpfs_hpbmap(0x%x, 0x%x): ",hp->h_no, bn));
74 abp = &hp->h_fn.fn_ab;
75 alp = (alleaf_t *)&hp->h_fn.fn_abd;
76 anp = (alnode_t *)&hp->h_fn.fn_abd;
79 if (abp->ab_flag & AB_NODES) {
80 for (i=0; i<abp->ab_busycnt; i++, anp++) {
81 dprintf(("[0x%x,0x%x] ",anp->an_nextoff,anp->an_lsn));
82 if (bn < anp->an_nextoff) {
85 dprintf(("< found | "));
89 error = bread(hp->h_devvp, anp->an_lsn,
92 printf("hpfs_hpbmap: bread error\n");
97 asp = (alsec_t *) bp->b_data;
98 if (asp->as_magic != AS_MAGIC) {
100 printf("hpfs_hpbmap: "
101 "MAGIC DOESN'T MATCH");
106 alp = (alleaf_t *)&asp->as_abd;
107 anp = (alnode_t *)&asp->as_abd;
113 for (i=0; i<abp->ab_busycnt; i++, alp++) {
114 dprintf(("[0x%x,0x%x,0x%x] ",
115 alp->al_off,alp->al_len,alp->al_lsn));
117 if ((bn >= alp->al_off) &&
118 (!alp->al_len || (bn < alp->al_off + alp->al_len))) {
119 dprintf(("found, "));
121 *bnp = bn - alp->al_off + alp->al_lsn;
123 dprintf((" 0x%x ", *bnp));
127 *runp = alp->al_off - 1 +
132 dprintf((" 0x%x cont", *runp));
144 dprintf(("END, notfound\n"));
148 dprintf(("hpfs_hpbmap: offset too big\n"));
154 * Find place and preinitialize AlSec structure
155 * AlBlk is initialized to contain AlLeafs.
158 hpfs_allocalsec(struct hpfsmount *hpmp, lsn_t parlsn, struct buf **bpp)
167 error = hpfs_bmfblookup(hpmp, &lsn);
169 printf("hpfs_allocalsec: CAN'T ALLOC SPACE FOR AlSec\n");
173 error = hpfs_bmmarkbusy(hpmp, lsn, 1);
177 bp = getblk(hpmp->hpm_devvp, lsn, DEV_BSIZE, 0, 0);
180 /* Fill AlSec info */
181 asp = (alsec_t *) bp->b_data;
182 asp->as_magic = AS_MAGIC;
184 asp->as_parent = parlsn;
187 asp->as_ab.ab_flag = 0;
188 asp->as_ab.ab_busycnt = 0;
189 asp->as_ab.ab_freecnt = 0x28;
190 asp->as_ab.ab_freeoff = sizeof(alblk_t);
198 * Split AlSec structure into new allocated:
199 * allocate new AlSec; then move second half of asp's entries in
200 * into it; set proper flags.
202 * IF AlSec CONTAINS AlNodes, THEN YOU ALMOST EVERYTIME HAVE TO
203 * FIX LAST AlNode in OLD AlSec (NEXTOFF TO BE 0xFFFFFFFF).
204 * TOGETHER WITH FIXING ALL CHILDREN'S AlSecs (THEY HAVE GOT NEW PARENT).
207 hpfs_splitalsec(struct hpfsmount *hpmp, alsec_t *asp, alsec_t **naspp,
214 int error, n1, n2, sz;
216 error = hpfs_allocalsec(hpmp, asp->as_parent, &nbp);
220 nasp = (alsec_t *)nbp->b_data;
224 n1 = (abp->ab_busycnt + 1) / 2;
225 n2 = (abp->ab_busycnt - n1);
226 sz = (abp->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
228 bcopy((caddr_t)abp + sizeof(alblk_t) + n1 * sz,
229 (caddr_t)nabp + sizeof(alblk_t), n2 * sz);
231 nabp->ab_flag = abp->ab_flag;
232 nabp->ab_busycnt = n2;
233 nabp->ab_freecnt = (0x1e0 / sz - n2);
234 nabp->ab_freeoff += n2 * sz;
236 abp->ab_busycnt -= n1;
237 abp->ab_freecnt += n1;
238 abp->ab_freeoff -= n1 * sz;
247 * Try to concatenate two AlSec's
249 * Moves all entries from AlSec corresponding (as1p, aanp[1]) into
250 * corresponding aanp[0] one. If not enought space, then return ENOSPC.
252 * WARNING! YOU HAVE TO FIX aanp VALUES YOURSELF LATER:
253 * aanp[0].an_nextoff = aanp[1].an_nextoff;
256 hpfs_concatalsec(struct hpfsmount *hpmp, alsec_t *as0p, alsec_t *as1p,
263 dprintf(("hpfs_concatalsec: AlSecs at 0x%x and 0x%x \n",
264 as0p->as_self,as1p->as_self));
268 sz = (ab0p->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
270 if (ab0p->ab_freecnt > ab1p->ab_busycnt) {
274 if (ab0p->ab_flag & AB_NODES)
275 AB_LASTANP(ab0p)->an_nextoff = aanp[0].an_nextoff;
277 bcopy (AB_ALNODE(ab1p), AB_FREEANP(ab0p),
278 ab1p->ab_busycnt * sz);
280 AB_ADDNREC(ab0p, sz, ab1p->ab_busycnt);
284 /* Not enought space to concatenate */
290 * Transform AlBlk structure into new allocated
293 * DOESN'T SET AlSec'S PARENT LSN.
296 hpfs_alblk2alsec(struct hpfsmount *hpmp, alblk_t *abp, alsec_t **naspp,
304 error = hpfs_allocalsec(hpmp, 0, &nbp);
308 nasp = (alsec_t *)nbp->b_data;
311 sz = (abp->ab_flag & AB_NODES) ? sizeof(alnode_t) : sizeof(alleaf_t);
313 bcopy (abp, nabp, sizeof(alblk_t) + sz * abp->ab_busycnt);
315 nabp->ab_freecnt = 0x1e0 / sz - nabp->ab_busycnt;
324 * Allocate len blocks and concatenate them to file.
325 * If we hadn't found contignous run of len blocks, concatenate
326 * as much as we can, and return.
330 hpfs_addextent(struct hpfsmount *hpmp, struct hpfsnode *hp, u_long len)
339 * We don't know for now start lsn of block
343 al.al_off = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
345 rabp = &hp->h_fn.fn_ab;
347 /* Init AlBlk if this is first extent */
348 if (al.al_off == 0) {
352 dprintf(("hpfs_addextent: init AlBlk in root\n"));
354 rabp->ab_busycnt = 0;
355 rabp->ab_freecnt = 0x8;
356 rabp->ab_freeoff = sizeof(alblk_t);
359 error = hpfs_bmlookup (hpmp, 0, hp->h_no + 1, al.al_len, &nlsn, &nlen);
363 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
367 dprintf(("hpfs_addextent: new: 0x%x 0x%lx, ", nlsn, nlen));
369 AL_SET(AB_FREEALP(rabp), al.al_off, nlen, nlsn);
377 dprintf(("hpfs_addextent: AlBlk: [0x%x, 0x%x, 0x%x] need: 0x%x\n",
378 rabp->ab_freecnt, rabp->ab_busycnt, rabp->ab_flag, al.al_len));
380 while ((al.al_len) && (rabp->ab_freecnt > 0)) {
381 if (rabp->ab_flag & AB_NODES) {
384 * This is level containing AlNodes, so try to
385 * insert recursively into last entry.
387 anp = AB_LASTANP(rabp);
388 dprintf(("hpfs_addextent: AlNode: [0x%x,0x%x] \n",
389 anp->an_nextoff,anp->an_lsn));
394 error = hpfs_addextentr (hpmp, anp->an_lsn, &al, ranp, &pf);
396 printf("hpfs_addextent: FAILED %d\n",error);
402 dprintf(("hpfs_addextent: successful (split)\n"));
404 * Then hpfs_addextentr has split tree below, now
405 * we need to fix this level. Particulary:
406 * fix last AlNode and add another one.
409 bcopy(ranp, AB_LASTANP(rabp), sizeof(alnode_t) * 2);
415 dprintf(("hpfs_addextent: successful\n"));
421 alp = AB_LASTALP(rabp);
422 dprintf(("hpfs_addextent: AlLeaf: [0x%x,0x%x,0x%x] \n",
423 alp->al_off,alp->al_len,alp->al_lsn));
425 /* Check if we trying to add in right place */
426 if (alp->al_off + alp->al_len == al.al_off) {
431 * Search bitmap for block begining from
432 * alp->al_lsn + alp->al_len and long of ralp->al_len
434 error = hpfs_bmlookup (hpmp, 0,
435 alp->al_lsn + alp->al_len, al.al_len, &nlsn, &nlen);
439 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
443 dprintf(("hpfs_addextent: new: 0x%x 0x%lx, ", nlsn, nlen));
445 if (alp->al_lsn + alp->al_len == nlsn) {
446 dprintf(("extended existed leaf\n"));
450 dprintf(("created new leaf\n"));
451 AL_SET(AB_FREEALP(rabp), al.al_off, nlen, nlsn);
457 printf("hpfs_addextent: INTERNAL INCONSISTENCE\n");
464 * Move AlBlk contain to new AlSec (it will fit more
465 * entries) if overflowed (no more free entries).
467 if (rabp->ab_freecnt <= 0) {
471 dprintf(("hpfs_addextent: overflow, convt\n"));
474 * Convert AlBlk to new AlSec, it will set
477 rabp->ab_flag |= AB_FNPARENT;
478 error = hpfs_alblk2alsec (hpmp, rabp, &nrasp, &nbp);
480 printf("hpfs_addextent: CAN'T CONVT\n");
483 nrasp->as_parent = hp->h_no;
486 * Scan all childrens (if exist), set new parent and
487 * clean their AB_FNPARENT flag.
489 if (rabp->ab_flag & AB_NODES) {
495 anp = AB_ALNODE(rabp);
496 for (i=0; i<rabp->ab_busycnt; i++) {
497 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
501 asp = (alsec_t *)bp->b_data;
502 asp->as_ab.ab_flag &= ~AB_FNPARENT;
503 asp->as_parent = nrasp->as_self;
510 /* Convert AlBlk to contain AlNodes */
511 rabp->ab_flag = AB_NODES;
512 rabp->ab_busycnt = 0;
513 rabp->ab_freecnt = 0xC;
514 rabp->ab_freeoff = sizeof(alblk_t);
516 /* Add AlNode for new allocated AlSec */
517 AN_SET(AB_FREEANP(rabp), ~0, nrasp->as_self);
524 dprintf(("hpfs_addextent: root retry\n"));
532 * Descent down to the end of tree, then search for
533 * ralp->len contignous run begining from last run's end and
534 * concatenate new block! If we can't find one, then...
538 * rlsn: LSN containing AlSec
539 * ralp: AlLeaf to insert
540 * ranp: New AlNodes' values
541 * resp: Mix returning info
544 hpfs_addextentr(struct hpfsmount *hpmp, lsn_t rlsn, alleaf_t *ralp,
545 alnode_t *ranp, u_long *resp)
558 dprintf(("hpfs_addextentr: AlSec at 0x%x\n", rlsn));
560 error = hpfs_breadalsec(hpmp, rlsn, &rbp);
564 rasp = (alsec_t *)rbp->b_data;
568 dprintf(("hpfs_addextentr: AlBlk: [0x%x, 0x%x, 0x%x]\n",
569 rabp->ab_freecnt, rabp->ab_busycnt, rabp->ab_flag));
571 while ((ralp->al_len) && (rabp->ab_freecnt > 0)) {
572 if (rabp->ab_flag & AB_NODES) {
574 * This is level containing AlNodes, so try to
575 * insert recursively into last entry.
577 anp = AB_LASTANP(rabp);
578 dprintf(("hpfs_addextentr: AlNode: [0x%x,0x%x] \n",
579 anp->an_nextoff,anp->an_lsn));
584 error = hpfs_addextentr (hpmp, anp->an_lsn, ralp, ranp, &pf);
586 printf("hpfs_addextentr: FAILED %d\n",error);
592 dprintf(("hpfs_addextentr: successful (split)\n"));
594 * Then hpfs_addextentr has split tree below, now
595 * we need to fix this level. Particulary:
596 * fix last AlNode and add another one.
598 bcopy(ranp, AB_LASTANP(rabp), sizeof(alnode_t) * 2);
605 dprintf(("hpfs_addextentr: successful\n"));
609 alp = AB_LASTALP(rabp);
610 dprintf(("hpfs_addextentr: AlLeaf: [0x%x,0x%x,0x%x] \n",
611 alp->al_off,alp->al_len,alp->al_lsn));
613 /* Check if we trying to add in right place */
614 if (alp->al_off + alp->al_len == ralp->al_off) {
618 * Search bitmap for block begining from
619 * alp->al_lsn + alp->al_len and long of ralp->al_len
621 error = hpfs_bmlookup (hpmp, 0,
622 alp->al_lsn + alp->al_len, ralp->al_len, &nlsn, &nlen);
626 error = hpfs_bmmarkbusy(hpmp, nlsn, nlen);
630 dprintf(("hpfs_addextentr: new: 0x%x 0x%lx, ", nlsn, nlen));
633 * If ending of existed entry fits the
634 * begining of the extent being added,
635 * then we add concatenate two extents.
637 if (alp->al_lsn + alp->al_len == nlsn) {
638 dprintf(("concat\n"));
641 dprintf(("created new leaf\n"));
642 AL_SET(AB_FREEALP(rabp), ralp->al_off, nlen, nlsn);
646 ralp->al_len -= nlen;
647 ralp->al_off += nlen;
649 printf("hpfs_addextentr: INTERNAL INCONSISTENCE\n");
657 * Split AlBlk if overflowed.
659 if (rabp->ab_freecnt <= 0) {
663 dprintf(("hpfs_addextentr: overflow, split\n"));
665 error = hpfs_splitalsec (hpmp, rasp, &nrasp, &nbp);
667 printf("hpfs_addextent: CAN'T SPLIT\n");
671 if (rabp->ab_flag & AB_NODES) {
678 AB_LASTANP(&rasp->as_ab)->an_nextoff;
680 /* We need to set left subtree's last entry
681 * offset to 0xFFFFFFFF for OS/2 to be able
682 * to read our files. It treats absence of
683 * 0xFFFFFFFF as error.
685 AB_LASTANP(&rasp->as_ab)->an_nextoff = ~0;
687 /* We need to fix new allocated AlSec's
688 * children, becouse their parent has changed.
690 anp = AB_ALNODE(&nrasp->as_ab);
691 for (i=0; i<nrasp->as_ab.ab_busycnt; i++) {
692 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
698 asp = (alsec_t *)bp->b_data;
699 asp->as_parent = nrasp->as_self;
706 AB_ALLEAF(&nrasp->as_ab)->al_off;
709 ranp[0].an_lsn = rasp->as_self;
710 ranp[1].an_nextoff = ~0;
711 ranp[1].an_lsn = nrasp->as_self;
733 * Recursive routine walking down the b-tree and deallocating all
734 * extents above bn. Returns *resp != 0 if alblk was totally
735 * deallocated and may be freed. Tries to keep b-tree.
737 * (XXXX) NOTE! THIS ROUTINE WILL NEVER DECREMENT DEPTH OF
741 hpfs_truncatealblk(struct hpfsmount *hpmp, alblk_t *abp, lsn_t bn, int *resp)
749 dprintf(("hpfs_truncatealblk: AlBlk: [0x%x,0x%x, 0x%x]\n",
750 abp->ab_freecnt, abp->ab_busycnt, abp->ab_flag));
752 if (abp->ab_flag & AB_NODES) {
754 * Scan array of AlNodes backward,
755 * diving in recursion if needed
757 anp = AB_LASTANP(abp);
759 while (abp->ab_busycnt && (bn <= anp->an_nextoff)) {
760 dprintf(("hpfs_truncatealblk: AlNode: [0x%x,0x%x] \n",
761 anp->an_nextoff,anp->an_lsn));
763 error = hpfs_breadalsec(hpmp, anp->an_lsn, &bp);
767 asp = (alsec_t *)bp->b_data;
769 error = hpfs_truncatealblk (hpmp,
770 &asp->as_ab, bn, resp);
779 error = hpfs_bmmarkfree(hpmp,
788 * We have deallocated some entries, some space
789 * migth been freed, then try to concat two
792 anp->an_nextoff = ~0;
793 if (abp->ab_busycnt >= 2) {
797 error = hpfs_breadalsec(hpmp,
798 (anp-1)->an_lsn, &b0p);
802 as0p = (alsec_t *)b0p->b_data;
803 error = hpfs_concatalsec(hpmp,
805 if (error == ENOSPC) {
806 /* Not enought space */
809 } else if (error == 0) {
811 (anp-1)->an_nextoff = anp->an_nextoff;
816 error = hpfs_bmmarkfree(hpmp,
829 /* Nowhere to concatenate */
833 /* There can not be any more entries
834 * over greater bn, becouse last AlSec
835 * wasn't freed totally. So go out.
841 if (abp->ab_busycnt == 0)
847 * Scan array of AlLeafs backward,
850 alp = AB_LASTALP(abp);
852 while (abp->ab_busycnt && (bn < alp->al_off + alp->al_len)){
853 dprintf(("hpfs_truncatealblk: AlLeaf: [0x%x,0x%x,0x%x] \n",
854 alp->al_off,alp->al_len,alp->al_lsn));
856 if (bn <= alp->al_off) {
857 error = hpfs_bmmarkfree(hpmp, alp->al_lsn,
864 } else if ((bn > alp->al_off) &&
865 (bn < alp->al_off + alp->al_len)){
866 error = hpfs_bmmarkfree(hpmp,
867 alp->al_lsn + bn - alp->al_off,
868 alp->al_len - bn + alp->al_off);
872 alp->al_len = bn - alp->al_off;
880 /* Signal parent deallocation, if need */
881 if (abp->ab_busycnt == 0)