ustarfs.c revision 1.13 1 1.13 thorpej /* $NetBSD: ustarfs.c,v 1.13 1999/11/11 20:23:17 thorpej Exp $ */
2 1.1 ross
3 1.1 ross /* [Notice revision 2.2]
4 1.1 ross * Copyright (c) 1997, 1998 Avalon Computer Systems, Inc.
5 1.1 ross * All rights reserved.
6 1.1 ross *
7 1.1 ross * Author: Ross Harvey
8 1.1 ross *
9 1.1 ross * Redistribution and use in source and binary forms, with or without
10 1.1 ross * modification, are permitted provided that the following conditions
11 1.1 ross * are met:
12 1.1 ross * 1. Redistributions of source code must retain the above copyright and
13 1.1 ross * author notice, this list of conditions, and the following disclaimer.
14 1.1 ross * 2. Redistributions in binary form must reproduce the above copyright
15 1.1 ross * notice, this list of conditions and the following disclaimer in the
16 1.1 ross * documentation and/or other materials provided with the distribution.
17 1.1 ross * 3. Neither the name of Avalon Computer Systems, Inc. nor the names of
18 1.1 ross * its contributors may be used to endorse or promote products derived
19 1.1 ross * from this software without specific prior written permission.
20 1.1 ross * 4. This copyright will be assigned to The NetBSD Foundation on
21 1.1 ross * 1/1/2000 unless these terms (including possibly the assignment
22 1.1 ross * date) are updated in writing by Avalon prior to the latest specified
23 1.1 ross * assignment date.
24 1.1 ross *
25 1.1 ross * THIS SOFTWARE IS PROVIDED BY AVALON COMPUTER SYSTEMS, INC. AND CONTRIBUTORS
26 1.1 ross * ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED
27 1.1 ross * TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28 1.1 ross * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL AVALON OR THE CONTRIBUTORS
29 1.1 ross * BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR
30 1.1 ross * CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF
31 1.1 ross * SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS
32 1.1 ross * INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN
33 1.1 ross * CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
34 1.1 ross * ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
35 1.1 ross * POSSIBILITY OF SUCH DAMAGE.
36 1.1 ross */
37 1.1 ross
38 1.1 ross
39 1.1 ross /*
40 1.1 ross ******************************* USTAR FS *******************************
41 1.1 ross */
42 1.1 ross
43 1.1 ross /*
44 1.1 ross * Implement an ROFS with an 8K boot area followed by ustar-format data.
45 1.1 ross * The point: minimal FS overhead, and it's easy (well, `possible') to
46 1.1 ross * split files over multiple volumes.
47 1.1 ross *
48 1.1 ross * XXX - TODO LIST
49 1.1 ross * --- - ---- ----
50 1.1 ross * XXX - tag volume numbers and verify that the correct volume is
51 1.1 ross * inserted after volume swaps.
52 1.1 ross *
53 1.1 ross * XXX - stop hardwiring FS metadata for floppies...embed it in a file,
54 1.1 ross * file name, or something. (Remember __SYMDEF? :-)
55 1.1 ross *
56 1.8 cgd * XXX Does not currently implement:
57 1.8 cgd * XXX
58 1.8 cgd * XXX LIBSA_NO_FS_CLOSE
59 1.8 cgd * XXX LIBSA_NO_FS_SEEK
60 1.8 cgd * XXX LIBSA_NO_FS_WRITE
61 1.8 cgd * XXX LIBSA_NO_FS_SYMLINK (does this even make sense?)
62 1.8 cgd * XXX LIBSA_FS_SINGLECOMPONENT
63 1.1 ross */
64 1.1 ross
65 1.1 ross #include "stand.h"
66 1.1 ross #include "ustarfs.h"
67 1.1 ross
68 1.2 ross #define BBSIZE 8192
69 1.1 ross #define USTAR_NAME_BLOCK 512
70 1.1 ross
71 1.2 ross /*
72 1.2 ross * Virtual offset: relative to start of ustar archive
73 1.2 ross * Logical offset: volume-relative
74 1.2 ross * Physical offset: the usual meaning
75 1.2 ross */
76 1.2 ross
77 1.2 ross /* virtual offset to volume number */
78 1.2 ross
79 1.2 ross #define vda2vn(_v,_volsize) ((_v) / (_volsize))
80 1.2 ross
81 1.2 ross /* conversions between the three different levels of disk addresses */
82 1.2 ross
83 1.2 ross #define vda2lda(_v,_volsize) ((_v) % (_volsize))
84 1.2 ross #define lda2vda(_v,_volsize,_volnumber) ((_v) + (_volsize) * (_volnumber))
85 1.2 ross
86 1.2 ross #define lda2pda(_lda) ((_lda) + ustarfs_mode_offset)
87 1.2 ross #define pda2lda(_pda) ((_pda) - ustarfs_mode_offset)
88 1.2 ross /*
89 1.2 ross * Change this to off_t if you want to support big volumes. If we only use
90 1.2 ross * ustarfs on floppies it can stay int for libsa code density.
91 1.2 ross *
92 1.2 ross * It needs to be signed.
93 1.2 ross */
94 1.2 ross typedef int ustoffs;
95 1.2 ross
96 1.1 ross typedef struct ustar_struct {
97 1.1 ross char ust_name[100],
98 1.1 ross ust_mode[8],
99 1.1 ross ust_uid[8],
100 1.1 ross ust_gid[8],
101 1.1 ross ust_size[12],
102 1.1 ross ust_misc[12 + 8 + 1 + 100],
103 1.1 ross ust_magic[6];
104 1.1 ross /* there is more, but we don't care */
105 1.1 ross } ustar_t;
106 1.1 ross
107 1.1 ross /*
108 1.1 ross * We buffer one even cylindar of data...it's actually only really one
109 1.1 ross * cyl on a 1.44M floppy, but on other devices it's fast enough with any
110 1.1 ross * kind of block buffering, so we optimize for the slowest device.
111 1.1 ross */
112 1.1 ross
113 1.1 ross typedef struct ust_active_struct {
114 1.1 ross ustar_t uas_active;
115 1.1 ross char uas_1cyl[18 * 2 * 512];
116 1.2 ross ustoffs uas_volsize; /* XXX this is hardwired now */
117 1.2 ross ustoffs uas_windowbase; /* relative to volume 0 */
118 1.2 ross ustoffs uas_filestart; /* relative to volume 0 */
119 1.2 ross ustoffs uas_fseek; /* relative to file */
120 1.2 ross ustoffs uas_filesize; /* relative to volume 0 */
121 1.1 ross int uas_init_window; /* data present in window */
122 1.1 ross int uas_init_fs; /* ust FS actually found */
123 1.2 ross int uas_volzerosig; /* ID volume 0 by signature */
124 1.11 ross int uas_sigdone; /* did sig already */
125 1.2 ross int uas_offset; /* amount of cylinder below lba 0 */
126 1.1 ross } ust_active_t;
127 1.1 ross
128 1.3 ross static const char formatid[] = "USTARFS",
129 1.3 ross metaname[] = "USTAR.volsize.";
130 1.1 ross
131 1.1 ross static int ustarfs_mode_offset = BBSIZE;
132 1.1 ross
133 1.2 ross static int checksig __P((ust_active_t *));
134 1.3 ross static int convert __P((const char *, int, int));
135 1.2 ross static int get_volume __P((struct open_file *, int));
136 1.3 ross static void setwindow(ust_active_t *, ustoffs, ustoffs);
137 1.11 ross static int real_fs_cylinder_read __P((struct open_file *, ustoffs, int));
138 1.3 ross static int ustarfs_cylinder_read __P((struct open_file *, ustoffs, int));
139 1.1 ross static void ustarfs_sscanf __P((const char *, const char *, int *));
140 1.2 ross static int read512block __P((struct open_file *, ustoffs, char block[512]));
141 1.11 ross static int init_volzero_sig __P((struct open_file *));
142 1.1 ross
143 1.1 ross static int
144 1.1 ross convert(f, base, fw)
145 1.1 ross const char *f;
146 1.1 ross int base, fw;
147 1.1 ross {
148 1.1 ross int i, c, result = 0;
149 1.1 ross
150 1.1 ross while(fw > 0 && *f == ' ') {
151 1.1 ross --fw;
152 1.1 ross ++f;
153 1.1 ross }
154 1.1 ross for(i = 0; i < fw; ++i) {
155 1.1 ross c = f[i];
156 1.1 ross if ('0' <= c && c < '0' + base) {
157 1.1 ross c -= '0';
158 1.1 ross result = result * base + c;
159 1.1 ross } else break;
160 1.1 ross }
161 1.1 ross return result;
162 1.1 ross }
163 1.1 ross
164 1.1 ross static void
165 1.1 ross ustarfs_sscanf(s,f,xi)
166 1.1 ross const char *s,*f;
167 1.1 ross int *xi;
168 1.1 ross {
169 1.1 ross *xi = convert(s, 8, convert(f + 1, 10, 99));
170 1.1 ross }
171 1.1 ross
172 1.1 ross static int
173 1.3 ross ustarfs_cylinder_read(f, seek2, forcelabel)
174 1.1 ross struct open_file *f;
175 1.2 ross ustoffs seek2;
176 1.1 ross {
177 1.11 ross int i, e;
178 1.11 ross
179 1.11 ross for (i = 0; i < 3; ++i) {
180 1.11 ross e = real_fs_cylinder_read(f, seek2, forcelabel);
181 1.11 ross if (e == 0)
182 1.11 ross return 0;
183 1.11 ross }
184 1.11 ross return e;
185 1.11 ross }
186 1.11 ross
187 1.11 ross static int
188 1.11 ross real_fs_cylinder_read(f, seek2, forcelabel)
189 1.11 ross struct open_file *f;
190 1.11 ross ustoffs seek2;
191 1.11 ross {
192 1.10 ross int i;
193 1.4 bad int e = 0; /* XXX work around gcc warning */
194 1.3 ross ustoffs lda;
195 1.3 ross char *xferbase;
196 1.1 ross ust_active_t *ustf;
197 1.3 ross size_t xferrqst, xfercount;
198 1.1 ross
199 1.1 ross ustf = f->f_fsdata;
200 1.3 ross xferrqst = sizeof ustf->uas_1cyl;
201 1.3 ross xferbase = ustf->uas_1cyl;
202 1.3 ross lda = pda2lda(seek2);
203 1.3 ross if (lda < 0) {
204 1.3 ross lda = -lda;
205 1.3 ross ustf->uas_offset = lda;
206 1.3 ross /*
207 1.3 ross * don't read the label unless we have to. (Preserve
208 1.3 ross * sequential block access so tape boot works.)
209 1.3 ross */
210 1.3 ross if (!forcelabel) {
211 1.3 ross memset(xferbase, 0, lda);
212 1.3 ross xferrqst -= lda;
213 1.3 ross xferbase += lda;
214 1.3 ross seek2 += lda;
215 1.3 ross }
216 1.3 ross } else
217 1.3 ross ustf->uas_offset = 0;
218 1.3 ross while(xferrqst > 0) {
219 1.9 christos #if !defined(LIBSA_NO_TWIDDLE)
220 1.9 christos twiddle();
221 1.9 christos #endif
222 1.10 ross for (i = 0; i < 3; ++i) {
223 1.10 ross e = DEV_STRATEGY(f->f_dev)(f->f_devdata, F_READ,
224 1.10 ross seek2 / 512, xferrqst, xferbase, &xfercount);
225 1.10 ross if (e == 0)
226 1.10 ross break;
227 1.10 ross printf("@");
228 1.10 ross }
229 1.3 ross if (e)
230 1.3 ross break;
231 1.3 ross if (xfercount != xferrqst)
232 1.3 ross printf("Warning, unexpected short transfer %d/%d\n",
233 1.3 ross (int)xfercount, (int)xferrqst);
234 1.3 ross xferrqst -= xfercount;
235 1.3 ross xferbase += xfercount;
236 1.10 ross seek2 += xfercount;
237 1.2 ross }
238 1.1 ross return e;
239 1.1 ross }
240 1.1 ross
241 1.1 ross static int
242 1.2 ross checksig(ustf)
243 1.2 ross ust_active_t *ustf;
244 1.2 ross {
245 1.2 ross int i, rcs;
246 1.2 ross
247 1.2 ross for(i = rcs = 0; i < sizeof ustf->uas_1cyl; ++i)
248 1.2 ross rcs += ustf->uas_1cyl[i];
249 1.2 ross return rcs;
250 1.2 ross }
251 1.2 ross
252 1.2 ross static int
253 1.3 ross get_volume(f, vn)
254 1.1 ross struct open_file *f;
255 1.2 ross int vn;
256 1.2 ross {
257 1.2 ross int e, needvolume, havevolume;
258 1.2 ross ust_active_t *ustf;
259 1.2 ross
260 1.2 ross ustf = f->f_fsdata;
261 1.2 ross havevolume = vda2vn(ustf->uas_windowbase, ustf->uas_volsize);
262 1.2 ross needvolume = vn;
263 1.2 ross while(havevolume != needvolume) {
264 1.2 ross printf("\nPlease ");
265 1.2 ross if (havevolume >= 0)
266 1.2 ross printf("remove disk %d, ", havevolume + 1);
267 1.2 ross printf("insert disk %d, and type return...",
268 1.2 ross needvolume + 1);
269 1.2 ross getchar();
270 1.2 ross printf("\n");
271 1.11 ross e = ustarfs_cylinder_read(f, 0, needvolume != 0);
272 1.2 ross if (e)
273 1.2 ross return e;
274 1.2 ross if(strncmp(formatid, ustf->uas_1cyl, strlen(formatid))) {
275 1.2 ross /* no magic, might be OK if we want volume 0 */
276 1.2 ross if (ustf->uas_volzerosig == checksig(ustf)) {
277 1.2 ross havevolume = 0;
278 1.2 ross continue;
279 1.2 ross }
280 1.2 ross printf("Disk is not from the volume set?!\n");
281 1.2 ross havevolume = -2;
282 1.2 ross continue;
283 1.2 ross }
284 1.2 ross ustarfs_sscanf(ustf->uas_1cyl + strlen(formatid), "%9o",
285 1.2 ross &havevolume);
286 1.2 ross --havevolume;
287 1.2 ross }
288 1.2 ross return 0;
289 1.2 ross }
290 1.2 ross
291 1.3 ross static void
292 1.3 ross setwindow(ust_active_t *ustf, ustoffs pda, ustoffs vda)
293 1.3 ross {
294 1.3 ross ustf->uas_windowbase = lda2vda(pda2lda(pda), ustf->uas_volsize,
295 1.3 ross vda2vn(vda, ustf->uas_volsize))
296 1.3 ross + ustf->uas_offset;
297 1.3 ross ustf->uas_init_window = 1;
298 1.3 ross }
299 1.3 ross
300 1.2 ross static int
301 1.2 ross read512block(f, vda, block)
302 1.2 ross struct open_file *f;
303 1.2 ross ustoffs vda;
304 1.1 ross char block[512];
305 1.1 ross {
306 1.3 ross ustoffs pda;
307 1.1 ross ssize_t e;
308 1.2 ross int dienow;
309 1.1 ross ust_active_t *ustf;
310 1.1 ross
311 1.2 ross dienow = 0;
312 1.1 ross ustf = f->f_fsdata;
313 1.2 ross
314 1.2 ross /*
315 1.2 ross * if (vda in window)
316 1.2 ross * copy out and return data
317 1.2 ross * if (vda is on some other disk)
318 1.2 ross * do disk swap
319 1.2 ross * get physical disk address
320 1.2 ross * round down to cylinder boundary
321 1.2 ross * read cylindar
322 1.2 ross * set window (in vda space) and try again
323 1.2 ross * [ there is an implicit assumption that windowbase always identifies
324 1.2 ross * the current volume, even if initwindow == 0. This way, a
325 1.2 ross * windowbase of 0 causes the initial volume to be disk 0 ]
326 1.2 ross */
327 1.1 ross tryagain:
328 1.1 ross if(ustf->uas_init_window
329 1.2 ross && ustf->uas_windowbase <= vda && vda <
330 1.2 ross ustf->uas_windowbase + sizeof ustf->uas_1cyl - ustf->uas_offset) {
331 1.2 ross memcpy(block, ustf->uas_1cyl
332 1.2 ross + (vda - ustf->uas_windowbase)
333 1.2 ross + ustf->uas_offset, 512);
334 1.1 ross return 0;
335 1.1 ross }
336 1.1 ross if (dienow++)
337 1.1 ross panic("ustarfs read512block");
338 1.2 ross ustf->uas_init_window = 0;
339 1.2 ross e = get_volume(f, vda2vn(vda, ustf->uas_volsize));
340 1.2 ross if (e)
341 1.2 ross return e;
342 1.2 ross pda = lda2pda(vda2lda(vda, ustf->uas_volsize));
343 1.2 ross pda-= pda % sizeof ustf->uas_1cyl;
344 1.3 ross e = ustarfs_cylinder_read(f, pda, 0);
345 1.1 ross if (e)
346 1.1 ross return e;
347 1.3 ross setwindow(ustf, pda, vda);
348 1.1 ross goto tryagain;
349 1.1 ross }
350 1.1 ross
351 1.11 ross static int
352 1.11 ross init_volzero_sig(f)
353 1.11 ross struct open_file *f;
354 1.11 ross {
355 1.11 ross int e;
356 1.11 ross ust_active_t *ustf;
357 1.11 ross
358 1.11 ross ustf = f->f_fsdata;
359 1.11 ross if (!ustf->uas_sigdone) {
360 1.11 ross e = ustarfs_cylinder_read(f, 0, 0);
361 1.11 ross if (e)
362 1.11 ross return e;
363 1.11 ross ustf->uas_volzerosig = checksig(ustf);
364 1.11 ross setwindow(ustf, 0, 0);
365 1.11 ross }
366 1.11 ross return 0;
367 1.11 ross }
368 1.11 ross
369 1.1 ross int
370 1.1 ross ustarfs_open(path, f)
371 1.1 ross char *path;
372 1.1 ross struct open_file *f;
373 1.1 ross
374 1.1 ross {
375 1.1 ross ust_active_t *ustf;
376 1.2 ross ustoffs offset;
377 1.1 ross char block[512];
378 1.1 ross int filesize;
379 1.1 ross int e, e2;
380 1.3 ross int newvolblocks;
381 1.1 ross
382 1.1 ross if (*path == '/')
383 1.1 ross ++path;
384 1.1 ross f->f_fsdata = ustf = alloc(sizeof *ustf);
385 1.1 ross memset(ustf, 0, sizeof *ustf);
386 1.2 ross offset = 0;
387 1.3 ross /* default to 2880 sector floppy */
388 1.3 ross ustf->uas_volsize = 80 * 2 * 18 * 512 - lda2pda(0);
389 1.1 ross ustf->uas_fseek = 0;
390 1.11 ross e = init_volzero_sig(f);
391 1.11 ross if (e)
392 1.11 ross return e;
393 1.12 ross e2 = EINVAL;
394 1.1 ross for(;;) {
395 1.1 ross ustf->uas_filestart = offset;
396 1.12 ross e = read512block(f, offset, block);
397 1.12 ross if (e)
398 1.12 ross break;
399 1.12 ross memcpy(&ustf->uas_active, block, sizeof ustf->uas_active);
400 1.12 ross if(strncmp(ustf->uas_active.ust_magic, "ustar", 5)) {
401 1.1 ross e = e2;
402 1.1 ross break;
403 1.1 ross }
404 1.12 ross e2 = ENOENT; /* it must be an actual ustarfs */
405 1.1 ross ustf->uas_init_fs = 1;
406 1.3 ross /* if volume metadata is found, use it */
407 1.3 ross if(strncmp(ustf->uas_active.ust_name, metaname,
408 1.3 ross strlen(metaname)) == 0) {
409 1.3 ross ustarfs_sscanf(ustf->uas_active.ust_name
410 1.3 ross + strlen(metaname), "%99o", &newvolblocks);
411 1.3 ross ustf->uas_volsize = newvolblocks * 512
412 1.3 ross - lda2pda(0);
413 1.3 ross }
414 1.1 ross ustarfs_sscanf(ustf->uas_active.ust_size,"%12o",&filesize);
415 1.1 ross if(strncmp(ustf->uas_active.ust_name, path,
416 1.1 ross sizeof ustf->uas_active.ust_name) == 0) {
417 1.1 ross ustf->uas_filesize = filesize;
418 1.1 ross break;
419 1.1 ross }
420 1.1 ross offset += USTAR_NAME_BLOCK + filesize;
421 1.1 ross filesize %= 512;
422 1.1 ross if (filesize)
423 1.1 ross offset += 512 - filesize;
424 1.1 ross }
425 1.1 ross if (e) {
426 1.1 ross free(ustf, sizeof *ustf);
427 1.1 ross f->f_fsdata = 0;
428 1.1 ross }
429 1.1 ross return e;
430 1.1 ross }
431 1.1 ross
432 1.8 cgd #ifndef LIBSA_NO_FS_WRITE
433 1.1 ross int
434 1.1 ross ustarfs_write(f, start, size, resid)
435 1.1 ross struct open_file *f;
436 1.1 ross void *start;
437 1.1 ross size_t size;
438 1.1 ross size_t *resid;
439 1.1 ross {
440 1.1 ross return (EROFS);
441 1.1 ross }
442 1.8 cgd #endif /* !LIBSA_NO_FS_WRITE */
443 1.1 ross
444 1.8 cgd #ifndef LIBSA_NO_FS_SEEK
445 1.1 ross off_t
446 1.1 ross ustarfs_seek(f, offs, whence)
447 1.1 ross struct open_file *f;
448 1.1 ross off_t offs;
449 1.1 ross int whence;
450 1.1 ross {
451 1.1 ross ust_active_t *ustf;
452 1.1 ross
453 1.1 ross ustf = f->f_fsdata;
454 1.1 ross switch (whence) {
455 1.1 ross case SEEK_SET:
456 1.1 ross ustf->uas_fseek = offs;
457 1.1 ross break;
458 1.1 ross case SEEK_CUR:
459 1.1 ross ustf->uas_fseek += offs;
460 1.1 ross break;
461 1.1 ross case SEEK_END:
462 1.1 ross ustf->uas_fseek = ustf->uas_filesize - offs;
463 1.1 ross break;
464 1.1 ross default:
465 1.1 ross return -1;
466 1.1 ross }
467 1.1 ross return ustf->uas_fseek;
468 1.1 ross }
469 1.8 cgd #endif /* !LIBSA_NO_FS_CLOSE */
470 1.1 ross
471 1.1 ross int
472 1.1 ross ustarfs_read(f, start, size, resid)
473 1.1 ross struct open_file *f;
474 1.1 ross void *start;
475 1.1 ross size_t size;
476 1.1 ross size_t *resid;
477 1.1 ross {
478 1.1 ross ust_active_t *ustf;
479 1.1 ross int e;
480 1.1 ross char *space512;
481 1.1 ross int blkoffs,
482 1.1 ross readoffs,
483 1.1 ross bufferoffset;
484 1.1 ross size_t seg;
485 1.1 ross int infile,
486 1.1 ross inbuffer;
487 1.1 ross
488 1.1 ross e = 0;
489 1.1 ross space512 = alloc(512);
490 1.1 ross ustf = f->f_fsdata;
491 1.1 ross while(size != 0) {
492 1.1 ross if (ustf->uas_fseek >= ustf->uas_filesize)
493 1.1 ross break;
494 1.1 ross bufferoffset = ustf->uas_fseek % 512;
495 1.1 ross blkoffs = ustf->uas_fseek - bufferoffset;
496 1.1 ross readoffs = ustf->uas_filestart + 512 + blkoffs;
497 1.1 ross e = read512block(f, readoffs, space512);
498 1.1 ross if (e)
499 1.1 ross break;
500 1.1 ross seg = size;
501 1.1 ross inbuffer = 512 - bufferoffset;
502 1.1 ross if (inbuffer < seg)
503 1.1 ross seg = inbuffer;
504 1.1 ross infile = ustf->uas_filesize - ustf->uas_fseek;
505 1.1 ross if (infile < seg)
506 1.1 ross seg = infile;
507 1.1 ross memcpy(start, space512 + bufferoffset, seg);
508 1.1 ross ustf->uas_fseek += seg;
509 1.7 dbj start = (caddr_t)start + seg;
510 1.1 ross size -= seg;
511 1.1 ross }
512 1.1 ross if (resid)
513 1.1 ross *resid = size;
514 1.1 ross free(space512, 512);
515 1.1 ross return e;
516 1.1 ross }
517 1.1 ross
518 1.1 ross int
519 1.1 ross ustarfs_stat(f, sb)
520 1.1 ross struct open_file *f;
521 1.1 ross struct stat *sb;
522 1.1 ross {
523 1.1 ross int mode, uid, gid;
524 1.1 ross ust_active_t *ustf;
525 1.1 ross
526 1.1 ross if (f == NULL)
527 1.1 ross return EINVAL;
528 1.1 ross ustf = f->f_fsdata;
529 1.1 ross memset(sb, 0, sizeof *sb);
530 1.1 ross ustarfs_sscanf(ustf->uas_active.ust_mode, "%8o", &mode);
531 1.1 ross ustarfs_sscanf(ustf->uas_active.ust_uid, "%8o", &uid);
532 1.1 ross ustarfs_sscanf(ustf->uas_active.ust_gid, "%8o", &gid);
533 1.1 ross sb->st_mode = mode;
534 1.1 ross sb->st_uid = uid;
535 1.1 ross sb->st_gid = gid;
536 1.1 ross sb->st_size = ustf->uas_filesize;
537 1.1 ross return 0;
538 1.1 ross }
539 1.1 ross
540 1.8 cgd #ifndef LIBSA_NO_FS_CLOSE
541 1.1 ross int
542 1.1 ross ustarfs_close(f)
543 1.1 ross struct open_file *f;
544 1.1 ross {
545 1.1 ross if (f == NULL || f->f_fsdata == NULL)
546 1.1 ross return EINVAL;
547 1.1 ross free(f->f_fsdata, sizeof(ust_active_t));
548 1.1 ross f->f_fsdata = 0;
549 1.1 ross return 0;
550 1.1 ross }
551 1.8 cgd #endif /* !LIBSA_NO_FS_CLOSE */
552