-
Notifications
You must be signed in to change notification settings - Fork 7
/
line.c
304 lines (270 loc) · 6.96 KB
/
line.c
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
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
/*
* IceBreaker
* Copyright (c) 2000-2020 Matthew Miller <[email protected]>
* http://www.mattdm.org/
*
* This program is free software; you can redistribute it and/or modify it
* under the terms of the GNU General Public License as published by the Free
* Software Foundation; either version 2 of the License, or (at your option)
* any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
* or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
* for more details.
*
* You should have received a copy of the GNU General Public License along
* with this program; if not, write to the Free Software Foundation, Inc.,
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
*/
#include <SDL.h>
#include "icebreaker.h"
#include "globals.h"
#include "line.h"
#include "laundry.h"
#include "grid.h"
#include "themes.h"
Line createline(int linenum)
{
Line l;
switch (linenum)
{
case 1:
l.id='1';
l.colorpointer=&(color.line1);
break;
case 2:
l.id='2';
l.colorpointer=&(color.line2);
break;
default:
l.id='L';
l.colorpointer=&(color.background);
break;
}
l.on=false;
l.dir=UP;
l.geom.x=0;
l.geom.y=0;
l.geom.w=BLOCKWIDTH;
l.geom.h=BLOCKHEIGHT;
l.mark=l.geom;
l.dead=false;
l.speedslower=false;
l.stuckcount=0;
return(l);
}
void startline(Line * l, LineDir d, int x, int y)
{
l->on=true;
l->dir=d;
l->stuckcount=0;
switch (d)
{
case UP:
l->geom.w=BLOCKWIDTH;
l->geom.h=1;
l->geom.x=x;
l->geom.y=y-1;
break;
case DOWN:
l->geom.w=BLOCKWIDTH;
l->geom.h=1;
l->geom.x=x;
l->geom.y=y;
break;
case LEFT:
l->geom.w=1;
l->geom.h=BLOCKHEIGHT;
l->geom.x=x-1;
l->geom.y=y;
break;
case RIGHT:
l->geom.w=1;
l->geom.h=BLOCKHEIGHT;
l->geom.x=x;
l->geom.y=y;
break;
}
l->mark=l->geom;
}
int moveline(Line * l)
{
int finish=false;
char check1;
char check2;
markgrid(l->mark.x,l->mark.y,l->mark.w,l->mark.h,l->id);
SDL_FillRect(screen,&(l->mark),*(l->colorpointer));
soil(l->mark);
switch (l->dir)
{
case UP:
check1=grid[l->geom.x][l->geom.y-1];
check2=grid[l->geom.x+BLOCKWIDTH-1][l->geom.y-1];
break;
case DOWN:
check1=grid[l->geom.x][l->geom.y+l->geom.h];
check2=grid[l->geom.x+BLOCKWIDTH-1][l->geom.y+l->geom.h];
break;
case LEFT:
check1=grid[l->geom.x-1][l->geom.y];
check2=grid[l->geom.x-1][l->geom.y+BLOCKHEIGHT-1];
break;
case RIGHT:
check1=grid[l->geom.x+l->geom.w][l->geom.y];
check2=grid[l->geom.x+l->geom.w][l->geom.y+BLOCKHEIGHT-1];
break;
default: // this will never happen. really.
fprintf(stderr,"Line has no direction. That shouldn't have happened.\n");
check1='!';
check2='!';
break;
}
if (check1 == ' ' && check2 == ' ')
{ // next space is empty
switch (l->dir)
{
case UP:
l->geom.y--;
l->geom.h++;
l->mark.y--;
l->mark.h=1;
break;
case DOWN:
l->geom.h++; // increase length of line -- top stays same
l->mark.y+=l->mark.h;
l->mark.h=1;
break;
case LEFT:
l->geom.x--;
l->geom.w++;
l->mark.x--;
l->mark.w=1;
break;
case RIGHT:
l->geom.w++; // increase width of line -- left side stays same
l->mark.x+=l->mark.w;
l->mark.w=1;
break;
}
}
else if (check1 == '*' || check2 == '*')
{ // hit a penguin. kills line.
l->dead=true;
}
else if (check1 == '1' || check2 == '1' || check1 == '2' || check2 == '2')
{
if (l->stuckcount>LINEMAXSTUCK)
{
// FIX -- should play sound when this happens, to
// let users know that this isn't a mistake.
finish=true;
}
else
{
l->stuckcount++;
// FIX: kludge-o-rama!!
// this could work around the irritating thing where
// a line gets started 'on top' of another line. but it
// is totally repairing the symptom, not the bug. *sigh*
//if (l->geom.w==1 || l->geom.h==1) finish=true;
}
}
else
{ // hit something else
finish=true;
}
if (finish)
{
markgrid(l->mark.x,l->mark.y,l->mark.w,l->mark.h,l->id);
SDL_FillRect(screen,&(l->mark),*(l->colorpointer));
soil(l->mark);
finishline(l);
return(1);
}
return(0);
}
void finishline(Line * l)
{
int i;
int quick1=false;
int quick2=false;
l->on=false;
//printwholegrid();
switch (l->dir)
{
case DOWN:
// falls through.
case UP:
markgrid(l->geom.x,l->geom.y,l->geom.w,l->geom.h,'|');
SDL_FillRect(screen,&l->geom,color.background);
soil(l->geom);
// scan along edges to quickly determine if this
// is going to be complicated.
quick1=true; quick2=true;
for (i=l->geom.y+BLOCKHEIGHT/2;i<l->geom.y+l->geom.h;i++)
{
if (grid[l->geom.x-1][i] != ' ' && grid[l->geom.x-1][i] != '*') quick1=false;
if (grid[l->geom.x+BLOCKWIDTH][i] != ' ' && grid[l->geom.x+BLOCKWIDTH][i] != '*') quick2=false;
}
//printf("Quick %d %d\n",quick1,quick2);
checkempty(l->geom.x-BLOCKWIDTH/2,l->geom.y+BLOCKHEIGHT/2);
checkempty(l->geom.x+BLOCKWIDTH+BLOCKWIDTH/2/2,l->geom.y+BLOCKHEIGHT/2);
if (!quick1)
for (i=l->geom.y+BLOCKHEIGHT/2+BLOCKHEIGHT;i<l->geom.y+l->geom.h;i+=BLOCKHEIGHT)
checkempty(l->geom.x-BLOCKWIDTH/2,i);
if (!quick2)
for (i=l->geom.y+BLOCKHEIGHT/2+BLOCKHEIGHT;i<l->geom.y+l->geom.h;i+=BLOCKHEIGHT)
checkempty(l->geom.x+BLOCKWIDTH+BLOCKWIDTH/2,i);
break;
case RIGHT:
// falls through
case LEFT:
markgrid(l->geom.x,l->geom.y,l->geom.w,l->geom.h,'-');
SDL_FillRect(screen,&l->geom,color.background);
soil(l->geom);
// scan along edges to quickly determine if this
// is going to be complicated.
quick1=true; quick2=true;
for (i=l->geom.x+BLOCKWIDTH/2;i<l->geom.x+l->geom.w;i++)
{
if (grid[i][l->geom.y-1] != ' ' && grid[i][l->geom.y-1] != '*') quick1=false;
if (grid[i][l->geom.y+BLOCKHEIGHT] != ' ' && grid[i][l->geom.y+BLOCKHEIGHT] != '*') quick2=false;
}
//printf("Quick %d %d\n",quick1,quick2);
checkempty(l->geom.x+BLOCKWIDTH/2,l->geom.y-BLOCKHEIGHT/2);
checkempty(l->geom.x+BLOCKWIDTH/2,l->geom.y+BLOCKHEIGHT+BLOCKHEIGHT/2);
if (!quick1)
for (i=l->geom.x+BLOCKWIDTH/2+BLOCKWIDTH;i<l->geom.x+l->geom.w;i+=BLOCKWIDTH)
checkempty(i,l->geom.y-BLOCKHEIGHT/2);
if (!quick2)
for (i=l->geom.x+BLOCKWIDTH/2+BLOCKWIDTH;i<l->geom.x+l->geom.w;i+=BLOCKWIDTH)
checkempty(i,l->geom.y+BLOCKHEIGHT+BLOCKHEIGHT/2);
break;
}
}
void killline(Line * l)
{
l->on=false;
l->dead=false;
switch (l->dir)
{
case DOWN:
// falls through.
case UP:
markgrid(l->geom.x,l->geom.y,l->geom.w,l->geom.h,' ');
// FIXORAMA
SDL_BlitSurface(gridsave,&l->geom, screen, &l->geom);
soil(l->geom);
break;
case RIGHT:
// falls through
case LEFT:
markgrid(l->geom.x,l->geom.y,l->geom.w,l->geom.h,' ');
// FIXORAMA
SDL_BlitSurface(gridsave,&l->geom, screen, &l->geom);
soil(l->geom);
break;
}
}