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_compress (sn_network_t *n) /* {{{ */
184 for (i = 1; i < n->stages_num; i++)
190 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
192 sn_comparator_t *c = SN_STAGE_COMP_GET (s, j);
195 for (k = i - 1; k >= 0; k--)
199 conflict = sn_stage_comparator_check_conflict (n->stages[k], c);
214 sn_stage_comparator_add (n->stages[move_to], c);
215 sn_stage_comparator_remove (s, j);
221 while ((n->stages_num > 0)
222 && (SN_STAGE_COMP_NUM (n->stages[n->stages_num - 1]) == 0))
223 sn_network_stage_remove (n, n->stages_num - 1);
226 } /* }}} int sn_network_compress */
228 int sn_network_normalize (sn_network_t *n) /* {{{ */
232 for (i = n->stages_num - 1; i >= 0; i--)
239 for (j = 0; j < SN_STAGE_COMP_NUM (s); j++)
245 c = SN_STAGE_COMP_GET (s, j);
254 for (k = i; k >= 0; k--)
255 sn_stage_swap (n->stages[k], min, max);
257 } /* for (j = 0 .. #comparators) */
258 } /* for (i = n->stages_num - 1 .. 0) */
261 } /* }}} int sn_network_normalize */
263 int sn_network_cut_at (sn_network_t *n, int input, /* {{{ */
264 enum sn_network_cut_dir_e dir)
267 int position = input;
269 for (i = 0; i < n->stages_num; i++)
275 new_position = sn_stage_cut_at (s, position, dir);
277 if (position != new_position)
281 for (j = 0; j < i; j++)
282 sn_stage_swap (n->stages[j], position, new_position);
285 position = new_position;
288 assert (((dir == DIR_MIN) && (position == 0))
289 || ((dir == DIR_MAX) && (position == (n->inputs_num - 1))));
291 for (i = 0; i < n->stages_num; i++)
292 sn_stage_remove_input (n->stages[i], position);
297 } /* }}} int sn_network_cut_at */
299 static int sn_network_add_bitonic_merger_recursive (sn_network_t *n, /* {{{ */
309 s = sn_stage_create (n->stages_num);
315 for (i = low; i < (low + m); i++)
322 sn_stage_comparator_add (s, &c);
325 sn_network_stage_add (n, s);
327 sn_network_add_bitonic_merger_recursive (n, low, m);
328 sn_network_add_bitonic_merger_recursive (n, low + m, m);
331 } /* }}} int sn_network_add_bitonic_merger_recursive */
333 static int sn_network_add_bitonic_merger (sn_network_t *n) /* {{{ */
339 s = sn_stage_create (n->stages_num);
343 m = n->inputs_num / 2;
345 for (i = 0; i < m; i++)
350 c.max = n->inputs_num - (i + 1);
352 sn_stage_comparator_add (s, &c);
355 sn_network_stage_add (n, s);
357 sn_network_add_bitonic_merger_recursive (n, 0, m);
358 sn_network_add_bitonic_merger_recursive (n, m, m);
361 } /* }}} int sn_network_add_bitonic_merger */
363 static int sn_network_add_odd_even_merger_recursive (sn_network_t *n, /* {{{ */
364 int *indizes, int indizes_num)
370 int indizes_half_num;
375 indizes_half_num = indizes_num / 2;
376 indizes_half = (int *) malloc (indizes_num * sizeof (int));
377 if (indizes_half == NULL)
380 for (i = 0; i < indizes_half_num; i++)
382 indizes_half[i] = indizes[2 * i];
383 indizes_half[indizes_half_num + i] = indizes[(2 * i) + 1];
386 status = sn_network_add_odd_even_merger_recursive (n,
387 indizes_half, indizes_half_num);
394 status = sn_network_add_odd_even_merger_recursive (n,
395 indizes_half + indizes_half_num, indizes_half_num);
404 s = sn_stage_create (n->stages_num);
408 for (i = 1; i < (indizes_num - 2); i += 2)
411 c.max = indizes[i + 1];
413 sn_stage_comparator_add (s, &c);
416 sn_network_stage_add (n, s);
423 assert (indizes_num == 2);
428 s = sn_stage_create (n->stages_num);
432 sn_stage_comparator_add (s, &c);
433 sn_network_stage_add (n, s);
437 } /* }}} int sn_network_add_odd_even_merger_recursive */
439 static int sn_network_add_odd_even_merger (sn_network_t *n) /* {{{ */
446 indizes_num = n->inputs_num;
447 indizes = (int *) malloc (indizes_num * sizeof (int));
451 for (i = 0; i < indizes_num; i++)
454 status = sn_network_add_odd_even_merger_recursive (n,
455 indizes, indizes_num);
459 } /* }}} int sn_network_add_bitonic_merger */
461 sn_network_t *sn_network_combine (sn_network_t *n0, /* {{{ */
469 stages_num = (n0->stages_num > n1->stages_num)
473 n = sn_network_create (n0->inputs_num + n1->inputs_num);
477 for (i = 0; i < stages_num; i++)
479 sn_stage_t *s = sn_stage_create (i);
481 if (i < n0->stages_num)
482 for (j = 0; j < SN_STAGE_COMP_NUM (n0->stages[i]); j++)
484 sn_comparator_t *c = SN_STAGE_COMP_GET (n0->stages[i], j);
485 sn_stage_comparator_add (s, c);
488 if (i < n1->stages_num)
489 for (j = 0; j < SN_STAGE_COMP_NUM (n1->stages[i]); j++)
491 sn_comparator_t *c_orig = SN_STAGE_COMP_GET (n1->stages[i], j);
492 sn_comparator_t c_copy;
494 SN_COMP_MIN(&c_copy) = SN_COMP_MIN(c_orig) + n0->inputs_num;
495 SN_COMP_MAX(&c_copy) = SN_COMP_MAX(c_orig) + n0->inputs_num;
497 sn_stage_comparator_add (s, &c_copy);
500 sn_network_stage_add (n, s);
503 if (sn_bounded_random (0, 1) == 0)
505 sn_network_add_bitonic_merger (n);
509 sn_network_add_odd_even_merger (n);
512 sn_network_compress (n);
515 } /* }}} sn_network_t *sn_network_combine */
517 int sn_network_sort (sn_network_t *n, int *values) /* {{{ */
523 for (i = 0; i < n->stages_num; i++)
525 status = sn_stage_sort (n->stages[i], values);
531 } /* }}} int sn_network_sort */
533 int sn_network_brute_force_check (sn_network_t *n) /* {{{ */
535 int test_pattern[n->inputs_num];
536 int values[n->inputs_num];
540 memset (test_pattern, 0, sizeof (test_pattern));
546 /* Copy the current pattern and let the network sort it */
547 memcpy (values, test_pattern, sizeof (values));
548 status = sn_network_sort (n, values);
552 /* Check if the array is now sorted. */
553 previous = values[0];
554 for (i = 1; i < n->inputs_num; i++)
556 if (previous > values[i])
558 previous = values[i];
561 /* Generate the next test pattern */
563 for (i = 0; i < n->inputs_num; i++)
565 if (test_pattern[i] == 0)
578 /* Break out of the while loop if we tested all possible patterns */
583 /* All tests successfull */
585 } /* }}} int sn_network_brute_force_check */
587 sn_network_t *sn_network_read (FILE *fh) /* {{{ */
594 while (fgets (buffer, sizeof (buffer), fh) != NULL)
596 char *str_key = buffer;
597 char *str_value = NULL;
598 int buffer_len = strlen (buffer);
600 while ((buffer_len > 0) && ((buffer[buffer_len - 1] == '\n')
601 || (buffer[buffer_len - 1] == '\r')))
604 buffer[buffer_len] = '\0';
609 str_value = strchr (buffer, ':');
610 if (str_value == NULL)
612 printf ("Cannot parse line: %s\n", buffer);
616 *str_value = '\0'; str_value++;
617 while ((*str_value != '\0') && (isspace (*str_value) != 0))
620 if (strcasecmp ("Inputs", str_key) == 0)
621 opt_inputs = atoi (str_value);
623 printf ("Unknown key: %s\n", str_key);
624 } /* while (fgets) */
629 n = sn_network_create (opt_inputs);
635 s = sn_stage_read (fh);
639 sn_network_stage_add (n, s);
642 if (SN_NETWORK_STAGE_NUM (n) < 1)
644 sn_network_destroy (n);
649 } /* }}} sn_network_t *sn_network_read */
651 sn_network_t *sn_network_read_file (const char *file) /* {{{ */
656 fh = fopen (file, "r");
660 n = sn_network_read (fh);
665 } /* }}} sn_network_t *sn_network_read_file */
667 int sn_network_write (sn_network_t *n, FILE *fh) /* {{{ */
671 fprintf (fh, "Inputs: %i\n", n->inputs_num);
674 for (i = 0; i < n->stages_num; i++)
675 sn_stage_write (n->stages[i], fh);
678 } /* }}} int sn_network_write */
680 int sn_network_write_file (sn_network_t *n, const char *file) /* {{{ */
685 fh = fopen (file, "w");
689 status = sn_network_write (n, fh);
694 } /* }}} int sn_network_write_file */
696 int sn_network_serialize (sn_network_t *n, char **ret_buffer, /* {{{ */
697 size_t *ret_buffer_size)
704 buffer = *ret_buffer;
705 buffer_size = *ret_buffer_size;
707 #define SNPRINTF_OR_FAIL(...) \
708 status = snprintf (buffer, buffer_size, __VA_ARGS__); \
709 if ((status < 1) || (status >= buffer_size)) \
712 buffer_size -= status;
714 SNPRINTF_OR_FAIL ("Inputs: %i\r\n\r\n", n->inputs_num);
716 for (i = 0; i < n->stages_num; i++)
718 status = sn_stage_serialize (n->stages[i], &buffer, &buffer_size);
723 *ret_buffer = buffer;
724 *ret_buffer_size = buffer_size;
726 } /* }}} int sn_network_serialize */
728 sn_network_t *sn_network_unserialize (char *buffer, /* {{{ */
734 if (buffer_size == 0)
737 /* Read options first */
738 while (buffer_size > 0)
747 endptr = strchr (buffer, '\n');
754 line_len = strlen (line);
756 if ((line_len > 0) && (line[line_len - 1] == '\r'))
758 line[line_len - 1] = 0;
766 str_value = strchr (line, ':');
767 if (str_value == NULL)
769 printf ("Cannot parse line: %s\n", line);
773 *str_value = '\0'; str_value++;
774 while ((*str_value != '\0') && (isspace (*str_value) != 0))
777 if (strcasecmp ("Inputs", str_key) == 0)
778 opt_inputs = atoi (str_value);
780 printf ("Unknown key: %s\n", str_key);
781 } /* while (fgets) */
786 n = sn_network_create (opt_inputs);
792 s = sn_stage_unserialize (&buffer, &buffer_size);
796 sn_network_stage_add (n, s);
799 if (SN_NETWORK_STAGE_NUM (n) < 1)
801 sn_network_destroy (n);
806 } /* }}} sn_network_t *sn_network_unserialize */
808 /* vim: set sw=2 sts=2 et fdm=marker : */