/*
This file is part of GNUnet.
- (C) 2012 Christian Grothoff (and other contributing authors)
+ Copyright (C) 2012 GNUnet e.V.
- GNUnet 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; either version 3, or (at your
- option) any later version.
+ GNUnet is free software: you can redistribute it and/or modify it
+ under the terms of the GNU Affero General Public License as published
+ by the Free Software Foundation, either version 3 of the License,
+ or (at your option) any later version.
GNUnet 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.
+ Affero General Public License for more details.
- You should have received a copy of the GNU General Public License
- along with GNUnet; see the file COPYING. If not, write to the
- Free Software Foundation, Inc., 59 Temple Place - Suite 330,
- Boston, MA 02111-1307, USA.
-*/
+ You should have received a copy of the GNU Affero General Public License
+ along with this program. If not, see <http://www.gnu.org/licenses/>.
+
+ SPDX-License-Identifier: AGPL3.0-or-later
+ */
/**
- * @file regex/prof-regex.c
+ * @file src/regex/perf-regex.c
* @brief Test how long it takes to create a automaton from a string regex.
* @author Bartlomiej Polot
*/
#include <regex.h>
#include <time.h>
#include "platform.h"
-#include "gnunet_regex_lib.h"
+#include "regex_internal_lib.h"
+#include "regex_test_lib.h"
-static const char *exe;
+/**
+ * Print information about the given node and its edges
+ * to stdout.
+ *
+ * @param cls closure, unused.
+ * @param key hash for current state.
+ * @param proof proof for current state.
+ * @param accepting GNUNET_YES if this is an accepting state, GNUNET_NO if not.
+ * @param num_edges number of edges leaving current state.
+ * @param edges edges leaving current state.
+ */
static void
-usage(void)
+print_edge (void *cls,
+ const struct GNUNET_HashCode *key,
+ const char *proof,
+ int accepting,
+ unsigned int num_edges,
+ const struct REGEX_BLOCK_Edge *edges)
{
- fprintf (stderr, "Usage: %s REGEX_FILE COMPRESSION\n", exe);
+ unsigned int i;
+
+ printf ("%s: %s, proof: `%s'\n",
+ GNUNET_h2s (key),
+ accepting ? "ACCEPTING" : "",
+ proof);
+ for (i = 0; i < num_edges; i++)
+ printf (" `%s': %s\n",
+ edges[i].label,
+ GNUNET_h2s (&edges[i].destination));
}
+
/**
- * The main function to obtain peer information.
+ * The main function of the regex performace test.
+ *
+ * Read a set of regex from a file, combine them and create a DFA from the
+ * resulting combined regex.
*
* @param argc number of arguments from the command line
* @param argv command line arguments
int
main (int argc, char *const *argv)
{
- struct GNUNET_REGEX_Automaton* dfa;
+ struct REGEX_INTERNAL_Automaton*dfa;
char **regexes;
char *buffer;
char *regex;
- unsigned int nr;
- unsigned int i;
int compression;
+ unsigned int alphabet_size;
long size;
- size_t len;
- FILE *f;
GNUNET_log_setup ("perf-regex", "DEBUG", NULL);
- exe = argv[0];
- if (3 != argc)
+ if (4 != argc)
{
- usage();
+ fprintf (stderr,
+ "Usage: %s REGEX_FILE ALPHABET_SIZE COMPRESSION\n",
+ argv[0]);
return 1;
}
- f = fopen (argv[1], "r");
- if (NULL == f)
+ regexes = REGEX_TEST_read_from_file (argv[1]);
+ if (NULL == regexes)
{
- fprintf (stderr, "Can't open file %s\n", argv[1]);
- usage();
+ fprintf (stderr,
+ "Failed to read regexes from `%s'\n",
+ argv[1]);
return 2;
}
- fseek (f, 0, SEEK_END);
- size = ftell (f);
- fprintf (stderr, "using file %s, size %ld\n", argv[1], size);
- fseek (f, 0, SEEK_SET);
- buffer = GNUNET_malloc (size + 1);
- regexes = GNUNET_malloc (sizeof (char *));
- nr = 1;
- do
- {
- if (NULL == fgets (buffer, size + 1, f))
- {
- fprintf (stderr, "Can't read file %s\n", argv[1]);
- usage();
- return 3;
- }
- len = strlen (buffer);
- if (len < 1)
- continue;
- if ('\n' == buffer[len - 1])
- {
- len--;
- buffer[len] = '\0';
- }
- if (len < 6 || strncmp (&buffer[len - 6], "(0|1)*", 6) != 0)
- {
- fprintf (stderr, "\nWARNING:\n");
- fprintf (stderr, "%s (line %u) does not end in (0|1)*\n", buffer, nr);
- }
- else
- {
- buffer[len - 6] = '\0';
- }
- GNUNET_array_grow (regexes, nr, nr+1);
- regexes[nr - 2] = GNUNET_strdup (buffer);
- regexes[nr - 1] = NULL;
- } while (ftell(f) < size);
- GNUNET_free (buffer);
-
- buffer = GNUNET_REGEX_combine (regexes);
-
- GNUNET_asprintf (®ex, "GNVPN-0001-PAD(%s)(0|1)*", buffer);
+ alphabet_size = atoi (argv[2]);
+ compression = atoi (argv[3]);
+ printf ("********* PERF-REGEX *********'\n");
+ printf ("Using:\n file '%s'\n Alphabet size %u\n compression %d\n",
+ argv[1], alphabet_size, compression);
+ fflush (stdout);
+ buffer = REGEX_TEST_combine (regexes, alphabet_size);
+ GNUNET_asprintf (®ex, "GNUNET_REGEX_PROFILER_(%s)(0|1)*", buffer);
size = strlen (regex);
-
- // fprintf (stderr, "Combined regex:\n%s\n", regex);
- // return 0;
- compression = atoi (argv[2]);
- dfa = GNUNET_REGEX_construct_dfa (regex, size, compression);
- GNUNET_REGEX_automaton_destroy (dfa);
+ fprintf (stderr,
+ "Combined regex (%ld bytes):\n%s\n",
+ size,
+ regex);
+ dfa = REGEX_INTERNAL_construct_dfa (regex, size, compression);
+ printf ("********* ALL EDGES *********'\n");
+ REGEX_INTERNAL_iterate_all_edges (dfa, &print_edge, NULL);
+ printf ("\n\n********* REACHABLE EDGES *********'\n");
+ REGEX_INTERNAL_iterate_reachable_edges (dfa, &print_edge, NULL);
+ REGEX_INTERNAL_automaton_destroy (dfa);
GNUNET_free (buffer);
- for (i=0;i<nr;i++)
- GNUNET_free_non_null (regexes[i]);
- GNUNET_array_grow (regexes, nr, 0);
+ REGEX_TEST_free_from_file (regexes);
+ GNUNET_free (regex);
return 0;
}
+
/* end of prof-regex.c */
projects / oweals / gnunet.git / blobdiff