ffs_appleufs.c revision 1.2 1 1.2 dbj /* $NetBSD: ffs_appleufs.c,v 1.2 2002/11/02 19:31:09 dbj Exp $ */
2 1.1 dbj /*
3 1.1 dbj * Copyright (c) 2002 Darrin B. Jewell
4 1.1 dbj * All rights reserved.
5 1.1 dbj *
6 1.1 dbj * Redistribution and use in source and binary forms, with or without
7 1.1 dbj * modification, are permitted provided that the following conditions
8 1.1 dbj * are met:
9 1.1 dbj * 1. Redistributions of source code must retain the above copyright
10 1.1 dbj * notice, this list of conditions and the following disclaimer.
11 1.1 dbj * 2. Redistributions in binary form must reproduce the above copyright
12 1.1 dbj * notice, this list of conditions and the following disclaimer in the
13 1.1 dbj * documentation and/or other materials provided with the distribution.
14 1.1 dbj * 3. All advertising materials mentioning features or use of this software
15 1.1 dbj * must display the following acknowledgement:
16 1.1 dbj * This product includes software developed by Darrin B. Jewell
17 1.1 dbj * 4. The name of the author may not be used to endorse or promote products
18 1.1 dbj * derived from this software without specific prior written permission
19 1.1 dbj *
20 1.1 dbj * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
21 1.1 dbj * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
22 1.1 dbj * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
23 1.1 dbj * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
24 1.1 dbj * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
25 1.1 dbj * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
26 1.1 dbj * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
27 1.1 dbj * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
28 1.1 dbj * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
29 1.1 dbj * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
30 1.1 dbj */
31 1.1 dbj
32 1.1 dbj
33 1.1 dbj #include <sys/cdefs.h>
34 1.2 dbj __KERNEL_RCSID(0, "$NetBSD: ffs_appleufs.c,v 1.2 2002/11/02 19:31:09 dbj Exp $");
35 1.1 dbj
36 1.1 dbj #include <sys/param.h>
37 1.1 dbj #include <sys/time.h>
38 1.1 dbj #if defined(_KERNEL)
39 1.1 dbj #include <sys/kernel.h>
40 1.1 dbj #include <sys/systm.h>
41 1.1 dbj #endif
42 1.1 dbj
43 1.1 dbj #include <ufs/ufs/dinode.h>
44 1.1 dbj #include <ufs/ufs/ufs_bswap.h>
45 1.1 dbj #include <ufs/ffs/fs.h>
46 1.1 dbj #include <ufs/ffs/ffs_extern.h>
47 1.1 dbj
48 1.1 dbj #if !defined(_KERNEL) && !defined(STANDALONE)
49 1.1 dbj #include <stddef.h>
50 1.1 dbj #include <stdio.h>
51 1.1 dbj #include <stdlib.h>
52 1.1 dbj #include <string.h>
53 1.1 dbj #include <errno.h>
54 1.1 dbj #include <assert.h>
55 1.1 dbj #define KASSERT(x) assert(x)
56 1.1 dbj #endif
57 1.1 dbj
58 1.1 dbj /*
59 1.1 dbj * this is the same calculation as in_cksum
60 1.1 dbj */
61 1.1 dbj u_int16_t
62 1.1 dbj ffs_appleufs_cksum(appleufs)
63 1.1 dbj const struct appleufslabel *appleufs;
64 1.1 dbj {
65 1.1 dbj const u_int16_t *p = (const u_int16_t *)appleufs;
66 1.1 dbj int len = sizeof(struct appleufslabel);
67 1.1 dbj long res = 0;
68 1.1 dbj while (len > 1) {
69 1.1 dbj res += *p++;
70 1.1 dbj len -= 2;
71 1.1 dbj }
72 1.1 dbj #if 0 /* sizeof(struct appleufslabel) is guaranteed to be even */
73 1.1 dbj if (len == 1)
74 1.2 dbj res += htobe16(*(u_char *)p<<8);
75 1.1 dbj #endif
76 1.1 dbj res = (res >> 16) + (res & 0xffff);
77 1.1 dbj res += (res >> 16);
78 1.1 dbj return (~res);
79 1.1 dbj }
80 1.1 dbj
81 1.1 dbj /* copies o to n, validating and byteswapping along the way
82 1.1 dbj * returns 0 if ok, EINVAL if not valid
83 1.1 dbj */
84 1.1 dbj int
85 1.1 dbj ffs_appleufs_validate(name,o,n)
86 1.1 dbj const char *name;
87 1.1 dbj const struct appleufslabel *o;
88 1.1 dbj struct appleufslabel *n;
89 1.1 dbj {
90 1.1 dbj struct appleufslabel tmp;
91 1.1 dbj if (!n) n = &tmp;
92 1.1 dbj
93 1.2 dbj if (o->ul_magic != be32toh(APPLEUFS_LABEL_MAGIC)) {
94 1.1 dbj return EINVAL;
95 1.1 dbj }
96 1.1 dbj *n = *o;
97 1.1 dbj n->ul_checksum = 0;
98 1.1 dbj n->ul_checksum = ffs_appleufs_cksum(n);
99 1.1 dbj if (n->ul_checksum != o->ul_checksum) {
100 1.1 dbj #if defined(DIAGNOSTIC) || !defined(_KERNEL)
101 1.1 dbj printf("%s: invalid APPLE UFS checksum. found 0x%x, expecting 0x%x",
102 1.1 dbj name,o->ul_checksum,n->ul_checksum);
103 1.1 dbj #endif
104 1.1 dbj return EINVAL;
105 1.1 dbj }
106 1.2 dbj n->ul_magic = be32toh(o->ul_magic);
107 1.2 dbj n->ul_version = be32toh(o->ul_version);
108 1.2 dbj n->ul_time = be32toh(o->ul_time);
109 1.2 dbj n->ul_namelen = be16toh(o->ul_namelen);
110 1.1 dbj
111 1.1 dbj if (n->ul_namelen > APPLEUFS_MAX_LABEL_NAME) {
112 1.1 dbj #if defined(DIAGNOSTIC) || !defined(_KERNEL)
113 1.1 dbj printf("%s: APPLE UFS label name too long, truncated.\n",
114 1.1 dbj name);
115 1.1 dbj #endif
116 1.1 dbj n->ul_namelen = APPLEUFS_MAX_LABEL_NAME;
117 1.1 dbj }
118 1.1 dbj /* if len is max, will set ul_reserved[0] */
119 1.1 dbj n->ul_name[n->ul_namelen] = '\0';
120 1.1 dbj #ifdef DEBUG
121 1.1 dbj printf("%s: found APPLE UFS label v%d: \"%s\"\n",
122 1.1 dbj name,n->ul_version,n->ul_name);
123 1.1 dbj #endif
124 1.1 dbj
125 1.1 dbj return 0;
126 1.1 dbj }
127 1.1 dbj
128 1.1 dbj void
129 1.1 dbj ffs_appleufs_set(appleufs,name,t)
130 1.1 dbj struct appleufslabel *appleufs;
131 1.1 dbj const char *name;
132 1.1 dbj time_t t;
133 1.1 dbj {
134 1.1 dbj size_t namelen;
135 1.1 dbj if (!name) name = "untitled";
136 1.1 dbj if (t == ((time_t)-1)) {
137 1.1 dbj #if defined(_KERNEL)
138 1.1 dbj t = time.tv_sec;
139 1.1 dbj #elif defined(STANDALONE)
140 1.1 dbj t = 0;
141 1.1 dbj #else
142 1.1 dbj (void)time(&t);
143 1.1 dbj #endif
144 1.1 dbj }
145 1.1 dbj namelen = strlen(name);
146 1.1 dbj if (namelen > APPLEUFS_MAX_LABEL_NAME)
147 1.1 dbj namelen = APPLEUFS_MAX_LABEL_NAME;
148 1.1 dbj memset(appleufs, 0, sizeof(*appleufs));
149 1.2 dbj appleufs->ul_magic = htobe32(APPLEUFS_LABEL_MAGIC);
150 1.2 dbj appleufs->ul_version = htobe32(APPLEUFS_LABEL_VERSION);
151 1.2 dbj appleufs->ul_time = htobe32((u_int32_t)t);
152 1.2 dbj appleufs->ul_namelen = htobe16(namelen);
153 1.1 dbj strncpy(appleufs->ul_name,name,namelen);
154 1.1 dbj appleufs->ul_checksum = ffs_appleufs_cksum(appleufs);
155 1.1 dbj }
156