240 lines
4.3 KiB
C
240 lines
4.3 KiB
C
/*
|
|
* $Id: tab.c,v 1.19 2006-09-28 06:56:30 bacon Exp $
|
|
*/
|
|
|
|
#include <xp/awk/awk_i.h>
|
|
|
|
xp_awk_tab_t* xp_awk_tab_open (xp_awk_tab_t* tab, xp_awk_t* awk)
|
|
{
|
|
if (tab == XP_NULL)
|
|
{
|
|
tab = (xp_awk_tab_t*) XP_AWK_MALLOC (
|
|
awk, xp_sizeof(xp_awk_tab_t));
|
|
if (tab == XP_NULL) return XP_NULL;
|
|
tab->__dynamic = xp_true;
|
|
}
|
|
else tab->__dynamic = xp_false;
|
|
|
|
tab->awk = awk;
|
|
tab->buf = XP_NULL;
|
|
tab->size = 0;
|
|
tab->capa = 0;
|
|
|
|
return tab;
|
|
}
|
|
|
|
void xp_awk_tab_close (xp_awk_tab_t* tab)
|
|
{
|
|
xp_awk_tab_clear (tab);
|
|
if (tab->buf != XP_NULL)
|
|
{
|
|
XP_AWK_FREE (tab->awk, tab->buf);
|
|
tab->buf = XP_NULL;
|
|
tab->capa = 0;
|
|
}
|
|
|
|
if (tab->__dynamic) XP_AWK_FREE (tab->awk, tab);
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_getsize (xp_awk_tab_t* tab)
|
|
{
|
|
return tab->size;
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_getcapa (xp_awk_tab_t* tab)
|
|
{
|
|
return tab->capa;
|
|
}
|
|
|
|
xp_awk_tab_t* xp_awk_tab_setcapa (xp_awk_tab_t* tab, xp_size_t capa)
|
|
{
|
|
void* tmp;
|
|
|
|
if (tab->size > capa)
|
|
{
|
|
xp_awk_tab_remove (tab, capa, tab->size - capa);
|
|
xp_assert (tab->size <= capa);
|
|
}
|
|
|
|
if (capa > 0)
|
|
{
|
|
if (tab->awk->syscas->realloc != XP_NULL)
|
|
{
|
|
tmp = XP_AWK_REALLOC (tab->awk,
|
|
tab->buf, xp_sizeof(*tab->buf) * capa);
|
|
if (tmp == XP_NULL) return XP_NULL;
|
|
}
|
|
else
|
|
{
|
|
tmp = XP_AWK_MALLOC (
|
|
tab->awk, xp_sizeof(*tab->buf) * capa);
|
|
if (tmp == XP_NULL) return XP_NULL;
|
|
if (tab->buf != XP_NULL)
|
|
{
|
|
xp_size_t x;
|
|
x = (capa > tab->capa)? tab->capa: capa;
|
|
XP_AWK_MEMCPY (
|
|
tab->awk, tmp, tab->buf,
|
|
xp_sizeof(*tab->buf) * x);
|
|
XP_AWK_FREE (tab->awk, tab->buf);
|
|
}
|
|
}
|
|
}
|
|
else
|
|
{
|
|
if (tab->buf != XP_NULL) XP_AWK_FREE (tab->awk, tab->buf);
|
|
tmp = XP_NULL;
|
|
}
|
|
|
|
tab->buf = tmp;
|
|
tab->capa = capa;
|
|
|
|
return tab;
|
|
}
|
|
|
|
void xp_awk_tab_clear (xp_awk_tab_t* tab)
|
|
{
|
|
xp_size_t i;
|
|
|
|
xp_assert (tab != XP_NULL);
|
|
|
|
for (i = 0; i < tab->size; i++)
|
|
{
|
|
XP_AWK_FREE (tab->awk, tab->buf[i].name);
|
|
tab->buf[i].name = XP_NULL;
|
|
tab->buf[i].name_len = 0;
|
|
}
|
|
|
|
tab->size = 0;
|
|
}
|
|
|
|
|
|
xp_size_t xp_awk_tab_insert (
|
|
xp_awk_tab_t* tab, xp_size_t index,
|
|
const xp_char_t* str, xp_size_t len)
|
|
{
|
|
xp_size_t i;
|
|
xp_char_t* str_dup;
|
|
|
|
str_dup = xp_awk_strxdup (tab->awk, str, len);
|
|
if (str_dup == XP_NULL) return (xp_size_t)-1;
|
|
|
|
if (index >= tab->capa)
|
|
{
|
|
xp_size_t capa;
|
|
|
|
if (tab->capa <= 0) capa = (index + 1);
|
|
else
|
|
{
|
|
do { capa = tab->capa * 2; } while (index >= capa);
|
|
}
|
|
|
|
if (xp_awk_tab_setcapa(tab,capa) == XP_NULL)
|
|
{
|
|
XP_AWK_FREE (tab->awk, str_dup);
|
|
return (xp_size_t)-1;
|
|
}
|
|
}
|
|
|
|
for (i = tab->size; i > index; i--) tab->buf[i] = tab->buf[i-1];
|
|
tab->buf[index].name = str_dup;
|
|
tab->buf[index].name_len = len;
|
|
|
|
if (index > tab->size) tab->size = index + 1;
|
|
else tab->size++;
|
|
|
|
return index;
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_remove (
|
|
xp_awk_tab_t* tab, xp_size_t index, xp_size_t count)
|
|
{
|
|
xp_size_t i, j, k;
|
|
|
|
if (index >= tab->size) return 0;
|
|
if (count > tab->size - index) count = tab->size - index;
|
|
|
|
i = index;
|
|
j = index + count;
|
|
k = index + count;
|
|
|
|
while (i < k)
|
|
{
|
|
XP_AWK_FREE (tab->awk, tab->buf[i].name);
|
|
|
|
if (j >= tab->size)
|
|
{
|
|
tab->buf[i].name = XP_NULL;
|
|
tab->buf[i].name_len = 0;
|
|
i++;
|
|
}
|
|
else
|
|
{
|
|
tab->buf[i].name = tab->buf[j].name;
|
|
tab->buf[i].name_len = tab->buf[j].name_len;
|
|
i++; j++;
|
|
}
|
|
}
|
|
|
|
tab->size -= count;
|
|
return count;
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_add (
|
|
xp_awk_tab_t* tab, const xp_char_t* str, xp_size_t len)
|
|
{
|
|
return xp_awk_tab_insert (tab, tab->size, str, len);
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_find (
|
|
xp_awk_tab_t* tab, xp_size_t index,
|
|
const xp_char_t* str, xp_size_t len)
|
|
{
|
|
xp_size_t i;
|
|
|
|
for (i = index; i < tab->size; i++)
|
|
{
|
|
if (xp_awk_strxncmp (
|
|
tab->buf[i].name, tab->buf[i].name_len,
|
|
str, len) == 0) return i;
|
|
}
|
|
|
|
return (xp_size_t)-1;
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_rfind (
|
|
xp_awk_tab_t* tab, xp_size_t index,
|
|
const xp_char_t* str, xp_size_t len)
|
|
{
|
|
xp_size_t i;
|
|
|
|
if (index >= tab->size) return (xp_size_t)-1;
|
|
|
|
for (i = index + 1; i-- > 0; )
|
|
{
|
|
if (xp_awk_strxncmp (
|
|
tab->buf[i].name, tab->buf[i].name_len,
|
|
str, len) == 0) return i;
|
|
}
|
|
|
|
return (xp_size_t)-1;
|
|
}
|
|
|
|
xp_size_t xp_awk_tab_rrfind (
|
|
xp_awk_tab_t* tab, xp_size_t index,
|
|
const xp_char_t* str, xp_size_t len)
|
|
{
|
|
xp_size_t i;
|
|
|
|
if (index >= tab->size) return (xp_size_t)-1;
|
|
|
|
for (i = tab->size - index; i-- > 0; )
|
|
{
|
|
if (xp_awk_strxncmp (
|
|
tab->buf[i].name, tab->buf[i].name_len,
|
|
str, len) == 0) return i;
|
|
}
|
|
|
|
return (xp_size_t)-1;
|
|
}
|