2 * libsortnetwork - src/sn_network.c
3 * Copyright (C) 2008-2010 Florian octo Forster
5 * This library is free software; you can redistribute it and/or modify it
6 * under the terms of the GNU Lesser General Public License as published by
7 * the Free Software Foundation; either version 2.1 of the License, or (at
8 * your option) any later version.
10 * This library is distributed in the hope that it will be useful, but WITHOUT
11 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
12 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public License
15 * You should have received a copy of the GNU Lesser General Public License
16 * along with this library; if not, write to the Free Software Foundation,
17 * Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
20 * Florian octo Forster <ff at octo.it>
23 #ifndef _ISOC99_SOURCE
24 # define _ISOC99_SOURCE
26 #ifndef _POSIX_C_SOURCE
27 # define _POSIX_C_SOURCE 200112L
31 # define DPRINTF(...) fprintf (stderr, "sn_network: " __VA_ARGS__)
33 # define DPRINTF(...) /**/
44 #include "sn_network.h"
45 #include "sn_random.h"
47 sn_network_t *sn_network_create (int inputs_num) /* {{{ */
51 n = (sn_network_t *) malloc (sizeof (sn_network_t));
54 memset (n, '\0', sizeof (sn_network_t));
56 n->inputs_num = inputs_num;
59 } /* }}} sn_network_t *sn_network_create */
61 void sn_network_destroy (sn_network_t *n) /* {{{ */
66 if (n->stages != NULL)
69 for (i = 0; i < n->stages_num; i++)
71 sn_stage_destroy (n->stages[i]);
79 } /* }}} void sn_network_destroy */
81 sn_network_t *sn_network_create_odd_even_mergesort (int inputs_num) /* {{{ */
85 assert (inputs_num > 0);
88 return (sn_network_create (inputs_num));
94 n = sn_network_create (inputs_num);
96 memset (&c, 0, sizeof (c));
100 sn_network_comparator_add (n, &c);
106 sn_network_t *n_left;
107 sn_network_t *n_right;
111 inputs_left = inputs_num / 2;
112 inputs_right = inputs_num - inputs_left;
114 n_left = sn_network_create_odd_even_mergesort (inputs_left);
118 n_right = sn_network_create_odd_even_mergesort (inputs_right);
121 sn_network_destroy (n_left);
125 n = sn_network_combine_odd_even_merge (n_left, n_right);
127 sn_network_destroy (n_left);
128 sn_network_destroy (n_right);
131 sn_network_compress (n);
135 } /* }}} sn_network_t *sn_network_create_odd_even_mergesort */
137 sn_network_t *sn_network_create_bitonic_mergesort (int inputs_num) /* {{{ */
141 assert (inputs_num > 0);
144 return (sn_network_create (inputs_num));
150 n = sn_network_create (inputs_num);
152 memset (&c, 0, sizeof (c));
156 sn_network_comparator_add (n, &c);
162 sn_network_t *n_left;
163 sn_network_t *n_right;
167 inputs_left = inputs_num / 2;
168 inputs_right = inputs_num - inputs_left;
170 n_left = sn_network_create_bitonic_mergesort (inputs_left);
174 if (inputs_left != inputs_right)
175 n_right = sn_network_create_bitonic_mergesort (inputs_right);
180 sn_network_destroy (n_left);
184 n = sn_network_combine_bitonic_merge (n_left, n_right);
186 if (n_left != n_right)
187 sn_network_destroy (n_right);
188 sn_network_destroy (n_left);
191 sn_network_compress (n);
195 } /* }}} sn_network_t *sn_network_create_bitonic_mergesort */
197 static int sn_network_create_pairwise_internal (sn_network_t *n, /* {{{ */
198 int *inputs, int inputs_num)
201 int inputs_copy[inputs_num];
204 for (i = 1; i < inputs_num; i += 2)
206 sn_comparator_t *c = sn_comparator_create (inputs[i-1], inputs[i]);
207 sn_network_comparator_add (n, c);
208 sn_comparator_destroy (c);
214 /* Sort "pairs" recursively. Like with odd-even mergesort, odd and even lines
215 * are handled recursively and later reunited. */
216 for (i = 0; i < inputs_num; i += 2)
217 inputs_copy[(int) (i / 2)] = inputs[i];
218 /* Recursive call #1 with first set of lines */
219 sn_network_create_pairwise_internal (n, inputs_copy,
220 (int) ((inputs_num + 1) / 2));
222 for (i = 1; i < inputs_num; i += 2)
223 inputs_copy[(int) (i / 2)] = inputs[i];
224 /* Recursive call #2 with second set of lines */
225 sn_network_create_pairwise_internal (n, inputs_copy,
226 (int) (inputs_num/ 2));
228 /* m is the "amplitude" of the sorted pairs. This is a bit tricky to read due
229 * to different indices being used in the paper, unfortunately. */
233 for (i = 1; (i + (m - 1)) < inputs_num; i += 2)
236 int right = i + (m - 1);
239 assert (left < right);
240 c = sn_comparator_create (inputs[left], inputs[right]);
241 sn_network_comparator_add (n, c);
242 sn_comparator_destroy (c);
246 } /* while (m > 1) */
249 } /* }}} int sn_network_create_pairwise_internal */
251 sn_network_t *sn_network_create_pairwise (int inputs_num) /* {{{ */
253 sn_network_t *n = sn_network_create (inputs_num);
254 int inputs[inputs_num];
260 for (i = 0; i < inputs_num; i++)
263 sn_network_create_pairwise_internal (n, inputs, inputs_num);
264 sn_network_compress (n);
267 } /* }}} sn_network_t *sn_network_create_pairwise */
269 int sn_network_network_add (sn_network_t *n, sn_network_t *other) /* {{{ */
274 if ((n == NULL) || (other == NULL))
277 stages_num = n->stages_num + other->stages_num;
278 if (stages_num <= n->stages_num)
281 tmp = realloc (n->stages, sizeof (*n->stages) * stages_num);
286 memcpy (n->stages + n->stages_num, other->stages,
287 sizeof (*other->stages) * other->stages_num);
288 n->stages_num = stages_num;
290 free (other->stages);
294 } /* }}} int sn_network_network_add */
296 int sn_network_stage_add (sn_network_t *n, sn_stage_t *s) /* {{{ */
300 if ((n == NULL) || (s == NULL))
303 temp = (sn_stage_t **) realloc (n->stages, (n->stages_num + 1)
304 * sizeof (sn_stage_t *));
309 SN_STAGE_DEPTH (s) = n->stages_num;
310 n->stages[n->stages_num] = s;
314 } /* }}} int sn_network_stage_add */
316 int sn_network_stage_remove (sn_network_t *n, int s_num) /* {{{ */
318 int nmemb = n->stages_num - (s_num + 1);
321 if ((n == NULL) || (s_num >= n->stages_num))
324 sn_stage_destroy (n->stages[s_num]);
325 n->stages[s_num] = NULL;
329 memmove (n->stages + s_num, n->stages + (s_num + 1),
330 nmemb * sizeof (sn_stage_t *));
331 n->stages[n->stages_num - 1] = NULL;
335 /* Free the unused memory */
336 if (n->stages_num == 0)
343 temp = (sn_stage_t **) realloc (n->stages,
344 n->stages_num * sizeof (sn_stage_t *));
351 } /* }}} int sn_network_stage_remove */
353 sn_network_t *sn_network_clone (const sn_network_t *n) /* {{{ */
355 sn_network_t *n_copy;
358 n_copy = sn_network_create (n->inputs_num);
362 for (i = 0; i < n->stages_num; i++)
367 s = sn_stage_clone (n->stages[i]);
371 status = sn_network_stage_add (n_copy, s);
376 if (i < n->stages_num)
378 sn_network_destroy (n_copy);
383 } /* }}} sn_network_t *sn_network_clone */
385 int sn_network_comparator_add (sn_network_t *n, /* {{{ */
386 const sn_comparator_t *c)
390 if ((n == NULL) || (c == NULL))
393 if (n->stages_num > 0)
395 s = n->stages[n->stages_num - 1];
397 if (sn_stage_comparator_check_conflict (s, c) == 0)
399 sn_stage_comparator_add (s, c);
404 s = sn_stage_create (n->stages_num);
405 sn_stage_comparator_add (s, c);
406 sn_network_stage_add (n, s);
409 } /* }}} int sn_network_comparator_add */
411 int sn_network_get_comparator_num (const sn_network_t *n) /* {{{ */
420 for (i = 0; i < n->stages_num; i++)
421 num += n->stages[i]->comparators_num;
424 } /* }}} int sn_network_get_comparator_num */
426 int sn_network_show_fh (sn_network_t *n, FILE *fh) /* {{{ */
430 for (i = 0; i < n->stages_num; i++)
431 sn_stage_show_fh (n->stages[i], fh);
434 } /* }}} int sn_network_show_fh */
436 int sn_network_show (sn_network_t *n) /* {{{ */
438 return (sn_network_show_fh (n, stdout));
439 } /* }}} int sn_network_show */
441 int sn_network_invert (sn_network_t *n) /* {{{ */
448 for (i = 0; i < n->stages_num; i++)
449 sn_stage_invert (n->stages[i]);
452 } /* }}} int sn_network_invert */
454 int sn_network_shift (sn_network_t *n, int sw) /* {{{ */
458 if ((n == NULL) || (sw < 0))
464 for (i = 0; i < n->stages_num; i++)
465 sn_stage_shift (n->stages[i], sw, SN_NETWORK_INPUT_NUM (n));
468 } /* }}} int sn_network_shift */
470 int sn_network_compress (sn_network_t *n) /* {{{ */
476 for (i = 1; i < n->stages_num; i++)
482 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
484 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
487 for (k = i - 1; k >= 0; k--)
491 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
506 sn_stage_comparator_add (n->stages[move_to], c);
507 sn_stage_comparator_remove (s, j);
513 while ((n->stages_num > 0)
514 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
515 sn_network_stage_remove (n, n->stages_num - 1);
518 } /* }}} int sn_network_compress */
520 int sn_network_normalize (sn_network_t *n) /* {{{ */
524 for (i = 0; i < n->stages_num; i++)
531 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
537 c = SN_STAGE_COMP_GET (s, j);
546 for (k = i; k < n->stages_num; k++)
547 sn_stage_swap (n->stages[k], min, max);
552 } /* for (j = 0 .. #comparators) */
553 } /* for (i = n->stages_num - 1 .. 0) */
556 } /* }}} int sn_network_normalize */
558 int sn_network_unify (sn_network_t *n) /* {{{ */
565 sn_network_normalize (n);
566 sn_network_compress (n);
568 for (i = 0; i < n->stages_num; i++)
569 sn_stage_unify (n->stages[i]);
572 } /* }}} int sn_network_unify */
574 int sn_network_remove_input (sn_network_t *n, int input) /* {{{ */
578 if ((n == NULL) || (input < 0) || (input >= n->inputs_num))
581 for (i = 0; i < n->stages_num; i++)
582 sn_stage_remove_input (n->stages[i], input);
587 } /* }}} int sn_network_remove_input */
589 int sn_network_cut_at (sn_network_t *n, int input, /* {{{ */
590 enum sn_network_cut_dir_e dir)
593 int position = input;
595 for (i = 0; i < n->stages_num; i++)
601 new_position = sn_stage_cut_at (s, position, dir);
603 if (position != new_position)
607 for (j = 0; j < i; j++)
608 sn_stage_swap (n->stages[j], position, new_position);
611 position = new_position;
614 assert (((dir == DIR_MIN) && (position == 0))
615 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
617 sn_network_remove_input (n, position);
620 } /* }}} int sn_network_cut_at */
622 int sn_network_cut (sn_network_t *n, int *mask) /* {{{ */
627 for (i = 0; i < n->stages_num; i++)
629 sn_stage_t *s = n->stages[i];
631 sn_stage_cut (s, mask, n->stages);
634 /* Use a copy of this member since it will be updated by
635 * sn_network_remove_input(). */
636 inputs_num = n->inputs_num;
637 for (i = 0; i < inputs_num; i++)
640 sn_network_remove_input (n, 0);
641 else if (mask[i] > 0)
642 sn_network_remove_input (n, n->inputs_num - 1);
646 } /* }}} int sn_network_cut */
648 /* sn_network_concatenate
650 * `Glues' two networks together, resulting in a comparator network with twice
651 * as many inputs but one that doesn't really sort anymore. It produces a
652 * bitonic sequence, though, that can be used by the mergers below. */
653 static sn_network_t *sn_network_concatenate (sn_network_t *n0, /* {{{ */
661 stages_num = (n0->stages_num > n1->stages_num)
665 n = sn_network_create (n0->inputs_num + n1->inputs_num);
669 for (i = 0; i < stages_num; i++)
671 sn_stage_t *s = sn_stage_create (i);
673 if (i < n0->stages_num)
674 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
676 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
677 sn_stage_comparator_add (s, c);
680 if (i < n1->stages_num)
681 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
683 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
684 sn_comparator_t c_copy;
686 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
687 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
689 sn_stage_comparator_add (s, &c_copy);
692 sn_network_stage_add (n, s);
696 } /* }}} sn_network_t *sn_network_concatenate */
698 static int sn_network_add_bitonic_merger (sn_network_t *n, /* {{{ */
699 int *indizes, int indizes_num)
703 if (indizes_num <= 1)
708 int even_indizes[indizes_num];
709 int even_indizes_num;
710 int odd_indizes[indizes_num];
713 even_indizes_num = (indizes_num + 1) / 2;
714 odd_indizes_num = indizes_num / 2;
716 for (i = 0; i < even_indizes_num; i++)
717 even_indizes[i] = indizes[2 * i];
718 for (i = 0; i < odd_indizes_num; i++)
719 odd_indizes[i] = indizes[(2 * i) + 1];
721 sn_network_add_bitonic_merger (n, even_indizes, even_indizes_num);
722 sn_network_add_bitonic_merger (n, odd_indizes, odd_indizes_num);
725 for (i = 1; i < indizes_num; i += 2)
729 memset (&c, 0, sizeof (c));
730 c.min = indizes[i - 1];
733 sn_network_comparator_add (n, &c);
737 } /* }}} int sn_network_add_bitonic_merger */
739 static int sn_network_add_odd_even_merger (sn_network_t *n, /* {{{ */
740 int *indizes_left, int indizes_left_num,
741 int *indizes_right, int indizes_right_num)
743 int tmp_left[indizes_left_num];
745 int tmp_right[indizes_left_num];
751 if ((indizes_left_num == 0) || (indizes_right_num == 0))
755 else if ((indizes_left_num == 1) && (indizes_right_num == 1))
760 c.min = *indizes_left;
761 c.max = *indizes_right;
763 s = sn_stage_create (n->stages_num);
767 sn_stage_comparator_add (s, &c);
768 sn_network_stage_add (n, s);
773 /* Merge odd sequences */
774 tmp_left_num = (indizes_left_num + 1) / 2;
775 for (i = 0; i < tmp_left_num; i++)
776 tmp_left[i] = indizes_left[2 * i];
778 tmp_right_num = (indizes_right_num + 1) / 2;
779 for (i = 0; i < tmp_right_num; i++)
780 tmp_right[i] = indizes_right[2 * i];
782 sn_network_add_odd_even_merger (n,
783 tmp_left, tmp_left_num,
784 tmp_right, tmp_right_num);
786 /* Merge even sequences */
787 tmp_left_num = indizes_left_num / 2;
788 for (i = 0; i < tmp_left_num; i++)
789 tmp_left[i] = indizes_left[(2 * i) + 1];
791 tmp_right_num = indizes_right_num / 2;
792 for (i = 0; i < tmp_right_num; i++)
793 tmp_right[i] = indizes_right[(2 * i) + 1];
795 sn_network_add_odd_even_merger (n,
796 tmp_left, tmp_left_num,
797 tmp_right, tmp_right_num);
799 /* Apply ``comparison-interchange'' operations. */
800 s = sn_stage_create (n->stages_num);
802 max_index = indizes_left_num + indizes_right_num;
803 if ((max_index % 2) == 0)
808 for (i = 1; i <= max_index; i += 2)
812 if (i < indizes_left_num)
813 c.min = indizes_left[i];
815 c.min = indizes_right[i - indizes_left_num];
817 if ((i + 1) < indizes_left_num)
818 c.max = indizes_left[i + 1];
820 c.max = indizes_right[i + 1 - indizes_left_num];
822 sn_stage_comparator_add (s, &c);
825 sn_network_stage_add (n, s);
828 } /* }}} int sn_network_add_odd_even_merger */
830 sn_network_t *sn_network_combine_bitonic_merge (sn_network_t *n0, /* {{{ */
833 sn_network_t *n0_clone;
835 int indizes_num = SN_NETWORK_INPUT_NUM (n0) + SN_NETWORK_INPUT_NUM (n1);
836 int indizes[indizes_num];
839 /* We need to invert n0, because the sequence must be
840 * z_1 >= z_2 >= ... >= z_k <= z_{k+1} <= ... <= z_p
841 * and NOT the other way around! Otherwise the comparators added in
842 * sn_network_add_bitonic_merger() from comparing (z_0,z_1), (z_2,z_3), ...
843 * to comparing ..., (z_{n-4},z_{n-3}), (z_{n-2},z_{n-1}), i.e. bound to the
844 * end of the list, possibly leaving z_0 uncompared. */
845 n0_clone = sn_network_clone (n0);
846 if (n0_clone == NULL)
848 sn_network_invert (n0_clone);
850 n = sn_network_concatenate (n0_clone, n1);
853 sn_network_destroy (n0_clone);
855 for (i = 0; i < indizes_num; i++)
858 sn_network_add_bitonic_merger (n, indizes, indizes_num);
861 } /* }}} sn_network_t *sn_network_combine_bitonic_merge */
863 sn_network_t *sn_network_combine_odd_even_merge (sn_network_t *n0, /* {{{ */
867 int indizes_left[n0->inputs_num];
868 int indizes_left_num;
869 int indizes_right[n1->inputs_num];
870 int indizes_right_num;
874 indizes_left_num = n0->inputs_num;
875 indizes_right_num = n1->inputs_num;
876 for (i = 0; i < indizes_left_num; i++)
878 for (i = 0; i < indizes_right_num; i++)
879 indizes_right[i] = indizes_left_num + i;
881 n = sn_network_concatenate (n0, n1);
885 status = sn_network_add_odd_even_merger (n,
886 indizes_left, indizes_left_num,
887 indizes_right, indizes_right_num);
890 sn_network_destroy (n);
894 sn_network_compress (n);
896 } /* }}} sn_network_t *sn_network_combine_odd_even_merge */
898 sn_network_t *sn_network_combine (sn_network_t *n0, /* {{{ */
901 return (sn_network_combine_odd_even_merge (n0, n1));
902 } /* }}} sn_network_t *sn_network_combine */
904 int sn_network_sort (sn_network_t *n, int *values) /* {{{ */
910 for (i = 0; i < n->stages_num; i++)
912 status = sn_stage_sort (n->stages[i], values);
918 } /* }}} int sn_network_sort */
920 int sn_network_brute_force_check (sn_network_t *n) /* {{{ */
922 int test_pattern[n->inputs_num];
923 int values[n->inputs_num];
927 memset (test_pattern, 0, sizeof (test_pattern));
933 /* Copy the current pattern and let the network sort it */
934 memcpy (values, test_pattern, sizeof (values));
935 status = sn_network_sort (n, values);
939 /* Check if the array is now sorted. */
940 previous = values[0];
941 for (i = 1; i < n->inputs_num; i++)
943 if (previous > values[i])
945 previous = values[i];
948 /* Generate the next test pattern */
950 for (i = 0; i < n->inputs_num; i++)
952 if (test_pattern[i] == 0)
965 /* Break out of the while loop if we tested all possible patterns */
970 /* All tests successfull */
972 } /* }}} int sn_network_brute_force_check */
974 sn_network_t *sn_network_read (FILE *fh) /* {{{ */
981 while (fgets (buffer, sizeof (buffer), fh) != NULL)
983 char *str_key = buffer;
984 char *str_value = NULL;
985 int buffer_len = strlen (buffer);
987 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
988 || (buffer[buffer_len - 1] == '\r')))
991 buffer[buffer_len] = '\0';
996 str_value = strchr (buffer, ':');
997 if (str_value == NULL)
999 printf ("Cannot parse line: %s\n", buffer);
1003 *str_value = '\0'; str_value++;
1004 while ((*str_value != '\0') && (isspace (*str_value) != 0))
1007 if (strcasecmp ("Inputs", str_key) == 0)
1008 opt_inputs = atoi (str_value);
1010 printf ("Unknown key: %s\n", str_key);
1011 } /* while (fgets) */
1016 n = sn_network_create (opt_inputs);
1022 s = sn_stage_read (fh);
1026 sn_network_stage_add (n, s);
1029 if (SN_NETWORK_STAGE_NUM (n) < 1)
1031 sn_network_destroy (n);
1036 } /* }}} sn_network_t *sn_network_read */
1038 sn_network_t *sn_network_read_file (const char *file) /* {{{ */
1043 fh = fopen (file, "r");
1047 n = sn_network_read (fh);
1052 } /* }}} sn_network_t *sn_network_read_file */
1054 int sn_network_write (sn_network_t *n, FILE *fh) /* {{{ */
1058 fprintf (fh, "Inputs: %i\n", n->inputs_num);
1061 for (i = 0; i < n->stages_num; i++)
1062 sn_stage_write (n->stages[i], fh);
1065 } /* }}} int sn_network_write */
1067 int sn_network_write_file (sn_network_t *n, const char *file) /* {{{ */
1072 fh = fopen (file, "w");
1076 status = sn_network_write (n, fh);
1081 } /* }}} int sn_network_write_file */
1083 int sn_network_serialize (sn_network_t *n, char **ret_buffer, /* {{{ */
1084 size_t *ret_buffer_size)
1091 buffer = *ret_buffer;
1092 buffer_size = *ret_buffer_size;
1094 #define SNPRINTF_OR_FAIL(...) \
1095 status = snprintf (buffer, buffer_size, __VA_ARGS__); \
1096 if ((status < 1) || (((size_t) status) >= buffer_size)) \
1099 buffer_size -= status;
1101 SNPRINTF_OR_FAIL ("Inputs: %i\r\n\r\n", n->inputs_num);
1103 for (i = 0; i < n->stages_num; i++)
1105 status = sn_stage_serialize (n->stages[i], &buffer, &buffer_size);
1110 *ret_buffer = buffer;
1111 *ret_buffer_size = buffer_size;
1113 } /* }}} int sn_network_serialize */
1115 sn_network_t *sn_network_unserialize (char *buffer, /* {{{ */
1121 if (buffer_size == 0)
1124 /* Read options first */
1125 while (buffer_size > 0)
1134 endptr = strchr (buffer, '\n');
1141 line_len = strlen (line);
1143 if ((line_len > 0) && (line[line_len - 1] == '\r'))
1145 line[line_len - 1] = 0;
1153 str_value = strchr (line, ':');
1154 if (str_value == NULL)
1156 printf ("Cannot parse line: %s\n", line);
1160 *str_value = '\0'; str_value++;
1161 while ((*str_value != '\0') && (isspace (*str_value) != 0))
1164 if (strcasecmp ("Inputs", str_key) == 0)
1165 opt_inputs = atoi (str_value);
1167 printf ("Unknown key: %s\n", str_key);
1168 } /* while (fgets) */
1173 n = sn_network_create (opt_inputs);
1179 s = sn_stage_unserialize (&buffer, &buffer_size);
1183 sn_network_stage_add (n, s);
1186 if (SN_NETWORK_STAGE_NUM (n) < 1)
1188 sn_network_destroy (n);
1193 } /* }}} sn_network_t *sn_network_unserialize */
1195 int sn_network_compare (const sn_network_t *n0, const sn_network_t *n1) /* {{{ */
1202 else if (n0 == NULL)
1204 else if (n1 == NULL)
1207 if (n0->inputs_num < n1->inputs_num)
1209 else if (n0->inputs_num > n1->inputs_num)
1212 if (n0->stages_num < n1->stages_num)
1214 else if (n0->stages_num > n1->stages_num)
1217 for (i = 0; i < n0->stages_num; i++)
1219 status = sn_stage_compare (n0->stages[i], n1->stages[i]);
1225 } /* }}} int sn_network_compare */
1227 uint64_t sn_network_get_hashval (const sn_network_t *n) /* {{{ */
1235 hash = (uint64_t) n->inputs_num;
1237 for (i = 0; i < n->stages_num; i++)
1238 hash = (hash * 104207) + sn_stage_get_hashval (n->stages[i]);
1241 } /* }}} uint64_t sn_network_get_hashval */
1243 /* vim: set sw=2 sts=2 et fdm=marker : */