/*
* To ensure that the indexes in idxptr are consistent we cache any
* index updates during an operation, i.e. ldb_kv_add, ldb_kv_delete ...
- * Once the changes to the data record have been commited to disk
+ * Once the changes to the data record have been committed to disk
* the contents of this cache are copied to idxptr
*/
struct ldb_kv_idxptr *nested_idx_ptr;
/*
* This will be used to indicate when a new, yet to be developed
- * sub-database version of the indicies are in use, to ensure we do
+ * sub-database version of the indices are in use, to ensure we do
* not load future databases unintentionally.
*/
(This allows a scope BASE search to directly find the record via
a simple casefold of the DN).
-The original mixed-case DN is stored in the entry iself.
+The original mixed-case DN is stored in the entry itself.
The new 'GUID index' format is:
@IDXVERSION: 3
@IDX: <binary GUID>[<binary GUID>[...]]
-The binary guid is 16 bytes, as bytes and not expanded as hexidecimal
+The binary guid is 16 bytes, as bytes and not expanded as hexadecimal
or pretty-printed. The GUID is chosen from the message to be stored
by the @IDXGUID attribute on @INDEXLIST.
GUID=<binary GUID>
This allows a very quick translation between the fixed-length index
-values and the TDB key, while seperating entries from other data
+values and the TDB key, while separating entries from other data
in the TDB, should they be unlucky enough to start with the bytes of
the 'DN=' prefix.
}
talloc_free(vstr);
} else {
- /* Only need two seperators */
+ /* Only need two separators */
num_separators = 2;
/*
if ((ldb_kv->cache->GUID_index_attribute != NULL) &&
(ldb_attr_cmp(attr, ldb_kv->cache->GUID_index_attribute) == 0)) {
- /* Implicity covered, this is the index key */
+ /* Implicitly covered, this is the index key */
return false;
}
if (ldb->schema.index_handler_override) {
ret = ldb_module_send_entry(ac->req, filtered_msg, NULL);
if (ret != LDB_SUCCESS) {
/* Regardless of success or failure, the msg
- * is the callbacks responsiblity, and should
+ * is the callbacks responsibility, and should
* not be talloc_free()'ed */
ac->request_terminated = true;
talloc_free(keys);
}
/* overallocate the list a bit, to reduce the number of
- * realloc trigered copies */
+ * realloc triggered copies */
alloc_len = ((list->count+1)+7) & ~7;
list->dn = talloc_realloc(list, list->dn, struct ldb_val, alloc_len);
if (list->dn == NULL) {
ret = ldb_module_send_entry(ctx->req, filtered_msg, NULL);
if (ret != LDB_SUCCESS) {
/* Regardless of success or failure, the msg
- * is the callbacks responsiblity, and should
+ * is the callbacks responsibility, and should
* not be talloc_free()'ed */
ctx->request_terminated = true;
return ret;