-
Notifications
You must be signed in to change notification settings - Fork 59
/
zoom.cpp
1604 lines (1459 loc) · 49.9 KB
/
zoom.cpp
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
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* XaoS, a fast portable realtime fractal zoomer
* Copyright (C) 1996,1997 by
*
* Jan Hubicka (hubicka@paru.cas.cz)
* Thomas Marsh (tmarsh@austin.ibm.com)
*
* 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., 675 Mass Ave, Cambridge, MA 02139, USA.
*/
#include <cstdlib>
#include <cstdio>
#include <climits>
#include <cmath>
#include <cstring>
#include <cassert>
#include "config.h"
#define SLARGEITER
#include "filter.h"
#include "zoom.h"
#include "cmplx.h" /*for myabs */
#include "plane.h"
#include "btrace.h"
#include "xthread.h"
#include "xerror.h"
#include "calculate.h" /*an inlined calculate function */
#include "i18n.h"
#define ASIZE 16
#define ALIGN(x) (((x) + ASIZE - 1) & (~(ASIZE - 1)))
static int nsymmetrized;
unsigned char *tmpdata, *tmpdata1;
struct realloc_s {
number_t position;
number_t price;
unsigned int plus;
int recalculate;
int symto;
int symref;
int dirty;
}
#ifdef __GNUC__
__attribute__((aligned(32)))
#endif
;
typedef struct realloc_s realloc_t;
typedef struct zoom_context {
number_t *xpos, *ypos;
int newcalc;
int forversion;
int forpversion;
realloc_t *reallocx, *reallocy;
int incomplete;
int changed;
} zoom_context;
struct filltable {
int from;
int to;
int length;
int end;
};
#define getzcontext(f) ((zoom_context *)((f)->data))
#define getfcontext(f) ((f)->fractalc)
#define callwait() \
if (cfilter.wait_function != NULL) \
cfilter.wait_function(&cfilter);
#define tcallwait() \
if (!xth_nthread(task) && cfilter.wait_function != NULL) \
cfilter.wait_function(&cfilter);
#define setincomplete(i) (getzcontext(&cfilter)->incomplete = i)
#define incincomplete() (getzcontext(&cfilter)->incomplete++)
#define setchanged(i) (getzcontext(&cfilter)->changed = i)
zoom_context czoomc;
struct filter cfilter;
#ifdef STATISTICS
static int tocalculate = 0, avoided = 0;
static int nadded = 0, nsymmetry = 0, nskipped = 0;
int nperi = 0;
#endif
static void moveoldpoints(void *data1, struct taskinfo *task, int r1, int r2);
static void fillline_8(int line);
static void fillline_16(int line);
// static void fillline_24(int line);
static void fillline_32(int line);
/*first of all inline driver section */
/*If you think this way is ugly, I must agree. Please let me know
*about better one that allows to generate custom code for 8,16,24,32
*bpp modes and use of static variables
*/
#include "c256.h"
#define fillline fillline_8
#define dosymmetry2 dosymmetry2_8
#define calcline calcline_8
#define calccolumn calccolumn_8
#include "zoomd.h"
#include "truecolor.h"
#define fillline fillline_32
#define dosymmetry2 dosymmetry2_32
#define calcline calcline_32
#define calccolumn calccolumn_32
#include "zoomd.h"
#include "true24.h"
#define fillline fillline_24
#define dosymmetry2 dosymmetry2_24
#define calcline calcline_24
#define calccolumn calccolumn_24
#include "zoomd.h"
#include "hicolor.h"
#define fillline fillline_16
#define dosymmetry2 dosymmetry2_16
#define calcline calcline_16
#define calccolumn calccolumn_16
#include "zoomd.h"
#define calcline(a) \
drivercall(cimage, calcline_8(a), calcline_16(a), calcline_24(a), \
calcline_32(a));
#define calccolumn(a) \
drivercall(cimage, calccolumn_8(a), calccolumn_16(a), calccolumn_24(a), \
calccolumn_32(a));
struct dyn_data {
int price;
struct dyn_data *previous;
};
#define FPMUL 64 /*Let multable fit into pentium cache */
#define RANGES 2 /*shift equal to x*RANGE */
#define RANGE 4
#define DSIZEHMASK (0x7) /*mask equal to x%(DSIZE) */
#define DSIZE (2 * RANGE)
#define DSIZES (RANGES + 1) /*shift equal to x*DSIZE */
#define adddata(n, i) (dyndata + (((n) << DSIZES) + (((i) & (DSIZEHMASK)))))
#define getbest(i) (dyndata + ((size) << DSIZES) + (i))
#define nosetadd ((size * 2) << DSIZES)
#ifndef DEBUG
#define CHECKPOS(pos)
#else
#define CHECKPOS(pos) \
(assert((pos) >= dyndata), \
assert((pos) < dyndata + (size) + ((size) << DSIZES)))
#endif
#ifdef __POWERPC__
#undef USE_MULTABLE
#else
#define USE_MULTABLE 1
#endif
#ifdef USE_MULTABLE
#define PRICE(i, i1) mulmid[(i) - (i1)]
#else
#define PRICE(i, i1) (((i) - (i1)) * ((i) - (i1)))
#endif
#define NEWPRICE (FPMUL * FPMUL * (RANGE) * (RANGE))
#define NOSETMASK ((unsigned int)0x80000000)
#define END NULL
#define MAXPRICE INT_MAX
/*static int dynsize = (int)sizeof (struct dyn_data);*/
#ifndef INT_MIN
#define INT_MIN (-INT_MAX - 1)
#endif
#define IRANGE FPMUL *RANGE
#ifdef USE_MULTABLE
static int multable[RANGE * FPMUL * 2];
static int *mulmid;
#endif
/*Functions looks through rows/columns marked for calculation and tries to use
*some symmetrical one instead
*/
/*FIXME should be threaded...but thread overhead should take more work than
*do it in one, since it is quite simple and executes just in case fractal
*on the screen is symmetrical and it is quite rare case...who knows
*/
static void preparesymmetries(realloc_t *realloc, const int size, int symi,
number_t sym, number_t step)
{
int i;
int istart = 0;
number_t fy, ftmp;
realloc_t *r = realloc, *reallocs;
sym *= 2;
i = 2 * symi - size;
if (i < 0)
i = 0;
realloc += i;
for (; i <= symi; i++, realloc++) { /*makes symmetries */
int j, min = 0;
number_t dist = NUMBER_BIG, tmp1;
if (realloc->symto != -1)
continue;
fy = realloc->position;
realloc->symto = 2 * symi - i;
if (realloc->symto >= size - RANGE)
realloc->symto = size - RANGE - 1;
dist = RANGE * step;
min = RANGE;
#ifdef DEBUG
if (realloc->symto < 0 || realloc->symto >= size) {
x_fatalerror("Internal error #22-1 %i", realloc->symto);
assert(0);
}
#endif
reallocs = &r[realloc->symto];
j = (realloc->symto - istart > RANGE) ? -RANGE
: (-realloc->symto + istart);
if (realloc->recalculate) {
for (; j < RANGE && realloc->symto + j < size - 1; j++) {
ftmp = sym - (reallocs + j)->position;
if ((tmp1 = myabs(ftmp - fy)) < dist) {
if ((realloc == r || ftmp > (realloc - 1)->position) &&
(ftmp < (realloc + 1)->position)) {
dist = tmp1;
min = j;
}
} else if (ftmp < fy)
break;
}
} else {
for (; j < RANGE && realloc->symto + j < size - 1; j++) {
if (!realloc->recalculate)
continue;
ftmp = sym - (reallocs + j)->position;
if ((tmp1 = myabs(ftmp - fy)) < dist) {
if ((realloc == r || ftmp > (realloc - 1)->position) &&
(ftmp < (realloc + 1)->position)) {
dist = tmp1;
min = j;
}
} else if (ftmp < fy)
break;
}
}
realloc->symto += min;
if (min == RANGE || realloc->symto <= symi ||
(reallocs = reallocs + min)->symto != -1 ||
reallocs->symref != -1) {
realloc->symto = -1;
continue;
}
if (!realloc->recalculate) {
realloc->symto = -1;
if (reallocs->symto != -1 || !reallocs->recalculate)
continue;
reallocs->plus = realloc->plus;
reallocs->symto = i;
nsymmetrized++;
istart = realloc->symto - 1;
reallocs->dirty = 1;
realloc->symref = (int)(reallocs - r);
STAT(nadded -= reallocs->recalculate);
reallocs->recalculate = 0;
reallocs->position = sym - realloc->position;
} else {
if (reallocs->symto != -1) {
realloc->symto = -1;
continue;
}
istart = realloc->symto - 1;
STAT(nadded -= realloc->recalculate);
nsymmetrized++;
realloc->dirty = 1;
realloc->plus = reallocs->plus;
realloc->recalculate = 0;
reallocs->symref = i;
realloc->position = sym - reallocs->position;
}
STAT(nsymmetry++);
#ifdef DEBUG
if (realloc->symto < -1 || realloc->symto >= size) {
x_fatalerror("Internal error #22 %i", realloc->symto);
assert(0);
}
if (reallocs->symto < -1 || reallocs->symto >= size) {
x_fatalerror("Internal error #22-2 %i", reallocs->symto);
assert(0);
}
#endif
}
}
static void newpositions(realloc_t *realloc, unsigned int size, number_t begin1,
number_t end1, const number_t *fpos, int yend)
{
realloc_t *rs, *re, *rend;
number_t step = size / (end1 - begin1);
number_t start;
number_t end;
rend = realloc + size;
rs = realloc - 1;
re = realloc;
while (rs < rend - 1) {
re = rs + 1;
if (re->recalculate) {
while (re < rend && re->recalculate)
re++;
if (re == rend)
end = end1;
else
end = re->position;
if (rs == realloc - 1) {
start = begin1;
if (start > end)
start = end;
} else
start = rs->position;
if (re == rend && start > end)
end = start;
if (re - rs == 2)
end = (end - start) * 0.5;
else
end = ((number_t)(end - start)) / (re - rs);
switch (yend) {
case 1:
for (rs++; rs < re; rs++) {
start += end, rs->position = start;
rs->price =
1 / (1 + myabs(fpos[rs - realloc] - start) * step);
}
break;
case 2:
for (rs++; rs < re; rs++) {
start += end, rs->position = start;
rs->price = (myabs(fpos[rs - realloc] - start) * step);
if (rs == realloc || rs == rend - 1)
rs->price *= 500;
}
break;
default:
for (rs++; rs < re; rs++) {
start += end, rs->position = start;
rs->price = (number_t)1;
}
break;
}
}
rs = re;
}
}
/* This is the main reallocation algorithm described in xaos.info
* It is quite complex since many loops are unrooled and uses custom
* fixedpoint
*
* Takes approx 30% of time so looking for way to do it threaded.
* Let me know :)
*/
static void mkrealloc_table(const number_t *fpos, realloc_t *realloc,
const unsigned int size, const number_t begin,
const number_t end, number_t sym,
unsigned char *tmpdata)
{
unsigned int i;
int counter;
unsigned int ps, ps1 = 0, pe;
unsigned int p;
int bestprice = MAXPRICE;
realloc_t *r = realloc;
struct dyn_data *dyndata;
int yend, y;
struct dyn_data **best;
struct dyn_data **best1, **tmp;
int *pos;
number_t step, tofix;
int symi = -1;
unsigned int lastplus = 0;
struct dyn_data *data;
struct dyn_data *previous = NULL, *bestdata = NULL;
int myprice;
#ifdef STATISTICS
nadded = 0, nsymmetry = 0, nskipped = 0;
#endif
pos = (int *)tmpdata;
best = (struct dyn_data **)(tmpdata + ALIGN((size + 2) * sizeof(int)));
best1 = (struct dyn_data **)(tmpdata + ALIGN((size + 2) * sizeof(int)) +
ALIGN(size * sizeof(struct dyn_data **)));
dyndata = (struct dyn_data *)(tmpdata + ALIGN((size + 2) * sizeof(int)) +
2 * ALIGN(size * sizeof(struct dyn_data **)));
tofix = size * FPMUL / (end - begin);
pos[0] = INT_MIN;
pos++;
for (counter = (int)size - 1; counter >= 0; counter--) {
pos[counter] =
(int)((fpos[counter] - begin) *
tofix); /*first convert everything into fixedpoint */
if (counter < (int)size - 1 && pos[counter] > pos[counter + 1])
/*Avoid processing of missordered rows.
They should happen because of limited
precisity of FP numbers */
pos[counter] = pos[counter + 1];
}
pos[size] = INT_MAX;
step = (end - begin) / (number_t)size;
if (begin > sym || sym > end) /*calculate symmetry point */
symi = -2;
else {
symi = (int)((sym - begin) / step);
}
ps = 0;
pe = 0;
y = 0;
/* This is first pass that fills table dyndata, that holds information
* about all ways algorithm thinks about. Correct way is discovered at
* end by looking backward and determining witch way algorithm used to
* calculate minimal value*/
for (i = 0; i < size; i++, y += FPMUL) {
bestprice = MAXPRICE;
p = ps; /*just inicialize parameters */
tmp = best1;
best1 = best;
best = tmp;
yend = y - IRANGE;
if (yend < -FPMUL) /*do no allow lines outside screen */
yend = -FPMUL;
while (pos[p] <= yend) /*skip lines out of range */
p++;
ps1 = p;
yend = y + IRANGE;
/*First try case that current line will be newly calculated */
/*Look for best way how to connect previous lines */
if (ps != pe && p > ps) { /*previous point had lines */
assert(p >= ps);
if (p < pe) {
previous = best[p - 1];
CHECKPOS(previous);
} else
previous = best[pe - 1];
CHECKPOS(previous);
myprice = previous->price; /*find best one */
} else {
if (i > 0) { /*previous line had no lines */
previous = getbest(i - 1);
myprice = previous->price;
} else
previous = END, myprice = 0;
}
data = getbest(i); /*find store position */
myprice += NEWPRICE;
bestdata = data;
data->previous = previous;
bestprice = myprice; /*calculate best available price */
data->price = myprice; /*store data */
assert(bestprice >= 0); /*FIXME:tenhle assert muze FAILIT! */
data = adddata(p, i); /*calculate all lines good for this y */
/* Now try all acceptable connection and calculate best possibility
* with this connection
*/
if (ps != pe) { /*in case that previous had also positions */
int price1 = INT_MAX;
/*At first line of previous interval we have only one possibility
*don't connect previous line at all.
*/
if (p == ps) { /*here we must skip previous point */
if (pos[p] != pos[p + 1]) {
previous = getbest(i - 1);
myprice = previous->price;
myprice += PRICE(pos[p], y); /*store data */
if (myprice < bestprice) { /*calculate best */
bestprice = myprice, bestdata = data;
data->price = myprice;
data->previous = previous;
}
}
assert(bestprice >= 0);
assert(myprice >= 0);
best1[p] = bestdata;
data += DSIZE;
p++;
}
previous = NULL;
price1 = myprice;
while (p < pe) { /*this is area where intervals of current point and
previous one are crossed */
if (pos[p] != pos[p + 1]) {
if (previous != best[p - 1]) {
previous = best[p - 1];
CHECKPOS(previous);
price1 = myprice = previous->price;
/*In case we found revolutional point, we should think
*about changing our gusesses in last point too - don't
*connect it at all, but use this way instead*/
if (myprice + NEWPRICE <
bestprice) { /*true in approx 2/3 of cases */
bestprice = myprice + NEWPRICE,
bestdata = data - DSIZE;
(bestdata)->price = bestprice;
(bestdata)->previous = previous + nosetadd;
best1[p - 1] = bestdata;
}
} else
myprice = price1;
myprice +=
PRICE(pos[p], y); /*calculate price of new connection */
if (myprice <
bestprice) { /*2/3 of cases */ /*if it is better than
previous, store it */
bestprice = myprice, bestdata = data;
data->price = myprice;
data->previous = previous;
} else if (pos[p] > y) {
best1[p] = bestdata;
data += DSIZE;
p++;
break;
}
}
assert(myprice >= 0);
assert(bestprice >= 0); /*FIXME:tenhle assert FAILI! */
best1[p] = bestdata;
data += DSIZE;
p++;
}
while (p < pe) { /*this is area where intervals of current point and
previous one are crossed */
#ifdef DEBUG
if (pos[p] != pos[p + 1]) {
if (previous != best[p - 1]) {
x_fatalerror("Missoptimization found!");
}
}
#endif
assert(myprice >= 0);
assert(bestprice >= 0); /*FIXME:tenhle assert FAILI! */
best1[p] = bestdata;
data += DSIZE;
p++;
}
/* OK...we passed crossed area. All next areas have same previous
* situation so our job is easier
* So find the best solution once for all of them
*/
if (p > ps) {
previous = best[p - 1]; /*find best one in previous */
CHECKPOS(previous);
price1 = previous->price;
} else {
previous = getbest(i - 1);
price1 = previous->price;
}
/* Since guesses for "revolutional point" was always one
* step back, we need to do last one*/
if (price1 + NEWPRICE < bestprice && p > ps1) {
myprice = price1 + NEWPRICE;
bestprice = myprice, bestdata = data - DSIZE;
(bestdata)->price = myprice;
(bestdata)->previous = previous + nosetadd;
best1[p - 1] = bestdata;
myprice -= NEWPRICE;
}
while (pos[p] < yend) {
if (pos[p] != pos[p + 1]) {
myprice = price1;
myprice += PRICE(pos[p], y); /*store data */
if (myprice < bestprice) { /*calculate best */
bestprice = myprice, bestdata = data;
data->price = myprice;
data->previous = previous;
} else if (pos[p] > y)
break;
}
assert(bestprice >= 0);
assert(myprice >= 0);
best1[p] = bestdata;
data += DSIZE;
p++;
}
while (pos[p] < yend) {
best1[p] = bestdata;
p++;
}
} else {
/* This is second case - previous y was not mapped at all.
* Situation is simpler now, since we know that behind us is
* large hole and our decisions don't affect best solution for
* previous problem. Se we have just one answer
* Situation is similar to latest loop in previous case
*/
int myprice1; /*simplified loop for case that previous
y had no lines */
if (pos[p] < yend) {
if (i > 0) {
previous = getbest(i - 1);
myprice1 = previous->price;
} else
previous = END, myprice1 = 0;
while (pos[p] < yend) {
if (pos[p] != pos[p + 1]) {
myprice = myprice1 + PRICE(pos[p], y);
if (myprice < bestprice) {
data->price = myprice;
data->previous = previous;
bestprice = myprice, bestdata = data;
} else if (pos[p] > y)
break;
}
assert(bestprice >= 0);
assert(myprice >= 0);
best1[p] = bestdata;
p++;
data += DSIZE;
}
while (pos[p] < yend) {
best1[p] = bestdata;
p++;
}
}
}
/*previous = ps; */ /*store positions for next loop */
ps = ps1;
ps1 = pe;
pe = p;
}
assert(bestprice >= 0);
realloc = realloc + size;
yend = (int)((begin > fpos[0]) && (end < fpos[size - 1]));
if (pos[0] > 0 && pos[size - 1] < (int)size * FPMUL)
yend = 2;
/*This part should be made threaded quite easily...but does it worth
*since it is quite simple loop 0...xmax
*/
for (i = size; i > 0;) { /*and finally traces the path */
struct dyn_data *bestdata1;
realloc--;
i--;
realloc->symto = -1;
realloc->symref = -1;
bestdata1 = bestdata->previous;
if (bestdata1 >= dyndata + nosetadd ||
bestdata >= dyndata + ((size) << DSIZES)) {
if (bestdata1 >= dyndata + nosetadd)
bestdata1 -= nosetadd;
realloc->recalculate = 1;
STAT(nadded++);
realloc->dirty = 1;
lastplus++;
if (lastplus >= size)
lastplus = 0;
realloc->plus = lastplus;
} else {
p = ((unsigned int)(bestdata - dyndata)) >> DSIZES;
assert(p < size);
realloc->position = fpos[p];
realloc->plus = p;
realloc->dirty = 0;
realloc->recalculate = 0;
lastplus = p;
}
bestdata = bestdata1;
}
newpositions(realloc, size, begin, end, fpos, yend);
realloc = r;
if (symi <= (int)size && symi >= 0) {
preparesymmetries(r, (int)size, symi, sym, step);
}
STAT(printf("%i added %i skipped %i mirrored\n", nadded, nskipped,
nsymmetry));
STAT(nadded2 += nadded; nskipped2 += nskipped; nsymmetry2 += nsymmetry);
}
struct movedata {
unsigned int size;
unsigned int start;
unsigned int plus;
};
int avgsize;
/*
* this function prepares fast moving table for moveoldpoints
* see xaos.info for details. It is not threaded since it is quite
* fast.
*/
static void preparemoveoldpoints(void)
{
struct movedata *data, *sizend;
realloc_t *rx, *rx1, *rend1;
int sum = 0, num = 0;
int plus1 = 0;
data = (struct movedata *)tmpdata;
for (rx = czoomc.reallocx, rend1 = rx + cimage.width; rx < rend1; rx++)
if ((rx->dirty) && plus1 < cimage.width + 1)
plus1++;
else
break;
data->start = czoomc.reallocx->plus;
data->size = 0;
data->plus = plus1;
rend1--;
while (rend1->dirty) {
if (rend1 == czoomc.reallocx)
return;
rend1--;
}
rend1++;
for (; rx < rend1; rx++) {
if ((rx->dirty || rx->plus == data->start + data->size))
data->size++;
else {
if (data->size) {
plus1 = 0;
rx1 = rx - 1;
while (rx1 > czoomc.reallocx && rx1->dirty)
plus1++, data->size--, rx1--;
if (!(data->start + data->size < (unsigned int)cimage.width) &&
!rx->dirty) {
int i;
if (rx == rend1)
break;
for (i = 0; rx->dirty && rx < rend1; rx++)
i++;
data++;
data->plus = plus1;
data->size = (unsigned int)i;
data->start = rx->plus - i;
} else {
sum += data->size;
num++;
data++;
data->plus = plus1;
data->start = rx->plus;
}
} else
data->start = rx->plus;
assert(rx->plus < (unsigned int)cimage.width);
data->size = 1;
}
}
if (data->size) {
sizend = data + 1;
sum += data->size;
rx1 = rx - 1;
while (rx1 > czoomc.reallocx && rx1->dirty)
data->size--, rx1--;
num++;
} else
sizend = data;
sizend->size = 0;
if (cimage.bytesperpixel != 1) {
sum *= cimage.bytesperpixel;
for (data = (struct movedata *)tmpdata; data < sizend; data++) {
data->plus *= cimage.bytesperpixel;
data->size *= cimage.bytesperpixel;
data->start *= cimage.bytesperpixel;
}
}
if (num)
avgsize = sum / num;
}
static void moveoldpoints(void * /*data1*/, struct taskinfo * /*task*/, int r1,
int r2)
{
struct movedata *data;
unsigned char *vline, *vbuff;
realloc_t *ry, *rend;
int i = r1;
for (ry = czoomc.reallocy + r1, rend = czoomc.reallocy + r2; ry < rend;
ry++, i++) {
if (!ry->dirty) {
assert(ry->plus < (unsigned int)cimage.height);
vbuff = cimage.currlines[i];
vline = cimage.oldlines[ry->plus];
for (data = (struct movedata *)tmpdata; data->size; data++) {
vbuff += data->plus;
memcpy(vbuff, vline + data->start, (size_t)data->size),
vbuff += data->size;
}
}
}
}
/* This function prepares fast filling tables for fillline */
static int mkfilltable(void)
{
int vsrc;
int pos;
realloc_t *rx, *r1, *r2, *rend, *rend2;
int n = 0;
int num = 0;
struct filltable *tbl = (struct filltable *)tmpdata;
pos = 0;
vsrc = 0;
rx = czoomc.reallocx;
while (rx > czoomc.reallocx && rx->dirty)
rx--;
for (rend = czoomc.reallocx + cimage.width,
rend2 = czoomc.reallocx + cimage.width;
rx < rend; rx++) {
if (rx->dirty) {
r1 = rx - 1;
for (r2 = rx + 1; r2 < rend2 && r2->dirty; r2++)
;
while (rx < rend2 && rx->dirty) {
n = (int)(r2 - rx);
assert(n > 0);
if (r2 < rend2 &&
(r1 < czoomc.reallocx ||
rx->position - r1->position > r2->position - rx->position))
vsrc = (int)(r2 - czoomc.reallocx), r1 = r2;
else {
vsrc = (int)(r1 - czoomc.reallocx);
if (vsrc < 0)
goto end;
}
pos = (int)(rx - czoomc.reallocx);
assert(pos >= 0 && pos < cimage.width);
assert(vsrc >= 0 && vsrc < cimage.width);
tbl[num].length = n;
tbl[num].to = pos * cimage.bytesperpixel;
tbl[num].from = vsrc * cimage.bytesperpixel;
tbl[num].end =
tbl[num].length * cimage.bytesperpixel + tbl[num].to;
/*printf("%i %i %i %i\n",num,tbl[num].length, tbl[num].to,
* tbl[num].from); */
while (n) {
rx->position = czoomc.reallocx[vsrc].position;
rx->dirty = 0;
rx++;
n--;
}
num++;
} /*while rx->dirty */
} /*if rx->dirty */
} /*for czoomc */
end:
tbl[num].length = 0;
tbl[num].to = pos;
tbl[num].from = vsrc;
return num;
}
static void filly(void * /*data*/, struct taskinfo * /*task*/, int rr1, int rr2)
{
unsigned char **vbuff = cimage.currlines;
realloc_t *ry, *r1, *r2, *rend, *rend2, *rs = NULL;
int linesize = cimage.width * cimage.bytesperpixel;
ry = czoomc.reallocy + rr1;
ry = czoomc.reallocy + rr1;
while (ry > czoomc.reallocy && ry->dirty > 0)
ry--;
for (rend = czoomc.reallocy + rr2, rend2 = czoomc.reallocy + cimage.height;
ry < rend; ry++) {
if (ry->dirty > 0) {
incincomplete();
r1 = ry - 1;
for (r2 = ry + 1; r2 < rend2 && r2->dirty > 0; r2++)
;
if (r2 >= rend2 && (rr2 != cimage.height || ry == 0))
return;
while (ry < rend2 && ry->dirty > 0) {
if (r1 < czoomc.reallocy) {
rs = r2;
if (r2 >= rend2)
return;
} else if (r2 >= rend2)
rs = r1;
else if (ry->position - r1->position <
r2->position - ry->position)
rs = r1;
else
rs = r2;
if (!rs->dirty) {
drivercall(cimage, fillline_8(rs - czoomc.reallocy),
fillline_16(rs - czoomc.reallocy),
fillline_24(rs - czoomc.reallocy),
fillline_32(rs - czoomc.reallocy));
ry->dirty = -1;
}
memcpy(vbuff[ry - czoomc.reallocy], vbuff[rs - czoomc.reallocy],
(size_t)linesize);
ry->position = rs->position;
ry->dirty = -1;
ry++;
}
}
if (ry < rend && !ry->dirty) {
drivercall(cimage, fillline_8(ry - czoomc.reallocy),
fillline_16(ry - czoomc.reallocy),
fillline_24(ry - czoomc.reallocy),
fillline_32(ry - czoomc.reallocy));
ry->dirty = -1;
}
}
}
static void fill(void)
{
if (cfilter.interrupt) {
cfilter.pass = "reducing resolution";
mkfilltable();
xth_function(filly, NULL, cimage.height);
}
xth_sync();
}
static void calculatenew(void * /*data*/, struct taskinfo *task, int /*r1*/,
int /*r2*/)
{
int s;
int i, y;
realloc_t *rx, *ry, *rend;
int range = cfractalc.range * 2;
int positions[16];
int calcpositions[16];
/*int s3; */
if (range < 1)
range = 1;
if (range > 16)
range = 16;
memset(positions, 0, sizeof(positions));
calcpositions[0] = 0;
positions[0] = 1;
for (s = 1; s < range;) {
for (i = 0; i < range; i++) {
if (!positions[i]) {