usr/src/usr.bin/find/find.c

/*-
 * Copyright (c) 1991 The Regents of the University of California.
 * All rights reserved.
 *
 * This code is derived from software contributed to Berkeley by
 * Cimarron D. Taylor of the University of California, Berkeley.
 *
 * 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.
 * 3. All advertising materials mentioning features or use of this software
 *    must display the following acknowledgement:
 *      This product includes software developed by the University of
 *      California, Berkeley and its contributors.
 * 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.
 */

#ifndef lint
static char sccsid[] = "@(#)find.c      5.3 (Berkeley) 5/25/91";
#endif /* not lint */

#include <sys/types.h>
#include <sys/stat.h>
#include <sys/errno.h>
#include <fts.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include "find.h"

/*
 * find_formplan --
 *      process the command line and create a "plan" corresponding to the
 *      command arguments.
 */
PLAN *
find_formplan(argv)
        char **argv;
{
        PLAN *plan, *tail, *new;
        PLAN *c_print(), *find_create(), *not_squish(), *or_squish();
        PLAN *paren_squish();

        /*
         * for each argument in the command line, determine what kind of node
         * it is, create the appropriate node type and add the new plan node
         * to the end of the existing plan.  The resulting plan is a linked
         * list of plan nodes.  For example, the string:
         *
         *      % find . -name foo -newer bar -print
         *
         * results in the plan:
         *
         *      [-name foo]--> [-newer bar]--> [-print]
         *
         * in this diagram, `[-name foo]' represents the plan node generated
         * by c_name() with an argument of foo and `-->' represents the
         * plan->next pointer.
         */
        for (plan = NULL; *argv;) {
                if (!(new = find_create(&argv)))
                        continue;
                if (plan == NULL)
                        tail = plan = new;
                else {
                        tail->next = new;
                        tail = new;
                }
        }

        /*
         * if the user didn't specify one of -print, -ok or -exec, then -print
         * is assumed so we add a -print node on the end.  It is possible that
         * the user might want the -print someplace else on the command line,
         * but there's no way to know that.
         */
        if (!isoutput) {
                new = c_print();
                if (plan == NULL)
                        tail = plan = new;
                else {
                        tail->next = new;
                        tail = new;
                }
        }

        /*
         * the command line has been completely processed into a search plan
         * except for the (, ), !, and -o operators.  Rearrange the plan so
         * that the portions of the plan which are affected by the operators
         * are moved into operator nodes themselves.  For example:
         *
         *      [!]--> [-name foo]--> [-print]
         *
         * becomes
         *
         *      [! [-name foo] ]--> [-print]
         *
         * and
         *
         *      [(]--> [-depth]--> [-name foo]--> [)]--> [-print]
         *
         * becomes
         *
         *      [expr [-depth]-->[-name foo] ]--> [-print]
         *
         * operators are handled in order of precedence.
         */

        plan = paren_squish(plan);              /* ()'s */
        plan = not_squish(plan);                /* !'s */
        plan = or_squish(plan);                 /* -o's */
        return(plan);
}

FTS *tree;                      /* pointer to top of FTS hierarchy */

/*
 * find_execute --
 *      take a search plan and an array of search paths and executes the plan
 *      over all FTSENT's returned for the given search paths.
 */
void
find_execute(plan, paths)
        PLAN *plan;             /* search plan */
        char **paths;           /* array of pathnames to traverse */
{
        register FTSENT *entry;
        PLAN *p;

        if (!(tree = fts_open(paths, ftsoptions, (int (*)())NULL)))
                err("ftsopen: %s", strerror(errno));

        while (entry = fts_read(tree)) {
                switch(entry->fts_info) {
                case FTS_D:
                        if (isdepth)
                                continue;
                        break;
                case FTS_DP:
                        if (!isdepth)
                                continue;
                        break;
                case FTS_DNR:
                case FTS_ERR:
                case FTS_NS:
                        (void)fprintf(stderr, "find: %s: %s\n",
                            entry->fts_path, strerror(errno));
                        continue;
                case FTS_SL:
                        if (entry->fts_level == FTS_ROOTLEVEL) {
                                (void)fts_set(tree, entry, FTS_FOLLOW);
                                continue;
                        }
                        break;
                }

#define BADCH   " \t\n\\'\""
                if (isxargs && strpbrk(entry->fts_path, BADCH)) {
                        (void)fprintf(stderr,
                            "find: illegal path: %s\n", entry->fts_path);
                        continue;
                }

                /*
                 * call all the functions in the execution plan until one is
                 * false or all have been executed.  This is where we do all
                 * the work specified by the user on the command line.
                 */
                for (p = plan; p && (p->eval)(p, entry); p = p->next);
        }
        (void)fts_close(tree);
}