-#define _ISOC99_SOURCE
-#define _POSIX_C_SOURCE 200112L
+/**
+ * libsortnetwork - src/sn_population.c
+ * Copyright (C) 2008-2010 Florian octo Forster
+ *
+ * This program is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License as published by the
+ * Free Software Foundation; only version 2 of the License is applicable.
+ *
+ * This program is distributed in the hope that it will be useful, but
+ * WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
+ * General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License along
+ * with this program; if not, write to the Free Software Foundation, Inc.,
+ * 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
+ *
+ * Authors:
+ * Florian octo Forster <ff at octo.it>
+ **/
+
+#ifndef _ISOC99_SOURCE
+# define _ISOC99_SOURCE
+#endif
+#ifndef _POSIX_C_SOURCE
+# define _POSIX_C_SOURCE 200112L
+#endif
#include <stdlib.h>
#include <stdio.h>
{
uint32_t size;
+ sn_network_t *best_network;
+ int best_rating;
+
sn_network_t **networks;
int *ratings;
uint32_t networks_num;
return (rate);
} /* int rate_network */
+static int brute_force_minimize (sn_network_t *n_orig)
+{
+ int stage_index;
+ int comparator_index;
+
+ /* printf ("brute_force_minimize: Running full fledged brute force optimization.\n"); */
+
+ for (stage_index = 0;
+ stage_index < SN_NETWORK_STAGE_NUM (n_orig);
+ stage_index++)
+ {
+ sn_stage_t *s_orig;
+
+ s_orig = SN_NETWORK_STAGE_GET (n_orig, stage_index);
+
+ for (comparator_index = 0;
+ comparator_index < SN_STAGE_COMP_NUM (s_orig);
+ comparator_index++)
+ {
+ sn_network_t *n_copy;
+ sn_stage_t *s_copy;
+ int status;
+
+ n_copy = sn_network_clone (n_orig);
+ if (n_copy == NULL)
+ continue;
+
+ s_copy = SN_NETWORK_STAGE_GET (n_copy, stage_index);
+ sn_stage_comparator_remove (s_copy, comparator_index);
+
+ status = sn_network_brute_force_check (n_copy);
+ if (status == 0)
+ {
+ /*
+ printf ("brute_force_minimize: Removed a comparator "
+ "(stage %i, comparator %i).\n",
+ stage_index, comparator_index);
+ */
+ sn_stage_comparator_remove (s_orig, comparator_index);
+
+ comparator_index--;
+ }
+
+ sn_network_destroy (n_copy);
+ n_copy = NULL;
+ } /* for (comparator_index) */
+ } /* for (stage_index) */
+
+ /* FIXME: Remove this check after debugging. */
+ assert (sn_network_brute_force_check (n_orig) == 0);
+
+ return (0);
+} /* int brute_force_minimize */
+
sn_population_t *sn_population_create (uint32_t size)
{
sn_population_t *p;
pthread_mutex_lock (&p->lock);
+ if (p->best_rating >= (rating - 4))
+ {
+ pthread_mutex_unlock (&p->lock);
+
+ brute_force_minimize (n_copy);
+ rating = rate_network (n_copy);
+
+ pthread_mutex_lock (&p->lock);
+ }
+
+ if ((p->best_rating >= rating)
+ || (p->best_network == NULL))
+ {
+ sn_network_t *n_copy_best;
+
+ n_copy_best = sn_network_clone (n);
+ if (n_copy_best != NULL)
+ {
+ if (p->best_network != NULL)
+ sn_network_destroy (p->best_network);
+ p->best_network = n_copy_best;
+ p->best_rating = rating;
+ }
+ }
+
if (p->networks_num < p->size)
{
p->networks[p->networks_num] = n_copy;