2 /* This work is part of OpenLDAP Software <http://www.openldap.org/>.
4 * Copyright 2000-2014 The OpenLDAP Foundation.
7 * Redistribution and use in source and binary forms, with or without
8 * modification, are permitted only as authorized by the OpenLDAP
11 * A copy of this license is available in the file LICENSE in the
12 * top-level directory of the distribution or, alternatively, at
13 * <http://www.OpenLDAP.org/license.html>.
16 * This work was initially developed by Pierangelo Masarati for
17 * inclusion in OpenLDAP Software.
22 #include "rewrite-int.h"
25 * Compiles a substitution pattern
27 struct rewrite_subst *
28 rewrite_subst_compile(
29 struct rewrite_info *info,
34 struct berval *subs = NULL, *tmps;
35 struct rewrite_submatch *submatch = NULL;
37 struct rewrite_subst *s = NULL;
39 char *result, *begin, *p;
42 assert( info != NULL );
43 assert( str != NULL );
45 result = strdup( str );
46 if ( result == NULL ) {
51 * Take care of substitution string
53 for ( p = begin = result, subs_len = 0; p[ 0 ] != '\0'; p++ ) {
56 * Keep only single escapes '%'
58 if ( !IS_REWRITE_SUBMATCH_ESCAPE( p[ 0 ] ) ) {
62 if ( IS_REWRITE_SUBMATCH_ESCAPE( p[ 1 ] ) ) {
63 /* Pull &p[1] over p, including the trailing '\0' */
64 AC_MEMCPY((char *)p, &p[ 1 ], strlen( p ) );
68 tmps = ( struct berval * )realloc( subs,
69 sizeof( struct berval )*( nsub + 1 ) );
76 * I think an `if l > 0' at runtime is better outside than
77 * inside a function call ...
82 subs[ nsub ].bv_len = l;
83 subs[ nsub ].bv_val = malloc( l + 1 );
84 if ( subs[ nsub ].bv_val == NULL ) {
87 AC_MEMCPY( subs[ nsub ].bv_val, begin, l );
88 subs[ nsub ].bv_val[ l ] = '\0';
90 subs[ nsub ].bv_val = NULL;
91 subs[ nsub ].bv_len = 0;
95 * Substitution pattern
97 if ( isdigit( (unsigned char) p[ 1 ] ) ) {
98 struct rewrite_submatch *tmpsm;
102 * Add a new value substitution scheme
105 tmpsm = ( struct rewrite_submatch * )realloc( submatch,
106 sizeof( struct rewrite_submatch )*( nsub + 1 ) );
107 if ( tmpsm == NULL ) {
111 submatch[ nsub ].ls_submatch = d;
114 * If there is no argument, use default
115 * (substitute substring as is)
117 if ( p[ 2 ] != '{' ) {
118 submatch[ nsub ].ls_type =
119 REWRITE_SUBMATCH_ASIS;
120 submatch[ nsub ].ls_map = NULL;
124 struct rewrite_map *map;
126 submatch[ nsub ].ls_type =
127 REWRITE_SUBMATCH_XMAP;
129 map = rewrite_xmap_parse( info,
130 p + 3, (const char **)&begin );
134 submatch[ nsub ].ls_map = map;
141 } else if ( p[ 1 ] == '{' ) {
142 struct rewrite_map *map;
143 struct rewrite_submatch *tmpsm;
145 map = rewrite_map_parse( info, p + 2,
146 (const char **)&begin );
153 * Add a new value substitution scheme
155 tmpsm = ( struct rewrite_submatch * )realloc( submatch,
156 sizeof( struct rewrite_submatch )*( nsub + 1 ) );
157 if ( tmpsm == NULL ) {
161 submatch[ nsub ].ls_type =
162 REWRITE_SUBMATCH_MAP_W_ARG;
163 submatch[ nsub ].ls_map = map;
168 } else if ( p[ 1 ] == '%' ) {
169 AC_MEMCPY( &p[ 1 ], &p[ 2 ], strlen( &p[ 1 ] ) );
180 * Last part of string
182 tmps = (struct berval * )realloc( subs, sizeof( struct berval )*( nsub + 1 ) );
183 if ( tmps == NULL ) {
185 * XXX need to free the value subst stuff!
194 subs[ nsub ].bv_len = l;
195 subs[ nsub ].bv_val = malloc( l + 1 );
196 if ( subs[ nsub ].bv_val == NULL ) {
199 AC_MEMCPY( subs[ nsub ].bv_val, begin, l );
200 subs[ nsub ].bv_val[ l ] = '\0';
202 subs[ nsub ].bv_val = NULL;
203 subs[ nsub ].bv_len = 0;
206 s = calloc( sizeof( struct rewrite_subst ), 1 );
211 s->lt_subs_len = subs_len;
213 s->lt_num_submatch = nsub;
214 s->lt_submatch = submatch;
220 for ( l=0; l<nsub; l++ ) {
221 free( subs[nsub].bv_val );
226 for ( l=0; l<nsub; l++ ) {
227 free( submatch[nsub].ls_map );
237 * Copies the match referred to by submatch and fetched in string by match.
238 * Helper for rewrite_rule_apply.
242 struct rewrite_submatch *submatch,
244 const regmatch_t *match,
251 assert( submatch != NULL );
252 assert( submatch->ls_type == REWRITE_SUBMATCH_ASIS
253 || submatch->ls_type == REWRITE_SUBMATCH_XMAP );
254 assert( string != NULL );
255 assert( match != NULL );
256 assert( val != NULL );
257 assert( val->bv_val == NULL );
259 c = submatch->ls_submatch;
260 s = string + match[ c ].rm_so;
261 l = match[ c ].rm_eo - match[ c ].rm_so;
264 val->bv_val = malloc( l + 1 );
265 if ( val->bv_val == NULL ) {
269 AC_MEMCPY( val->bv_val, s, l );
270 val->bv_val[ l ] = '\0';
272 return REWRITE_SUCCESS;
276 * Substitutes a portion of rewritten string according to substitution
277 * pattern using submatches
281 struct rewrite_info *info,
282 struct rewrite_op *op,
283 struct rewrite_subst *subst,
285 const regmatch_t *match,
289 struct berval *submatch = NULL;
292 int rc = REWRITE_REGEXEC_OK;
294 assert( info != NULL );
295 assert( op != NULL );
296 assert( subst != NULL );
297 assert( string != NULL );
298 assert( match != NULL );
299 assert( val != NULL );
301 assert( val->bv_val == NULL );
307 * Prepare room for submatch expansion
309 if ( subst->lt_num_submatch > 0 ) {
310 submatch = calloc( sizeof( struct berval ),
311 subst->lt_num_submatch );
312 if ( submatch == NULL ) {
313 return REWRITE_REGEXEC_ERR;
318 * Resolve submatches (simple subst, map expansion and so).
320 for ( n = 0, l = 0; n < subst->lt_num_submatch; n++ ) {
321 struct berval key = { 0, NULL };
323 submatch[ n ].bv_val = NULL;
328 switch ( subst->lt_submatch[ n ].ls_type ) {
329 case REWRITE_SUBMATCH_ASIS:
330 case REWRITE_SUBMATCH_XMAP:
331 rc = submatch_copy( &subst->lt_submatch[ n ],
332 string, match, &key );
333 if ( rc != REWRITE_SUCCESS ) {
334 rc = REWRITE_REGEXEC_ERR;
339 case REWRITE_SUBMATCH_MAP_W_ARG:
340 switch ( subst->lt_submatch[ n ].ls_map->lm_type ) {
341 case REWRITE_MAP_GET_OP_VAR:
342 case REWRITE_MAP_GET_SESN_VAR:
343 case REWRITE_MAP_GET_PARAM:
344 rc = REWRITE_SUCCESS;
348 rc = rewrite_subst_apply( info, op,
349 subst->lt_submatch[ n ].ls_map->lm_subst,
350 string, match, &key);
353 if ( rc != REWRITE_SUCCESS ) {
359 Debug( LDAP_DEBUG_ANY, "Not Implemented\n", 0, 0, 0 );
364 if ( rc != REWRITE_SUCCESS ) {
365 rc = REWRITE_REGEXEC_ERR;
372 switch ( subst->lt_submatch[ n ].ls_type ) {
373 case REWRITE_SUBMATCH_ASIS:
375 rc = REWRITE_SUCCESS;
378 case REWRITE_SUBMATCH_XMAP:
379 rc = rewrite_xmap_apply( info, op,
380 subst->lt_submatch[ n ].ls_map,
381 &key, &submatch[ n ] );
386 case REWRITE_SUBMATCH_MAP_W_ARG:
387 rc = rewrite_map_apply( info, op,
388 subst->lt_submatch[ n ].ls_map,
389 &key, &submatch[ n ] );
396 * When implemented, this might return the
397 * exit status of a rewrite context,
398 * which may include a stop, or an
399 * unwilling to perform
405 if ( rc != REWRITE_SUCCESS ) {
406 rc = REWRITE_REGEXEC_ERR;
411 * Increment the length of the resulting string
413 l += submatch[ n ].bv_len;
417 * Alloc result buffer
419 l += subst->lt_subs_len;
420 res = malloc( l + 1 );
422 rc = REWRITE_REGEXEC_ERR;
427 * Apply submatches (possibly resolved thru maps)
429 for ( n = 0, cl = 0; n < subst->lt_num_submatch; n++ ) {
430 if ( subst->lt_subs[ n ].bv_val != NULL ) {
431 AC_MEMCPY( res + cl, subst->lt_subs[ n ].bv_val,
432 subst->lt_subs[ n ].bv_len );
433 cl += subst->lt_subs[ n ].bv_len;
435 AC_MEMCPY( res + cl, submatch[ n ].bv_val,
436 submatch[ n ].bv_len );
437 cl += submatch[ n ].bv_len;
439 if ( subst->lt_subs[ n ].bv_val != NULL ) {
440 AC_MEMCPY( res + cl, subst->lt_subs[ n ].bv_val,
441 subst->lt_subs[ n ].bv_len );
442 cl += subst->lt_subs[ n ].bv_len;
451 for ( ; --n >= 0; ) {
452 if ( submatch[ n ].bv_val ) {
453 free( submatch[ n ].bv_val );
466 rewrite_subst_destroy(
467 struct rewrite_subst **psubst
471 struct rewrite_subst *subst;
473 assert( psubst != NULL );
474 assert( *psubst != NULL );
478 for ( n = 0; n < subst->lt_num_submatch; n++ ) {
479 if ( subst->lt_subs[ n ].bv_val ) {
480 free( subst->lt_subs[ n ].bv_val );
481 subst->lt_subs[ n ].bv_val = NULL;
484 switch ( subst->lt_submatch[ n ].ls_type ) {
485 case REWRITE_SUBMATCH_ASIS:
488 case REWRITE_SUBMATCH_XMAP:
489 rewrite_xmap_destroy( &subst->lt_submatch[ n ].ls_map );
492 case REWRITE_SUBMATCH_MAP_W_ARG:
493 rewrite_map_destroy( &subst->lt_submatch[ n ].ls_map );
501 free( subst->lt_submatch );
502 subst->lt_submatch = NULL;
505 if ( subst->lt_subs[ n ].bv_val ) {
506 free( subst->lt_subs[ n ].bv_val );
507 subst->lt_subs[ n ].bv_val = NULL;
510 free( subst->lt_subs );
511 subst->lt_subs = NULL;