/*-

 * Copyright (c) 1990, 1993, 1994

 *	The Regents of the University of California.  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.

 * 4. 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 BY THE REGENTS AND CONTRIBUTORS ``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 REGENTS OR CONTRIBUTORS 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.

 *

 * * Portions Copyright (c) 2007 Nokia Corporation and/or its subsidiary(-ies).. All rights reserved.

 * $OpenBSD: fts.c,v 1.22 1999/10/03 19:22:22 millert Exp $

 */

#if 0

#if defined(LIBC_SCCS) && !defined(lint)

static char sccsid[] = "@(#)fts.c	8.6 (Berkeley) 8/14/94";

#endif /* LIBC_SCCS and not lint */

#endif

#include <sys/cdefs.h>

__FBSDID("$FreeBSD: src/lib/libc/gen/fts.c,v 1.27 2004/06/08 06:23:23 das Exp $");

#ifdef __cplusplus

extern "C"	{

#endif

#ifndef __SYMBIAN32__

#include "namespace.h"

#endif

#include <sys/param.h>

#ifndef __SYMBIAN32__

#include <sys/mount.h>

#endif

#include <sys/stat.h>

#include <dirent.h>

#include <errno.h>

#include <fcntl.h>

#include <stdlib.h>

#include <string.h>

#include <unistd.h>

#ifndef __SYMBIAN32__

#include "un-namespace.h"

#endif

#include "fts.h"

#ifdef __SYMBIAN32__

#ifdef __WINSCW__

#pragma warn_unusedarg off

#pragma warn_possunwant off

#endif//__WINSCW__

#endif//__SYMBIAN32__

static FTSENT	*fts_alloc(FTS *, char *, int);

static FTSENT	*fts_build(FTS *, int);

static void	 fts_lfree(FTSENT *);

static void	 fts_load(FTS *, FTSENT *);

static size_t	 fts_maxarglen(char * const *);

static void	 fts_padjust(FTS *, FTSENT *);

static int	 fts_palloc(FTS *, size_t);

static FTSENT	*fts_sort(FTS *, FTSENT *, int);

static u_short	 fts_stat(FTS *, FTSENT *, int);

static int	 fts_safe_changedir(FTS *, FTSENT *, int, char *);

#ifndef __SYMBIAN32__

static int	 fts_ufslinks(FTS *, const FTSENT *);

#endif

#define	ISDOT(a)	(a[0] == '.' && (!a[1] || (a[1] == '.' && !a[2])))

#define	CLR(opt)	(sp->fts_options &= ~(opt))

#define	ISSET(opt)	(sp->fts_options & (opt))

#define	SET(opt)	(sp->fts_options |= (opt))

#define	FCHDIR(sp, fd)	(!ISSET(FTS_NOCHDIR) && fchdir(fd))

/* fts_build flags */

#define	BCHILD		1		/* fts_children */

#define	BNAMES		2		/* fts_children, names only */

#define	BREAD		3		/* fts_read */

#ifndef __SYMBIAN32__

/*

 * Internal representation of an FTS, including extra implementation

 * details.  The FTS returned from fts_open points to this structure's

 * ftsp_fts member (and can be cast to an _fts_private as required)

 */

struct _fts_private {

	FTS		ftsp_fts;

	struct statfs	ftsp_statfs;

	dev_t		ftsp_dev;

	int		ftsp_linksreliable;

};

#endif

/*

 * The "FTS_NOSTAT" option can avoid a lot of calls to stat(2) if it

 * knows that a directory could not possibly have subdirectories.  This

 * is decided by looking at the link count: a subdirectory would

 * increment its parent's link count by virtue of its own ".." entry.

 * This assumption only holds for UFS-like filesystems that implement

 * links and directories this way, so we must punt for others.

 */

static const char *ufslike_filesystems[] = {

	"ufs",

	"nfs",

	"nfs4",

	"ext2fs",

	0

};

FTS *

fts_open(argv, options, compar)

	char * const *argv;

	int options;

	int (*compar)(const FTSENT * const *, const FTSENT * const *);

{

#ifndef __SYMBIAN32__

	struct _fts_private *priv;

#endif	

	FTS *sp;

	FTSENT *p, *root;

	int nitems;

	FTSENT *parent, *tmp;

	int len;

	/* Options check. */

	if (options & ~FTS_OPTIONMASK) {

		errno = EINVAL;

		return (NULL);

	}

#ifndef __SYMBIAN32__

	/* Allocate/initialize the stream. */

	if ((priv = malloc(sizeof(*priv))) == NULL)

		return (NULL);

	memset(priv, 0, sizeof(*priv));

	sp = &priv->ftsp_fts;

#else

	/* Allocate/initialize the stream */

	if ((sp = malloc((u_int)sizeof(FTS))) == NULL)

		return (NULL);

	memset(sp, 0, sizeof(FTS));

#endif	

	sp->fts_compar = compar;

	sp->fts_options = options;

	/* Shush, GCC. */

	tmp = NULL;

	/* Logical walks turn on NOCHDIR; symbolic links are too hard. */

	if (ISSET(FTS_LOGICAL))

		SET(FTS_NOCHDIR);

	/*

	 * Start out with 1K of path space, and enough, in any case,

	 * to hold the user's paths.

	 */

	if (fts_palloc(sp, MAX(fts_maxarglen(argv), MAXPATHLEN)))

		goto mem1;

	/* Allocate/initialize root's parent. */

	if ((parent = fts_alloc(sp, "", 0)) == NULL)

		goto mem2;

	parent->fts_level = FTS_ROOTPARENTLEVEL;

	/* Allocate/initialize root(s). */

	for (root = NULL, nitems = 0; *argv != NULL; ++argv, ++nitems) {

		/* Don't allow zero-length paths. */

		if ((len = strlen(*argv)) == 0) {

			errno = ENOENT;

			goto mem3;

		}

		p = fts_alloc(sp, *argv, len);

		p->fts_level = FTS_ROOTLEVEL;

		p->fts_parent = parent;

		p->fts_accpath = p->fts_name;

		p->fts_info = fts_stat(sp, p, ISSET(FTS_COMFOLLOW));

		/* Command-line "." and ".." are real directories. */

		if (p->fts_info == FTS_DOT)

			p->fts_info = FTS_D;

		/*

		 * If comparison routine supplied, traverse in sorted

		 * order; otherwise traverse in the order specified.

		 */

		if (compar) {

			p->fts_link = root;

			root = p;

		} else {

			p->fts_link = NULL;

			if (root == NULL)

				tmp = root = p;

			else {

				tmp->fts_link = p;

				tmp = p;

			}

		}

	}

	if (compar && nitems > 1)

		root = fts_sort(sp, root, nitems);

	/*

	 * Allocate a dummy pointer and make fts_read think that we've just

	 * finished the node before the root(s); set p->fts_info to FTS_INIT

	 * so that everything about the "current" node is ignored.

	 */

	if ((sp->fts_cur = fts_alloc(sp, "", 0)) == NULL)

		goto mem3;

	sp->fts_cur->fts_link = root;

	sp->fts_cur->fts_info = FTS_INIT;

	/*

	 * If using chdir(2), grab a file descriptor pointing to dot to ensure

	 * that we can get back here; this could be avoided for some paths,

	 * but almost certainly not worth the effort.  Slashes, symbolic links,

	 * and ".." are all fairly nasty problems.  Note, if we can't get the

	 * descriptor we run anyway, just more slowly.

	 */

	if (!ISSET(FTS_NOCHDIR) && (sp->fts_rfd = open(".", O_RDONLY, 0)) < 0)

		SET(FTS_NOCHDIR);

	return (sp);

mem3:	fts_lfree(root);

	free(parent);

mem2:	free(sp->fts_path);

mem1:	free(sp);

	return (NULL);

}

static void

fts_load(sp, p)

	FTS *sp;

	FTSENT *p;

{

	int len;

	char *cp;

	/*

	 * Load the stream structure for the next traversal.  Since we don't

	 * actually enter the directory until after the preorder visit, set

	 * the fts_accpath field specially so the chdir gets done to the right

	 * place and the user can access the first node.  From fts_open it's

	 * known that the path will fit.

	 */

	len = p->fts_pathlen = p->fts_namelen;

	memmove(sp->fts_path, p->fts_name, len + 1);

	if ((cp = strrchr(p->fts_name, '\\')) && (cp != p->fts_name || cp[1])) {

		len = strlen(++cp);

		memmove(p->fts_name, cp, len + 1);

		p->fts_namelen = len;

	}

	p->fts_accpath = p->fts_path = sp->fts_path;

	sp->fts_dev = p->fts_dev;

}

int

fts_close(sp)

	FTS *sp;

{

	FTSENT *freep, *p;

	int saved_errno;

	/*

	 * This still works if we haven't read anything -- the dummy structure

	 * points to the root list, so we step through to the end of the root

	 * list which has a valid parent pointer.

	 */

	if (sp->fts_cur) {

		for (p = sp->fts_cur; p->fts_level >= FTS_ROOTLEVEL;) {

			freep = p;

			p = p->fts_link != NULL ? p->fts_link : p->fts_parent;

			free(freep);

		}

		free(p);

	}

	/* Free up child linked list, sort array, path buffer. */

	if (sp->fts_child)

		fts_lfree(sp->fts_child);

	if (sp->fts_array)

		free(sp->fts_array);

	free(sp->fts_path);

	/* Return to original directory, save errno if necessary. */

	if (!ISSET(FTS_NOCHDIR)) {

		saved_errno = fchdir(sp->fts_rfd) ? errno : 0;

		(void)close(sp->fts_rfd);

		/* Set errno and return. */

		if (saved_errno != 0) {

			/* Free up the stream pointer. */

			free(sp);

			errno = saved_errno;

			return (-1);

		}

	}

	/* Free up the stream pointer. */

	free(sp);

	return (0);

}

/*

 * Special case of "/" at the end of the path so that slashes aren't

 * appended which would cause paths to be written as "....//foo".

 */

#define	NAPPEND(p)							\

	(p->fts_path[p->fts_pathlen - 1] == '\\'				\

	    ? p->fts_pathlen - 1 : p->fts_pathlen)

FTSENT *

fts_read(sp)

	FTS *sp;

{

	FTSENT *p, *tmp;

	int instr;

	char *t;

	int saved_errno;

	/* If finished or unrecoverable error, return NULL. */

	if (sp->fts_cur == NULL || ISSET(FTS_STOP))

		return (NULL);

	/* Set current node pointer. */

	p = sp->fts_cur;

	/* Save and zero out user instructions. */

	instr = p->fts_instr;

	p->fts_instr = FTS_NOINSTR;

	/* Any type of file may be re-visited; re-stat and re-turn. */

	if (instr == FTS_AGAIN) {

		p->fts_info = fts_stat(sp, p, 0);

		return (p);

	}

	/*

	 * Following a symlink -- SLNONE test allows application to see

	 * SLNONE and recover.  If indirecting through a symlink, have

	 * keep a pointer to current location.  If unable to get that

	 * pointer, follow fails.

	 */

	if (instr == FTS_FOLLOW &&

	    (p->fts_info == FTS_SL || p->fts_info == FTS_SLNONE)) {

		p->fts_info = fts_stat(sp, p, 1);

		if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {

			if ((p->fts_symfd = open(".", O_RDONLY, 0)) < 0) {

				p->fts_errno = errno;

				p->fts_info = FTS_ERR;

			} else

				p->fts_flags |= FTS_SYMFOLLOW;

		}

		return (p);

	}

	/* Directory in pre-order. */

	if (p->fts_info == FTS_D) {

		/* If skipped or crossed mount point, do post-order visit. */

		if (instr == FTS_SKIP ||

		    (ISSET(FTS_XDEV) && p->fts_dev != sp->fts_dev)) {

			if (p->fts_flags & FTS_SYMFOLLOW)

				(void)close(p->fts_symfd);

			if (sp->fts_child) {

				fts_lfree(sp->fts_child);

				sp->fts_child = NULL;

			}

			p->fts_info = FTS_DP;

			return (p);

		}

		/* Rebuild if only read the names and now traversing. */

		if (sp->fts_child != NULL && ISSET(FTS_NAMEONLY)) {

			CLR(FTS_NAMEONLY);

			fts_lfree(sp->fts_child);

			sp->fts_child = NULL;

		}

		/*

		 * Cd to the subdirectory.

		 *

		 * If have already read and now fail to chdir, whack the list

		 * to make the names come out right, and set the parent errno

		 * so the application will eventually get an error condition.

		 * Set the FTS_DONTCHDIR flag so that when we logically change

		 * directories back to the parent we don't do a chdir.

		 *

		 * If haven't read do so.  If the read fails, fts_build sets

		 * FTS_STOP or the fts_info field of the node.

		 */

		if (sp->fts_child != NULL) {

			if (fts_safe_changedir(sp, p, -1, p->fts_accpath)) {

				p->fts_errno = errno;

				p->fts_flags |= FTS_DONTCHDIR;

				for (p = sp->fts_child; p != NULL;

				    p = p->fts_link)

					p->fts_accpath =

					    p->fts_parent->fts_accpath;

			}

		} else if ((sp->fts_child = fts_build(sp, BREAD)) == NULL) {

			if (ISSET(FTS_STOP))

				return (NULL);

			return (p);

		}

		p = sp->fts_child;

		sp->fts_child = NULL;

		goto name;

	}

	/* Move to the next node on this level. */

next:	tmp = p;

	if ((p = p->fts_link) != NULL) {

		free(tmp);

		/*

		 * If reached the top, return to the original directory (or

		 * the root of the tree), and load the paths for the next root.

		 */

		if (p->fts_level == FTS_ROOTLEVEL) {

			if (FCHDIR(sp, sp->fts_rfd)) {

				SET(FTS_STOP);

				return (NULL);

			}

			fts_load(sp, p);

			return (sp->fts_cur = p);

		}

		/*

		 * User may have called fts_set on the node.  If skipped,

		 * ignore.  If followed, get a file descriptor so we can

		 * get back if necessary.

		 */

		if (p->fts_instr == FTS_SKIP)

			goto next;

		if (p->fts_instr == FTS_FOLLOW) {

			p->fts_info = fts_stat(sp, p, 1);

			if (p->fts_info == FTS_D && !ISSET(FTS_NOCHDIR)) {

				if ((p->fts_symfd =

				    open(".", O_RDONLY, 0)) < 0) {

					p->fts_errno = errno;

					p->fts_info = FTS_ERR;

				} else

					p->fts_flags |= FTS_SYMFOLLOW;

			}

			p->fts_instr = FTS_NOINSTR;

		}

name:		t = sp->fts_path + NAPPEND(p->fts_parent);

		*t++ = '\\';

		memmove(t, p->fts_name, p->fts_namelen + 1);

		return (sp->fts_cur = p);

	}

	/* Move up to the parent node. */

	p = tmp->fts_parent;

	free(tmp);

	if (p->fts_level == FTS_ROOTPARENTLEVEL) {

		/*

		 * Done; free everything up and set errno to 0 so the user

		 * can distinguish between error and EOF.

		 */

		free(p);

		errno = 0;

		return (sp->fts_cur = NULL);

	}

	/* NUL terminate the pathname. */

	sp->fts_path[p->fts_pathlen] = '\0';

	/*

	 * Return to the parent directory.  If at a root node or came through

	 * a symlink, go back through the file descriptor.  Otherwise, cd up

	 * one directory.

	 */

	if (p->fts_level == FTS_ROOTLEVEL) {

		if (FCHDIR(sp, sp->fts_rfd)) {

			SET(FTS_STOP);

			return (NULL);

		}

	} else if (p->fts_flags & FTS_SYMFOLLOW) {

		if (FCHDIR(sp, p->fts_symfd)) {

			saved_errno = errno;

			(void)close(p->fts_symfd);

			errno = saved_errno;

			SET(FTS_STOP);

			return (NULL);

		}

		(void)close(p->fts_symfd);

	} else if (!(p->fts_flags & FTS_DONTCHDIR) &&

	    fts_safe_changedir(sp, p->fts_parent, -1, "..")) {

		SET(FTS_STOP);

		return (NULL);

	}

	p->fts_info = p->fts_errno ? FTS_ERR : FTS_DP;

	return (sp->fts_cur = p);

}

/*

 * Fts_set takes the stream as an argument although it's not used in this

 * implementation; it would be necessary if anyone wanted to add global

 * semantics to fts using fts_set.  An error return is allowed for similar

 * reasons.

 */

/* ARGSUSED */

#ifndef __SYMBIAN32__

int

fts_set(sp, p, instr)

	FTS *sp;