|
|
1.1 ! root 1: /*- ! 2: * Copyright (c) 1990 The Regents of the University of California. ! 3: * All rights reserved. ! 4: * ! 5: * This code is derived from software contributed to Berkeley by ! 6: * Chris Torek. ! 7: * ! 8: * Redistribution and use in source and binary forms are permitted ! 9: * provided that: (1) source distributions retain this entire copyright ! 10: * notice and comment, and (2) distributions including binaries display ! 11: * the following acknowledgement: ``This product includes software ! 12: * developed by the University of California, Berkeley and its contributors'' ! 13: * in the documentation or other materials provided with the distribution ! 14: * and in all advertising materials mentioning features or use of this ! 15: * software. Neither the name of the University nor the names of its ! 16: * contributors may be used to endorse or promote products derived ! 17: * from this software without specific prior written permission. ! 18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR ! 19: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED ! 20: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. ! 21: */ ! 22: ! 23: #if defined(LIBC_SCCS) && !defined(lint) ! 24: static char sccsid[] = "@(#)strcspn.c 5.5 (Berkeley) 5/16/90"; ! 25: #endif /* LIBC_SCCS and not lint */ ! 26: ! 27: #include <sys/stdc.h> ! 28: #include <string.h> ! 29: ! 30: /* ! 31: * Span the complement of string s2. ! 32: */ ! 33: size_t ! 34: strcspn(s1, s2) ! 35: const char *s1; ! 36: register const char *s2; ! 37: { ! 38: register const char *p, *spanp; ! 39: register char c, sc; ! 40: ! 41: /* ! 42: * Stop as soon as we find any character from s2. Note that there ! 43: * must be a NUL in s2; it suffices to stop when we find that, too. ! 44: */ ! 45: for (p = s1;;) { ! 46: c = *p++; ! 47: spanp = s2; ! 48: do { ! 49: if ((sc = *spanp++) == c) ! 50: return (p - 1 - s1); ! 51: } while (sc != 0); ! 52: } ! 53: /* NOTREACHED */ ! 54: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.