ctdb-daemon: Use ctdb_parse_node_address() in ctdbd
[samba4-gss.git] / lib / ldb / common / attrib_handlers.c
blob2f0b1bf861f20c86c830fe584c53e0714f38ec4e
1 /*
2 ldb database library
4 Copyright (C) Andrew Tridgell 2005
5 Copyright (C) Andrew Bartlett <abartlet@samba.org> 2006-2009
7 ** NOTE! The following LGPL license applies to the ldb
8 ** library. This does NOT imply that all of Samba is released
9 ** under the LGPL
11 This library is free software; you can redistribute it and/or
12 modify it under the terms of the GNU Lesser General Public
13 License as published by the Free Software Foundation; either
14 version 3 of the License, or (at your option) any later version.
16 This library is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
19 Lesser General Public License for more details.
21 You should have received a copy of the GNU Lesser General Public
22 License along with this library; if not, see <http://www.gnu.org/licenses/>.
25 attribute handlers for well known attribute types, selected by syntax OID
26 see rfc2252
29 #include "ldb_private.h"
30 #include "system/locale.h"
31 #include "ldb_handlers.h"
34 default handler that just copies a ldb_val.
36 int ldb_handler_copy(struct ldb_context *ldb, void *mem_ctx,
37 const struct ldb_val *in, struct ldb_val *out)
39 *out = ldb_val_dup(mem_ctx, in);
40 if (in->length > 0 && out->data == NULL) {
41 ldb_oom(ldb);
42 return -1;
44 return 0;
48 a case folding copy handler, removing leading and trailing spaces and
49 multiple internal spaces
51 We exploit the fact that utf8 never uses the space octet except for
52 the space itself
54 int ldb_handler_fold(struct ldb_context *ldb, void *mem_ctx,
55 const struct ldb_val *in, struct ldb_val *out)
57 char *s, *t, *start;
58 bool in_space;
60 if (!in || !out || !(in->data)) {
61 return -1;
64 out->data = (uint8_t *)ldb_casefold(ldb, mem_ctx, (const char *)(in->data), in->length);
65 if (out->data == NULL) {
66 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb_handler_fold: unable to casefold string [%.*s]", (int)in->length, (const char *)in->data);
67 return -1;
70 start = (char *)(out->data);
71 in_space = true;
72 t = start;
73 for (s = start; *s != '\0'; s++) {
74 if (*s == ' ') {
75 if (in_space) {
77 * We already have one (or this is the start)
78 * and we don't want to add more
80 continue;
82 in_space = true;
83 } else {
84 in_space = false;
86 *t = *s;
87 t++;
90 if (in_space && t != start) {
91 /* the loop will have left a single trailing space */
92 t--;
94 *t = '\0';
96 out->length = t - start;
97 return 0;
100 /* length limited conversion of a ldb_val to an int64_t */
101 static int val_to_int64(const struct ldb_val *in, int64_t *v)
103 char *end;
104 char buf[64];
106 /* make sure we don't read past the end of the data */
107 if (in->length > sizeof(buf)-1) {
108 return LDB_ERR_INVALID_ATTRIBUTE_SYNTAX;
110 strncpy(buf, (char *)in->data, in->length);
111 buf[in->length] = 0;
113 *v = (int64_t) strtoll(buf, &end, 0);
114 if (*end != 0) {
115 return LDB_ERR_INVALID_ATTRIBUTE_SYNTAX;
117 return LDB_SUCCESS;
122 canonicalise a ldap Integer
123 rfc2252 specifies it should be in decimal form
125 static int ldb_canonicalise_Integer(struct ldb_context *ldb, void *mem_ctx,
126 const struct ldb_val *in, struct ldb_val *out)
128 int64_t i;
129 int ret;
131 ret = val_to_int64(in, &i);
132 if (ret != LDB_SUCCESS) {
133 return ret;
135 out->data = (uint8_t *) talloc_asprintf(mem_ctx, "%lld", (long long)i);
136 if (out->data == NULL) {
137 ldb_oom(ldb);
138 return LDB_ERR_OPERATIONS_ERROR;
140 out->length = strlen((char *)out->data);
141 return 0;
145 * Lexicographically ordered format for a ldap Integer
147 * [ INT64_MIN ... -3, -2, -1 | 0 | +1, +2, +3 ... INT64_MAX ]
148 * n o p
150 * For human readability sake, we continue to format the key as a string
151 * (like the canonicalize) rather than store as a fixed binary representation.
153 * In order to sort the integers in the correct string order, there are three
154 * techniques we use:
156 * 1. Zero padding
157 * 2. Negative integer inversion
158 * 3. 1-byte prefixes: 'n' < 'o' < 'p'
160 * 1. To have a fixed-width representation so that 10 sorts after 2 rather than
161 * after 1, we zero pad, like this 4-byte width example:
163 * 0001, 0002, 0010
165 * INT64_MAX = 2^63 - 1 = 9223372036854775807 (19 characters long)
167 * Meaning we need to pad to 19 characters.
169 * 2. This works for positive integers, but negative integers will still be
170 * sorted backwards, for example:
172 * -9223372036854775808 ..., -0000000000000000002, -0000000000000000001
173 * INT64_MIN -2 -1
175 * gets sorted based on string as:
177 * -0000000000000000001, -0000000000000000002, ... -9223372036854775808
179 * In order to fix this, we invert the negative integer range, so that they
180 * get sorted the same way as positive numbers. INT64_MIN becomes the lowest
181 * possible non-negative number (zero), and -1 becomes the highest (INT64_MAX).
183 * The actual conversion applied to negative number 'x' is:
184 * INT64_MAX - abs(x) + 1
185 * (The +1 is needed because abs(INT64_MIN) is one greater than INT64_MAX)
187 * 3. Finally, we now have two different numbers that map to the same key, e.g.
188 * INT64_MIN maps to -0000000000000000000 and zero maps to 0000000000000000000.
189 * In order to avoid confusion, we give every number a prefix representing its
190 * sign: 'n' for negative numbers, 'o' for zero, and 'p' for positive. (Note
191 * that '+' and '-' weren't used because they sort the wrong way).
193 * The result is a range of key values that look like this:
195 * n0000000000000000000, ... n9223372036854775807,
196 * INT64_MIN -1
198 * o0000000000000000000,
199 * ZERO
201 * p0000000000000000001, ... p9223372036854775807
202 * +1 INT64_MAX
204 static int ldb_index_format_Integer(struct ldb_context *ldb,
205 void *mem_ctx,
206 const struct ldb_val *in,
207 struct ldb_val *out)
209 int64_t i;
210 int ret;
211 char prefix;
212 size_t len;
214 ret = val_to_int64(in, &i);
215 if (ret != LDB_SUCCESS) {
216 return ret;
219 if (i < 0) {
221 * i is negative, so this is subtraction rather than
222 * wrap-around.
224 prefix = 'n';
225 i = INT64_MAX + i + 1;
226 } else if (i > 0) {
227 prefix = 'p';
228 } else {
229 prefix = 'o';
232 out->data = (uint8_t *) talloc_asprintf(mem_ctx, "%c%019lld", prefix, (long long)i);
233 if (out->data == NULL) {
234 ldb_oom(ldb);
235 return LDB_ERR_OPERATIONS_ERROR;
238 len = talloc_array_length(out->data) - 1;
239 if (len != 20) {
240 ldb_debug(ldb, LDB_DEBUG_ERROR,
241 __location__ ": expected index format str %s to"
242 " have length 20 but got %zu",
243 (char*)out->data, len);
244 return LDB_ERR_OPERATIONS_ERROR;
247 out->length = 20;
248 return 0;
252 compare two Integers
254 static int ldb_comparison_Integer(struct ldb_context *ldb, void *mem_ctx,
255 const struct ldb_val *v1, const struct ldb_val *v2)
257 int64_t i1=0, i2=0;
258 val_to_int64(v1, &i1);
259 val_to_int64(v2, &i2);
260 if (i1 == i2) return 0;
261 return i1 > i2? 1 : -1;
265 canonicalise a ldap Boolean
266 rfc2252 specifies it should be either "TRUE" or "FALSE"
268 static int ldb_canonicalise_Boolean(struct ldb_context *ldb, void *mem_ctx,
269 const struct ldb_val *in, struct ldb_val *out)
271 if (in->length >= 4 && strncasecmp((char *)in->data, "TRUE", in->length) == 0) {
272 out->data = (uint8_t *)talloc_strdup(mem_ctx, "TRUE");
273 out->length = 4;
274 } else if (in->length >= 5 && strncasecmp((char *)in->data, "FALSE", in->length) == 0) {
275 out->data = (uint8_t *)talloc_strdup(mem_ctx, "FALSE");
276 out->length = 5;
277 } else {
278 return -1;
280 return 0;
284 * compare two Booleans.
286 * According to RFC4517 4.2.2, "the booleanMatch rule is an equality matching
287 * rule", meaning it isn't used for ordering.
289 * However, it seems conceivable that Samba could be coerced into sorting on a
290 * field with Boolean syntax, so we might as well have consistent behaviour in
291 * that case.
293 * The most probable values are {"FALSE", 5} and {"TRUE", 4}. To save time we
294 * compare first by length, which makes FALSE > TRUE. This is somewhat
295 * contrary to convention, but is how Samba has worked forever.
297 * If somehow we are comparing incompletely normalised values where the length
298 * is the same (for example {"false", 5} and {"TRUE\0", 5}), the length is the
299 * same, and we fall back to a strncasecmp. In this case, since "FALSE" is
300 * alphabetically lower, we swap the order, so that "TRUE\0" again comes
301 * before "FALSE".
303 * ldb_canonicalise_Boolean (just above) gives us a clue as to what we might
304 * expect to cope with by way of invalid values.
306 static int ldb_comparison_Boolean(struct ldb_context *ldb, void *mem_ctx,
307 const struct ldb_val *v1, const struct ldb_val *v2)
309 if (v1->length != v2->length) {
310 return NUMERIC_CMP(v2->length, v1->length);
312 /* reversed, see long comment above */
313 return strncasecmp((char *)v2->data, (char *)v1->data, v1->length);
318 compare two binary blobs
320 int ldb_comparison_binary(struct ldb_context *ldb, void *mem_ctx,
321 const struct ldb_val *v1, const struct ldb_val *v2)
323 if (v1->length != v2->length) {
324 return NUMERIC_CMP(v1->length, v2->length);
326 return memcmp(v1->data, v2->data, v1->length);
330 * ldb_comparison_fold is a schema syntax comparison_fn for utf-8 strings that
331 * collapse multiple spaces into one (e.g. "Directory String" syntax).
333 * The default comparison function only performs ASCII case-folding, and only
334 * collapses multiple spaces, not tabs and other whitespace (contrary to
335 * RFC4518). To change the comparison function (as Samba does), use
336 * ldb_set_utf8_functions().
338 int ldb_comparison_fold(struct ldb_context *ldb, void *mem_ctx,
339 const struct ldb_val *v1, const struct ldb_val *v2)
341 return ldb->utf8_fns.casecmp(ldb->utf8_fns.context, v1, v2);
346 canonicalise a attribute in DN format
348 static int ldb_canonicalise_dn(struct ldb_context *ldb, void *mem_ctx,
349 const struct ldb_val *in, struct ldb_val *out)
351 struct ldb_dn *dn;
352 int ret = -1;
354 out->length = 0;
355 out->data = NULL;
357 dn = ldb_dn_from_ldb_val(mem_ctx, ldb, in);
358 if ( ! ldb_dn_validate(dn)) {
359 return LDB_ERR_INVALID_DN_SYNTAX;
362 out->data = (uint8_t *)ldb_dn_alloc_casefold(mem_ctx, dn);
363 if (out->data == NULL) {
364 goto done;
366 out->length = strlen((char *)out->data);
368 ret = 0;
370 done:
371 talloc_free(dn);
373 return ret;
377 compare two dns
379 static int ldb_comparison_dn(struct ldb_context *ldb, void *mem_ctx,
380 const struct ldb_val *v1, const struct ldb_val *v2)
382 struct ldb_dn *dn1 = NULL, *dn2 = NULL;
383 int ret;
385 dn1 = ldb_dn_from_ldb_val(mem_ctx, ldb, v1);
386 if ( ! ldb_dn_validate(dn1)) return -1;
388 dn2 = ldb_dn_from_ldb_val(mem_ctx, ldb, v2);
389 if ( ! ldb_dn_validate(dn2)) {
390 talloc_free(dn1);
391 return -1;
394 ret = ldb_dn_compare(dn1, dn2);
396 talloc_free(dn1);
397 talloc_free(dn2);
398 return ret;
402 compare two utc time values. 1 second resolution
404 static int ldb_comparison_utctime(struct ldb_context *ldb, void *mem_ctx,
405 const struct ldb_val *v1, const struct ldb_val *v2)
407 time_t t1=0, t2=0;
408 ldb_val_to_time(v1, &t1);
409 ldb_val_to_time(v2, &t2);
410 if (t1 == t2) return 0;
411 return t1 > t2? 1 : -1;
415 canonicalise a utc time
417 static int ldb_canonicalise_utctime(struct ldb_context *ldb, void *mem_ctx,
418 const struct ldb_val *in, struct ldb_val *out)
420 time_t t;
421 int ret;
422 ret = ldb_val_to_time(in, &t);
423 if (ret != LDB_SUCCESS) {
424 return ret;
426 out->data = (uint8_t *)ldb_timestring_utc(mem_ctx, t);
427 if (out->data == NULL) {
428 ldb_oom(ldb);
429 return LDB_ERR_OPERATIONS_ERROR;
431 out->length = strlen((char *)out->data);
432 return 0;
436 canonicalise a generalized time
438 static int ldb_canonicalise_generalizedtime(struct ldb_context *ldb, void *mem_ctx,
439 const struct ldb_val *in, struct ldb_val *out)
441 time_t t;
442 int ret;
443 ret = ldb_val_to_time(in, &t);
444 if (ret != LDB_SUCCESS) {
445 return ret;
447 out->data = (uint8_t *)ldb_timestring(mem_ctx, t);
448 if (out->data == NULL) {
449 ldb_oom(ldb);
450 return LDB_ERR_OPERATIONS_ERROR;
452 out->length = strlen((char *)out->data);
453 return 0;
457 table of standard attribute handlers
459 static const struct ldb_schema_syntax ldb_standard_syntaxes[] = {
461 .name = LDB_SYNTAX_INTEGER,
462 .ldif_read_fn = ldb_handler_copy,
463 .ldif_write_fn = ldb_handler_copy,
464 .canonicalise_fn = ldb_canonicalise_Integer,
465 .comparison_fn = ldb_comparison_Integer
468 .name = LDB_SYNTAX_ORDERED_INTEGER,
469 .ldif_read_fn = ldb_handler_copy,
470 .ldif_write_fn = ldb_handler_copy,
471 .canonicalise_fn = ldb_canonicalise_Integer,
472 .index_format_fn = ldb_index_format_Integer,
473 .comparison_fn = ldb_comparison_Integer
476 .name = LDB_SYNTAX_OCTET_STRING,
477 .ldif_read_fn = ldb_handler_copy,
478 .ldif_write_fn = ldb_handler_copy,
479 .canonicalise_fn = ldb_handler_copy,
480 .comparison_fn = ldb_comparison_binary
483 .name = LDB_SYNTAX_DIRECTORY_STRING,
484 .ldif_read_fn = ldb_handler_copy,
485 .ldif_write_fn = ldb_handler_copy,
486 .canonicalise_fn = ldb_handler_fold,
487 .comparison_fn = ldb_comparison_fold
490 .name = LDB_SYNTAX_DN,
491 .ldif_read_fn = ldb_handler_copy,
492 .ldif_write_fn = ldb_handler_copy,
493 .canonicalise_fn = ldb_canonicalise_dn,
494 .comparison_fn = ldb_comparison_dn
497 .name = LDB_SYNTAX_OBJECTCLASS,
498 .ldif_read_fn = ldb_handler_copy,
499 .ldif_write_fn = ldb_handler_copy,
500 .canonicalise_fn = ldb_handler_fold,
501 .comparison_fn = ldb_comparison_fold
504 .name = LDB_SYNTAX_UTC_TIME,
505 .ldif_read_fn = ldb_handler_copy,
506 .ldif_write_fn = ldb_handler_copy,
507 .canonicalise_fn = ldb_canonicalise_utctime,
508 .comparison_fn = ldb_comparison_utctime
511 .name = LDB_SYNTAX_GENERALIZED_TIME,
512 .ldif_read_fn = ldb_handler_copy,
513 .ldif_write_fn = ldb_handler_copy,
514 .canonicalise_fn = ldb_canonicalise_generalizedtime,
515 .comparison_fn = ldb_comparison_utctime
518 .name = LDB_SYNTAX_BOOLEAN,
519 .ldif_read_fn = ldb_handler_copy,
520 .ldif_write_fn = ldb_handler_copy,
521 .canonicalise_fn = ldb_canonicalise_Boolean,
522 .comparison_fn = ldb_comparison_Boolean
528 return the attribute handlers for a given syntax name
530 const struct ldb_schema_syntax *ldb_standard_syntax_by_name(struct ldb_context *ldb,
531 const char *syntax)
533 unsigned int i;
534 unsigned num_handlers = sizeof(ldb_standard_syntaxes)/sizeof(ldb_standard_syntaxes[0]);
535 /* TODO: should be replaced with a binary search */
536 for (i=0;i<num_handlers;i++) {
537 if (strcmp(ldb_standard_syntaxes[i].name, syntax) == 0) {
538 return &ldb_standard_syntaxes[i];
541 return NULL;
544 int ldb_any_comparison(struct ldb_context *ldb, void *mem_ctx,
545 ldb_attr_handler_t canonicalise_fn,
546 const struct ldb_val *v1,
547 const struct ldb_val *v2)
549 int ret, ret1, ret2;
550 struct ldb_val v1_canon, v2_canon;
551 TALLOC_CTX *tmp_ctx = talloc_new(mem_ctx);
553 /* I could try and bail if tmp_ctx was NULL, but what return
554 * value would I use?
556 * It seems easier to continue on the NULL context
558 ret1 = canonicalise_fn(ldb, tmp_ctx, v1, &v1_canon);
559 ret2 = canonicalise_fn(ldb, tmp_ctx, v2, &v2_canon);
561 if (ret1 == LDB_SUCCESS && ret2 == LDB_SUCCESS) {
562 ret = ldb_comparison_binary(ldb, mem_ctx, &v1_canon, &v2_canon);
563 } else {
564 ret = ldb_comparison_binary(ldb, mem_ctx, v1, v2);
566 talloc_free(tmp_ctx);
567 return ret;