-
Notifications
You must be signed in to change notification settings - Fork 0
/
conway.c
475 lines (453 loc) · 10.4 KB
/
conway.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
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
// Basic version of Conway's game of life
// Author: Byron Lambrou
#include <stdint.h>
#include <stdlib.h>
#include <stdio.h>
// Define a boolean variable type
//typedef enum { false, true } bool;
int i = 0;
int j = 0;
int k = 0;
// If 1, we modify world_calc
int is_world_calc = 1;
long tick_count = 0;
uint32_t *world_calc;
uint32_t *world_write;
const int number_of_rows = 32;
//for (i=0; i<number_of_rows; i++)
//{
// Initialize the rows to zero
// world_calc[i] = 0;
// world_write[i] = 0;
//}
void init()
{
world_calc = calloc( 32, sizeof(uint32_t) ); //Allocate 32 rows for world
world_write = calloc( 32, sizeof(uint32_t) ); //Allocate 32 rows for world
}
//Function pre declarations
int check_cell(int, int, int);
void force_write(int, int, int);
void display_world();
void update_draw_world ();
void memory_cleanup ();
void conway_test();
void printBits(size_t const, void const * const);
void on_tick();
void write_cell(int, int, int);
int main()
{
init();
// Main Game running loop
// while (1){
// //printf("%d \n", *(world_calc+1));
// display_world();
// }
conway_test();
memory_cleanup();
}
void on_tick()
{
// Function to be called once per tick.
// Every tick we should go through the world and run check_cell on each cell in
// world_write to determine the new value of world_calc's cells
// Then, we set world_write's values equal to world_calc's new value and display them
for (j=0; j<number_of_rows; j++)
{
for (k=0; k<32; k++){
write_cell( j, k, check_cell( j, k, is_world_calc) );
}
}
display_world();
is_world_calc = !(is_world_calc);
}
void conway_test()
{
force_write(1,2,is_world_calc);
force_write(2,2,is_world_calc);
force_write(3,2,is_world_calc);
display_world();
//write_cell(3, 3, 2);
//display_world();
printf("%i \n",check_cell(1, 2, is_world_calc));
printf("%i \n",check_cell(2, 2, is_world_calc));
printf("%i \n",check_cell(3, 2, is_world_calc));
printf("%i \n",check_cell(2, 1, is_world_calc));
on_tick();
printf("%i \n",check_cell(1, 2, is_world_calc));
printf("%i \n",check_cell(2, 2, is_world_calc));
printf("%i \n",check_cell(3, 2, is_world_calc));
printf("%i \n",check_cell(2, 1, is_world_calc));
on_tick();
printf("%i \n",check_cell(1, 2, is_world_calc));
printf("%i \n",check_cell(2, 2, is_world_calc));
printf("%i \n",check_cell(3, 2, is_world_calc));
printf("%i \n",check_cell(2, 1, is_world_calc));
on_tick();
}
void force_write(int x, int y, int world){
uint32_t* which_world;
if(world){
which_world=world_calc;
}
else{
which_world=world_write;
}
*(which_world + y) = *(which_world + y) | ( 1 << x);
}
void write_cell(int x, int y, int live_neighbors)
{
uint32_t* which_world_now;
uint32_t* other_world;
int was_dead;
if(is_world_calc){
which_world_now=world_calc;
other_world=world_write;
}
else{
which_world_now=world_write;
other_world=world_calc;
}
if(*(which_world_now + y) & ( 1 << x) ){
//printf("x=%i y=%i live_neighbor %i & was not dead \n",x,y, live_neighbors);
was_dead=0;
}
else{
//printf("x=%i y=%i live %i & was dead\n",x,y, live_neighbors);
was_dead=1;
}
if (live_neighbors == 3 && was_dead)
{
*(other_world + y) |= (*(which_world_now + y) | ( 1 << x));
}
if (live_neighbors == 2 && !was_dead){
*(other_world + y) |= (*(which_world_now + y) | ( 1 << x));
}
if ( (live_neighbors > 3 ) || (live_neighbors < 2 ))
{
*(other_world + y) &= ( 0xFFFFFFFF - ( 1 << x ));
}
}
int check_cell(int x, int y, int which_world)
{
// Checks what should happen to a cell in the next generation
// Returns 0 if cell should die, returns 1 if the cell should live
uint32_t cell_x = x;
uint32_t cell_y = y;
int return_val;
int live_neightbors_count = 0;
uint32_t *modified_world;
if (which_world){
modified_world=world_calc;
}
else{
modified_world=world_write;
}
// First, check x neighbors to the left and right
// Check left and right
switch (cell_x)
{
case 31 :
// X is in the right-most column, so wrap around
if( *( modified_world + cell_y ) & ( 1 << ( 30 )) )
{
live_neightbors_count++;
}
if( *( modified_world + cell_y ) & ( 1 ) )
{
live_neightbors_count++;
}
break;
case 1 :
// X is in the left-most column, so wrap around
if( *( modified_world + cell_y ) & ( 1 << 1 ) )
{
live_neightbors_count++;
}
// 2^ 31 = 2147483648 = 0x80000000
// Or 0b10000000000000000000000000000000
if( *( modified_world + cell_y ) & ( 0x80000000 ) )
{
live_neightbors_count++;
}
break;
default :
// check for neightbors normally
if( *( modified_world + cell_y ) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + cell_y ) & ( 1 << (cell_x -1) ) )
{
live_neightbors_count++;
}
break;
}
// Check up and down
switch (cell_y)
{
case 31 :
// Y is in the bottom-most column, so wrap around
if( *( modified_world ) & ( 1 << cell_x ) )
{
live_neightbors_count++;
}
if( *( modified_world + 30 ) & ( 1 << cell_x ) )
{
live_neightbors_count++;
}
break;
case 0 :
// Y is in the top-most column, so wrap around
if( *( modified_world + 1 ) & ( 1 << cell_x ) )
{
live_neightbors_count++;
}
// 2^ 31 = 2147483648
// Or 0b10000000000000000000000000000000
if( *( modified_world + 31 ) & ( 1 << cell_x ) )
{
live_neightbors_count++;
}
break;
default :
// check for neightbors normally
if( *( modified_world + (cell_y + 1 )) & ( 1 << cell_x ) )
{
live_neightbors_count++;
}
if( *(modified_world + (cell_y - 1 )) & ( 1 << cell_x ) )
{
live_neightbors_count++;
}
break;
}
// Check diagonals
switch (cell_x)
{
case 31 :
switch (cell_y)
{
case 31 :
if( *( modified_world ) & ( 1 << 30 ) )
{
live_neightbors_count++;
}
if( *( modified_world ) & ( 1 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 30 ) & ( 1 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 30 ) & ( 1 << 30 ) )
{
live_neightbors_count++;
}
break;
case 0 :
if( *( modified_world + 1) & ( 1 << 30 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 1) & ( 1 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 31 ) & ( 1 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 31 ) & ( 1 << 30 ) )
{
live_neightbors_count++;
}
break;
default :
if( *( modified_world + (cell_y + 1 )) & ( 1 << 30 ) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y + 1)) & ( 1 ) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y -1 )) & ( 1 ) )
{
live_neightbors_count++;
}
if( *(modified_world + ( cell_y - 1 )) & ( 1 << 30 ) )
{
live_neightbors_count++;
}
break;
}
case 0 :
switch (cell_y)
{
case 31:
if( *( modified_world ) & ( 1 << 31 ) )
{
live_neightbors_count++;
}
if( *( modified_world ) & ( 2 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 30 ) & ( 2 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 30 ) & ( 1 << 31 ) )
{
live_neightbors_count++;
}
break;
case 0 :
if( *( modified_world + 1) & ( 1 << 31 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 1) & ( 2 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 31 ) & ( 2 ) )
{
live_neightbors_count++;
}
if( *( modified_world + 31 ) & ( 1 << 31 ) )
{
live_neightbors_count++;
}
break;
default :
if( *( modified_world + (cell_y + 1)) & ( 1 << 31) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y + 1)) & ( 1 << 1 ) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y - 1 )) & ( 1 << 31 ) )
{
live_neightbors_count++;
}
if( *(modified_world + ( cell_y - 1 )) & ( 1 << 1) )
{
live_neightbors_count++;
}
break;
}
default :
switch (cell_y)
{
case 31:
if( *( modified_world + 30 ) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world ) & ( 1 << (cell_x - 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + 30 ) & ( 1 << (cell_x - 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
break;
case 0:
if( *( modified_world + 1 ) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + 31 ) & ( 1 << (cell_x - 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + 1 ) & ( 1 << (cell_x - 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + 31 ) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
break;
default :
if( *( modified_world + (cell_y + 1) ) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y - 1) ) & ( 1 << (cell_x - 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y + 1) ) & ( 1 << (cell_x - 1) ) )
{
live_neightbors_count++;
}
if( *( modified_world + (cell_y - 1) ) & ( 1 << (cell_x + 1) ) )
{
live_neightbors_count++;
}
break;
}
}
return live_neightbors_count;
}
void display_world ()
{
// Draws world to the screen
for (i=0; i<32; i++)
{
if(is_world_calc){
printBits(sizeof(uint32_t), (world_calc+i));
}
else{
printBits(sizeof(uint32_t), (world_write+i));
}
}
printf("--------------------------------\n");
}
void memory_cleanup ()
{
// Frees memory on the heap
free(world_write);
free(world_calc);
}
void neighbors_test () {
for (j=0; j<number_of_rows; j++)
{
for (k=0; k<32; k++){
int derp=check_cell( j, k, is_world_calc);
printf("%i", derp);
}
printf("\n");
}
printf("-------\n");
}
// This function taken from stackexchange
// assumes little endian
void printBits(size_t const size, void const * const ptr)
{
unsigned char *b = (unsigned char*) ptr;
unsigned char byte;
int i, j;
for (i=size-1;i>=0;i--)
{
for (j=7;j>=0;j--)
{
byte = b[i] & (1<<j);
byte >>= j;
printf("%u", byte);
}
}
puts("");
}