re2c::BitMap Class Reference

#include <bitmap.h>

Collaboration diagram for re2c::BitMap:

Public Member Functions
	BitMap (const Go *, const State *)
	~BitMap ()
	FORBID_COPY (BitMap)

Static Public Member Functions
static const BitMap *	find (const Go *, const State *)
static const BitMap *	find (const State *)
static void	gen (OutputFile &, uint32_t ind, uint32_t, uint32_t)

Public Attributes
const Go *	go
const State *	on
const BitMap *	next
uint32_t	i
uint32_t	m

Static Public Attributes
static BitMap *	first = NULL

Detailed Description

Definition at line 16 of file bitmap.h.

Constructor & Destructor Documentation

re2c::BitMap::BitMap	(	const Go *	g,
		const State *	x
	)

Definition at line 15 of file bitmap.cc.

    : go(g)
    , on(x)
    , next(first)
    , i(0)
    , m(0)
{
    first = this;
}

Here is the caller graph for this function:

re2c::BitMap::~BitMap

(

)

Definition at line 25 of file bitmap.cc.

{
    delete next;
}

Member Function Documentation

const BitMap * re2c::BitMap::find ( const Go *  g, const State *  x  )

static

Definition at line 30 of file bitmap.cc.

{
    for (const BitMap *b = first; b; b = b->next)
    {
        if (matches(b->go->span, b->go->nSpans, b->on, g->span, g->nSpans, x))
        {
            return b;
        }
    }

    return new BitMap(g, x);
}

Here is the call graph for this function:

Here is the caller graph for this function:

const BitMap * re2c::BitMap::find ( const State *  x )

static

Definition at line 43 of file bitmap.cc.

{
    for (const BitMap *b = first; b; b = b->next)
    {
        if (b->on == x)
        {
            return b;
        }
    }

    return NULL;
}

re2c::BitMap::FORBID_COPY

(

BitMap

)

void re2c::BitMap::gen ( OutputFile &  o, uint32_t  ind, uint32_t  lb, uint32_t  ub  )

static

Definition at line 75 of file bitmap.cc.

{
    if (first && bUsedYYBitmap)
    {
        o.wind(ind).ws("static const unsigned char ").wstring(opts->yybm).ws("[] = {");

        uint32_t c = 1, n = ub - lb;
        const BitMap *cb = first;

        while((cb = cb->next) != NULL) {
            ++c;
        }
        BitMap *b = first;

        uint32_t *bm = new uint32_t[n];
        
        for (uint32_t i = 0, t = 1; b; i += n, t += 8)
        {
            memset(bm, 0, n * sizeof(uint32_t));

            for (uint32_t m = 0x80; b && m; m >>= 1)
            {
                b->i = i;
                b->m = m;
                doGen(b->go, b->on, bm, lb, m);
                b = const_cast<BitMap*>(b->next);
            }

            if (c > 8)
            {
                o.ws("\n").wind(ind+1).ws("/* table ").wu32(t).ws(" .. ").wu32(std::min(c, t+7)).ws(": ").wu32(i).ws(" */");
            }

            for (uint32_t j = 0; j < n; ++j)
            {
                if (j % 8 == 0)
                {
                    o.ws("\n").wind(ind+1);
                }

                if (opts->yybmHexTable)
                {
                    o.wu32_hex(bm[j]);
                }
                else
                {
                    o.wu32_width(bm[j], 3);
                }
                o.ws(", ");
            }
        }

        o.ws("\n").wind(ind).ws("};\n");
        
        delete[] bm;
    }
}

Here is the call graph for this function:

Here is the caller graph for this function:

Member Data Documentation

BitMap * re2c::BitMap::first = NULL

static

Definition at line 19 of file bitmap.h.

const Go* re2c::BitMap::go

Definition at line 21 of file bitmap.h.

uint32_t re2c::BitMap::i

Definition at line 24 of file bitmap.h.

uint32_t re2c::BitMap::m

Definition at line 25 of file bitmap.h.

const BitMap* re2c::BitMap::next

Definition at line 23 of file bitmap.h.

const State* re2c::BitMap::on

Definition at line 22 of file bitmap.h.

---

The documentation for this class was generated from the following files:

• codegen/bitmap.h
• codegen/bitmap.cc