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 if (n->stages_num == 0)
83 temp = (sn_stage_t **) realloc (n->stages,
84 n->stages_num * sizeof (sn_stage_t *));
91 } /* int sn_network_stage_remove */
93 int sn_network_show (sn_network_t *n)
97 for (i = 0; i < n->stages_num; i++)
98 sn_stage_show (n->stages[i]);
101 } /* int sn_network_show */
103 int sn_network_invert (sn_network_t *n)
107 for (i = 0; i < n->stages_num; i++)
108 sn_stage_invert (n->stages[i]);
111 } /* int sn_network_invert */
113 int sn_network_compress (sn_network_t *n)
119 for (i = 1; i < n->stages_num; i++)
125 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
127 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
130 for (k = i - 1; k >= 0; k--)
134 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
149 sn_stage_comparator_add (n->stages[move_to], c);
150 sn_stage_comparator_remove (s, j);
156 while ((n->stages_num > 0)
157 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
158 sn_network_stage_remove (n, n->stages_num - 1);
161 } /* int sn_network_compress */
163 int sn_network_cut_at (sn_network_t *n, int input, enum sn_network_cut_dir_e dir)
166 int position = input;
168 for (i = 0; i < n->stages_num; i++)
174 new_position = sn_stage_cut_at (s, position, dir);
176 if (position != new_position)
180 for (j = 0; j < i; j++)
181 sn_stage_swap (n->stages[j], position, new_position);
184 position = new_position;
187 assert (((dir == DIR_MIN) && (position == 0))
188 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
190 for (i = 0; i < n->stages_num; i++)
191 sn_stage_remove_input (n->stages[i], position);
196 } /* int sn_network_cut_at */
198 static int sn_network_add_bitonic_merger_recursive (sn_network_t *n,
205 s = sn_stage_create (n->stages_num);
214 for (i = low; i < (low + m); i++)
221 sn_stage_comparator_add (s, &c);
224 sn_network_stage_add (n, s);
226 sn_network_add_bitonic_merger_recursive (n, low, m);
227 sn_network_add_bitonic_merger_recursive (n, low + m, m);
230 } /* int sn_network_add_bitonic_merger_recursive */
232 static int sn_network_add_bitonic_merger (sn_network_t *n)
238 s = sn_stage_create (n->stages_num);
242 m = n->inputs_num / 2;
244 for (i = 0; i < m; i++)
249 c.max = n->inputs_num - (i + 1);
251 sn_stage_comparator_add (s, &c);
254 sn_network_stage_add (n, s);
256 sn_network_add_bitonic_merger_recursive (n, 0, m);
257 sn_network_add_bitonic_merger_recursive (n, m, m);
260 } /* int sn_network_add_bitonic_merger */
262 sn_network_t *sn_network_combine (sn_network_t *n0, sn_network_t *n1)
269 stages_num = (n0->stages_num > n1->stages_num)
273 n = sn_network_create (n0->inputs_num + n1->inputs_num);
277 for (i = 0; i < stages_num; i++)
279 sn_stage_t *s = sn_stage_create (i);
281 if (i < n0->stages_num)
282 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
284 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
285 sn_stage_comparator_add (s, c);
288 if (i < n1->stages_num)
289 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
291 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
292 sn_comparator_t c_copy;
294 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
295 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
297 sn_stage_comparator_add (s, &c_copy);
300 sn_network_stage_add (n, s);
303 sn_network_add_bitonic_merger (n);
304 sn_network_compress (n);
307 } /* sn_network_t *sn_network_combine */
309 sn_network_t *sn_network_read (FILE *fh)
316 while (fgets (buffer, sizeof (buffer), fh) != NULL)
318 char *str_key = buffer;
319 char *str_value = NULL;
320 int buffer_len = strlen (buffer);
322 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
323 || (buffer[buffer_len - 1] == '\r')))
326 buffer[buffer_len] = '\0';
331 str_value = strchr (buffer, ':');
332 if (str_value == NULL)
334 printf ("Cannot parse line: %s\n", buffer);
338 *str_value = '\0'; str_value++;
339 while ((*str_value != '\0') && (isspace (*str_value) != 0))
342 if (strcasecmp ("Inputs", str_key) == 0)
343 opt_inputs = atoi (str_value);
345 printf ("Unknown key: %s\n", str_key);
346 } /* while (fgets) */
351 n = sn_network_create (opt_inputs);
357 s = sn_stage_read (fh);
361 sn_network_stage_add (n, s);
364 if (SN_NETWORK_STAGE_NUM (n) < 1)
366 sn_network_destroy (n);
371 } /* sn_network_t *sn_network_read */
373 sn_network_t *sn_network_read_file (const char *file)
378 fh = fopen (file, "r");
382 n = sn_network_read (fh);
387 } /* sn_network_t *sn_network_read_file */
389 int sn_network_write (sn_network_t *n, FILE *fh)
393 fprintf (fh, "Inputs: %i\n", n->inputs_num);
396 for (i = 0; i < n->stages_num; i++)
397 sn_stage_write (n->stages[i], fh);
400 } /* int sn_network_write */
402 /* vim: set shiftwidth=2 softtabstop=2 : */