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 * This code is derived from software contributed to Berkeley by 9 * James A. Woods. 10 * 11 * Redistribution and use in source and binary forms, with or without 12 * modification, are permitted provided that the following conditions 13 * are met: 14 * 1. Redistributions of source code must retain the above copyright 15 * notice, this list of conditions and the following disclaimer. 16 * 2. Redistributions in binary form must reproduce the above copyright 17 * notice, this list of conditions and the following disclaimer in the 18 * documentation and/or other materials provided with the distribution. 19 * 3. Neither the name of the University nor the names of its contributors 20 * may be used to endorse or promote products derived from this software 21 * without specific prior written permission. 22 * 23 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 24 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 25 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 26 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 27 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 28 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 29 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 30 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 31 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 32 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 33 * SUCH DAMAGE. 34 * 35 * $FreeBSD$ 36 */ 37 38 #if 0 39 #ifndef lint 40 static char copyright[] = 41 "@(#) Copyright (c) 1989, 1993\n\ 42 The Regents of the University of California. All rights reserved.\n"; 43 #endif /* not lint */ 44 45 #ifndef lint 46 static char sccsid[] = "@(#)locate.bigram.c 8.1 (Berkeley) 6/6/93"; 47 #endif /* not lint */ 48 #endif 49 50 /* 51 * bigram < sorted_file_names | sort -nr | 52 * awk 'NR <= 128 { printf $2 }' > bigrams 53 * 54 * List bigrams for 'updatedb' script. 55 * Use 'code' to encode a file using this output. 56 */ 57 58 #include <capsicum_helpers.h> 59 #include <err.h> 60 #include <stdio.h> 61 #include <stdlib.h> 62 #include <sys/param.h> /* for MAXPATHLEN */ 63 #include "locate.h" 64 65 u_char buf1[MAXPATHLEN] = " "; 66 u_char buf2[MAXPATHLEN]; 67 u_int bigram[UCHAR_MAX + 1][UCHAR_MAX + 1]; 68 69 int 70 main(void) 71 { 72 u_char *cp; 73 u_char *oldpath = buf1, *path = buf2; 74 u_int i, j; 75 76 if (caph_limit_stdio() < 0 || caph_enter() < 0) 77 err(1, "capsicum"); 78 79 while (fgets(path, sizeof(buf2), stdin) != NULL) { 80 81 /* 82 * We don't need remove newline character '\n'. 83 * '\n' is less than ASCII_MIN and will be later 84 * ignored at output. 85 */ 86 87 88 /* skip longest common prefix */ 89 for (cp = path; *cp == *oldpath; cp++, oldpath++) 90 if (*cp == '\0') 91 break; 92 93 while (*cp != '\0' && *(cp + 1) != '\0') { 94 bigram[(u_char)*cp][(u_char)*(cp + 1)]++; 95 cp += 2; 96 } 97 98 /* swap pointers */ 99 if (path == buf1) { 100 path = buf2; 101 oldpath = buf1; 102 } else { 103 path = buf1; 104 oldpath = buf2; 105 } 106 } 107 108 /* output, boundary check */ 109 for (i = ASCII_MIN; i <= ASCII_MAX; i++) 110 for (j = ASCII_MIN; j <= ASCII_MAX; j++) 111 if (bigram[i][j] != 0) 112 (void)printf("%4u %c%c\n", bigram[i][j], i, j); 113 114 exit(0); 115 } 116