2 * collectd - src/sn-evolution.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
34 #include <sys/types.h>
44 #include <population.h>
46 #include "sn_network.h"
47 #include "sn_random.h"
49 /* Yes, this is ugly, but the GNU libc doesn't export it with the above flags.
51 char *strdup (const char *s);
53 static uint64_t iteration_counter = 0;
54 static int inputs_num = 16;
55 static int inputs_num_is_power_of_two = 1;
57 static char *initial_input_file = NULL;
58 static char *best_output_file = NULL;
60 static int stats_interval = 0;
62 static int max_population_size = 128;
63 static population_t *population;
65 static int evolution_threads_num = 4;
67 static int do_loop = 0;
69 static void sigint_handler (int signal)
72 } /* void sigint_handler */
74 static void exit_usage (const char *name)
76 printf ("Usage: %s [options]\n"
78 "Valid options are:\n"
79 " -i <file> Initial input file (REQUIRED)\n"
80 " -o <file> Write the current best solution to <file>\n"
81 " -p <num> Size of the population (default: 128)\n"
82 " -P <peer> Send individuals to <peer> (may be repeated)\n"
83 " -t <num> Number of threads (default: 4)\n"
87 } /* void exit_usage */
89 int read_options (int argc, char **argv)
93 while ((option = getopt (argc, argv, "i:o:p:P:s:t:h")) != -1)
99 if (initial_input_file != NULL)
100 free (initial_input_file);
101 initial_input_file = strdup (optarg);
107 if (best_output_file != NULL)
108 free (best_output_file);
109 best_output_file = strdup (optarg);
115 int tmp = atoi (optarg);
118 max_population_size = tmp;
119 population_set_size (population, (size_t) max_population_size);
128 status = population_add_peer (population, optarg, /* port = */ NULL);
131 fprintf (stderr, "population_add_peer failed with status %i.\n",
139 int tmp = atoi (optarg);
141 stats_interval = tmp;
147 int tmp = atoi (optarg);
149 evolution_threads_num = tmp;
155 exit_usage (argv[0]);
160 } /* int read_options */
162 static int rate_network (const sn_network_t *n)
167 rate = SN_NETWORK_STAGE_NUM (n) * SN_NETWORK_INPUT_NUM (n);
168 for (i = 0; i < SN_NETWORK_STAGE_NUM (n); i++)
170 sn_stage_t *s = SN_NETWORK_STAGE_GET (n, i);
171 rate += SN_STAGE_COMP_NUM (s);
175 } /* int rate_network */
177 static int mutate_network (sn_network_t *n)
179 sn_network_t *n_copy;
182 int comparator_index;
185 n_copy = sn_network_clone (n);
188 fprintf (stderr, "mutate_network: sn_network_clone failed.\n");
192 stage_index = sn_bounded_random (0, SN_NETWORK_STAGE_NUM (n_copy) - 1);
193 s = SN_NETWORK_STAGE_GET (n_copy, stage_index);
195 comparator_index = sn_bounded_random (0, SN_STAGE_COMP_NUM (s) - 1);
196 sn_stage_comparator_remove (s, comparator_index);
198 status = sn_network_brute_force_check (n_copy);
200 sn_network_destroy (n_copy);
204 else if (status > 0) /* Mutated network does not sort anymore. */
207 /* We saved one comparator \o/ Let's do the same change on the original
209 s = SN_NETWORK_STAGE_GET (n, stage_index);
210 sn_stage_comparator_remove (s, comparator_index);
213 } /* int mutate_network */
215 static int create_offspring (void)
221 p0 = population_get_random (population);
222 p1 = population_get_random (population);
227 /* combine the two parents */
228 n = sn_network_combine (p0, p1, inputs_num_is_power_of_two);
230 sn_network_destroy (p0);
231 sn_network_destroy (p1);
233 /* randomly chose an input and do a min- or max-cut. */
234 while (SN_NETWORK_INPUT_NUM (n) > inputs_num)
237 enum sn_network_cut_dir_e dir;
239 pos = sn_bounded_random (0, SN_NETWORK_INPUT_NUM (n) - 1);
240 dir = (sn_bounded_random (0, 1) == 0) ? DIR_MIN : DIR_MAX;
242 assert ((pos >= 0) && (pos < SN_NETWORK_INPUT_NUM (n)));
244 sn_network_cut_at (n, pos, dir);
247 /* compress the network to get a compact representation */
248 sn_network_compress (n);
250 assert (SN_NETWORK_INPUT_NUM (n) == inputs_num);
252 if ((SN_NETWORK_INPUT_NUM (n) <= 16) && (sn_bounded_random (0, 100) <= 1))
255 population_insert (population, n);
257 sn_network_destroy (n);
260 } /* int create_offspring */
262 static void *evolution_thread (void *arg)
267 /* XXX: Not synchronized! */
272 } /* int start_evolution */
274 static int evolution_start (int threads_num)
276 pthread_t threads[threads_num]; /* C99 ftw! */
279 for (i = 0; i < threads_num; i++)
283 status = pthread_create (&threads[i], /* attr = */ NULL,
284 evolution_thread, /* arg = */ NULL);
287 fprintf (stderr, "evolution_start: pthread_create[%i] failed "
307 iter = iteration_counter;
309 n = population_get_fittest (population);
311 rating = rate_network (n);
313 stages_num = SN_NETWORK_STAGE_NUM (n);
315 for (i = 0; i < stages_num; i++)
319 s = SN_NETWORK_STAGE_GET (n, i);
320 comparators_num += SN_STAGE_COMP_NUM (s);
323 sn_network_destroy (n);
325 printf ("Best after approximately %i iterations: "
326 "%i comparators in %i stages. Rating: %i.\n",
327 iter, comparators_num, stages_num, rating);
331 for (i = 0; i < threads_num; i++)
335 pthread_join (threads[i], /* value_ptr = */ NULL);
339 } /* int evolution_start */
341 int main (int argc, char **argv)
343 struct sigaction sigint_action;
344 struct sigaction sigterm_action;
346 population = population_create ((pi_rate_f) rate_network,
347 (pi_copy_f) sn_network_clone,
348 (pi_free_f) sn_network_destroy);
349 if (population == NULL)
351 fprintf (stderr, "population_create failed.\n");
355 population_set_serialization (population,
356 (pi_serialize_f) sn_network_serialize,
357 (pi_unserialize_f) sn_network_unserialize);
359 read_options (argc, argv);
360 if (initial_input_file == NULL)
361 exit_usage (argv[0]);
363 memset (&sigint_action, '\0', sizeof (sigint_action));
364 sigint_action.sa_handler = sigint_handler;
365 sigaction (SIGINT, &sigint_action, NULL);
367 memset (&sigterm_action, '\0', sizeof (sigterm_action));
368 sigterm_action.sa_handler = sigint_handler;
369 sigaction (SIGTERM, &sigterm_action, NULL);
371 population_start_listen_thread (population, NULL, NULL);
377 n = sn_network_read_file (initial_input_file);
380 printf ("n == NULL\n");
384 inputs_num = SN_NETWORK_INPUT_NUM(n);
386 /* Determine if `inputs_num' is a power of two. If so, more merge
387 * algorithms can be used. */
389 inputs_num_is_power_of_two = 1;
395 inputs_num_is_power_of_two = 1;
397 inputs_num_is_power_of_two = 0;
403 population_insert (population, n);
404 sn_network_destroy (n);
407 printf ("Current configuration:\n"
408 " Initial network: %s\n"
409 " Number of inputs: %3i\n"
410 " Population size: %3i\n"
411 "=======================\n",
412 initial_input_file, inputs_num, max_population_size);
414 evolution_start (evolution_threads_num);
416 printf ("Exiting after %llu iterations.\n",
417 (unsigned long long) iteration_counter);
422 n = population_get_fittest (population);
425 if (best_output_file != NULL)
426 sn_network_write_file (n, best_output_file);
428 sn_network_destroy (n);
432 population_destroy (population);
437 /* vim: set shiftwidth=2 softtabstop=2 : */