2 * collectd - src/sn_stage.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
33 #include "sn_comparator.h"
36 sn_stage_t *sn_stage_create (int depth)
40 s = (sn_stage_t *) malloc (sizeof (sn_stage_t));
43 memset (s, '\0', sizeof (sn_stage_t));
48 } /* sn_stage_t *sn_stage_create */
50 void sn_stage_destroy (sn_stage_t *s)
54 if (s->comparators != NULL)
55 free (s->comparators);
57 } /* void sn_stage_destroy */
59 int sn_stage_comparator_add (sn_stage_t *s, const sn_comparator_t *c)
61 sn_comparator_t *temp;
64 temp = (sn_comparator_t *) realloc (s->comparators,
65 (s->comparators_num + 1) * sizeof (sn_comparator_t));
68 s->comparators = temp;
71 for (i = 0; i < s->comparators_num; i++)
72 if (sn_comparator_compare (c, s->comparators + i) <= 0)
75 /* Insert the elements in ascending order */
76 assert (i <= s->comparators_num);
77 if (i < s->comparators_num)
79 int nmemb = s->comparators_num - i;
80 memmove (s->comparators + (i + 1), s->comparators + i,
81 nmemb * sizeof (sn_comparator_t));
83 memcpy (s->comparators + i, c, sizeof (sn_comparator_t));
87 } /* int sn_stage_comparator_add */
89 int sn_stage_comparator_remove (sn_stage_t *s, int c_num)
91 int nmemb = s->comparators_num - (c_num + 1);
92 sn_comparator_t *temp;
94 assert (c_num < s->comparators_num);
98 memmove (s->comparators + c_num, s->comparators + (c_num + 1),
99 nmemb * sizeof (sn_comparator_t));
100 s->comparators_num--;
102 /* Free the unused memory */
103 if (s->comparators_num == 0)
105 free (s->comparators);
106 s->comparators = NULL;
110 temp = (sn_comparator_t *) realloc (s->comparators,
111 s->comparators_num * sizeof (sn_comparator_t));
114 s->comparators = temp;
118 } /* int sn_stage_comparator_remove */
120 sn_stage_t *sn_stage_clone (const sn_stage_t *s)
124 s_copy = sn_stage_create (s->depth);
128 s_copy->comparators = (sn_comparator_t *) malloc (s->comparators_num
129 * sizeof (sn_comparator_t));
130 if (s_copy->comparators == NULL)
136 memcpy (s_copy->comparators, s->comparators,
137 s->comparators_num * sizeof (sn_comparator_t));
138 s_copy->comparators_num = s->comparators_num;
141 } /* sn_stage_t *sn_stage_clone */
143 int sn_stage_comparator_check_conflict (sn_stage_t *s, const sn_comparator_t *c0)
147 for (i = 0; i < s->comparators_num; i++)
149 sn_comparator_t *c1 = s->comparators + i;
150 if ((SN_COMP_MIN(c0) == SN_COMP_MIN(c1))
151 || (SN_COMP_MIN(c0) == SN_COMP_MAX(c1))
152 || (SN_COMP_MAX(c0) == SN_COMP_MIN(c1))
153 || (SN_COMP_MAX(c0) == SN_COMP_MAX(c1)))
155 if ((SN_COMP_MIN(c0) == SN_COMP_MIN(c1))
156 && (SN_COMP_MAX(c0) == SN_COMP_MAX(c1)))
164 } /* int sn_stage_comparator_check_conflict */
166 int sn_stage_show (sn_stage_t *s)
168 int lines[s->comparators_num];
169 int right[s->comparators_num];
176 for (i = 0; i < s->comparators_num; i++)
182 for (i = 0; i < s->comparators_num; i++)
185 sn_comparator_t *c = s->comparators + i;
187 for (j = 0; j < lines_used; j++)
188 if (SN_COMP_LEFT (c) > right[j])
192 right[j] = SN_COMP_RIGHT (c);
197 for (i = 0; i < lines_used; i++)
199 printf ("%3i: ", s->depth);
201 for (j = 0; j <= right[i]; j++)
206 for (k = 0; k < s->comparators_num; k++)
208 sn_comparator_t *c = s->comparators + k;
210 /* Check if this comparator is displayed on another line */
214 if (j == SN_COMP_MIN (c))
216 else if (j == SN_COMP_MAX (c))
219 if ((j >= SN_COMP_LEFT (c)) && (j < SN_COMP_RIGHT (c)))
222 if ((on_elem != 0) || (line_after != 0))
233 else if (on_elem == -1)
247 } /* for (columns) */
253 } /* int sn_stage_show */
255 int sn_stage_invert (sn_stage_t *s)
259 for (i = 0; i < s->comparators_num; i++)
260 sn_comparator_invert (s->comparators + i);
263 } /* int sn_stage_invert */
265 int sn_stage_swap (sn_stage_t *s, int con0, int con1)
269 for (i = 0; i < s->comparators_num; i++)
270 sn_comparator_swap (s->comparators + i, con0, con1);
273 } /* int sn_stage_swap */
275 int sn_stage_cut_at (sn_stage_t *s, int input, enum sn_network_cut_dir_e dir)
277 int new_position = input;
280 for (i = 0; i < s->comparators_num; i++)
282 sn_comparator_t *c = s->comparators + i;
284 if ((SN_COMP_MIN (c) != input) && (SN_COMP_MAX (c) != input))
287 if ((dir == DIR_MIN) && (SN_COMP_MAX (c) == input))
289 new_position = SN_COMP_MIN (c);
291 else if ((dir == DIR_MAX) && (SN_COMP_MIN (c) == input))
293 new_position = SN_COMP_MAX (c);
299 if (i < s->comparators_num)
300 sn_stage_comparator_remove (s, i);
303 return (new_position);
304 } /* int sn_stage_cut_at */
306 int sn_stage_remove_input (sn_stage_t *s, int input)
310 for (i = 0; i < s->comparators_num; i++)
312 sn_comparator_t *c = s->comparators + i;
314 if ((SN_COMP_MIN (c) == input) || (SN_COMP_MAX (c) == input))
316 sn_stage_comparator_remove (s, i);
321 if (SN_COMP_MIN (c) > input)
322 SN_COMP_MIN (c) = SN_COMP_MIN (c) - 1;
323 if (SN_COMP_MAX (c) > input)
324 SN_COMP_MAX (c) = SN_COMP_MAX (c) - 1;
330 sn_stage_t *sn_stage_read (FILE *fh)
336 s = sn_stage_create (0);
340 while (fgets (buffer, sizeof (buffer), fh) != NULL)
345 if ((buffer[0] == '\0') || (buffer[0] == '\n') || (buffer[0] == '\r'))
350 c.min = (int) strtol (buffer_ptr, &endptr, 0);
351 if (buffer_ptr == endptr)
356 c.max = (int) strtol (buffer_ptr, &endptr, 0);
357 if (buffer_ptr == endptr)
360 sn_stage_comparator_add (s, &c);
363 if (s->comparators_num == 0)
365 sn_stage_destroy (s);
370 } /* sn_stage_t *sn_stage_read */
372 int sn_stage_write (sn_stage_t *s, FILE *fh)
376 if (s->comparators_num <= 0)
379 for (i = 0; i < s->comparators_num; i++)
380 fprintf (fh, "%i %i\n",
381 SN_COMP_MIN (s->comparators + i),
382 SN_COMP_MAX (s->comparators + i));
386 } /* int sn_stage_write */
388 /* vim: set shiftwidth=2 softtabstop=2 : */