|
|
1.1 root 1: /*-
2: * Copyright (c) 1991 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
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.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * @(#)stat.c 7.1 (Berkeley) 5/5/91
34: */
35:
36: #include <sys/param.h>
37: #include <sys/stat.h>
38: #include "saio.h"
39:
40: #ifndef SMALL
41: fstat(fd, sb)
42: int fd;
43: struct stat *sb;
44: {
45: register struct iob *io;
46:
47: fd -= 3;
48: if (fd < 0 || fd >= SOPEN_MAX ||
49: ((io = &iob[fd])->i_flgs & F_ALLOC) == 0) {
50: errno = EBADF;
51: return (-1);
52: }
53: /* only important stuff */
54: sb->st_mode = io->i_ino.di_mode;
55: sb->st_uid = io->i_ino.di_uid;
56: sb->st_gid = io->i_ino.di_gid;
57: sb->st_size = io->i_ino.di_size;
58: return (0);
59: }
60:
61: stat(str, sb)
62: const char *str;
63: struct stat *sb;
64: {
65: int fd, rv;
66:
67: fd = open(str, 0);
68: if (fd < 0)
69: return(-1);
70: rv = fstat(fd, sb);
71: close(fd);
72: return(rv);
73: }
74: #endif SMALL
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.