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_subr.c,v 1.1 1999/12/09 19:09:59 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>
45 #include "hpfsmount.h"
46 #include "hpfs_subr.h"
55 for (i=0; i < size; i++) {
56 csum += (u_long) *object++;
57 csum = (csum << 7) + (csum >> (25));
64 struct hpfsmount *hpmp)
69 dprintf(("hpmp_bmdeinit: "));
71 if (!(hpmp->hpm_mp->mnt_flag & MNT_RDONLY)) {
75 for (i=0; i<hpmp->hpm_dbnum; i++) {
76 dprintf(("[%d: 0x%x] ", i, hpmp->hpm_bmind[i]));
78 bp = getblk(hpmp->hpm_devvp,
79 dbtodoff(hpmp->hpm_bmind[i]),
83 bcopy(hpmp->hpm_bitmap + BMSIZE * i, bp->b_data,
90 kfree(hpmp->hpm_bitmap, M_HPFSMNT);
91 kfree(hpmp->hpm_bmind, M_HPFSMNT);
97 * Initialize BitMap management, includes calculation of
98 * available blocks number.
102 struct hpfsmount *hpmp)
108 dprintf(("hpfs_bminit: "));
110 hpmp->hpm_dbnum = (hpmp->hpm_su.su_btotal + 0x3FFF) / 0x4000;
112 dprintf(("0x%lx data bands, ", hpmp->hpm_dbnum));
114 hpmp->hpm_bmind = kmalloc(hpmp->hpm_dbnum * sizeof(lsn_t), M_HPFSMNT,
117 hpmp->hpm_bitmap = kmalloc(hpmp->hpm_dbnum * BMSIZE, M_HPFSMNT,
120 error = bread(hpmp->hpm_devvp, dbtodoff(hpmp->hpm_su.su_bitmap.lsn1),
121 ((hpmp->hpm_dbnum + 0x7F) & ~(0x7F)) << 2, &bp);
124 kfree(hpmp->hpm_bitmap, M_HPFSMNT);
125 kfree(hpmp->hpm_bmind, M_HPFSMNT);
126 dprintf((" error %d\n", error));
129 bcopy(bp->b_data, hpmp->hpm_bmind, hpmp->hpm_dbnum * sizeof(lsn_t));
136 for (i=0; i<hpmp->hpm_dbnum; i++) {
137 dprintf(("[%d: 0x%x] ", i, hpmp->hpm_bmind[i]));
139 error = bread(hpmp->hpm_devvp, dbtodoff(hpmp->hpm_bmind[i]),
143 kfree(hpmp->hpm_bitmap, M_HPFSMNT);
144 kfree(hpmp->hpm_bmind, M_HPFSMNT);
145 dprintf((" error %d\n", error));
148 bcopy(bp->b_data, hpmp->hpm_bitmap + BMSIZE * i, BMSIZE);
154 * Look througth BitMap and count free bits
157 for (i=0; i < hpmp->hpm_su.su_btotal >> 5; i++) {
159 for (k=0, mask=1; k < 32; k++, mask<<=1)
160 if(((u_int32_t *)hpmp->hpm_bitmap)[i] & mask)
164 hpmp->hpm_bavail = dbavail;
171 struct hpfsmount *hpmp,
180 for (i = 0; i < ulen && i < dlen; i++) {
181 res = hpfs_toupper(hpmp, hpfs_u2d(hpmp, uname[i]), cp) -
182 hpfs_toupper(hpmp, dname[i], cp);
186 return (ulen - dlen);
191 struct hpfsmount *hpmp,
201 for (i = 0; i < str1len && i < str2len; i++) {
202 res = (int)hpfs_toupper(hpmp, ((u_char *)str1)[i], str1cp) -
203 (int)hpfs_toupper(hpmp, ((u_char *)str2)[i], str2cp);
207 return (str1len - str2len);
213 struct hpfsmount *hpmp,
214 struct cpiblk *cpibp,
215 struct cpdblk *cpdbp)
218 struct cpdsec * cpdsp;
221 error = bread(hpmp->hpm_devvp, dbtodoff(cpibp->b_cpdsec), DEV_BSIZE, &bp);
227 cpdsp = (struct cpdsec *)bp->b_data;
229 for (i=cpdsp->d_cpfirst; i<cpdsp->d_cpcnt; i++) {
230 if (cpdsp->d_cpdblk[i].b_cpid == cpibp->b_cpid) {
231 bcopy(cpdsp->d_cpdblk + i, cpdbp,
232 sizeof(struct cpdblk));
247 * Initialize Code Page information management.
248 * Load all copdepages in memory.
252 struct hpfsmount *hpmp,
253 struct hpfs_args *argsp)
259 struct cpisec * cpisp;
260 struct cpiblk * cpibp;
261 struct cpdblk * cpdbp;
263 dprintf(("hpfs_cpinit: \n"));
265 if (argsp->flags & HPFSMNT_TABLES) {
266 bcopy(argsp->d2u, hpmp->hpm_d2u, sizeof(u_char) * 0x80);
267 bcopy(argsp->u2d, hpmp->hpm_u2d, sizeof(u_char) * 0x80);
269 for (i=0x0; i<0x80;i++) {
270 hpmp->hpm_d2u[i] = i + 0x80;
271 hpmp->hpm_u2d[i] = i + 0x80;
275 cpicnt = hpmp->hpm_sp.sp_cpinum;
277 hpmp->hpm_cpdblk = kmalloc(cpicnt * sizeof(struct cpdblk), M_HPFSMNT,
280 cpdbp = hpmp->hpm_cpdblk;
281 lsn = hpmp->hpm_sp.sp_cpi;
284 error = bread(hpmp->hpm_devvp, dbtodoff(lsn), DEV_BSIZE, &bp);
290 cpisp = (struct cpisec *)bp->b_data;
292 cpibp = cpisp->s_cpi;
293 for (i=0; i<cpisp->s_cpicnt; i++, cpicnt --, cpdbp++, cpibp++) {
294 dprintf(("hpfs_cpinit: Country: %d, CP: %d (%d)\n",
295 cpibp->b_country, cpibp->b_cpid,
298 error = hpfs_cpload(hpmp, cpibp, cpdbp);
313 struct hpfsmount *hpmp)
315 dprintf(("hpmp_cpdeinit: "));
316 kfree(hpmp->hpm_cpdblk, M_HPFSMNT);
321 * Lookup for a run of blocks.
325 struct hpfsmount *hpmp,
326 u_long flags, /* 1 means we want right len blocks in run, not less */
327 lsn_t lsn, /* We want near this one */
328 u_long len, /* We want such long */
329 lsn_t *lsnp, /* We got here */
330 u_long *lenp) /* We got this long */
339 dprintf(("hpfs_bmlookup: lsn: 0x%x, len 0x%lx | Step1\n", lsn, len));
341 if (lsn > hpmp->hpm_su.su_btotal) {
342 kprintf("hpfs_bmlookup: OUT OF VOLUME\n");
345 if (len > hpmp->hpm_bavail) {
346 kprintf("hpfs_bmlookup: OUT OF SPACE\n");
352 bitmap = (u_int32_t *)hpmp->hpm_bitmap + i;
354 if (*bitmap & mask) {
357 for (; k < 32; k++, mask<<=1) {
373 for (; i < hpmp->hpm_su.su_btotal >> 5; i++, bitmap++) {
374 for (k=0, mask=1; k < 32; k++, mask<<=1) {
393 * Lookup all bands begining from cband, lookup for first block
396 dprintf(("hpfs_bmlookup: Step2: band 0x%x (0x%lx)\n",
397 cband, hpmp->hpm_dbnum));
398 for (vcband = 0; vcband < hpmp->hpm_dbnum; vcband ++, cband++) {
399 cband = cband % hpmp->hpm_dbnum;
400 bandsz = min (hpmp->hpm_su.su_btotal - (cband << 14), 0x4000);
401 dprintf(("hpfs_bmlookup: band: %d, sz: 0x%x\n", cband, bandsz));
403 bitmap = (u_int32_t *)hpmp->hpm_bitmap + (cband << 9);
407 for (i=0; i < bandsz >> 5; i++, bitmap++) {
408 for (k=0, mask=1; k < 32; k++, mask<<=1) {
409 if (*bitmap & mask) {
414 *lsnp = (cband << 14) + (i << 5) + k;
418 if ((*lenp) && !(flags & 1)) {
429 if (cband == hpmp->hpm_dbnum - 1) {
430 if ((*lenp) && !(flags & 1)) {
442 * Lookup a single free block. XXX Need locking on BitMap operations
443 * VERY STUPID ROUTINE!!!
447 struct hpfsmount *hpmp,
453 dprintf(("hpfs_bmfblookup: "));
455 bitmap = (u_int32_t *)hpmp->hpm_bitmap;
456 for (i=0; i < hpmp->hpm_su.su_btotal >> 5; i++, bitmap++) {
459 *lp = (i << 5) + k - 1;
460 dprintf((" found: 0x%x\n",*lp));
469 * Mark contignous block of blocks.
473 struct hpfsmount *hpmp,
481 dprintf(("hpfs_bmmark(0x%x, 0x%lx, %d): \n",bn,bl, state));
483 if ((bn > hpmp->hpm_su.su_btotal) || (bn+bl > hpmp->hpm_su.su_btotal)) {
484 kprintf("hpfs_bmmark: MARKING OUT OF VOLUME\n");
487 bitmap = (u_int32_t *)hpmp->hpm_bitmap;
491 for (i = bn & 0x1F; (i < 0x20) && (bl > 0) ; i++, bl--) {
493 if ( *bitmap & (1 << i)) {
495 kprintf("hpfs_bmmark: ALREADY FREE\n");
503 if ((~(*bitmap)) & (1 << i)) {
505 kprintf("hpfs_bmmark: ALREADY BUSY\n");
511 *bitmap &= ~(1 << i);
523 hpfs_validateparent (
526 struct hpfsnode *dhp;
528 struct hpfsmount *hpmp = hp->h_hpmp;
531 struct hpfsdirent *dep;
535 dprintf(("hpfs_validatetimes(0x%x): [parent: 0x%x] ",
536 hp->h_no, hp->h_fn.fn_parent));
538 if (hp->h_no == hp->h_fn.fn_parent) {
541 error = VFS_VGET(hpmp->hpm_mp, NULL, hp->h_fn.fn_parent, &dvp);
547 lsn = ((alleaf_t *)dhp->h_fn.fn_abd)->al_lsn;
554 dprintf(("[dive 0x%x] ", lsn));
557 error = bread(dhp->h_devvp, dbtodoff(lsn), D_BSIZE, &bp);
561 dp = (struct dirblk *) bp->b_data;
562 if (dp->d_magic != D_MAGIC) {
563 kprintf("hpfs_validatetimes: magic doesn't match\n");
571 dprintf(("[restore 0x%x] ", olsn));
573 while(!(dep->de_flag & DE_END) ) {
574 if((dep->de_flag & DE_DOWN) &&
575 (olsn == DE_DOWNLSN(dep)))
577 dep = (hpfsdirent_t *)((caddr_t)dep + dep->de_reclen);
580 if((dep->de_flag & DE_DOWN) && (olsn == DE_DOWNLSN(dep))) {
581 if (dep->de_flag & DE_END)
584 if (hp->h_no == dep->de_fnode) {
585 dprintf(("[found] "));
589 dep = (hpfsdirent_t *)((caddr_t)dep + dep->de_reclen);
591 kprintf("hpfs_validatetimes: ERROR! oLSN not found\n");
599 while(!(dep->de_flag & DE_END)) {
600 if(dep->de_flag & DE_DOWN) {
601 lsn = DE_DOWNLSN(dep);
606 if (hp->h_no == dep->de_fnode) {
607 dprintf(("[found] "));
611 dep = (hpfsdirent_t *)((caddr_t)dep + dep->de_reclen);
614 if(dep->de_flag & DE_DOWN) {
615 dprintf(("[enddive] "));
616 lsn = DE_DOWNLSN(dep);
626 dprintf(("[level %d] ", level));
628 goto dive; /* undive really */
633 bcopy(dep->de_name,hp->h_name,dep->de_namelen);
634 hp->h_name[dep->de_namelen] = '\0';
635 hp->h_namelen = dep->de_namelen;
636 hp->h_ctime = dep->de_ctime;
637 hp->h_atime = dep->de_atime;
638 hp->h_mtime = dep->de_mtime;
639 hp->h_flag |= H_PARVALID;
641 dprintf(("[readdone]"));
666 * Write down changes done to parent dir, these are only times for now.
667 * hpfsnode have to be locked.
673 struct hpfsnode *dhp;
675 struct hpfsdirent *dep;
679 dprintf(("hpfs_updateparent(0x%x): \n", hp->h_no));
681 if (!(hp->h_flag & H_PARCHANGE))
684 if (!(hp->h_flag & H_PARVALID)) {
685 error = hpfs_validateparent (hp);
690 if (hp->h_no == hp->h_fn.fn_parent) {
693 error = VFS_VGET(hp->h_hpmp->hpm_mp, NULL,
694 hp->h_fn.fn_parent, &dvp);
700 error = hpfs_genlookupbyname (dhp, hp->h_name, hp->h_namelen,
706 dep->de_atime = hp->h_atime;
707 dep->de_mtime = hp->h_mtime;
708 dep->de_size = hp->h_fn.fn_size;
712 hp->h_flag &= ~H_PARCHANGE;
723 * Write down on disk changes done to fnode. hpfsnode have to be locked.
731 dprintf(("hpfs_update(0x%x): \n", hp->h_no));
733 if (!(hp->h_flag & H_CHANGE))
736 bp = getblk(hp->h_devvp, dbtodoff(hp->h_no), FNODESIZE, 0, 0);
739 bcopy (&hp->h_fn, bp->b_data, sizeof(struct fnode));
742 hp->h_flag &= ~H_CHANGE;
744 if (hp->h_flag & H_PARCHANGE)
745 return (hpfs_updateparent(hp));
751 * Truncate file to specifed size. hpfsnode have to be locked.
758 struct hpfsmount *hpmp = hp->h_hpmp;
765 dprintf(("hpfs_truncate(0x%x, 0x%x -> 0x%lx): ",
766 hp->h_no, hp->h_fn.fn_size, size));
768 newblen = (size + DEV_BSIZE - 1) >> DEV_BSHIFT;
770 oldblen = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
773 dprintf(("blen: 0x%x -> 0x%x\n", oldblen, newblen));
775 error = hpfs_truncatealblk (hpmp, &hp->h_fn.fn_ab, newblen, &pf);
779 hp->h_fn.fn_ab.ab_flag = 0;
780 hp->h_fn.fn_ab.ab_freecnt = 0x8;
781 hp->h_fn.fn_ab.ab_busycnt = 0x0;
782 hp->h_fn.fn_ab.ab_freeoff = sizeof(alblk_t);
785 hp->h_fn.fn_size = size;
787 hp->h_flag |= (H_CHANGE | H_PARCHANGE);
789 dprintf(("hpfs_truncate: successful\n"));
795 * Enlarge file to specifed size. hpfsnode have to be locked.
802 struct hpfsmount *hpmp = hp->h_hpmp;
803 lsn_t newblen, oldblen;
806 dprintf(("hpfs_extend(0x%x, 0x%x -> 0x%lx): ",
807 hp->h_no, hp->h_fn.fn_size, size));
809 if (hpmp->hpm_bavail < 0x10)
812 newblen = (size + DEV_BSIZE - 1) >> DEV_BSHIFT;
813 oldblen = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
815 dprintf(("blen: 0x%x -> 0x%x\n", oldblen, newblen));
817 error = hpfs_addextent(hpmp, hp, newblen - oldblen);
819 kprintf("hpfs_extend: FAILED TO ADD EXTENT %d\n", error);
823 hp->h_fn.fn_size = size;
825 hp->h_flag |= (H_CHANGE | H_PARCHANGE);
827 dprintf(("hpfs_extend: successful\n"));
833 * Read AlSec structure, and check if magic is valid.
834 * You don't need to brelse buf on error.
838 struct hpfsmount *hpmp,
848 dprintf(("hpfs_breadstruct: reading at 0x%x\n", lsn));
852 error = bread(hpmp->hpm_devvp, dbtodoff(lsn), len, &bp);
857 mp = (u_int32_t *) bp->b_data;
860 kprintf("hpfs_breadstruct: MAGIC DOESN'T MATCH (0x%08x != 0x%08x)\n",