perf-regex.c File Reference

#include "platform.h"
#include <regex.h>
#include <time.h>
#include "regex_internal_lib.h"
#include "regex_test_lib.h"

Include dependency graph for perf-regex.c:

Go to the source code of this file.

Functions
static 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)
	Print information about the given node and its edges to stdout. More...
int	main (int argc, char *const *argv)
	The main function of the regex performance test. More...

Function Documentation

print_edge()

static 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  )

static

Print information about the given node and its edges to stdout.

Parameters

cls	closure, unused.
key	hash for current state.
proof	proof for current state.
accepting	GNUNET_YES if this is an accepting state, GNUNET_NO if not.
num_edges	number of edges leaving current state.
edges	edges leaving current state.

Definition at line 45 of file perf-regex.c.

{
  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));
}

References GNUNET_h2s(), key, and proof.

Referenced by main().

Here is the call graph for this function:

Here is the caller graph for this function:

main()

int main	(	int	argc,
		char *const *	argv
	)

The main function of the regex performance test.

Read a set of regex from a file, combine them and create a DFA from the resulting combined regex.

Parameters

argc	number of arguments from the command line
argv	command line arguments

Returns

0 ok, 1 on error

Definition at line 76 of file perf-regex.c.

{
  struct REGEX_INTERNAL_Automaton*dfa;
  char **regexes;
  char *buffer;
  char *regex;
  int compression;
  unsigned int alphabet_size;
  long size;
 
  GNUNET_log_setup ("perf-regex", "DEBUG", NULL);
  if (4 != argc)
  {
    fprintf (stderr,
             "Usage: %s REGEX_FILE ALPHABET_SIZE COMPRESSION\n",
             argv[0]);
    return 1;
  }
  regexes = REGEX_TEST_read_from_file (argv[1]);
  if (NULL == regexes)
  {
    fprintf (stderr,
             "Failed to read regexes from `%s'\n",
             argv[1]);
    return 2;
  }
  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 (&regex, "GNUNET_REGEX_PROFILER_(%s)(0|1)*", buffer);
  size = strlen (regex);
 
  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);
  REGEX_TEST_free_from_file (regexes);
  GNUNET_free (regex);
  return 0;
}

References GNUNET_asprintf(), GNUNET_free, GNUNET_log_setup(), print_edge(), REGEX_INTERNAL_Automaton::regex, REGEX_INTERNAL_automaton_destroy(), REGEX_INTERNAL_construct_dfa(), REGEX_INTERNAL_iterate_all_edges(), REGEX_INTERNAL_iterate_reachable_edges(), REGEX_TEST_combine(), REGEX_TEST_free_from_file(), REGEX_TEST_read_from_file(), and size.

Here is the call graph for this function: