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]);
42 } /* void sn_network_destroy */
44 int sn_network_stage_add (sn_network_t *n, sn_stage_t *s)
48 temp = (sn_stage_t **) realloc (n->stages, (n->stages_num + 1)
49 * sizeof (sn_stage_t *));
54 SN_STAGE_DEPTH (s) = n->stages_num;
55 n->stages[n->stages_num] = s;
59 } /* int sn_network_stage_add */
61 int sn_network_stage_remove (sn_network_t *n, int s_num)
63 int nmemb = n->stages_num - (s_num + 1);
66 assert (s_num < n->stages_num);
68 sn_stage_destroy (n->stages[s_num]);
69 n->stages[s_num] = NULL;
73 memmove (n->stages + s_num, n->stages + (s_num + 1),
74 nmemb * sizeof (sn_stage_t *));
75 n->stages[n->stages_num - 1] = NULL;
79 /* Free the unused memory */
80 if (n->stages_num == 0)
87 temp = (sn_stage_t **) realloc (n->stages,
88 n->stages_num * sizeof (sn_stage_t *));
95 } /* int sn_network_stage_remove */
97 int sn_network_show (sn_network_t *n)
101 for (i = 0; i < n->stages_num; i++)
102 sn_stage_show (n->stages[i]);
105 } /* int sn_network_show */
107 int sn_network_invert (sn_network_t *n)
111 for (i = 0; i < n->stages_num; i++)
112 sn_stage_invert (n->stages[i]);
115 } /* int sn_network_invert */
117 int sn_network_compress (sn_network_t *n)
123 for (i = 1; i < n->stages_num; i++)
129 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
131 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
134 for (k = i - 1; k >= 0; k--)
138 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
153 sn_stage_comparator_add (n->stages[move_to], c);
154 sn_stage_comparator_remove (s, j);
160 while ((n->stages_num > 0)
161 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
162 sn_network_stage_remove (n, n->stages_num - 1);
165 } /* int sn_network_compress */
167 int sn_network_cut_at (sn_network_t *n, int input, enum sn_network_cut_dir_e dir)
170 int position = input;
172 for (i = 0; i < n->stages_num; i++)
178 new_position = sn_stage_cut_at (s, position, dir);
180 if (position != new_position)
184 for (j = 0; j < i; j++)
185 sn_stage_swap (n->stages[j], position, new_position);
188 position = new_position;
191 assert (((dir == DIR_MIN) && (position == 0))
192 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
194 for (i = 0; i < n->stages_num; i++)
195 sn_stage_remove_input (n->stages[i], position);
200 } /* int sn_network_cut_at */
202 static int sn_network_add_bitonic_merger_recursive (sn_network_t *n,
212 s = sn_stage_create (n->stages_num);
218 for (i = low; i < (low + m); i++)
225 sn_stage_comparator_add (s, &c);
228 sn_network_stage_add (n, s);
230 sn_network_add_bitonic_merger_recursive (n, low, m);
231 sn_network_add_bitonic_merger_recursive (n, low + m, m);
234 } /* int sn_network_add_bitonic_merger_recursive */
236 static int sn_network_add_bitonic_merger (sn_network_t *n)
242 s = sn_stage_create (n->stages_num);
246 m = n->inputs_num / 2;
248 for (i = 0; i < m; i++)
253 c.max = n->inputs_num - (i + 1);
255 sn_stage_comparator_add (s, &c);
258 sn_network_stage_add (n, s);
260 sn_network_add_bitonic_merger_recursive (n, 0, m);
261 sn_network_add_bitonic_merger_recursive (n, m, m);
264 } /* int sn_network_add_bitonic_merger */
266 sn_network_t *sn_network_combine (sn_network_t *n0, sn_network_t *n1)
273 stages_num = (n0->stages_num > n1->stages_num)
277 n = sn_network_create (n0->inputs_num + n1->inputs_num);
281 for (i = 0; i < stages_num; i++)
283 sn_stage_t *s = sn_stage_create (i);
285 if (i < n0->stages_num)
286 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
288 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
289 sn_stage_comparator_add (s, c);
292 if (i < n1->stages_num)
293 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
295 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
296 sn_comparator_t c_copy;
298 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
299 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
301 sn_stage_comparator_add (s, &c_copy);
304 sn_network_stage_add (n, s);
307 sn_network_add_bitonic_merger (n);
308 sn_network_compress (n);
311 } /* sn_network_t *sn_network_combine */
313 sn_network_t *sn_network_read (FILE *fh)
320 while (fgets (buffer, sizeof (buffer), fh) != NULL)
322 char *str_key = buffer;
323 char *str_value = NULL;
324 int buffer_len = strlen (buffer);
326 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
327 || (buffer[buffer_len - 1] == '\r')))
330 buffer[buffer_len] = '\0';
335 str_value = strchr (buffer, ':');
336 if (str_value == NULL)
338 printf ("Cannot parse line: %s\n", buffer);
342 *str_value = '\0'; str_value++;
343 while ((*str_value != '\0') && (isspace (*str_value) != 0))
346 if (strcasecmp ("Inputs", str_key) == 0)
347 opt_inputs = atoi (str_value);
349 printf ("Unknown key: %s\n", str_key);
350 } /* while (fgets) */
355 n = sn_network_create (opt_inputs);
361 s = sn_stage_read (fh);
365 sn_network_stage_add (n, s);
368 if (SN_NETWORK_STAGE_NUM (n) < 1)
370 sn_network_destroy (n);
375 } /* sn_network_t *sn_network_read */
377 sn_network_t *sn_network_read_file (const char *file)
382 fh = fopen (file, "r");
386 n = sn_network_read (fh);
391 } /* sn_network_t *sn_network_read_file */
393 int sn_network_write (sn_network_t *n, FILE *fh)
397 fprintf (fh, "Inputs: %i\n", n->inputs_num);
400 for (i = 0; i < n->stages_num; i++)
401 sn_stage_write (n->stages[i], fh);
404 } /* int sn_network_write */
406 /* vim: set shiftwidth=2 softtabstop=2 : */