1 /* forest.c (aka xtree.c), Copyright (c) 1999
2 * Peter Baumung <unn6@rz.uni-karlsruhe.de>
5 * xscreensaver, Copyright (c) 1992, 1995, 1997
6 * Jamie Zawinski <jwz@netscape.com>
8 * Permission to use, copy, modify, distribute, and sell this software and its
9 * documentation for any purpose is hereby granted without fee, provided that
10 * the above copyright notice appear in all copies and that both that
11 * copyright notice and this permission notice appear in supporting
12 * documentation. No representations are made about the suitability of this
13 * software for any purpose. It is provided "as is" without express or
19 /* ****************************** NOTE ******************************
21 This is not the xlockmore version of forest, but a much better
22 looking rewrite. Be careful not to delete it in a merging frenzy...
24 **********************************************************************
28 # define PROGCLASS "Forest" /*"XTree"*/
29 # define HACK_INIT init_trees
30 # define HACK_DRAW draw_trees
31 # define trees_opts xlockmore_opts
32 # define DEFAULTS "*delay: 500000 \n" \
34 "*eraseSpeed: 400 \n" \
36 "*installColormap False"
37 # include "xlockmore.h" /* from the xscreensaver distribution */
38 #else /* !STANDALONE */
39 # include "xlock.h" /* from the xlockmore distribution */
40 #endif /* !STANDALONE */
42 ModeSpecOpt trees_opts = {0, NULL, 0, NULL, NULL};
54 static treestruct *trees = NULL;
59 static long colorM[12] = {0xff0000, 0xff8000, 0xffff00, 0x80ff00,
60 0x00ff00, 0x00ff80, 0x00ffff, 0x0080ff,
61 0x0000ff, 0x8000ff, 0xff00ff, 0xff0080};
63 static long colorV[12] = {0x0a0000, 0x0a0500, 0x0a0a00, 0x050a00,
64 0x000a00, 0x000a05, 0x000a0a, 0x00050a,
65 0x00000a, 0x05000a, 0x0a000a, 0x0a0005};
67 void init_trees(ModeInfo * mi) {
68 unsigned long pixels[20];
70 Display *display = MI_DISPLAY(mi);
75 trees = (treestruct *) calloc(MI_NUM_SCREENS(mi), sizeof (treestruct));
80 if (mi->npixels > 20) {
81 printf("%d colors selected. Setting limit to 20...\n", mi->npixels);
85 if (mi->npixels < 4) {
86 for (i = 0; i < mi->npixels; i++) {
87 colors[i].red = 65535 * (i & 1);
88 colors[i].green = 65535 * (i & 1);
89 colors[i].blue = 65535 * (i & 1);
90 colors[i].flags = DoRed | DoGreen | DoBlue;
93 if (mi->npixels < 8) {
94 for (i = 0; i < mi->npixels; i++) {
95 colors[i].red = 32768 + 4096 * (i % 4);
96 colors[i].green = 32768 + 4096 * (i % 4);
97 colors[i].blue = 32768 + 4096 * (i % 4);
98 colors[i].flags = DoRed | DoGreen | DoBlue;
101 for (i = 0; i < mi->npixels; i++) {
102 colors[i].red = 24576 + 4096 * (i % 4);
103 colors[i].green = 10240 + 2048 * (i % 4);
105 colors[i].flags = DoRed | DoGreen | DoBlue;
110 for (i = 0; i < mi->npixels; i++)
111 if (!XAllocColor(display, mi->xgwa.colormap, &colors[i])) break;
114 XSetForeground(display, gc, colors[1].pixel);
117 XClearWindow(display, MI_WINDOW(mi));
118 XSetLineAttributes(display, gc, 2, LineSolid, CapButt, JoinMiter);
119 tree = &trees[MI_SCREEN(mi)];
121 tree->season = NRAND(12);
123 for (i = 4; i < mi->npixels; i++) {
124 int sIndex = (tree->season + (i-4) / 4) % 12;
125 long color = colorM[sIndex] - 2 * colorV[sIndex] * (i % 4);
126 colors[i].red = (color & 0xff0000) / 256;
127 colors[i].green = (color & 0x00ff00);
128 colors[i].blue = (color & 0x0000ff) * 256;
129 colors[i].flags = DoRed | DoGreen | DoBlue;
132 for (i = 0; i < color; i++)
133 pixels[i] = colors[i].pixel;
135 XFreeColors(display, mi->xgwa.colormap, pixels, mi->npixels, 0L);
137 for (i = 0; i < mi->npixels; i++)
138 if (!XAllocColor(display, mi->xgwa.colormap, &colors[i])) break;
143 double rRand(double a, double b) {
144 return (a+(b-a)*NRAND(10001)/10000.0);
147 void draw_line(ModeInfo * mi,
148 int x1, int y1, int x2, int y2,
149 double angle, int widths, int widthe) {
151 Display *display = MI_DISPLAY(mi);
153 double sns = 0.5*widths*sin(angle + M_PI_2);
154 double css = 0.5*widths*cos(angle + M_PI_2);
155 double sne = 0.5*widthe*sin(angle + M_PI_2);
156 double cse = 0.5*widthe*cos(angle + M_PI_2);
158 int xs1 = (int) (x1-sns);
159 int xs2 = (int) (x1+sns);
160 int ys1 = (int) (y1-css);
161 int ys2 = (int) (y1+css);
162 int xe1 = (int) (x2-sne);
163 int xe2 = (int) (x2+sne);
164 int ye1 = (int) (y2-cse);
165 int ye2 = (int) (y2+cse);
168 for (i = 0; i < widths; i++) {
170 XSetForeground(display, gc, colors[i*4/widths].pixel);
171 XDrawLine(display, MI_WINDOW(mi), gc,
172 xs1+(xs2-xs1)*i/widths, ys1+(ys2-ys1)*i/widths,
173 xe1+(xe2-xe1)*i/widths, ye1+(ye2-ye1)*i/widths);
177 void draw_tree_rec(ModeInfo * mi, double thick, int x, int y, double angle) {
178 treestruct *tree = &trees[MI_SCREEN(mi)];
179 Display *display = MI_DISPLAY(mi);
181 int length = (24+NRAND(12))*tree->size;
182 int a = (int) (x - length*sin(angle));
183 int b = (int) (y - length*cos(angle));
186 draw_line(mi, x, y, a, b, angle, thick*tree->size, 0.68*thick*tree->size);
189 draw_tree_rec(mi, 0.68*thick, a, b, 0.8*angle+rRand(-0.2, 0.2));
190 if (thick < tree->thick-1) {
191 draw_tree_rec(mi, 0.68*thick, a, b, angle+rRand(0.2, 0.9));
192 draw_tree_rec(mi, 0.68*thick, (a+x)/2, (b+y)/2, angle-rRand(0.2, 0.9));
196 if (thick < 0.5*tree->thick) {
197 int nleaf = 12 + NRAND(4);
199 for (i = 0; i < nleaf; i++) {
200 leaf[i].x = a + (int) (tree->size * rRand(-12, 12));
201 leaf[i].y = b + (int) (tree->size * rRand(-12, 12));
202 leaf[i].width = (int) (tree->size * rRand(2, 6));
203 leaf[i].height = leaf[i].width;
205 leaf[i].angle2 = 360 * 64;
207 if (mi->npixels >= 4)
208 XSetForeground(display, gc, colors[tree->color+NRAND(4)].pixel);
209 XFillArcs(display, MI_WINDOW(mi), gc, leaf, nleaf);
213 void draw_trees(ModeInfo * mi) {
214 treestruct *tree = &trees[MI_SCREEN(mi)];
215 int width = MI_WIN_WIDTH(mi);
216 int height = MI_WIN_HEIGHT(mi);
218 if (--(tree->toDo) == 0) {
223 tree->x = NRAND(width);
224 tree->y = (int) (1.25 * height * (1 - tree->toDo / 23.0));
225 tree->thick = rRand(7, 12);
226 tree->size = height / 480.0;
230 tree->color = 4 * (1 + NRAND(color / 4 - 1));
233 draw_tree_rec(mi, tree->thick, tree->x, tree->y, rRand(-0.1, 0.1));
236 void release_trees(ModeInfo * mi) {
238 (void) free((void *) trees);