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
|
/*
* fractal-gen - Generate iteration-based fractals in PNM format
* Copyright (c) 2015 David Phillips <dbphillipsnz@gmail.com>
* All rights reserved
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*/
#include "fractal-gen.h"
struct section_generator
{
char *executable_name;
void *(*generator)(void *);
};
int main(int argc, char **argv)
{
unsigned long x, y, i;
double thread_mult;
double ram_nice = 0.f;
char* ram_unit = NULL;
char* bname;
data_section* sections;
void *(*generator)(void *);
struct section_generator generators[] = {
{ "mandelbrot-gen" , &generate_mandelbrot_section },
{ "burning-ship-gen" , &generate_burning_ship_section },
{ "burning-ship-lattice-gen" , &generate_burning_ship_lattice_section },
{ "tricorn-gen" , &generate_tricorn_section }
};
/* Select correct generator for the fractal type */
bname = basename(argv[0]);
generator = NULL;
for (i = 0; i < sizeof(generators)/sizeof(struct section_generator); i++)
if (strcmp(bname, generators[i].executable_name) == 0)
generator = generators[i].generator;
if (generator == NULL)
{
fprintf(stderr, "Don't call this directly, call a symlink to me\n");
return EXIT_FAILURE;
}
if (argc < 4 || argc > 7)
{
fprintf(stderr,
"%s size iterat power [threads]\n"
"%s size iterat power thread_multiplier cluster-id cluster-total\n",
argv[0], argv[0]);
return EXIT_FAILURE;
}
size = atoi(argv[1]);
iterat = atoi(argv[2]);
power = atof(argv[3]);
/* Fetch or use defaults for
* - num cores available
* - our ID in cluster
* - total members in cluster
*/
cores = (argc == 5)? atoi(argv[4]) : sysconf(_SC_NPROCESSORS_ONLN);
thread_mult = argc == 7? atof(argv[4]) : 1.f;
clust_id = argc == 7? atoi(argv[5]) : 0;
clust_total = argc == 7? atoi(argv[6]) : 1;
/* Extend number of threads to multiplier value */
cores *= thread_mult;
/* Interlacing is column-based, can't have more workers than columns */
if (cores > size)
{
fprintf(stderr, "WARN: Capping number of threads to image width\n");
cores = size;
}
if (size % clust_total != 0)
{
fprintf(stderr, "ERROR: size must be an exact multiple of clust_total\n");
return EXIT_FAILURE;
}
assert(size > 0);
assert(iterat > 0);
assert(cores > 0);
/* Allocate memory for sections */
if ((sections = malloc(sizeof(data_section)*cores)) == NULL)
{
perror("malloc");
return EXIT_FAILURE;
}
ram_nice = (size*size)/clust_total;
if (ram_nice < 1024)
ram_unit = "B";
else if (ram_nice < 1024*1024)
ram_nice /= 1024, ram_unit = "KiB";
else if (ram_nice < 1024*1024*1024)
ram_nice /= (1024*1024), ram_unit = "MiB";
else
ram_nice /= (1024*1024*1024), ram_unit = "GiB";
fprintf(stderr,
"Forecast resource use:\n"
" Threads: %d\n"
" RAM : ~%.4f %s\n",
cores,
ram_nice,
ram_unit);
/* Spawn all the threads! Something something interlacing */
for (i = 0; i < cores; i++)
{
/* A bit complex, icky, will document later */
if (i < (size%cores))
x = (size/cores)+1;
else
x = (size/cores);
x *= size;
x = ceilf((double)x/clust_total);
if ((sections[i].data = malloc(x)) == NULL)
{
fprintf(stderr, "\nmalloc of %lu bytes failed\n", x);
perror("malloc");
/* Free already allocated chunks of memory */
i--;
while(i-- + 1)
free(sections[i].data);
free(sections);
return EXIT_FAILURE;
}
sections[i].core = i;
sections[i].datasize = x;
fprintf(stderr, " -> Thread %lu\r", i);
pthread_create(§ions[i].thread, NULL, generator, &(sections[i]));
}
while((x = sections[0].idx) < sections[0].datasize)
{
fprintf(stderr, "Thread 0: %.4f%%\r", 100.f*(double)x/sections[0].datasize );
sleep(1);
}
/* Wait for each thread to complete */
for (i = 0; i < cores; i++)
pthread_join(sections[i].thread, NULL);
/* Output PGM Header */
printf("P5\n%d\n%d\n255\n",size/clust_total,size);
/* Vomit the data segments back onto the screen, deinterlacing
* TO DO: look at fwrite performance benefits over putchar */
for (y = 0; y < size; y++)
for (x = 0; x < size/clust_total; x++)
putchar(sections[y%cores].data[(y/cores)*(size/clust_total) + x]);
fprintf(stderr, "\nDone\n");
/* Free the memory we allocated for point data */
for (i = 0; i < cores; i++)
free(sections[i].data);
free(sections);
return 0;
}
|
