2 * collectd - src/sn_network.c
3 * Copyright (C) 2008 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 <octo at verplant.org>
22 #ifndef _ISOC99_SOURCE
23 # define _ISOC99_SOURCE
25 #ifndef _POSIX_C_SOURCE
26 # define _POSIX_C_SOURCE 200112L
36 #include "sn_network.h"
37 #include "sn_random.h"
39 sn_network_t *sn_network_create (int inputs_num) /* {{{ */
43 n = (sn_network_t *) malloc (sizeof (sn_network_t));
46 memset (n, '\0', sizeof (sn_network_t));
48 n->inputs_num = inputs_num;
51 } /* }}} sn_network_t *sn_network_create */
53 void sn_network_destroy (sn_network_t *n) /* {{{ */
58 if (n->stages != NULL)
61 for (i = 0; i < n->stages_num; i++)
63 sn_stage_destroy (n->stages[i]);
71 } /* }}} void sn_network_destroy */
73 int sn_network_stage_add (sn_network_t *n, sn_stage_t *s) /* {{{ */
77 temp = (sn_stage_t **) realloc (n->stages, (n->stages_num + 1)
78 * sizeof (sn_stage_t *));
83 SN_STAGE_DEPTH (s) = n->stages_num;
84 n->stages[n->stages_num] = s;
88 } /* }}} int sn_network_stage_add */
90 int sn_network_stage_remove (sn_network_t *n, int s_num) /* {{{ */
92 int nmemb = n->stages_num - (s_num + 1);
95 assert (s_num < n->stages_num);
97 sn_stage_destroy (n->stages[s_num]);
98 n->stages[s_num] = NULL;
102 memmove (n->stages + s_num, n->stages + (s_num + 1),
103 nmemb * sizeof (sn_stage_t *));
104 n->stages[n->stages_num - 1] = NULL;
108 /* Free the unused memory */
109 if (n->stages_num == 0)
116 temp = (sn_stage_t **) realloc (n->stages,
117 n->stages_num * sizeof (sn_stage_t *));
124 } /* }}} int sn_network_stage_remove */
126 sn_network_t *sn_network_clone (const sn_network_t *n) /* {{{ */
128 sn_network_t *n_copy;
131 n_copy = sn_network_create (n->inputs_num);
135 for (i = 0; i < n->stages_num; i++)
140 s = sn_stage_clone (n->stages[i]);
144 status = sn_network_stage_add (n_copy, s);
149 if (i < n->stages_num)
151 sn_network_destroy (n_copy);
156 } /* }}} sn_network_t *sn_network_clone */
158 int sn_network_show (sn_network_t *n) /* {{{ */
162 for (i = 0; i < n->stages_num; i++)
163 sn_stage_show (n->stages[i]);
166 } /* }}} int sn_network_show */
168 int sn_network_invert (sn_network_t *n) /* {{{ */
172 for (i = 0; i < n->stages_num; i++)
173 sn_stage_invert (n->stages[i]);
176 } /* }}} int sn_network_invert */
178 int sn_network_shift (sn_network_t *n, int sw) /* {{{ */
182 for (i = 0; i < n->stages_num; i++)
183 sn_stage_shift (n->stages[i], sw, SN_NETWORK_INPUT_NUM (n));
186 } /* }}} int sn_network_shift */
188 int sn_network_compress (sn_network_t *n) /* {{{ */
194 for (i = 1; i < n->stages_num; i++)
200 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
202 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
205 for (k = i - 1; k >= 0; k--)
209 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
224 sn_stage_comparator_add (n->stages[move_to], c);
225 sn_stage_comparator_remove (s, j);
231 while ((n->stages_num > 0)
232 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
233 sn_network_stage_remove (n, n->stages_num - 1);
236 } /* }}} int sn_network_compress */
238 int sn_network_normalize (sn_network_t *n) /* {{{ */
242 for (i = n->stages_num - 1; i >= 0; i--)
249 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
255 c = SN_STAGE_COMP_GET (s, j);
264 for (k = i; k >= 0; k--)
265 sn_stage_swap (n->stages[k], min, max);
267 } /* for (j = 0 .. #comparators) */
268 } /* for (i = n->stages_num - 1 .. 0) */
271 } /* }}} int sn_network_normalize */
273 int sn_network_cut_at (sn_network_t *n, int input, /* {{{ */
274 enum sn_network_cut_dir_e dir)
277 int position = input;
279 for (i = 0; i < n->stages_num; i++)
285 new_position = sn_stage_cut_at (s, position, dir);
287 if (position != new_position)
291 for (j = 0; j < i; j++)
292 sn_stage_swap (n->stages[j], position, new_position);
295 position = new_position;
298 assert (((dir == DIR_MIN) && (position == 0))
299 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
301 for (i = 0; i < n->stages_num; i++)
302 sn_stage_remove_input (n->stages[i], position);
307 } /* }}} int sn_network_cut_at */
309 static int sn_network_add_bitonic_merger_recursive (sn_network_t *n, /* {{{ */
319 s = sn_stage_create (n->stages_num);
325 for (i = low; i < (low + m); i++)
332 sn_stage_comparator_add (s, &c);
335 sn_network_stage_add (n, s);
337 sn_network_add_bitonic_merger_recursive (n, low, m);
338 sn_network_add_bitonic_merger_recursive (n, low + m, m);
341 } /* }}} int sn_network_add_bitonic_merger_recursive */
343 static int sn_network_add_bitonic_merger (sn_network_t *n) /* {{{ */
349 s = sn_stage_create (n->stages_num);
353 m = n->inputs_num / 2;
355 for (i = 0; i < m; i++)
360 c.max = n->inputs_num - (i + 1);
362 sn_stage_comparator_add (s, &c);
365 sn_network_stage_add (n, s);
367 sn_network_add_bitonic_merger_recursive (n, 0, m);
368 sn_network_add_bitonic_merger_recursive (n, m, m);
371 } /* }}} int sn_network_add_bitonic_merger */
373 static int sn_network_add_odd_even_merger_recursive (sn_network_t *n, /* {{{ */
374 int *indizes, int indizes_num)
380 int indizes_half_num;
385 indizes_half_num = indizes_num / 2;
386 indizes_half = (int *) malloc (indizes_num * sizeof (int));
387 if (indizes_half == NULL)
390 for (i = 0; i < indizes_half_num; i++)
392 indizes_half[i] = indizes[2 * i];
393 indizes_half[indizes_half_num + i] = indizes[(2 * i) + 1];
396 status = sn_network_add_odd_even_merger_recursive (n,
397 indizes_half, indizes_half_num);
404 status = sn_network_add_odd_even_merger_recursive (n,
405 indizes_half + indizes_half_num, indizes_half_num);
414 s = sn_stage_create (n->stages_num);
418 for (i = 1; i < (indizes_num - 2); i += 2)
421 c.max = indizes[i + 1];
423 sn_stage_comparator_add (s, &c);
426 sn_network_stage_add (n, s);
433 assert (indizes_num == 2);
438 s = sn_stage_create (n->stages_num);
442 sn_stage_comparator_add (s, &c);
443 sn_network_stage_add (n, s);
447 } /* }}} int sn_network_add_odd_even_merger_recursive */
449 static int sn_network_add_odd_even_merger (sn_network_t *n) /* {{{ */
456 indizes_num = n->inputs_num;
457 indizes = (int *) malloc (indizes_num * sizeof (int));
461 for (i = 0; i < indizes_num; i++)
464 status = sn_network_add_odd_even_merger_recursive (n,
465 indizes, indizes_num);
469 } /* }}} int sn_network_add_bitonic_merger */
471 sn_network_t *sn_network_combine (sn_network_t *n0, /* {{{ */
479 stages_num = (n0->stages_num > n1->stages_num)
483 n = sn_network_create (n0->inputs_num + n1->inputs_num);
487 for (i = 0; i < stages_num; i++)
489 sn_stage_t *s = sn_stage_create (i);
491 if (i < n0->stages_num)
492 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
494 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
495 sn_stage_comparator_add (s, c);
498 if (i < n1->stages_num)
499 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
501 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
502 sn_comparator_t c_copy;
504 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
505 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
507 sn_stage_comparator_add (s, &c_copy);
510 sn_network_stage_add (n, s);
513 if (sn_bounded_random (0, 1) == 0)
515 sn_network_add_bitonic_merger (n);
519 sn_network_add_odd_even_merger (n);
522 sn_network_compress (n);
525 } /* }}} sn_network_t *sn_network_combine */
527 int sn_network_sort (sn_network_t *n, int *values) /* {{{ */
533 for (i = 0; i < n->stages_num; i++)
535 status = sn_stage_sort (n->stages[i], values);
541 } /* }}} int sn_network_sort */
543 int sn_network_brute_force_check (sn_network_t *n) /* {{{ */
545 int test_pattern[n->inputs_num];
546 int values[n->inputs_num];
550 memset (test_pattern, 0, sizeof (test_pattern));
556 /* Copy the current pattern and let the network sort it */
557 memcpy (values, test_pattern, sizeof (values));
558 status = sn_network_sort (n, values);
562 /* Check if the array is now sorted. */
563 previous = values[0];
564 for (i = 1; i < n->inputs_num; i++)
566 if (previous > values[i])
568 previous = values[i];
571 /* Generate the next test pattern */
573 for (i = 0; i < n->inputs_num; i++)
575 if (test_pattern[i] == 0)
588 /* Break out of the while loop if we tested all possible patterns */
593 /* All tests successfull */
595 } /* }}} int sn_network_brute_force_check */
597 sn_network_t *sn_network_read (FILE *fh) /* {{{ */
604 while (fgets (buffer, sizeof (buffer), fh) != NULL)
606 char *str_key = buffer;
607 char *str_value = NULL;
608 int buffer_len = strlen (buffer);
610 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
611 || (buffer[buffer_len - 1] == '\r')))
614 buffer[buffer_len] = '\0';
619 str_value = strchr (buffer, ':');
620 if (str_value == NULL)
622 printf ("Cannot parse line: %s\n", buffer);
626 *str_value = '\0'; str_value++;
627 while ((*str_value != '\0') && (isspace (*str_value) != 0))
630 if (strcasecmp ("Inputs", str_key) == 0)
631 opt_inputs = atoi (str_value);
633 printf ("Unknown key: %s\n", str_key);
634 } /* while (fgets) */
639 n = sn_network_create (opt_inputs);
645 s = sn_stage_read (fh);
649 sn_network_stage_add (n, s);
652 if (SN_NETWORK_STAGE_NUM (n) < 1)
654 sn_network_destroy (n);
659 } /* }}} sn_network_t *sn_network_read */
661 sn_network_t *sn_network_read_file (const char *file) /* {{{ */
666 fh = fopen (file, "r");
670 n = sn_network_read (fh);
675 } /* }}} sn_network_t *sn_network_read_file */
677 int sn_network_write (sn_network_t *n, FILE *fh) /* {{{ */
681 fprintf (fh, "Inputs: %i\n", n->inputs_num);
684 for (i = 0; i < n->stages_num; i++)
685 sn_stage_write (n->stages[i], fh);
688 } /* }}} int sn_network_write */
690 int sn_network_write_file (sn_network_t *n, const char *file) /* {{{ */
695 fh = fopen (file, "w");
699 status = sn_network_write (n, fh);
704 } /* }}} int sn_network_write_file */
706 int sn_network_serialize (sn_network_t *n, char **ret_buffer, /* {{{ */
707 size_t *ret_buffer_size)
714 buffer = *ret_buffer;
715 buffer_size = *ret_buffer_size;
717 #define SNPRINTF_OR_FAIL(...) \
718 status = snprintf (buffer, buffer_size, __VA_ARGS__); \
719 if ((status < 1) || (status >= buffer_size)) \
722 buffer_size -= status;
724 SNPRINTF_OR_FAIL ("Inputs: %i\r\n\r\n", n->inputs_num);
726 for (i = 0; i < n->stages_num; i++)
728 status = sn_stage_serialize (n->stages[i], &buffer, &buffer_size);
733 *ret_buffer = buffer;
734 *ret_buffer_size = buffer_size;
736 } /* }}} int sn_network_serialize */
738 sn_network_t *sn_network_unserialize (char *buffer, /* {{{ */
744 if (buffer_size == 0)
747 /* Read options first */
748 while (buffer_size > 0)
757 endptr = strchr (buffer, '\n');
764 line_len = strlen (line);
766 if ((line_len > 0) && (line[line_len - 1] == '\r'))
768 line[line_len - 1] = 0;
776 str_value = strchr (line, ':');
777 if (str_value == NULL)
779 printf ("Cannot parse line: %s\n", line);
783 *str_value = '\0'; str_value++;
784 while ((*str_value != '\0') && (isspace (*str_value) != 0))
787 if (strcasecmp ("Inputs", str_key) == 0)
788 opt_inputs = atoi (str_value);
790 printf ("Unknown key: %s\n", str_key);
791 } /* while (fgets) */
796 n = sn_network_create (opt_inputs);
802 s = sn_stage_unserialize (&buffer, &buffer_size);
806 sn_network_stage_add (n, s);
809 if (SN_NETWORK_STAGE_NUM (n) < 1)
811 sn_network_destroy (n);
816 } /* }}} sn_network_t *sn_network_unserialize */
818 /* vim: set sw=2 sts=2 et fdm=marker : */