Deleted Added
sdiff udiff text old ( 18300 ) new ( 18905 )
full compact
locate.bigram.c (18300) locate.bigram.c (18905)
1/*
1/*
2 * Copyright (c) 1995 Wolfram Schneider <wosch@FreeBSD.org>. Berlin.
2 * Copyright (c) 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * James A. Woods.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions

--- 18 unchanged lines hidden (view full) ---

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
34 * SUCH DAMAGE.
35 *
3 * Copyright (c) 1989, 1993
4 * The Regents of the University of California. All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * James A. Woods.
8 *
9 * Redistribution and use in source and binary forms, with or without
10 * modification, are permitted provided that the following conditions

--- 18 unchanged lines hidden (view full) ---

29 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
30 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
31 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
32 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
33 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
34 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
35 * SUCH DAMAGE.
36 *
36 * $Id: locate.bigram.c,v 1.1 1996/09/13 13:23:48 wosch Exp wosch $
37 * $Id: locate.bigram.c,v 1.7 1996/09/14 20:15:49 wosch Exp $
37 */
38
39#ifndef lint
40static 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

--- 10 unchanged lines hidden (view full) ---

55 */
56
57#include <stdio.h>
58#include <sys/param.h> /* for MAXPATHLEN */
59#include "locate.h"
60
61u_char buf1[MAXPATHLEN] = " ";
62u_char buf2[MAXPATHLEN];
38 */
39
40#ifndef lint
41static char copyright[] =
42"@(#) Copyright (c) 1989, 1993\n\
43 The Regents of the University of California. All rights reserved.\n";
44#endif /* not lint */
45

--- 10 unchanged lines hidden (view full) ---

56 */
57
58#include <stdio.h>
59#include <sys/param.h> /* for MAXPATHLEN */
60#include "locate.h"
61
62u_char buf1[MAXPATHLEN] = " ";
63u_char buf2[MAXPATHLEN];
63u_int bigram[UCHAR_MAX][UCHAR_MAX];
64u_int bigram[UCHAR_MAX + 1][UCHAR_MAX + 1];
64
65int
66main(void)
67{
68 register u_char *cp;
69 register u_char *oldpath = buf1, *path = buf2;
70 register u_int i, j;
71

--- 7 unchanged lines hidden (view full) ---

79
80
81 /* skip longest common prefix */
82 for (cp = path; *cp == *oldpath; cp++, oldpath++)
83 if (*cp == '\0')
84 break;
85
86 while (*cp != '\0' && *(cp + 1) != '\0') {
65
66int
67main(void)
68{
69 register u_char *cp;
70 register u_char *oldpath = buf1, *path = buf2;
71 register u_int i, j;
72

--- 7 unchanged lines hidden (view full) ---

80
81
82 /* skip longest common prefix */
83 for (cp = path; *cp == *oldpath; cp++, oldpath++)
84 if (*cp == '\0')
85 break;
86
87 while (*cp != '\0' && *(cp + 1) != '\0') {
87 bigram[(u_int)*cp][(u_int)*(cp + 1)]++;
88 bigram[(u_char)*cp][(u_char)*(cp + 1)]++;
88 cp += 2;
89 }
90
91 /* swap pointers */
92 if (path == buf1) {
93 path = buf2;
94 oldpath = buf1;
95 } else {

--- 13 unchanged lines hidden --- 		89 cp += 2;
90 }
91
92 /* swap pointers */
93 if (path == buf1) {
94 path = buf2;
95 oldpath = buf1;
96 } else {

--- 13 unchanged lines hidden ---