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