8 #include "sn_network.h"
10 sn_network_t *sn_network_create (int inputs_num)
14 n = (sn_network_t *) malloc (sizeof (sn_network_t));
17 memset (n, '\0', sizeof (sn_network_t));
19 n->inputs_num = inputs_num;
22 } /* sn_network_t *sn_network_create */
24 void sn_network_destroy (sn_network_t *n)
29 if (n->stages != NULL)
32 for (i = 0; i < n->stages_num; i++)
34 sn_stage_destroy (n->stages[i]);
41 } /* void sn_network_destroy */
43 int sn_network_stage_add (sn_network_t *n, sn_stage_t *s)
47 temp = (sn_stage_t **) realloc (n->stages, (n->stages_num + 1)
48 * sizeof (sn_stage_t *));
53 SN_STAGE_DEPTH (s) = n->stages_num;
54 n->stages[n->stages_num] = s;
58 } /* int sn_network_stage_add */
60 int sn_network_stage_remove (sn_network_t *n, int s_num)
62 int nmemb = n->stages_num - (s_num + 1);
65 assert (s_num < n->stages_num);
67 sn_stage_destroy (n->stages[s_num]);
68 n->stages[s_num] = NULL;
71 memmove (n->stages + s_num, n->stages + (s_num + 1),
72 nmemb * sizeof (sn_stage_t *));
75 /* Free the unused memory */
76 temp = (sn_stage_t **) realloc (n->stages,
77 n->stages_num * sizeof (sn_stage_t *));
83 } /* int sn_network_stage_remove */
85 int sn_network_show (sn_network_t *n)
89 for (i = 0; i < n->stages_num; i++)
90 sn_stage_show (n->stages[i]);
93 } /* int sn_network_show */
95 int sn_network_invert (sn_network_t *n)
99 for (i = 0; i < n->stages_num; i++)
100 sn_stage_invert (n->stages[i]);
103 } /* int sn_network_invert */
105 int sn_network_compress (sn_network_t *n)
111 for (i = 1; i < n->stages_num; i++)
117 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
119 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
122 for (k = i - 1; k >= 0; k--)
126 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
141 sn_stage_comparator_add (n->stages[move_to], c);
142 sn_stage_comparator_remove (s, j);
149 } /* int sn_network_compress */
151 int sn_network_cut_at (sn_network_t *n, int input, enum sn_network_cut_dir_e dir)
154 int position = input;
156 for (i = 0; i < n->stages_num; i++)
162 new_position = sn_stage_cut_at (s, position, dir);
164 if (position != new_position)
168 for (j = 0; j < i; j++)
169 sn_stage_swap (n->stages[j], position, new_position);
172 position = new_position;
175 assert (((dir == DIR_MIN) && (position == 0))
176 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
179 for (i = 0; i < n->stages_num; i++)
180 sn_stage_remove_input (n->stages[i], position);
185 } /* int sn_network_cut_at */
187 static int sn_network_add_bitonic_merger_recursive (sn_network_t *n,
194 s = sn_stage_create (n->stages_num);
203 for (i = low; i < (low + m); i++)
210 sn_stage_comparator_add (s, &c);
213 sn_network_stage_add (n, s);
215 sn_network_add_bitonic_merger_recursive (n, low, m);
216 sn_network_add_bitonic_merger_recursive (n, low + m, m);
219 } /* int sn_network_add_bitonic_merger_recursive */
221 static int sn_network_add_bitonic_merger (sn_network_t *n)
227 s = sn_stage_create (n->stages_num);
231 m = n->inputs_num / 2;
233 for (i = 0; i < m; i++)
238 c.max = n->inputs_num - (i + 1);
240 sn_stage_comparator_add (s, &c);
243 sn_network_stage_add (n, s);
245 sn_network_add_bitonic_merger_recursive (n, 0, m);
246 sn_network_add_bitonic_merger_recursive (n, m, m);
249 } /* int sn_network_add_bitonic_merger */
251 sn_network_t *sn_network_combine (sn_network_t *n0, sn_network_t *n1)
258 stages_num = (n0->stages_num > n1->stages_num)
262 n = sn_network_create (n0->inputs_num + n1->inputs_num);
266 for (i = 0; i < stages_num; i++)
268 sn_stage_t *s = sn_stage_create (i);
270 if (i < n0->stages_num)
271 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
273 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
274 sn_stage_comparator_add (s, c);
277 if (i < n1->stages_num)
278 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
280 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
281 sn_comparator_t c_copy;
283 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
284 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
286 sn_stage_comparator_add (s, &c_copy);
289 sn_network_stage_add (n, s);
292 sn_network_add_bitonic_merger (n);
293 sn_network_compress (n);
296 } /* sn_network_t *sn_network_combine */
298 sn_network_t *sn_network_read (FILE *fh)
305 while (fgets (buffer, sizeof (buffer), fh) != NULL)
307 char *str_key = buffer;
308 char *str_value = NULL;
309 int buffer_len = strlen (buffer);
311 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
312 || (buffer[buffer_len - 1] == '\r')))
315 buffer[buffer_len] = '\0';
320 str_value = strchr (buffer, ':');
321 if (str_value == NULL)
323 printf ("Cannot parse line: %s\n", buffer);
327 *str_value = '\0'; str_value++;
328 while ((*str_value != '\0') && (isspace (*str_value) != 0))
331 if (strcasecmp ("Inputs", str_key) == 0)
332 opt_inputs = atoi (str_value);
334 printf ("Unknown key: %s\n", str_key);
335 } /* while (fgets) */
340 n = sn_network_create (opt_inputs);
346 s = sn_stage_read (fh);
350 sn_network_stage_add (n, s);
353 if (SN_NETWORK_STAGE_NUM (n) < 1)
355 sn_network_destroy (n);
360 } /* sn_network_t *sn_network_read */
362 sn_network_t *sn_network_read_file (const char *file)
367 fh = fopen (file, "r");
371 n = sn_network_read (fh);
376 } /* sn_network_t *sn_network_read_file */
378 int sn_network_write (sn_network_t *n, FILE *fh)
382 fprintf (fh, "Inputs: %i\n", n->inputs_num);
385 for (i = 0; i < n->stages_num; i++)
386 sn_stage_write (n->stages[i], fh);
389 } /* int sn_network_write */
391 /* vim: set shiftwidth=2 softtabstop=2 : */