regcache.c revision 3e14f97f673e8a630f076077de35afdd43dc1587
/***********************************************************************
* *
* This software is part of the ast package *
* Copyright (c) 1985-2010 AT&T Intellectual Property *
* and is licensed under the *
* Common Public License, Version 1.0 *
* by AT&T Intellectual Property *
* *
* A copy of the License is available at *
* (with md5 checksum 059e8cd6165cb4c31e351f2b69388fd9) *
* *
* Information and Software Systems Research *
* AT&T Research *
* Florham Park NJ *
* *
* Glenn Fowler <gsf@research.att.com> *
* David Korn <dgk@research.att.com> *
* Phong Vo <kpv@research.att.com> *
* *
***********************************************************************/
#pragma prototyped
/*
* regcomp() regex_t cache
* at&t research
*/
#include <ast.h>
#include <regex.h>
typedef unsigned long Key_t;
typedef struct Cache_s
{
char* pattern;
unsigned long serial;
int keep;
int size;
} Cache_t;
typedef struct State_s
{
unsigned int size;
unsigned long serial;
char* locale;
} State_t;
static State_t matchstate;
/*
* flush the cache
*/
static void
flushcache(void)
{
register int i;
for (i = matchstate.size; i--;)
{
}
}
/*
* return regcomp() compiled re for pattern and reflags
*/
{
register int i;
char* s;
int empty;
int unused;
int old;
/*
* 0 pattern flushes the cache and reflags>0 extends cache
*/
if (!pattern)
{
flushcache();
i = 0;
{
else
{
matchstate.size = 0;
i = 1;
}
}
if (status)
*status = i;
return 0;
}
if (!matchstate.cache)
{
return 0;
}
/*
* flush the cache if the locale changed
* the ast setlocale() intercept maintains
* persistent setlocale() return values
*/
{
matchstate.locale = s;
flushcache();
}
/*
* check if the pattern is in the cache
*/
for (; i < sizeof(key); i++)
((char*)&key)[i] = 0;
old = 0;
for (i = matchstate.size; i--;)
if (!matchstate.cache[i])
empty = i;
unused = i;
else if (*(Key_t*)matchstate.cache[i]->pattern == key && !strcmp(matchstate.cache[i]->pattern, pattern) && matchstate.cache[i]->reflags == reflags)
break;
old = i;
if (i < 0)
{
if (unused < 0)
{
if (empty < 0)
else
}
{
if (status)
*status = REG_ESPACE;
return 0;
}
{
}
{
{
if (status)
*status = REG_ESPACE;
return 0;
}
}
while (++i < sizeof(Key_t))
{
if (status)
*status = i;
return 0;
}
}
else
if (status)
*status = 0;
}