1 /* -*- Mode: C; tab-width: 4 -*- */
2 /* demon --- David Griffeath's cellular automata */
5 static const char sccsid[] = "@(#)demon.c 5.00 2000/11/01 xlockmore";
9 * Copyright (c) 1995 by David Bagley.
11 * Permission to use, copy, modify, and distribute this software and its
12 * documentation for any purpose and without fee is hereby granted,
13 * provided that the above copyright notice appear in all copies and that
14 * both that copyright notice and this permission notice appear in
15 * supporting documentation.
17 * This file is provided AS IS with no warranties of any kind. The author
18 * shall have no liability with respect to the infringement of copyrights,
19 * trade secrets or any patents by this file or any part thereof. In no
20 * event will the author be liable for any lost revenue or profits or
21 * other special, indirect and consequential damages.
24 * 01-Nov-2000: Allocation checks
25 * 10-May-1997: Compatible with xscreensaver
26 * 16-Apr-1997: -neighbors 3, 9 (not sound mathematically), 12, and 8 added
27 * 30-May-1996: Ron Hitchens <ron@idiom.com>
28 * Fixed memory management that caused leaks
29 * 14-Apr-1996: -neighbors 6 runtime-time option added
30 * 21-Aug-1995: Coded from A.K. Dewdney's "Computer Recreations", Scientific
31 * American Magazine" Aug 1989 pp 102-105. Also very similar
32 * to hodgepodge machine described in A.K. Dewdney's "Computer
33 * Recreations", Scientific American Magazine" Aug 1988
34 * pp 104-107. Also used life.c as a guide.
38 * A cellular universe of 4 phases debris, droplets, defects, and demons.
42 Grid Number of Neighbors
43 ---- ------------------
55 # define DEFAULTS "*delay: 50000 \n" \
60 "*fpsSolid: true \n" \
61 "*ignoreRotation: True \n" \
63 # define UNIFORM_COLORS
64 # include "xlockmore.h" /* in xscreensaver distribution */
65 #else /* STANDALONE */
66 # include "xlock.h" /* in xlockmore distribution */
67 #endif /* STANDALONE */
73 * neighbors of 0 randomizes it between 3, 4, 6, 8, 9, and 12.
75 #define DEF_NEIGHBORS "0" /* choose random value */
79 static XrmOptionDescRec opts[] =
81 {"-neighbors", ".demon.neighbors", XrmoptionSepArg, 0}
84 static argtype vars[] =
86 {&neighbors, "neighbors", "Neighbors", DEF_NEIGHBORS, t_Int}
88 static OptionStruct desc[] =
90 {"-neighbors num", "squares 4 or 8, hexagons 6, triangles 3, 9 or 12"}
93 ENTRYPOINT ModeSpecOpt demon_opts =
94 {sizeof opts / sizeof opts[0], opts, sizeof vars / sizeof vars[0], vars, desc};
97 ModStruct demon_description =
98 {"demon", "init_demon", "draw_demon", "release_demon",
99 "refresh_demon", "init_demon", (char *) NULL, &demon_opts,
100 50000, 0, 1000, -7, 64, 1.0, "",
101 "Shows Griffeath's cellular automata", 0, NULL};
105 #define DEMONBITS(n,w,h)\
106 if ((dp->pixmaps[dp->init_bits]=\
107 XCreatePixmapFromBitmapData(display,window,(char *)n,w,h,1,0,1))==None){\
108 free_demon(display,dp); return;} else {dp->init_bits++;}
110 #define REDRAWSTEP 2000 /* How many cells to draw per cycle */
112 #define MINGRIDSIZE 24
114 #define NEIGHBORKINDS 6
116 /* Singly linked list */
117 typedef struct _CellList {
119 struct _CellList *next;
130 int redrawing, redrawpos;
133 unsigned char *oldcell, *newcell;
137 Pixmap pixmaps[NUMSTIPPLES - 1];
140 XPoint triangle[2][3];
144 static char plots[2][NEIGHBORKINDS] =
146 {3, 4, 6, 8, 9, 12}, /* Neighborhoods */
147 {12, 16, 18, 20, 22, 24} /* Number of states */
150 static demonstruct *demons = (demonstruct *) NULL;
153 drawcell(ModeInfo * mi, int col, int row, unsigned char state)
155 demonstruct *dp = &demons[MI_SCREEN(mi)];
159 XSetForeground(MI_DISPLAY(mi), MI_GC(mi), MI_BLACK_PIXEL(mi));
161 } else if (MI_NPIXELS(mi) >= NUMSTIPPLES) {
162 XSetForeground(MI_DISPLAY(mi), MI_GC(mi),
163 MI_PIXEL(mi, (((int) state - 1) * MI_NPIXELS(mi) /
164 (dp->states - 1)) % MI_NPIXELS(mi)));
169 gcv.stipple = dp->pixmaps[(state - 1) % (NUMSTIPPLES - 1)];
170 #endif /* DO_STIPPLE */
171 gcv.foreground = MI_WHITE_PIXEL(mi);
172 gcv.background = MI_BLACK_PIXEL(mi);
173 XChangeGC(MI_DISPLAY(mi), dp->stippledGC,
174 GCStipple | GCForeground | GCBackground, &gcv);
177 if (dp->neighbors == 6) {
178 int ccol = 2 * col + !(row & 1), crow = 2 * row;
180 dp->shape.hexagon[0].x = dp->xb + ccol * dp->xs;
181 dp->shape.hexagon[0].y = dp->yb + crow * dp->ys;
182 if (dp->xs == 1 && dp->ys == 1)
183 XDrawPoint(MI_DISPLAY(mi), MI_WINDOW(mi),
184 gc, dp->shape.hexagon[0].x, dp->shape.hexagon[0].y);
186 XFillPolygon(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
187 dp->shape.hexagon, 6, Convex, CoordModePrevious);
188 } else if (dp->neighbors == 4 || dp->neighbors == 8) {
189 XFillRectangle(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
190 dp->xb + dp->xs * col, dp->yb + dp->ys * row,
191 dp->xs - (dp->xs > 3), dp->ys - (dp->ys > 3));
193 int orient = (col + row) % 2; /* O left 1 right */
195 dp->shape.triangle[orient][0].x = dp->xb + col * dp->xs;
196 dp->shape.triangle[orient][0].y = dp->yb + row * dp->ys;
197 if (dp->xs <= 3 || dp->ys <= 3)
198 XDrawPoint(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
199 ((orient) ? -1 : 1) + dp->shape.triangle[orient][0].x,
200 dp->shape.triangle[orient][0].y);
203 dp->shape.triangle[orient][0].x += (dp->xs / 2 - 1);
205 dp->shape.triangle[orient][0].x -= (dp->xs / 2 - 1);
206 XFillPolygon(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
207 dp->shape.triangle[orient], 3, Convex, CoordModePrevious);
214 addtolist(ModeInfo * mi, int col, int row, unsigned char state)
216 demonstruct *dp = &demons[MI_SCREEN(mi)];
219 current = dp->cellList[state];
220 if ((dp->cellList[state] = (CellList *)
221 malloc(sizeof (CellList))) == NULL) {
224 dp->cellList[state]->pt.x = col;
225 dp->cellList[state]->pt.y = row;
226 dp->cellList[state]->next = current;
233 free_state(demonstruct * dp, int state)
237 while (dp->cellList[state]) {
238 current = dp->cellList[state];
239 dp->cellList[state] = dp->cellList[state]->next;
240 (void) free((void *) current);
242 dp->cellList[state] = (CellList *) NULL;
243 if (dp->ncells != NULL)
244 dp->ncells[state] = 0;
249 free_list(demonstruct * dp)
253 for (state = 0; state < dp->states; state++)
254 free_state(dp, state);
255 (void) free((void *) dp->cellList);
256 dp->cellList = (CellList **) NULL;
260 free_struct(demonstruct * dp)
262 if (dp->cellList != NULL) {
265 if (dp->ncells != NULL) {
266 (void) free((void *) dp->ncells);
267 dp->ncells = (int *) NULL;
269 if (dp->oldcell != NULL) {
270 (void) free((void *) dp->oldcell);
271 dp->oldcell = (unsigned char *) NULL;
273 if (dp->newcell != NULL) {
274 (void) free((void *) dp->newcell);
275 dp->newcell = (unsigned char *) NULL;
280 free_demon(Display *display, demonstruct *dp)
284 if (dp->stippledGC != None) {
285 XFreeGC(display, dp->stippledGC);
286 dp->stippledGC = None;
288 for (shade = 0; shade < dp->init_bits; shade++) {
289 XFreePixmap(display, dp->pixmaps[shade]);
296 draw_state(ModeInfo * mi, int state)
298 demonstruct *dp = &demons[MI_SCREEN(mi)];
304 XSetForeground(MI_DISPLAY(mi), MI_GC(mi), MI_BLACK_PIXEL(mi));
306 } else if (MI_NPIXELS(mi) >= NUMSTIPPLES) {
307 XSetForeground(MI_DISPLAY(mi), MI_GC(mi),
308 MI_PIXEL(mi, (((int) state - 1) * MI_NPIXELS(mi) /
309 (dp->states - 1)) % MI_NPIXELS(mi)));
315 gcv.stipple = dp->pixmaps[(state - 1) % (NUMSTIPPLES - 1)];
316 #endif /* DO_STIPPLE */
317 gcv.foreground = MI_WHITE_PIXEL(mi);
318 gcv.background = MI_BLACK_PIXEL(mi);
319 XChangeGC(MI_DISPLAY(mi), dp->stippledGC,
320 GCStipple | GCForeground | GCBackground, &gcv);
323 if (dp->neighbors == 6) { /* Draw right away, slow */
324 current = dp->cellList[state];
326 int col, row, ccol, crow;
330 ccol = 2 * col + !(row & 1), crow = 2 * row;
331 dp->shape.hexagon[0].x = dp->xb + ccol * dp->xs;
332 dp->shape.hexagon[0].y = dp->yb + crow * dp->ys;
333 if (dp->xs == 1 && dp->ys == 1)
334 XDrawPoint(MI_DISPLAY(mi), MI_WINDOW(mi),
335 gc, dp->shape.hexagon[0].x, dp->shape.hexagon[0].y);
337 XFillPolygon(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
338 dp->shape.hexagon, 6, Convex, CoordModePrevious);
339 current = current->next;
341 } else if (dp->neighbors == 4 || dp->neighbors == 8) {
342 /* Take advantage of XDrawRectangles */
345 /* Create Rectangle list from part of the cellList */
346 if ((rects = (XRectangle *) malloc(dp->ncells[state] *
347 sizeof (XRectangle))) == NULL) {
350 current = dp->cellList[state];
352 rects[ncells].x = dp->xb + current->pt.x * dp->xs;
353 rects[ncells].y = dp->yb + current->pt.y * dp->ys;
354 rects[ncells].width = dp->xs - (dp->xs > 3);
355 rects[ncells].height = dp->ys - (dp->ys > 3);
356 current = current->next;
359 /* Finally get to draw */
360 XFillRectangles(MI_DISPLAY(mi), MI_WINDOW(mi), gc, rects, ncells);
361 /* Free up rects list and the appropriate part of the cellList */
362 (void) free((void *) rects);
364 current = dp->cellList[state];
366 int col, row, orient;
370 orient = (col + row) % 2; /* O left 1 right */
371 dp->shape.triangle[orient][0].x = dp->xb + col * dp->xs;
372 dp->shape.triangle[orient][0].y = dp->yb + row * dp->ys;
373 if (dp->xs <= 3 || dp->ys <= 3)
374 XDrawPoint(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
375 ((orient) ? -1 : 1) + dp->shape.triangle[orient][0].x,
376 dp->shape.triangle[orient][0].y);
379 dp->shape.triangle[orient][0].x += (dp->xs / 2 - 1);
381 dp->shape.triangle[orient][0].x -= (dp->xs / 2 - 1);
382 XFillPolygon(MI_DISPLAY(mi), MI_WINDOW(mi), gc,
383 dp->shape.triangle[orient], 3, Convex, CoordModePrevious);
385 current = current->next;
388 free_state(dp, state);
393 RandomSoup(ModeInfo * mi)
395 demonstruct *dp = &demons[MI_SCREEN(mi)];
396 int row, col, mrow = 0;
398 for (row = 0; row < dp->nrows; ++row) {
399 for (col = 0; col < dp->ncols; ++col) {
400 dp->oldcell[col + mrow] =
401 (unsigned char) LRAND() % ((unsigned char) dp->states);
402 if (!addtolist(mi, col, row, dp->oldcell[col + mrow]))
403 return; /* sparse soup */
410 init_demon (ModeInfo * mi)
412 Display *display = MI_DISPLAY(mi);
413 int size = MI_SIZE(mi), nk;
416 if (demons == NULL) {
417 if ((demons = (demonstruct *) calloc(MI_NUM_SCREENS(mi),
418 sizeof (demonstruct))) == NULL)
421 dp = &demons[MI_SCREEN(mi)];
426 if (MI_NPIXELS(mi) < NUMSTIPPLES) {
427 Window window = MI_WINDOW(mi);
428 if (dp->stippledGC == None) {
431 gcv.fill_style = FillOpaqueStippled;
432 if ((dp->stippledGC = XCreateGC(display, window,
433 GCFillStyle, &gcv)) == None) {
434 free_demon(display, dp);
438 if (dp->init_bits == 0) {
441 for (i = 1; i < NUMSTIPPLES; i++) {
442 DEMONBITS(stipples[i], STIPPLESIZE, STIPPLESIZE);
446 #endif /* DO_STIPPLE */
450 jwxyz_XSetAntiAliasing (MI_DISPLAY(mi), MI_GC(mi), False);
453 for (nk = 0; nk < NEIGHBORKINDS; nk++) {
454 if (neighbors == plots[0][nk]) {
455 dp->neighbors = plots[0][nk];
458 if (nk == NEIGHBORKINDS - 1) {
459 nk = NRAND(NEIGHBORKINDS);
460 dp->neighbors = plots[0][nk];
465 dp->states = MI_COUNT(mi);
466 if (dp->states < -MINSTATES)
467 dp->states = NRAND(-dp->states - MINSTATES + 1) + MINSTATES;
468 else if (dp->states < MINSTATES)
469 dp->states = plots[1][nk];
470 if ((dp->cellList = (CellList **) calloc(dp->states,
471 sizeof (CellList *))) == NULL) {
472 free_demon(display, dp);
475 if ((dp->ncells = (int *) calloc(dp->states, sizeof (int))) == NULL) {
476 free_demon(display, dp);
482 dp->width = MI_WIDTH(mi);
483 dp->height = MI_HEIGHT(mi);
485 if (dp->neighbors == 6) {
486 int nccols, ncrows, i;
493 dp->ys = NRAND(MIN(-size, MAX(MINSIZE, MIN(dp->width, dp->height) /
494 MINGRIDSIZE)) - MINSIZE + 1) + MINSIZE;
495 else if (size < MINSIZE) {
497 dp->ys = MAX(MINSIZE, MIN(dp->width, dp->height) / MINGRIDSIZE);
501 dp->ys = MIN(size, MAX(MINSIZE, MIN(dp->width, dp->height) /
504 nccols = MAX(dp->width / dp->xs - 2, 2);
505 ncrows = MAX(dp->height / dp->ys - 1, 4);
506 dp->ncols = nccols / 2;
507 dp->nrows = 2 * (ncrows / 4);
508 dp->xb = (dp->width - dp->xs * nccols) / 2 + dp->xs / 2;
509 dp->yb = (dp->height - dp->ys * (ncrows / 2) * 2) / 2 + dp->ys - 2;
510 for (i = 0; i < 6; i++) {
511 dp->shape.hexagon[i].x = (dp->xs - 1) * hexagonUnit[i].x;
512 dp->shape.hexagon[i].y = ((dp->ys - 1) * hexagonUnit[i].y / 2) * 4 / 3;
514 } else if (dp->neighbors == 4 || dp->neighbors == 8) {
516 dp->ys = NRAND(MIN(-size, MAX(MINSIZE, MIN(dp->width, dp->height) /
517 MINGRIDSIZE)) - MINSIZE + 1) + MINSIZE;
518 else if (size < MINSIZE) {
520 dp->ys = MAX(MINSIZE, MIN(dp->width, dp->height) / MINGRIDSIZE);
524 dp->ys = MIN(size, MAX(MINSIZE, MIN(dp->width, dp->height) /
527 dp->ncols = MAX(dp->width / dp->xs, 2);
528 dp->nrows = MAX(dp->height / dp->ys, 2);
529 dp->xb = (dp->width - dp->xs * dp->ncols) / 2;
530 dp->yb = (dp->height - dp->ys * dp->nrows) / 2;
539 dp->ys = NRAND(MIN(-size, MAX(MINSIZE, MIN(dp->width, dp->height) /
540 MINGRIDSIZE)) - MINSIZE + 1) + MINSIZE;
541 else if (size < MINSIZE) {
543 dp->ys = MAX(MINSIZE, MIN(dp->width, dp->height) / MINGRIDSIZE);
547 dp->ys = MIN(size, MAX(MINSIZE, MIN(dp->width, dp->height) /
549 dp->xs = (int) (1.52 * dp->ys);
550 dp->ncols = (MAX(dp->width / dp->xs - 1, 2) / 2) * 2;
551 dp->nrows = (MAX(dp->height / dp->ys - 1, 2) / 2) * 2;
552 dp->xb = (dp->width - dp->xs * dp->ncols) / 2 + dp->xs / 2;
553 dp->yb = (dp->height - dp->ys * dp->nrows) / 2 + dp->ys / 2;
554 for (orient = 0; orient < 2; orient++) {
555 for (i = 0; i < 3; i++) {
556 dp->shape.triangle[orient][i].x =
557 (dp->xs - 2) * triangleUnit[orient][i].x;
558 dp->shape.triangle[orient][i].y =
559 (dp->ys - 2) * triangleUnit[orient][i].y;
566 if ((dp->oldcell = (unsigned char *)
567 malloc(dp->ncols * dp->nrows * sizeof (unsigned char))) == NULL) {
568 free_demon(display, dp);
572 if ((dp->newcell = (unsigned char *)
573 malloc(dp->ncols * dp->nrows * sizeof (unsigned char))) == NULL) {
574 free_demon(display, dp);
582 draw_demon (ModeInfo * mi)
584 int i, j, k, l, mj = 0, ml;
589 dp = &demons[MI_SCREEN(mi)];
590 if (dp->cellList == NULL)
593 MI_IS_DRAWN(mi) = True;
594 if (dp->state >= dp->states) {
595 (void) memcpy((char *) dp->newcell, (char *) dp->oldcell,
596 dp->ncols * dp->nrows * sizeof (unsigned char));
598 if (dp->neighbors == 6) {
599 for (j = 0; j < dp->nrows; j++) {
600 for (i = 0; i < dp->ncols; i++) {
603 k = (i + 1 == dp->ncols) ? 0 : i + 1;
606 l = (!j) ? dp->nrows - 1 : j - 1;
608 if (dp->oldcell[k + ml] ==
609 (int) (dp->oldcell[i + mj] + 1) % dp->states)
610 dp->newcell[i + mj] = dp->oldcell[k + ml];
612 k = (i + 1 == dp->ncols) ? 0 : i + 1;
614 if (dp->oldcell[k + ml] ==
615 (int) (dp->oldcell[i + mj] + 1) % dp->states)
616 dp->newcell[i + mj] = dp->oldcell[k + ml];
619 k = (i + 1 == dp->ncols) ? 0 : i + 1;
622 l = (j + 1 == dp->nrows) ? 0 : j + 1;
624 if (dp->oldcell[k + ml] ==
625 (int) (dp->oldcell[i + mj] + 1) % dp->states)
626 dp->newcell[i + mj] = dp->oldcell[k + ml];
629 k = (!i) ? dp->ncols - 1 : i - 1;
632 l = (j + 1 == dp->nrows) ? 0 : j + 1;
634 if (dp->oldcell[k + ml] ==
635 (int) (dp->oldcell[i + mj] + 1) % dp->states)
636 dp->newcell[i + mj] = dp->oldcell[k + ml];
638 k = (!i) ? dp->ncols - 1 : i - 1;
640 if (dp->oldcell[k + ml] ==
641 (int) (dp->oldcell[i + mj] + 1) % dp->states)
642 dp->newcell[i + mj] = dp->oldcell[k + ml];
645 k = (!i) ? dp->ncols - 1 : i - 1;
648 l = (!j) ? dp->nrows - 1 : j - 1;
650 if (dp->oldcell[k + ml] ==
651 (int) (dp->oldcell[i + mj] + 1) % dp->states)
652 dp->newcell[i + mj] = dp->oldcell[k + ml];
656 } else if (dp->neighbors == 4 || dp->neighbors == 8) {
657 for (j = 0; j < dp->nrows; j++) {
658 for (i = 0; i < dp->ncols; i++) {
661 l = (!j) ? dp->nrows - 1 : j - 1;
663 if (dp->oldcell[k + ml] ==
664 (int) (dp->oldcell[i + mj] + 1) % dp->states)
665 dp->newcell[i + mj] = dp->oldcell[k + ml];
667 k = (i + 1 == dp->ncols) ? 0 : i + 1;
669 if (dp->oldcell[k + ml] ==
670 (int) (dp->oldcell[i + mj] + 1) % dp->states)
671 dp->newcell[i + mj] = dp->oldcell[k + ml];
674 l = (j + 1 == dp->nrows) ? 0 : j + 1;
676 if (dp->oldcell[k + ml] ==
677 (int) (dp->oldcell[i + mj] + 1) % dp->states)
678 dp->newcell[i + mj] = dp->oldcell[k + ml];
680 k = (!i) ? dp->ncols - 1 : i - 1;
683 if (dp->oldcell[k + ml] ==
684 (int) (dp->oldcell[i + mj] + 1) % dp->states)
685 dp->newcell[i + mj] = dp->oldcell[k + ml];
689 if (dp->neighbors == 8) {
691 for (j = 0; j < dp->nrows; j++) {
692 for (i = 0; i < dp->ncols; i++) {
694 k = (i + 1 == dp->ncols) ? 0 : i + 1;
695 l = (!j) ? dp->nrows - 1 : j - 1;
697 if (dp->oldcell[k + ml] ==
698 (int) (dp->oldcell[i + mj] + 1) % dp->states)
699 dp->newcell[i + mj] = dp->oldcell[k + ml];
701 k = (i + 1 == dp->ncols) ? 0 : i + 1;
702 l = (j + 1 == dp->nrows) ? 0 : j + 1;
704 if (dp->oldcell[k + ml] ==
705 (int) (dp->oldcell[i + mj] + 1) % dp->states)
706 dp->newcell[i + mj] = dp->oldcell[k + ml];
708 k = (!i) ? dp->ncols - 1 : i - 1;
709 l = (j + 1 == dp->nrows) ? 0 : j + 1;
711 if (dp->oldcell[k + ml] ==
712 (int) (dp->oldcell[i + mj] + 1) % dp->states)
713 dp->newcell[i + mj] = dp->oldcell[k + ml];
715 k = (!i) ? dp->ncols - 1 : i - 1;
716 l = (!j) ? dp->nrows - 1 : j - 1;
718 if (dp->oldcell[k + ml] ==
719 (int) (dp->oldcell[i + mj] + 1) % dp->states)
720 dp->newcell[i + mj] = dp->oldcell[k + ml];
725 } else if (dp->neighbors == 3 || dp->neighbors == 9 ||
726 dp->neighbors == 12) {
727 for (j = 0; j < dp->nrows; j++) {
728 for (i = 0; i < dp->ncols; i++) {
729 if ((i + j) % 2) { /* right */
731 k = (!i) ? dp->ncols - 1 : i - 1;
733 if (dp->oldcell[k + ml] ==
734 (int) (dp->oldcell[i + mj] + 1) % dp->states)
735 dp->newcell[i + mj] = dp->oldcell[k + ml];
738 k = (i + 1 == dp->ncols) ? 0 : i + 1;
740 if (dp->oldcell[k + ml] ==
741 (int) (dp->oldcell[i + mj] + 1) % dp->states)
742 dp->newcell[i + mj] = dp->oldcell[k + ml];
746 l = (!j) ? dp->nrows - 1 : j - 1;
748 if (dp->oldcell[k + ml] ==
749 (int) (dp->oldcell[i + mj] + 1) % dp->states)
750 dp->newcell[i + mj] = dp->oldcell[k + ml];
753 l = (j + 1 == dp->nrows) ? 0 : j + 1;
755 if (dp->oldcell[k + ml] ==
756 (int) (dp->oldcell[i + mj] + 1) % dp->states)
757 dp->newcell[i + mj] = dp->oldcell[k + ml];
761 if (dp->neighbors == 9 || dp->neighbors == 12) {
763 for (j = 0; j < dp->nrows; j++) {
764 for (i = 0; i < dp->ncols; i++) {
774 if (dp->oldcell[k + ml] ==
775 (int) (dp->oldcell[i + mj] + 1) % dp->states)
776 dp->newcell[i + mj] = dp->oldcell[k + ml];
779 if (j + 1 == dp->nrows)
781 else if (j + 2 == dp->nrows)
786 if (dp->oldcell[k + ml] ==
787 (int) (dp->oldcell[i + mj] + 1) % dp->states)
788 dp->newcell[i + mj] = dp->oldcell[k + ml];
790 k = (!i) ? dp->ncols - 1 : i - 1;
791 l = (!j) ? dp->nrows - 1 : j - 1;
793 if (dp->oldcell[k + ml] ==
794 (int) (dp->oldcell[i + mj] + 1) % dp->states)
795 dp->newcell[i + mj] = dp->oldcell[k + ml];
797 k = (i + 1 == dp->ncols) ? 0 : i + 1;
798 l = (!j) ? dp->nrows - 1 : j - 1;
800 if (dp->oldcell[k + ml] ==
801 (int) (dp->oldcell[i + mj] + 1) % dp->states)
802 dp->newcell[i + mj] = dp->oldcell[k + ml];
804 k = (!i) ? dp->ncols - 1 : i - 1;
805 l = (j + 1 == dp->nrows) ? 0 : j + 1;
807 if (dp->oldcell[k + ml] ==
808 (int) (dp->oldcell[i + mj] + 1) % dp->states)
809 dp->newcell[i + mj] = dp->oldcell[k + ml];
811 k = (i + 1 == dp->ncols) ? 0 : i + 1;
812 l = (j + 1 == dp->nrows) ? 0 : j + 1;
814 if (dp->oldcell[k + ml] ==
815 (int) (dp->oldcell[i + mj] + 1) % dp->states)
816 dp->newcell[i + mj] = dp->oldcell[k + ml];
820 if (dp->neighbors == 12) {
822 for (j = 0; j < dp->nrows; j++) {
823 for (i = 0; i < dp->ncols; i++) {
824 if ((i + j) % 2) { /* right */
826 k = (!i) ? dp->ncols - 1 : i - 1;
834 if (dp->oldcell[k + ml] ==
835 (int) (dp->oldcell[i + mj] + 1) % dp->states)
836 dp->newcell[i + mj] = dp->oldcell[k + ml];
838 k = (!i) ? dp->ncols - 1 : i - 1;
839 if (j + 1 == dp->nrows)
841 else if (j + 2 == dp->nrows)
846 if (dp->oldcell[k + ml] ==
847 (int) (dp->oldcell[i + mj] + 1) % dp->states)
848 dp->newcell[i + mj] = dp->oldcell[k + ml];
850 k = (i + 1 == dp->ncols) ? 0 : i + 1;
853 if (dp->oldcell[k + ml] ==
854 (int) (dp->oldcell[i + mj] + 1) % dp->states)
855 dp->newcell[i + mj] = dp->oldcell[k + ml];
858 k = (i + 1 == dp->ncols) ? 0 : i + 1;
866 if (dp->oldcell[k + ml] ==
867 (int) (dp->oldcell[i + mj] + 1) % dp->states)
868 dp->newcell[i + mj] = dp->oldcell[k + ml];
870 k = (i + 1 == dp->ncols) ? 0 : i + 1;
871 if (j + 1 == dp->nrows)
873 else if (j + 2 == dp->nrows)
878 if (dp->oldcell[k + ml] ==
879 (int) (dp->oldcell[i + mj] + 1) % dp->states)
880 dp->newcell[i + mj] = dp->oldcell[k + ml];
882 k = (!i) ? dp->ncols - 1 : i - 1;
885 if (dp->oldcell[k + ml] ==
886 (int) (dp->oldcell[i + mj] + 1) % dp->states)
887 dp->newcell[i + mj] = dp->oldcell[k + ml];
896 for (j = 0; j < dp->nrows; j++) {
897 for (i = 0; i < dp->ncols; i++)
898 if (dp->oldcell[i + mj] != dp->newcell[i + mj]) {
899 dp->oldcell[i + mj] = dp->newcell[i + mj];
900 if (!addtolist(mi, i, j, dp->oldcell[i + mj])) {
901 free_demon(MI_DISPLAY(mi), dp);
907 if (++dp->generation > MI_CYCLES(mi))
911 if (dp->ncells[dp->state])
912 if (!draw_state(mi, dp->state)) {
913 free_demon(MI_DISPLAY(mi), dp);
919 for (i = 0; i < REDRAWSTEP; i++) {
920 if (dp->oldcell[dp->redrawpos]) {
921 drawcell(mi, dp->redrawpos % dp->ncols, dp->redrawpos / dp->ncols,
922 dp->oldcell[dp->redrawpos]);
924 if (++(dp->redrawpos) >= dp->ncols * dp->nrows) {
934 reshape_demon(ModeInfo * mi, int width, int height)
936 XClearWindow (MI_DISPLAY (mi), MI_WINDOW(mi));
942 release_demon (ModeInfo * mi)
944 if (demons != NULL) {
947 for (screen = 0; screen < MI_NUM_SCREENS(mi); screen++)
948 free_demon(MI_DISPLAY(mi), &demons[screen]);
949 (void) free((void *) demons);
950 demons = (demonstruct *) NULL;
955 refresh_demon (ModeInfo * mi)
961 dp = &demons[MI_SCREEN(mi)];
968 demon_handle_event (ModeInfo *mi, XEvent *event)
970 if (screenhack_event_helper (MI_DISPLAY(mi), MI_WINDOW(mi), event))
972 reshape_demon (mi, MI_WIDTH(mi), MI_HEIGHT(mi));
980 XSCREENSAVER_MODULE ("Demon", demon)
982 #endif /* MODE_demon */