/*- * Copyright (c) 1980, 1993 * 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. 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[] = "@(#)treen.c 8.1 (Berkeley) 6/6/93"; #endif /* not lint */ /* * is there some reason why these aren't #defined? */ #include "0.h" #include "tree_ty.h" struct tnode * tree1 ( arg1 ) int arg1; { return( tree ( 1 , arg1 )); } struct tnode * tree2 ( arg1 , arg2 ) int arg1 , arg2; { return( tree ( 2 , arg1 , arg2 )); } struct tnode * tree3 ( arg1 , arg2 , arg3 ) int arg1 , arg2 ; struct tnode *arg3; { return( tree ( 3 , arg1 , arg2 , arg3 )); } struct tnode * tree4 ( arg1 , arg2 , arg3 , arg4 ) int arg1 , arg2 ; struct tnode *arg3 , *arg4; { return( tree ( 4 , arg1 , arg2 , arg3 , arg4 )); } struct tnode * tree5 ( arg1 , arg2 , arg3 , arg4 , arg5 ) int arg1 , arg2 ; struct tnode *arg3 , *arg4 , *arg5; { return (tree ( 5 , arg1 , arg2 , arg3 , arg4 , arg5 )); }