Home | History | Annotate | Line # | Download | only in robots
main.c revision 1.1
      1  1.1  cgd /*
      2  1.1  cgd  * Copyright (c) 1980 Regents of the University of California.
      3  1.1  cgd  * All rights reserved.
      4  1.1  cgd  *
      5  1.1  cgd  * Redistribution and use in source and binary forms, with or without
      6  1.1  cgd  * modification, are permitted provided that the following conditions
      7  1.1  cgd  * are met:
      8  1.1  cgd  * 1. Redistributions of source code must retain the above copyright
      9  1.1  cgd  *    notice, this list of conditions and the following disclaimer.
     10  1.1  cgd  * 2. Redistributions in binary form must reproduce the above copyright
     11  1.1  cgd  *    notice, this list of conditions and the following disclaimer in the
     12  1.1  cgd  *    documentation and/or other materials provided with the distribution.
     13  1.1  cgd  * 3. All advertising materials mentioning features or use of this software
     14  1.1  cgd  *    must display the following acknowledgement:
     15  1.1  cgd  *	This product includes software developed by the University of
     16  1.1  cgd  *	California, Berkeley and its contributors.
     17  1.1  cgd  * 4. Neither the name of the University nor the names of its contributors
     18  1.1  cgd  *    may be used to endorse or promote products derived from this software
     19  1.1  cgd  *    without specific prior written permission.
     20  1.1  cgd  *
     21  1.1  cgd  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     22  1.1  cgd  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     23  1.1  cgd  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     24  1.1  cgd  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     25  1.1  cgd  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     26  1.1  cgd  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     27  1.1  cgd  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     28  1.1  cgd  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     29  1.1  cgd  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     30  1.1  cgd  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     31  1.1  cgd  * SUCH DAMAGE.
     32  1.1  cgd  */
     33  1.1  cgd 
     34  1.1  cgd #ifndef lint
     35  1.1  cgd char copyright[] =
     36  1.1  cgd "@(#) Copyright (c) 1980 Regents of the University of California.\n\
     37  1.1  cgd  All rights reserved.\n";
     38  1.1  cgd #endif /* not lint */
     39  1.1  cgd 
     40  1.1  cgd #ifndef lint
     41  1.1  cgd static char sccsid[] = "@(#)main.c	5.5 (Berkeley) 2/28/91";
     42  1.1  cgd #endif /* not lint */
     43  1.1  cgd 
     44  1.1  cgd # include	"robots.h"
     45  1.1  cgd # include	<signal.h>
     46  1.1  cgd # include	<ctype.h>
     47  1.1  cgd 
     48  1.1  cgd main(ac, av)
     49  1.1  cgd int	ac;
     50  1.1  cgd char	**av;
     51  1.1  cgd {
     52  1.1  cgd 	register char	*sp;
     53  1.1  cgd 	register bool	bad_arg;
     54  1.1  cgd 	register bool	show_only;
     55  1.1  cgd 	extern char	*Scorefile;
     56  1.1  cgd 	extern int	Max_per_uid;
     57  1.1  cgd 	void quit();
     58  1.1  cgd 
     59  1.1  cgd 	show_only = FALSE;
     60  1.1  cgd 	if (ac > 1) {
     61  1.1  cgd 		bad_arg = FALSE;
     62  1.1  cgd 		for (++av; ac > 1 && *av[0]; av++, ac--)
     63  1.1  cgd 			if (av[0][0] != '-')
     64  1.1  cgd 				if (isdigit(av[0][0]))
     65  1.1  cgd 					Max_per_uid = atoi(av[0]);
     66  1.1  cgd 				else {
     67  1.1  cgd 					setuid(getuid());
     68  1.1  cgd 					setgid(getgid());
     69  1.1  cgd 					Scorefile = av[0];
     70  1.1  cgd # ifdef	FANCY
     71  1.1  cgd 					sp = rindex(Scorefile, '/');
     72  1.1  cgd 					if (sp == NULL)
     73  1.1  cgd 						sp = Scorefile;
     74  1.1  cgd 					if (strcmp(sp, "pattern_roll") == 0)
     75  1.1  cgd 						Pattern_roll = TRUE;
     76  1.1  cgd 					else if (strcmp(sp, "stand_still") == 0)
     77  1.1  cgd 						Stand_still = TRUE;
     78  1.1  cgd 					if (Pattern_roll || Stand_still)
     79  1.1  cgd 						Teleport = TRUE;
     80  1.1  cgd # endif
     81  1.1  cgd 				}
     82  1.1  cgd 			else
     83  1.1  cgd 				for (sp = &av[0][1]; *sp; sp++)
     84  1.1  cgd 					switch (*sp) {
     85  1.1  cgd 					  case 's':
     86  1.1  cgd 						show_only = TRUE;
     87  1.1  cgd 						break;
     88  1.1  cgd 					  case 'r':
     89  1.1  cgd 						Real_time = TRUE;
     90  1.1  cgd 						break;
     91  1.1  cgd 					  case 'a':
     92  1.1  cgd 						Start_level = 4;
     93  1.1  cgd 						break;
     94  1.1  cgd 					  case 'j':
     95  1.1  cgd 						Jump = TRUE;
     96  1.1  cgd 						break;
     97  1.1  cgd 					  case 't':
     98  1.1  cgd 						Teleport = TRUE;
     99  1.1  cgd 						break;
    100  1.1  cgd 					  default:
    101  1.1  cgd 						fprintf(stderr, "robots: uknown option: %c\n", *sp);
    102  1.1  cgd 						bad_arg = TRUE;
    103  1.1  cgd 						break;
    104  1.1  cgd 					}
    105  1.1  cgd 		if (bad_arg) {
    106  1.1  cgd 			exit(1);
    107  1.1  cgd 			/* NOTREACHED */
    108  1.1  cgd 		}
    109  1.1  cgd 	}
    110  1.1  cgd 
    111  1.1  cgd 	if (show_only) {
    112  1.1  cgd 		show_score();
    113  1.1  cgd 		exit(0);
    114  1.1  cgd 		/* NOTREACHED */
    115  1.1  cgd 	}
    116  1.1  cgd 
    117  1.1  cgd 	initscr();
    118  1.1  cgd 	signal(SIGINT, quit);
    119  1.1  cgd 	crmode();
    120  1.1  cgd 	noecho();
    121  1.1  cgd 	nonl();
    122  1.1  cgd 	if (LINES != Y_SIZE || COLS != X_SIZE) {
    123  1.1  cgd 		if (LINES < Y_SIZE || COLS < X_SIZE) {
    124  1.1  cgd 			endwin();
    125  1.1  cgd 			printf("Need at least a %dx%d screen\n",
    126  1.1  cgd 			    Y_SIZE, X_SIZE);
    127  1.1  cgd 			exit(1);
    128  1.1  cgd 		}
    129  1.1  cgd 		delwin(stdscr);
    130  1.1  cgd 		stdscr = newwin(Y_SIZE, X_SIZE, 0, 0);
    131  1.1  cgd 	}
    132  1.1  cgd 
    133  1.1  cgd 	srand(getpid());
    134  1.1  cgd 	if (Real_time)
    135  1.1  cgd 		signal(SIGALRM, move_robots);
    136  1.1  cgd 	do {
    137  1.1  cgd 		init_field();
    138  1.1  cgd 		for (Level = Start_level; !Dead; Level++) {
    139  1.1  cgd 			make_level();
    140  1.1  cgd 			play_level();
    141  1.1  cgd 		}
    142  1.1  cgd 		move(My_pos.y, My_pos.x);
    143  1.1  cgd 		printw("AARRrrgghhhh....");
    144  1.1  cgd 		refresh();
    145  1.1  cgd 		score();
    146  1.1  cgd 	} while (another());
    147  1.1  cgd 	quit();
    148  1.1  cgd }
    149  1.1  cgd 
    150  1.1  cgd /*
    151  1.1  cgd  * quit:
    152  1.1  cgd  *	Leave the program elegantly.
    153  1.1  cgd  */
    154  1.1  cgd void
    155  1.1  cgd quit()
    156  1.1  cgd {
    157  1.1  cgd 	extern int	_putchar();
    158  1.1  cgd 
    159  1.1  cgd 	mvcur(0, COLS - 1, LINES - 1, 0);
    160  1.1  cgd 	if (CE) {
    161  1.1  cgd 		tputs(CE, 1, _putchar);
    162  1.1  cgd 		endwin();
    163  1.1  cgd 	}
    164  1.1  cgd 	else {
    165  1.1  cgd 		endwin();
    166  1.1  cgd 		putchar('\n');
    167  1.1  cgd 	}
    168  1.1  cgd 	exit(0);
    169  1.1  cgd 	/* NOTREACHED */
    170  1.1  cgd }
    171  1.1  cgd 
    172  1.1  cgd /*
    173  1.1  cgd  * another:
    174  1.1  cgd  *	See if another game is desired
    175  1.1  cgd  */
    176  1.1  cgd another()
    177  1.1  cgd {
    178  1.1  cgd 	register int	y;
    179  1.1  cgd 
    180  1.1  cgd #ifdef	FANCY
    181  1.1  cgd 	if ((Stand_still || Pattern_roll) && !Newscore)
    182  1.1  cgd 		return TRUE;
    183  1.1  cgd #endif
    184  1.1  cgd 
    185  1.1  cgd 	if (query("Another game?")) {
    186  1.1  cgd 		if (Full_clear) {
    187  1.1  cgd 			for (y = 1; y <= Num_scores; y++) {
    188  1.1  cgd 				move(y, 1);
    189  1.1  cgd 				clrtoeol();
    190  1.1  cgd 			}
    191  1.1  cgd 			refresh();
    192  1.1  cgd 		}
    193  1.1  cgd 		return TRUE;
    194  1.1  cgd 	}
    195  1.1  cgd 	return FALSE;
    196  1.1  cgd }
    197