void match_ctx_init(match_ctx ctx, /* IN/OUT */
struct membuf *inbuf, /* IN */
int max_offset)
{
struct match_node *np;
struct progress prog[1];
int buf_len = membuf_memlen(inbuf);
const unsigned char *buf = membuf_get(inbuf);
int c, i;
int val;
ctx->info = calloc(buf_len + 1, sizeof(*ctx->info));
ctx->rle = calloc(buf_len + 1, sizeof(*ctx->rle));
ctx->rle_r = calloc(buf_len + 1, sizeof(*ctx->rle_r));
chunkpool_init(ctx->m_pool, sizeof(match));
ctx->max_offset = max_offset;
ctx->buf = buf;
ctx->len = buf_len;
val = buf[0];
for (i = 1; i < buf_len; ++i)
{
if (buf[i] == val)
{
int len = ctx->rle[i - 1] + 1;
if(len > 65535)
{
len = 0;
}
ctx->rle[i] = len;
} else
{
ctx->rle[i] = 0;
}
val = buf[i];
}
for (i = buf_len - 2; i >= 0; --i)
{
if (ctx->rle[i] < ctx->rle[i + 1])
{
ctx->rle_r[i] = ctx->rle_r[i + 1] + 1;
} else
{
ctx->rle_r[i] = 0;
}
}
/* add extra nodes to rle sequences */
for(c = 0; c < 256; ++c)
{
static char rle_map[65536];
struct match_node *prev_np;
unsigned short int rle_len;
/* for each possible rle char */
memset(rle_map, 0, sizeof(rle_map));
prev_np = NULL;
for (i = 0; i < buf_len; ++i)
{
/* must be the correct char */
if(buf[i] != c)
{
continue;
}
rle_len = ctx->rle[i];
if(!rle_map[rle_len] && ctx->rle_r[i] > 16)
{
/* no previous lengths and not our primary length*/
continue;
}
np = chunkpool_malloc(ctx->m_pool);
np->index = i;
np->next = NULL;
rle_map[rle_len] = 1;
LOG(LOG_DUMP, ("0) c = %d, added np idx %d -> %d\n", c, i, 0));
/* if we have a previous entry, let's chain it together */
if(prev_np != NULL)
{
LOG(LOG_DUMP, ("1) c = %d, pointed np idx %d -> %d\n",
c, prev_np->index, i));
prev_np->next = np;
}
ctx->info[i]->single = np;
prev_np = np;
}
memset(rle_map, 0, sizeof(rle_map));
prev_np = NULL;
for (i = buf_len - 1; i >= 0; --i)
{
/* must be the correct char */
if(buf[i] != c)
{
continue;
}
rle_len = ctx->rle_r[i];
np = ctx->info[i]->single;
if(np == NULL)
{
if(rle_map[rle_len] && prev_np != NULL && rle_len > 0)
{
np = chunkpool_malloc(ctx->m_pool);
np->index = i;
np->next = prev_np;
ctx->info[i]->single = np;
LOG(LOG_DEBUG, ("2) c = %d, added np idx %d -> %d\n",
c, i, prev_np->index));
}
}
else
{
prev_np = np;
}
if(ctx->rle_r[i] > 0)
{
continue;
}
rle_len = ctx->rle[i] + 1;
rle_map[rle_len] = 1;
}
}
progress_init(prog, "building.directed.acyclic.graph.", buf_len - 1, 0);
for (i = buf_len - 1; i >= 0; --i)
{
const_matchp matches;
/* let's populate the cache */
matches = matches_calc(ctx, i);
/* add to cache */
ctx->info[i]->cache = matches;
progress_bump(prog, i);
}
LOG(LOG_NORMAL, ("\n"));
progress_free(prog);
}
void match_ctx_init(match_ctx ctx, /* IN/OUT */
const unsigned char *buf, /* IN */
int buf_len, /* IN */
int max_offset)
{
struct match_node *np;
struct chunkpool map_pool[1];
int c, i;
int val;
memset(ctx->info, 0, sizeof(ctx->info));
memset(ctx->rle, 0, sizeof(ctx->rle));
memset(ctx->rle_r, 0, sizeof(ctx->rle_r));
chunkpool_init(ctx->m_pool, sizeof(match));
chunkpool_init(map_pool, sizeof(match));
ctx->max_offset = max_offset;
ctx->buf = buf;
ctx->len = buf_len;
val = buf[0];
for (i = 1; i < buf_len; ++i)
{
if (buf[i] == val)
{
ctx->rle[i] = ctx->rle[i - 1] + 1;
} else
{
ctx->rle[i] = 0;
}
val = buf[i];
}
val = buf[buf_len - 1];
for (i = buf_len - 2; i >= 0; --i)
{
if (buf[i] == val)
{
ctx->rle_r[i] = ctx->rle_r[i + 1] + 1;
} else
{
ctx->rle_r[i] = 0;
}
val = buf[i];
}
/* add extra nodes to rle sequences */
for(c = 0; c < 256; ++c)
{
static char rle_map[65536];
struct match_node *prev_np;
int rle_len;
/* for each possible rle char */
memset(rle_map, 0, sizeof(rle_map));
prev_np = NULL;
for (i = 0; i < buf_len; ++i)
{
/* must be the correct char */
if(buf[i] != c)
{
continue;
}
rle_len = ctx->rle[i];
if(!rle_map[rle_len] && ctx->rle_r[i] > 16)
{
/* no previous lengths and not our primary length*/
continue;
}
np = chunkpool_malloc(ctx->m_pool);
np->index = i;
np->next = NULL;
rle_map[rle_len] = 1;
LOG(LOG_DEBUG, ("0) c = %d, added np idx %d -> %d\n", c, i, 0));
/* if we have a previous entry, let's chain it together */
if(prev_np != NULL)
{
LOG(LOG_DEBUG, ("1) c = %d, pointed np idx %d -> %d\n",
c, prev_np->index, i));
prev_np->next = np;
}
ctx->info[i]->single = np;
prev_np = np;
}
memset(rle_map, 0, sizeof(rle_map));
prev_np = NULL;
for (i = buf_len - 1; i >= 0; --i)
{
/* must be the correct char */
if(buf[i] != c)
{
continue;
}
rle_len = ctx->rle_r[i];
np = ctx->info[i]->single;
if(np == NULL)
{
if(rle_map[rle_len] && prev_np != NULL && rle_len > 0)
{
np = chunkpool_malloc(ctx->m_pool);
np->index = i;
np->next = prev_np;
ctx->info[i]->single = np;
LOG(LOG_DEBUG, ("2) c = %d, added np idx %d -> %d\n",
c, i, prev_np->index));
}
}
else
{
prev_np = np;
}
if(ctx->rle_r[i] > 0)
{
continue;
}
rle_len = ctx->rle[i] + 1;
rle_map[rle_len] = 1;
}
}
for (i = buf_len - 1; i >= 0; --i)
{
const_matchp matches;
/* let's populate the cache */
matches = matches_calc(ctx, (unsigned short) i);
/* add to cache */
ctx->info[i]->cache = matches;
if (!(i & 0xFF))
{
LOG(LOG_NORMAL, ("."));
}
}
LOG(LOG_NORMAL, ("\n"));
chunkpool_free(map_pool);
}
