76e6db686e
Through testing, the user noted that some Cyrillic characters were not sorting correctly, and this was confirmed. After extensive testing and review, the localedef tool was eliminated as the culprit. The sustitutions were encoded correctly in LC_COLLATE. The error was mainly in wcscoll where character expansions were mishandled. The main directive pass routines had to be written to go back for a new collation value when the "state" variable was set. Before pointers were being advanced, the second lookup was gettting applied to the wrong character, etc. The "eat expansion codes" section on collate.c also had a bug. Later own, the "state" variable logic was changed to only set if next code was greater than zero (rather than >= 0). Some additional cleanups got captured from previous work: 1) The previous commit moved the binary search comment from the correct location to a wrong location because it's wrong upstream in Illumos. The comment has little value so I just removed it. 2) Don't check if pointers are null before freeing, this is redundant as free() handles null pointers. 3) The two binary search trees were standardized wrt initialization 4) On the binary search trees, a negative "high" exits rather than checking the table count again. Submitted by: marino Obtained from: DragonflyBSD
224 lines
5.4 KiB
C
224 lines
5.4 KiB
C
/*-
|
|
* Copyright 2010 Nexenta Systems, Inc. All rights reserved.
|
|
* Copyright (c) 2002 Tim J. Robbins
|
|
* All rights reserved.
|
|
*
|
|
* Copyright (c) 2011 The FreeBSD Foundation
|
|
* All rights reserved.
|
|
* Portions of this software were developed by David Chisnall
|
|
* under sponsorship from the FreeBSD Foundation.
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* 1. Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* 2. Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in the
|
|
* documentation and/or other materials provided with the distribution.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
|
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
|
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
|
* SUCH DAMAGE.
|
|
*/
|
|
|
|
#include <sys/cdefs.h>
|
|
__FBSDID("$FreeBSD$");
|
|
|
|
#include <errno.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
#include <wchar.h>
|
|
#include "collate.h"
|
|
|
|
int
|
|
wcscoll_l(const wchar_t *ws1, const wchar_t *ws2, locale_t locale)
|
|
{
|
|
int len1, len2, pri1, pri2, ret;
|
|
wchar_t *tr1 = NULL, *tr2 = NULL;
|
|
int direc, pass;
|
|
|
|
FIX_LOCALE(locale);
|
|
struct xlocale_collate *table =
|
|
(struct xlocale_collate*)locale->components[XLC_COLLATE];
|
|
|
|
if (table->__collate_load_error)
|
|
/*
|
|
* Locale has no special collating order or could not be
|
|
* loaded, do a fast binary comparison.
|
|
*/
|
|
return (wcscmp(ws1, ws2));
|
|
|
|
ret = 0;
|
|
|
|
/*
|
|
* Once upon a time we had code to try to optimize this, but
|
|
* it turns out that you really can't make many assumptions
|
|
* safely. You absolutely have to run this pass by pass,
|
|
* because some passes will be ignored for a given character,
|
|
* while others will not. Simpler locales will benefit from
|
|
* having fewer passes, and most comparisions should resolve
|
|
* during the primary pass anyway.
|
|
*
|
|
* Note that we do one final extra pass at the end to pick
|
|
* up UNDEFINED elements. There is special handling for them.
|
|
*/
|
|
for (pass = 0; pass <= table->info->directive_count; pass++) {
|
|
|
|
const int32_t *st1 = NULL;
|
|
const int32_t *st2 = NULL;
|
|
const wchar_t *w1 = ws1;
|
|
const wchar_t *w2 = ws2;
|
|
int check1, check2;
|
|
|
|
/* special pass for UNDEFINED */
|
|
if (pass == table->info->directive_count) {
|
|
direc = DIRECTIVE_FORWARD | DIRECTIVE_UNDEFINED;
|
|
} else {
|
|
direc = table->info->directive[pass];
|
|
}
|
|
|
|
if (direc & DIRECTIVE_BACKWARD) {
|
|
wchar_t *bp, *fp, c;
|
|
if ((tr1 = wcsdup(w1)) == NULL)
|
|
goto fail;
|
|
bp = tr1;
|
|
fp = tr1 + wcslen(tr1) - 1;
|
|
while (bp < fp) {
|
|
c = *bp;
|
|
*bp++ = *fp;
|
|
*fp-- = c;
|
|
}
|
|
if ((tr2 = wcsdup(w2)) == NULL)
|
|
goto fail;
|
|
bp = tr2;
|
|
fp = tr2 + wcslen(tr2) - 1;
|
|
while (bp < fp) {
|
|
c = *bp;
|
|
*bp++ = *fp;
|
|
*fp-- = c;
|
|
}
|
|
w1 = tr1;
|
|
w2 = tr2;
|
|
}
|
|
|
|
if (direc & DIRECTIVE_POSITION) {
|
|
while (*w1 && *w2) {
|
|
pri1 = pri2 = 0;
|
|
check1 = check2 = 1;
|
|
while ((pri1 == pri2) && (check1 || check2)) {
|
|
if (check1) {
|
|
_collate_lookup(table, w1, &len1,
|
|
&pri1, pass, &st1);
|
|
if (pri1 < 0) {
|
|
errno = EINVAL;
|
|
goto fail;
|
|
}
|
|
if (!pri1) {
|
|
pri1 = COLLATE_MAX_PRIORITY;
|
|
st1 = NULL;
|
|
}
|
|
check1 = (st1 != NULL);
|
|
}
|
|
if (check2) {
|
|
_collate_lookup(table, w2, &len2,
|
|
&pri2, pass, &st2);
|
|
if (pri2 < 0) {
|
|
errno = EINVAL;
|
|
goto fail;
|
|
}
|
|
if (!pri2) {
|
|
pri2 = COLLATE_MAX_PRIORITY;
|
|
st2 = NULL;
|
|
}
|
|
check2 = (st2 != NULL);
|
|
}
|
|
}
|
|
if (pri1 != pri2) {
|
|
ret = pri1 - pri2;
|
|
goto end;
|
|
}
|
|
w1 += len1;
|
|
w2 += len2;
|
|
}
|
|
} else {
|
|
while (*w1 && *w2) {
|
|
pri1 = pri2 = 0;
|
|
check1 = check2 = 1;
|
|
while ((pri1 == pri2) && (check1 || check2)) {
|
|
while (check1 && *w1) {
|
|
_collate_lookup(table, w1,
|
|
&len1, &pri1, pass, &st1);
|
|
if (pri1 > 0)
|
|
break;
|
|
if (pri1 < 0) {
|
|
errno = EINVAL;
|
|
goto fail;
|
|
}
|
|
st1 = NULL;
|
|
w1 += 1;
|
|
}
|
|
check1 = (st1 != NULL);
|
|
while (check2 && *w2) {
|
|
_collate_lookup(table, w2,
|
|
&len2, &pri2, pass, &st2);
|
|
if (pri2 > 0)
|
|
break;
|
|
if (pri2 < 0) {
|
|
errno = EINVAL;
|
|
goto fail;
|
|
}
|
|
st2 = NULL;
|
|
w2 += 1;
|
|
}
|
|
check2 = (st2 != NULL);
|
|
if (!pri1 || !pri2)
|
|
break;
|
|
}
|
|
if (!pri1 || !pri2)
|
|
break;
|
|
if (pri1 != pri2) {
|
|
ret = pri1 - pri2;
|
|
goto end;
|
|
}
|
|
w1 += len1;
|
|
w2 += len2;
|
|
}
|
|
}
|
|
if (!*w1) {
|
|
if (*w2) {
|
|
ret = -(int)*w2;
|
|
goto end;
|
|
}
|
|
} else {
|
|
ret = *w1;
|
|
goto end;
|
|
}
|
|
}
|
|
ret = 0;
|
|
|
|
end:
|
|
free(tr1);
|
|
free(tr2);
|
|
|
|
return (ret);
|
|
|
|
fail:
|
|
ret = wcscmp(ws1, ws2);
|
|
goto end;
|
|
}
|
|
|
|
int
|
|
wcscoll(const wchar_t *ws1, const wchar_t *ws2)
|
|
{
|
|
return wcscoll_l(ws1, ws2, __get_locale());
|
|
}
|