lib/gen_tables.h - master - githubmirror/audit-userspace

lib/gen_tables.h
118 строк3 KB
Steve Grubb
Fix INTEGER_OVERFLOW in gen_tables64.h
01 мар 2026, 00:45
01 мар 2026, 00:4570b3576
/* gen_tables.h -- Declarations used for lookup tables.
 * Copyright 2008 Red Hat Inc.
 * All Rights Reserved.
 *
 * This library is free software; you can redistribute it and/or
 * modify it under the terms of the GNU Lesser General Public
 * License as published by the Free Software Foundation; either
 * version 2.1 of the License, or (at your option) any later version.
 *
 * This library is distributed in the hope that it will be useful,
 * but WITHOUT ANY WARRANTY; without even the implied warranty of
 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
 * Lesser General Public License for more details.
 *
 * You should have received a copy of the GNU Lesser General Public
 * License along with this library; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA  02111-1307  USA
 *
 * Authors:
 *      Miloslav Trmač <mitr@redhat.com>
 */
#ifndef GEN_TABLES_H__
#define GEN_TABLES_H__

#include <stddef.h>
#include <stdint.h>

/* Assumes ASCII; verified in gen_tables.c. */
#define GT_ISUPPER(X) ((X) >= 'A' && (X) <= 'Z')
#define GT_ISLOWER(X) ((X) >= 'a' && (X) <= 'z')

inline static int s2i__(const char *strings, const unsigned *s_table,
			const int *i_table, size_t n, const char *s, int *value)
{
	size_t lo = 0, hi = 0;

	if (n == 0)
		return 0;

	ssize_t left = 0, right = n - 1;

	while (left <= right) {	/* invariant: left <= x <= right */
		ssize_t mid;
		size_t off, i;
		const char *t;
		int r;

		mid = (left + right) / 2;
		/* Skip previously matched prefix */
		off = lo < hi ? lo : hi;
		t = strings + s_table[mid];
		i = off;
		while (s[i] && t[i] && s[i] == t[i])
			i++;
		r = (unsigned char)s[i] - (unsigned char)t[i];
		if (r == 0) {
			*value = i_table[mid];
			return 1;
		}
		if (r < 0) {
			right = mid - 1;
			hi = i;
		} else {
			left = mid + 1;
			lo = i;
		}
	}
	return 0;
}

inline static const char *i2s_direct__(const char *strings,
				       const unsigned *table, int min, int max,
				       int v)
{
	unsigned off;

	if (v < min || v > max)
		return NULL;
	off = table[v - min];
	if (off != -1u)
		return strings + off;
	return NULL;
}

inline static const char *i2s_bsearch__(const char *strings,
					const int *i_table,
					const unsigned *s_table, size_t n,
					int v)
{
	ssize_t left, right;

	if (n == 0)
		return NULL;

	left = 0;
	right = n - 1;
	while (left <= right) {	/* invariant: left <= x <= right */
		ssize_t mid;
		int mid_val;

		mid = (left + right) / 2;
		mid_val = i_table[mid];
		if (v == mid_val)
			return strings + s_table[mid];
		if (v < mid_val)
			right = mid - 1;
		else
			left = mid + 1;
	}
	return NULL;
}

struct transtab {
	int value;
	unsigned offset;
};

#endif