]> git.saurik.com Git - apple/libc.git/blame - locale/FreeBSD/mbrune.c
Libc-339.tar.gz
[apple/libc.git] / locale / FreeBSD / mbrune.c
CommitLineData
5b2abdfb 1/*-
e9ce8d39
A
2 * Copyright (c) 1993
3 * The Regents of the University of California. All rights reserved.
4 *
5 * This code is derived from software contributed to Berkeley by
6 * Paul Borman at Krystal Technologies.
7 *
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted provided that the following conditions
10 * are met:
11 * 1. Redistributions of source code must retain the above copyright
12 * notice, this list of conditions and the following disclaimer.
13 * 2. Redistributions in binary form must reproduce the above copyright
14 * notice, this list of conditions and the following disclaimer in the
15 * documentation and/or other materials provided with the distribution.
16 * 3. All advertising materials mentioning features or use of this software
17 * must display the following acknowledgement:
18 * This product includes software developed by the University of
19 * California, Berkeley and its contributors.
20 * 4. Neither the name of the University nor the names of its contributors
21 * may be used to endorse or promote products derived from this software
22 * without specific prior written permission.
23 *
24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * SUCH DAMAGE.
35 */
36
5b2abdfb
A
37#if defined(LIBC_SCCS) && !defined(lint)
38static char sccsid[] = "@(#)mbrune.c 8.1 (Berkeley) 6/27/93";
39#endif /* LIBC_SCCS and not lint */
9385eb3d
A
40#include <sys/cdefs.h>
41__FBSDID("$FreeBSD: src/lib/libc/locale/mbrune.c,v 1.3 2002/09/18 06:11:21 tjr Exp $");
e9ce8d39
A
42
43#include <limits.h>
44#include <rune.h>
45#include <stddef.h>
46#include <string.h>
47
9385eb3d 48__warn_references(mbrune, "warning: mbrune() is deprecated. See mbrune(3).");
e9ce8d39
A
49char *
50mbrune(string, c)
51 const char *string;
52 rune_t c;
53{
54 char const *result;
55 rune_t r;
56
57 while ((r = sgetrune(string, MB_LEN_MAX, &result))) {
58 if (r == c)
59 return ((char *)string);
60 string = result == string ? string + 1 : result;
61 }
62
63 return (c == *string ? (char *)string : NULL);
64}
65
9385eb3d 66__warn_references(mbrrune, "warning: mbrrune() is deprecated. See mbrrune(3).");
e9ce8d39
A
67char *
68mbrrune(string, c)
69 const char *string;
70 rune_t c;
71{
72 const char *last = 0;
73 char const *result;
74 rune_t r;
75
76 while ((r = sgetrune(string, MB_LEN_MAX, &result))) {
77 if (r == c)
78 last = string;
79 string = result == string ? string + 1 : result;
80 }
81 return (c == *string ? (char *)string : (char *)last);
82}
83
9385eb3d 84__warn_references(mbmb, "warning: mbmb() is deprecated. See mbmb(3).");
e9ce8d39
A
85char *
86mbmb(string, pattern)
87 const char *string;
88 char *pattern;
89{
90 rune_t first, r;
91 size_t plen, slen;
92 char const *result;
93
94 plen = strlen(pattern);
95 slen = strlen(string);
96 if (plen > slen)
97 return (0);
98
99 first = sgetrune(pattern, plen, &result);
100 if (result == string)
101 return (0);
102
103 while (slen >= plen && (r = sgetrune(string, slen, &result))) {
104 if (r == first) {
105 if (strncmp(string, pattern, slen) == 0)
106 return ((char *) string);
107 }
108 if (result == string) {
109 --slen;
110 ++string;
111 } else {
112 slen -= result - string;
113 string = result;
114 }
115 }
116 return (0);
117}