/*
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
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.
+ Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor,
+ Boston, MA 02110-1301, USA.
*/
/**
* @param num_edges number of edges leaving current state.
* @param edges edges leaving current state.
*/
-static void
+static void
print_edge (void *cls,
const struct GNUNET_HashCode *key,
const char *proof,
/**
* 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.
*
if (3 != argc)
{
fprintf (stderr,
- "Usage: %s REGEX_FILE COMPRESSION\n",
+ "Usage: %s REGEX_FILE COMPRESSION\n",
argv[0]);
return 1;
}
GNUNET_asprintf (®ex, "GNUNET_REGEX_PROFILER_(%s)(0|1)*", buffer);
size = strlen (regex);
- fprintf (stderr,
- "Combined regex (%ld bytes):\n%s\n",
- size,
+ fprintf (stderr,
+ "Combined regex (%ld bytes):\n%s\n",
+ size,
regex);
dfa = REGEX_INTERNAL_construct_dfa (regex, size, compression);
printf ("********* ALL EDGES *********'\n");