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
36 #include "ldb_includes.h"
39 check if the scope matches in a search result
41 static int ldb_match_scope(struct ldb_context *ldb,
48 if (base == NULL || dn == NULL) {
54 if (ldb_dn_compare(base, dn) == 0) {
59 case LDB_SCOPE_ONELEVEL:
60 if (ldb_dn_get_comp_num(dn) == (ldb_dn_get_comp_num(base) + 1)) {
61 if (ldb_dn_compare_base(base, dn) == 0) {
67 case LDB_SCOPE_SUBTREE:
69 if (ldb_dn_compare_base(base, dn) == 0) {
80 match if node is present
82 static int ldb_match_present(struct ldb_context *ldb,
83 const struct ldb_message *msg,
84 const struct ldb_parse_tree *tree,
87 if (ldb_attr_dn(tree->u.present.attr) == 0) {
91 if (ldb_msg_find_element(msg, tree->u.present.attr)) {
98 static int ldb_match_comparison(struct ldb_context *ldb,
99 const struct ldb_message *msg,
100 const struct ldb_parse_tree *tree,
101 enum ldb_scope scope,
102 enum ldb_parse_op comp_op)
105 struct ldb_message_element *el;
106 const struct ldb_schema_attribute *a;
109 /* FIXME: APPROX comparison not handled yet */
110 if (comp_op == LDB_OP_APPROX) return 0;
112 el = ldb_msg_find_element(msg, tree->u.comparison.attr);
117 a = ldb_schema_attribute_by_name(ldb, el->name);
119 for (i = 0; i < el->num_values; i++) {
120 ret = a->syntax->comparison_fn(ldb, ldb, &el->values[i], &tree->u.comparison.value);
125 if (ret > 0 && comp_op == LDB_OP_GREATER) {
128 if (ret < 0 && comp_op == LDB_OP_LESS) {
137 match a simple leaf node
139 static int ldb_match_equality(struct ldb_context *ldb,
140 const struct ldb_message *msg,
141 const struct ldb_parse_tree *tree,
142 enum ldb_scope scope)
145 struct ldb_message_element *el;
146 const struct ldb_schema_attribute *a;
147 struct ldb_dn *valuedn;
150 if (ldb_attr_dn(tree->u.equality.attr) == 0) {
151 valuedn = ldb_dn_new(ldb, ldb, (char *)tree->u.equality.value.data);
152 if (valuedn == NULL) {
156 ret = ldb_dn_compare(msg->dn, valuedn);
158 talloc_free(valuedn);
160 if (ret == 0) return 1;
164 /* TODO: handle the "*" case derived from an extended search
165 operation without the attibute type defined */
166 el = ldb_msg_find_element(msg, tree->u.equality.attr);
171 a = ldb_schema_attribute_by_name(ldb, el->name);
173 for (i=0;i<el->num_values;i++) {
174 if (a->syntax->comparison_fn(ldb, ldb, &tree->u.equality.value,
175 &el->values[i]) == 0) {
183 static int ldb_wildcard_compare(struct ldb_context *ldb,
184 const struct ldb_parse_tree *tree,
185 const struct ldb_val value)
187 const struct ldb_schema_attribute *a;
190 struct ldb_val *chunk;
192 uint8_t *save_p = NULL;
195 a = ldb_schema_attribute_by_name(ldb, tree->u.substring.attr);
197 if(a->syntax->canonicalise_fn(ldb, ldb, &value, &val) != 0)
203 if ( ! tree->u.substring.start_with_wildcard ) {
205 chunk = tree->u.substring.chunks[c];
206 if(a->syntax->canonicalise_fn(ldb, ldb, chunk, &cnk) != 0) goto failed;
208 /* This deals with wildcard prefix searches on binary attributes (eg objectGUID) */
209 if (cnk.length > val.length) {
212 if (memcmp((char *)val.data, (char *)cnk.data, cnk.length) != 0) goto failed;
213 val.length -= cnk.length;
214 val.data += cnk.length;
216 talloc_free(cnk.data);
220 while (tree->u.substring.chunks[c]) {
222 chunk = tree->u.substring.chunks[c];
223 if(a->syntax->canonicalise_fn(ldb, ldb, chunk, &cnk) != 0) goto failed;
225 /* FIXME: case of embedded nulls */
226 p = strstr((char *)val.data, (char *)cnk.data);
227 if (p == NULL) goto failed;
228 if ( (! tree->u.substring.chunks[c + 1]) && (! tree->u.substring.end_with_wildcard) ) {
230 g = strstr((char *)p + cnk.length, (char *)cnk.data);
234 val.length = val.length - (p - (char *)(val.data)) - cnk.length;
235 val.data = (uint8_t *)(p + cnk.length);
237 talloc_free(cnk.data);
241 if ( (! tree->u.substring.end_with_wildcard) && (*(val.data) != 0) ) goto failed; /* last chunk have not reached end of string */
247 talloc_free(cnk.data);
252 match a simple leaf node
254 static int ldb_match_substring(struct ldb_context *ldb,
255 const struct ldb_message *msg,
256 const struct ldb_parse_tree *tree,
257 enum ldb_scope scope)
260 struct ldb_message_element *el;
262 el = ldb_msg_find_element(msg, tree->u.substring.attr);
267 for (i = 0; i < el->num_values; i++) {
268 if (ldb_wildcard_compare(ldb, tree, el->values[i]) == 1) {
278 bitwise-and comparator
280 static int ldb_comparator_and(const struct ldb_val *v1, const struct ldb_val *v2)
283 i1 = strtoull((char *)v1->data, NULL, 0);
284 i2 = strtoull((char *)v2->data, NULL, 0);
285 return ((i1 & i2) == i2);
289 bitwise-or comparator
291 static int ldb_comparator_or(const struct ldb_val *v1, const struct ldb_val *v2)
294 i1 = strtoull((char *)v1->data, NULL, 0);
295 i2 = strtoull((char *)v2->data, NULL, 0);
296 return ((i1 & i2) != 0);
301 extended match, handles things like bitops
303 static int ldb_match_extended(struct ldb_context *ldb,
304 const struct ldb_message *msg,
305 const struct ldb_parse_tree *tree,
306 enum ldb_scope scope)
311 int (*comparator)(const struct ldb_val *, const struct ldb_val *);
313 { LDB_OID_COMPARATOR_AND, ldb_comparator_and},
314 { LDB_OID_COMPARATOR_OR, ldb_comparator_or}
316 int (*comp)(const struct ldb_val *, const struct ldb_val *) = NULL;
317 struct ldb_message_element *el;
319 if (tree->u.extended.dnAttributes) {
320 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: dnAttributes extended match not supported yet");
323 if (tree->u.extended.rule_id == NULL) {
324 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: no-rule extended matches not supported yet");
327 if (tree->u.extended.attr == NULL) {
328 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: no-attribute extended matches not supported yet");
332 for (i=0;i<ARRAY_SIZE(rules);i++) {
333 if (strcmp(rules[i].oid, tree->u.extended.rule_id) == 0) {
334 comp = rules[i].comparator;
339 ldb_debug(ldb, LDB_DEBUG_ERROR, "ldb: unknown extended rule_id %s\n",
340 tree->u.extended.rule_id);
344 /* find the message element */
345 el = ldb_msg_find_element(msg, tree->u.extended.attr);
350 for (i=0;i<el->num_values;i++) {
351 int ret = comp(&el->values[i], &tree->u.extended.value);
352 if (ret == -1 || ret == 1) return ret;
359 return 0 if the given parse tree matches the given message. Assumes
360 the message is in sorted order
362 return 1 if it matches, and 0 if it doesn't match
364 this is a recursive function, and does short-circuit evaluation
366 static int ldb_match_message(struct ldb_context *ldb,
367 const struct ldb_message *msg,
368 const struct ldb_parse_tree *tree,
369 enum ldb_scope scope)
374 switch (tree->operation) {
376 for (i=0;i<tree->u.list.num_elements;i++) {
377 v = ldb_match_message(ldb, msg, tree->u.list.elements[i], scope);
383 for (i=0;i<tree->u.list.num_elements;i++) {
384 v = ldb_match_message(ldb, msg, tree->u.list.elements[i], scope);
390 return ! ldb_match_message(ldb, msg, tree->u.isnot.child, scope);
392 case LDB_OP_EQUALITY:
393 return ldb_match_equality(ldb, msg, tree, scope);
395 case LDB_OP_SUBSTRING:
396 return ldb_match_substring(ldb, msg, tree, scope);
399 return ldb_match_comparison(ldb, msg, tree, scope, LDB_OP_GREATER);
402 return ldb_match_comparison(ldb, msg, tree, scope, LDB_OP_LESS);
405 return ldb_match_present(ldb, msg, tree, scope);
408 return ldb_match_comparison(ldb, msg, tree, scope, LDB_OP_APPROX);
410 case LDB_OP_EXTENDED:
411 return ldb_match_extended(ldb, msg, tree, scope);
418 int ldb_match_msg(struct ldb_context *ldb,
419 const struct ldb_message *msg,
420 const struct ldb_parse_tree *tree,
422 enum ldb_scope scope)
424 if ( ! ldb_match_scope(ldb, base, msg->dn, scope) ) {
428 return ldb_match_message(ldb, msg, tree, scope);