1/*- 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 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 */ 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 $"); 42 43#include <limits.h> 44#include <rune.h> 45#include <stddef.h> 46#include <string.h> 47#include "runedepreciated.h" 48 49char * 50mbrune(string, c) 51 const char *string; 52 rune_t c; 53{ 54 char const *result; 55 rune_t r; 56 static int warn_depreciated = 1; 57 58 if (warn_depreciated) { 59 warn_depreciated = 0; 60 fprintf(stderr, __rune_depreciated_msg, "mbrune"); 61 } 62 63 while ((r = __sgetrune(string, MB_LEN_MAX, &result))) { 64 if (r == c) 65 return ((char *)string); 66 string = result == string ? string + 1 : result; 67 } 68 69 return (c == *string ? (char *)string : NULL); 70} 71 72char * 73mbrrune(string, c) 74 const char *string; 75 rune_t c; 76{ 77 const char *last = 0; 78 char const *result; 79 rune_t r; 80 static int warn_depreciated = 1; 81 82 if (warn_depreciated) { 83 warn_depreciated = 0; 84 fprintf(stderr, __rune_depreciated_msg, "mbrrune"); 85 } 86 87 while ((r = __sgetrune(string, MB_LEN_MAX, &result))) { 88 if (r == c) 89 last = string; 90 string = result == string ? string + 1 : result; 91 } 92 return (c == *string ? (char *)string : (char *)last); 93} 94 95char * 96mbmb(string, pattern) 97 const char *string; 98 char *pattern; 99{ 100 rune_t first, r; 101 size_t plen, slen; 102 char const *result; 103 static int warn_depreciated = 1; 104 105 if (warn_depreciated) { 106 warn_depreciated = 0; 107 fprintf(stderr, __rune_depreciated_msg, "mbmb"); 108 } 109 110 plen = strlen(pattern); 111 slen = strlen(string); 112 if (plen > slen) 113 return (0); 114 115 first = __sgetrune(pattern, plen, &result); 116 if (result == string) 117 return (0); 118 119 while (slen >= plen && (r = __sgetrune(string, slen, &result))) { 120 if (r == first) { 121 if (strncmp(string, pattern, slen) == 0) 122 return ((char *) string); 123 } 124 if (result == string) { 125 --slen; 126 ++string; 127 } else { 128 slen -= result - string; 129 string = result; 130 } 131 } 132 return (0); 133} 134