mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-18 11:00:07 +00:00
a529b41620
2001-08-06 Jakub Jelinek <jakub@redhat.com> * stdlib/strtod.c (STRTOF): Skip whole infinity, not just inf. * stdio-common/vfscanf.c (__vfscanf): +- can be followed by i in +-Inf. * stdlib/tst-strtod.c (tests): Add Inf tests. * stdio-common/tstscanf.c (main): Add tests for +- before Inf. * locale/weightwc.h (findidx): Change type of i to int32_t.
115 lines
2.9 KiB
C
115 lines
2.9 KiB
C
/* Copyright (C) 1996-2000, 2001 Free Software Foundation, Inc.
|
|
This file is part of the GNU C Library.
|
|
Written by Ulrich Drepper, <drepper@cygnus.com>.
|
|
|
|
The GNU C Library is free software; you can redistribute it and/or
|
|
modify it under the terms of the GNU Lesser General Public
|
|
License as published by the Free Software Foundation; either
|
|
version 2.1 of the License, or (at your option) any later version.
|
|
|
|
The GNU C Library is distributed in the hope that it will be useful,
|
|
but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
|
Lesser General Public License for more details.
|
|
|
|
You should have received a copy of the GNU Lesser General Public
|
|
License along with the GNU C Library; if not, write to the Free
|
|
Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
|
|
02111-1307 USA. */
|
|
|
|
/* Find index of weight. */
|
|
static inline int32_t
|
|
findidx (const wint_t **cpp)
|
|
{
|
|
int32_t i;
|
|
const wint_t *cp;
|
|
wint_t ch;
|
|
|
|
ch = *(*cpp)++;
|
|
i = collidx_table_lookup ((const char *) table, ch);
|
|
|
|
if (i >= 0)
|
|
/* This is an index into the weight table. Cool. */
|
|
return i;
|
|
|
|
/* Oh well, more than one sequence starting with this byte.
|
|
Search for the correct one. */
|
|
cp = &extra[-i];
|
|
while (1)
|
|
{
|
|
size_t nhere;
|
|
const wint_t *usrc = *cpp;
|
|
|
|
/* The first thing is the index. */
|
|
i = *cp++;
|
|
|
|
/* Next is the length of the byte sequence. These are always
|
|
short byte sequences so there is no reason to call any
|
|
function (even if they are inlined). */
|
|
nhere = *cp++;
|
|
|
|
if (i >= 0)
|
|
{
|
|
/* It is a single character. If it matches we found our
|
|
index. Note that at the end of each list there is an
|
|
entry of length zero which represents the single byte
|
|
sequence. The first (and here only) byte was tested
|
|
already. */
|
|
size_t cnt;
|
|
|
|
for (cnt = 0; cnt < nhere; ++cnt)
|
|
if (cp[cnt] != usrc[cnt])
|
|
break;
|
|
|
|
if (cnt == nhere)
|
|
{
|
|
/* Found it. */
|
|
*cpp += nhere;
|
|
return i;
|
|
}
|
|
|
|
/* Up to the next entry. */
|
|
cp += nhere;
|
|
}
|
|
else
|
|
{
|
|
/* This is a range of characters. First decide whether the
|
|
current byte sequence lies in the range. */
|
|
size_t cnt;
|
|
size_t offset;
|
|
|
|
for (cnt = 0; cnt < nhere - 1; ++cnt)
|
|
if (cp[cnt] != usrc[cnt])
|
|
break;
|
|
|
|
if (cnt < nhere - 1)
|
|
{
|
|
cp += 2 * nhere;
|
|
continue;
|
|
}
|
|
|
|
if (cp[nhere - 1] > usrc[nhere -1])
|
|
{
|
|
cp += 2 * nhere;
|
|
continue;
|
|
}
|
|
|
|
if (cp[2 * nhere - 1] < usrc[nhere -1])
|
|
{
|
|
cp += 2 * nhere;
|
|
continue;
|
|
}
|
|
|
|
/* This range matches the next characters. Now find
|
|
the offset in the indirect table. */
|
|
offset = usrc[nhere - 1] - cp[nhere - 1];
|
|
*cpp += nhere;
|
|
|
|
return indirect[-i + offset];
|
|
}
|
|
}
|
|
|
|
/* NOTREACHED */
|
|
return 0x43219876;
|
|
}
|