diff options
Diffstat (limited to 'ldb/ldb_tdb/ldb_index.c')
| -rw-r--r-- | ldb/ldb_tdb/ldb_index.c | 1586 |
1 files changed, 0 insertions, 1586 deletions
diff --git a/ldb/ldb_tdb/ldb_index.c b/ldb/ldb_tdb/ldb_index.c deleted file mode 100644 index c4c23022f..000000000 --- a/ldb/ldb_tdb/ldb_index.c +++ /dev/null @@ -1,1586 +0,0 @@ -/* - ldb database library - - Copyright (C) Andrew Tridgell 2004 - - ** NOTE! The following LGPL license applies to the ldb - ** library. This does NOT imply that all of Samba is released - ** under the LGPL - - This library is free software; you can redistribute it and/or - modify it under the terms of the GNU Lesser General Public - License as published by the Free Software Foundation; either - version 3 of the License, or (at your option) any later version. - - This library is distributed in the hope that it will be useful, - but WITHOUT ANY WARRANTY; without even the implied warranty of - MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU - Lesser General Public License for more details. - - You should have received a copy of the GNU Lesser General Public - License along with this library; if not, see <http://www.gnu.org/licenses/>. -*/ - -/* - * Name: ldb - * - * Component: ldb tdb backend - indexing - * - * Description: indexing routines for ldb tdb backend - * - * Author: Andrew Tridgell - */ - -#include "ldb_includes.h" - -#include "ldb_tdb.h" - -/* - the idxptr code is a bit unusual. The way it works is to replace - @IDX elements in records during a transaction with @IDXPTR - elements. The @IDXPTR elements don't contain the actual index entry - values, but contain a pointer to a linked list of values. - - This means we are storing pointers in a database, which is normally - not allowed, but in this case we are storing them only for the - duration of a transaction, and re-writing them into the normal @IDX - format at the end of the transaction. That means no other processes - are ever exposed to the @IDXPTR values. - - The advantage is that the linked list doesn't cause huge - fragmentation during a transaction. Without the @IDXPTR method we - often ended up with a ldb that was between 10x and 100x larger then - it needs to be due to massive fragmentation caused by re-writing - @INDEX records many times during indexing. - */ -struct ldb_index_pointer { - struct ldb_index_pointer *next, *prev; - struct ldb_val value; -}; - -struct ltdb_idxptr { - int num_dns; - const char **dn_list; - bool repack; -}; - -/* - add to the list of DNs that need to be fixed on transaction end - */ -static int ltdb_idxptr_add(struct ldb_module *module, const struct ldb_message *msg) -{ - struct ltdb_private *ltdb = - talloc_get_type(module->private_data, struct ltdb_private); - ltdb->idxptr->dn_list = talloc_realloc(ltdb->idxptr, ltdb->idxptr->dn_list, - const char *, ltdb->idxptr->num_dns+1); - if (ltdb->idxptr->dn_list == NULL) { - ltdb->idxptr->num_dns = 0; - return LDB_ERR_OPERATIONS_ERROR; - } - ltdb->idxptr->dn_list[ltdb->idxptr->num_dns] = - talloc_strdup(ltdb->idxptr->dn_list, ldb_dn_get_linearized(msg->dn)); - if (ltdb->idxptr->dn_list[ltdb->idxptr->num_dns] == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - ltdb->idxptr->num_dns++; - return LDB_SUCCESS; -} - -/* free an idxptr record */ -static int ltdb_free_idxptr(struct ldb_module *module, struct ldb_message_element *el) -{ - struct ldb_val val; - struct ldb_index_pointer *ptr; - - if (el->num_values != 1) { - return LDB_ERR_OPERATIONS_ERROR; - } - - val = el->values[0]; - if (val.length != sizeof(void *)) { - return LDB_ERR_OPERATIONS_ERROR; - } - - ptr = *(struct ldb_index_pointer **)val.data; - if (talloc_get_type(ptr, struct ldb_index_pointer) != ptr) { - return LDB_ERR_OPERATIONS_ERROR; - } - - while (ptr) { - struct ldb_index_pointer *tmp = ptr; - DLIST_REMOVE(ptr, ptr); - talloc_free(tmp); - } - - return LDB_SUCCESS; -} - - -/* convert from the IDXPTR format to a ldb_message_element format */ -static int ltdb_convert_from_idxptr(struct ldb_module *module, struct ldb_message_element *el) -{ - struct ldb_val val; - struct ldb_index_pointer *ptr, *tmp; - int i; - struct ldb_val *val2; - - if (el->num_values != 1) { - return LDB_ERR_OPERATIONS_ERROR; - } - - val = el->values[0]; - if (val.length != sizeof(void *)) { - return LDB_ERR_OPERATIONS_ERROR; - } - - ptr = *(struct ldb_index_pointer **)val.data; - if (talloc_get_type(ptr, struct ldb_index_pointer) != ptr) { - return LDB_ERR_OPERATIONS_ERROR; - } - - /* count the length of the list */ - for (i=0, tmp = ptr; tmp; tmp=tmp->next) { - i++; - } - - /* allocate the new values array */ - val2 = talloc_realloc(NULL, el->values, struct ldb_val, i); - if (val2 == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - el->values = val2; - el->num_values = i; - - /* populate the values array */ - for (i=0, tmp = ptr; tmp; tmp=tmp->next, i++) { - el->values[i].length = tmp->value.length; - /* we need to over-allocate here as there are still some places - in ldb that rely on null termination. */ - el->values[i].data = talloc_size(el->values, tmp->value.length+1); - if (el->values[i].data == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - memcpy(el->values[i].data, tmp->value.data, tmp->value.length); - el->values[i].data[tmp->value.length] = 0; - } - - /* update the name */ - el->name = LTDB_IDX; - - return LDB_SUCCESS; -} - - -/* convert to the IDXPTR format from a ldb_message_element format */ -static int ltdb_convert_to_idxptr(struct ldb_module *module, struct ldb_message_element *el) -{ - struct ldb_index_pointer *ptr, *tmp; - int i; - struct ldb_val *val2; - struct ltdb_private *ltdb = - talloc_get_type(module->private_data, struct ltdb_private); - - ptr = NULL; - - for (i=0;i<el->num_values;i++) { - tmp = talloc(ltdb->idxptr, struct ldb_index_pointer); - if (tmp == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - tmp->value = el->values[i]; - tmp->value.data = talloc_memdup(tmp, tmp->value.data, tmp->value.length); - if (tmp->value.data == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - DLIST_ADD(ptr, tmp); - } - - /* allocate the new values array */ - val2 = talloc_realloc(NULL, el->values, struct ldb_val, 1); - if (val2 == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - el->values = val2; - el->num_values = 1; - - el->values[0].data = talloc_memdup(el->values, &ptr, sizeof(ptr)); - el->values[0].length = sizeof(ptr); - - /* update the name */ - el->name = LTDB_IDXPTR; - - return LDB_SUCCESS; -} - - -/* enable the idxptr mode when transactions start */ -int ltdb_index_transaction_start(struct ldb_module *module) -{ - struct ltdb_private *ltdb = - talloc_get_type(module->private_data, struct ltdb_private); - ltdb->idxptr = talloc_zero(module, struct ltdb_idxptr); - return LDB_SUCCESS; -} - -/* - a wrapper around ltdb_search_dn1() which translates pointer based index records - and maps them into normal ldb message structures - */ -static int ltdb_search_dn1_index(struct ldb_module *module, - struct ldb_dn *dn, struct ldb_message *msg) -{ - int ret, i; - ret = ltdb_search_dn1(module, dn, msg); - if (ret != LDB_SUCCESS) { - return ret; - } - - /* if this isn't a @INDEX record then don't munge it */ - if (strncmp(ldb_dn_get_linearized(msg->dn), LTDB_INDEX ":", strlen(LTDB_INDEX) + 1) != 0) { - return LDB_ERR_OPERATIONS_ERROR; - } - - for (i=0;i<msg->num_elements;i++) { - struct ldb_message_element *el = &msg->elements[i]; - if (strcmp(el->name, LTDB_IDXPTR) == 0) { - ret = ltdb_convert_from_idxptr(module, el); - if (ret != LDB_SUCCESS) { - return ret; - } - } - } - - return ret; -} - - - -/* - fixup the idxptr for one DN - */ -static int ltdb_idxptr_fix_dn(struct ldb_module *module, const char *strdn) -{ - struct ldb_dn *dn; - struct ldb_message *msg = ldb_msg_new(module); - int ret; - - dn = ldb_dn_new(msg, module->ldb, strdn); - if (ltdb_search_dn1_index(module, dn, msg) == LDB_SUCCESS) { - ret = ltdb_store(module, msg, TDB_REPLACE); - } - talloc_free(msg); - return ret; -} - -/* cleanup the idxptr mode when transaction commits */ -int ltdb_index_transaction_commit(struct ldb_module *module) -{ - int i; - struct ltdb_private *ltdb = - talloc_get_type(module->private_data, struct ltdb_private); - - /* fix all the DNs that we have modified */ - if (ltdb->idxptr) { - for (i=0;i<ltdb->idxptr->num_dns;i++) { - ltdb_idxptr_fix_dn(module, ltdb->idxptr->dn_list[i]); - } - - if (ltdb->idxptr->repack) { - tdb_repack(ltdb->tdb); - } - } - - talloc_free(ltdb->idxptr); - ltdb->idxptr = NULL; - return LDB_SUCCESS; -} - -/* cleanup the idxptr mode when transaction cancels */ -int ltdb_index_transaction_cancel(struct ldb_module *module) -{ - struct ltdb_private *ltdb = - talloc_get_type(module->private_data, struct ltdb_private); - talloc_free(ltdb->idxptr); - ltdb->idxptr = NULL; - return LDB_SUCCESS; -} - - - -/* a wrapper around ltdb_store() for the index code which - stores in IDXPTR format when idxptr mode is enabled - - WARNING: This modifies the msg which is passed in -*/ -int ltdb_store_idxptr(struct ldb_module *module, const struct ldb_message *msg, int flgs) -{ - struct ltdb_private *ltdb = - talloc_get_type(module->private_data, struct ltdb_private); - int ret; - - if (ltdb->idxptr) { - int i; - struct ldb_message *msg2 = ldb_msg_new(module); - - /* free any old pointer */ - ret = ltdb_search_dn1(module, msg->dn, msg2); - if (ret == 0) { - for (i=0;i<msg2->num_elements;i++) { - struct ldb_message_element *el = &msg2->elements[i]; - if (strcmp(el->name, LTDB_IDXPTR) == 0) { - ret = ltdb_free_idxptr(module, el); - if (ret != LDB_SUCCESS) { - return ret; - } - } - } - } - talloc_free(msg2); - - for (i=0;i<msg->num_elements;i++) { - struct ldb_message_element *el = &msg->elements[i]; - if (strcmp(el->name, LTDB_IDX) == 0) { - ret = ltdb_convert_to_idxptr(module, el); - if (ret != LDB_SUCCESS) { - return ret; - } - } - } - - if (ltdb_idxptr_add(module, msg) != 0) { - return LDB_ERR_OPERATIONS_ERROR; - } - } - - ret = ltdb_store(module, msg, flgs); - return ret; -} - - -/* - find an element in a list, using the given comparison function and - assuming that the list is already sorted using comp_fn - - return -1 if not found, or the index of the first occurance of needle if found -*/ -static int ldb_list_find(const void *needle, - const void *base, size_t nmemb, size_t size, - comparison_fn_t comp_fn) -{ - const char *base_p = (const char *)base; - size_t min_i, max_i, test_i; - - if (nmemb == 0) { - return -1; - } - - min_i = 0; - max_i = nmemb-1; - - while (min_i < max_i) { - int r; - - test_i = (min_i + max_i) / 2; - /* the following cast looks strange, but is - correct. The key to understanding it is that base_p - is a pointer to an array of pointers, so we have to - dereference it after casting to void **. The strange - const in the middle gives us the right type of pointer - after the dereference (tridge) */ - r = comp_fn(needle, *(void * const *)(base_p + (size * test_i))); - if (r == 0) { - /* scan back for first element */ - while (test_i > 0 && - comp_fn(needle, *(void * const *)(base_p + (size * (test_i-1)))) == 0) { - test_i--; - } - return test_i; - } - if (r < 0) { - if (test_i == 0) { - return -1; - } - max_i = test_i - 1; - } - if (r > 0) { - min_i = test_i + 1; - } - } - - if (comp_fn(needle, *(void * const *)(base_p + (size * min_i))) == 0) { - return min_i; - } - - return -1; -} - -struct dn_list { - unsigned int count; - char **dn; -}; - -/* - return the dn key to be used for an index - caller frees -*/ -static struct ldb_dn *ltdb_index_key(struct ldb_context *ldb, - const char *attr, const struct ldb_val *value) -{ - struct ldb_dn *ret; - struct ldb_val v; - const struct ldb_schema_attribute *a; - char *attr_folded; - int r; - - attr_folded = ldb_attr_casefold(ldb, attr); - if (!attr_folded) { - return NULL; - } - - a = ldb_schema_attribute_by_name(ldb, attr); - r = a->syntax->canonicalise_fn(ldb, ldb, value, &v); - if (r != LDB_SUCCESS) { - const char *errstr = ldb_errstring(ldb); - /* canonicalisation can be refused. For example, - a attribute that takes wildcards will refuse to canonicalise - if the value contains a wildcard */ - ldb_asprintf_errstring(ldb, "Failed to create index key for attribute '%s':%s%s%s", - attr, ldb_strerror(r), (errstr?":":""), (errstr?errstr:"")); - talloc_free(attr_folded); - return NULL; - } - if (ldb_should_b64_encode(&v)) { - char *vstr = ldb_base64_encode(ldb, (char *)v.data, v.length); - if (!vstr) return NULL; - ret = ldb_dn_new_fmt(ldb, ldb, "%s:%s::%s", LTDB_INDEX, attr_folded, vstr); - talloc_free(vstr); - } else { - ret = ldb_dn_new_fmt(ldb, ldb, "%s:%s:%.*s", LTDB_INDEX, attr_folded, (int)v.length, (char *)v.data); - } - - if (v.data != value->data) { - talloc_free(v.data); - } - talloc_free(attr_folded); - - return ret; -} - -/* - see if a attribute value is in the list of indexed attributes -*/ -static int ldb_msg_find_idx(const struct ldb_message *msg, const char *attr, - unsigned int *v_idx, const char *key) -{ - unsigned int i, j; - for (i=0;i<msg->num_elements;i++) { - if (ldb_attr_cmp(msg->elements[i].name, key) == 0) { - const struct ldb_message_element *el = &msg->elements[i]; - - if (attr == NULL) { - /* in this case we are just looking to see if key is present, - we are not spearching for a specific index */ - return 0; - } - - for (j=0;j<el->num_values;j++) { - if (ldb_attr_cmp((char *)el->values[j].data, attr) == 0) { - if (v_idx) { - *v_idx = j; - } - return i; - } - } - } - } - return -1; -} - -/* used in sorting dn lists */ -static int list_cmp(const char **s1, const char **s2) -{ - return strcmp(*s1, *s2); -} - -/* - return a list of dn's that might match a simple indexed search or - */ -static int ltdb_index_dn_simple(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list) -{ - struct ldb_context *ldb = module->ldb; - struct ldb_dn *dn; - int ret; - unsigned int i, j; - struct ldb_message *msg; - - list->count = 0; - list->dn = NULL; - - /* if the attribute isn't in the list of indexed attributes then - this node needs a full search */ - if (ldb_msg_find_idx(index_list, tree->u.equality.attr, NULL, LTDB_IDXATTR) == -1) { - return LDB_ERR_OPERATIONS_ERROR; - } - - /* the attribute is indexed. Pull the list of DNs that match the - search criterion */ - dn = ltdb_index_key(ldb, tree->u.equality.attr, &tree->u.equality.value); - if (!dn) return LDB_ERR_OPERATIONS_ERROR; - - msg = talloc(list, struct ldb_message); - if (msg == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = ltdb_search_dn1_index(module, dn, msg); - talloc_free(dn); - if (ret != LDB_SUCCESS) { - return ret; - } - - for (i=0;i<msg->num_elements;i++) { - struct ldb_message_element *el; - - if (strcmp(msg->elements[i].name, LTDB_IDX) != 0) { - continue; - } - - el = &msg->elements[i]; - - list->dn = talloc_array(list, char *, el->num_values); - if (!list->dn) { - talloc_free(msg); - return LDB_ERR_OPERATIONS_ERROR; - } - - for (j=0;j<el->num_values;j++) { - list->dn[list->count] = - talloc_strdup(list->dn, (char *)el->values[j].data); - if (!list->dn[list->count]) { - talloc_free(msg); - return LDB_ERR_OPERATIONS_ERROR; - } - list->count++; - } - } - - talloc_free(msg); - - if (list->count > 1) { - qsort(list->dn, list->count, sizeof(char *), (comparison_fn_t) list_cmp); - } - - return LDB_SUCCESS; -} - - -static int list_union(struct ldb_context *, struct dn_list *, const struct dn_list *); - -/* - return a list of dn's that might match a leaf indexed search - */ -static int ltdb_index_dn_leaf(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list) -{ - if (ldb_attr_dn(tree->u.equality.attr) == 0) { - list->dn = talloc_array(list, char *, 1); - if (list->dn == NULL) { - ldb_oom(module->ldb); - return LDB_ERR_OPERATIONS_ERROR; - } - list->dn[0] = talloc_strdup(list->dn, (char *)tree->u.equality.value.data); - if (list->dn[0] == NULL) { - ldb_oom(module->ldb); - return LDB_ERR_OPERATIONS_ERROR; - } - list->count = 1; - return LDB_SUCCESS; - } - return ltdb_index_dn_simple(module, tree, index_list, list); -} - - -/* - list intersection - list = list & list2 - relies on the lists being sorted -*/ -static int list_intersect(struct ldb_context *ldb, - struct dn_list *list, const struct dn_list *list2) -{ - struct dn_list *list3; - unsigned int i; - - if (list->count == 0 || list2->count == 0) { - /* 0 & X == 0 */ - return LDB_ERR_NO_SUCH_OBJECT; - } - - list3 = talloc(ldb, struct dn_list); - if (list3 == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - list3->dn = talloc_array(list3, char *, list->count); - if (!list3->dn) { - talloc_free(list3); - return LDB_ERR_OPERATIONS_ERROR; - } - list3->count = 0; - - for (i=0;i<list->count;i++) { - if (ldb_list_find(list->dn[i], list2->dn, list2->count, - sizeof(char *), (comparison_fn_t)strcmp) != -1) { - list3->dn[list3->count] = talloc_move(list3->dn, &list->dn[i]); - list3->count++; - } else { - talloc_free(list->dn[i]); - } - } - - talloc_free(list->dn); - list->dn = talloc_move(list, &list3->dn); - list->count = list3->count; - talloc_free(list3); - - return LDB_ERR_NO_SUCH_OBJECT; -} - - -/* - list union - list = list | list2 - relies on the lists being sorted -*/ -static int list_union(struct ldb_context *ldb, - struct dn_list *list, const struct dn_list *list2) -{ - unsigned int i; - char **d; - unsigned int count = list->count; - - if (list->count == 0 && list2->count == 0) { - /* 0 | 0 == 0 */ - return LDB_ERR_NO_SUCH_OBJECT; - } - - d = talloc_realloc(list, list->dn, char *, list->count + list2->count); - if (!d) { - return LDB_ERR_OPERATIONS_ERROR; - } - list->dn = d; - - for (i=0;i<list2->count;i++) { - if (ldb_list_find(list2->dn[i], list->dn, count, - sizeof(char *), (comparison_fn_t)strcmp) == -1) { - list->dn[list->count] = talloc_strdup(list->dn, list2->dn[i]); - if (!list->dn[list->count]) { - return LDB_ERR_OPERATIONS_ERROR; - } - list->count++; - } - } - - if (list->count != count) { - qsort(list->dn, list->count, sizeof(char *), (comparison_fn_t)list_cmp); - } - - return LDB_ERR_NO_SUCH_OBJECT; -} - -static int ltdb_index_dn(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list); - - -/* - OR two index results - */ -static int ltdb_index_dn_or(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list) -{ - struct ldb_context *ldb = module->ldb; - unsigned int i; - int ret; - - ret = LDB_ERR_OPERATIONS_ERROR; - list->dn = NULL; - list->count = 0; - - for (i=0;i<tree->u.list.num_elements;i++) { - struct dn_list *list2; - int v; - - list2 = talloc(module, struct dn_list); - if (list2 == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - v = ltdb_index_dn(module, tree->u.list.elements[i], index_list, list2); - - if (v == LDB_ERR_NO_SUCH_OBJECT) { - /* 0 || X == X */ - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - ret = v; - } - talloc_free(list2); - continue; - } - - if (v != LDB_SUCCESS && v != LDB_ERR_NO_SUCH_OBJECT) { - /* 1 || X == 1 */ - talloc_free(list->dn); - talloc_free(list2); - return v; - } - - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - ret = LDB_SUCCESS; - list->dn = talloc_move(list, &list2->dn); - list->count = list2->count; - } else { - if (list_union(ldb, list, list2) == -1) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - ret = LDB_SUCCESS; - } - talloc_free(list2); - } - - if (list->count == 0) { - return LDB_ERR_NO_SUCH_OBJECT; - } - - return ret; -} - - -/* - NOT an index results - */ -static int ltdb_index_dn_not(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list) -{ - /* the only way to do an indexed not would be if we could - negate the not via another not or if we knew the total - number of database elements so we could know that the - existing expression covered the whole database. - - instead, we just give up, and rely on a full index scan - (unless an outer & manages to reduce the list) - */ - return LDB_ERR_OPERATIONS_ERROR; -} - -/* - AND two index results - */ -static int ltdb_index_dn_and(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list) -{ - struct ldb_context *ldb = module->ldb; - unsigned int i; - int ret; - - ret = LDB_ERR_OPERATIONS_ERROR; - list->dn = NULL; - list->count = 0; - - for (i=0;i<tree->u.list.num_elements;i++) { - struct dn_list *list2; - int v; - - list2 = talloc(module, struct dn_list); - if (list2 == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - v = ltdb_index_dn(module, tree->u.list.elements[i], index_list, list2); - - if (v == LDB_ERR_NO_SUCH_OBJECT) { - /* 0 && X == 0 */ - talloc_free(list->dn); - talloc_free(list2); - return LDB_ERR_NO_SUCH_OBJECT; - } - - if (v != LDB_SUCCESS && v != LDB_ERR_NO_SUCH_OBJECT) { - talloc_free(list2); - continue; - } - - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - ret = LDB_SUCCESS; - talloc_free(list->dn); - list->dn = talloc_move(list, &list2->dn); - list->count = list2->count; - } else { - if (list_intersect(ldb, list, list2) == -1) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - } - - talloc_free(list2); - - if (list->count == 0) { - talloc_free(list->dn); - return LDB_ERR_NO_SUCH_OBJECT; - } - } - - return ret; -} - -/* - AND index results and ONE level special index - */ -static int ltdb_index_dn_one(struct ldb_module *module, - struct ldb_dn *parent_dn, - struct dn_list *list) -{ - struct ldb_context *ldb = module->ldb; - struct dn_list *list2; - struct ldb_message *msg; - struct ldb_dn *key; - struct ldb_val val; - unsigned int i, j; - int ret; - - list2 = talloc_zero(module, struct dn_list); - if (list2 == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - /* the attribute is indexed. Pull the list of DNs that match the - search criterion */ - val.data = (uint8_t *)((uintptr_t)ldb_dn_get_casefold(parent_dn)); - val.length = strlen((char *)val.data); - key = ltdb_index_key(ldb, LTDB_IDXONE, &val); - if (!key) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - - msg = talloc(list2, struct ldb_message); - if (msg == NULL) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = ltdb_search_dn1_index(module, key, msg); - talloc_free(key); - if (ret != LDB_SUCCESS) { - return ret; - } - - for (i = 0; i < msg->num_elements; i++) { - struct ldb_message_element *el; - - if (strcmp(msg->elements[i].name, LTDB_IDX) != 0) { - continue; - } - - el = &msg->elements[i]; - - list2->dn = talloc_array(list2, char *, el->num_values); - if (!list2->dn) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - - for (j = 0; j < el->num_values; j++) { - list2->dn[list2->count] = talloc_strdup(list2->dn, (char *)el->values[j].data); - if (!list2->dn[list2->count]) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - list2->count++; - } - } - - if (list2->count == 0) { - talloc_free(list2); - return LDB_ERR_NO_SUCH_OBJECT; - } - - if (list2->count > 1) { - qsort(list2->dn, list2->count, sizeof(char *), (comparison_fn_t) list_cmp); - } - - if (list->count > 0) { - if (list_intersect(ldb, list, list2) == -1) { - talloc_free(list2); - return LDB_ERR_OPERATIONS_ERROR; - } - - if (list->count == 0) { - talloc_free(list->dn); - talloc_free(list2); - return LDB_ERR_NO_SUCH_OBJECT; - } - } else { - list->dn = talloc_move(list, &list2->dn); - list->count = list2->count; - } - - talloc_free(list2); - - return LDB_SUCCESS; -} - -/* - return a list of dn's that might match a indexed search or - an error. return LDB_ERR_NO_SUCH_OBJECT for no matches, or LDB_SUCCESS for matches - */ -static int ltdb_index_dn(struct ldb_module *module, - const struct ldb_parse_tree *tree, - const struct ldb_message *index_list, - struct dn_list *list) -{ - int ret = LDB_ERR_OPERATIONS_ERROR; - - switch (tree->operation) { - case LDB_OP_AND: - ret = ltdb_index_dn_and(module, tree, index_list, list); - break; - - case LDB_OP_OR: - ret = ltdb_index_dn_or(module, tree, index_list, list); - break; - - case LDB_OP_NOT: - ret = ltdb_index_dn_not(module, tree, index_list, list); - break; - - case LDB_OP_EQUALITY: - ret = ltdb_index_dn_leaf(module, tree, index_list, list); - break; - - case LDB_OP_SUBSTRING: - case LDB_OP_GREATER: - case LDB_OP_LESS: - case LDB_OP_PRESENT: - case LDB_OP_APPROX: - case LDB_OP_EXTENDED: - /* we can't index with fancy bitops yet */ - ret = LDB_ERR_OPERATIONS_ERROR; - break; - } - - return ret; -} - -/* - filter a candidate dn_list from an indexed search into a set of results - extracting just the given attributes -*/ -static int ltdb_index_filter(const struct dn_list *dn_list, - struct ltdb_context *ac) -{ - struct ldb_message *msg; - unsigned int i; - - for (i = 0; i < dn_list->count; i++) { - struct ldb_dn *dn; - int ret; - - msg = ldb_msg_new(ac); - if (!msg) { - return LDB_ERR_OPERATIONS_ERROR; - } - - dn = ldb_dn_new(msg, ac->module->ldb, dn_list->dn[i]); - if (dn == NULL) { - talloc_free(msg); - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = ltdb_search_dn1(ac->module, dn, msg); - talloc_free(dn); - if (ret == LDB_ERR_NO_SUCH_OBJECT) { - /* the record has disappeared? yes, this can happen */ - talloc_free(msg); - continue; - } - - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - /* an internal error */ - talloc_free(msg); - return LDB_ERR_OPERATIONS_ERROR; - } - - if (!ldb_match_msg(ac->module->ldb, msg, - ac->tree, ac->base, ac->scope)) { - talloc_free(msg); - continue; - } - - /* filter the attributes that the user wants */ - ret = ltdb_filter_attrs(msg, ac->attrs); - - if (ret == -1) { - talloc_free(msg); - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = ldb_module_send_entry(ac->req, msg, NULL); - if (ret != LDB_SUCCESS) { - ac->callback_failed = true; - return ret; - } - } - - return LDB_SUCCESS; -} - -/* - search the database with a LDAP-like expression using indexes - returns -1 if an indexed search is not possible, in which - case the caller should call ltdb_search_full() -*/ -int ltdb_search_indexed(struct ltdb_context *ac) -{ - struct ltdb_private *ltdb = talloc_get_type(ac->module->private_data, struct ltdb_private); - struct dn_list *dn_list; - int ret, idxattr, idxone; - - idxattr = idxone = 0; - ret = ldb_msg_find_idx(ltdb->cache->indexlist, NULL, NULL, LTDB_IDXATTR); - if (ret == 0 ) { - idxattr = 1; - } - - /* We do one level indexing only if requested */ - ret = ldb_msg_find_idx(ltdb->cache->indexlist, NULL, NULL, LTDB_IDXONE); - if (ret == 0 ) { - idxone = 1; - } - - if ((ac->scope == LDB_SCOPE_ONELEVEL && (idxattr+idxone == 0)) || - (ac->scope == LDB_SCOPE_SUBTREE && idxattr == 0)) { - /* no indexes? must do full search */ - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = LDB_ERR_OPERATIONS_ERROR; - - dn_list = talloc_zero(ac, struct dn_list); - if (dn_list == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - if (ac->scope == LDB_SCOPE_BASE) { - /* with BASE searches only one DN can match */ - dn_list->dn = talloc_array(dn_list, char *, 1); - if (dn_list->dn == NULL) { - ldb_oom(ac->module->ldb); - return LDB_ERR_OPERATIONS_ERROR; - } - dn_list->dn[0] = ldb_dn_alloc_linearized(dn_list, ac->base); - if (dn_list->dn[0] == NULL) { - ldb_oom(ac->module->ldb); - return LDB_ERR_OPERATIONS_ERROR; - } - dn_list->count = 1; - ret = LDB_SUCCESS; - } - - if (ac->scope != LDB_SCOPE_BASE && idxattr == 1) { - ret = ltdb_index_dn(ac->module, ac->tree, ltdb->cache->indexlist, dn_list); - - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - talloc_free(dn_list); - return ret; - } - } - - if (ac->scope == LDB_SCOPE_ONELEVEL && idxone == 1) { - ret = ltdb_index_dn_one(ac->module, ac->base, dn_list); - } - - if (ret == LDB_SUCCESS) { - /* we've got a candidate list - now filter by the full tree - and extract the needed attributes */ - ret = ltdb_index_filter(dn_list, ac); - } - - talloc_free(dn_list); - - return ret; -} - -/* - add a index element where this is the first indexed DN for this value -*/ -static int ltdb_index_add1_new(struct ldb_context *ldb, - struct ldb_message *msg, - const char *dn) -{ - struct ldb_message_element *el; - - /* add another entry */ - el = talloc_realloc(msg, msg->elements, - struct ldb_message_element, msg->num_elements+1); - if (!el) { - return LDB_ERR_OPERATIONS_ERROR; - } - - msg->elements = el; - msg->elements[msg->num_elements].name = talloc_strdup(msg->elements, LTDB_IDX); - if (!msg->elements[msg->num_elements].name) { - return LDB_ERR_OPERATIONS_ERROR; - } - msg->elements[msg->num_elements].num_values = 0; - msg->elements[msg->num_elements].values = talloc(msg->elements, struct ldb_val); - if (!msg->elements[msg->num_elements].values) { - return LDB_ERR_OPERATIONS_ERROR; - } - msg->elements[msg->num_elements].values[0].length = strlen(dn); - msg->elements[msg->num_elements].values[0].data = discard_const_p(uint8_t, dn); - msg->elements[msg->num_elements].num_values = 1; - msg->num_elements++; - - return LDB_SUCCESS; -} - - -/* - add a index element where this is not the first indexed DN for this - value -*/ -static int ltdb_index_add1_add(struct ldb_context *ldb, - struct ldb_message *msg, - int idx, - const char *dn) -{ - struct ldb_val *v2; - unsigned int i; - - /* for multi-valued attributes we can end up with repeats */ - for (i=0;i<msg->elements[idx].num_values;i++) { - if (strcmp(dn, (char *)msg->elements[idx].values[i].data) == 0) { - return LDB_SUCCESS; - } - } - - v2 = talloc_realloc(msg->elements, msg->elements[idx].values, - struct ldb_val, - msg->elements[idx].num_values+1); - if (!v2) { - return LDB_ERR_OPERATIONS_ERROR; - } - msg->elements[idx].values = v2; - - msg->elements[idx].values[msg->elements[idx].num_values].length = strlen(dn); - msg->elements[idx].values[msg->elements[idx].num_values].data = discard_const_p(uint8_t, dn); - msg->elements[idx].num_values++; - - return LDB_SUCCESS; -} - -/* - add an index entry for one message element -*/ -static int ltdb_index_add1(struct ldb_module *module, const char *dn, - struct ldb_message_element *el, int v_idx) -{ - struct ldb_context *ldb = module->ldb; - struct ldb_message *msg; - struct ldb_dn *dn_key; - int ret; - unsigned int i; - - msg = talloc(module, struct ldb_message); - if (msg == NULL) { - errno = ENOMEM; - return LDB_ERR_OPERATIONS_ERROR; - } - - dn_key = ltdb_index_key(ldb, el->name, &el->values[v_idx]); - if (!dn_key) { - talloc_free(msg); - return LDB_ERR_OPERATIONS_ERROR; - } - talloc_steal(msg, dn_key); - - ret = ltdb_search_dn1_index(module, dn_key, msg); - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - talloc_free(msg); - return ret; - } - - if (ret == LDB_ERR_NO_SUCH_OBJECT) { - msg->dn = dn_key; - msg->num_elements = 0; - msg->elements = NULL; - } - - for (i=0;i<msg->num_elements;i++) { - if (strcmp(LTDB_IDX, msg->elements[i].name) == 0) { - break; - } - } - - if (i == msg->num_elements) { - ret = ltdb_index_add1_new(ldb, msg, dn); - } else { - ret = ltdb_index_add1_add(ldb, msg, i, dn); - } - - if (ret == LDB_SUCCESS) { - ret = ltdb_store_idxptr(module, msg, TDB_REPLACE); - } - - talloc_free(msg); - - return ret; -} - -static int ltdb_index_add0(struct ldb_module *module, const char *dn, - struct ldb_message_element *elements, int num_el) -{ - struct ltdb_private *ltdb = (struct ltdb_private *)module->private_data; - int ret; - unsigned int i, j; - - if (dn[0] == '@') { - return LDB_SUCCESS; - } - - if (ltdb->cache->indexlist->num_elements == 0) { - /* no indexed fields */ - return LDB_SUCCESS; - } - - for (i = 0; i < num_el; i++) { - ret = ldb_msg_find_idx(ltdb->cache->indexlist, elements[i].name, - NULL, LTDB_IDXATTR); - if (ret == -1) { - continue; - } - for (j = 0; j < elements[i].num_values; j++) { - ret = ltdb_index_add1(module, dn, &elements[i], j); - if (ret != LDB_SUCCESS) { - return ret; - } - } - } - - return LDB_SUCCESS; -} - -/* - add the index entries for a new record -*/ -int ltdb_index_add(struct ldb_module *module, const struct ldb_message *msg) -{ - const char *dn; - int ret; - - dn = ldb_dn_get_linearized(msg->dn); - if (dn == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = ltdb_index_add0(module, dn, msg->elements, msg->num_elements); - - return ret; -} - - -/* - delete an index entry for one message element -*/ -int ltdb_index_del_value(struct ldb_module *module, const char *dn, - struct ldb_message_element *el, int v_idx) -{ - struct ldb_context *ldb = module->ldb; - struct ldb_message *msg; - struct ldb_dn *dn_key; - int ret, i; - unsigned int j; - - if (dn[0] == '@') { - return LDB_SUCCESS; - } - - dn_key = ltdb_index_key(ldb, el->name, &el->values[v_idx]); - if (!dn_key) { - return LDB_ERR_OPERATIONS_ERROR; - } - - msg = talloc(dn_key, struct ldb_message); - if (msg == NULL) { - talloc_free(dn_key); - return LDB_ERR_OPERATIONS_ERROR; - } - - ret = ltdb_search_dn1_index(module, dn_key, msg); - if (ret != LDB_SUCCESS && ret != LDB_ERR_NO_SUCH_OBJECT) { - talloc_free(dn_key); - return ret; - } - - if (ret == LDB_ERR_NO_SUCH_OBJECT) { - /* it wasn't indexed. Did we have an earlier error? If we did then - its gone now */ - talloc_free(dn_key); - return LDB_SUCCESS; - } - - i = ldb_msg_find_idx(msg, dn, &j, LTDB_IDX); - if (i == -1) { - struct ldb_ldif ldif; - - ldb_debug(ldb, LDB_DEBUG_ERROR, - "ERROR: dn %s not found in %s\n", dn, - ldb_dn_get_linearized(dn_key)); - ldif.changetype = LDB_CHANGETYPE_NONE; - ldif.msg = msg; - ldb_ldif_write_file(module->ldb, stdout, &ldif); - sleep(100); - /* it ain't there. hmmm */ - talloc_free(dn_key); - return LDB_SUCCESS; - } - - if (j != msg->elements[i].num_values - 1) { - memmove(&msg->elements[i].values[j], - &msg->elements[i].values[j+1], - (msg->elements[i].num_values-(j+1)) * - sizeof(msg->elements[i].values[0])); - } - msg->elements[i].num_values--; - - if (msg->elements[i].num_values == 0) { - ret = ltdb_delete_noindex(module, dn_key); - } else { - ret = ltdb_store_idxptr(module, msg, TDB_REPLACE); - } - - talloc_free(dn_key); - - return ret; -} - -/* - delete the index entries for a record - return -1 on failure -*/ -int ltdb_index_del(struct ldb_module *module, const struct ldb_message *msg) -{ - struct ltdb_private *ltdb = (struct ltdb_private *)module->private_data; - int ret; - const char *dn; - unsigned int i, j; - - /* find the list of indexed fields */ - if (ltdb->cache->indexlist->num_elements == 0) { - /* no indexed fields */ - return LDB_SUCCESS; - } - - if (ldb_dn_is_special(msg->dn)) { - return LDB_SUCCESS; - } - - dn = ldb_dn_get_linearized(msg->dn); - if (dn == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - for (i = 0; i < msg->num_elements; i++) { - ret = ldb_msg_find_idx(ltdb->cache->indexlist, msg->elements[i].name, - NULL, LTDB_IDXATTR); - if (ret == -1) { - continue; - } - for (j = 0; j < msg->elements[i].num_values; j++) { - ret = ltdb_index_del_value(module, dn, &msg->elements[i], j); - if (ret != LDB_SUCCESS) { - return ret; - } - } - } - - return LDB_SUCCESS; -} - -/* - handle special index for one level searches -*/ -int ltdb_index_one(struct ldb_module *module, const struct ldb_message *msg, int add) -{ - struct ltdb_private *ltdb = (struct ltdb_private *)module->private_data; - struct ldb_message_element el; - struct ldb_val val; - struct ldb_dn *pdn; - const char *dn; - int ret; - - /* We index for ONE Level only if requested */ - ret = ldb_msg_find_idx(ltdb->cache->indexlist, NULL, NULL, LTDB_IDXONE); - if (ret != 0) { - return LDB_SUCCESS; - } - - pdn = ldb_dn_get_parent(module, msg->dn); - if (pdn == NULL) { - return LDB_ERR_OPERATIONS_ERROR; - } - - dn = ldb_dn_get_linearized(msg->dn); - if (dn == NULL) { - talloc_free(pdn); - return LDB_ERR_OPERATIONS_ERROR; - } - - val.data = (uint8_t *)((uintptr_t)ldb_dn_get_casefold(pdn)); - if (val.data == NULL) { - talloc_free(pdn); - return LDB_ERR_OPERATIONS_ERROR; - } - - val.length = strlen((char *)val.data); - el.name = LTDB_IDXONE; - el.values = &val; - el.num_values = 1; - - if (add) { - ret = ltdb_index_add1(module, dn, &el, 0); - } else { /* delete */ - ret = ltdb_index_del_value(module, dn, &el, 0); - } - - talloc_free(pdn); - - return ret; -} - - -/* - traversal function that deletes all @INDEX records -*/ -static int delete_index(struct tdb_context *tdb, TDB_DATA key, TDB_DATA data, void *state) -{ - const char *dn = "DN=" LTDB_INDEX ":"; - if (strncmp((char *)key.dptr, dn, strlen(dn)) == 0) { - return tdb_delete(tdb, key); - } - return 0; -} - -/* - traversal function that adds @INDEX records during a re index -*/ -static int re_index(struct tdb_context *tdb, TDB_DATA key, TDB_DATA data, void *state) -{ - struct ldb_module *module = (struct ldb_module *)state; - struct ldb_message *msg; - const char *dn = NULL; - int ret; - TDB_DATA key2; - - if (strncmp((char *)key.dptr, "DN=@", 4) == 0 || - strncmp((char *)key.dptr, "DN=", 3) != 0) { - return 0; - } - - msg = talloc(module, struct ldb_message); - if (msg == NULL) { - return -1; - } - - ret = ltdb_unpack_data(module, &data, msg); - if (ret != 0) { - talloc_free(msg); - return -1; - } - - /* check if the DN key has changed, perhaps due to the - case insensitivity of an element changing */ - key2 = ltdb_key(module, msg->dn); - if (key2.dptr == NULL) { - /* probably a corrupt record ... darn */ - ldb_debug(module->ldb, LDB_DEBUG_ERROR, "Invalid DN in re_index: %s\n", - ldb_dn_get_linearized(msg->dn)); - talloc_free(msg); - return 0; - } - if (strcmp((char *)key2.dptr, (char *)key.dptr) != 0) { - tdb_delete(tdb, key); - tdb_store(tdb, key2, data, 0); - } - talloc_free(key2.dptr); - - if (msg->dn == NULL) { - dn = (char *)key.dptr + 3; - } else { - dn = ldb_dn_get_linearized(msg->dn); - } - - ret = ltdb_index_one(module, msg, 1); - if (ret == LDB_SUCCESS) { - ret = ltdb_index_add0(module, dn, msg->elements, msg->num_elements); - } else { - ldb_debug(module->ldb, LDB_DEBUG_ERROR, - "Adding special ONE LEVEL index failed (%s)!\n", - ldb_dn_get_linearized(msg->dn)); - } - - talloc_free(msg); - - if (ret != LDB_SUCCESS) return -1; - - return 0; -} - -/* - force a complete reindex of the database -*/ -int ltdb_reindex(struct ldb_module *module) -{ - struct ltdb_private *ltdb = (struct ltdb_private *)module->private_data; - int ret; - - if (ltdb_cache_reload(module) != 0) { - return LDB_ERR_OPERATIONS_ERROR; - } - - /* first traverse the database deleting any @INDEX records */ - ret = tdb_traverse(ltdb->tdb, delete_index, NULL); - if (ret == -1) { - return LDB_ERR_OPERATIONS_ERROR; - } - - /* if we don't have indexes we have nothing todo */ - if (ltdb->cache->indexlist->num_elements == 0) { - return LDB_SUCCESS; - } - - /* now traverse adding any indexes for normal LDB records */ - ret = tdb_traverse(ltdb->tdb, re_index, module); - if (ret == -1) { - return LDB_ERR_OPERATIONS_ERROR; - } - - if (ltdb->idxptr) { - ltdb->idxptr->repack = true; - } - - return LDB_SUCCESS; -} |