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
|
/* -*- Mode: C; tab-width: 4 -*- */
/* swarm --- swarm of bees */
#if !defined( lint ) && !defined( SABER )
static const char sccsid[] = "@(#)swarm.c 4.07 97/11/24 xlockmore";
#endif
/*-
* Copyright (c) 1991 by Patrick J. Naughton.
*
* Permission to use, copy, modify, and distribute this software and its
* documentation for any purpose and without fee is hereby granted,
* provided that the above copyright notice appear in all copies and that
* both that copyright notice and this permission notice appear in
* supporting documentation.
*
* This file is provided AS IS with no warranties of any kind. The author
* shall have no liability with respect to the infringement of copyrights,
* trade secrets or any patents by this file or any part thereof. In no
* event will the author be liable for any lost revenue or profits or
* other special, indirect and consequential damages.
*
* Revision History:
* 10-May-97: Compatible with xscreensaver
* 31-Aug-90: Adapted from xswarm by Jeff Butterworth <butterwo@ncsc.org>
*/
#ifdef STANDALONE
#define PROGCLASS "Swarm"
#define HACK_INIT init_swarm
#define HACK_DRAW draw_swarm
#define swarm_opts xlockmore_opts
#define DEFAULTS "*delay: 15000 \n" \
"*count: 100 \n"
#define BRIGHT_COLORS
#include "xlockmore.h" /* from the xscreensaver distribution */
#include <X11/Xutil.h>
#else /* !STANDALONE */
#include "xlock.h" /* from the xlockmore distribution */
#endif /* !STANDALONE */
ModeSpecOpt swarm_opts =
{0, NULL, 0, NULL, NULL};
#ifdef USE_MODULES
ModStruct swarm_description =
{"swarm", "init_swarm", "draw_swarm", "release_swarm",
"refresh_swarm", "init_swarm", NULL, &swarm_opts,
15000, 100, 1, 1, 64, 1.0, "",
"Shows a swarm of bees following a wasp", 0, NULL};
#endif
#define TIMES 4 /* number of time positions recorded */
#define BEEACC 2 /* acceleration of bees */
#define WASPACC 5 /* maximum acceleration of wasp */
#define BEEVEL 12 /* maximum bee velocity */
#define WASPVEL 10 /* maximum wasp velocity */
/* Macros */
#define X(t,b) (sp->x[(t)*sp->beecount+(b)])
#define Y(t,b) (sp->y[(t)*sp->beecount+(b)])
#define balance_rand(v) ((NRAND(v))-((v)/2)) /* random number around 0 */
typedef struct {
int pix;
int width;
int height;
int border; /* wasp won't go closer than this to the edge */
int beecount; /* number of bees */
XSegment *segs; /* bee lines */
XSegment *old_segs; /* old bee lines */
short *x;
short *y; /* bee positions x[time][bee#] */
short *xv;
short *yv; /* bee velocities xv[bee#] */
short wx[3];
short wy[3];
short wxv;
short wyv;
Cursor cursor;
} swarmstruct;
static swarmstruct *swarms = NULL;
extern Bool mouse;
void
init_swarm(ModeInfo * mi)
{
Display *display = MI_DISPLAY(mi);
Window window = MI_WINDOW(mi);
swarmstruct *sp;
int b;
if (swarms == NULL) {
if ((swarms = (swarmstruct *) calloc(MI_NUM_SCREENS(mi),
sizeof (swarmstruct))) == NULL)
return;
}
sp = &swarms[MI_SCREEN(mi)];
#ifdef STANDALONE
mouse = get_boolean_resource("mouse", "Boolean");
#endif /* !STANDALONE */
sp->beecount = MI_BATCHCOUNT(mi);
if (sp->beecount < 0) {
/* if sp->beecount is random ... the size can change */
if (sp->segs != NULL) {
(void) free((void *) sp->segs);
sp->segs = NULL;
}
if (sp->old_segs != NULL) {
(void) free((void *) sp->old_segs);
sp->old_segs = NULL;
}
if (sp->x != NULL) {
(void) free((void *) sp->x);
sp->x = NULL;
}
if (sp->y != NULL) {
(void) free((void *) sp->y);
sp->y = NULL;
}
if (sp->xv != NULL) {
(void) free((void *) sp->xv);
sp->xv = NULL;
}
if (sp->yv != NULL) {
(void) free((void *) sp->yv);
sp->yv = NULL;
}
sp->beecount = NRAND(-sp->beecount) + 1; /* Add 1 so its not too boring */
}
sp->width = MI_WIN_WIDTH(mi);
sp->height = MI_WIN_HEIGHT(mi);
sp->border = (sp->width + sp->height) / 50;
if (mouse && !sp->cursor) { /* Create an invisible cursor */
Pixmap bit;
XColor black;
black.red = black.green = black.blue = 0;
black.flags = DoRed | DoGreen | DoBlue;
bit = XCreatePixmapFromBitmapData(display, window, "\000", 1, 1,
MI_BLACK_PIXEL(mi),
MI_BLACK_PIXEL(mi), 1);
sp->cursor = XCreatePixmapCursor(display, bit, bit, &black, &black,
0, 0);
XFreePixmap(display, bit);
}
XDefineCursor(display, window, sp->cursor);
MI_CLEARWINDOW(mi);
/* Allocate memory. */
if (!sp->segs) {
sp->segs = (XSegment *) malloc(sizeof (XSegment) * sp->beecount);
sp->old_segs = (XSegment *) malloc(sizeof (XSegment) * sp->beecount);
sp->x = (short *) malloc(sizeof (short) * sp->beecount * TIMES);
sp->y = (short *) malloc(sizeof (short) * sp->beecount * TIMES);
sp->xv = (short *) malloc(sizeof (short) * sp->beecount);
sp->yv = (short *) malloc(sizeof (short) * sp->beecount);
}
/* Initialize point positions, velocities, etc. */
if (MI_NPIXELS(mi) > 2)
sp->pix = NRAND(MI_NPIXELS(mi));
/* wasp */
sp->wx[0] = sp->border + NRAND(sp->width - 2 * sp->border);
sp->wy[0] = sp->border + NRAND(sp->height - 2 * sp->border);
sp->wx[1] = sp->wx[0];
sp->wy[1] = sp->wy[0];
sp->wxv = 0;
sp->wyv = 0;
/* bees */
for (b = 0; b < sp->beecount; b++) {
X(0, b) = NRAND(sp->width);
X(1, b) = X(0, b);
Y(0, b) = NRAND(sp->height);
Y(1, b) = Y(0, b);
sp->xv[b] = balance_rand(7);
sp->yv[b] = balance_rand(7);
}
}
void
draw_swarm(ModeInfo * mi)
{
Display *display = MI_DISPLAY(mi);
Window window = MI_WINDOW(mi);
GC gc = MI_GC(mi);
swarmstruct *sp = &swarms[MI_SCREEN(mi)];
int b;
Bool track_p = mouse;
int cx, cy;
if (track_p) {
Window r, c;
int rx, ry;
unsigned int m;
(void) XQueryPointer(display, window,
&r, &c, &rx, &ry, &cx, &cy, &m);
if (cx <= sp->border || cy <= sp->border ||
cx >= MI_WIN_WIDTH(mi) - 1 - sp->border ||
cy >= MI_WIN_HEIGHT(mi) - 1 - sp->border)
track_p = False;
}
/* <=- Wasp -=> */
/* Age the arrays. */
sp->wx[2] = sp->wx[1];
sp->wx[1] = sp->wx[0];
sp->wy[2] = sp->wy[1];
sp->wy[1] = sp->wy[0];
if (track_p) {
sp->wx[0] = cx;
sp->wy[0] = cy;
} else {
/* Accelerate */
sp->wxv += balance_rand(WASPACC);
sp->wyv += balance_rand(WASPACC);
/* Speed Limit Checks */
if (sp->wxv > WASPVEL)
sp->wxv = WASPVEL;
if (sp->wxv < -WASPVEL)
sp->wxv = -WASPVEL;
if (sp->wyv > WASPVEL)
sp->wyv = WASPVEL;
if (sp->wyv < -WASPVEL)
sp->wyv = -WASPVEL;
/* Move */
sp->wx[0] = sp->wx[1] + sp->wxv;
sp->wy[0] = sp->wy[1] + sp->wyv;
/* Bounce Checks */
if ((sp->wx[0] < sp->border) || (sp->wx[0] > sp->width - sp->border - 1)) {
sp->wxv = -sp->wxv;
sp->wx[0] += sp->wxv;
}
if ((sp->wy[0] < sp->border) || (sp->wy[0] > sp->height - sp->border - 1)) {
sp->wyv = -sp->wyv;
sp->wy[0] += sp->wyv;
}
/* Don't let things settle down. */
sp->xv[NRAND(sp->beecount)] += balance_rand(3);
sp->yv[NRAND(sp->beecount)] += balance_rand(3);
}
/* <=- Bees -=> */
for (b = 0; b < sp->beecount; b++) {
int distance, dx, dy;
/* Age the arrays. */
X(2, b) = X(1, b);
X(1, b) = X(0, b);
Y(2, b) = Y(1, b);
Y(1, b) = Y(0, b);
/* Accelerate */
dx = sp->wx[1] - X(1, b);
dy = sp->wy[1] - Y(1, b);
distance = abs(dx) + abs(dy); /* approximation */
if (distance == 0)
distance = 1;
sp->xv[b] += (dx * BEEACC) / distance;
sp->yv[b] += (dy * BEEACC) / distance;
/* Speed Limit Checks */
if (sp->xv[b] > BEEVEL)
sp->xv[b] = BEEVEL;
if (sp->xv[b] < -BEEVEL)
sp->xv[b] = -BEEVEL;
if (sp->yv[b] > BEEVEL)
sp->yv[b] = BEEVEL;
if (sp->yv[b] < -BEEVEL)
sp->yv[b] = -BEEVEL;
/* Move */
X(0, b) = X(1, b) + sp->xv[b];
Y(0, b) = Y(1, b) + sp->yv[b];
/* Fill the segment lists. */
sp->segs[b].x1 = X(0, b);
sp->segs[b].y1 = Y(0, b);
sp->segs[b].x2 = X(1, b);
sp->segs[b].y2 = Y(1, b);
sp->old_segs[b].x1 = X(1, b);
sp->old_segs[b].y1 = Y(1, b);
sp->old_segs[b].x2 = X(2, b);
sp->old_segs[b].y2 = Y(2, b);
}
XSetForeground(display, gc, MI_BLACK_PIXEL(mi));
XDrawLine(display, window, gc,
sp->wx[1], sp->wy[1], sp->wx[2], sp->wy[2]);
XDrawSegments(display, window, gc, sp->old_segs, sp->beecount);
XSetForeground(display, gc, MI_WHITE_PIXEL(mi));
XDrawLine(display, window, gc,
sp->wx[0], sp->wy[0], sp->wx[1], sp->wy[1]);
if (MI_NPIXELS(mi) > 2) {
XSetForeground(display, gc, MI_PIXEL(mi, sp->pix));
if (++sp->pix >= MI_NPIXELS(mi))
sp->pix = 0;
}
XDrawSegments(display, window, gc, sp->segs, sp->beecount);
}
void
release_swarm(ModeInfo * mi)
{
if (swarms != NULL) {
int screen;
for (screen = 0; screen < MI_NUM_SCREENS(mi); screen++) {
swarmstruct *sp = &swarms[screen];
if (sp->segs != NULL)
(void) free((void *) sp->segs);
if (sp->old_segs != NULL)
(void) free((void *) sp->old_segs);
if (sp->x != NULL)
(void) free((void *) sp->x);
if (sp->y != NULL)
(void) free((void *) sp->y);
if (sp->xv != NULL)
(void) free((void *) sp->xv);
if (sp->yv != NULL)
(void) free((void *) sp->yv);
if (sp->cursor)
XFreeCursor(MI_DISPLAY(mi), sp->cursor);
}
(void) free((void *) swarms);
swarms = NULL;
}
}
void
refresh_swarm(ModeInfo * mi)
{
/* Do nothing, it will refresh by itself */
}
|