5 #include "sn_comparator.h"
8 sn_stage_t *sn_stage_create (int depth)
12 s = (sn_stage_t *) malloc (sizeof (sn_stage_t));
15 memset (s, '\0', sizeof (sn_stage_t));
20 } /* sn_stage_t *sn_stage_create */
22 void sn_stage_destroy (sn_stage_t *s)
26 if (s->comparators != NULL)
27 free (s->comparators);
29 } /* void sn_stage_destroy */
31 int sn_stage_comparator_add (sn_stage_t *s, const sn_comparator_t *c)
33 sn_comparator_t *temp;
36 temp = (sn_comparator_t *) realloc (s->comparators,
37 (s->comparators_num + 1) * sizeof (sn_comparator_t));
40 s->comparators = temp;
43 for (i = 0; i < s->comparators_num; i++)
44 if (sn_comparator_compare (c, s->comparators + i) <= 0)
47 /* Insert the elements in ascending order */
48 assert (i <= s->comparators_num);
49 if (i < s->comparators_num)
51 int nmemb = s->comparators_num - i;
52 memmove (s->comparators + (i + 1), s->comparators + i,
53 nmemb * sizeof (sn_comparator_t));
55 memcpy (s->comparators + i, c, sizeof (sn_comparator_t));
59 } /* int sn_stage_comparator_add */
61 int sn_stage_comparator_remove (sn_stage_t *s, int c_num)
63 int nmemb = s->comparators_num - (c_num + 1);
64 sn_comparator_t *temp;
66 assert (c_num < s->comparators_num);
69 memmove (s->comparators + c_num, s->comparators + (c_num + 1),
70 nmemb * sizeof (sn_comparator_t));
73 /* Free the unused memory */
74 temp = (sn_comparator_t *) realloc (s->comparators,
75 s->comparators_num * sizeof (sn_comparator_t));
78 s->comparators = temp;
81 } /* int sn_stage_comparator_remove */
83 int sn_stage_comparator_check_conflict (sn_stage_t *s, const sn_comparator_t *c0)
87 for (i = 0; i < s->comparators_num; i++)
89 sn_comparator_t *c1 = s->comparators + i;
90 if ((SN_COMP_MIN(c0) == SN_COMP_MIN(c1))
91 || (SN_COMP_MIN(c0) == SN_COMP_MAX(c1))
92 || (SN_COMP_MAX(c0) == SN_COMP_MIN(c1))
93 || (SN_COMP_MAX(c0) == SN_COMP_MAX(c1)))
95 if ((SN_COMP_MIN(c0) == SN_COMP_MIN(c1))
96 && (SN_COMP_MAX(c0) == SN_COMP_MAX(c1)))
104 } /* int sn_stage_comparator_check_conflict */
106 int sn_stage_show (sn_stage_t *s)
108 int lines[s->comparators_num];
109 int right[s->comparators_num];
116 for (i = 0; i < s->comparators_num; i++)
122 for (i = 0; i < s->comparators_num; i++)
125 sn_comparator_t *c = s->comparators + i;
127 for (j = 0; j < lines_used; j++)
128 if (SN_COMP_LEFT (c) > right[j])
132 right[j] = SN_COMP_RIGHT (c);
137 for (i = 0; i < lines_used; i++)
139 printf ("%3i: ", s->depth);
141 for (j = 0; j <= right[i]; j++)
146 for (k = 0; k < s->comparators_num; k++)
148 sn_comparator_t *c = s->comparators + k;
150 /* Check if this comparator is displayed on another line */
154 if (j == SN_COMP_MIN (c))
156 else if (j == SN_COMP_MAX (c))
159 if ((j >= SN_COMP_LEFT (c)) && (j < SN_COMP_RIGHT (c)))
162 if ((on_elem != 0) || (line_after != 0))
173 else if (on_elem == -1)
187 } /* for (columns) */
193 } /* int sn_stage_show */
195 int sn_stage_invert (sn_stage_t *s)
199 for (i = 0; i < s->comparators_num; i++)
200 sn_comparator_invert (s->comparators + i);
203 } /* int sn_stage_invert */
205 int sn_stage_swap (sn_stage_t *s, int con0, int con1)
209 for (i = 0; i < s->comparators_num; i++)
210 sn_comparator_swap (s->comparators + i, con0, con1);
213 } /* int sn_stage_swap */
215 int sn_stage_cut_at (sn_stage_t *s, int input, enum sn_network_cut_dir_e dir)
217 int new_position = input;
220 for (i = 0; i < s->comparators_num; i++)
222 sn_comparator_t *c = s->comparators + i;
224 if ((SN_COMP_MIN (c) != input) && (SN_COMP_MAX (c) != input))
227 if ((dir == DIR_MIN) && (SN_COMP_MAX (c) == input))
229 new_position = SN_COMP_MIN (c);
231 else if ((dir == DIR_MAX) && (SN_COMP_MIN (c) == input))
233 new_position = SN_COMP_MAX (c);
239 if (i < s->comparators_num)
240 sn_stage_comparator_remove (s, i);
243 return (new_position);
244 } /* int sn_stage_cut_at */
246 int sn_stage_remove_input (sn_stage_t *s, int input)
250 for (i = 0; i < s->comparators_num; i++)
252 sn_comparator_t *c = s->comparators + i;
254 if ((SN_COMP_MIN (c) == input) || (SN_COMP_MAX (c) == input))
256 sn_stage_comparator_remove (s, i);
261 if (SN_COMP_MIN (c) > input)
262 SN_COMP_MIN (c) = SN_COMP_MIN (c) - 1;
263 if (SN_COMP_MAX (c) > input)
264 SN_COMP_MAX (c) = SN_COMP_MAX (c) - 1;
270 sn_stage_t *sn_stage_read (FILE *fh)
276 s = sn_stage_create (0);
280 while (fgets (buffer, sizeof (buffer), fh) != NULL)
285 if ((buffer[0] == '\0') || (buffer[0] == '\n') || (buffer[0] == '\r'))
290 c.min = (int) strtol (buffer_ptr, &endptr, 0);
291 if (buffer_ptr == endptr)
296 c.max = (int) strtol (buffer_ptr, &endptr, 0);
297 if (buffer_ptr == endptr)
300 sn_stage_comparator_add (s, &c);
303 if (s->comparators_num == 0)
305 sn_stage_destroy (s);
310 } /* sn_stage_t *sn_stage_read */
312 int sn_stage_write (sn_stage_t *s, FILE *fh)
316 if (s->comparators_num <= 0)
319 for (i = 0; i < s->comparators_num; i++)
320 fprintf (fh, "%i %i\n",
321 SN_COMP_MIN (s->comparators + i),
322 SN_COMP_MAX (s->comparators + i));
326 } /* int sn_stage_write */
328 /* vim: set shiftwidth=2 softtabstop=2 : */