2 * libsortnetwork - src/sn_stage.c
3 * Copyright (C) 2008-2010 Florian octo Forster
5 * This program is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU General Public License as published by the
7 * Free Software Foundation; only version 2 of the License is applicable.
9 * This program is distributed in the hope that it will be useful, but
10 * WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 * General Public License for more details.
14 * You should have received a copy of the GNU General Public License along
15 * with this program; if not, write to the Free Software Foundation, Inc.,
16 * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
19 * Florian octo Forster <ff at octo.it>
22 #ifndef _ISOC99_SOURCE
23 # define _ISOC99_SOURCE
25 #ifndef _POSIX_C_SOURCE
26 # define _POSIX_C_SOURCE 200112L
34 #include "sn_comparator.h"
37 sn_stage_t *sn_stage_create (int depth)
41 s = (sn_stage_t *) malloc (sizeof (sn_stage_t));
44 memset (s, '\0', sizeof (sn_stage_t));
49 } /* sn_stage_t *sn_stage_create */
51 void sn_stage_destroy (sn_stage_t *s)
55 if (s->comparators != NULL)
56 free (s->comparators);
58 } /* void sn_stage_destroy */
60 int sn_stage_sort (sn_stage_t *s, int *values)
65 for (i = 0; i < s->comparators_num; i++)
67 c = s->comparators + i;
68 if (values[c->min] > values[c->max])
72 temp = values[c->min];
73 values[c->min] = values[c->max];
74 values[c->max] = temp;
79 } /* int sn_stage_sort */
81 int sn_stage_comparator_add (sn_stage_t *s, const sn_comparator_t *c)
83 sn_comparator_t *temp;
86 if ((s == NULL) || (c == NULL))
89 i = sn_stage_comparator_check_conflict (s, c);
93 temp = (sn_comparator_t *) realloc (s->comparators,
94 (s->comparators_num + 1) * sizeof (sn_comparator_t));
97 s->comparators = temp;
100 for (i = 0; i < s->comparators_num; i++)
101 if (sn_comparator_compare (c, s->comparators + i) <= 0)
104 /* Insert the elements in ascending order */
105 assert (i <= s->comparators_num);
106 if (i < s->comparators_num)
108 int nmemb = s->comparators_num - i;
109 memmove (s->comparators + (i + 1), s->comparators + i,
110 nmemb * sizeof (sn_comparator_t));
112 memcpy (s->comparators + i, c, sizeof (sn_comparator_t));
113 s->comparators_num++;
116 } /* int sn_stage_comparator_add */
118 int sn_stage_comparator_remove (sn_stage_t *s, int c_num)
120 int nmemb = s->comparators_num - (c_num + 1);
121 sn_comparator_t *temp;
123 if ((s == NULL) || (s->comparators_num <= c_num))
126 assert (c_num < s->comparators_num);
130 memmove (s->comparators + c_num, s->comparators + (c_num + 1),
131 nmemb * sizeof (sn_comparator_t));
132 s->comparators_num--;
134 /* Free the unused memory */
135 if (s->comparators_num == 0)
137 free (s->comparators);
138 s->comparators = NULL;
142 temp = (sn_comparator_t *) realloc (s->comparators,
143 s->comparators_num * sizeof (sn_comparator_t));
146 s->comparators = temp;
150 } /* int sn_stage_comparator_remove */
152 sn_stage_t *sn_stage_clone (const sn_stage_t *s)
156 s_copy = sn_stage_create (s->depth);
160 s_copy->comparators = (sn_comparator_t *) malloc (s->comparators_num
161 * sizeof (sn_comparator_t));
162 if (s_copy->comparators == NULL)
168 memcpy (s_copy->comparators, s->comparators,
169 s->comparators_num * sizeof (sn_comparator_t));
170 s_copy->comparators_num = s->comparators_num;
173 } /* sn_stage_t *sn_stage_clone */
175 int sn_stage_comparator_check_conflict (sn_stage_t *s, const sn_comparator_t *c0)
179 for (i = 0; i < s->comparators_num; i++)
181 sn_comparator_t *c1 = s->comparators + i;
182 if ((SN_COMP_MIN(c0) == SN_COMP_MIN(c1))
183 || (SN_COMP_MIN(c0) == SN_COMP_MAX(c1))
184 || (SN_COMP_MAX(c0) == SN_COMP_MIN(c1))
185 || (SN_COMP_MAX(c0) == SN_COMP_MAX(c1)))
187 if ((SN_COMP_MIN(c0) == SN_COMP_MIN(c1))
188 && (SN_COMP_MAX(c0) == SN_COMP_MAX(c1)))
196 } /* int sn_stage_comparator_check_conflict */
198 int sn_stage_show (sn_stage_t *s)
200 int lines[s->comparators_num];
201 int right[s->comparators_num];
207 for (i = 0; i < s->comparators_num; i++)
213 for (i = 0; i < s->comparators_num; i++)
216 sn_comparator_t *c = s->comparators + i;
218 for (j = 0; j < lines_used; j++)
219 if (SN_COMP_LEFT (c) > right[j])
223 right[j] = SN_COMP_RIGHT (c);
228 for (i = 0; i < lines_used; i++)
230 printf ("%3i: ", s->depth);
232 for (j = 0; j <= right[i]; j++)
237 for (k = 0; k < s->comparators_num; k++)
239 sn_comparator_t *c = s->comparators + k;
241 /* Check if this comparator is displayed on another line */
245 if (j == SN_COMP_MIN (c))
247 else if (j == SN_COMP_MAX (c))
250 if ((j >= SN_COMP_LEFT (c)) && (j < SN_COMP_RIGHT (c)))
253 if ((on_elem != 0) || (line_after != 0))
264 else if (on_elem == -1)
278 } /* for (columns) */
284 } /* int sn_stage_show */
286 int sn_stage_invert (sn_stage_t *s)
293 for (i = 0; i < s->comparators_num; i++)
294 sn_comparator_invert (s->comparators + i);
297 } /* int sn_stage_invert */
299 int sn_stage_shift (sn_stage_t *s, int sw, int inputs_num)
303 if ((s == NULL) || (inputs_num < 2))
310 for (i = 0; i < s->comparators_num; i++)
311 sn_comparator_shift (s->comparators + i, sw, inputs_num);
314 } /* int sn_stage_shift */
316 int sn_stage_swap (sn_stage_t *s, int con0, int con1)
323 for (i = 0; i < s->comparators_num; i++)
324 sn_comparator_swap (s->comparators + i, con0, con1);
327 } /* int sn_stage_swap */
329 int sn_stage_cut_at (sn_stage_t *s, int input, enum sn_network_cut_dir_e dir)
331 int new_position = input;
334 if ((s == NULL) || (input < 0))
337 for (i = 0; i < s->comparators_num; i++)
339 sn_comparator_t *c = s->comparators + i;
341 if ((SN_COMP_MIN (c) != input) && (SN_COMP_MAX (c) != input))
344 if ((dir == DIR_MIN) && (SN_COMP_MAX (c) == input))
346 new_position = SN_COMP_MIN (c);
348 else if ((dir == DIR_MAX) && (SN_COMP_MIN (c) == input))
350 new_position = SN_COMP_MAX (c);
356 if (i < s->comparators_num)
357 sn_stage_comparator_remove (s, i);
360 return (new_position);
361 } /* int sn_stage_cut_at */
363 int sn_stage_remove_input (sn_stage_t *s, int input)
367 for (i = 0; i < s->comparators_num; i++)
369 sn_comparator_t *c = s->comparators + i;
371 if ((SN_COMP_MIN (c) == input) || (SN_COMP_MAX (c) == input))
373 sn_stage_comparator_remove (s, i);
378 if (SN_COMP_MIN (c) > input)
379 SN_COMP_MIN (c) = SN_COMP_MIN (c) - 1;
380 if (SN_COMP_MAX (c) > input)
381 SN_COMP_MAX (c) = SN_COMP_MAX (c) - 1;
387 sn_stage_t *sn_stage_read (FILE *fh)
393 s = sn_stage_create (0);
397 while (fgets (buffer, sizeof (buffer), fh) != NULL)
402 if ((buffer[0] == '\0') || (buffer[0] == '\n') || (buffer[0] == '\r'))
407 c.min = (int) strtol (buffer_ptr, &endptr, 0);
408 if (buffer_ptr == endptr)
413 c.max = (int) strtol (buffer_ptr, &endptr, 0);
414 if (buffer_ptr == endptr)
417 sn_stage_comparator_add (s, &c);
420 if (s->comparators_num == 0)
422 sn_stage_destroy (s);
427 } /* sn_stage_t *sn_stage_read */
429 int sn_stage_write (sn_stage_t *s, FILE *fh)
433 if (s->comparators_num <= 0)
436 for (i = 0; i < s->comparators_num; i++)
437 fprintf (fh, "%i %i\n",
438 SN_COMP_MIN (s->comparators + i),
439 SN_COMP_MAX (s->comparators + i));
443 } /* int sn_stage_write */
445 int sn_stage_serialize (sn_stage_t *s,
446 char **ret_buffer, size_t *ret_buffer_size)
453 if (s->comparators_num <= 0)
456 buffer = *ret_buffer;
457 buffer_size = *ret_buffer_size;
459 #define SNPRINTF_OR_FAIL(...) \
460 status = snprintf (buffer, buffer_size, __VA_ARGS__); \
461 if ((status < 1) || (((size_t) status) >= buffer_size)) \
464 buffer_size -= status;
466 for (i = 0; i < s->comparators_num; i++)
468 SNPRINTF_OR_FAIL ("%i %i\r\n",
469 SN_COMP_MIN (s->comparators + i),
470 SN_COMP_MAX (s->comparators + i));
473 SNPRINTF_OR_FAIL ("\r\n");
475 *ret_buffer = buffer;
476 *ret_buffer_size = buffer_size;
478 } /* int sn_stage_serialize */
480 sn_stage_t *sn_stage_unserialize (char **ret_buffer, size_t *ret_buffer_size)
487 buffer = *ret_buffer;
488 buffer_size = *ret_buffer_size;
490 if (buffer_size == 0)
493 s = sn_stage_create (0);
498 while (buffer_size > 0)
503 size_t substr_length;
505 endptr = strchr (buffer, '\n');
516 substr_length = strlen (buffer);
518 buffer_size -= (substr_length + 1);
520 if ((substr_length > 0) && (substr[substr_length - 1] == '\r'))
522 substr[substr_length - 1] = 0;
526 if (substr_length == 0)
533 c.min = (int) strtol (substr, &endptr, 0);
534 if (substr == endptr)
542 c.max = (int) strtol (substr, &endptr, 0);
543 if (substr == endptr)
549 sn_stage_comparator_add (s, &c);
550 } /* while (buffer_size > 0) */
552 if ((status != 0) || (s->comparators_num == 0))
554 sn_stage_destroy (s);
558 *ret_buffer = buffer;
559 *ret_buffer_size = buffer_size;
561 } /* sn_stage_t *sn_stage_unserialize */
563 /* vim: set shiftwidth=2 softtabstop=2 expandtab : */