re2c_test Namespace Reference

Functions
static bool	bit_set (uint32_t n, uint32_t bit)
template<uint8_t BITS>
re2c::Range *	range (uint32_t n)
template<uint8_t BITS>
re2c::Range *	add (uint32_t n1, uint32_t n2)
template<uint8_t BITS>
re2c::Range *	sub (uint32_t n1, uint32_t n2)
static bool	equal (const re2c::Range *r1, const re2c::Range *r2)
static void	show (const re2c::Range *r)
static int32_t	diff (const re2c::Range *r1, const re2c::Range *r2, const re2c::Range *op1, const re2c::Range *op2, const char *op)
static int32_t	test ()
static char *	u64_to_s_fastest_ever (uint64_t u, char *s)
static int32_t	test_u (uint64_t i)
static int32_t	test_i (int64_t i)
static int32_t	test ()

Variables
static const uint32_t	DIGITS = 256

Function Documentation

template<uint8_t BITS>

re2c::Range * re2c_test::add	(	uint32_t	n1,
		uint32_t	n2
	)

Definition at line 37 of file test-impl.h.

{
    return range<BITS> (n1 | n2);
}

static bool re2c_test::bit_set ( uint32_t  n, uint32_t  bit  )

inlinestatic

Definition at line 10 of file test-impl.h.

{
    return n & (1u << bit);
}

Here is the caller graph for this function:

static int32_t re2c_test::diff ( const re2c::Range *  r1, const re2c::Range *  r2, const re2c::Range *  op1, const re2c::Range *  op2, const char *  op  )

static

Definition at line 43 of file test.cc.

{
    if (equal (op1, op2))
    {
        return 0;
    }
    else
    {
        fprintf (stderr, "%s error: ", op);
        show (r1);
        fprintf (stderr, " %s ", op);
        show (r2);
        fprintf (stderr, " ====> ");
        show (op2);
        fprintf (stderr, " =/= ");
        show (op1);
        fprintf (stderr, "\n");
        return 1;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

static bool re2c_test::equal ( const re2c::Range *  r1, const re2c::Range *  r2  )

static

Definition at line 8 of file test.cc.

{
    for (; r1 && r2; r1 = r1->next (), r2 = r2->next ())
    {
        if (r1->lower () != r2->lower ()
            || r1->upper () != r2->upper ())
        {
            return false;
        }
    }
    return !r1 && !r2;
}

Here is the call graph for this function:

Here is the caller graph for this function:

template<uint8_t BITS>

re2c::Range * re2c_test::range

(

uint32_t

n

)

Definition at line 16 of file test-impl.h.

{
    RE2C_STATIC_ASSERT (BITS <= 31);

    re2c::Range * r = NULL;
    re2c::Range ** p = &r;
    for (uint32_t i = 0; i < BITS; ++i)
    {
        for (; i < BITS && !bit_set (n, i); ++i);
        if (i == BITS && !bit_set (n, BITS - 1))
        {
            break;
        }
        const uint32_t lb = i;
        for (; i < BITS && bit_set (n, i); ++i);
        re2c::Range::append (p, lb, i);
    }
    return r;
}

Here is the call graph for this function:

static void re2c_test::show ( const re2c::Range *  r )

static

Definition at line 21 of file test.cc.

{
    if (!r)
    {
        fprintf (stderr, "[]");
    }
    for (; r; r = r->next ())
    {
        const uint32_t l = r->lower ();
        const uint32_t u = r->upper () - 1;
        if (l < u)
        {
            fprintf (stderr, "[%X-%X]", l, u);
        }
        else
        {
            fprintf (stderr, "[%X]", l);
        }
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

template<uint8_t BITS>

re2c::Range * re2c_test::sub	(	uint32_t	n1,
		uint32_t	n2
	)

Definition at line 43 of file test-impl.h.

{
    return range<BITS> (n1 & ~n2);
}

static int32_t re2c_test::test ( )

static

Definition at line 58 of file test.cc.

{
    int32_t ok = 0;

    static const uint64_t UDELTA = 0xFFFF;
    // zero neighbourhood
    for (uint64_t i = 0; i <= UDELTA; ++i)
    {
        ok |= test_u (i);
    }
    // u32_max neighbourhood
    static const uint64_t u32_max = std::numeric_limits<uint32_t>::max();
    for (uint64_t i = u32_max - UDELTA; i <= u32_max + UDELTA; ++i)
    {
        ok |= test_u (i);
    }

    static const int64_t IDELTA = 0xFFFF;
    // i32_min neighbourhood
    static const int64_t i32_min = std::numeric_limits<int32_t>::min();
    for (int64_t i = i32_min - IDELTA; i <= i32_min + IDELTA; ++i)
    {
        ok |= test_i (i);
    }
    // zero neighbourhood
    for (int64_t i = -IDELTA; i <= IDELTA; ++i)
    {
        ok |= test_i (i);
    }
    // i32_max neighbourhood
    static const int64_t i32_max = std::numeric_limits<int32_t>::max();
    for (int64_t i = i32_max - IDELTA; i <= i32_max + IDELTA; ++i)
    {
        ok |= test_i (i);
    }

    return ok;
}

Here is the call graph for this function:

static int32_t re2c_test::test ( )

static

Definition at line 68 of file test.cc.

{
    int32_t ok = 0;

    static const uint32_t BITS = 8;
    static const uint32_t N = 1u << BITS;
    for (uint32_t i = 0; i <= N; ++i)
    {
        for (uint32_t j = 0; j <= N; ++j)
        {
            re2c::Range * r1 = range<BITS> (i);
            re2c::Range * r2 = range<BITS> (j);
            ok |= diff (r1, r2, add<BITS> (i, j), re2c::Range::add (r1, r2), "U");
            ok |= diff (r1, r2, sub<BITS> (i, j), re2c::Range::sub (r1, r2), "D");
            re2c::Range::vFreeList.clear ();
        }
    }

    return ok;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int32_t re2c_test::test_i ( int64_t  i )

static

Definition at line 37 of file test.cc.

{
    char s [DIGITS];
    char * const s_end = s + DIGITS;
    const uint64_t i_abs = i < 0
        ? static_cast<uint64_t> (-i)
        : static_cast<uint64_t> (i);
    char * s_start = u64_to_s_fastest_ever (i_abs, s_end);
    if (i < 0)
    {
        *--s_start = '-';
    }
    int32_t j = i == 0; // not equal to i
    if (s_to_i32_unsafe (s_start, s_end, j) && j != i)
    {
        fprintf (stderr, "signed: expected: %ld, got: %d\n", i, j);
        return 1;
    }
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static int32_t re2c_test::test_u ( uint64_t  i )

static

Definition at line 23 of file test.cc.

{
    char s [DIGITS];
    char * const s_end = s + DIGITS;
    char * const s_start = u64_to_s_fastest_ever (i, s_end);
    uint32_t u = i == 0; // not equal to i
    if (s_to_u32_unsafe (s_start, s_end, u) && u != i)
    {
        fprintf (stderr, "unsigned: expected: %lu, got: %u\n", i, u);
        return 1;
    }
    return 0;
}

Here is the call graph for this function:

Here is the caller graph for this function:

static char* re2c_test::u64_to_s_fastest_ever ( uint64_t  u, char *  s  )

static

Definition at line 12 of file test.cc.

{
    while (u > 0)
    {
        const uint64_t d = u % 10 + '0';
        *--s = static_cast<char> (d);
        u /= 10;
    }
    return s;
}

Here is the caller graph for this function:

Variable Documentation

const uint32_t re2c_test::DIGITS = 256

static

Definition at line 8 of file test.cc.