lib/libc/string/wcscspn.c

   1 /*-
   2  * Copyright (c)1999 Citrus Project,
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  *
  14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  15  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  16  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  17  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  20  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  22  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  23  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  24  * SUCH DAMAGE.
  25  *
  26  *      citrus Id: wcscspn.c,v 1.1 1999/12/29 21:47:45 tshiozak Exp
  27  *
  28  * $NetBSD: wcscspn.c,v 1.1 2000/12/23 23:14:36 itojun Exp $
  29  * $FreeBSD: src/lib/libc/string/wcscspn.c,v 1.3.2.1 2001/07/11 23:48:38 obrien Exp $
  30  * $DragonFly: src/lib/libc/string/wcscspn.c,v 1.3 2005/09/18 16:32:34 asmodai Exp $
  31  */
  32
  33 #include <assert.h>
  34 #include <wchar.h>
  35
  36 size_t
  37 wcscspn(const wchar_t *s, const wchar_t *set)
  38 {
  39         const wchar_t *p;
  40         const wchar_t *q;
  41
  42         p = s;
  43         while (*p) {
  44                 q = set;
  45                 while (*q) {
  46                         if (*p == *q)
  47                                 goto done;
  48                         q++;
  49                 }
  50                 p++;
  51         }
  52
  53 done:
  54         return (p - s);
  55 }