4 Copyright (C) Andrew Tridgell 2004-2005
5 Copyright (C) Simo Sorce 2005
7 ** NOTE! The following LGPL license applies to the ldb
8 ** library. This does NOT imply that all of Samba is released
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 2 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, write to the Free Software
23 Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA
29 * Component: ldb expression matching
31 * Description: ldb expression matching
33 * Author: Andrew Tridgell
37 #include "ldb/include/ldb.h"
38 #include "ldb/include/ldb_private.h"
42 check if the scope matches in a search result
44 static int ldb_match_scope(struct ldb_context *ldb,
45 const struct ldb_dn *base,
46 const struct ldb_dn *dn,
51 if (base == NULL || dn == NULL) {
57 if (ldb_dn_compare(ldb, base, dn) == 0) {
62 case LDB_SCOPE_ONELEVEL:
63 if (dn->comp_num == (base->comp_num + 1)) {
64 if (ldb_dn_compare_base(ldb, base, dn) == 0) {
70 case LDB_SCOPE_SUBTREE:
72 if (ldb_dn_compare_base(ldb, base, dn) == 0) {
83 match if node is present
85 static int ldb_match_present(struct ldb_context *ldb,
86 struct ldb_message *msg,
87 struct ldb_parse_tree *tree,
91 if (ldb_attr_cmp(tree->u.present.attr, "distinguishedName") == 0) {
95 if (ldb_msg_find_element(msg, tree->u.present.attr)) {
102 static int ldb_match_comparison(struct ldb_context *ldb,
103 struct ldb_message *msg,
104 struct ldb_parse_tree *tree,
105 enum ldb_scope scope,
106 enum ldb_parse_op comp_op)
109 struct ldb_message_element *el;
110 const struct ldb_attrib_handler *h;
113 /* FIXME: APPROX comparison not handled yet */
114 if (comp_op == LDB_OP_APPROX) return 0;
116 el = ldb_msg_find_element(msg, tree->u.comparison.attr);
121 h = ldb_attrib_handler(ldb, el->name);
123 for (i = 0; i < el->num_values; i++) {
124 ret = h->comparison_fn(ldb, ldb, &el->values[i], &tree->u.comparison.value);
129 if (ret > 0 && comp_op == LDB_OP_GREATER) {
132 if (ret < 0 && comp_op == LDB_OP_LESS) {
141 match a simple leaf node
143 static int ldb_match_equality(struct ldb_context *ldb,
144 struct ldb_message *msg,
145 struct ldb_parse_tree *tree,
146 enum ldb_scope scope)
149 struct ldb_message_element *el;
150 const struct ldb_attrib_handler *h;
151 struct ldb_dn *valuedn;
154 if (ldb_attr_cmp(tree->u.equality.attr, "dn") == 0 ||
155 ldb_attr_cmp(tree->u.equality.attr, "distinguishedName") == 0) {
156 valuedn = ldb_dn_explode_casefold(ldb, tree->u.equality.value.data);
157 if (valuedn == NULL) {
161 ret = ldb_dn_compare(ldb, msg->dn, valuedn);
163 talloc_free(valuedn);
165 if (ret == 0) return 1;
169 /* TODO: handle the "*" case derived from an extended search
170 operation without the attibute type defined */
171 el = ldb_msg_find_element(msg, tree->u.equality.attr);
176 h = ldb_attrib_handler(ldb, el->name);
178 for (i=0;i<el->num_values;i++) {
179 if (h->comparison_fn(ldb, ldb, &tree->u.equality.value,
180 &el->values[i]) == 0) {
188 static int ldb_wildcard_compare(struct ldb_context *ldb,
189 struct ldb_parse_tree *tree,
190 const struct ldb_val value)
192 const struct ldb_attrib_handler *h;
195 struct ldb_val *chunk;
200 h = ldb_attrib_handler(ldb, tree->u.substring.attr);
202 if(h->canonicalise_fn(ldb, ldb, &value, &val) != 0)
208 if ( ! tree->u.substring.start_with_wildcard ) {
210 chunk = tree->u.substring.chunks[c];
211 if(h->canonicalise_fn(ldb, ldb, chunk, &cnk) != 0) goto failed;
213 /* FIXME: case of embedded nulls */
214 if (strncmp(val.data, cnk.data, cnk.length) != 0) goto failed;
215 val.length -= cnk.length;
216 val.data += cnk.length;
218 talloc_free(cnk.data);
222 while (tree->u.substring.chunks[c]) {
224 chunk = tree->u.substring.chunks[c];
225 if(h->canonicalise_fn(ldb, ldb, chunk, &cnk) != 0) goto failed;
227 /* FIXME: case of embedded nulls */
228 p = strstr(val.data, cnk.data);
229 if (p == NULL) goto failed;
230 if ( (! tree->u.substring.chunks[c + 1]) && (! tree->u.substring.end_with_wildcard) ) {
232 g = strstr(p + cnk.length, cnk.data);
236 val.length = val.length - (p - (char *)(val.data)) - cnk.length;
237 val.data = p + cnk.length;
239 talloc_free(cnk.data);
243 if ( (! tree->u.substring.end_with_wildcard) && (*(val.data) != 0) ) goto failed; /* last chunk have not reached end of string */
249 talloc_free(cnk.data);
254 match a simple leaf node
256 static int ldb_match_substring(struct ldb_context *ldb,
257 struct ldb_message *msg,
258 struct ldb_parse_tree *tree,
259 enum ldb_scope scope)
262 struct ldb_message_element *el;
264 el = ldb_msg_find_element(msg, tree->u.substring.attr);
269 for (i = 0; i < el->num_values; i++) {
270 if (ldb_wildcard_compare(ldb, tree, el->values[i]) == 1) {
280 bitwise-and comparator
282 static int ldb_comparator_and(struct ldb_val *v1, struct ldb_val *v2)
285 i1 = strtoull(v1->data, NULL, 0);
286 i2 = strtoull(v2->data, NULL, 0);
287 return ((i1 & i2) == i2);
291 bitwise-or comparator
293 static int ldb_comparator_or(struct ldb_val *v1, struct ldb_val *v2)
296 i1 = strtoull(v1->data, NULL, 0);
297 i2 = strtoull(v2->data, NULL, 0);
298 return ((i1 & i2) != 0);
303 extended match, handles things like bitops
305 static int ldb_match_extended(struct ldb_context *ldb,
306 struct ldb_message *msg,
307 struct ldb_parse_tree *tree,
308 enum ldb_scope scope)
313 int (*comparator)(struct ldb_val *, struct ldb_val *);
315 { LDB_OID_COMPARATOR_AND, ldb_comparator_and},
316 { LDB_OID_COMPARATOR_OR, ldb_comparator_or}
318 int (*comp)(struct ldb_val *, struct ldb_val *) = NULL;
319 struct ldb_message_element *el;
321 if (tree->u.extended.dnAttributes) {
322 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: dnAttributes extended match not supported yet");
325 if (tree->u.extended.rule_id == NULL) {
326 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: no-rule extended matches not supported yet");
329 if (tree->u.extended.attr == NULL) {
330 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: no-attribute extended matches not supported yet");
334 for (i=0;i<ARRAY_SIZE(rules);i++) {
335 if (strcmp(rules[i].oid, tree->u.extended.rule_id) == 0) {
336 comp = rules[i].comparator;
341 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: unknown extended rule_id %s\n",
342 tree->u.extended.rule_id);
346 /* find the message element */
347 el = ldb_msg_find_element(msg, tree->u.extended.attr);
352 for (i=0;i<el->num_values;i++) {
353 int ret = comp(&el->values[i], &tree->u.extended.value);
354 if (ret == -1 || ret == 1) return ret;
361 return 0 if the given parse tree matches the given message. Assumes
362 the message is in sorted order
364 return 1 if it matches, and 0 if it doesn't match
366 this is a recursive function, and does short-circuit evaluation
368 static int ldb_match_message(struct ldb_context *ldb,
369 struct ldb_message *msg,
370 struct ldb_parse_tree *tree,
371 enum ldb_scope scope)
376 switch (tree->operation) {
378 for (i=0;i<tree->u.list.num_elements;i++) {
379 v = ldb_match_message(ldb, msg, tree->u.list.elements[i], scope);
385 for (i=0;i<tree->u.list.num_elements;i++) {
386 v = ldb_match_message(ldb, msg, tree->u.list.elements[i], scope);
392 return ! ldb_match_message(ldb, msg, tree->u.isnot.child, scope);
394 case LDB_OP_EQUALITY:
395 return ldb_match_equality(ldb, msg, tree, scope);
397 case LDB_OP_SUBSTRING:
398 return ldb_match_substring(ldb, msg, tree, scope);
401 return ldb_match_comparison(ldb, msg, tree, scope, LDB_OP_GREATER);
404 return ldb_match_comparison(ldb, msg, tree, scope, LDB_OP_LESS);
407 return ldb_match_present(ldb, msg, tree, scope);
410 return ldb_match_comparison(ldb, msg, tree, scope, LDB_OP_APPROX);
412 case LDB_OP_EXTENDED:
413 return ldb_match_extended(ldb, msg, tree, scope);
420 int ldb_match_msg(struct ldb_context *ldb,
421 struct ldb_message *msg,
422 struct ldb_parse_tree *tree,
423 const struct ldb_dn *base,
424 enum ldb_scope scope)
426 if ( ! ldb_match_scope(ldb, base, msg->dn, scope) ) {
430 return ldb_match_message(ldb, msg, tree, scope);