|
|
1.1 root 1: /*
2: * Copyright (c) 1983 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: */
19:
20: #if defined(LIBC_SCCS) && !defined(lint)
21: static char sccsid[] = "@(#)readdir.c 5.7 (Berkeley) 6/1/90";
22: #endif /* LIBC_SCCS and not lint */
23:
24: #include <sys/param.h>
25: #include <dirent.h>
26:
27: /*
28: * get next entry in a directory.
29: */
30: struct dirent *
31: readdir(dirp)
32: register DIR *dirp;
33: {
34: register struct dirent *dp;
35:
36: for (;;) {
37: if (dirp->dd_loc == 0) {
38: dirp->dd_size = getdirentries(dirp->dd_fd,
39: dirp->dd_buf, dirp->dd_len, &dirp->dd_seek);
40: if (dirp->dd_size <= 0)
41: return NULL;
42: }
43: if (dirp->dd_loc >= dirp->dd_size) {
44: dirp->dd_loc = 0;
45: continue;
46: }
47: dp = (struct dirent *)(dirp->dd_buf + dirp->dd_loc);
48: if ((int)dp & 03) /* bogus pointer check */
49: return NULL;
50: if (dp->d_reclen <= 0 ||
51: dp->d_reclen > dirp->dd_len + 1 - dirp->dd_loc)
52: return NULL;
53: dirp->dd_loc += dp->d_reclen;
54: if (dp->d_ino == 0)
55: continue;
56: return (dp);
57: }
58: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.