d/freebsd-dev
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

remove unnecessary boundary check, 2x faster

Browse Source 
code cleanup
This commit is contained in:
Wolfram Schneider 1996-09-14 20:15:49 +00:00
parent ee8eb359dd
commit df62e52bbc
Notes: svn2git 2020-12-20 02:59:44 +00:00 
svn path=/head/; revision=18300
1 changed files with 13 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

31
usr.bin/locate/bigram/locate.bigram.c
View File

@ -33,7 +33,7 @@
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
* SUCH DAMAGE.
*
* $Id: locate.bigram.c,v 1.5 1996/08/30 03:06:15 peter Exp $
* $Id: locate.bigram.c,v 1.1 1996/09/13 13:23:48 wosch Exp wosch $
*/
#ifndef lint
@ -71,25 +71,20 @@ main(void)
while (fgets(path, sizeof(buf2), stdin) != NULL) {
/* skip empty lines */
if (*path == '\n')
continue;
/*
* We don't need remove newline character '\n'.
* '\n' is less than ASCII_MIN and will be later
* ignored at output.
*/
/* Squelch characters that would botch the decoding. */
for (cp = path; *cp != '\0'; cp++) {
/* chop newline */
if (*cp == '\n')
*cp = '\0';
/* range */
else if (*cp < ASCII_MIN || *cp > ASCII_MAX)
*cp = '?';
}
/* skip longest common prefix */
for (cp = path; *cp == *oldpath && *cp != '\0'; cp++, oldpath++);
for (cp = path; *cp == *oldpath; cp++, oldpath++)
if (*cp == '\0')
break;
while (*cp != '\0' && *(cp+1) != '\0') {
bigram[*cp][*(cp+1)]++;
while (*cp != '\0' && *(cp + 1) != '\0') {
bigram[(u_int)*cp][(u_int)*(cp + 1)]++;
cp += 2;
}
@ -103,11 +98,11 @@ main(void)
}
}
/* output, (paranoid) boundary check */
/* output, boundary check */
for (i = ASCII_MIN; i <= ASCII_MAX; i++)
for (j = ASCII_MIN; j <= ASCII_MAX; j++)
if (bigram[i][j] != 0)
printf("%4u %c%c\n", bigram[i][j], i, j);
(void)printf("%4u %c%c\n", bigram[i][j], i, j);
exit(0);
}