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 $
27 * $DragonFly: src/sys/vfs/hpfs/hpfs_subr.c,v 1.6 2003/08/15 07:26:15 dillon 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 "hpfsmount.h"
45 #include "hpfs_subr.h"
54 for (i=0; i < size; i++) {
55 csum += (u_long) *object++;
56 csum = (csum << 7) + (csum >> (25));
63 struct hpfsmount *hpmp)
68 dprintf(("hpmp_bmdeinit: "));
70 if (!(hpmp->hpm_mp->mnt_flag & MNT_RDONLY)) {
74 for (i=0; i<hpmp->hpm_dbnum; i++) {
75 dprintf(("[%d: 0x%x] ", i, hpmp->hpm_bmind[i]));
77 bp = getblk(hpmp->hpm_devvp, hpmp->hpm_bmind[i],
81 bcopy(hpmp->hpm_bitmap + BMSIZE * i, bp->b_data,
88 FREE(hpmp->hpm_bitmap,M_HPFSMNT);
89 FREE(hpmp->hpm_bmind,M_HPFSMNT);
95 * Initialize BitMap management, includes calculation of
96 * available blocks number.
100 struct hpfsmount *hpmp)
106 dprintf(("hpfs_bminit: "));
108 hpmp->hpm_dbnum = (hpmp->hpm_su.su_btotal + 0x3FFF) / 0x4000;
110 dprintf(("0x%lx data bands, ", hpmp->hpm_dbnum));
112 MALLOC(hpmp->hpm_bmind, lsn_t *, hpmp->hpm_dbnum * sizeof(lsn_t),
113 M_HPFSMNT, M_WAITOK);
115 MALLOC(hpmp->hpm_bitmap, u_int8_t *, hpmp->hpm_dbnum * BMSIZE,
116 M_HPFSMNT, M_WAITOK);
118 error = bread(hpmp->hpm_devvp, hpmp->hpm_su.su_bitmap.lsn1,
119 ((hpmp->hpm_dbnum + 0x7F) & ~(0x7F)) << 2, &bp);
122 FREE(hpmp->hpm_bitmap, M_HPFSMNT);
123 FREE(hpmp->hpm_bmind, M_HPFSMNT);
124 dprintf((" error %d\n", error));
127 bcopy(bp->b_data, hpmp->hpm_bmind, hpmp->hpm_dbnum * sizeof(lsn_t));
134 for (i=0; i<hpmp->hpm_dbnum; i++) {
135 dprintf(("[%d: 0x%x] ", i, hpmp->hpm_bmind[i]));
137 error = bread(hpmp->hpm_devvp, hpmp->hpm_bmind[i],
141 FREE(hpmp->hpm_bitmap, M_HPFSMNT);
142 FREE(hpmp->hpm_bmind, M_HPFSMNT);
143 dprintf((" error %d\n", error));
146 bcopy(bp->b_data, hpmp->hpm_bitmap + BMSIZE * i, BMSIZE);
152 * Look througth BitMap and count free bits
155 for (i=0; i < hpmp->hpm_su.su_btotal >> 5; i++) {
157 for (k=0, mask=1; k < 32; k++, mask<<=1)
158 if(((u_int32_t *)hpmp->hpm_bitmap)[i] & mask)
162 hpmp->hpm_bavail = dbavail;
169 struct hpfsmount *hpmp,
178 for (i = 0; i < ulen && i < dlen; i++) {
179 res = hpfs_toupper(hpmp, hpfs_u2d(hpmp, uname[i]), cp) -
180 hpfs_toupper(hpmp, dname[i], cp);
184 return (ulen - dlen);
189 struct hpfsmount *hpmp,
199 for (i = 0; i < str1len && i < str2len; i++) {
200 res = (int)hpfs_toupper(hpmp, ((u_char *)str1)[i], str1cp) -
201 (int)hpfs_toupper(hpmp, ((u_char *)str2)[i], str2cp);
205 return (str1len - str2len);
211 struct hpfsmount *hpmp,
212 struct cpiblk *cpibp,
213 struct cpdblk *cpdbp)
216 struct cpdsec * cpdsp;
219 error = bread(hpmp->hpm_devvp, cpibp->b_cpdsec, DEV_BSIZE, &bp);
225 cpdsp = (struct cpdsec *)bp->b_data;
227 for (i=cpdsp->d_cpfirst; i<cpdsp->d_cpcnt; i++) {
228 if (cpdsp->d_cpdblk[i].b_cpid == cpibp->b_cpid) {
229 bcopy(cpdsp->d_cpdblk + i, cpdbp,
230 sizeof(struct cpdblk));
245 * Initialize Code Page information management.
246 * Load all copdepages in memory.
250 struct hpfsmount *hpmp,
251 struct hpfs_args *argsp)
257 struct cpisec * cpisp;
258 struct cpiblk * cpibp;
259 struct cpdblk * cpdbp;
261 dprintf(("hpfs_cpinit: \n"));
263 if (argsp->flags & HPFSMNT_TABLES) {
264 bcopy(argsp->d2u, hpmp->hpm_d2u, sizeof(u_char) * 0x80);
265 bcopy(argsp->u2d, hpmp->hpm_u2d, sizeof(u_char) * 0x80);
267 for (i=0x0; i<0x80;i++) {
268 hpmp->hpm_d2u[i] = i + 0x80;
269 hpmp->hpm_u2d[i] = i + 0x80;
273 cpicnt = hpmp->hpm_sp.sp_cpinum;
275 MALLOC(hpmp->hpm_cpdblk, struct cpdblk *,
276 cpicnt * sizeof(struct cpdblk), M_HPFSMNT, M_WAITOK);
278 cpdbp = hpmp->hpm_cpdblk;
279 lsn = hpmp->hpm_sp.sp_cpi;
282 error = bread(hpmp->hpm_devvp, lsn, DEV_BSIZE, &bp);
288 cpisp = (struct cpisec *)bp->b_data;
290 cpibp = cpisp->s_cpi;
291 for (i=0; i<cpisp->s_cpicnt; i++, cpicnt --, cpdbp++, cpibp++) {
292 dprintf(("hpfs_cpinit: Country: %d, CP: %d (%d)\n",
293 cpibp->b_country, cpibp->b_cpid,
296 error = hpfs_cpload(hpmp, cpibp, cpdbp);
311 struct hpfsmount *hpmp)
313 dprintf(("hpmp_cpdeinit: "));
314 FREE(hpmp->hpm_cpdblk,M_HPFSMNT);
319 * Lookup for a run of blocks.
323 struct hpfsmount *hpmp,
324 u_long flags, /* 1 means we want right len blocks in run, not less */
325 lsn_t lsn, /* We want near this one */
326 u_long len, /* We want such long */
327 lsn_t *lsnp, /* We got here */
328 u_long *lenp) /* We got this long */
337 dprintf(("hpfs_bmlookup: lsn: 0x%x, len 0x%lx | Step1\n", lsn, len));
339 if (lsn > hpmp->hpm_su.su_btotal) {
340 printf("hpfs_bmlookup: OUT OF VOLUME\n");
343 if (len > hpmp->hpm_bavail) {
344 printf("hpfs_bmlookup: OUT OF SPACE\n");
350 bitmap = (u_int32_t *)hpmp->hpm_bitmap + i;
352 if (*bitmap & mask) {
355 for (; k < 32; k++, mask<<=1) {
371 for (; i < hpmp->hpm_su.su_btotal >> 5; i++, bitmap++) {
372 for (k=0, mask=1; k < 32; k++, mask<<=1) {
391 * Lookup all bands begining from cband, lookup for first block
394 dprintf(("hpfs_bmlookup: Step2: band 0x%x (0x%lx)\n",
395 cband, hpmp->hpm_dbnum));
396 for (vcband = 0; vcband < hpmp->hpm_dbnum; vcband ++, cband++) {
397 cband = cband % hpmp->hpm_dbnum;
398 bandsz = min (hpmp->hpm_su.su_btotal - (cband << 14), 0x4000);
399 dprintf(("hpfs_bmlookup: band: %d, sz: 0x%x\n", cband, bandsz));
401 bitmap = (u_int32_t *)hpmp->hpm_bitmap + (cband << 9);
405 for (i=0; i < bandsz >> 5; i++, bitmap++) {
406 for (k=0, mask=1; k < 32; k++, mask<<=1) {
407 if (*bitmap & mask) {
412 *lsnp = (cband << 14) + (i << 5) + k;
416 if ((*lenp) && !(flags & 1)) {
427 if (cband == hpmp->hpm_dbnum - 1) {
428 if ((*lenp) && !(flags & 1)) {
440 * Lookup a single free block. XXX Need locking on BitMap operations
441 * VERY STUPID ROUTINE!!!
445 struct hpfsmount *hpmp,
451 dprintf(("hpfs_bmfblookup: "));
453 bitmap = (u_int32_t *)hpmp->hpm_bitmap;
454 for (i=0; i < hpmp->hpm_su.su_btotal >> 5; i++, bitmap++) {
457 *lp = (i << 5) + k - 1;
458 dprintf((" found: 0x%x\n",*lp));
467 * Mark contignous block of blocks.
471 struct hpfsmount *hpmp,
479 dprintf(("hpfs_bmmark(0x%x, 0x%lx, %d): \n",bn,bl, state));
481 if ((bn > hpmp->hpm_su.su_btotal) || (bn+bl > hpmp->hpm_su.su_btotal)) {
482 printf("hpfs_bmmark: MARKING OUT OF VOLUME\n");
485 bitmap = (u_int32_t *)hpmp->hpm_bitmap;
489 for (i = bn & 0x1F; (i < 0x20) && (bl > 0) ; i++, bl--) {
491 if ( *bitmap & (1 << i)) {
493 printf("hpfs_bmmark: ALREADY FREE\n");
501 if ((~(*bitmap)) & (1 << i)) {
503 printf("hpfs_bmmark: ALREADY BUSY\n");
509 *bitmap &= ~(1 << i);
521 hpfs_validateparent (
524 struct hpfsnode *dhp;
526 struct hpfsmount *hpmp = hp->h_hpmp;
529 struct hpfsdirent *dep;
533 dprintf(("hpfs_validatetimes(0x%x): [parent: 0x%x] ",
534 hp->h_no, hp->h_fn.fn_parent));
536 if (hp->h_no == hp->h_fn.fn_parent) {
539 error = VFS_VGET(hpmp->hpm_mp, hp->h_fn.fn_parent, &dvp);
545 lsn = ((alleaf_t *)dhp->h_fn.fn_abd)->al_lsn;
552 dprintf(("[dive 0x%x] ", lsn));
555 error = bread(dhp->h_devvp, lsn, D_BSIZE, &bp);
559 dp = (struct dirblk *) bp->b_data;
560 if (dp->d_magic != D_MAGIC) {
561 printf("hpfs_validatetimes: magic doesn't match\n");
569 dprintf(("[restore 0x%x] ", olsn));
571 while(!(dep->de_flag & DE_END) ) {
572 if((dep->de_flag & DE_DOWN) &&
573 (olsn == DE_DOWNLSN(dep)))
575 dep = (hpfsdirent_t *)((caddr_t)dep + dep->de_reclen);
578 if((dep->de_flag & DE_DOWN) && (olsn == DE_DOWNLSN(dep))) {
579 if (dep->de_flag & DE_END)
582 if (hp->h_no == dep->de_fnode) {
583 dprintf(("[found] "));
587 dep = (hpfsdirent_t *)((caddr_t)dep + dep->de_reclen);
589 printf("hpfs_validatetimes: ERROR! oLSN not found\n");
597 while(!(dep->de_flag & DE_END)) {
598 if(dep->de_flag & DE_DOWN) {
599 lsn = DE_DOWNLSN(dep);
604 if (hp->h_no == dep->de_fnode) {
605 dprintf(("[found] "));
609 dep = (hpfsdirent_t *)((caddr_t)dep + dep->de_reclen);
612 if(dep->de_flag & DE_DOWN) {
613 dprintf(("[enddive] "));
614 lsn = DE_DOWNLSN(dep);
624 dprintf(("[level %d] ", level));
626 goto dive; /* undive really */
631 bcopy(dep->de_name,hp->h_name,dep->de_namelen);
632 hp->h_name[dep->de_namelen] = '\0';
633 hp->h_namelen = dep->de_namelen;
634 hp->h_ctime = dep->de_ctime;
635 hp->h_atime = dep->de_atime;
636 hp->h_mtime = dep->de_mtime;
637 hp->h_flag |= H_PARVALID;
639 dprintf(("[readdone]"));
664 * Write down changes done to parent dir, these are only times for now.
665 * hpfsnode have to be locked.
671 struct hpfsnode *dhp;
673 struct hpfsdirent *dep;
677 dprintf(("hpfs_updateparent(0x%x): \n", hp->h_no));
679 if (!(hp->h_flag & H_PARCHANGE))
682 if (!(hp->h_flag & H_PARVALID)) {
683 error = hpfs_validateparent (hp);
688 if (hp->h_no == hp->h_fn.fn_parent) {
691 error = VFS_VGET(hp->h_hpmp->hpm_mp, hp->h_fn.fn_parent,
698 error = hpfs_genlookupbyname (dhp, hp->h_name, hp->h_namelen,
704 dep->de_atime = hp->h_atime;
705 dep->de_mtime = hp->h_mtime;
706 dep->de_size = hp->h_fn.fn_size;
710 hp->h_flag &= ~H_PARCHANGE;
721 * Write down on disk changes done to fnode. hpfsnode have to be locked.
729 dprintf(("hpfs_update(0x%x): \n", hp->h_no));
731 if (!(hp->h_flag & H_CHANGE))
734 bp = getblk(hp->h_devvp, hp->h_no, FNODESIZE, 0, 0);
737 bcopy (&hp->h_fn, bp->b_data, sizeof(struct fnode));
740 hp->h_flag &= ~H_CHANGE;
742 if (hp->h_flag & H_PARCHANGE)
743 return (hpfs_updateparent(hp));
749 * Truncate file to specifed size. hpfsnode have to be locked.
756 struct hpfsmount *hpmp = hp->h_hpmp;
757 lsn_t newblen, oldblen;
760 dprintf(("hpfs_truncate(0x%x, 0x%x -> 0x%lx): ",
761 hp->h_no, hp->h_fn.fn_size, size));
763 newblen = (size + DEV_BSIZE - 1) >> DEV_BSHIFT;
764 oldblen = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
766 dprintf(("blen: 0x%x -> 0x%x\n", oldblen, newblen));
768 error = hpfs_truncatealblk (hpmp, &hp->h_fn.fn_ab, newblen, &pf);
772 hp->h_fn.fn_ab.ab_flag = 0;
773 hp->h_fn.fn_ab.ab_freecnt = 0x8;
774 hp->h_fn.fn_ab.ab_busycnt = 0x0;
775 hp->h_fn.fn_ab.ab_freeoff = sizeof(alblk_t);
778 hp->h_fn.fn_size = size;
780 hp->h_flag |= (H_CHANGE | H_PARCHANGE);
782 dprintf(("hpfs_truncate: successful\n"));
788 * Enlarge file to specifed size. hpfsnode have to be locked.
795 struct hpfsmount *hpmp = hp->h_hpmp;
796 lsn_t newblen, oldblen;
799 dprintf(("hpfs_extend(0x%x, 0x%x -> 0x%lx): ",
800 hp->h_no, hp->h_fn.fn_size, size));
802 if (hpmp->hpm_bavail < 0x10)
805 newblen = (size + DEV_BSIZE - 1) >> DEV_BSHIFT;
806 oldblen = (hp->h_fn.fn_size + DEV_BSIZE - 1) >> DEV_BSHIFT;
808 dprintf(("blen: 0x%x -> 0x%x\n", oldblen, newblen));
810 error = hpfs_addextent(hpmp, hp, newblen - oldblen);
812 printf("hpfs_extend: FAILED TO ADD EXTENT %d\n", error);
816 hp->h_fn.fn_size = size;
818 hp->h_flag |= (H_CHANGE | H_PARCHANGE);
820 dprintf(("hpfs_extend: successful\n"));
826 * Read AlSec structure, and check if magic is valid.
827 * You don't need to brelse buf on error.
831 struct hpfsmount *hpmp,
841 dprintf(("hpfs_breadstruct: reading at 0x%x\n", lsn));
845 error = bread(hpmp->hpm_devvp, lsn, len, &bp);
850 mp = (u_int32_t *) bp->b_data;
853 printf("hpfs_breadstruct: MAGIC DOESN'T MATCH (0x%08x != 0x%08x)\n",