1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
|
/* $NetBSD: robots.h,v 1.21 2009/07/20 06:39:06 dholland Exp $ */
/*
* 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. 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.
*
* @(#)robots.h 8.1 (Berkeley) 5/31/93
*/
#include <sys/cdefs.h>
#include <setjmp.h>
#include <stdbool.h>
#include <stdint.h>
/*
* miscellaneous constants
*/
#define Y_FIELDSIZE 23
#define X_FIELDSIZE 60
#define Y_SIZE 24
#define X_SIZE 80
#define MAXLEVELS 4
#define MAXROBOTS (MAXLEVELS * 10)
#define ROB_SCORE 10
#undef S_BONUS
#define S_BONUS (60 * ROB_SCORE)
#define Y_SCORE 21
#define X_SCORE (X_FIELDSIZE + 9)
#define Y_PROMPT (Y_FIELDSIZE - 1)
#define X_PROMPT (X_FIELDSIZE + 2)
#define MAXSCORES (Y_SIZE - 2)
#define MAXNAME 16
#define MS_NAME "Ten"
/*
* characters on screen
*/
#define ROBOT '+'
#define HEAP '*'
#define PLAYER '@'
/*
* type definitions
*/
typedef struct {
int y, x;
} COORD;
typedef struct {
uint32_t s_uid;
uint32_t s_score;
uint32_t s_auto;
uint32_t s_level;
char s_name[MAXNAME];
} SCORE;
/*
* global variables
*/
extern bool Dead, Full_clear, Jump, Newscore, Real_time, Running,
Teleport, Waiting, Was_bonus, Auto_bot;
#ifdef FANCY
extern bool Pattern_roll, Stand_still;
#endif
extern char Cnt_move, Field[Y_FIELDSIZE][X_FIELDSIZE], Run_ch;
extern const char *Next_move, *Move_list;
extern int Count, Level, Num_robots, Num_scrap, Num_scores,
Start_level, Wait_bonus, Num_games;
extern uint32_t Score;
extern COORD Max, Min, My_pos, Robots[], Scrap[];
extern jmp_buf End_move;
/*
* functions
*/
void add_score(int);
bool another(void);
char automove(void);
int cmp_sc(const void *, const void *);
bool do_move(int, int);
bool eaten(const COORD *);
void flush_in(void);
void get_move(void);
void init_field(void);
bool jumping(void);
void make_level(void);
void move_robots(int);
bool must_telep(void);
void play_level(void);
int query(const char *);
void quit(int) __dead;
void reset_count(void);
int rnd(int);
COORD *rnd_pos(void);
void score(int);
void set_name(SCORE *);
void show_score(void);
int sign(int);
void telmsg(int);
|
