1 /*
2 * SPDX-License-Identifier: BSD-3-Clause
3 *
4 * Copyright (c) 1995-2022 Wolfram Schneider <[email protected]>
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 * locate.bigram - list bigrams for /usr/libexec/locate.mklocatedb script
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 #include <capsicum_helpers.h>
52 #include <err.h>
53 #include <stdio.h>
54 #include <stdlib.h>
55 #include "locate.h"
56
57 u_char buf1[LOCATE_PATH_MAX] = " ";
58 u_char buf2[LOCATE_PATH_MAX];
59 unsigned long bigram[UCHAR_MAX + 1][UCHAR_MAX + 1];
60
61 int
main(void)62 main(void)
63 {
64 u_char *cp;
65 u_char *oldpath = buf1, *path = buf2;
66 u_int i, j;
67
68 if (caph_limit_stdio() < 0 || caph_enter() < 0)
69 err(1, "capsicum");
70
71 while (fgets(path, sizeof(buf2), stdin) != NULL) {
72
73 /*
74 * We don't need remove newline character '\n'.
75 * '\n' is less than ASCII_MIN and will be later
76 * ignored at output.
77 */
78
79
80 /* skip longest common prefix */
81 for (cp = path; *cp == *oldpath; cp++, oldpath++)
82 if (*cp == '\0')
83 break;
84
85 while (*cp != '\0' && *(cp + 1) != '\0') {
86 bigram[(u_char)*cp][(u_char)*(cp + 1)]++;
87 cp += 2;
88 }
89
90 /* swap pointers */
91 if (path == buf1) {
92 path = buf2;
93 oldpath = buf1;
94 } else {
95 path = buf1;
96 oldpath = buf2;
97 }
98 }
99 if (!feof(stdin) || ferror(stdin))
100 err(1, "stdin");
101
102
103 /* output, boundary check */
104 for (i = ASCII_MIN; i <= ASCII_MAX; i++)
105 for (j = ASCII_MIN; j <= ASCII_MAX; j++)
106 if (bigram[i][j] != 0)
107 printf("%lu %c%c\n", bigram[i][j], i, j);
108
109 exit(0);
110 }
111