1/* 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1995 Wolfram Schneider <wosch@FreeBSD.org>. Berlin. 5 * Copyright (c) 1989, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * Redistribution and use in source and binary forms, with or without 9 * modification, are permitted provided that the following conditions 10 * are met: 11 * 1. Redistributions of source code must retain the above copyright 12 * notice, this list of conditions and the following disclaimer. 13 * 2. Redistributions in binary form must reproduce the above copyright 14 * notice, this list of conditions and the following disclaimer in the 15 * documentation and/or other materials provided with the distribution. 16 * 3. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33/* Symbolic constants shared by locate.c and code.c */ 34 35#define NBG 128 /* number of bigrams considered */ 36#define OFFSET 14 /* abs value of max likely diff */ 37#define PARITY 0200 /* parity bit */ 38#define SWITCH 30 /* switch code */ 39#define UMLAUT 31 /* an 8 bit char followed */ 40 41/* 0-28 likeliest differential counts + offset to make nonnegative */ 42#define LDC_MIN 0 43#define LDC_MAX 28 44 45/* 128-255 bigram codes (128 most common, as determined by 'updatedb') */ 46#define BIGRAM_MIN (UCHAR_MAX - SCHAR_MAX) 47#define BIGRAM_MAX UCHAR_MAX 48 49/* 32-127 single character (printable) ascii residue (ie, literal) */ 50#define ASCII_MIN 32 51#define ASCII_MAX SCHAR_MAX 52 53/* #define TO7BIT(x) (x = ( ((u_char)x) & SCHAR_MAX )) */ 54#define TO7BIT(x) (x = x & SCHAR_MAX ) 55 56 57#if UCHAR_MAX >= 4096 58 define TOLOWER(ch) tolower(ch) 59#else 60 61extern u_char myctype[UCHAR_MAX + 1]; 62#define TOLOWER(ch) (myctype[ch]) 63#endif 64 65#define INTSIZE (sizeof(int)) 66 67#define LOCATE_REG "*?[]\\" /* fnmatch(3) meta characters */ 68 69/* max. path length for locate. Should be at least 1024 (PATH_MAX), but can be longer */ 70#ifndef LOCATE_PATH_MAX 71#define LOCATE_PATH_MAX (1*1024) 72#endif 73 74