1 /* Copyright (C) 1996-2001,2003,2004,2005,2007,2011 Free Software Foundation, Inc.
2 This file is part of the GNU C Library.
3 Written by Ulrich Drepper, <drepper@cygnus.com>.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Lesser General Public
7 License as published by the Free Software Foundation; either
8 version 2.1 of the License, or (at your option) any later version.
10 The GNU C Library is distributed in the hope that it will be useful,
11 but WITHOUT ANY WARRANTY; without even the implied warranty of
12 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 Lesser General Public License for more details.
15 You should have received a copy of the GNU Lesser General Public
16 License along with the GNU C Library; if not, write to the Free
17 Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA
20 /* Find index of weight. */
22 __attribute ((always_inline
))
23 findidx (const wint_t **cpp
, size_t len
)
25 wint_t ch
= *(*cpp
)++;
26 int32_t i
= __collidx_table_lookup ((const char *) table
, ch
);
29 /* This is an index into the weight table. Cool. */
32 /* Oh well, more than one sequence starting with this byte.
33 Search for the correct one. */
34 const int32_t *cp
= (const int32_t *) &extra
[-i
];
39 const int32_t *usrc
= (const int32_t *) *cpp
;
41 /* The first thing is the index. */
44 /* Next is the length of the byte sequence. These are always
45 short byte sequences so there is no reason to call any
46 function (even if they are inlined). */
51 /* It is a single character. If it matches we found our
52 index. Note that at the end of each list there is an
53 entry of length zero which represents the single byte
54 sequence. The first (and here only) byte was tested
58 for (cnt
= 0; cnt
< nhere
&& cnt
< len
; ++cnt
)
59 if (cp
[cnt
] != usrc
[cnt
])
69 /* Up to the next entry. */
74 /* This is a range of characters. First decide whether the
75 current byte sequence lies in the range. */
79 for (cnt
= 0; cnt
< nhere
- 1 && cnt
< len
; ++cnt
)
80 if (cp
[cnt
] != usrc
[cnt
])
89 if (cp
[nhere
- 1] > usrc
[nhere
-1])
95 if (cp
[2 * nhere
- 1] < usrc
[nhere
-1])
101 /* This range matches the next characters. Now find
102 the offset in the indirect table. */
103 offset
= usrc
[nhere
- 1] - cp
[nhere
- 1];
106 return indirect
[-i
+ offset
];