2 * collectd - src/sn_network.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
30 # define DPRINTF(...) fprintf (stderr, "sn_network: " __VA_ARGS__)
32 # define DPRINTF(...) /**/
42 #include "sn_network.h"
43 #include "sn_random.h"
45 sn_network_t *sn_network_create (int inputs_num) /* {{{ */
49 n = (sn_network_t *) malloc (sizeof (sn_network_t));
52 memset (n, '\0', sizeof (sn_network_t));
54 n->inputs_num = inputs_num;
57 } /* }}} sn_network_t *sn_network_create */
59 void sn_network_destroy (sn_network_t *n) /* {{{ */
64 if (n->stages != NULL)
67 for (i = 0; i < n->stages_num; i++)
69 sn_stage_destroy (n->stages[i]);
77 } /* }}} void sn_network_destroy */
79 sn_network_t *sn_network_create_odd_even_mergesort (int inputs_num) /* {{{ */
83 n = sn_network_create (inputs_num);
85 assert (inputs_num > 0);
98 s = sn_stage_create (/* depth = */ 0);
99 sn_stage_comparator_add (s, &c);
100 sn_network_stage_add (n, s);
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 int sn_network_stage_add (sn_network_t *n, sn_stage_t *s) /* {{{ */
141 temp = (sn_stage_t **) realloc (n->stages, (n->stages_num + 1)
142 * sizeof (sn_stage_t *));
147 SN_STAGE_DEPTH (s) = n->stages_num;
148 n->stages[n->stages_num] = s;
152 } /* }}} int sn_network_stage_add */
154 int sn_network_stage_remove (sn_network_t *n, int s_num) /* {{{ */
156 int nmemb = n->stages_num - (s_num + 1);
159 assert (s_num < n->stages_num);
161 sn_stage_destroy (n->stages[s_num]);
162 n->stages[s_num] = NULL;
166 memmove (n->stages + s_num, n->stages + (s_num + 1),
167 nmemb * sizeof (sn_stage_t *));
168 n->stages[n->stages_num - 1] = NULL;
172 /* Free the unused memory */
173 if (n->stages_num == 0)
180 temp = (sn_stage_t **) realloc (n->stages,
181 n->stages_num * sizeof (sn_stage_t *));
188 } /* }}} int sn_network_stage_remove */
190 sn_network_t *sn_network_clone (const sn_network_t *n) /* {{{ */
192 sn_network_t *n_copy;
195 n_copy = sn_network_create (n->inputs_num);
199 for (i = 0; i < n->stages_num; i++)
204 s = sn_stage_clone (n->stages[i]);
208 status = sn_network_stage_add (n_copy, s);
213 if (i < n->stages_num)
215 sn_network_destroy (n_copy);
220 } /* }}} sn_network_t *sn_network_clone */
222 int sn_network_comparator_add (sn_network_t *n, /* {{{ */
223 const sn_comparator_t *c)
227 if ((n == NULL) || (c == NULL))
230 if (n->stages_num > 0)
232 s = n->stages[n->stages_num - 1];
234 if (sn_stage_comparator_check_conflict (s, c) == 0)
236 sn_stage_comparator_add (s, c);
241 s = sn_stage_create (n->stages_num);
242 sn_stage_comparator_add (s, c);
243 sn_network_stage_add (n, s);
246 } /* }}} int sn_network_comparator_add */
248 int sn_network_get_comparator_num (const sn_network_t *n) /* {{{ */
257 for (i = 0; i < n->stages_num; i++)
258 num += n->stages[i]->comparators_num;
261 } /* }}} int sn_network_get_comparator_num */
263 int sn_network_show (sn_network_t *n) /* {{{ */
267 for (i = 0; i < n->stages_num; i++)
268 sn_stage_show (n->stages[i]);
271 } /* }}} int sn_network_show */
273 int sn_network_invert (sn_network_t *n) /* {{{ */
277 for (i = 0; i < n->stages_num; i++)
278 sn_stage_invert (n->stages[i]);
281 } /* }}} int sn_network_invert */
283 int sn_network_shift (sn_network_t *n, int sw) /* {{{ */
287 for (i = 0; i < n->stages_num; i++)
288 sn_stage_shift (n->stages[i], sw, SN_NETWORK_INPUT_NUM (n));
291 } /* }}} int sn_network_shift */
293 int sn_network_compress (sn_network_t *n) /* {{{ */
299 for (i = 1; i < n->stages_num; i++)
305 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
307 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
310 for (k = i - 1; k >= 0; k--)
314 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
329 sn_stage_comparator_add (n->stages[move_to], c);
330 sn_stage_comparator_remove (s, j);
336 while ((n->stages_num > 0)
337 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
338 sn_network_stage_remove (n, n->stages_num - 1);
341 } /* }}} int sn_network_compress */
343 int sn_network_normalize (sn_network_t *n) /* {{{ */
347 for (i = 0; i < n->stages_num; i++)
354 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
360 c = SN_STAGE_COMP_GET (s, j);
369 for (k = i; k < n->stages_num; k++)
370 sn_stage_swap (n->stages[k], min, max);
375 } /* for (j = 0 .. #comparators) */
376 } /* for (i = n->stages_num - 1 .. 0) */
379 } /* }}} int sn_network_normalize */
381 int sn_network_cut_at (sn_network_t *n, int input, /* {{{ */
382 enum sn_network_cut_dir_e dir)
385 int position = input;
387 for (i = 0; i < n->stages_num; i++)
393 new_position = sn_stage_cut_at (s, position, dir);
395 if (position != new_position)
399 for (j = 0; j < i; j++)
400 sn_stage_swap (n->stages[j], position, new_position);
403 position = new_position;
406 assert (((dir == DIR_MIN) && (position == 0))
407 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
409 for (i = 0; i < n->stages_num; i++)
410 sn_stage_remove_input (n->stages[i], position);
415 } /* }}} int sn_network_cut_at */
417 /* sn_network_concatenate
419 * `Glues' two networks together, resulting in a comparator network with twice
420 * as many inputs but one that doesn't really sort anymore. It produces a
421 * bitonic sequence, though, that can be used by the mergers below. */
422 static sn_network_t *sn_network_concatenate (sn_network_t *n0, /* {{{ */
430 stages_num = (n0->stages_num > n1->stages_num)
434 n = sn_network_create (n0->inputs_num + n1->inputs_num);
438 for (i = 0; i < stages_num; i++)
440 sn_stage_t *s = sn_stage_create (i);
442 if (i < n0->stages_num)
443 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
445 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
446 sn_stage_comparator_add (s, c);
449 if (i < n1->stages_num)
450 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
452 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
453 sn_comparator_t c_copy;
455 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
456 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
458 sn_stage_comparator_add (s, &c_copy);
461 sn_network_stage_add (n, s);
465 } /* }}} sn_network_t *sn_network_concatenate */
467 static int sn_network_add_bitonic_merger_recursive (sn_network_t *n, /* {{{ */
477 s = sn_stage_create (n->stages_num);
483 for (i = low; i < (low + m); i++)
490 sn_stage_comparator_add (s, &c);
493 sn_network_stage_add (n, s);
495 sn_network_add_bitonic_merger_recursive (n, low, m);
496 sn_network_add_bitonic_merger_recursive (n, low + m, m);
499 } /* }}} int sn_network_add_bitonic_merger_recursive */
501 static int sn_network_add_bitonic_merger (sn_network_t *n) /* {{{ */
508 s = sn_stage_create (n->stages_num);
512 m = n->inputs_num / 2;
514 for (i = 0; i < m; i++)
519 c.max = n->inputs_num - (i + 1);
521 sn_stage_comparator_add (s, &c);
524 sn_network_stage_add (n, s);
526 sn_network_add_bitonic_merger_recursive (n, 0, m);
527 sn_network_add_bitonic_merger_recursive (n, m, m);
529 sn_network_add_bitonic_merger_recursive (n, 0, SN_NETWORK_INPUT_NUM (n));
533 } /* }}} int sn_network_add_bitonic_merger */
535 static int sn_network_add_odd_even_merger (sn_network_t *n, /* {{{ */
536 int *indizes_left, int indizes_left_num,
537 int *indizes_right, int indizes_right_num)
539 int tmp_left[indizes_left_num];
541 int tmp_right[indizes_left_num];
547 if ((indizes_left_num == 0) || (indizes_right_num == 0))
551 else if ((indizes_left_num == 1) && (indizes_right_num == 1))
556 c.min = *indizes_left;
557 c.max = *indizes_right;
559 s = sn_stage_create (n->stages_num);
563 sn_stage_comparator_add (s, &c);
564 sn_network_stage_add (n, s);
569 /* Merge odd sequences */
570 tmp_left_num = (indizes_left_num + 1) / 2;
571 for (i = 0; i < tmp_left_num; i++)
572 tmp_left[i] = indizes_left[2 * i];
574 tmp_right_num = (indizes_right_num + 1) / 2;
575 for (i = 0; i < tmp_right_num; i++)
576 tmp_right[i] = indizes_right[2 * i];
578 sn_network_add_odd_even_merger (n,
579 tmp_left, tmp_left_num,
580 tmp_right, tmp_right_num);
582 /* Merge even sequences */
583 tmp_left_num = indizes_left_num / 2;
584 for (i = 0; i < tmp_left_num; i++)
585 tmp_left[i] = indizes_left[(2 * i) + 1];
587 tmp_right_num = indizes_right_num / 2;
588 for (i = 0; i < tmp_right_num; i++)
589 tmp_right[i] = indizes_right[(2 * i) + 1];
591 sn_network_add_odd_even_merger (n,
592 tmp_left, tmp_left_num,
593 tmp_right, tmp_right_num);
595 /* Apply ``comparison-interchange'' operations. */
596 s = sn_stage_create (n->stages_num);
598 max_index = indizes_left_num + indizes_right_num;
599 if ((max_index % 2) == 0)
604 for (i = 1; i <= max_index; i += 2)
608 if (i < indizes_left_num)
609 c.min = indizes_left[i];
611 c.min = indizes_right[i - indizes_left_num];
613 if ((i + 1) < indizes_left_num)
614 c.max = indizes_left[i + 1];
616 c.max = indizes_right[i + 1 - indizes_left_num];
618 sn_stage_comparator_add (s, &c);
621 sn_network_stage_add (n, s);
624 } /* }}} int sn_network_add_odd_even_merger */
626 static sn_network_t *sn_network_combine_bitonic_shift (sn_network_t *n0, /* {{{ */
627 sn_network_t *n1, int do_shift)
630 sn_network_t *n1_clone;
633 n1_clone = sn_network_clone (n1);
634 if (n1_clone == NULL)
637 sn_network_invert (n1_clone);
639 n = sn_network_concatenate (n0, n1_clone);
643 sn_network_destroy (n1_clone);
646 shift = sn_bounded_random (0, SN_NETWORK_INPUT_NUM (n) - 1);
652 DPRINTF ("sn_network_combine_bitonic_shift: Shifting by %i.\n", shift);
653 sn_network_shift (n, shift);
656 sn_network_add_bitonic_merger (n);
659 } /* }}} sn_network_t *sn_network_combine_bitonic_shift */
661 sn_network_t *sn_network_combine_bitonic (sn_network_t *n0, /* {{{ */
664 return (sn_network_combine_bitonic_shift (n0, n1, /* do_shift = */ 0));
665 } /* }}} sn_network_t *sn_network_combine_bitonic */
667 sn_network_t *sn_network_combine_odd_even_merge (sn_network_t *n0, /* {{{ */
671 int indizes_left[n0->inputs_num];
672 int indizes_left_num;
673 int indizes_right[n1->inputs_num];
674 int indizes_right_num;
678 indizes_left_num = n0->inputs_num;
679 indizes_right_num = n1->inputs_num;
680 for (i = 0; i < indizes_left_num; i++)
682 for (i = 0; i < indizes_right_num; i++)
683 indizes_right[i] = indizes_left_num + i;
685 n = sn_network_concatenate (n0, n1);
689 status = sn_network_add_odd_even_merger (n,
690 indizes_left, indizes_left_num,
691 indizes_right, indizes_right_num);
694 sn_network_destroy (n);
698 sn_network_compress (n);
700 } /* }}} sn_network_t *sn_network_combine */
702 sn_network_t *sn_network_combine (sn_network_t *n0, /* {{{ */
703 sn_network_t *n1, int is_power_of_two)
707 if ((is_power_of_two != 0) && (sn_bounded_random (0, 9) == 0))
709 DPRINTF ("sn_network_combine: Using the bitonic merger.\n");
710 n = sn_network_combine_bitonic_shift (n0, n1, /* do_shift = */ 1);
714 DPRINTF ("sn_network_combine: Using the odd-even merger.\n");
715 n = sn_network_combine_odd_even_merge (n0, n1);
718 sn_network_compress (n);
721 } /* }}} sn_network_t *sn_network_combine */
723 int sn_network_sort (sn_network_t *n, int *values) /* {{{ */
729 for (i = 0; i < n->stages_num; i++)
731 status = sn_stage_sort (n->stages[i], values);
737 } /* }}} int sn_network_sort */
739 int sn_network_brute_force_check (sn_network_t *n) /* {{{ */
741 int test_pattern[n->inputs_num];
742 int values[n->inputs_num];
746 memset (test_pattern, 0, sizeof (test_pattern));
752 /* Copy the current pattern and let the network sort it */
753 memcpy (values, test_pattern, sizeof (values));
754 status = sn_network_sort (n, values);
758 /* Check if the array is now sorted. */
759 previous = values[0];
760 for (i = 1; i < n->inputs_num; i++)
762 if (previous > values[i])
764 previous = values[i];
767 /* Generate the next test pattern */
769 for (i = 0; i < n->inputs_num; i++)
771 if (test_pattern[i] == 0)
784 /* Break out of the while loop if we tested all possible patterns */
789 /* All tests successfull */
791 } /* }}} int sn_network_brute_force_check */
793 sn_network_t *sn_network_read (FILE *fh) /* {{{ */
800 while (fgets (buffer, sizeof (buffer), fh) != NULL)
802 char *str_key = buffer;
803 char *str_value = NULL;
804 int buffer_len = strlen (buffer);
806 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
807 || (buffer[buffer_len - 1] == '\r')))
810 buffer[buffer_len] = '\0';
815 str_value = strchr (buffer, ':');
816 if (str_value == NULL)
818 printf ("Cannot parse line: %s\n", buffer);
822 *str_value = '\0'; str_value++;
823 while ((*str_value != '\0') && (isspace (*str_value) != 0))
826 if (strcasecmp ("Inputs", str_key) == 0)
827 opt_inputs = atoi (str_value);
829 printf ("Unknown key: %s\n", str_key);
830 } /* while (fgets) */
835 n = sn_network_create (opt_inputs);
841 s = sn_stage_read (fh);
845 sn_network_stage_add (n, s);
848 if (SN_NETWORK_STAGE_NUM (n) < 1)
850 sn_network_destroy (n);
855 } /* }}} sn_network_t *sn_network_read */
857 sn_network_t *sn_network_read_file (const char *file) /* {{{ */
862 fh = fopen (file, "r");
866 n = sn_network_read (fh);
871 } /* }}} sn_network_t *sn_network_read_file */
873 int sn_network_write (sn_network_t *n, FILE *fh) /* {{{ */
877 fprintf (fh, "Inputs: %i\n", n->inputs_num);
880 for (i = 0; i < n->stages_num; i++)
881 sn_stage_write (n->stages[i], fh);
884 } /* }}} int sn_network_write */
886 int sn_network_write_file (sn_network_t *n, const char *file) /* {{{ */
891 fh = fopen (file, "w");
895 status = sn_network_write (n, fh);
900 } /* }}} int sn_network_write_file */
902 int sn_network_serialize (sn_network_t *n, char **ret_buffer, /* {{{ */
903 size_t *ret_buffer_size)
910 buffer = *ret_buffer;
911 buffer_size = *ret_buffer_size;
913 #define SNPRINTF_OR_FAIL(...) \
914 status = snprintf (buffer, buffer_size, __VA_ARGS__); \
915 if ((status < 1) || (((size_t) status) >= buffer_size)) \
918 buffer_size -= status;
920 SNPRINTF_OR_FAIL ("Inputs: %i\r\n\r\n", n->inputs_num);
922 for (i = 0; i < n->stages_num; i++)
924 status = sn_stage_serialize (n->stages[i], &buffer, &buffer_size);
929 *ret_buffer = buffer;
930 *ret_buffer_size = buffer_size;
932 } /* }}} int sn_network_serialize */
934 sn_network_t *sn_network_unserialize (char *buffer, /* {{{ */
940 if (buffer_size == 0)
943 /* Read options first */
944 while (buffer_size > 0)
953 endptr = strchr (buffer, '\n');
960 line_len = strlen (line);
962 if ((line_len > 0) && (line[line_len - 1] == '\r'))
964 line[line_len - 1] = 0;
972 str_value = strchr (line, ':');
973 if (str_value == NULL)
975 printf ("Cannot parse line: %s\n", line);
979 *str_value = '\0'; str_value++;
980 while ((*str_value != '\0') && (isspace (*str_value) != 0))
983 if (strcasecmp ("Inputs", str_key) == 0)
984 opt_inputs = atoi (str_value);
986 printf ("Unknown key: %s\n", str_key);
987 } /* while (fgets) */
992 n = sn_network_create (opt_inputs);
998 s = sn_stage_unserialize (&buffer, &buffer_size);
1002 sn_network_stage_add (n, s);
1005 if (SN_NETWORK_STAGE_NUM (n) < 1)
1007 sn_network_destroy (n);
1012 } /* }}} sn_network_t *sn_network_unserialize */
1014 /* vim: set sw=2 sts=2 et fdm=marker : */