Home | History | Annotate | Line # | Download | only in common_source
board.c revision 1.1.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 static char sccsid[] = "@(#)board.c	5.4 (Berkeley) 6/1/90";
     36  1.1  cgd #endif /* not lint */
     37  1.1  cgd 
     38  1.1  cgd #include "back.h"
     39  1.1  cgd 
     40  1.1  cgd static int	i, j, k;
     41  1.1  cgd static char	ln[60];
     42  1.1  cgd 
     43  1.1  cgd wrboard ()  {
     44  1.1  cgd 	register int	l;
     45  1.1  cgd 	static char	bl[] =
     46  1.1  cgd 		"|                       |   |                       |\n";
     47  1.1  cgd 	static char	sv[] =
     48  1.1  cgd 		"|                       |   |                       |    \n";
     49  1.1  cgd 
     50  1.1  cgd 	fixtty (noech);
     51  1.1  cgd 	clear();
     52  1.1  cgd 
     53  1.1  cgd 	if (tflag)  {
     54  1.1  cgd 		fboard();
     55  1.1  cgd 		goto lastline;
     56  1.1  cgd 	}
     57  1.1  cgd 
     58  1.1  cgd 	writel ("_____________________________________________________\n");
     59  1.1  cgd 	writel (bl);
     60  1.1  cgd 	strcpy (ln,bl);
     61  1.1  cgd 	for (j = 1; j < 50; j += 4) {
     62  1.1  cgd 		k = j/4+(j > 24? 12: 13);
     63  1.1  cgd 		ln[j+1] = k%10+'0';
     64  1.1  cgd 		ln[j] = k/10+'0';
     65  1.1  cgd 		if (j == 21)
     66  1.1  cgd 			j += 4;
     67  1.1  cgd 	}
     68  1.1  cgd 	writel (ln);
     69  1.1  cgd 	for (i = 0; i < 5; i++) {
     70  1.1  cgd 		strcpy (ln,sv);
     71  1.1  cgd 		for (j = 1; j < 50; j += 4) {
     72  1.1  cgd 			k = j/4+(j > 24? 12: 13);
     73  1.1  cgd 			wrbsub ();
     74  1.1  cgd 			if (j == 21)
     75  1.1  cgd 				j += 4;
     76  1.1  cgd 		}
     77  1.1  cgd 		if (-board[25] > i)
     78  1.1  cgd 			ln[26] = 'w';
     79  1.1  cgd 		if (-board[25] > i+5)
     80  1.1  cgd 			ln[25] = 'w';
     81  1.1  cgd 		if (-board[25] > i+10)
     82  1.1  cgd 			ln[27] = 'w';
     83  1.1  cgd 		l = 53;
     84  1.1  cgd 		if (off[1] > i || (off[1] < 0 && off[1]+15 > i))  {
     85  1.1  cgd 			ln[54] = 'r';
     86  1.1  cgd 			l = 55;
     87  1.1  cgd 		}
     88  1.1  cgd 		if (off[1] > i+5 || (off[1] < 0 && off[1]+15 > i+5))  {
     89  1.1  cgd 			ln[55] = 'r';
     90  1.1  cgd 			l = 56;
     91  1.1  cgd 		}
     92  1.1  cgd 		if (off[1] > i+10 || (off[1] < 0 && off[1]+15 > i+10))  {
     93  1.1  cgd 			ln[56] = 'r';
     94  1.1  cgd 			l = 57;
     95  1.1  cgd 		}
     96  1.1  cgd 		ln[l++] = '\n';
     97  1.1  cgd 		ln[l] = '\0';
     98  1.1  cgd 		writel (ln);
     99  1.1  cgd 	}
    100  1.1  cgd 	strcpy (ln,bl);
    101  1.1  cgd 	ln[25] = 'B';
    102  1.1  cgd 	ln[26] = 'A';
    103  1.1  cgd 	ln[27] = 'R';
    104  1.1  cgd 	writel (ln);
    105  1.1  cgd 	strcpy (ln,sv);
    106  1.1  cgd 	for (i = 4; i > -1; i--) {
    107  1.1  cgd 		for (j = 1; j < 50; j += 4) {
    108  1.1  cgd 			k = ((j > 24? 53: 49)-j)/4;
    109  1.1  cgd 			wrbsub();
    110  1.1  cgd 			if (j == 21)
    111  1.1  cgd 				j += 4;
    112  1.1  cgd 		}
    113  1.1  cgd 		if (board[0] > i)
    114  1.1  cgd 			ln[26] = 'r';
    115  1.1  cgd 		if (board[0] > i+5)
    116  1.1  cgd 			ln[25] = 'r';
    117  1.1  cgd 		if (board[0] > i+10)
    118  1.1  cgd 			ln[27] = 'r';
    119  1.1  cgd 		l = 53;
    120  1.1  cgd 		if (off[0] > i || (off[0] < 0 && off[0]+15 > i))  {
    121  1.1  cgd 			ln[54] = 'w';
    122  1.1  cgd 			l = 55;
    123  1.1  cgd 		}
    124  1.1  cgd 		if (off[0] > i+5 || (off[0] < 0 && off[0]+15 > i+5))  {
    125  1.1  cgd 			ln[55] = 'w';
    126  1.1  cgd 			l = 56;
    127  1.1  cgd 		}
    128  1.1  cgd 		if (off[0] > i+10 || (off[0] < 0 && off[0]+15 > i+10))  {
    129  1.1  cgd 			ln[56] = 'w';
    130  1.1  cgd 			l = 57;
    131  1.1  cgd 		}
    132  1.1  cgd 		ln[l++] = '\n';
    133  1.1  cgd 		ln[l] = '\0';
    134  1.1  cgd 		writel (ln);
    135  1.1  cgd 	}
    136  1.1  cgd 	strcpy (ln,bl);
    137  1.1  cgd 	for (j = 1; j < 50; j += 4) {
    138  1.1  cgd 		k = ((j > 24? 53: 49)-j)/4;
    139  1.1  cgd 		ln[j+1] = k%10+'0';
    140  1.1  cgd 		if (k > 9)
    141  1.1  cgd 			ln[j] = k/10+'0';
    142  1.1  cgd 		if (j == 21)
    143  1.1  cgd 			j += 4;
    144  1.1  cgd 	}
    145  1.1  cgd 	writel (ln);
    146  1.1  cgd 	writel ("|_______________________|___|_______________________|\n");
    147  1.1  cgd 
    148  1.1  cgd lastline:
    149  1.1  cgd 	gwrite ();
    150  1.1  cgd 	if (tflag)
    151  1.1  cgd 		curmove (18,0);
    152  1.1  cgd 	else  {
    153  1.1  cgd 		writec ('\n');
    154  1.1  cgd 		writec ('\n');
    155  1.1  cgd 	}
    156  1.1  cgd 	fixtty(raw);
    157  1.1  cgd }
    158  1.1  cgd 
    159  1.1  cgd wrbsub () {
    161  1.1  cgd 	register int	m;
    162  1.1  cgd 	register char	d;
    163  1.1  cgd 
    164  1.1  cgd 	if (board[k] > 0)  {
    165  1.1  cgd 		m = board[k];
    166  1.1  cgd 		d = 'r';
    167  1.1  cgd 	} else {
    168  1.1  cgd 		m = -board[k];
    169  1.1  cgd 		d = 'w';
    170  1.1  cgd 	}
    171  1.1  cgd 	if (m>i)
    172  1.1  cgd 		ln[j+1] = d;
    173  1.1  cgd 	if (m>i+5)
    174  1.1  cgd 		ln[j] = d;
    175  1.1  cgd 	if (m>i+10)
    176  1.1  cgd 		ln[j+2] = d;
    177           }
    178