1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
|
/** BEGIN COPYRIGHT BLOCK
* Copyright (C) 2001 Sun Microsystems, Inc. Used by permission.
* Copyright (C) 2005 Red Hat, Inc.
* All rights reserved.
*
* License: GPL (version 3 or any later version).
* See LICENSE for details.
* END COPYRIGHT BLOCK **/
#ifdef HAVE_CONFIG_H
#include <config.h>
#endif
/* value.c - routines for dealing with values */
#include <stdio.h>
#include <string.h>
#include <sys/types.h>
#include "syntax.h"
/*
* Do not use the SDK ldap_utf8isspace directly until it is faster
* than this one.
*/
static int
utf8isspace_fast(char *s)
{
register unsigned char c = *(unsigned char *)s;
if (0x80 & c)
return (ldap_utf8isspace(s));
switch (c) {
case 0x09:
case 0x0A:
case 0x0B:
case 0x0C:
case 0x0D:
case 0x20:
return 1;
default:
break;
}
return 0;
}
/*
** This function is used to normalizes search filter components,
** and attribute values.
**
** jcm: I added the trim_spaces flag since this function
** was incorrectly modifying search filter components. A search
** of the form "cn=a* b*" (note the space) would be wrongly
** normalized into "cn=a*b*", because this function is called
** once for "a" and once for " b".
** richm 20070917 - added integer syntax - note that this implementation
** of integer syntax tries to mimic the old implementation (atol) as much
** as possible - leading spaces are ignored, then the optional hyphen for
** negative numbers, then leading 0s. That is
** " -0000000000001" should normalize to "-1" which is what atol() does
** Also note that this deviates from rfc 4517 INTEGER syntax, but we must
** support legacy clients for the time being
*/
/*
* alt stores the normalized value in case the normalized value is longer
* than the original value. It may happen the value is DN.
*/
void
value_normalize_ext(
char *s,
int syntax,
int trim_spaces,
char **alt)
{
char *head = s;
char *d;
int prevspace, curspace;
if (NULL == alt) {
return;
}
*alt = NULL;
if (NULL == s) {
return;
}
if (!(syntax & SYNTAX_CIS) && !(syntax & SYNTAX_CES)) {
return;
}
if (syntax & SYNTAX_DN) {
char *dest = NULL;
size_t dlen = 0;
int rc = slapi_dn_normalize_case_ext(s, 0, &dest, &dlen);
if (rc > 0) {
*alt = dest;
} else if (rc == 0) { /* normalized in line; not terminated */
*(dest + dlen) = '\0';
}
return;
}
d = s;
if (trim_spaces) {
/* strip leading blanks */
while (utf8isspace_fast(s)) {
LDAP_UTF8INC(s);
}
}
/* for int syntax, look for leading sign, then trim 0s */
/* have to do this after trimming spaces */
if (syntax & SYNTAX_INT) {
int foundsign = 0;
int foundzero = 0;
if (*s == '-') {
foundsign = 1;
LDAP_UTF8INC(s);
}
while (*s && (*s == '0')) {
foundzero = 1;
LDAP_UTF8INC(s);
}
if (foundzero && !*s) { /* value is all zeros */
*d++ = '0'; /* set value to a single zero */
} else if (foundsign && (s > d)) {
/* if there is a hyphen, make sure it is just to the left
of the first significant (i.e. non-zero) digit e.g.
convert -00000001 to -1 */
*d++ = '-';
}
/* s should now point at the first significant digit/char */
}
/* handle value of all spaces - turn into single space */
/* unless space insensitive syntax or int - turn into zero length string */
if (*s == '\0' && s != d) {
if (!(syntax & SYNTAX_SI) && !(syntax & SYNTAX_INT)) {
*d++ = ' ';
}
*d = '\0';
return;
}
prevspace = 0;
while (*s) {
curspace = utf8isspace_fast(s);
/* ignore spaces and '-' in telephone numbers */
if ((syntax & SYNTAX_TEL) && (curspace || *s == '-')) {
LDAP_UTF8INC(s);
continue;
}
/* ignore all spaces if this is a space insensitive value */
if ((syntax & SYNTAX_SI) && curspace) {
LDAP_UTF8INC(s);
continue;
}
/* compress multiple blanks */
if (prevspace && curspace) {
LDAP_UTF8INC(s);
continue;
}
prevspace = curspace;
if (syntax & SYNTAX_CIS) {
int ssz, dsz;
slapi_utf8ToLower((unsigned char *)s, (unsigned char *)d, &ssz, &dsz);
s += ssz;
d += dsz;
} else {
char *np;
int sz;
np = ldap_utf8next(s);
if (np == NULL || np == s)
break;
sz = np - s;
memmove(d, s, sz);
d += sz;
s += sz;
}
}
*d = '\0';
/* strip trailing blanks */
if (prevspace && trim_spaces) {
char *nd;
nd = ldap_utf8prev(d);
while (nd && nd >= head && utf8isspace_fast(nd)) {
d = nd;
nd = ldap_utf8prev(d);
*d = '\0';
}
}
}
void
value_normalize(
char *s __attribute__((unused)),
int syntax __attribute__((unused)),
int trim_spaces __attribute__((unused)))
{
/* deprecated */
}
int
value_cmp(
struct berval *v1,
struct berval *v2,
int syntax,
int normalize)
{
int rc = 0;
struct berval bvcopy1;
struct berval bvcopy2;
char little_buffer[64];
size_t buffer_space = sizeof(little_buffer);
int buffer_offset = 0;
int free_v1 = 0;
int free_v2 = 0;
int v1sign = 1, v2sign = 1; /* default to positive */
char *alt = NULL;
// check NULL values before normalization
if (!v1->bv_val) {
if (v2->bv_val)
rc = -1;
goto done;
}
if (!v2->bv_val) {
rc = 1;
goto done;
}
/* This code used to call malloc up to four times in the copying
* of attributes to be normalized. Now we attempt to keep everything
* on the stack and only malloc if the data is big
*/
if (normalize & 1) {
/* Do we have space in the little buffer ? */
if (v1->bv_len < buffer_space) {
bvcopy1.bv_len = v1->bv_len;
SAFEMEMCPY(&little_buffer[buffer_offset], v1->bv_val, v1->bv_len);
bvcopy1.bv_val = &little_buffer[buffer_offset];
bvcopy1.bv_val[v1->bv_len] = '\0';
v1 = &bvcopy1;
} else {
v1 = ber_bvdup(v1);
free_v1 = 1;
}
value_normalize_ext(v1->bv_val, syntax,
1 /* trim leading blanks */, &alt);
if (alt) {
int inserted = 0;
if (free_v1) {
slapi_ch_free_string(&v1->bv_val);
v1->bv_val = alt;
v1->bv_len = strlen(alt);
inserted = 1;
} else {
if (strlen(alt) < buffer_space) {
v1->bv_len = strlen(alt);
/* Copying to little_buffer */
SAFEMEMCPY(v1->bv_val, alt, v1->bv_len);
*(v1->bv_val + v1->bv_len) = '\0';
} else {
free_v1 = 1;
v1 = (struct berval *)slapi_ch_malloc(sizeof(struct berval));
v1->bv_val = alt;
v1->bv_len = strlen(alt);
inserted = 1;
}
}
if (!inserted) {
slapi_ch_free_string(&alt);
}
}
if (!free_v1) {
buffer_space -= v1->bv_len + 1;
buffer_offset += v1->bv_len + 1;
}
}
if (normalize & 2) {
/* Do we have space in the little buffer ? */
if (v2->bv_len < buffer_space) {
bvcopy2.bv_len = v2->bv_len;
SAFEMEMCPY(&little_buffer[buffer_offset], v2->bv_val, v2->bv_len);
bvcopy2.bv_val = &little_buffer[buffer_offset];
bvcopy2.bv_val[v2->bv_len] = '\0';
v2 = &bvcopy2;
} else {
v2 = ber_bvdup(v2);
free_v2 = 1;
}
value_normalize_ext(v2->bv_val, syntax,
1 /* trim leading blanks */, &alt);
if (alt) {
int inserted = 0;
if (free_v2) {
slapi_ch_free_string(&v2->bv_val);
v2->bv_val = alt;
v2->bv_len = strlen(alt);
inserted = 1;
} else {
if (strlen(alt) < buffer_space) {
v2->bv_len = strlen(alt);
/* Copying to little_buffer */
SAFEMEMCPY(v2->bv_val, alt, v2->bv_len);
*(v2->bv_val + v2->bv_len) = '\0';
} else {
free_v2 = 1;
v2 = (struct berval *)slapi_ch_malloc(sizeof(struct berval));
v2->bv_val = alt;
v2->bv_len = strlen(alt);
inserted = 1;
}
}
if (!inserted) {
slapi_ch_free_string(&alt);
}
}
if (!free_v2) {
buffer_space -= v2->bv_len + 1;
buffer_offset += v2->bv_len + 1;
}
}
if (normalize) {
// check NULL values after normalization
if (!v1->bv_val) {
if (v2->bv_val)
rc = -1;
goto done;
}
if (!v2->bv_val) {
rc = 1;
goto done;
}
}
if (syntax & SYNTAX_INT) {
v1sign = *v1->bv_val != '-';
v2sign = *v2->bv_val != '-';
rc = v1sign - v2sign;
if (rc) { /* one is positive, one is negative */
goto done;
}
/* check magnitude */
/* unfortunately, bv_len cannot be trusted - bv_len is not
updated during or after value_normalize */
rc = (strlen(v1->bv_val) - strlen(v2->bv_val));
if (rc) {
rc = (rc > 0) ? 1 : -1;
if (!v1sign && !v2sign) { /* both negative */
rc = 0 - rc; /* flip it */
}
goto done;
}
}
if (syntax & SYNTAX_CIS) {
rc = slapi_utf8casecmp((unsigned char *)v1->bv_val,
(unsigned char *)v2->bv_val);
} else if (syntax & SYNTAX_CES) {
rc = strcmp(v1->bv_val, v2->bv_val);
} else { /* error - unknown syntax */
slapi_log_err(SLAPI_LOG_PLUGIN, SYNTAX_PLUGIN_SUBSYSTEM,
"value_cmp - invalid syntax [%d]\n", syntax);
}
if ((syntax & SYNTAX_INT) && !v1sign && !v2sign) { /* both negative */
rc = 0 - rc; /* flip it */
}
done:
if ((normalize & 1) && free_v1) {
ber_bvfree(v1);
}
if ((normalize & 2) && free_v2) {
ber_bvfree(v2);
}
return (rc);
}
|