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) /* {{{ */
275 if ((n == NULL) || (other == NULL))
278 stages_num = n->stages_num + other->stages_num;
279 if (stages_num <= n->stages_num)
282 tmp = realloc (n->stages, sizeof (*n->stages) * stages_num);
287 memcpy (n->stages + n->stages_num, other->stages,
288 sizeof (*other->stages) * other->stages_num);
289 for (i = n->stages_num; i < stages_num; i++)
290 SN_STAGE_DEPTH(n->stages[i]) = i;
292 n->stages_num = stages_num;
294 free (other->stages);
298 } /* }}} int sn_network_network_add */
300 int sn_network_stage_add (sn_network_t *n, sn_stage_t *s) /* {{{ */
304 if ((n == NULL) || (s == NULL))
307 temp = (sn_stage_t **) realloc (n->stages, (n->stages_num + 1)
308 * sizeof (sn_stage_t *));
313 SN_STAGE_DEPTH (s) = n->stages_num;
314 n->stages[n->stages_num] = s;
318 } /* }}} int sn_network_stage_add */
320 int sn_network_stage_remove (sn_network_t *n, int s_num) /* {{{ */
322 int nmemb = n->stages_num - (s_num + 1);
325 if ((n == NULL) || (s_num >= n->stages_num))
328 sn_stage_destroy (n->stages[s_num]);
329 n->stages[s_num] = NULL;
333 memmove (n->stages + s_num, n->stages + (s_num + 1),
334 nmemb * sizeof (sn_stage_t *));
335 n->stages[n->stages_num - 1] = NULL;
339 /* Free the unused memory */
340 if (n->stages_num == 0)
347 temp = (sn_stage_t **) realloc (n->stages,
348 n->stages_num * sizeof (sn_stage_t *));
355 } /* }}} int sn_network_stage_remove */
357 sn_network_t *sn_network_clone (const sn_network_t *n) /* {{{ */
359 sn_network_t *n_copy;
362 n_copy = sn_network_create (n->inputs_num);
366 for (i = 0; i < n->stages_num; i++)
371 s = sn_stage_clone (n->stages[i]);
375 status = sn_network_stage_add (n_copy, s);
380 if (i < n->stages_num)
382 sn_network_destroy (n_copy);
387 } /* }}} sn_network_t *sn_network_clone */
389 int sn_network_comparator_add (sn_network_t *n, /* {{{ */
390 const sn_comparator_t *c)
394 if ((n == NULL) || (c == NULL))
397 if (n->stages_num > 0)
399 s = n->stages[n->stages_num - 1];
401 if (sn_stage_comparator_check_conflict (s, c) == 0)
403 sn_stage_comparator_add (s, c);
408 s = sn_stage_create (n->stages_num);
409 sn_stage_comparator_add (s, c);
410 sn_network_stage_add (n, s);
413 } /* }}} int sn_network_comparator_add */
415 int sn_network_get_comparator_num (const sn_network_t *n) /* {{{ */
424 for (i = 0; i < n->stages_num; i++)
425 num += n->stages[i]->comparators_num;
428 } /* }}} int sn_network_get_comparator_num */
430 int sn_network_show_fh (sn_network_t *n, FILE *fh) /* {{{ */
434 for (i = 0; i < n->stages_num; i++)
435 sn_stage_show_fh (n->stages[i], fh);
438 } /* }}} int sn_network_show_fh */
440 int sn_network_show (sn_network_t *n) /* {{{ */
442 return (sn_network_show_fh (n, stdout));
443 } /* }}} int sn_network_show */
445 int sn_network_invert (sn_network_t *n) /* {{{ */
452 for (i = 0; i < n->stages_num; i++)
453 sn_stage_invert (n->stages[i]);
456 } /* }}} int sn_network_invert */
458 int sn_network_shift (sn_network_t *n, int sw) /* {{{ */
462 if ((n == NULL) || (sw < 0))
468 for (i = 0; i < n->stages_num; i++)
469 sn_stage_shift (n->stages[i], sw, SN_NETWORK_INPUT_NUM (n));
472 } /* }}} int sn_network_shift */
474 int sn_network_compress (sn_network_t *n) /* {{{ */
480 for (i = 1; i < n->stages_num; i++)
486 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
488 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
491 for (k = i - 1; k >= 0; k--)
495 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
510 sn_stage_comparator_add (n->stages[move_to], c);
511 sn_stage_comparator_remove (s, j);
517 while ((n->stages_num > 0)
518 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
519 sn_network_stage_remove (n, n->stages_num - 1);
522 } /* }}} int sn_network_compress */
524 int sn_network_normalize (sn_network_t *n) /* {{{ */
528 for (i = 0; i < n->stages_num; i++)
535 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
541 c = SN_STAGE_COMP_GET (s, j);
550 for (k = i; k < n->stages_num; k++)
551 sn_stage_swap (n->stages[k], min, max);
556 } /* for (j = 0 .. #comparators) */
557 } /* for (i = n->stages_num - 1 .. 0) */
560 } /* }}} int sn_network_normalize */
562 int sn_network_unify (sn_network_t *n) /* {{{ */
569 sn_network_normalize (n);
570 sn_network_compress (n);
572 for (i = 0; i < n->stages_num; i++)
573 sn_stage_unify (n->stages[i]);
576 } /* }}} int sn_network_unify */
578 int sn_network_remove_input (sn_network_t *n, int input) /* {{{ */
582 if ((n == NULL) || (input < 0) || (input >= n->inputs_num))
585 for (i = 0; i < n->stages_num; i++)
586 sn_stage_remove_input (n->stages[i], input);
591 } /* }}} int sn_network_remove_input */
593 int sn_network_cut_at (sn_network_t *n, int input, /* {{{ */
594 enum sn_network_cut_dir_e dir)
597 int position = input;
599 for (i = 0; i < n->stages_num; i++)
605 new_position = sn_stage_cut_at (s, position, dir);
607 if (position != new_position)
611 for (j = 0; j < i; j++)
612 sn_stage_swap (n->stages[j], position, new_position);
615 position = new_position;
618 assert (((dir == DIR_MIN) && (position == 0))
619 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
621 sn_network_remove_input (n, position);
624 } /* }}} int sn_network_cut_at */
626 int sn_network_cut (sn_network_t *n, int *mask) /* {{{ */
631 for (i = 0; i < n->stages_num; i++)
633 sn_stage_t *s = n->stages[i];
635 sn_stage_cut (s, mask, n->stages);
638 /* Use a copy of this member since it will be updated by
639 * sn_network_remove_input(). */
640 inputs_num = n->inputs_num;
641 for (i = 0; i < inputs_num; i++)
644 sn_network_remove_input (n, 0);
645 else if (mask[i] > 0)
646 sn_network_remove_input (n, n->inputs_num - 1);
650 } /* }}} int sn_network_cut */
652 /* sn_network_concatenate
654 * `Glues' two networks together, resulting in a comparator network with twice
655 * as many inputs but one that doesn't really sort anymore. It produces a
656 * bitonic sequence, though, that can be used by the mergers below. */
657 static sn_network_t *sn_network_concatenate (sn_network_t *n0, /* {{{ */
665 stages_num = (n0->stages_num > n1->stages_num)
669 n = sn_network_create (n0->inputs_num + n1->inputs_num);
673 for (i = 0; i < stages_num; i++)
675 sn_stage_t *s = sn_stage_create (i);
677 if (i < n0->stages_num)
678 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
680 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
681 sn_stage_comparator_add (s, c);
684 if (i < n1->stages_num)
685 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
687 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
688 sn_comparator_t c_copy;
690 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
691 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
693 sn_stage_comparator_add (s, &c_copy);
696 sn_network_stage_add (n, s);
700 } /* }}} sn_network_t *sn_network_concatenate */
702 static int sn_network_add_bitonic_merger (sn_network_t *n, /* {{{ */
703 int *indizes, int indizes_num)
707 if (indizes_num <= 1)
712 int even_indizes[indizes_num];
713 int even_indizes_num;
714 int odd_indizes[indizes_num];
717 even_indizes_num = (indizes_num + 1) / 2;
718 odd_indizes_num = indizes_num / 2;
720 for (i = 0; i < even_indizes_num; i++)
721 even_indizes[i] = indizes[2 * i];
722 for (i = 0; i < odd_indizes_num; i++)
723 odd_indizes[i] = indizes[(2 * i) + 1];
725 sn_network_add_bitonic_merger (n, even_indizes, even_indizes_num);
726 sn_network_add_bitonic_merger (n, odd_indizes, odd_indizes_num);
729 for (i = 1; i < indizes_num; i += 2)
733 memset (&c, 0, sizeof (c));
734 c.min = indizes[i - 1];
737 sn_network_comparator_add (n, &c);
741 } /* }}} int sn_network_add_bitonic_merger */
743 static int sn_network_add_odd_even_merger (sn_network_t *n, /* {{{ */
744 int *indizes_left, int indizes_left_num,
745 int *indizes_right, int indizes_right_num)
747 int tmp_left[indizes_left_num];
749 int tmp_right[indizes_left_num];
755 if ((indizes_left_num == 0) || (indizes_right_num == 0))
759 else if ((indizes_left_num == 1) && (indizes_right_num == 1))
764 c.min = *indizes_left;
765 c.max = *indizes_right;
767 s = sn_stage_create (n->stages_num);
771 sn_stage_comparator_add (s, &c);
772 sn_network_stage_add (n, s);
777 /* Merge odd sequences */
778 tmp_left_num = (indizes_left_num + 1) / 2;
779 for (i = 0; i < tmp_left_num; i++)
780 tmp_left[i] = indizes_left[2 * i];
782 tmp_right_num = (indizes_right_num + 1) / 2;
783 for (i = 0; i < tmp_right_num; i++)
784 tmp_right[i] = indizes_right[2 * i];
786 sn_network_add_odd_even_merger (n,
787 tmp_left, tmp_left_num,
788 tmp_right, tmp_right_num);
790 /* Merge even sequences */
791 tmp_left_num = indizes_left_num / 2;
792 for (i = 0; i < tmp_left_num; i++)
793 tmp_left[i] = indizes_left[(2 * i) + 1];
795 tmp_right_num = indizes_right_num / 2;
796 for (i = 0; i < tmp_right_num; i++)
797 tmp_right[i] = indizes_right[(2 * i) + 1];
799 sn_network_add_odd_even_merger (n,
800 tmp_left, tmp_left_num,
801 tmp_right, tmp_right_num);
803 /* Apply ``comparison-interchange'' operations. */
804 s = sn_stage_create (n->stages_num);
806 max_index = indizes_left_num + indizes_right_num;
807 if ((max_index % 2) == 0)
812 for (i = 1; i <= max_index; i += 2)
816 if (i < indizes_left_num)
817 c.min = indizes_left[i];
819 c.min = indizes_right[i - indizes_left_num];
821 if ((i + 1) < indizes_left_num)
822 c.max = indizes_left[i + 1];
824 c.max = indizes_right[i + 1 - indizes_left_num];
826 sn_stage_comparator_add (s, &c);
829 sn_network_stage_add (n, s);
832 } /* }}} int sn_network_add_odd_even_merger */
834 sn_network_t *sn_network_combine_bitonic_merge (sn_network_t *n0, /* {{{ */
837 sn_network_t *n0_clone;
839 int indizes_num = SN_NETWORK_INPUT_NUM (n0) + SN_NETWORK_INPUT_NUM (n1);
840 int indizes[indizes_num];
843 /* We need to invert n0, because the sequence must be
844 * z_1 >= z_2 >= ... >= z_k <= z_{k+1} <= ... <= z_p
845 * and NOT the other way around! Otherwise the comparators added in
846 * sn_network_add_bitonic_merger() from comparing (z_0,z_1), (z_2,z_3), ...
847 * to comparing ..., (z_{n-4},z_{n-3}), (z_{n-2},z_{n-1}), i.e. bound to the
848 * end of the list, possibly leaving z_0 uncompared. */
849 n0_clone = sn_network_clone (n0);
850 if (n0_clone == NULL)
852 sn_network_invert (n0_clone);
854 n = sn_network_concatenate (n0_clone, n1);
857 sn_network_destroy (n0_clone);
859 for (i = 0; i < indizes_num; i++)
862 sn_network_add_bitonic_merger (n, indizes, indizes_num);
865 } /* }}} sn_network_t *sn_network_combine_bitonic_merge */
867 sn_network_t *sn_network_combine_odd_even_merge (sn_network_t *n0, /* {{{ */
871 int indizes_left[n0->inputs_num];
872 int indizes_left_num;
873 int indizes_right[n1->inputs_num];
874 int indizes_right_num;
878 indizes_left_num = n0->inputs_num;
879 indizes_right_num = n1->inputs_num;
880 for (i = 0; i < indizes_left_num; i++)
882 for (i = 0; i < indizes_right_num; i++)
883 indizes_right[i] = indizes_left_num + i;
885 n = sn_network_concatenate (n0, n1);
889 status = sn_network_add_odd_even_merger (n,
890 indizes_left, indizes_left_num,
891 indizes_right, indizes_right_num);
894 sn_network_destroy (n);
898 sn_network_compress (n);
900 } /* }}} sn_network_t *sn_network_combine_odd_even_merge */
902 sn_network_t *sn_network_combine (sn_network_t *n0, /* {{{ */
905 return (sn_network_combine_odd_even_merge (n0, n1));
906 } /* }}} sn_network_t *sn_network_combine */
908 int sn_network_sort (sn_network_t *n, int *values) /* {{{ */
914 for (i = 0; i < n->stages_num; i++)
916 status = sn_stage_sort (n->stages[i], values);
922 } /* }}} int sn_network_sort */
924 int sn_network_brute_force_check (sn_network_t *n) /* {{{ */
926 int test_pattern[n->inputs_num];
927 int values[n->inputs_num];
931 memset (test_pattern, 0, sizeof (test_pattern));
937 /* Copy the current pattern and let the network sort it */
938 memcpy (values, test_pattern, sizeof (values));
939 status = sn_network_sort (n, values);
943 /* Check if the array is now sorted. */
944 previous = values[0];
945 for (i = 1; i < n->inputs_num; i++)
947 if (previous > values[i])
949 previous = values[i];
952 /* Generate the next test pattern */
954 for (i = 0; i < n->inputs_num; i++)
956 if (test_pattern[i] == 0)
969 /* Break out of the while loop if we tested all possible patterns */
974 /* All tests successfull */
976 } /* }}} int sn_network_brute_force_check */
978 sn_network_t *sn_network_read (FILE *fh) /* {{{ */
985 while (fgets (buffer, sizeof (buffer), fh) != NULL)
987 char *str_key = buffer;
988 char *str_value = NULL;
989 int buffer_len = strlen (buffer);
991 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
992 || (buffer[buffer_len - 1] == '\r')))
995 buffer[buffer_len] = '\0';
1000 str_value = strchr (buffer, ':');
1001 if (str_value == NULL)
1003 printf ("Cannot parse line: %s\n", buffer);
1007 *str_value = '\0'; str_value++;
1008 while ((*str_value != '\0') && (isspace (*str_value) != 0))
1011 if (strcasecmp ("Inputs", str_key) == 0)
1012 opt_inputs = atoi (str_value);
1014 printf ("Unknown key: %s\n", str_key);
1015 } /* while (fgets) */
1020 n = sn_network_create (opt_inputs);
1026 s = sn_stage_read (fh);
1030 sn_network_stage_add (n, s);
1033 if (SN_NETWORK_STAGE_NUM (n) < 1)
1035 sn_network_destroy (n);
1040 } /* }}} sn_network_t *sn_network_read */
1042 sn_network_t *sn_network_read_file (const char *file) /* {{{ */
1047 fh = fopen (file, "r");
1051 n = sn_network_read (fh);
1056 } /* }}} sn_network_t *sn_network_read_file */
1058 int sn_network_write (sn_network_t *n, FILE *fh) /* {{{ */
1062 fprintf (fh, "Inputs: %i\n", n->inputs_num);
1065 for (i = 0; i < n->stages_num; i++)
1066 sn_stage_write (n->stages[i], fh);
1069 } /* }}} int sn_network_write */
1071 int sn_network_write_file (sn_network_t *n, const char *file) /* {{{ */
1076 fh = fopen (file, "w");
1080 status = sn_network_write (n, fh);
1085 } /* }}} int sn_network_write_file */
1087 int sn_network_serialize (sn_network_t *n, char **ret_buffer, /* {{{ */
1088 size_t *ret_buffer_size)
1095 buffer = *ret_buffer;
1096 buffer_size = *ret_buffer_size;
1098 #define SNPRINTF_OR_FAIL(...) \
1099 status = snprintf (buffer, buffer_size, __VA_ARGS__); \
1100 if ((status < 1) || (((size_t) status) >= buffer_size)) \
1103 buffer_size -= status;
1105 SNPRINTF_OR_FAIL ("Inputs: %i\r\n\r\n", n->inputs_num);
1107 for (i = 0; i < n->stages_num; i++)
1109 status = sn_stage_serialize (n->stages[i], &buffer, &buffer_size);
1114 *ret_buffer = buffer;
1115 *ret_buffer_size = buffer_size;
1117 } /* }}} int sn_network_serialize */
1119 sn_network_t *sn_network_unserialize (char *buffer, /* {{{ */
1125 if (buffer_size == 0)
1128 /* Read options first */
1129 while (buffer_size > 0)
1138 endptr = strchr (buffer, '\n');
1145 line_len = strlen (line);
1147 if ((line_len > 0) && (line[line_len - 1] == '\r'))
1149 line[line_len - 1] = 0;
1157 str_value = strchr (line, ':');
1158 if (str_value == NULL)
1160 printf ("Cannot parse line: %s\n", line);
1164 *str_value = '\0'; str_value++;
1165 while ((*str_value != '\0') && (isspace (*str_value) != 0))
1168 if (strcasecmp ("Inputs", str_key) == 0)
1169 opt_inputs = atoi (str_value);
1171 printf ("Unknown key: %s\n", str_key);
1172 } /* while (fgets) */
1177 n = sn_network_create (opt_inputs);
1183 s = sn_stage_unserialize (&buffer, &buffer_size);
1187 sn_network_stage_add (n, s);
1190 if (SN_NETWORK_STAGE_NUM (n) < 1)
1192 sn_network_destroy (n);
1197 } /* }}} sn_network_t *sn_network_unserialize */
1199 int sn_network_compare (const sn_network_t *n0, const sn_network_t *n1) /* {{{ */
1206 else if (n0 == NULL)
1208 else if (n1 == NULL)
1211 if (n0->inputs_num < n1->inputs_num)
1213 else if (n0->inputs_num > n1->inputs_num)
1216 if (n0->stages_num < n1->stages_num)
1218 else if (n0->stages_num > n1->stages_num)
1221 for (i = 0; i < n0->stages_num; i++)
1223 status = sn_stage_compare (n0->stages[i], n1->stages[i]);
1229 } /* }}} int sn_network_compare */
1231 uint64_t sn_network_get_hashval (const sn_network_t *n) /* {{{ */
1239 hash = (uint64_t) n->inputs_num;
1241 for (i = 0; i < n->stages_num; i++)
1242 hash = (hash * 104207) + sn_stage_get_hashval (n->stages[i]);
1245 } /* }}} uint64_t sn_network_get_hashval */
1247 /* vim: set sw=2 sts=2 et fdm=marker : */