Return to strpbrk.c CVS log

Up to [CSRG BSD Unix] / 43BSDTahoe / lib / libc / compat-sys5

Annotation of 43BSDTahoe/lib/libc/compat-sys5/strpbrk.c, revision 1.1.1.1

1.1       root        1: /*
                      2:  * Copyright (c) 1985 Regents of the University of California.
                      3:  * All rights reserved.
                      4:  *
                      5:  * Redistribution and use in source and binary forms are permitted
                      6:  * provided that the above copyright notice and this paragraph are
                      7:  * duplicated in all such forms and that any documentation,
                      8:  * advertising materials, and other materials related to such
                      9:  * distribution and use acknowledge that the software was developed
                     10:  * by the University of California, Berkeley.  The name of the
                     11:  * University may not be used to endorse or promote products derived
                     12:  * from this software without specific prior written permission.
                     13:  * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
                     14:  * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
                     15:  * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
                     16:  */
                     17: 
                     18: #if defined(LIBC_SCCS) && !defined(lint)
                     19: static char sccsid[] = "@(#)strpbrk.c  5.4 (Berkeley) 6/27/88";
                     20: #endif /* LIBC_SCCS and not lint */
                     21: 
                     22: char *
                     23: strpbrk(s, brk)
                     24:        register char *s, *brk;
                     25: {
                     26:        register char *p;
                     27:        register c;
                     28: 
                     29:        while (c = *s) {
                     30:                for (p = brk; *p; p++)
                     31:                        if (c == *p)
                     32:                                return (s);
                     33:                s++;
                     34:        }
                     35:        return (0);
                     36: }

This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.