1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
|
/* $OpenBSD: lif.c,v 1.4 1999/05/03 22:46:38 mickey Exp $ */
/*
* Copyright (c) 1998 Michael Shalayeff
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* 3. All advertising materials mentioning features or use of this software
* must display the following acknowledgement:
* This product includes software developed by Michael Shalayeff.
* 4. The name of the author may not be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include <sys/param.h>
#include <sys/disklabel.h>
#include "libsa.h"
extern int debug;
struct file {
char f_buf[LIF_FILESTART];/* buffer for lif volume header and dir */
struct lifvol *f_lp; /* lif volume header pointer */
struct lifdir *f_ld; /* lif dir pointer */
int f_nfiles; /* gross number for lif dir entries */
off_t f_seek; /* seek pointer for file read */
struct lifdir *f_rd; /* lif dir pointer for readdir */
int f_isdir; /* special hacky flag for '.' dir */
int f_count; /* this file length */
int f_off; /* this file offset */
};
int
lif_open (path, f)
char *path;
struct open_file *f;
{
register struct file *fp;
register struct lifdir *dp;
register char *p = NULL, *q = NULL; /* XXX shut up gcc */
struct lif_load load;
int err, buf_size, l;
#ifdef LIFDEBUG
if (debug)
printf("lif_open(%s, %p)\n", path, f);
#endif
fp = alloc(sizeof(*fp));
if ((err = (f->f_dev->dv_strategy)(f->f_devdata, F_READ, 0,
sizeof(fp->f_buf), &fp->f_buf, &buf_size)) ||
buf_size != sizeof(fp->f_buf)) {
#ifdef LIFDEBUG
if (debug)
printf("lif_open: unable to read LIF header (%d)\n", err);
#endif
} else if ((fp->f_lp = (struct lifvol *)fp->f_buf)->vol_id == LIF_VOL_ID) {
f->f_fsdata = fp;
fp->f_ld = (struct lifdir *)(fp->f_buf + LIF_DIRSTART);
fp->f_seek = 0;
fp->f_rd = fp->f_ld;
fp->f_nfiles = lifstob(fp->f_lp->vol_dirsize) /
sizeof(struct lifdir);
/* no dirs on the lif */
for (p = path + (l = strlen(path)); p >= path; p--)
if (*p == '/') {
p++;
break;
}
if (p > path)
path = p;
} else
err = EINVAL;
if (!err && *path != '.') {
fp->f_isdir = 0;
err = ENOENT;
for (dp = fp->f_ld; dp < &fp->f_ld[fp->f_nfiles]; dp++) {
if (debug)
#ifdef LIFDEBUG
printf("lif_open: "
"%s <--> '%c%c%c%c%c%c%c%c%c%c'\n",
path, dp->dir_name[0], dp->dir_name[1],
dp->dir_name[2], dp->dir_name[3],
dp->dir_name[4], dp->dir_name[5],
dp->dir_name[6], dp->dir_name[7],
dp->dir_name[8], dp->dir_name[9]);
#endif
for (p = path, q = dp->dir_name;
*q && *q != ' '; q++, p++)
if (tolower(*q) != tolower(*p))
break;
if ((!*q || *q == ' ') && !*p) {
err = 0;
break;
}
}
if (!err) {
fp->f_off = lifstodb(dp->dir_addr);
if (!(err =(f->f_dev->dv_strategy)(f->f_devdata, F_READ,
fp->f_off, sizeof(load), &load, &buf_size)) &&
buf_size == sizeof(load)) {
/* no checksum */
fp->f_count = load.count - sizeof(int);
fp->f_off = dbtob(fp->f_off) + sizeof(load);
#ifdef LIFDEBUG
if (debug)
printf("lif_open: %u @ %u [%x]\n",
fp->f_count, fp->f_off,
load.address);
#endif
} else if (!err)
err = EIO;
}
} else
fp->f_isdir = 1;
if (err) {
free (fp, sizeof(*fp));
f->f_fsdata = NULL;
}
return err;
}
int
lif_close(f)
struct open_file *f;
{
free (f->f_fsdata, sizeof(struct file));
f->f_fsdata = NULL;
return 0;
}
int
lif_read(f, buf, size, resid)
struct open_file *f;
void *buf;
size_t size;
size_t *resid;
{
register struct file *fp = (struct file *)f->f_fsdata;
register char *p;
char bbuf[DEV_BSIZE];
size_t bsize, count = sizeof(bbuf);
int err = 0;
int foff;
#ifdef LIFDEBUG
if (debug)
printf("lif_read(%p, %p, %u, %p)\n", f, buf, size, resid);
#endif
for (p = bbuf; size; fp->f_seek += bsize, p += bsize) {
twiddle();
foff = fp->f_off + fp->f_seek;
if (fp->f_seek >= fp->f_count ||
(err = (f->f_dev->dv_strategy)(f->f_devdata, F_READ,
btodb(foff), count, p, &bsize)))
break;
if (p == bbuf) {
bsize = sizeof(bbuf) - (foff & (sizeof(bbuf) - 1));
bsize = min(bsize, size);
bcopy(bbuf + (foff & (sizeof(bbuf) - 1)), buf, bsize);
p = buf;
}
count = size -= bsize;
}
if (resid)
*resid = size;
return err;
}
int
lif_write(f, buf, size, resid)
struct open_file *f;
void *buf;
size_t size;
size_t *resid;
{
return EOPNOTSUPP;
}
off_t
lif_seek(f, offset, where)
struct open_file *f;
off_t offset;
int where;
{
register struct file *fp = (struct file *)f->f_fsdata;
switch (where) {
case SEEK_SET:
fp->f_seek = offset;
break;
case SEEK_CUR:
fp->f_seek += offset;
break;
case SEEK_END:
fp->f_seek = fp->f_count - offset;
break;
default:
return (-1);
}
return (fp->f_seek);
}
int
lif_stat(f, sb)
struct open_file *f;
struct stat *sb;
{
register struct file *fp = (struct file *)f->f_fsdata;
sb->st_mode = 0755 | (fp->f_isdir? S_IFDIR: 0); /* XXX */
sb->st_uid = 0;
sb->st_gid = 0;
sb->st_size = fp->f_count;
return 0;
}
int
lif_readdir(f, name)
struct open_file *f;
char *name;
{
register struct file *fp = (struct file *)f->f_fsdata;
register char *p;
if (name) {
while ((fp->f_rd->dir_name[0] == ' ' ||
!fp->f_rd->dir_name[0]) &&
(fp->f_rd - fp->f_ld) < fp->f_nfiles)
fp->f_rd++;
if ((fp->f_rd - fp->f_ld) >= fp->f_nfiles) {
*name = '\0';
return -1;
}
strncpy(name, fp->f_rd->dir_name, sizeof(fp->f_rd->dir_name));
if ((p = strchr(name, ' ')))
*p = '\0';
fp->f_rd++;
} else
fp->f_rd = fp->f_ld;
return 0;
}
|
