gnu1987/gnuchess/Xchess/jail.c

/* This file contains code for X-CHESS.
   Copyright (C) 1986 Free Software Foundation, Inc.

This file is part of X-CHESS.

X-CHESS is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY.  No author or distributor
accepts responsibility to anyone for the consequences of using it
or for whether it serves any particular purpose or works at all,
unless he says so in writing.  Refer to the X-CHESS General Public
License for full details.

Everyone is granted permission to copy, modify and redistribute
X-CHESS, but only under the conditions described in the
X-CHESS General Public License.   A copy of this license is
supposed to have been given to you along with X-CHESS so you
can know your rights and responsibilities.  It should be in a
file named COPYING.  Among other things, the copyright notice
and this notice must be preserved on all copies.  */


/* RCS Info: $Revision: 1.3 $ on $Date: 86/11/26 12:09:54 $
 *           $Source: /users/faustus/xchess/RCS/jail.c,v $
 * Copyright (c) 1986 Wayne A. Christopher, U. C. Berkeley CAD Group
 *	Permission is granted to do anything with this code except sell it
 *	or remove this message.
 *
 */

#include "xchess.h"

#include "pawn_small.bitmap"
#include "rook_small.bitmap"
#include "knight_small.bitmap"
#include "bishop_small.bitmap"
#include "queen_small.bitmap"
#include "king_small.bitmap"

#include "pawn_small_outline.bitmap"
#include "rook_small_outline.bitmap"
#include "knight_small_outline.bitmap"
#include "bishop_small_outline.bitmap"
#include "queen_small_outline.bitmap"
#include "king_small_outline.bitmap"

static bool pos[32];

static piecetype pcs[] = { KING, QUEEN, ROOK, ROOK, BISHOP, BISHOP, KNIGHT,
		KNIGHT, PAWN, PAWN, PAWN, PAWN, PAWN, PAWN, PAWN, PAWN } ;

extern int piecepos();
extern short *bitsget();

void
jail_init(win)
	windata *win;
{
	int i;

	for (i = 0; i < 32; i++)
		pos[i] = false;
	jail_draw(win);
	return;
}

#define JAIL_HEADER	"Captured Pieces"

void
jail_draw(win)
	windata *win;
{
	int i;
	short *bits;
	piece p;

	XSetDisplay(win->display);

	i = XStringWidth(JAIL_HEADER, win->large, 0, 0);
	XText(win->jailwin, (JAIL_WIDTH - i) / 2, 1, JAIL_HEADER,
			strlen(JAIL_HEADER), win->large->id, 
			win->textcolor.pixel, win->textback.pixel);
	for (i = 0; i < 16; i++)
		if (pos[i]) {
			p.color = WHITE;
			p.type = pcs[i];
			bits = bitsget(&p);
			XBitmapBitsPut(win->jailwin, 5 + (i % 8) * 32, 25 +
					(i / 8) * 32, 32, 32, bits,
					win->blackpiece.pixel,
					win->textback.pixel,
					(Bitmap) 0, GXcopy, AllPlanes);
		} else {
			XPixSet(win->jailwin, 5 + (i % 8) * 32, 25 + (i / 8) *
					32, 32, 32, win->textback.pixel);
		}
	for (i = 0; i < 16; i++)
		if (pos[i + 16]) {
			p.color = BLACK;
			p.type = pcs[i];
			bits = bitsget(&p);
			XBitmapBitsPut(win->jailwin, 5 + (i % 8) * 32, 94 +
					(i / 8) * 32, 32, 32, bits,
					win->blackpiece.pixel,
					win->textback.pixel,
					(Bitmap) 0, GXcopy,
					AllPlanes);
		} else {
			XPixSet(win->jailwin, 5 + (i % 8) * 32, 94 + (i / 8) *
					32, 32, 32, win->textback.pixel);
		}

	return;
}

void
jail_add(p)
	piece *p;
{
	int i = piecepos(p, false);
	short *bits;

	pos[i] = true;

	bits = bitsget(p);

	XSetDisplay(win1->display);
	XBitmapBitsPut(win1->jailwin, 5 + (i % 8) * 32, ((i >= 16) ? 30 : 25) +
			(i / 8) * 32, 32, 32, bits, win1->blackpiece.pixel,
			win1->textback.pixel, (Bitmap) 0, GXcopy, AllPlanes);
	if (!oneboard) {
		XSetDisplay(win2->display);
		XBitmapBitsPut(win2->jailwin, 5 + (i % 8) * 32, ((i >= 16) ? 30
				: 25) + (i / 8) * 32, 32, 32, bits,
				win2->blackpiece.pixel, win2->textback.pixel,
				(Bitmap) 0, GXcopy, AllPlanes);
	}

	return;
}

void
jail_remove(p)
	piece *p;
{
	int i = piecepos(p, true);

	pos[i] = false;

	XSetDisplay(win1->display);
	XPixSet(win1->jailwin, 5 + (i % 8) * 32, ((i >= 16) ? 30 : 25) +
			(i / 8) * 32, 32, 32, win1->textback.pixel);
	if (!oneboard) {
		XSetDisplay(win2->display);
		XPixSet(win2->jailwin, 5 + (i % 8) * 32, ((i >= 16) ? 30 : 25) +
				(i / 8) * 32, 32, 32, win2->textback.pixel);
	}

	return;
}

static short *
bitsget(p)
	piece *p;
{
	short *bits;

	switch (p->type) {
	    case PAWN:
		bits = (p->color == WHITE) ? pawn_small_outline_bits :
				pawn_small_bits;
		break;

	    case ROOK:
		bits = (p->color == WHITE) ? rook_small_outline_bits :
				rook_small_bits;
		break;

	    case KNIGHT:
		bits = (p->color == WHITE) ? knight_small_outline_bits :
				knight_small_bits;
		break;

	    case BISHOP:
		bits = (p->color == WHITE) ? bishop_small_outline_bits :
				bishop_small_bits;
		break;

	    case QUEEN:
		bits = (p->color == WHITE) ? queen_small_outline_bits :
				queen_small_bits;
		break;

	    case KING:
		bits = (p->color == WHITE) ? king_small_outline_bits :
				king_small_bits;
		break;
	}
	return (bits);
}

static int
piecepos(p, there)
	piece *p;
	bool there;
{
	int i, base = (p->color == WHITE) ? 0 : 16;

	switch (p->type) {
	    case PAWN:
		for (i = base + 8; (i < base + 15) && pos[i]; i++)
			;
		if (there && !pos[i])
			i--;
		break;

	    case KING:
		/* Hmm... */
		i = base;
		break;

	    case QUEEN:
		i = base + 1;
		break;

	    case ROOK:
		i = base + 2;
		if ((there && pos[i + 1]) || (!there && pos[i]))
			i++;
		break;

	    case BISHOP:
		i = base + 4;
		if ((there && pos[i + 1]) || (!there && pos[i]))
			i++;
		break;

	    case KNIGHT:
		i = base + 6;
		if ((there && pos[i + 1]) || (!there && pos[i]))
			i++;
		break;
	}
	return (i);
}