postgresql/contrib/tsearch2/snowball/utilities.c

#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "header.h"

#define unless(C) if(!(C))

#define CREATE_SIZE 1

symbol *
create_s(void)
{
	symbol	   *p = (symbol *) (HEAD + (char *) malloc(HEAD + (CREATE_SIZE + 1) * sizeof(symbol)));

	if (p == (symbol *) (HEAD))
		return NULL;
	CAPACITY(p) = CREATE_SIZE;
	SET_SIZE(p, CREATE_SIZE);
	return p;
}

void
lose_s(symbol * p)
{
	free((char *) p - HEAD);
}

int
in_grouping(struct SN_env * z, unsigned char *s, int min, int max)
{
	if (z->c >= z->l)
		return 0;
	{
		int			ch = z->p[z->c];

		if
			(ch > max || (ch -= min) < 0 ||
			 (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0)
			return 0;
	}
	z->c++;
	return 1;
}

int
in_grouping_b(struct SN_env * z, unsigned char *s, int min, int max)
{
	if (z->c <= z->lb)
		return 0;
	{
		int			ch = z->p[z->c - 1];

		if
			(ch > max || (ch -= min) < 0 ||
			 (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0)
			return 0;
	}
	z->c--;
	return 1;
}

int
out_grouping(struct SN_env * z, unsigned char *s, int min, int max)
{
	if (z->c >= z->l)
		return 0;
	{
		int			ch = z->p[z->c];

		unless
			(ch > max || (ch -= min) < 0 ||
			 (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
	}
	z->c++;
	return 1;
}

int
out_grouping_b(struct SN_env * z, unsigned char *s, int min, int max)
{
	if (z->c <= z->lb)
		return 0;
	{
		int			ch = z->p[z->c - 1];

		unless
			(ch > max || (ch -= min) < 0 ||
			 (s[ch >> 3] & (0X1 << (ch & 0X7))) == 0) return 0;
	}
	z->c--;
	return 1;
}


int
in_range(struct SN_env * z, int min, int max)
{
	if (z->c >= z->l)
		return 0;
	{
		int			ch = z->p[z->c];

		if
			(ch > max || ch < min)
			return 0;
	}
	z->c++;
	return 1;
}

int
in_range_b(struct SN_env * z, int min, int max)
{
	if (z->c <= z->lb)
		return 0;
	{
		int			ch = z->p[z->c - 1];

		if
			(ch > max || ch < min)
			return 0;
	}
	z->c--;
	return 1;
}

int
out_range(struct SN_env * z, int min, int max)
{
	if (z->c >= z->l)
		return 0;
	{
		int			ch = z->p[z->c];

		unless
			(ch > max || ch < min) return 0;
	}
	z->c++;
	return 1;
}

int
out_range_b(struct SN_env * z, int min, int max)
{
	if (z->c <= z->lb)
		return 0;
	{
		int			ch = z->p[z->c - 1];

		unless
			(ch > max || ch < min) return 0;
	}
	z->c--;
	return 1;
}

int
eq_s(struct SN_env * z, int s_size, symbol * s)
{
	if (z->l - z->c < s_size ||
		memcmp(z->p + z->c, s, s_size * sizeof(symbol)) != 0)
		return 0;
	z->c += s_size;
	return 1;
}

int
eq_s_b(struct SN_env * z, int s_size, symbol * s)
{
	if (z->c - z->lb < s_size ||
		memcmp(z->p + z->c - s_size, s, s_size * sizeof(symbol)) != 0)
		return 0;
	z->c -= s_size;
	return 1;
}

int
eq_v(struct SN_env * z, symbol * p)
{
	return eq_s(z, SIZE(p), p);
}

int
eq_v_b(struct SN_env * z, symbol * p)
{
	return eq_s_b(z, SIZE(p), p);
}

int
find_among(struct SN_env * z, struct among * v, int v_size)
{
	int			i = 0;
	int			j = v_size;

	int			c = z->c;
	int			l = z->l;
	symbol	   *q = z->p + c;

	struct among *w;

	int			common_i = 0;
	int			common_j = 0;

	int			first_key_inspected = 0;

	while (1)
	{
		int			k = i + ((j - i) >> 1);
		int			diff = 0;
		int			common = common_i < common_j ? common_i : common_j; /* smaller */

		w = v + k;
		{
			int			i;

			for (i = common; i < w->s_size; i++)
			{
				if (c + common == l)
				{
					diff = -1;
					break;
				}
				diff = q[common] - w->s[i];
				if (diff != 0)
					break;
				common++;
			}
		}
		if (diff < 0)
		{
			j = k;
			common_j = common;
		}
		else
		{
			i = k;
			common_i = common;
		}
		if (j - i <= 1)
		{
			if (i > 0)
				break;			/* v->s has been inspected */
			if (j == i)
				break;			/* only one item in v */

			/*
			 * - but now we need to go round once more to get v->s
			 * inspected. This looks messy, but is actually the optimal
			 * approach.
			 */

			if (first_key_inspected)
				break;
			first_key_inspected = 1;
		}
	}
	while (1)
	{
		w = v + i;
		if (common_i >= w->s_size)
		{
			z->c = c + w->s_size;
			if (w->function == 0)
				return w->result;
			{
				int			res = w->function(z);

				z->c = c + w->s_size;
				if (res)
					return w->result;
			}
		}
		i = w->substring_i;
		if (i < 0)
			return 0;
	}
}

/* find_among_b is for backwards processing. Same comments apply */

int
find_among_b(struct SN_env * z, struct among * v, int v_size)
{
	int			i = 0;
	int			j = v_size;

	int			c = z->c;
	int			lb = z->lb;
	symbol	   *q = z->p + c - 1;

	struct among *w;

	int			common_i = 0;
	int			common_j = 0;

	int			first_key_inspected = 0;

	while (1)
	{
		int			k = i + ((j - i) >> 1);
		int			diff = 0;
		int			common = common_i < common_j ? common_i : common_j;

		w = v + k;
		{
			int			i;

			for (i = w->s_size - 1 - common; i >= 0; i--)
			{
				if (c - common == lb)
				{
					diff = -1;
					break;
				}
				diff = q[-common] - w->s[i];
				if (diff != 0)
					break;
				common++;
			}
		}
		if (diff < 0)
		{
			j = k;
			common_j = common;
		}
		else
		{
			i = k;
			common_i = common;
		}
		if (j - i <= 1)
		{
			if (i > 0)
				break;
			if (j == i)
				break;
			if (first_key_inspected)
				break;
			first_key_inspected = 1;
		}
	}
	while (1)
	{
		w = v + i;
		if (common_i >= w->s_size)
		{
			z->c = c - w->s_size;
			if (w->function == 0)
				return w->result;
			{
				int			res = w->function(z);

				z->c = c - w->s_size;
				if (res)
					return w->result;
			}
		}
		i = w->substring_i;
		if (i < 0)
			return 0;
	}
}


symbol *
increase_size(symbol * p, int n)
{
	int			new_size = n + 20;
	symbol	   *q = (symbol *) (HEAD + (char *) malloc(HEAD + (new_size + 1) * sizeof(symbol)));

	CAPACITY(q) = new_size;
	memmove(q, p, CAPACITY(p) * sizeof(symbol));
	lose_s(p);
	return q;
}

/* to replace symbols between c_bra and c_ket in z->p by the
   s_size symbols at s
*/

int
replace_s(struct SN_env * z, int c_bra, int c_ket, int s_size, const symbol * s)
{
	int			adjustment = s_size - (c_ket - c_bra);
	int			len = SIZE(z->p);

	if (adjustment != 0)
	{
		if (adjustment + len > CAPACITY(z->p))
			z->p = increase_size(z->p, adjustment + len);
		memmove(z->p + c_ket + adjustment, z->p + c_ket, (len - c_ket) * sizeof(symbol));
		SET_SIZE(z->p, adjustment + len);
		z->l += adjustment;
		if (z->c >= c_ket)
			z->c += adjustment;
		else if (z->c > c_bra)
			z->c = c_bra;
	}
	unless(s_size == 0) memmove(z->p + c_bra, s, s_size * sizeof(symbol));
	return adjustment;
}

static void
slice_check(struct SN_env * z)
{
	if (!(0 <= z->bra &&
		  z->bra <= z->ket &&
		  z->ket <= z->l &&
		  z->l <= SIZE(z->p)))	/* this line could be removed */
	{
		fprintf(stderr, "faulty slice operation:\n");
		debug(z, -1, 0);
		exit(1);
	}
}

void
slice_from_s(struct SN_env * z, int s_size, symbol * s)
{
	slice_check(z);
	replace_s(z, z->bra, z->ket, s_size, s);
}

void
slice_from_v(struct SN_env * z, symbol * p)
{
	slice_from_s(z, SIZE(p), p);
}

void
slice_del(struct SN_env * z)
{
	slice_from_s(z, 0, NULL);
}

void
insert_s(struct SN_env * z, int bra, int ket, int s_size, symbol * s)
{
	int			adjustment = replace_s(z, bra, ket, s_size, s);

	if (bra <= z->bra)
		z->bra += adjustment;
	if (bra <= z->ket)
		z->ket += adjustment;
}

void
insert_v(struct SN_env * z, int bra, int ket, symbol * p)
{
	int			adjustment = replace_s(z, bra, ket, SIZE(p), p);

	if (bra <= z->bra)
		z->bra += adjustment;
	if (bra <= z->ket)
		z->ket += adjustment;
}

symbol *
slice_to(struct SN_env * z, symbol * p)
{
	slice_check(z);
	{
		int			len = z->ket - z->bra;

		if (CAPACITY(p) < len)
			p = increase_size(p, len);
		memmove(p, z->p + z->bra, len * sizeof(symbol));
		SET_SIZE(p, len);
	}
	return p;
}

symbol *
assign_to(struct SN_env * z, symbol * p)
{
	int			len = z->l;

	if (CAPACITY(p) < len)
		p = increase_size(p, len);
	memmove(p, z->p, len * sizeof(symbol));
	SET_SIZE(p, len);
	return p;
}

void
debug(struct SN_env * z, int number, int line_count)
{
	int			i;
	int			limit = SIZE(z->p);

	/* if (number >= 0) printf("%3d (line %4d): '", number, line_count); */
	if (number >= 0)
		printf("%3d (line %4d): [%d]'", number, line_count, limit);
	for (i = 0; i <= limit; i++)
	{
		if (z->lb == i)
			printf("{");
		if (z->bra == i)
			printf("[");
		if (z->c == i)
			printf("|");
		if (z->ket == i)
			printf("]");
		if (z->l == i)
			printf("}");
		if (i < limit)
		{
			int			ch = z->p[i];

			if (ch == 0)
				ch = '#';
			printf("%c", ch);
		}
	}
	printf("'\n");
}