re2c::Linear Struct Reference

#include <go.h>

Public Member Functions
	Linear (const Span *s, uint32_t n, const State *next)
	~Linear ()
void	emit (OutputFile &o, uint32_t ind, bool &readCh)
void	used_labels (std::set< label_t > &used)

Public Attributes
std::vector< std::pair< const Cond *, const State * > >	branches

Detailed Description

Definition at line 75 of file go.h.

Constructor & Destructor Documentation

re2c::Linear::Linear	(	const Span *	s,
		uint32_t	n,
		const State *	next
	)

Definition at line 63 of file go_construct.cc.

    : branches ()
{
    for (;;)
    {
        const State *bg = s[0].to;
        while (n >= 3 && s[2].to == bg && (s[1].ub - s[0].ub) == 1)
        {
            if (s[1].to == next && n == 3)
            {
                branches.push_back (std::make_pair (new Cond ("!=", s[0].ub), bg));
                return ;
            }
            else
            {
                branches.push_back (std::make_pair (new Cond ("==", s[0].ub), s[1].to));
            }
            n -= 2;
            s += 2;
        }
        if (n == 1)
        {
            if (next == NULL || s[0].to != next)
            {
                branches.push_back (std::make_pair (static_cast<const Cond *> (NULL), s[0].to));
            }
            return;
        }
        else if (n == 2 && bg == next)
        {
            branches.push_back (std::make_pair (new Cond (">=", s[0].ub), s[1].to));
            return;
        }
        else
        {
            branches.push_back (std::make_pair (new Cond ("<=", s[0].ub - 1), bg));
            n -= 1;
            s += 1;
        }
    }
}

re2c::Linear::~Linear

(

)

Definition at line 22 of file go_destruct.cc.

{
    for (uint32_t i = 0; i < branches.size (); ++i)
    {
        delete branches[i].first;
    }
}

Member Function Documentation

void re2c::Linear::emit	(	OutputFile &	o,
		uint32_t	ind,
		bool &	readCh
	)

Definition at line 119 of file go_emit.cc.

{
    for (uint32_t i = 0; i < branches.size (); ++i)
    {
        if (branches[i].first != NULL)
        {
            output_if (o, ind, readCh, branches[i].first->compare, branches[i].first->value);
            output_goto (o, 0, readCh, branches[i].second->label);
        }
        else
        {
            output_goto (o, ind, readCh, branches[i].second->label);
        }
    }
}

Here is the call graph for this function:

void re2c::Linear::used_labels

(

std::set< label_t > &

used

)

Definition at line 28 of file go_used_labels.cc.

{
    for (uint32_t i = 0; i < branches.size (); ++i)
    {
        used.insert (branches[i].second->label);
    }
}

Member Data Documentation

std::vector<std::pair<const Cond *, const State *> > re2c::Linear::branches

Definition at line 77 of file go.h.

---

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

• codegen/go.h
• codegen/go_construct.cc
• codegen/go_destruct.cc
• codegen/go_emit.cc
• codegen/go_used_labels.cc