regexport.c File Reference

#include "regex/regguts.h"
#include "regex/regexport.h"

Include dependency graph for regexport.c:

Go to the source code of this file.

Functions
int	pg_reg_getnumstates (const regex_t *regex)
int	pg_reg_getinitialstate (const regex_t *regex)
int	pg_reg_getfinalstate (const regex_t *regex)
static void	traverse_lacons (struct cnfa *cnfa, int st, int *arcs_count, regex_arc_t *arcs, int arcs_len)
int	pg_reg_getnumoutarcs (const regex_t *regex, int st)
void	pg_reg_getoutarcs (const regex_t *regex, int st, regex_arc_t *arcs, int arcs_len)
int	pg_reg_getnumcolors (const regex_t *regex)
int	pg_reg_colorisbegin (const regex_t *regex, int co)
int	pg_reg_colorisend (const regex_t *regex, int co)
int	pg_reg_getnumcharacters (const regex_t *regex, int co)
void	pg_reg_getcharacters (const regex_t *regex, int co, pg_wchar *chars, int chars_len)

Function Documentation

pg_reg_colorisbegin()

int pg_reg_colorisbegin	(	const regex_t *	regex,
		int	co
	)

Definition at line 191 of file regexport.c.

{
    struct cnfa *cnfa;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    if (co == cnfa->bos[0] || co == cnfa->bos[1])
        return true;
    else
        return false;
}

References assert, cnfa::bos, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by addKey().

pg_reg_colorisend()

int pg_reg_colorisend	(	const regex_t *	regex,
		int	co
	)

Definition at line 208 of file regexport.c.

{
    struct cnfa *cnfa;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    if (co == cnfa->eos[0] || co == cnfa->eos[1])
        return true;
    else
        return false;
}

References assert, cnfa::eos, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by addKey().

pg_reg_getcharacters()

void pg_reg_getcharacters	(	const regex_t *	regex,
		int	co,
		pg_wchar *	chars,
		int	chars_len
	)

Definition at line 266 of file regexport.c.

{
    struct colormap *cm;
    chr         c;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cm = &((struct guts *) regex->re_guts)->cmap;
 
    if (co <= 0 || co > cm->max || chars_len <= 0)
        return;
    if (cm->cd[co].flags & PSEUDO)
        return;
 
    /*
     * We need only examine the low character map; there should not be any
     * matching entries in the high map.
     */
    for (c = CHR_MIN; c <= MAX_SIMPLE_CHR; c++)
    {
        if (cm->locolormap[c - CHR_MIN] == co)
        {
            *chars++ = c;
            if (--chars_len == 0)
                break;
        }
    }
}

References assert, colormap::cd, chars, CHR_MIN, colordesc::flags, colormap::locolormap, colormap::max, MAX_SIMPLE_CHR, PSEUDO, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by getColorInfo().

pg_reg_getfinalstate()

int pg_reg_getfinalstate

(

const regex_t *

regex

)

Definition at line 64 of file regexport.c.

{
    struct cnfa *cnfa;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    return cnfa->post;
}

References assert, cnfa::post, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by addKey().

pg_reg_getinitialstate()

int pg_reg_getinitialstate

(

const regex_t *

regex

)

Definition at line 50 of file regexport.c.

{
    struct cnfa *cnfa;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    return cnfa->pre;
}

References assert, cnfa::pre, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by transformGraph().

pg_reg_getnumcharacters()

int pg_reg_getnumcharacters	(	const regex_t *	regex,
		int	co
	)

Definition at line 230 of file regexport.c.

{
    struct colormap *cm;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cm = &((struct guts *) regex->re_guts)->cmap;
 
    if (co <= 0 || co > cm->max)    /* <= 0 rejects WHITE and RAINBOW */
        return -1;
    if (cm->cd[co].flags & PSEUDO)  /* also pseudocolors (BOS etc) */
        return -1;
 
    /*
     * If the color appears anywhere in the high colormap, treat its number of
     * members as uncertain.  In principle we could determine all the specific
     * chrs corresponding to each such entry, but it would be expensive
     * (particularly if character class tests are required) and it doesn't
     * seem worth it.
     */
    if (cm->cd[co].nuchrs != 0)
        return -1;
 
    /* OK, return the known number of member chrs */
    return cm->cd[co].nschrs;
}

References assert, colormap::cd, colordesc::flags, colormap::max, colordesc::nschrs, colordesc::nuchrs, PSEUDO, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by getColorInfo().

pg_reg_getnumcolors()

int pg_reg_getnumcolors

(

const regex_t *

regex

)

Definition at line 174 of file regexport.c.

{
    struct colormap *cm;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cm = &((struct guts *) regex->re_guts)->cmap;
 
    return cm->max + 1;
}

References assert, colormap::max, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

Referenced by getColorInfo().

pg_reg_getnumoutarcs()

int pg_reg_getnumoutarcs	(	const regex_t *	regex,
		int	st
	)

Definition at line 134 of file regexport.c.

{
    struct cnfa *cnfa;
    int         arcs_count;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    if (st < 0 || st >= cnfa->nstates)
        return 0;
    arcs_count = 0;
    traverse_lacons(cnfa, st, &arcs_count, NULL, 0);
    return arcs_count;
}

References assert, cnfa::nstates, regex_t::re_guts, regex_t::re_magic, REMAGIC, and traverse_lacons().

Referenced by addArcs(), and addKey().

pg_reg_getnumstates()

int pg_reg_getnumstates

(

const regex_t *

regex

)

Definition at line 36 of file regexport.c.

{
    struct cnfa *cnfa;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    return cnfa->nstates;
}

References assert, cnfa::nstates, regex_t::re_guts, regex_t::re_magic, and REMAGIC.

pg_reg_getoutarcs()

void pg_reg_getoutarcs	(	const regex_t *	regex,
		int	st,
		regex_arc_t *	arcs,
		int	arcs_len
	)

Definition at line 155 of file regexport.c.

{
    struct cnfa *cnfa;
    int         arcs_count;
 
    assert(regex != NULL && regex->re_magic == REMAGIC);
    cnfa = &((struct guts *) regex->re_guts)->search;
 
    if (st < 0 || st >= cnfa->nstates || arcs_len <= 0)
        return;
    arcs_count = 0;
    traverse_lacons(cnfa, st, &arcs_count, arcs, arcs_len);
}

References assert, cnfa::nstates, regex_t::re_guts, regex_t::re_magic, REMAGIC, and traverse_lacons().

Referenced by addArcs(), and addKey().

traverse_lacons()

static void traverse_lacons ( struct cnfa *  cnfa, int  st, int *  arcs_count, regex_arc_t *  arcs, int  arcs_len  )

static

Definition at line 93 of file regexport.c.

{
    struct carc *ca;
 
    /*
     * Since this function recurses, it could theoretically be driven to stack
     * overflow.  In practice, this is mostly useful to backstop against a
     * failure of the regex compiler to remove a loop of LACON arcs.
     */
    check_stack_depth();
 
    for (ca = cnfa->states[st]; ca->co != COLORLESS; ca++)
    {
        if (ca->co < cnfa->ncolors)
        {
            /* Ordinary arc, so count and possibly emit it */
            int         ndx = (*arcs_count)++;
 
            if (ndx < arcs_len)
            {
                arcs[ndx].co = ca->co;
                arcs[ndx].to = ca->to;
            }
        }
        else
        {
            /* LACON arc --- assume it's satisfied and recurse... */
            /* ... but first, assert it doesn't lead directly to post state */
            Assert(ca->to != cnfa->post);
 
            traverse_lacons(cnfa, ca->to, arcs_count, arcs, arcs_len);
        }
    }
}

References Assert, check_stack_depth(), regex_arc_t::co, carc::co, COLORLESS, cnfa::ncolors, cnfa::post, cnfa::states, regex_arc_t::to, and carc::to.

Referenced by pg_reg_getnumoutarcs(), and pg_reg_getoutarcs().