2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 1999-2005 The OpenLDAP Foundation.
5 * Portions Copyright 1999 Dmitry Kovalev.
8 * Redistribution and use in source and binary forms, with or without
9 * modification, are permitted only as authorized by the OpenLDAP
12 * A copy of this license is available in the file LICENSE in the
13 * top-level directory of the distribution or, alternatively, at
14 * <http://www.OpenLDAP.org/license.html>.
17 * This work was initially developed by Dmitry Kovalev for inclusion
18 * by OpenLDAP Software.
26 #include <sys/types.h>
27 #include "ac/string.h"
29 #include "ac/stdarg.h"
34 #include "proto-sql.h"
36 #define BACKSQL_MAX(a,b) ((a)>(b)?(a):(b))
37 #define BACKSQL_MIN(a,b) ((a)<(b)?(a):(b))
39 #define BACKSQL_STR_GROW 256
41 char backsql_def_oc_query[] =
42 "SELECT id,name,keytbl,keycol,create_proc,delete_proc,expect_return "
43 "FROM ldap_oc_mappings";
44 char backsql_def_needs_select_oc_query[] =
45 "SELECT id,name,keytbl,keycol,create_proc,create_keyval,delete_proc,"
46 "expect_return FROM ldap_oc_mappings";
47 char backsql_def_at_query[] =
48 "SELECT name,sel_expr,from_tbls,join_where,add_proc,delete_proc,"
49 "param_order,expect_return,sel_expr_u FROM ldap_attr_mappings "
51 char backsql_def_delentry_query[] = "DELETE FROM ldap_entries WHERE id=?";
52 char backsql_def_insentry_query[] =
53 "INSERT INTO ldap_entries (dn,oc_map_id,parent,keyval) "
55 char backsql_def_delobjclasses_query[] = "DELETE FROM ldap_entry_objclasses "
57 char backsql_def_delreferrals_query[] = "DELETE FROM ldap_referrals "
59 char backsql_def_subtree_cond[] = "ldap_entries.dn LIKE CONCAT('%',?)";
60 char backsql_def_upper_subtree_cond[] = "(ldap_entries.dn) LIKE CONCAT('%',?)";
61 char backsql_id_query[] = "SELECT id,keyval,oc_map_id FROM ldap_entries WHERE ";
62 /* better ?||? or cast(?||? as varchar) */
63 char backsql_def_concat_func[] = "CONCAT(?,?)";
66 char backsql_check_dn_ru_query[] = "SELECT dn_ru FROM ldap_entries";
69 backsql_strcat( struct berbuf *dest, ... )
72 ber_len_t cdlen, cslen, grow;
76 assert( dest->bb_val.bv_val == NULL
77 || dest->bb_val.bv_len == strlen( dest->bb_val.bv_val ) );
80 Debug( LDAP_DEBUG_TRACE, "==>backsql_strcat()\n", 0, 0, 0 );
81 #endif /* BACKSQL_TRACE */
83 va_start( strs, dest );
84 if ( dest->bb_val.bv_val == NULL || dest->bb_len == 0 ) {
85 dest->bb_val.bv_val = (char *)ch_calloc( BACKSQL_STR_GROW,
87 dest->bb_val.bv_len = 0;
88 dest->bb_len = BACKSQL_STR_GROW;
90 cdlen = dest->bb_val.bv_len;
91 while ( ( cstr = va_arg( strs, char * ) ) != NULL ) {
92 cslen = strlen( cstr );
93 grow = BACKSQL_MAX( BACKSQL_STR_GROW, cslen );
94 if ( dest->bb_len - cdlen <= cslen ) {
98 Debug( LDAP_DEBUG_TRACE, "backsql_strcat(): "
99 "buflen=%d, cdlen=%d, cslen=%d "
100 "-- reallocating dest\n",
101 dest->bb_len, cdlen + 1, cslen );
102 #endif /* BACKSQL_TRACE */
104 tmp_dest = (char *)ch_realloc( dest->bb_val.bv_val,
105 ( dest->bb_len ) + grow * sizeof( char ) );
106 if ( tmp_dest == NULL ) {
107 Debug( LDAP_DEBUG_ANY, "backsql_strcat(): "
108 "could not reallocate string buffer.\n",
112 dest->bb_val.bv_val = tmp_dest;
113 dest->bb_len += grow;
116 Debug( LDAP_DEBUG_TRACE, "backsql_strcat(): "
117 "new buflen=%d, dest=%p\n",
118 dest->bb_len, dest, 0 );
119 #endif /* BACKSQL_TRACE */
121 AC_MEMCPY( dest->bb_val.bv_val + cdlen, cstr, cslen + 1 );
127 Debug( LDAP_DEBUG_TRACE, "<==backsql_strcat() (dest=\"%s\")\n",
128 dest->bb_val.bv_val, 0, 0 );
129 #endif /* BACKSQL_TRACE */
131 dest->bb_val.bv_len = cdlen;
137 backsql_strfcat( struct berbuf *dest, const char *fmt, ... )
144 assert( dest->bb_len == 0 || dest->bb_len > dest->bb_val.bv_len );
145 assert( dest->bb_val.bv_val == NULL
146 || dest->bb_val.bv_len == strlen( dest->bb_val.bv_val ) );
149 Debug( LDAP_DEBUG_TRACE, "==>backsql_strfcat()\n", 0, 0, 0 );
150 #endif /* BACKSQL_TRACE */
152 va_start( strs, fmt );
153 if ( dest->bb_val.bv_val == NULL || dest->bb_len == 0 ) {
154 dest->bb_val.bv_val = (char *)ch_calloc( BACKSQL_STR_GROW,
156 dest->bb_val.bv_len = 0;
157 dest->bb_len = BACKSQL_STR_GROW;
160 cdlen = dest->bb_val.bv_len;
161 for ( ; fmt[0]; fmt++ ) {
162 ber_len_t cslen, grow;
163 char *cstr, cc[ 2 ] = { '\0', '\0' };
166 switch ( fmt[ 0 ] ) {
170 cbv = va_arg( strs, struct berval * );
175 /* length + string */
177 cslen = va_arg( strs, ber_len_t );
178 cstr = va_arg( strs, char * );
183 cstr = va_arg( strs, char * );
184 cslen = strlen( cstr );
190 * `char' is promoted to `int' when passed through `...'
192 cc[0] = va_arg( strs, int );
201 grow = BACKSQL_MAX( BACKSQL_STR_GROW, cslen );
202 if ( dest->bb_len - cdlen <= cslen ) {
206 Debug( LDAP_DEBUG_TRACE, "backsql_strfcat(): "
207 "buflen=%d, cdlen=%d, cslen=%d "
208 "-- reallocating dest\n",
209 dest->bb_len, cdlen + 1, cslen );
210 #endif /* BACKSQL_TRACE */
212 tmp_dest = (char *)ch_realloc( dest->bb_val.bv_val,
213 ( dest->bb_len ) + grow * sizeof( char ) );
214 if ( tmp_dest == NULL ) {
215 Debug( LDAP_DEBUG_ANY, "backsql_strfcat(): "
216 "could not reallocate string buffer.\n",
220 dest->bb_val.bv_val = tmp_dest;
221 dest->bb_len += grow * sizeof( char );
224 Debug( LDAP_DEBUG_TRACE, "backsql_strfcat(): "
225 "new buflen=%d, dest=%p\n", dest->bb_len, dest, 0 );
226 #endif /* BACKSQL_TRACE */
231 AC_MEMCPY( dest->bb_val.bv_val + cdlen, cstr, cslen + 1 );
238 Debug( LDAP_DEBUG_TRACE, "<==backsql_strfcat() (dest=\"%s\")\n",
239 dest->bb_val.bv_val, 0, 0 );
240 #endif /* BACKSQL_TRACE */
242 dest->bb_val.bv_len = cdlen;
248 backsql_entry_addattr(
250 struct berval *at_name,
251 struct berval *at_val,
254 AttributeDescription *ad;
259 Debug( LDAP_DEBUG_TRACE, "backsql_entry_addattr(): "
260 "at_name=\"%s\", at_val=\"%s\"\n",
261 at_name->bv_val, at_val->bv_val, 0 );
262 #endif /* BACKSQL_TRACE */
265 rc = slap_bv2ad( at_name, &ad, &text );
266 if ( rc != LDAP_SUCCESS ) {
267 Debug( LDAP_DEBUG_TRACE, "backsql_entry_addattr(): "
268 "failed to find AttributeDescription for \"%s\"\n",
269 at_name->bv_val, 0, 0 );
273 rc = attr_merge_normalize_one( e, ad, at_val, memctx );
276 Debug( LDAP_DEBUG_TRACE, "backsql_entry_addattr(): "
277 "failed to merge value \"%s\" for attribute \"%s\"\n",
278 at_val->bv_val, at_name->bv_val, 0 );
283 Debug( LDAP_DEBUG_TRACE, "<==backsql_query_addattr()\n", 0, 0, 0 );
284 #endif /* BACKSQL_TRACE */
290 backsql_get_table_spec( char **p )
293 struct berbuf res = BB_NULL;
299 while ( **p && **p != ',' ) {
307 #define BACKSQL_NEXT_WORD { \
308 while ( *s && isspace( (unsigned char)*s ) ) s++; \
309 if ( !*s ) return res.bb_val.bv_val; \
311 while ( *q && !isspace( (unsigned char)*q ) ) q++; \
312 if ( *q ) *q++='\0'; \
317 backsql_strcat( &res, s, NULL );
321 if ( strcasecmp( s, "AS" ) == 0 ) {
326 /* oracle doesn't understand "AS" :( and other RDBMSes don't need it */
327 #ifdef BACKSQL_ALIASING_QUOTE
328 backsql_strfcat( &res, "scsc", " " BACKSQL_ALIASING,
329 BACKSQL_ALIASING_QUOTE, s, BACKSQL_ALIASING_QUOTE );
330 #else /* ! BACKSQL_ALIASING */
331 backsql_strcat( &res, " " BACKSQL_ALIASING, s, NULL );
332 #endif /* ! BACKSQL_ALIASING */
334 return res.bb_val.bv_val;
338 backsql_merge_from_clause(
339 struct berbuf *dest_from,
340 struct berval *src_from )
342 char *s, *p, *srcc, *pos, e;
343 struct berbuf res = BB_NULL;
346 Debug( LDAP_DEBUG_TRACE, "==>backsql_merge_from_clause(): "
347 "dest_from=\"%s\",src_from=\"%s\"\n",
348 dest_from ? dest_from->bb_val.bv_val : "<NULL>",
349 src_from->bv_val, 0 );
350 #endif /* BACKSQL_TRACE */
352 srcc = ch_strdup( src_from->bv_val );
355 if ( dest_from != NULL ) {
360 s = backsql_get_table_spec( &p );
363 Debug( LDAP_DEBUG_TRACE, "backsql_merge_from_clause(): "
364 "p=\"%s\" s=\"%s\"\n", p, s, 0 );
365 #endif /* BACKSQL_TRACE */
367 if ( res.bb_val.bv_val == NULL ) {
368 backsql_strcat( &res, s, NULL );
371 pos = strstr( res.bb_val.bv_val, s );
372 if ( pos == NULL || ( ( e = pos[ strlen( s ) ] ) != '\0' && e != ',' ) ) {
373 backsql_strfcat( &res, "cs", ',', s );
383 Debug( LDAP_DEBUG_TRACE, "<==backsql_merge_from_clause()\n", 0, 0, 0 );
384 #endif /* BACKSQL_TRACE */
393 * splits a pattern in components separated by '?'
394 * (double ?? are turned into single ? and left in the string)
395 * expected contains the number of expected occurrences of '?'
396 * (a negative value means parse as many as possible)
400 backsql_split_pattern(
401 const char *_pattern,
402 BerVarray *split_pattern,
405 char *pattern, *start, *end;
409 #define SPLIT_CHAR '?'
412 assert( split_pattern );
414 pattern = ch_strdup( _pattern );
417 end = strchr( start, SPLIT_CHAR );
418 for ( ; start; expected-- ) {
419 char *real_end = end;
422 if ( real_end == NULL ) {
423 real_end = start + strlen( start );
425 } else if ( real_end[ 1 ] == SPLIT_CHAR ) {
427 AC_MEMCPY( real_end, real_end + 1, strlen( real_end ) );
428 end = strchr( real_end + 1, SPLIT_CHAR );
432 real_len = real_end - start;
433 if ( real_len == 0 ) {
434 ber_str2bv( "", 0, 1, &bv );
436 ber_str2bv( start, real_len, 1, &bv );
439 ber_bvarray_add( split_pattern, &bv );
441 if ( expected == 0 ) {
451 end = strchr( start, SPLIT_CHAR );
463 backsql_prepare_pattern(
464 BerVarray split_pattern,
469 struct berbuf bb = BB_NULL;
473 for ( i = 0; values[i].bv_val; i++ ) {
474 if ( split_pattern[i].bv_val == NULL ) {
475 ch_free( bb.bb_val.bv_val );
478 backsql_strfcat( &bb, "b", &split_pattern[ i ] );
479 backsql_strfcat( &bb, "b", &values[ i ] );
482 if ( split_pattern[ i ].bv_val == NULL ) {
483 ch_free( bb.bb_val.bv_val );
487 backsql_strfcat( &bb, "b", &split_pattern[ i ] );
494 #endif /* SLAPD_SQL */