1 /* Copyright (C) 1995, 1996, 1997, 1998, 1999 Free Software Foundation, Inc.
2 This file is part of the GNU C Library.
3 Written by Ulrich Drepper <drepper@gnu.ai.mit.edu>, 1995.
5 The GNU C Library is free software; you can redistribute it and/or
6 modify it under the terms of the GNU Library General Public License as
7 published by the Free Software Foundation; either version 2 of the
8 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 Library General Public License for more details.
15 You should have received a copy of the GNU Library General Public
16 License along with the GNU C Library; see the file COPYING.LIB. If not,
17 write to the Free Software Foundation, Inc., 59 Temple Place - Suite 330,
18 Boston, MA 02111-1307, USA. */
27 # define STRING_TYPE char
28 # define USTRING_TYPE unsigned char
29 # ifdef USE_IN_EXTENDED_LOCALE_MODEL
30 # define STRCOLL __strcoll_l
32 # define STRCOLL strcoll
34 # define STRCMP strcmp
37 #ifndef USE_IN_EXTENDED_LOCALE_MODEL
40 const STRING_TYPE
*s1
;
41 const STRING_TYPE
*s2
;
45 const STRING_TYPE
*s1
;
46 const STRING_TYPE
*s2
;
50 return STRCMP (s1
, s2
);
54 /* Include the shared helper functions. `strxfrm'/`wcsxfrm' also use
56 #include "../locale/weight.h"
59 /* Compare S1 and S2, returning less than, equal to or
60 greater than zero if the collated form of S1 is lexicographically
61 less than, equal to or greater than the collated form of S2. */
62 #ifndef USE_IN_EXTENDED_LOCALE_MODEL
65 const STRING_TYPE
*s1
;
66 const STRING_TYPE
*s2
;
70 const STRING_TYPE
*s1
;
71 const STRING_TYPE
*s2
;
75 #ifdef USE_IN_EXTENDED_LOCALE_MODEL
76 struct locale_data
*current
= l
->__locales
[LC_COLLATE
];
77 # if BYTE_ORDER == BIG_ENDIAN
78 const uint32_t *collate_table
= (const uint32_t *)
79 current
->values
[_NL_ITEM_INDEX (_NL_COLLATE_TABLE_EB
)].string
;
80 const uint32_t *collate_extra
= (const uint32_t *)
81 current
->values
[_NL_ITEM_INDEX (_NL_COLLATE_EXTRA_EB
)].string
;
82 # elif BYTE_ORDER == LITTLE_ENDIAN
83 const uint32_t *collate_table
= (const uint32_t *)
84 current
->values
[_NL_ITEM_INDEX (_NL_COLLATE_TABLE_EL
)].string
;
85 const uint32_t *collate_extra
= (const uint32_t *)
86 current
->values
[_NL_ITEM_INDEX (_NL_COLLATE_EXTRA_EL
)].string
;
88 # error bizarre byte order
91 weight_t
*s1forw
= NULL
;
92 weight_t
*s1backw
= NULL
;
93 weight_t
*s2forw
= NULL
;
94 weight_t
*s2backw
= NULL
;
97 /* If the current locale does not specify locale data we use normal
98 8-bit string comparison. */
99 if (collate_nrules
== 0)
100 return STRCMP (s1
, s2
);
102 /* Handle empty strings as a special case. */
104 return *s2
== '\0' ? 0 : -1;
105 else if (*s2
== '\0')
108 /* Get full information about the strings. This means we get
109 information for all passes in a special data structure. */
110 get_string (s1
, s1forw
, s1backw
);
111 get_string (s2
, s2forw
, s2backw
);
113 /* Now we have all the information. In at most the given number of
114 passes we can finally decide about the order. */
115 for (pass
= 0; pass
< collate_nrules
; ++pass
)
117 int forward
= (collate_rules
[pass
] & sort_forward
) != 0;
118 const weight_t
*s1run
= forward
? s1forw
: s1backw
;
119 const weight_t
*s2run
= forward
? s2forw
: s2backw
;
120 int s1idx
= forward
? 0 : s1run
->data
[pass
].number
- 1;
121 int s2idx
= forward
? 0 : s2run
->data
[pass
].number
- 1;
130 /* Here we have to check for IGNORE entries. If these are
131 found we count them and go on with the next value. */
133 && ((w1
= s1run
->data
[pass
].value
[s1idx
])
134 == (uint32_t) IGNORE_CHAR
))
138 ? ++s1idx
>= s1run
->data
[pass
].number
141 weight_t
*nextp
= forward
? s1run
->next
: s1run
->prev
;
145 /* No more non-INGOREd elements means lowest
150 s1idx
= forward
? 0 : nextp
->data
[pass
].number
- 1;
156 && ((w2
= s2run
->data
[pass
].value
[s2idx
])
157 == (uint32_t) IGNORE_CHAR
))
161 ? ++s2idx
>= s2run
->data
[pass
].number
164 weight_t
*nextp
= forward
? s2run
->next
: s2run
->prev
;
168 /* No more non-INGOREd elements means lowest
173 s2idx
= forward
? 0 : nextp
->data
[pass
].number
- 1;
178 /* If one string is completely processed stop. */
179 if (s1run
== NULL
|| s2run
== NULL
)
182 /* Now we have information of the number of ignored
183 weights and the value of the next weight. */
184 if ((collate_rules
[pass
] & sort_position
) != 0
185 && s1ignore
!= s2ignore
&& (w1
!= 0 || w2
!= 0))
186 return s1ignore
< s2ignore
? -1 : 1;
189 return w1
< w2
? -1 : 1;
191 /* We have to increment the index counters. */
194 if (++s1idx
>= s1run
->data
[pass
].number
)
199 if (++s2idx
>= s2run
->data
[pass
].number
)
211 s1idx
= s1run
->data
[pass
].number
- 1;
217 s2idx
= s2run
->data
[pass
].number
- 1;
223 return s1run
!= NULL
? 1 : -1;