2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2004 The OpenLDAP Foundation.
5 * Portions Copyright 1999 Dmitry Kovalev.
6 * Portions Copyright 2002 Pierangelo Mararati.
7 * Portions Copyright 2004 Mark Adamson.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted only as authorized by the OpenLDAP
14 * A copy of this license is available in the file LICENSE in the
15 * top-level directory of the distribution or, alternatively, at
16 * <http://www.OpenLDAP.org/license.html>.
19 * This work was initially developed by Dmitry Kovalev for inclusion
20 * by OpenLDAP Software. Additional significant contributors include
21 * Pierangelo Mararati and Mark Adamson.
24 * The following changes have been addressed:
27 * - re-styled code for better readability
28 * - upgraded backend API to reflect recent changes
29 * - LDAP schema is checked when loading SQL/LDAP mapping
30 * - AttributeDescription/ObjectClass pointers used for more efficient
32 * - bervals used where string length is required often
33 * - atomized write operations by committing at the end of each operation
34 * and defaulting connection closure to rollback
35 * - added LDAP access control to write operations
36 * - fully implemented modrdn (with rdn attrs change, deleteoldrdn,
37 * access check, parent/children check and more)
38 * - added parent access control, children control to delete operation
39 * - added structuralObjectClass operational attribute check and
40 * value return on search
41 * - added hasSubordinate operational attribute on demand
42 * - search limits are appropriately enforced
43 * - function backsql_strcat() has been made more efficient
44 * - concat function has been made configurable by means of a pattern
45 * - added config switches:
46 * - fail_if_no_mapping write operations fail if there is no mapping
47 * - has_ldapinfo_dn_ru overrides autodetect
48 * - concat_pattern a string containing two '?' is used
49 * (note that "?||?" should be more portable
50 * than builtin function "CONCAT(?,?)")
51 * - strcast_func cast of string constants in "SELECT DISTINCT
52 * statements (needed by PostgreSQL)
53 * - upper_needs_cast cast the argument of upper when required
54 * (basically when building dn substring queries)
55 * - added noop control
56 * - added values return filter control
57 * - hasSubordinate can be used in search filters (with limitations)
58 * - eliminated oc->name; use oc->oc->soc_cname instead
61 * - add security checks for SQL statements that can be injected (?)
62 * - re-test with previously supported RDBMs
63 * - replace dn_ru and so with normalized dn (no need for upper() and so
65 * - implement a backsql_normalize() function to replace the upper()
67 * - note that subtree deletion, subtree renaming and so could be easily
68 * implemented (rollback and consistency checks are available :)
69 * - implement "lastmod" and other operational stuff (ldap_entries table ?)
70 * - check how to allow multiple operations with one statement, to remove
71 * BACKSQL_REALLOC_STMT from modify.c (a more recent unixODBC lib?)
74 * Improvements submitted by (ITS#)
76 * 1. id_query.patch applied (with changes)
77 * 2. shortcut.patch applied (reworked)
78 * 3. create_hint.patch applied
79 * 4. count_query.patch rejected (conflicts with other features)
80 * 5. returncodes.patch applied (with sanity checks)
81 * 6. connpool.patch under evaluation
82 * 7. modoc.patch under evaluation
83 * 8. miscfixes.patch applied (reworked; FIXME: other
84 * operations may need to load the
85 * entire entry for ACL purposes)
87 * original description:
89 Changes that were made to the SQL backend.
91 The patches were made against 2.2.18 and can be applied individually,
92 but would best be applied in the numerical order of the file names.
93 A synopsis of each patch is given here:
96 1. Added an option to set SQL query for the "id_query" operation.
98 2. Added an option to the SQL backend called "use_subtree_shortcut".
99 When a search is performed, the SQL query includes a WHERE clause
100 which says the DN must be "LIKE %<searchbase>". The LIKE operation
101 can be slow in an RDBM. This shortcut option says that if the
102 searchbase of the LDAP search is the root DN of the SQL backend,
103 and thus all objects will match the LIKE operator, do not include
104 the "LIKE %<searchbase>" clause in the SQL query (it is replaced
105 instead by the always true "1=1" clause to keep the "AND"'s
106 working correctly). This option is off by default, and should be
107 turned on only if all objects to be found in the RDBM are under the
108 same root DN. Multiple backends working within the same RDBM table
109 space would encounter problems. LDAP searches whose searchbase are
110 not at the root DN will bypass this shortcut and employ the LIKE
113 3. Added a "create_hint" column to ldap_oc_mappings table. Allows
114 taking the value of an attr named in "create_hint" and passing it to
115 the create_proc procedure. This is necessary for when an objectClass's
116 table is partition indexed by some indexing column and thus the value
117 in that indexing column cannot change after the row is created. The
118 value for the indexed column is passed into the create_proc, which
119 uses it to fill in the indexed column as the new row is created.
121 4. When loading the values of an attribute, the count(*) of the number
122 of values is fetched first and memory is allocated for the array of
123 values and normalized values. The old system of loading the values one
124 by one and running realloc() on the array of values and normalized
125 values each time was badly fragmenting memory. The array of values and
126 normalized values would be side by side in memory, and realloc()'ing
127 them over and over would force them to leapfrog each other through all
128 of available memory. Attrs with a large number of values could not be
129 loaded without crashing the slapd daemon.
131 5. Added code to interpret the value returned by stored procedures
132 which have expect_return set. Returned value is interpreted as an LDAP
133 return code. This allows the distinction between the SQL failing to
134 execute and the SQL running to completion and returning an error code
135 which can indicate a policy violation.
137 6. Added RDBM connection pooling. Once an operation is finished the
138 connection to the RDBM is returned to a pool rather than closing.
139 Allows the next operation to skip the initialization and authentication
140 phases of contacting the RDBM. Also, if licensing with ODBC places
141 a limit on the number of connections, an LDAP thread can block waiting
142 for another thread to finish, so that no LDAP errors are returned
143 for having more LDAP connections than allowed RDBM connections. An
144 RDBM connection which receives an SQL error is marked as "tainted"
145 so that it will be closed rather than returned to the pool.
146 Also, RDBM connections must be bound to a given LDAP connection AND
147 operation number, and NOT just the connection number. Asynchronous
148 LDAP clients can have multiple simultaneous LDAP operations which
149 should not share the same RDBM connection. A given LDAP operation can
150 even make multiple SQL operations (e.g. a BIND operation which
151 requires SASL to perform an LDAP search to convert the SASL ID to an
152 LDAP DN), so each RDBM connection now has a refcount that must reach
153 zero before the connection is returned to the free pool.
155 7. Added ability to change the objectClass of an object. Required
156 considerable work to copy all attributes out of old object and into
157 new object. Does a schema check before proceeding. Creates a new
158 object, fills it in, deletes the old object, then changes the
159 oc_map_id and keyval of the entry in the "ldap_entries" table.
161 8. Generic fixes. Includes initializing pointers before they
162 get used in error branch cases, pointer checks before dereferencing,
163 resetting a return code to success after a COMPARE op, sealing
164 memory leaks, and in search.c, changing some of the "1=1" tests to
165 "2=2", "3=3", etc so that when reading slapd trace output, the
166 location in the source code where the x=x test was added to the SQL
167 can be easily distinguished.
170 #ifndef __BACKSQL_H__
171 #define __BACKSQL_H__
173 #include "sql-types.h"
176 * Better use the standard length of 8192 (as of slap.h)?
178 * NOTE: must be consistent with definition in ldap_entries table
180 /* #define BACKSQL_MAX_DN_LEN SLAP_LDAPDN_MAXLEN */
181 #define BACKSQL_MAX_DN_LEN 255
184 * define to enable very extensive trace logging (debug only)
189 * define to enable varchars as unique keys in user tables
191 * by default integers are used (and recommended)
192 * for performances. Integers are used anyway in back-sql
195 #undef BACKSQL_ARBITRARY_KEY
198 * define to enable experimental support for syncporv overlay
201 #define BACKSQL_SYNCPROV
202 #endif /* LDAP_DEVEL */
205 * define to the appropriate aliasing string
207 * some RDBMSes tolerate (or require) that " AS " is not used
208 * when aliasing tables/columns
210 #define BACKSQL_ALIASING "AS "
211 /* #define BACKSQL_ALIASING "" */
214 * define to the appropriate quoting char
216 * some RDBMSes tolerate/require that the aliases be enclosed
217 * in quotes. This is especially true for those that do not
218 * allow keywords used as aliases.
220 /* #define BACKSQL_ALIASING_QUOTE '"' */
221 /* #define BACKSQL_ALIASING_QUOTE '\'' */
226 * a simple mechanism to allow DN mucking between the LDAP
227 * and the stored string representation.
229 typedef struct backsql_api {
231 int (*ba_dn2odbc)( Operation *op, SlapReply *rs, struct berval *dn );
232 int (*ba_odbc2dn)( Operation *op, SlapReply *rs, struct berval *dn );
233 struct backsql_api *ba_next;
239 typedef struct backsql_entryID {
240 /* #define BACKSQL_ARBITRARY_KEY to allow a non-numeric key.
241 * It is required by some special applications that use
242 * strings as keys for the main table.
243 * In this case, #define BACKSQL_MAX_KEY_LEN consistently
244 * with the key size definition */
245 #ifdef BACKSQL_ARBITRARY_KEY
246 struct berval eid_id;
247 struct berval eid_keyval;
248 #define BACKSQL_MAX_KEY_LEN 64
249 #else /* ! BACKSQL_ARBITRARY_KEY */
250 /* The original numeric key is maintained as default. */
251 unsigned long eid_id;
252 unsigned long eid_keyval;
253 #endif /* ! BACKSQL_ARBITRARY_KEY */
255 unsigned long eid_oc_id;
256 struct berval eid_dn;
257 struct berval eid_ndn;
258 struct backsql_entryID *eid_next;
261 #ifdef BACKSQL_ARBITRARY_KEY
262 #define BACKSQL_ENTRYID_INIT { BER_BVNULL, BER_BVNULL, 0, BER_BVNULL, BER_BVNULL, NULL }
263 #else /* ! BACKSQL_ARBITRARY_KEY */
264 #define BACKSQL_ENTRYID_INIT { 0, 0, 0, BER_BVNULL, BER_BVNULL, NULL }
265 #endif /* BACKSQL_ARBITRARY_KEY */
268 * "structural" objectClass mapping structure
270 typedef struct backsql_oc_map_rec {
272 * Structure of corresponding LDAP objectClass definition
275 #define BACKSQL_OC_NAME(ocmap) ((ocmap)->bom_oc->soc_cname.bv_val)
277 struct berval bom_keytbl;
278 struct berval bom_keycol;
279 /* expected to return keyval of newly created entry */
280 char *bom_create_proc;
281 /* in case create_proc does not return the keyval of the newly
283 char *bom_create_keyval;
284 /* supposed to expect keyval as parameter and delete
285 * all the attributes as well */
286 char *bom_delete_proc;
287 /* flags whether delete_proc is a function (whether back-sql
288 * should bind first parameter as output for return code) */
289 int bom_expect_return;
290 unsigned long bom_id;
292 AttributeDescription *bom_create_hint;
293 } backsql_oc_map_rec;
296 * attributeType mapping structure
298 typedef struct backsql_at_map_rec {
299 /* Description of corresponding LDAP attribute type */
300 AttributeDescription *bam_ad;
301 /* ObjectClass if bam_ad is objectClass */
304 struct berval bam_from_tbls;
305 struct berval bam_join_where;
306 struct berval bam_sel_expr;
308 /* TimesTen, or, if a uppercase function is defined,
309 * an uppercased version of bam_sel_expr */
310 struct berval bam_sel_expr_u;
312 /* supposed to expect 2 binded values: entry keyval
313 * and attr. value to add, like "add_name(?,?,?)" */
315 /* supposed to expect 2 binded values: entry keyval
316 * and attr. value to delete */
317 char *bam_delete_proc;
318 /* for optimization purposes attribute load query
319 * is preconstructed from parts on schemamap load time */
321 /* following flags are bitmasks (first bit used for add_proc,
322 * second - for delete_proc) */
323 /* order of parameters for procedures above;
324 * 1 means "data then keyval", 0 means "keyval then data" */
326 /* flags whether one or more of procedures is a function
327 * (whether back-sql should bind first parameter as output
328 * for return code) */
329 int bam_expect_return;
331 /* next mapping for attribute */
332 struct backsql_at_map_rec *bam_next;
333 } backsql_at_map_rec;
335 #define BACKSQL_AT_MAP_REC_INIT { NULL, NULL, BER_BVC(""), BER_BVC(""), BER_BVNULL, BER_BVNULL, NULL, NULL, NULL, 0, 0, NULL }
337 /* define to uppercase filters only if the matching rule requires it
338 * (currently broken) */
339 /* #define BACKSQL_UPPERCASE_FILTER */
341 #define BACKSQL_AT_CANUPPERCASE(at) ((at)->bam_sel_expr_u.bv_val)
343 /* defines to support bitmasks above */
344 #define BACKSQL_ADD 0x1
345 #define BACKSQL_DEL 0x2
347 #define BACKSQL_IS_ADD(x) ( BACKSQL_ADD & (x) )
348 #define BACKSQL_IS_DEL(x) ( BACKSQL_DEL & (x) )
350 #define BACKSQL_NCMP(v1,v2) ber_bvcmp((v1),(v2))
352 #define BACKSQL_CONCAT
354 * berbuf structure: a berval with a buffer size associated
356 typedef struct berbuf {
357 struct berval bb_val;
361 #define BB_NULL { { 0, NULL }, 0 }
363 typedef struct backsql_srch_info {
368 #define BSQL_SF_NONE 0x0000U
369 #define BSQL_SF_ALL_USER 0x0001U
370 #define BSQL_SF_ALL_OPER 0x0002U
371 #define BSQL_SF_ALL_ATTRS (BSQL_SF_ALL_USER|BSQL_SF_ALL_OPER)
372 #define BSQL_SF_FILTER_HASSUBORDINATE 0x0010U
373 #define BSQL_SF_FILTER_ENTRYUUID 0x0020U
374 #define BSQL_SF_FILTER_ENTRYCSN 0x0040U
375 #define BSQL_SF_RETURN_ENTRYUUID (BSQL_SF_FILTER_ENTRYUUID << 8)
377 struct berval *bsi_base_ndn;
378 int bsi_use_subtree_shortcut;
379 backsql_entryID bsi_base_id;
381 /* BACKSQL_SCOPE_BASE_LIKE can be set by API in ors_scope
382 * whenever the search base DN contains chars that cannot
383 * be mapped into the charset used in the RDBMS; so they're
384 * turned into '%' and an approximate ('LIKE') condition
386 #define BACKSQL_SCOPE_BASE_LIKE ( LDAP_SCOPE_BASE | 0x1000 )
392 backsql_entryID *bsi_id_list,
395 int bsi_n_candidates;
399 backsql_oc_map_rec *bsi_oc;
400 struct berbuf bsi_sel,
404 ObjectClass *bsi_filter_oc;
406 AttributeName *bsi_attrs;
412 * Backend private data structure
422 * SQL condition for subtree searches differs in syntax:
423 * "LIKE CONCAT('%',?)" or "LIKE '%'+?" or "LIKE '%'||?"
426 struct berval sql_subtree_cond;
427 struct berval sql_children_cond;
430 char *sql_insentry_query,
432 *sql_delobjclasses_query,
433 *sql_delreferrals_query;
435 char *sql_has_children_query;
437 MatchingRule *sql_caseIgnoreMatch;
438 MatchingRule *sql_telephoneNumberMatch;
440 struct berval sql_upper_func;
441 struct berval sql_upper_func_open;
442 struct berval sql_upper_func_close;
443 BerVarray sql_concat_func;
445 struct berval sql_strcast_func;
447 unsigned int sql_flags;
448 #define BSQLF_SCHEMA_LOADED 0x0001
449 #define BSQLF_UPPER_NEEDS_CAST 0x0002
450 #define BSQLF_CREATE_NEEDS_SELECT 0x0004
451 #define BSQLF_FAIL_IF_NO_MAPPING 0x0008
452 #define BSQLF_HAS_LDAPINFO_DN_RU 0x0010
453 #define BSQLF_DONTCHECK_LDAPINFO_DN_RU 0x0020
454 #define BSQLF_USE_REVERSE_DN 0x0040
455 #define BSQLF_ALLOW_ORPHANS 0x0080
456 #define BSQLF_USE_SUBTREE_SHORTCUT 0x0100
458 #define BACKSQL_SCHEMA_LOADED(si) \
459 ((si)->sql_flags & BSQLF_SCHEMA_LOADED)
460 #define BACKSQL_UPPER_NEEDS_CAST(si) \
461 ((si)->sql_flags & BSQLF_UPPER_NEEDS_CAST)
462 #define BACKSQL_CREATE_NEEDS_SELECT(si) \
463 ((si)->sql_flags & BSQLF_CREATE_NEEDS_SELECT)
464 #define BACKSQL_FAIL_IF_NO_MAPPING(si) \
465 ((si)->sql_flags & BSQLF_FAIL_IF_NO_MAPPING)
466 #define BACKSQL_HAS_LDAPINFO_DN_RU(si) \
467 ((si)->sql_flags & BSQLF_HAS_LDAPINFO_DN_RU)
468 #define BACKSQL_DONTCHECK_LDAPINFO_DN_RU(si) \
469 ((si)->sql_flags & BSQLF_DONTCHECK_LDAPINFO_DN_RU)
470 #define BACKSQL_USE_REVERSE_DN(si) \
471 ((si)->sql_flags & BSQLF_USE_REVERSE_DN)
472 #define BACKSQL_CANUPPERCASE(si) \
473 (!BER_BVISNULL( &(si)->sql_upper_func ))
474 #define BACKSQL_ALLOW_ORPHANS(si) \
475 ((si)->sql_flags & BSQLF_ALLOW_ORPHANS)
476 #define BACKSQL_USE_SUBTREE_SHORTCUT(si) \
477 ((si)->sql_flags & BSQLF_USE_SUBTREE_SHORTCUT)
479 Entry *sql_baseObject;
480 #ifdef BACKSQL_ARBITRARY_KEY
481 #define BACKSQL_BASEOBJECT_IDSTR "baseObject"
482 #define BACKSQL_BASEOBJECT_KEYVAL BACKSQL_BASEOBJECT_IDSTR
483 #define BACKSQL_IS_BASEOBJECT_ID(id) (bvmatch((id), &backsql_baseObject_bv))
484 #else /* ! BACKSQL_ARBITRARY_KEY */
485 #define BACKSQL_BASEOBJECT_ID 0
486 #define BACKSQL_BASEOBJECT_IDSTR "0"
487 #define BACKSQL_BASEOBJECT_KEYVAL 0
488 #define BACKSQL_IS_BASEOBJECT_ID(id) (*(id) == BACKSQL_BASEOBJECT_ID)
489 #endif /* ! BACKSQL_ARBITRARY_KEY */
490 #define BACKSQL_BASEOBJECT_OC 0
492 Avlnode *sql_db_conns;
493 Avlnode *sql_oc_by_oc;
494 Avlnode *sql_oc_by_id;
495 ldap_pvt_thread_mutex_t sql_dbconn_mutex;
496 ldap_pvt_thread_mutex_t sql_schema_mutex;
499 backsql_api *sql_api;
502 #define BACKSQL_SUCCESS( rc ) \
503 ( (rc) == SQL_SUCCESS || (rc) == SQL_SUCCESS_WITH_INFO )
505 #define BACKSQL_AVL_STOP 0
506 #define BACKSQL_AVL_CONTINUE 1
508 /* see ldap.h for the meaning of the macros and of the values */
509 #define BACKSQL_LEGAL_ERROR( rc ) \
510 ( LDAP_RANGE( (rc), 0x00, 0x0e ) \
511 || LDAP_ATTR_ERROR( (rc) ) \
512 || LDAP_NAME_ERROR( (rc) ) \
513 || LDAP_SECURITY_ERROR( (rc) ) \
514 || LDAP_SERVICE_ERROR( (rc) ) \
515 || LDAP_UPDATE_ERROR( (rc) ) )
516 #define BACKSQL_SANITIZE_ERROR( rc ) \
517 ( BACKSQL_LEGAL_ERROR( (rc) ) ? (rc) : LDAP_OTHER )
519 #endif /* __BACKSQL_H__ */