xref: /src/usr.bin/find/extern.h

/*	$NetBSD: extern.h,v 1.25 2006/10/07 17:04:02 apb Exp $	*/

/*-
 * Copyright (c) 1991, 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.
 * 3. 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.
 *
 *	from: @(#)extern.h	8.3 (Berkeley) 4/16/94
 */

#include <sys/cdefs.h>

void	 brace_subst __P((char *, char **, char *, int *));
PLAN	*find_create __P((char ***));
int	 find_execute __P((PLAN *, char **));
PLAN	*find_formplan __P((char **));
int	 find_traverse __P((PLAN *, int (*)(PLAN *, void *), void *));
int	 f_expr __P((PLAN *, FTSENT *));
PLAN	*not_squish __P((PLAN *));
PLAN	*or_squish __P((PLAN *));
PLAN	*paren_squish __P((PLAN *));
int	 plan_cleanup(PLAN *, void *);
void	 printlong __P((char *, char *, struct stat *));
int	 queryuser __P((char **));
void	 show_path __P((int));

PLAN	*c_amin __P((char ***, int));
PLAN	*c_anewer __P((char ***, int));
PLAN	*c_atime __P((char ***, int));
PLAN	*c_cmin __P((char ***, int));
PLAN	*c_cnewer __P((char ***, int));
PLAN	*c_ctime __P((char ***, int));
PLAN	*c_depth __P((char ***, int));
PLAN	*c_empty __P((char ***, int));
PLAN	*c_exec __P((char ***, int));
PLAN	*c_execdir __P((char ***, int));
PLAN	*c_exit __P((char ***, int));
PLAN	*c_false __P((char ***, int));
PLAN	*c_flags __P((char ***, int));
PLAN	*c_follow __P((char ***, int));
PLAN	*c_fprint __P((char ***, int));
PLAN	*c_fstype __P((char ***, int));
PLAN	*c_group __P((char ***, int));
PLAN	*c_iname __P((char ***, int));
PLAN	*c_inum __P((char ***, int));
PLAN	*c_iregex __P((char ***, int));
PLAN	*c_links __P((char ***, int));
PLAN	*c_ls __P((char ***, int));
PLAN	*c_maxdepth __P((char ***, int));
PLAN	*c_mindepth __P((char ***, int));
PLAN	*c_mmin __P((char ***, int));
PLAN	*c_mtime __P((char ***, int));
PLAN	*c_name __P((char ***, int));
PLAN	*c_newer __P((char ***, int));
PLAN	*c_nogroup __P((char ***, int));
PLAN	*c_nouser __P((char ***, int));
PLAN	*c_path __P((char ***, int));
PLAN	*c_perm __P((char ***, int));
PLAN	*c_print __P((char ***, int));
PLAN	*c_print0 __P((char ***, int));
PLAN	*c_printx __P((char ***, int));
PLAN	*c_prune __P((char ***, int));
PLAN	*c_regex __P((char ***, int));
PLAN	*c_size __P((char ***, int));
PLAN	*c_type __P((char ***, int));
PLAN	*c_user __P((char ***, int));
PLAN	*c_xdev __P((char ***, int));
PLAN	*c_openparen __P((char ***, int));
PLAN	*c_closeparen __P((char ***, int));
PLAN	*c_not __P((char ***, int));
PLAN	*c_or __P((char ***, int));
PLAN	*c_null __P((char ***, int));

extern int ftsoptions, isdeprecated, isdepth, isoutput, issort, isxargs;