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