mirror of
https://git.openldap.org/openldap/openldap.git
synced 2024-12-21 03:10:25 +08:00
341 lines
6.9 KiB
C
341 lines
6.9 KiB
C
/*
|
|
* Copyright 2000-2002 The OpenLDAP Foundation
|
|
* COPYING RESTRICTIONS APPLY. See COPYRIGHT File in top level directory
|
|
* of this package for details.
|
|
*/
|
|
|
|
#include "portable.h"
|
|
|
|
#include <ac/ctype.h>
|
|
#include <ac/string.h>
|
|
#include <ac/stdlib.h>
|
|
|
|
#include <lber.h>
|
|
|
|
#define malloc(x) ber_memalloc(x)
|
|
#define realloc(x,y) ber_memrealloc(x,y)
|
|
#define free(x) ber_memfree(x)
|
|
|
|
#include <ldap_utf8.h>
|
|
#include <ldap_pvt_uc.h>
|
|
|
|
|
|
int ucstrncmp(
|
|
const ldap_unicode_t *u1,
|
|
const ldap_unicode_t *u2,
|
|
ber_len_t n )
|
|
{
|
|
for(; 0 < n; ++u1, ++u2, --n ) {
|
|
if( *u1 != *u2 ) {
|
|
return *u1 < *u2 ? -1 : +1;
|
|
}
|
|
if ( *u1 == 0 ) {
|
|
return 0;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
int ucstrncasecmp(
|
|
const ldap_unicode_t *u1,
|
|
const ldap_unicode_t *u2,
|
|
ber_len_t n )
|
|
{
|
|
for(; 0 < n; ++u1, ++u2, --n ) {
|
|
ldap_unicode_t uu1 = uctoupper( *u1 );
|
|
ldap_unicode_t uu2 = uctoupper( *u2 );
|
|
|
|
if( uu1 != uu2 ) {
|
|
return uu1 < uu2 ? -1 : +1;
|
|
}
|
|
if ( uu1 == 0 ) {
|
|
return 0;
|
|
}
|
|
}
|
|
return 0;
|
|
}
|
|
|
|
ldap_unicode_t * ucstrnchr(
|
|
const ldap_unicode_t *u,
|
|
ber_len_t n,
|
|
ldap_unicode_t c )
|
|
{
|
|
for(; 0 < n; ++u, --n ) {
|
|
if( *u == c ) {
|
|
return (ldap_unicode_t *) u;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
ldap_unicode_t * ucstrncasechr(
|
|
const ldap_unicode_t *u,
|
|
ber_len_t n,
|
|
ldap_unicode_t c )
|
|
{
|
|
c = uctoupper( c );
|
|
for(; 0 < n; ++u, --n ) {
|
|
if( uctoupper( *u ) == c ) {
|
|
return (ldap_unicode_t *) u;
|
|
}
|
|
}
|
|
|
|
return NULL;
|
|
}
|
|
|
|
void ucstr2upper(
|
|
ldap_unicode_t *u,
|
|
ber_len_t n )
|
|
{
|
|
for(; 0 < n; ++u, --n ) {
|
|
*u = uctoupper( *u );
|
|
}
|
|
}
|
|
|
|
char * UTF8normalize(
|
|
struct berval *bv,
|
|
unsigned casefold )
|
|
{
|
|
int i, j, len, clen, outpos, ucsoutlen, outsize, last;
|
|
char *out, *s;
|
|
unsigned long *ucs, *p, *ucsout;
|
|
|
|
static unsigned char mask[] = {
|
|
0, 0x7f, 0x1f, 0x0f, 0x07, 0x03, 0x01 };
|
|
|
|
if ( bv == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
s = bv->bv_val;
|
|
len = bv->bv_len;
|
|
|
|
/* See if the string is pure ASCII so we can shortcut */
|
|
for ( i=0; i<len; i++ ) {
|
|
if ( s[i] & 0x80 ) /* non-ASCII */
|
|
break;
|
|
}
|
|
|
|
/* It's pure ASCII or zero-len */
|
|
if ( i == len ) {
|
|
out = malloc( len + 1 );
|
|
if ( i && !casefold ) {
|
|
strncpy( out, bv->bv_val, len );
|
|
} else {
|
|
for ( j=0; j<i; j++ )
|
|
out[j] = TOUPPER( s[j] );
|
|
}
|
|
out[len] = '\0';
|
|
return out;
|
|
}
|
|
|
|
outsize = len + 7;
|
|
out = (char *) malloc( outsize );
|
|
if ( out == NULL ) {
|
|
return NULL;
|
|
}
|
|
|
|
/* FIXME: Should first check to see if string is already in
|
|
* proper normalized form.
|
|
*/
|
|
|
|
outpos = 0;
|
|
|
|
/* finish off everything up to character before first non-ascii */
|
|
if ( LDAP_UTF8_ISASCII( s ) ) {
|
|
for ( i = 1; (i < len) && LDAP_UTF8_ISASCII(s + i); i++ ) {
|
|
out[outpos++] = casefold ? TOUPPER( s[i-1] ) : s[i-1];
|
|
}
|
|
if ( i == len ) {
|
|
out[outpos++] = casefold ? TOUPPER( s[len - 1] ) : s[len - 1];
|
|
out[outpos] = '\0';
|
|
return out;
|
|
}
|
|
} else {
|
|
i = 0;
|
|
}
|
|
|
|
p = ucs = (long *) malloc( len * sizeof(*ucs) );
|
|
if ( ucs == NULL ) {
|
|
free(out);
|
|
return NULL;
|
|
}
|
|
|
|
/* convert character before first non-ascii to ucs-4 */
|
|
if ( i > 0 ) {
|
|
*p = casefold ? TOUPPER( s[i - 1] ) : s[i - 1];
|
|
p++;
|
|
}
|
|
|
|
/* s[i] is now first non-ascii character */
|
|
for (;;) {
|
|
/* s[i] is non-ascii */
|
|
/* convert everything up to next ascii to ucs-4 */
|
|
while ( i < len ) {
|
|
clen = LDAP_UTF8_CHARLEN( s + i );
|
|
if ( clen == 0 ) {
|
|
free( ucs );
|
|
free( out );
|
|
return NULL;
|
|
}
|
|
if ( clen == 1 ) {
|
|
/* ascii */
|
|
break;
|
|
}
|
|
*p = s[i] & mask[clen];
|
|
i++;
|
|
for( j = 1; j < clen; j++ ) {
|
|
if ( (s[i] & 0xc0) != 0x80 ) {
|
|
free( ucs );
|
|
free( out );
|
|
return NULL;
|
|
}
|
|
*p <<= 6;
|
|
*p |= s[i] & 0x3f;
|
|
i++;
|
|
}
|
|
if ( casefold ) {
|
|
*p = uctoupper( *p );
|
|
}
|
|
p++;
|
|
}
|
|
/* normalize ucs of length p - ucs */
|
|
uccanondecomp( ucs, p - ucs, &ucsout, &ucsoutlen );
|
|
ucsoutlen = uccanoncomp( ucsout, ucsoutlen );
|
|
/* convert ucs to utf-8 and store in out */
|
|
for ( j = 0; j < ucsoutlen; j++ ) {
|
|
/* allocate more space if not enough room for
|
|
6 bytes and terminator */
|
|
if ( outsize - outpos < 7 ) {
|
|
outsize = ucsoutlen - j + outpos + 6;
|
|
out = (char *) realloc( out, outsize );
|
|
if ( out == NULL ) {
|
|
free( ucs );
|
|
return NULL;
|
|
}
|
|
}
|
|
outpos += ldap_x_ucs4_to_utf8( ucsout[j], &out[outpos] );
|
|
}
|
|
|
|
if ( i == len ) {
|
|
break;
|
|
}
|
|
|
|
last = i;
|
|
|
|
/* s[i] is ascii */
|
|
/* finish off everything up to char before next non-ascii */
|
|
for ( i++; (i < len) && LDAP_UTF8_ISASCII(s + i); i++ ) {
|
|
out[outpos++] = casefold ? TOUPPER( s[i-1] ) : s[i-1];
|
|
}
|
|
if ( i == len ) {
|
|
out[outpos++] = casefold ? TOUPPER( s[len - 1] ) : s[len - 1];
|
|
break;
|
|
}
|
|
|
|
/* convert character before next non-ascii to ucs-4 */
|
|
*ucs = casefold ? TOUPPER( s[i - 1] ) : s[i - 1];
|
|
p = ucs + 1;
|
|
}
|
|
free( ucs );
|
|
out[outpos] = '\0';
|
|
return out;
|
|
}
|
|
|
|
/* compare UTF8-strings, optionally ignore casing, string pointers must not be NULL */
|
|
/* slow, should be optimized */
|
|
int UTF8normcmp(
|
|
const char *s1,
|
|
const char *s2,
|
|
unsigned casefold )
|
|
{
|
|
int i, l1, l2, len, ulen, res;
|
|
unsigned long *ucs, *ucsout1, *ucsout2;
|
|
|
|
l1 = strlen( s1 );
|
|
l2 = strlen( s2 );
|
|
|
|
if ( ( l1 == 0 ) || ( l2 == 0 ) ) {
|
|
if ( l1 == l2 ) {
|
|
return 0;
|
|
}
|
|
return *s1 - *s2 > 0 ? 1 : -1;
|
|
}
|
|
|
|
/* See if we can get away with a straight ASCII compare */
|
|
len = (l1 < l2) ? l1 : l2;
|
|
for ( i = 0; i<len; i++ ) {
|
|
/* Is either char non-ASCII? */
|
|
if ((s1[i] & 0x80) || (s2[i] & 0x80))
|
|
break;
|
|
if (casefold) {
|
|
char c1 = TOUPPER(s1[i]);
|
|
char c2 = TOUPPER(s2[i]);
|
|
res = c1 - c2;
|
|
} else {
|
|
res = s1[i] - s2[i];
|
|
}
|
|
if (res)
|
|
return res;
|
|
}
|
|
/* Strings were ASCII, equal up to minlen */
|
|
if (i == len)
|
|
return l1 - l2;
|
|
|
|
/* FIXME: Should first check to see if strings are already in
|
|
* proper normalized form.
|
|
*/
|
|
|
|
ucs = (long *) malloc( ( l1 > l2 ? l1 : l2 ) * sizeof(*ucs) );
|
|
if ( ucs == NULL ) {
|
|
return l1 > l2 ? 1 : -1; /* what to do??? */
|
|
}
|
|
|
|
/*
|
|
* XXYYZ: we convert to ucs4 even though -llunicode
|
|
* expects ucs2 in an unsigned long
|
|
*/
|
|
|
|
/* convert and normalize 1st string */
|
|
for ( i = 0, ulen = 0; i < l1; i += len, ulen++ ) {
|
|
ucs[ulen] = ldap_x_utf8_to_ucs4( s1 + i );
|
|
if ( ucs[ulen] == LDAP_UCS4_INVALID ) {
|
|
free( ucs );
|
|
return -1; /* what to do??? */
|
|
}
|
|
len = LDAP_UTF8_CHARLEN( s1 + i );
|
|
}
|
|
uccanondecomp( ucs, ulen, &ucsout1, &l1 );
|
|
l1 = uccanoncomp( ucsout1, l1 );
|
|
|
|
/* convert and normalize 2nd string */
|
|
for ( i = 0, ulen = 0; i < l2; i += len, ulen++ ) {
|
|
ucs[ulen] = ldap_x_utf8_to_ucs4( s2 + i );
|
|
if ( ucs[ulen] == LDAP_UCS4_INVALID ) {
|
|
free( ucsout1 );
|
|
free( ucs );
|
|
return 1; /* what to do??? */
|
|
}
|
|
len = LDAP_UTF8_CHARLEN( s2 + i );
|
|
}
|
|
uccanondecomp( ucs, ulen, &ucsout2, &l2 );
|
|
l2 = uccanoncomp( ucsout2, l2 );
|
|
|
|
free( ucs );
|
|
|
|
res = casefold
|
|
? ucstrncasecmp( ucsout1, ucsout2, l1 < l2 ? l1 : l2 )
|
|
: ucstrncmp( ucsout1, ucsout2, l1 < l2 ? l1 : l2 );
|
|
free( ucsout1 );
|
|
free( ucsout2 );
|
|
|
|
if ( res != 0 ) {
|
|
return res;
|
|
}
|
|
if ( l1 == l2 ) {
|
|
return 0;
|
|
}
|
|
return l1 > l2 ? 1 : -1;
|
|
}
|