2 * libsortnetwork - 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 200809L
29 # define _XOPEN_SOURCE 700
37 #include <sys/types.h>
47 #include <population.h>
49 #include "sn_network.h"
50 #include "sn_random.h"
52 #if !defined(__GNUC__) || !__GNUC__
53 # define __attribute__(x) /**/
56 static uint64_t iteration_counter = 0;
57 static int inputs_num = 16;
58 static int inputs_num_is_power_of_two = 1;
60 static char *initial_input_file = NULL;
61 static char *best_output_file = NULL;
63 static int stats_interval = 0;
65 static int max_population_size = 128;
66 static population_t *population;
68 static int evolution_threads_num = 4;
70 static int do_loop = 0;
72 static void sigint_handler (int signal __attribute__((unused)))
75 } /* void sigint_handler */
77 static void exit_usage (const char *name)
79 printf ("Usage: %s [options]\n"
81 "Valid options are:\n"
82 " -i <file> Initial input file (REQUIRED)\n"
83 " -o <file> Write the current best solution to <file>\n"
84 " -p <num> Size of the population (default: 128)\n"
85 " -P <peer> Send individuals to <peer> (may be repeated)\n"
86 " -t <num> Number of threads (default: 4)\n"
90 } /* void exit_usage */
92 int read_options (int argc, char **argv)
96 while ((option = getopt (argc, argv, "i:o:p:P:s:t:h")) != -1)
102 if (initial_input_file != NULL)
103 free (initial_input_file);
104 initial_input_file = strdup (optarg);
110 if (best_output_file != NULL)
111 free (best_output_file);
112 best_output_file = strdup (optarg);
118 int tmp = atoi (optarg);
121 max_population_size = tmp;
122 population_set_size (population, (size_t) max_population_size);
131 status = population_add_peer (population, optarg, /* port = */ NULL);
134 fprintf (stderr, "population_add_peer failed with status %i.\n",
142 int tmp = atoi (optarg);
144 stats_interval = tmp;
150 int tmp = atoi (optarg);
152 evolution_threads_num = tmp;
158 exit_usage (argv[0]);
163 } /* int read_options */
165 static int rate_network (const sn_network_t *n)
170 rate = SN_NETWORK_STAGE_NUM (n) * SN_NETWORK_INPUT_NUM (n);
171 for (i = 0; i < SN_NETWORK_STAGE_NUM (n); i++)
173 sn_stage_t *s = SN_NETWORK_STAGE_GET (n, i);
174 rate += SN_STAGE_COMP_NUM (s);
178 } /* int rate_network */
181 static int mutate_network (sn_network_t *n)
183 sn_network_t *n_copy;
186 int comparator_index;
189 n_copy = sn_network_clone (n);
192 fprintf (stderr, "mutate_network: sn_network_clone failed.\n");
196 stage_index = sn_bounded_random (0, SN_NETWORK_STAGE_NUM (n_copy) - 1);
197 s = SN_NETWORK_STAGE_GET (n_copy, stage_index);
199 comparator_index = sn_bounded_random (0, SN_STAGE_COMP_NUM (s) - 1);
200 sn_stage_comparator_remove (s, comparator_index);
202 status = sn_network_brute_force_check (n_copy);
204 sn_network_destroy (n_copy);
208 else if (status > 0) /* Mutated network does not sort anymore. */
211 /* We saved one comparator \o/ Let's do the same change on the original
213 s = SN_NETWORK_STAGE_GET (n, stage_index);
214 sn_stage_comparator_remove (s, comparator_index);
217 } /* int mutate_network */
220 static int create_offspring (void)
226 p0 = population_get_random (population);
227 p1 = population_get_random (population);
232 /* combine the two parents */
233 n = sn_network_combine (p0, p1);
235 sn_network_destroy (p0);
236 sn_network_destroy (p1);
238 /* randomly chose an input and do a min- or max-cut. */
239 while (SN_NETWORK_INPUT_NUM (n) > inputs_num)
242 enum sn_network_cut_dir_e dir;
244 pos = sn_bounded_random (0, SN_NETWORK_INPUT_NUM (n) - 1);
245 dir = (sn_bounded_random (0, 1) == 0) ? DIR_MIN : DIR_MAX;
247 assert ((pos >= 0) && (pos < SN_NETWORK_INPUT_NUM (n)));
249 sn_network_cut_at (n, pos, dir);
252 /* compress the network to get a compact representation */
253 sn_network_compress (n);
255 assert (SN_NETWORK_INPUT_NUM (n) == inputs_num);
258 if ((SN_NETWORK_INPUT_NUM (n) <= 16) && (sn_bounded_random (0, 100) <= 1))
262 population_insert (population, n);
264 sn_network_destroy (n);
267 } /* int create_offspring */
269 static void *evolution_thread (void *arg __attribute__((unused)))
274 /* XXX: Not synchronized! */
279 } /* int start_evolution */
281 static int evolution_start (int threads_num)
283 pthread_t threads[threads_num]; /* C99 ftw! */
286 for (i = 0; i < threads_num; i++)
290 status = pthread_create (&threads[i], /* attr = */ NULL,
291 evolution_thread, /* arg = */ NULL);
294 fprintf (stderr, "evolution_start: pthread_create[%i] failed "
314 iter = iteration_counter;
316 n = population_get_fittest (population);
318 rating = rate_network (n);
320 stages_num = SN_NETWORK_STAGE_NUM (n);
322 for (i = 0; i < stages_num; i++)
326 s = SN_NETWORK_STAGE_GET (n, i);
327 comparators_num += SN_STAGE_COMP_NUM (s);
330 sn_network_destroy (n);
332 printf ("Best after approximately %i iterations: "
333 "%i comparators in %i stages. Rating: %i.\n",
334 iter, comparators_num, stages_num, rating);
338 for (i = 0; i < threads_num; i++)
342 pthread_join (threads[i], /* value_ptr = */ NULL);
346 } /* int evolution_start */
348 int main (int argc, char **argv)
350 struct sigaction sigint_action;
351 struct sigaction sigterm_action;
353 population = population_create ((pi_rate_f) rate_network,
354 (pi_copy_f) sn_network_clone,
355 (pi_free_f) sn_network_destroy);
356 if (population == NULL)
358 fprintf (stderr, "population_create failed.\n");
362 population_set_serialization (population,
363 (pi_serialize_f) sn_network_serialize,
364 (pi_unserialize_f) sn_network_unserialize);
366 read_options (argc, argv);
367 if (initial_input_file == NULL)
368 exit_usage (argv[0]);
370 memset (&sigint_action, '\0', sizeof (sigint_action));
371 sigint_action.sa_handler = sigint_handler;
372 sigaction (SIGINT, &sigint_action, NULL);
374 memset (&sigterm_action, '\0', sizeof (sigterm_action));
375 sigterm_action.sa_handler = sigint_handler;
376 sigaction (SIGTERM, &sigterm_action, NULL);
378 population_start_listen_thread (population, NULL, NULL);
384 n = sn_network_read_file (initial_input_file);
387 printf ("n == NULL\n");
391 inputs_num = SN_NETWORK_INPUT_NUM(n);
393 /* Determine if `inputs_num' is a power of two. If so, more merge
394 * algorithms can be used. */
396 inputs_num_is_power_of_two = 1;
402 inputs_num_is_power_of_two = 1;
404 inputs_num_is_power_of_two = 0;
410 population_insert (population, n);
411 sn_network_destroy (n);
414 printf ("Current configuration:\n"
415 " Initial network: %s\n"
416 " Number of inputs: %3i\n"
417 " Population size: %3i\n"
418 "=======================\n",
419 initial_input_file, inputs_num, max_population_size);
421 evolution_start (evolution_threads_num);
423 printf ("Exiting after %llu iterations.\n",
424 (unsigned long long) iteration_counter);
429 n = population_get_fittest (population);
432 if (best_output_file != NULL)
433 sn_network_write_file (n, best_output_file);
435 sn_network_destroy (n);
439 population_destroy (population);
444 /* vim: set shiftwidth=2 softtabstop=2 : */