2 * SPDX-License-Identifier: BSD-4-Clause
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.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
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. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
36 * @(#)locate.h 8.1 (Berkeley) 6/6/93
40 /* Symbolic constants shared by locate.c and code.c */
42 #define NBG 128 /* number of bigrams considered */
43 #define OFFSET 14 /* abs value of max likely diff */
44 #define PARITY 0200 /* parity bit */
45 #define SWITCH 30 /* switch code */
46 #define UMLAUT 31 /* an 8 bit char followed */
48 /* 0-28 likeliest differential counts + offset to make nonnegative */
52 /* 128-255 bigram codes (128 most common, as determined by 'updatedb') */
53 #define BIGRAM_MIN (UCHAR_MAX - SCHAR_MAX)
54 #define BIGRAM_MAX UCHAR_MAX
56 /* 32-127 single character (printable) ascii residue (ie, literal) */
58 #define ASCII_MAX SCHAR_MAX
60 /* #define TO7BIT(x) (x = ( ((u_char)x) & SCHAR_MAX )) */
61 #define TO7BIT(x) (x = x & SCHAR_MAX )
65 define TOLOWER(ch) tolower(ch)
68 u_char myctype[UCHAR_MAX + 1];
69 #define TOLOWER(ch) (myctype[ch])
72 #define INTSIZE (sizeof(int))
74 #define LOCATE_REG "*?[]\\" /* fnmatch(3) meta characters */