/* * Copyright (c) 1989 The Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms are permitted provided * that: (1) source distributions retain this entire copyright notice and * comment, and (2) distributions including binaries display the following * acknowledgement: ``This product includes software developed by the * University of California, Berkeley and its contributors'' in the * documentation or other materials provided with the distribution and in * all advertising materials mentioning features or use of this software. * Neither the name of the University nor the names of its contributors may * be used to endorse or promote products derived from this software without * specific prior written permission. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR IMPLIED * WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED WARRANTIES OF * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. * * @(#)fts.h 5.8 (Berkeley) 7/1/90 */ typedef struct fts { struct ftsent *fts_cur; /* current node */ struct ftsent *fts_child; /* linked list of children */ struct ftsent *fts_savelink; /* saved link if node had a cycle */ struct ftsent **fts_array; /* sort array */ dev_t sdev; /* starting device # */ char *fts_path; /* path for this descent */ int fts_sd; /* starting directory */ int fts_pathlen; /* sizeof(path) */ int fts_nitems; /* elements in the sort array */ int (*fts_compar)(); /* compare function */ #define FTS__STOP 0x001 /* private: unrecoverable error */ #define FTS_LOGICAL 0x002 /* user: use stat(2) */ #define FTS_NOCHDIR 0x004 /* user: don't use chdir(2) */ #define FTS_NOSTAT 0x008 /* user: don't require stat info */ #define FTS_PHYSICAL 0x010 /* user: use lstat(2) */ #define FTS_SEEDOT 0x020 /* user: return dot and dot-dot */ #define FTS_XDEV 0x040 /* user: don't cross devices */ int fts_options; /* openfts() options */ } FTS; typedef struct ftsent { struct ftsent *fts_parent; /* parent directory */ struct ftsent *fts_link; /* next/cycle node */ union { long number; /* local numeric value */ void *pointer; /* local address value */ } fts_local; char *fts_accpath; /* path from current directory */ char *fts_path; /* path from starting directory */ short fts_pathlen; /* strlen(path) */ short fts_namelen; /* strlen(name) */ short fts_level; /* depth (-1 to N) */ #define FTS_D 1 /* preorder directory */ #define FTS_DC 2 /* directory that causes cycles */ #define FTS_DNR 3 /* unreadable directory */ #define FTS_DNX 4 /* unsearchable directory */ #define FTS_DP 5 /* postorder directory */ #define FTS_ERR 6 /* error; errno is set */ #define FTS_F 7 /* regular file */ #define FTS_NS 8 /* no stat(2) information */ #define FTS_SL 9 /* symbolic link */ #define FTS_SLNONE 10 /* symbolic link without target */ #define FTS_DEFAULT 11 /* none of the above */ u_short fts_info; /* file information */ #define FTS_AGAIN 1 /* user: read node again */ #define FTS_SKIP 2 /* user: discard node */ #define FTS_FOLLOW 3 /* user: follow symbolic link */ short fts_instr; /* setfts() instructions */ struct stat fts_statb; /* stat(2) information */ char fts_name[1]; /* file name */ } FTSENT; #if __STDC__ || c_plusplus extern FTS *ftsopen(const char **, int, int (*)(const FTSENT *, const FTSENT *)); extern FTSENT *ftsread(FTS *); extern FTSENT *ftschildren(FTS *); extern int ftsset(FTS *, FTSENT *, int); extern int ftsclose(FTS *); #else extern FTS *ftsopen(); extern FTSENT *ftschildren(), *ftsread(); extern int ftsclose(), ftsset(); #endif