add Berkeley specific headers

[unix-history] / usr / src / usr.bin / tn3270 / general / genbsubs.c

/*
* Copyright (c) 1988 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that this notice is preserved and that due credit is given
* to the University of California at Berkeley. The name of the University
* may not be used to endorse or promote products derived from this
* software without specific prior written permission. This software
* is provided ``as is'' without express or implied warranty.
*/

#ifndef lint
static char sccsid[] = "@(#)genbsubs.c  3.2 (Berkeley) %G%";
#endif /* not lint */

/* The output of bunequal is the offset of the byte which didn't match;
* if all the bytes match, then we return n.
* bunequal(s1, s2, n) */

int
bunequal(s1, s2, n)
register char *s1, *s2;
register n;
{
   register int i = 0;

   while (i++ < n) {
       if (*s1++ != *s2++) {
           break;
       }
   }
   return(i-1);
}

/* bskip(s1, n, b) : finds the first occurrence of any byte != 'b' in the 'n'
* bytes beginning at 's1'.
*/

int
bskip(s1, n, b)
register char *s1;
register int n;
register int b;
{
   register int i = 0;

   while (i++ < n) {
       if (*s1++ != b) {
           break;
       }
   }
   return(i-1);
}

/*
* memNSchr(const void *s, int c, size_t n, int and)
*
* Like memchr, but the comparison is '((*s)&and) == c',
* and we increment our way through s by "stride" ('s += stride').
*
* We optimize for the most used strides of +1 and -1.
*/

unsigned char *
memNSchr(s, c, n, and, stride)
char *s;
int c;
unsigned int n;
int and;
int stride;
{
   register unsigned char _c, *_s, _and;

   _and = and;
   _c = (c&_and);
   _s = (unsigned char *)s;
   switch (stride) {
   case 1:
       while (n--) {
           if (((*_s)&_and) == _c) {
               return _s;
           }
           _s++;
       }
       break;
   case -1:
       while (n--) {
           if (((*_s)&_and) == _c) {
               return _s;
           }
           _s--;
       }
       break;
   default:
       while (n--) {
           if (((*_s)&_and) == _c) {
               return _s;
           }
           _s += stride;
       }
   }
   return 0;
}