Ported snake game.
This commit is contained in:
Serge Vakulenko
@@ -430,6 +430,8 @@ file /games/rain
|
||||
file /games/robots
|
||||
file /games/rogue
|
||||
file /games/sail
|
||||
file /games/snake
|
||||
file /games/snscore
|
||||
file /games/teachgammon
|
||||
file /games/trek
|
||||
file /games/worm
|
||||
@@ -450,6 +452,8 @@ file /games/lib/fortunes.dat
|
||||
file /games/lib/cards.pck
|
||||
file /games/lib/robots_roll
|
||||
mode 0666
|
||||
file /games/lib/snakerawscores
|
||||
mode 0666
|
||||
dir /games/lib/quiz.k
|
||||
file /games/lib/quiz.k/africa
|
||||
file /games/lib/quiz.k/america
|
||||
@@ -778,6 +782,7 @@ file /share/man/cat6/rain.0
|
||||
file /share/man/cat6/robots.0
|
||||
file /share/man/cat6/rogue.0
|
||||
file /share/man/cat6/sail.0
|
||||
file /share/man/cat6/snake.0
|
||||
file /share/man/cat6/trek.0
|
||||
file /share/man/cat6/worm.0
|
||||
file /share/man/cat6/worms.0
|
||||
|
||||
@@ -13,8 +13,7 @@ CFLAGS += -Werror -Wall -Os
|
||||
#
|
||||
SUBDIR = adventure atc backgammon battlestar boggle btlgammon \
|
||||
cribbage fortune hangman mille monop quiz robots rogue \
|
||||
sail trek
|
||||
# TODO: snake
|
||||
sail snake trek
|
||||
|
||||
# C programs that live in the current directory and do not need
|
||||
# explicit make lines.
|
||||
|
||||
2
src/games/snake/.gitignore
vendored
Normal file
2
src/games/snake/.gitignore
vendored
Normal file
@@ -0,0 +1,2 @@
|
||||
snake
|
||||
snscore
|
||||
@@ -5,37 +5,39 @@
|
||||
#
|
||||
# @(#)Makefile 5.1.1 (2.11BSD GTE) 1/16/95
|
||||
#
|
||||
DESTDIR=
|
||||
CFLAGS= -O -DCHECKBUSY
|
||||
LIBS= -lm -ltermcap
|
||||
BIN= $(DESTDIR)/usr/games
|
||||
LIB= $(DESTDIR)/usr/games/lib
|
||||
USER= daemon
|
||||
UTILS= snscore busy
|
||||
OBJS= snake.o move.o
|
||||
ALL= snake ${UTILS}
|
||||
SEPFLAG= -i
|
||||
TOPSRC = $(shell cd ../../..; pwd)
|
||||
include $(TOPSRC)/target.mk
|
||||
#include $(TOPSRC)/cross.mk
|
||||
#CFLAGS = -O -g -DCROSS -Dsgttyb=termios
|
||||
|
||||
all: ${ALL}
|
||||
CFLAGS += -Werror -Wall
|
||||
|
||||
OBJS = snake.o move.o
|
||||
MAN = snake.0
|
||||
LIBS = -lm -ltermcap -lc
|
||||
|
||||
all: snake snscore $(MAN)
|
||||
|
||||
snake: $(OBJS)
|
||||
cc ${SEPFLAG} $(OBJS) -o snake $(LIBS)
|
||||
$(CC) $(LDFLAGS) -o $@.elf $(OBJS) $(LIBS)
|
||||
$(OBJDUMP) -S $@.elf > $@.dis
|
||||
$(SIZE) $@.elf
|
||||
$(ELF2AOUT) $@.elf $@ && rm $@.elf
|
||||
|
||||
snake.o move.o:snake.h
|
||||
snscore: snscore.o
|
||||
$(CC) $(LDFLAGS) -o $@.elf snscore.o $(LIBS)
|
||||
$(OBJDUMP) -S $@.elf > $@.dis
|
||||
$(SIZE) $@.elf
|
||||
$(ELF2AOUT) $@.elf $@ && rm $@.elf
|
||||
|
||||
snscore: snscore.c
|
||||
cc ${SEPFLAG} $(CFLAGS) snscore.c -o snscore
|
||||
|
||||
busy: busy.c
|
||||
cc ${SEPFLAG} $(CFLAGS) busy.c -o busy
|
||||
|
||||
install: all
|
||||
install -s -m 4755 -o ${USER} snake ${BIN}/snake
|
||||
install -s -m 755 -o ${USER} snscore ${BIN}/snscore
|
||||
install -s -m 755 -o ${USER} busy ${LIB}/busy
|
||||
cat /dev/null >> $(LIB)/snakerawscores
|
||||
chmod 644 $(LIB)/snakerawscores
|
||||
chown $(USER) $(LIB)/snakerawscores
|
||||
$(MAN): snake.6
|
||||
nroff -man $< > $@
|
||||
|
||||
clean:
|
||||
rm -f *.o ${ALL}
|
||||
rm -f *.o core snake snscore *.0 *.dis
|
||||
|
||||
install: all
|
||||
install snake $(DESTDIR)/games/
|
||||
install snscore $(DESTDIR)/games/
|
||||
install -m 644 $(MAN) $(DESTDIR)/share/man/cat6/
|
||||
install -c -m 644 /dev/null ${DESTDIR}/games/lib/snakerawscores
|
||||
|
||||
@@ -4,10 +4,6 @@
|
||||
* specifies the terms and conditions for redistribution.
|
||||
*/
|
||||
|
||||
#if !defined(lint) && defined(DOSCCS)
|
||||
static char sccsid[] = "@(#)move.c 5.1.1 (2.11BSD) 1997/3/28";
|
||||
#endif
|
||||
|
||||
/*************************************************************************
|
||||
*
|
||||
* MOVE LIBRARY
|
||||
@@ -31,9 +27,9 @@ static char sccsid[] = "@(#)move.c 5.1.1 (2.11BSD) 1997/3/28";
|
||||
* home() home.
|
||||
* ll() move to lower left corner of screen.
|
||||
* cr() carriage return (no line feed).
|
||||
* printf() just like standard printf, but keeps track
|
||||
* print() just like standard printf, but keeps track
|
||||
* of cursor position. (Uses pstring).
|
||||
* aprintf() same as printf, but first argument is &point.
|
||||
* aprint() same as print, but first argument is &point.
|
||||
* (Uses pstring).
|
||||
* pstring(s) output the string of printing characters.
|
||||
* However, '\r' is interpreted to mean return
|
||||
@@ -59,7 +55,6 @@ static char sccsid[] = "@(#)move.c 5.1.1 (2.11BSD) 1997/3/28";
|
||||
* same(&p1,&p2) returns 1 if p1 and p2 are the same point.
|
||||
* point(&p,x,y) return point set to x,y.
|
||||
*
|
||||
* baudrate(x) returns the baudrate of the terminal.
|
||||
* delay(t) causes an approximately constant delay
|
||||
* independent of baudrate.
|
||||
* Duration is ~ t/20 seconds.
|
||||
@@ -67,129 +62,187 @@ static char sccsid[] = "@(#)move.c 5.1.1 (2.11BSD) 1997/3/28";
|
||||
******************************************************************************/
|
||||
|
||||
#include "snake.h"
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <stdarg.h>
|
||||
#include <term.h>
|
||||
#include <unistd.h>
|
||||
|
||||
int CMlength;
|
||||
int NDlength;
|
||||
int BSlength;
|
||||
int delaystr[10];
|
||||
short ospeed;
|
||||
|
||||
static char str[80];
|
||||
|
||||
move(sp)
|
||||
int
|
||||
outch(c)
|
||||
{
|
||||
return putchar(c);
|
||||
}
|
||||
|
||||
void
|
||||
putpad(str)
|
||||
char *str;
|
||||
{
|
||||
if (str)
|
||||
tputs(str, 1, outch);
|
||||
}
|
||||
|
||||
void
|
||||
bs()
|
||||
{
|
||||
if (cursor.col > 0) {
|
||||
putpad(BS);
|
||||
cursor.col--;
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
nd()
|
||||
{
|
||||
putpad(ND);
|
||||
cursor.col++;
|
||||
if (cursor.col == COLUMNS+1) {
|
||||
cursor.line++;
|
||||
cursor.col = 0;
|
||||
if (cursor.line >= LINES)cursor.line=LINES-1;
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
right(sp)
|
||||
struct point *sp;
|
||||
{
|
||||
int distance;
|
||||
int tabcol,ct;
|
||||
int field,tfield;
|
||||
int tabcol,strlength;
|
||||
|
||||
if (sp->col < cursor.col)
|
||||
print("ERROR:right() can't move left\n");
|
||||
if (TA) { /* If No Tabs: can't send tabs because ttydrive
|
||||
* loses count with control characters.
|
||||
*/
|
||||
field = cursor.col >> 3;
|
||||
/*
|
||||
* This code is useful for a terminal which wraps around on backspaces.
|
||||
* (Mine does.) Unfortunately, this is not specified in termcap, and
|
||||
* most terminals don't work that way. (Of course, most terminals
|
||||
* have addressible cursors, too).
|
||||
*/
|
||||
if (BW && (CM == 0) &&
|
||||
((sp->col << 1) - field > (COLUMNS - 8) << 1)) {
|
||||
if (cursor.line == 0) {
|
||||
outch('\n');
|
||||
}
|
||||
outch('\r');
|
||||
cursor.col = COLUMNS + 1;
|
||||
while(cursor.col > sp->col)bs();
|
||||
if (cursor.line != 0) outch('\n');
|
||||
return;
|
||||
}
|
||||
|
||||
tfield = sp->col >> 3;
|
||||
|
||||
while (field < tfield) {
|
||||
putpad(TA);
|
||||
cursor.col = ++field << 3;
|
||||
}
|
||||
tabcol = (cursor.col|7) + 1;
|
||||
strlength = (tabcol - sp->col)*BSlength + 1;
|
||||
/* length of sequence to overshoot */
|
||||
if (((sp->col - cursor.col)*NDlength > strlength) &&
|
||||
(tabcol < COLUMNS)) {
|
||||
/*
|
||||
* Tab past and backup
|
||||
*/
|
||||
putpad(TA);
|
||||
cursor.col = (cursor.col | 7) + 1;
|
||||
while(cursor.col > sp->col)bs();
|
||||
}
|
||||
}
|
||||
while (sp->col > cursor.col) {
|
||||
nd();
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
cr()
|
||||
{
|
||||
outch('\r');
|
||||
cursor.col = 0;
|
||||
}
|
||||
|
||||
void
|
||||
ll()
|
||||
{
|
||||
int l;
|
||||
struct point z;
|
||||
|
||||
if (sp->line <0 || sp->col <0 || sp->col > COLUMNS){
|
||||
printf("move to [%d,%d]?",sp->line,sp->col);
|
||||
l = lcnt + 2;
|
||||
if (LL != NULL && LINES==l) {
|
||||
putpad(LL);
|
||||
cursor.line = LINES-1;
|
||||
cursor.col = 0;
|
||||
return;
|
||||
}
|
||||
if (sp->line >= LINES){
|
||||
move(point(&z,sp->col,LINES-1));
|
||||
while(sp->line-- >= LINES)putchar('\n');
|
||||
return;
|
||||
}
|
||||
|
||||
if (CM != 0) {
|
||||
char *cmstr = tgoto(CM, sp->col, sp->line);
|
||||
|
||||
CMlength = strlen(cmstr);
|
||||
if(cursor.line == sp->line){
|
||||
distance = sp->col - cursor.col;
|
||||
if(distance == 0)return; /* Already there! */
|
||||
if(distance > 0){ /* Moving to the right */
|
||||
if(distance*NDlength < CMlength){
|
||||
right(sp);
|
||||
return;
|
||||
}
|
||||
if(TA){
|
||||
ct=sp->col&7;
|
||||
tabcol=(cursor.col|7)+1;
|
||||
do{
|
||||
ct++;
|
||||
tabcol=(tabcol|7)+1;
|
||||
}
|
||||
while(tabcol<sp->col);
|
||||
if(ct<CMlength){
|
||||
right(sp);
|
||||
return;
|
||||
}
|
||||
}
|
||||
} else { /* Moving to the left */
|
||||
if (-distance*BSlength < CMlength){
|
||||
gto(sp);
|
||||
return;
|
||||
}
|
||||
}
|
||||
if(sp->col < CMlength){
|
||||
cr();
|
||||
right(sp);
|
||||
return;
|
||||
}
|
||||
/* No more optimizations on same row. */
|
||||
}
|
||||
distance = sp->col - cursor.col;
|
||||
distance = distance > 0 ?
|
||||
distance*NDlength : -distance * BSlength;
|
||||
if(distance < 0)printf("ERROR: distance is negative: %d",distance);
|
||||
distance += abs(sp->line - cursor.line);
|
||||
if(distance >= CMlength){
|
||||
putpad(cmstr);
|
||||
cursor.line = sp->line;
|
||||
cursor.col = sp->col;
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* If we get here we have a terminal that can't cursor
|
||||
* address but has local motions or one which can cursor
|
||||
* address but can get there quicker with local motions.
|
||||
*/
|
||||
gto(sp);
|
||||
z.col = 0;
|
||||
z.line = l-1;
|
||||
move(&z);
|
||||
}
|
||||
|
||||
void
|
||||
up()
|
||||
{
|
||||
putpad(UP);
|
||||
cursor.line--;
|
||||
}
|
||||
|
||||
void
|
||||
down()
|
||||
{
|
||||
putpad(DO);
|
||||
cursor.line++;
|
||||
if (cursor.line >= LINES)cursor.line=LINES-1;
|
||||
}
|
||||
|
||||
void
|
||||
gto(sp)
|
||||
struct point *sp;
|
||||
{
|
||||
|
||||
int distance,f,tfield,j;
|
||||
int distance, f, tfield;
|
||||
|
||||
if (cursor.line > LINES || cursor.line <0 ||
|
||||
cursor.col <0 || cursor.col > COLUMNS)
|
||||
printf("ERROR: cursor is at %d,%d\n",
|
||||
print("ERROR: cursor is at %d,%d\n",
|
||||
cursor.line,cursor.col);
|
||||
if (sp->line > LINES || sp->line <0 ||
|
||||
sp->col <0 || sp->col > COLUMNS)
|
||||
printf("ERROR: target is %d,%d\n",sp->line,sp->col);
|
||||
print("ERROR: target is %d,%d\n",sp->line,sp->col);
|
||||
tfield = (sp->col) >> 3;
|
||||
if (sp->line == cursor.line){
|
||||
if (sp->col > cursor.col)right(sp);
|
||||
if (sp->line == cursor.line) {
|
||||
if (sp->col > cursor.col)
|
||||
right(sp);
|
||||
else{
|
||||
distance = (cursor.col -sp->col)*BSlength;
|
||||
if (((TA) &&
|
||||
(distance > tfield+((sp->col)&7)*NDlength)
|
||||
) ||
|
||||
(((cursor.col)*NDlength) < distance)
|
||||
){
|
||||
(((cursor.col)*NDlength) < distance)) {
|
||||
cr();
|
||||
right(sp);
|
||||
}
|
||||
else{
|
||||
} else {
|
||||
while(cursor.col > sp->col) bs();
|
||||
}
|
||||
}
|
||||
return;
|
||||
}
|
||||
/*must change row */
|
||||
if (cursor.col - sp->col > (cursor.col >> 3)){
|
||||
if (cursor.col - sp->col > (cursor.col >> 3)) {
|
||||
if (cursor.col == 0)f = 0;
|
||||
else f = -1;
|
||||
}
|
||||
else f = cursor.col >> 3;
|
||||
if (((sp->line << 1) + 1 < cursor.line - f) && (HO != 0)){
|
||||
if (((sp->line << 1) + 1 < cursor.line - f) && (HO != 0)) {
|
||||
/*
|
||||
* home quicker than rlf:
|
||||
* (sp->line + f > cursor.line - sp->line)
|
||||
@@ -199,11 +252,11 @@ struct point *sp;
|
||||
gto(sp);
|
||||
return;
|
||||
}
|
||||
if (((sp->line << 1) > cursor.line + LINES+1 + f) && (LL != 0)){
|
||||
if (((sp->line << 1) > cursor.line + LINES+1 + f) && (LL != 0)) {
|
||||
/* home,rlf quicker than lf
|
||||
* (LINES+1 - sp->line + f < sp->line - cursor.line)
|
||||
*/
|
||||
if (cursor.line > f + 1){
|
||||
if (cursor.line > f + 1) {
|
||||
/* is home faster than wraparound lf?
|
||||
* (cursor.line + 20 - sp->line > 21 - sp->line + f)
|
||||
*/
|
||||
@@ -219,71 +272,26 @@ struct point *sp;
|
||||
gto(sp); /*can recurse since cursor.line = sp->line */
|
||||
}
|
||||
|
||||
right(sp)
|
||||
struct point *sp;
|
||||
void
|
||||
home()
|
||||
{
|
||||
int field,tfield;
|
||||
int tabcol,strlength;
|
||||
struct point z;
|
||||
|
||||
if (sp->col < cursor.col)
|
||||
printf("ERROR:right() can't move left\n");
|
||||
if(TA){ /* If No Tabs: can't send tabs because ttydrive
|
||||
* loses count with control characters.
|
||||
*/
|
||||
field = cursor.col >> 3;
|
||||
/*
|
||||
* This code is useful for a terminal which wraps around on backspaces.
|
||||
* (Mine does.) Unfortunately, this is not specified in termcap, and
|
||||
* most terminals don't work that way. (Of course, most terminals
|
||||
* have addressible cursors, too).
|
||||
*/
|
||||
if (BW && (CM == 0) &&
|
||||
((sp->col << 1) - field > (COLUMNS - 8) << 1 )
|
||||
){
|
||||
if (cursor.line == 0){
|
||||
outch('\n');
|
||||
}
|
||||
outch('\r');
|
||||
cursor.col = COLUMNS + 1;
|
||||
while(cursor.col > sp->col)bs();
|
||||
if (cursor.line != 0) outch('\n');
|
||||
if (HO != 0) {
|
||||
putpad(HO);
|
||||
cursor.col = cursor.line = 0;
|
||||
return;
|
||||
}
|
||||
|
||||
tfield = sp->col >> 3;
|
||||
|
||||
while (field < tfield){
|
||||
putpad(TA);
|
||||
cursor.col = ++field << 3;
|
||||
}
|
||||
tabcol = (cursor.col|7) + 1;
|
||||
strlength = (tabcol - sp->col)*BSlength + 1;
|
||||
/* length of sequence to overshoot */
|
||||
if (((sp->col - cursor.col)*NDlength > strlength) &&
|
||||
(tabcol < COLUMNS)
|
||||
){
|
||||
/*
|
||||
* Tab past and backup
|
||||
*/
|
||||
putpad(TA);
|
||||
cursor.col = (cursor.col | 7) + 1;
|
||||
while(cursor.col > sp->col)bs();
|
||||
}
|
||||
}
|
||||
while (sp->col > cursor.col){
|
||||
nd();
|
||||
}
|
||||
z.col = z.line = 0;
|
||||
move(&z);
|
||||
}
|
||||
|
||||
cr(){
|
||||
outch('\r');
|
||||
cursor.col = 0;
|
||||
}
|
||||
|
||||
clear(){
|
||||
void
|
||||
clear()
|
||||
{
|
||||
int i;
|
||||
|
||||
if (CL){
|
||||
if (CL) {
|
||||
putpad(CL);
|
||||
cursor.col=cursor.line=0;
|
||||
} else {
|
||||
@@ -295,100 +303,104 @@ clear(){
|
||||
}
|
||||
}
|
||||
|
||||
home(){
|
||||
void
|
||||
move(sp)
|
||||
struct point *sp;
|
||||
{
|
||||
int distance;
|
||||
int tabcol,ct;
|
||||
struct point z;
|
||||
|
||||
if(HO != 0){
|
||||
putpad(HO);
|
||||
cursor.col = cursor.line = 0;
|
||||
if (sp->line <0 || sp->col <0 || sp->col > COLUMNS) {
|
||||
print("move to [%d,%d]?",sp->line,sp->col);
|
||||
return;
|
||||
}
|
||||
z.col = z.line = 0;
|
||||
move(&z);
|
||||
}
|
||||
|
||||
ll(){
|
||||
int j,l;
|
||||
struct point z;
|
||||
|
||||
l = lcnt + 2;
|
||||
if(LL != NULL && LINES==l){
|
||||
putpad(LL);
|
||||
cursor.line = LINES-1;
|
||||
cursor.col = 0;
|
||||
if (sp->line >= LINES) {
|
||||
move(point(&z,sp->col,LINES-1));
|
||||
while(sp->line-- >= LINES)putchar('\n');
|
||||
return;
|
||||
}
|
||||
z.col = 0;
|
||||
z.line = l-1;
|
||||
move(&z);
|
||||
}
|
||||
|
||||
up(){
|
||||
putpad(UP);
|
||||
cursor.line--;
|
||||
}
|
||||
if (CM != 0) {
|
||||
char *cmstr = tgoto(CM, sp->col, sp->line);
|
||||
|
||||
down(){
|
||||
putpad(DO);
|
||||
cursor.line++;
|
||||
if (cursor.line >= LINES)cursor.line=LINES-1;
|
||||
}
|
||||
bs(){
|
||||
if (cursor.col > 0){
|
||||
putpad(BS);
|
||||
cursor.col--;
|
||||
CMlength = strlen(cmstr);
|
||||
if (cursor.line == sp->line) {
|
||||
distance = sp->col - cursor.col;
|
||||
if (distance == 0) return; /* Already there! */
|
||||
if (distance > 0) { /* Moving to the right */
|
||||
if (distance*NDlength < CMlength) {
|
||||
right(sp);
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
nd(){
|
||||
putpad(ND);
|
||||
cursor.col++;
|
||||
if (cursor.col == COLUMNS+1){
|
||||
cursor.line++;
|
||||
cursor.col = 0;
|
||||
if (cursor.line >= LINES)cursor.line=LINES-1;
|
||||
if (TA) {
|
||||
ct=sp->col&7;
|
||||
tabcol=(cursor.col|7)+1;
|
||||
do{
|
||||
ct++;
|
||||
tabcol=(tabcol|7)+1;
|
||||
}
|
||||
while(tabcol<sp->col);
|
||||
if (ct<CMlength) {
|
||||
right(sp);
|
||||
return;
|
||||
}
|
||||
}
|
||||
} else { /* Moving to the left */
|
||||
if (-distance*BSlength < CMlength) {
|
||||
gto(sp);
|
||||
return;
|
||||
}
|
||||
}
|
||||
if (sp->col < CMlength) {
|
||||
cr();
|
||||
right(sp);
|
||||
return;
|
||||
}
|
||||
/* No more optimizations on same row. */
|
||||
}
|
||||
distance = sp->col - cursor.col;
|
||||
distance = distance > 0 ?
|
||||
distance*NDlength : -distance * BSlength;
|
||||
if (distance < 0)
|
||||
print("ERROR: distance is negative: %d",distance);
|
||||
distance += abs(sp->line - cursor.line);
|
||||
if (distance >= CMlength) {
|
||||
putpad(cmstr);
|
||||
cursor.line = sp->line;
|
||||
cursor.col = sp->col;
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
/*
|
||||
* If we get here we have a terminal that can't cursor
|
||||
* address but has local motions or one which can cursor
|
||||
* address but can get there quicker with local motions.
|
||||
*/
|
||||
gto(sp);
|
||||
}
|
||||
|
||||
void
|
||||
pch(c)
|
||||
{
|
||||
outch(c);
|
||||
if(++cursor.col >= COLUMNS && AM) {
|
||||
if (++cursor.col >= COLUMNS && AM) {
|
||||
cursor.col = 0;
|
||||
++cursor.line;
|
||||
}
|
||||
}
|
||||
|
||||
aprintf(ps,st,v0,v1,v2,v3,v4,v5,v6,v7,v8,v9)
|
||||
struct point *ps;
|
||||
char *st;
|
||||
int v0,v1,v2,v3,v4,v5,v6,v7,v8,v9;
|
||||
|
||||
{
|
||||
struct point p;
|
||||
|
||||
p.line = ps->line+1; p.col = ps->col+1;
|
||||
move(&p);
|
||||
sprintf(str,st,v0,v1,v2,v3,v4,v5,v6,v7,v8,v9);
|
||||
pstring(str);
|
||||
}
|
||||
|
||||
printf(st,v0,v1,v2,v3,v4,v5,v6,v7,v8,v9)
|
||||
char *st;
|
||||
int v0,v1,v2,v3,v4,v5,v6,v7,v8,v9;
|
||||
{
|
||||
sprintf(str,st,v0,v1,v2,v3,v4,v5,v6,v7,v8,v9);
|
||||
pstring(str);
|
||||
}
|
||||
|
||||
void
|
||||
pstring(s)
|
||||
char *s;{
|
||||
char *s;
|
||||
{
|
||||
struct point z;
|
||||
int stcol;
|
||||
|
||||
stcol = cursor.col;
|
||||
while (s[0] != '\0'){
|
||||
switch (s[0]){
|
||||
while (s[0] != '\0') {
|
||||
switch (s[0]) {
|
||||
case '\n':
|
||||
move(point(&z,0,cursor.line+1));
|
||||
break;
|
||||
@@ -403,8 +415,8 @@ char *s;{
|
||||
case '\b':
|
||||
bs();
|
||||
break;
|
||||
case CTRL(g):
|
||||
outch(CTRL(g));
|
||||
case CTRL('g'):
|
||||
outch(CTRL('g'));
|
||||
break;
|
||||
default:
|
||||
if (s[0] < ' ')break;
|
||||
@@ -414,9 +426,37 @@ char *s;{
|
||||
}
|
||||
}
|
||||
|
||||
void
|
||||
aprint(struct point *ps, char *fmt, ...)
|
||||
{
|
||||
va_list ap;
|
||||
struct point p;
|
||||
|
||||
p.line = ps->line+1;
|
||||
p.col = ps->col+1;
|
||||
move(&p);
|
||||
va_start(ap, fmt);
|
||||
vsprintf(str, fmt, ap);
|
||||
va_end(ap);
|
||||
pstring(str);
|
||||
}
|
||||
|
||||
void
|
||||
print(char *fmt, ...)
|
||||
{
|
||||
va_list ap;
|
||||
|
||||
va_start(ap, fmt);
|
||||
vsprintf(str, fmt, ap);
|
||||
va_end(ap);
|
||||
pstring(str);
|
||||
}
|
||||
|
||||
void
|
||||
pchar(ps,ch)
|
||||
struct point *ps;
|
||||
char ch;{
|
||||
char ch;
|
||||
{
|
||||
struct point p;
|
||||
p.col = ps->col + 1; p.line = ps->line + 1;
|
||||
if (
|
||||
@@ -431,78 +471,57 @@ char ch;{
|
||||
(p.col == COLUMNS) &&
|
||||
(p.line < LINES-1)
|
||||
)
|
||||
)
|
||||
){
|
||||
)) {
|
||||
move(&p);
|
||||
pch(ch);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
outch(c)
|
||||
{
|
||||
putchar(c);
|
||||
}
|
||||
|
||||
putpad(str)
|
||||
char *str;
|
||||
{
|
||||
if (str)
|
||||
tputs(str, 1, outch);
|
||||
}
|
||||
baudrate()
|
||||
{
|
||||
|
||||
switch (orig.sg_ospeed){
|
||||
case B300:
|
||||
return(300);
|
||||
case B1200:
|
||||
return(1200);
|
||||
case B4800:
|
||||
return(4800);
|
||||
case B9600:
|
||||
return(9600);
|
||||
default:
|
||||
return(0);
|
||||
}
|
||||
}
|
||||
void
|
||||
delay(t)
|
||||
int t;
|
||||
{
|
||||
int k,j;
|
||||
|
||||
k = baudrate() * t / 300;
|
||||
for(j=0;j<k;j++){
|
||||
putchar(PC);
|
||||
}
|
||||
}
|
||||
|
||||
done()
|
||||
{
|
||||
cook();
|
||||
exit(0);
|
||||
usleep(t * 50);
|
||||
}
|
||||
|
||||
void
|
||||
cook()
|
||||
{
|
||||
delay(1);
|
||||
putpad(TE);
|
||||
putpad(KE);
|
||||
fflush(stdout);
|
||||
stty(0, &orig);
|
||||
#ifdef CROSS
|
||||
ioctl(0, TCSETAW, &origtty);
|
||||
#else
|
||||
ioctl(0, TIOCSETP, &origtty);
|
||||
#endif
|
||||
#ifdef TIOCSLTC
|
||||
ioctl(0, TIOCSLTC, &olttyc);
|
||||
#endif
|
||||
}
|
||||
|
||||
void
|
||||
done()
|
||||
{
|
||||
cook();
|
||||
exit(0);
|
||||
}
|
||||
|
||||
void
|
||||
raw()
|
||||
{
|
||||
stty(0, &new);
|
||||
#ifdef CROSS
|
||||
ioctl(0, TCSETAW, &newtty);
|
||||
#else
|
||||
ioctl(0, TIOCSETP, &newtty);
|
||||
#endif
|
||||
#ifdef TIOCSLTC
|
||||
ioctl(0, TIOCSLTC, &nlttyc);
|
||||
#endif
|
||||
}
|
||||
|
||||
int
|
||||
same(sp1,sp2)
|
||||
struct point *sp1, *sp2;
|
||||
{
|
||||
@@ -510,7 +529,8 @@ struct point *sp1, *sp2;
|
||||
return(0);
|
||||
}
|
||||
|
||||
struct point *point(ps,x,y)
|
||||
struct point *
|
||||
point(ps,x,y)
|
||||
struct point *ps;
|
||||
int x,y;
|
||||
{
|
||||
@@ -521,13 +541,11 @@ int x,y;
|
||||
|
||||
char *ap;
|
||||
|
||||
void
|
||||
getcap()
|
||||
{
|
||||
char *getenv();
|
||||
char *term;
|
||||
char *xPC;
|
||||
struct point z;
|
||||
int stop();
|
||||
|
||||
term = getenv("TERM");
|
||||
if (term==0) {
|
||||
@@ -598,8 +616,7 @@ getcap()
|
||||
|
||||
NDlength = strlen(ND);
|
||||
BSlength = strlen(BS);
|
||||
if ((CM == 0) &&
|
||||
(HO == 0 | UP==0 || BS==0 || ND==0)) {
|
||||
if ((CM == 0) && (HO == 0 || UP==0 || BS==0 || ND==0)) {
|
||||
fprintf(stderr, "Terminal must have addressible ");
|
||||
fprintf(stderr, "cursor or home + 4 local motions\n");
|
||||
exit(5);
|
||||
@@ -613,12 +630,22 @@ getcap()
|
||||
exit(5);
|
||||
}
|
||||
|
||||
gtty(0, &orig);
|
||||
new=orig;
|
||||
new.sg_flags &= ~(ECHO|CRMOD|XTABS);
|
||||
new.sg_flags |= CBREAK;
|
||||
signal(SIGINT,stop);
|
||||
ospeed = orig.sg_ospeed;
|
||||
#ifdef CROSS
|
||||
ioctl(0, TCGETA, &origtty);
|
||||
#else
|
||||
ioctl(0, TIOCGETP, &origtty);
|
||||
#endif
|
||||
newtty = origtty;
|
||||
#ifdef CRMOD
|
||||
newtty.sg_flags &= ~(ECHO|CRMOD|XTABS);
|
||||
newtty.sg_flags |= CBREAK;
|
||||
#else
|
||||
newtty.c_lflag &= ~(ICANON | ECHO);
|
||||
newtty.c_oflag &= ~ONLCR;
|
||||
newtty.c_cc[4] = 1; /* MIN */
|
||||
newtty.c_cc[5] = 2; /* TIME */
|
||||
#endif
|
||||
signal(SIGINT, stop);
|
||||
#ifdef TIOCGLTC
|
||||
ioctl(0, TIOCGLTC, &olttyc);
|
||||
nlttyc = olttyc;
|
||||
@@ -627,7 +654,10 @@ getcap()
|
||||
#endif
|
||||
raw();
|
||||
|
||||
if ((orig.sg_flags & XTABS) == XTABS) TA=0;
|
||||
#ifndef CROSS
|
||||
if ((origtty.sg_flags & XTABS) == XTABS)
|
||||
TA = 0;
|
||||
#endif
|
||||
putpad(KS);
|
||||
putpad(TI);
|
||||
point(&cursor,0,LINES-1);
|
||||
|
||||
File diff suppressed because it is too large
Load Diff
@@ -5,13 +5,17 @@
|
||||
*
|
||||
* @(#)snake.h 5.1 (Berkeley) 5/30/85
|
||||
*/
|
||||
|
||||
# include <stdio.h>
|
||||
# include <assert.h>
|
||||
# include <sys/types.h>
|
||||
#include <stdio.h>
|
||||
#include <assert.h>
|
||||
#include <sys/types.h>
|
||||
#include <sys/ioctl.h>
|
||||
#include <signal.h>
|
||||
#include <math.h>
|
||||
#ifdef CROSS
|
||||
# include <termios.h>
|
||||
#else
|
||||
# include <sgtty.h>
|
||||
# include <signal.h>
|
||||
# include <math.h>
|
||||
#endif
|
||||
|
||||
#define ESC '\033'
|
||||
|
||||
@@ -29,21 +33,41 @@ int lcnt, ccnt; /* user's idea of screen size */
|
||||
char xBC, PC;
|
||||
int AM, BW;
|
||||
char tbuf[1024], tcapbuf[128];
|
||||
char *tgetstr(), *tgoto();
|
||||
int Klength; /* length of KX strings */
|
||||
int chunk; /* amount of money given at a time */
|
||||
|
||||
#ifdef debug
|
||||
#define cashvalue (loot-penalty)/25
|
||||
# define cashvalue (loot-penalty)/25
|
||||
#else
|
||||
#define cashvalue chunk*(loot-penalty)/25
|
||||
# define cashvalue chunk*(loot-penalty)/25
|
||||
#endif
|
||||
|
||||
struct point {
|
||||
int col, line;
|
||||
};
|
||||
struct point cursor;
|
||||
struct sgttyb orig, new;
|
||||
struct sgttyb origtty, newtty;
|
||||
#ifdef TIOCLGET
|
||||
struct ltchars olttyc, nlttyc;
|
||||
#endif
|
||||
struct point *point();
|
||||
|
||||
#undef CTRL
|
||||
#define CTRL(x) (x - 'A' + 1)
|
||||
|
||||
struct point *point(struct point *ps, int x, int y);
|
||||
|
||||
void print(char *fmt, ...);
|
||||
void aprint(struct point *ps, char *fmt, ...);
|
||||
void move(struct point *sp);
|
||||
void stop(int sig);
|
||||
void pchar(struct point *ps, char ch);
|
||||
void putpad(char *str);
|
||||
void clear(void);
|
||||
void delay(int t);
|
||||
void cook(void);
|
||||
void raw(void);
|
||||
void ll(void);
|
||||
void done(void);
|
||||
void getcap(void);
|
||||
|
||||
int same(struct point *sp1, struct point *sp2);
|
||||
|
||||
@@ -3,18 +3,18 @@
|
||||
* All rights reserved. The Berkeley software License Agreement
|
||||
* specifies the terms and conditions for redistribution.
|
||||
*/
|
||||
|
||||
#ifndef lint
|
||||
static char sccsid[] = "@(#)snscore.c 5.1 (Berkeley) 5/30/85";
|
||||
#endif not lint
|
||||
|
||||
#include <stdio.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include <pwd.h>
|
||||
char *recfile = "/usr/games/lib/snakerawscores";
|
||||
#define MAXPLAYERS 256
|
||||
|
||||
struct passwd *getpwuid();
|
||||
char *malloc();
|
||||
#ifdef CROSS
|
||||
char *recfile = "/usr/local/games/snakerawscores";
|
||||
#else
|
||||
char *recfile = "/games/lib/snakerawscores";
|
||||
#endif
|
||||
|
||||
#define MAXPLAYERS 256
|
||||
|
||||
struct player {
|
||||
short uids;
|
||||
@@ -22,12 +22,11 @@ struct player {
|
||||
char *name;
|
||||
} players[MAXPLAYERS], temp;
|
||||
|
||||
main()
|
||||
int main()
|
||||
{
|
||||
char buf[80], cp;
|
||||
short uid, score;
|
||||
FILE *fd;
|
||||
int noplayers;
|
||||
int noplayers = 0;
|
||||
int i, j, notsorted;
|
||||
short whoallbest, allbest;
|
||||
char *q;
|
||||
@@ -39,10 +38,13 @@ main()
|
||||
exit(1);
|
||||
}
|
||||
printf("Snake players scores to date\n");
|
||||
fread(&whoallbest, sizeof(short), 1, fd);
|
||||
fread(&allbest, sizeof(short), 1, fd);
|
||||
if (! fread(&whoallbest, sizeof(short), 1, fd) ||
|
||||
! fread(&allbest, sizeof(short), 1, fd)) {
|
||||
printf("error reading scores\n");
|
||||
exit(2);
|
||||
}
|
||||
for (uid=2;;uid++) {
|
||||
if(fread(&score, sizeof(short), 1, fd) == 0)
|
||||
if(! fread(&score, sizeof(short), 1, fd))
|
||||
break;
|
||||
if (score > 0) {
|
||||
if (noplayers > MAXPLAYERS) {
|
||||
|
||||
Reference in New Issue
Block a user