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 * 4. Neither the name of the University nor the names of its contributors 17 * may be used to endorse or promote products derived from this software 18 * without specific prior written permission. 19 * 20 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 21 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 22 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 23 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 24 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 25 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 26 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 27 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 28 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 29 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 30 * SUCH DAMAGE. 31 */ 32 33 /* 34 * Copyright 2010 Nexenta Systems, Inc. All rights reserved. 35 * Use is subject to license terms. 36 */ 37 38 #include "lint.h" 39 #include <ctype.h> 40 #include <stdio.h> 41 #include "runetype.h" 42 43 unsigned int 44 ___runetype(__ct_rune_t c) 45 { 46 size_t lim; 47 _RuneRange *rr = &_CurrentRuneLocale->__runetype_ext; 48 _RuneEntry *base, *re; 49 50 if (c < 0 || c == EOF) 51 return (0L); 52 53 /* Binary search -- see bsearch.c for explanation. */ 54 base = rr->__ranges; 55 for (lim = rr->__nranges; lim != 0; lim >>= 1) { 56 re = base + (lim >> 1); 57 if (re->__min <= c && c <= re->__max) { 58 if (re->__types) 59 return (re->__types[c - re->__min]); 60 else 61 return (re->__map); 62 } else if (c > re->__max) { 63 base = re + 1; 64 lim--; 65 } 66 } 67 68 return (0L); 69 } 70