/*
 *      Test of KMP search
 *
 *      (c) 2006, Pavel Charvat <pchar@ucw.cz>
 */

#include <ucw/lib.h>
#include <ucw/mempool.h>
#include <string.h>

#if 0
#define TRACE(x...) do{msg(L_DEBUG, x);}while(0)
#else
#define TRACE(x...) do{}while(0)
#endif

/* TEST1 - multiple searches */

#define KMP_PREFIX(x) kmp1_##x
#define KMP_WANT_CLEANUP
#include <ucw/kmp.h>
#define KMPS_PREFIX(x) kmp1s1_##x
#define KMPS_KMP_PREFIX(x) kmp1_##x
#define KMPS_WANT_BEST
#define KMPS_EXIT(kmp,src,s) TRACE("Best match has %d characters", s->best->len)
#include <ucw/kmp-search.h>
#define KMPS_PREFIX(x) kmp1s2_##x
#define KMPS_KMP_PREFIX(x) kmp1_##x
#define KMPS_VARS uint count;
#define KMPS_INIT(kmp,src,s) s->u.count = 0
#define KMPS_FOUND(kmp,src,s) s->u.count++
#include <ucw/kmp-search.h>

static void
test1(void)
{
  TRACE("Running test1");
  struct kmp1_struct kmp;
  kmp1_init(&kmp);
  kmp1_add(&kmp, "ahoj");
  kmp1_add(&kmp, "hoj");
  kmp1_add(&kmp, "aho");
  kmp1_build(&kmp);
  struct kmp1s1_search s1;
  kmp1s1_search(&kmp, &s1, "asjlahslhalahosjkjhojsas");
  ASSERT(s1.best->len == 3);
  struct kmp1s2_search s2;
  kmp1s2_search(&kmp, &s2, "asjlahslhalahojsjkjhojsas");
  ASSERT(s2.u.count == 4);
  kmp1_cleanup(&kmp);
}

#ifdef CONFIG_CHARSET		/* This one depends on libucw-charset */

/* TEST2 - various tracing */

#define KMP_PREFIX(x) kmp2_##x
#define KMP_USE_UTF8
#define KMP_TOLOWER
#define KMP_ONLYALPHA
#define KMP_STATE_VARS char *str; uint id;
#define KMP_ADD_EXTRA_ARGS uint id
#define KMP_VARS char *start;
#define KMP_ADD_INIT(kmp,src) kmp->u.start = src
#define KMP_ADD_NEW(kmp,src,s) do{ TRACE("Inserting string %s with id %d", kmp->u.start, id); \
  s->u.str = kmp->u.start; s->u.id = id; }while(0)
#define KMP_ADD_DUP(kmp,src,s) TRACE("String %s already inserted", kmp->u.start)
#define KMP_WANT_CLEANUP
#define KMP_WANT_SEARCH
#define KMPS_ADD_CONTROLS
#define KMPS_MERGE_CONTROLS
#define KMPS_FOUND(kmp,src,s) TRACE("String %s with id %d found", s->out->u.str, s->out->u.id)
#define KMPS_STEP(kmp,src,s) TRACE("Got to state %p after reading %d", s->s, s->c)
#include <ucw/kmp.h>

static void
test2(void)
{
  TRACE("Running test2");
  struct kmp2_struct kmp;
  kmp2_init(&kmp);
  kmp2_add(&kmp, "ahoj", 1);
  kmp2_add(&kmp, "ahoj", 2);
  kmp2_add(&kmp, "hoj", 3);
  kmp2_add(&kmp, "aho", 4);
  kmp2_add(&kmp, "aba", 5);
  kmp2_add(&kmp, "aba", 5);
  kmp2_add(&kmp, "pěl", 5);
  kmp2_build(&kmp);
  kmp2_run(&kmp, "Šíleně žluťoučký kůň úpěl ďábelské ódy labababaks sdahojdhsaladsjhla");
  kmp2_cleanup(&kmp);
}

#endif

/* TEST3 - random tests */

#define KMP_PREFIX(x) kmp3_##x
#define KMP_STATE_VARS uint index;
#define KMP_ADD_EXTRA_ARGS uint index
#define KMP_VARS char *start;
#define KMP_ADD_INIT(kmp,src) kmp->u.start = src
#define KMP_ADD_NEW(kmp,src,s) s->u.index = index
#define KMP_ADD_DUP(kmp,src,s) *(kmp->u.start) = 0
#define KMP_WANT_CLEANUP
#define KMP_WANT_SEARCH
#define KMPS_VARS uint sum, *cnt;
#define KMPS_FOUND(kmp,src,s) do{ ASSERT(s->u.cnt[s->out->u.index]); s->u.cnt[s->out->u.index]--; s->u.sum--; }while(0)
#include <ucw/kmp.h>

static void
test3(void)
{
  TRACE("Running test3");
  struct mempool *pool = mp_new(1024);
  for (uint testn = 0; testn < 100; testn++)
  {
    mp_flush(pool);
    uint n = random_max(100);
    char *s[n];
    struct kmp3_struct kmp;
    kmp3_init(&kmp);
    for (uint i = 0; i < n; i++)
      {
        uint m = random_max(10);
        s[i] = mp_alloc(pool, m + 1);
        for (uint j = 0; j < m; j++)
	  s[i][j] = 'a' + random_max(3);
        s[i][m] = 0;
        kmp3_add(&kmp, s[i], i);
      }
    kmp3_build(&kmp);
    for (uint i = 0; i < 10; i++)
      {
        uint m = random_max(100);
        byte b[m + 1];
        for (uint j = 0; j < m; j++)
	  b[j] = 'a' + random_max(4);
        b[m] = 0;
        uint cnt[n];
	struct kmp3_search search;
	search.u.sum = 0;
	search.u.cnt = cnt;
        for (uint j = 0; j < n; j++)
          {
	    cnt[j] = 0;
	    if (*s[j])
	      for (uint k = 0; k < m; k++)
	        if (!strncmp(b + k, s[j], strlen(s[j])))
	          cnt[j]++, search.u.sum++;
	  }
        kmp3_search(&kmp, &search, b);
        ASSERT(search.u.sum == 0);
      }
    kmp3_cleanup(&kmp);
  }
  mp_delete(pool);
}

/* TEST4 - user-defined character type */

struct kmp4_struct;
struct kmp4_state;

static inline int
kmp4_eq(struct kmp4_struct *kmp UNUSED, byte *a, byte *b)
{
  return (a == b) || (a && b && *a == *b);
}

static inline uint
kmp4_hash(struct kmp4_struct *kmp UNUSED, struct kmp4_state *s, byte *c)
{
  return (c ? (*c << 16) : 0) + (uint)(uintptr_t)s;
}

#define KMP_PREFIX(x) kmp4_##x
#define KMP_CHAR byte *
#define KMP_CONTROL_CHAR NULL
#define KMP_GET_CHAR(kmp,src,c) ({ c = src++; !!*c; })
#define KMP_GIVE_HASHFN
#define KMP_GIVE_EQ
#define KMP_WANT_CLEANUP
#define KMP_WANT_SEARCH
#define KMPS_FOUND(kmp,src,s) TRACE("found")
#define KMPS_ADD_CONTROLS
#define KMPS_MERGE_CONTROLS
#include <ucw/kmp.h>

static void
test4(void)
{
  TRACE("Running test4");
  struct kmp4_struct kmp;
  kmp4_init(&kmp);
  kmp4_add(&kmp, "ahoj");
  kmp4_build(&kmp);
  kmp4_run(&kmp, "djdhaskjdahoahaahojojshdaksjahdahojskj");
  kmp4_cleanup(&kmp);
}

int
main(void)
{
  test1();
#ifdef CONFIG_CHARSET
  test2();
#endif
  test3();
  test4();
  return 0;
}