-
Notifications
You must be signed in to change notification settings - Fork 0
/
fractol_draw3.c
161 lines (150 loc) · 4.13 KB
/
fractol_draw3.c
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
/* ************************************************************************** */
/* */
/* ::: :::::::: */
/* fractol_draw3.c :+: :+: :+: */
/* +:+ +:+ +:+ */
/* By: rpohlen <rpohlen@student.42.fr> +#+ +:+ +#+ */
/* +#+#+#+#+#+ +#+ */
/* Created: 2022/01/12 21:08:32 by rpohlen #+# #+# */
/* Updated: 2022/01/23 01:37:18 by rpohlen ### ########.fr */
/* */
/* ************************************************************************** */
#include "fractol.h"
// Recaculates map partially according to an offset value
// This is done after shifting the map, to optimize moving the view
void fill_map_d(t_fract data, int n)
{
int x;
int y;
t_complex variable;
variable.y = data.pos.y - data.step * (data.winy - 1);
y = data.winy - 1;
while (y >= data.winy - n)
{
variable.x = data.pos.x;
x = 0;
while (x < data.winx)
{
data.map[y][x] = escape_time_global(variable, data.constant,
data.max_iter, data.type);
variable.x += data.step;
x++;
}
variable.y += data.step;
y--;
}
}
void fill_map_u(t_fract data, int n)
{
int x;
int y;
t_complex variable;
variable.y = data.pos.y;
y = 0;
while (y < n)
{
variable.x = data.pos.x;
x = 0;
while (x < data.winx)
{
data.map[y][x] = escape_time_global(variable, data.constant,
data.max_iter, data.type);
variable.x += data.step;
x++;
}
variable.y -= data.step;
y++;
}
}
void fill_map_r(t_fract data, int n)
{
int x;
int y;
t_complex variable;
variable.x = data.pos.x + data.step * (data.winx - 1);
x = data.winx - 1;
while (x >= data.winx - n)
{
variable.y = data.pos.y;
y = 0;
while (y < data.winy)
{
data.map[y][x] = escape_time_global(variable, data.constant,
data.max_iter, data.type);
variable.y -= data.step;
y++;
}
variable.x -= data.step;
x--;
}
}
void fill_map_l(t_fract data, int n)
{
int x;
int y;
t_complex variable;
variable.x = data.pos.x;
x = 0;
while (x < n)
{
variable.y = data.pos.y;
y = 0;
while (y < data.winy)
{
data.map[y][x] = escape_time_global(variable, data.constant,
data.max_iter, data.type);
variable.y -= data.step;
y++;
}
variable.x += data.step;
x++;
}
}
/* --------------------------------------------------------------------- *\
| thread_task
|
| Executes a job in multiple threads, with the help of pthread.
|
| Each instance of the job will auto-assign an id, using mutex locking,
| so that they do so in an orderly and structured manner.
|
| The id is initialized at -1 and the first thread increments it directly
| to 0.
|
| This id is then used to decide where to start each instance's loop, and
| the number of threads is used to decide by how much to increment
| the index.
|
| The threads are then automatically handled by the cpu, and distributed
| in an optimized manner to the available cores.
|
| NUMTHREADS should be set at least to the amount of available cores to
| see the best results. Too high a number causes slowdowns, but
| anything below 100 typically does not see enough diminishing returns
| to make a difference.
\* --------------------------------------------------------------------- */
void thread_task(t_fract *data, char task)
{
int err;
int i;
pthread_t threads[NUMTHREADS];
if (pthread_mutex_init(&(data->mutex), NULL))
return ;
data->thread = -1;
i = -1;
while (++i < NUMTHREADS)
{
if (task == 'c')
err = pthread_create(threads + i, NULL, &calculate_map, data);
else if (task == 'd')
err = pthread_create(threads + i, NULL, &draw_fractal, data);
else if (task == 's')
err = pthread_create(threads + i, NULL, &render_ssaa, data);
if (err)
return ;
}
i = -1;
while (++i < NUMTHREADS)
pthread_join(threads[i], NULL);
pthread_mutex_destroy(&data->mutex);
}