1 /* Copyright (c) 2003 by International Business Machines, Inc.
3 * International Business Machines, Inc. (hereinafter called IBM) grants
4 * permission under its copyrights to use, copy, modify, and distribute this
5 * Software with or without fee, provided that the above copyright notice and
6 * all paragraphs of this notice appear in all copies, and that the name of IBM
7 * not be used in connection with the marketing of any product incorporating
8 * the Software or modifications thereof, without specific, written prior
11 * THE SOFTWARE IS PROVIDED "AS IS", AND IBM DISCLAIMS ALL WARRANTIES,
12 * INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A
13 * PARTICULAR PURPOSE. IN NO EVENT SHALL IBM BE LIABLE FOR ANY SPECIAL,
14 * DIRECT, INDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER ARISING
15 * OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS SOFTWARE, EVEN
16 * IF IBM IS APPRISED OF THE POSSIBILITY OF SUCH DAMAGES.
23 #include <ac/socket.h>
24 #include <ac/string.h>
29 #include "../back-ldap/back-ldap.h"
30 #include "back-meta.h"
32 #undef ldap_debug /* silence a warning in ldap-int.h */
34 #include "../../../libraries/libldap/ldap-int.h"
39 static struct berval bv_queryid_any = BER_BVC( "(queryid=*)" );
42 add_attribute(AttributeDescription *ad,
54 normalize_values( Attribute* attr );
62 struct timeval tv; /* time */
63 enum type_of_result err;
72 struct exception* result )
81 result->type = SUCCESS;
83 if ( e->e_dn != NULL ) {
84 tmplen = strlen( e->e_dn );
85 size = LDIF_SIZE_NEEDED( 2, tmplen );
88 for ( a = e->e_attrs; a != NULL; a = a->a_next ) {
89 for ( i = 0; a->a_vals[i].bv_val != NULL; i++ ) {
91 tmplen = a->a_desc->ad_cname.bv_len;
92 size += LDIF_SIZE_NEEDED( tmplen, bv.bv_len);
95 if ((size < size_init) && result) {
96 result->type = SIZE_ERR;
105 struct berval* query_uuid,
106 struct exception* result )
108 struct entry_info info;
110 Modifications* modlist = NULL;
111 const char* text = NULL;
112 BerVarray value_array;
113 Attribute *uuid_attr, *attr;
116 SlapReply sreply = {REP_RESULT};
118 Operation op_tmp = *op;
121 sreply.sr_entry = NULL;
122 sreply.sr_nentries = 0;
124 e = ( Entry * ) ch_calloc( 1, sizeof( Entry ));
125 dnPrettyNormal(0, &rs->sr_entry->e_name, &e->e_name, &e->e_nname, op->o_tmpmemctx);
129 e->e_bv.bv_val = NULL;
131 /* add queryid attribute */
132 value_array = (struct berval *)malloc(2 * sizeof( struct berval) );
133 ber_dupbv(value_array, query_uuid);
134 value_array[1].bv_val = NULL;
135 value_array[1].bv_len = 0;
137 uuid_attr = add_attribute(slap_schema.si_ad_queryid, e, value_array);
139 /* append the attribute list from the fetched entry */
140 uuid_attr->a_next = rs->sr_entry->e_attrs;
141 rs->sr_entry->e_attrs = NULL;
143 for ( attr = e->e_attrs; attr; attr = attr->a_next ) {
144 if ( normalize_values( attr ) ) {
145 info.err = MERGE_ERR;
146 result->rc = info.err;
152 info.uuid = query_uuid;
153 info.size_init = get_entry_size( rs->sr_entry, 0, 0 );
156 info.glue_be = op->o_bd;
158 cb.sc_private = &info;
159 cb.sc_response = null_response;
161 op_tmp.o_tag = LDAP_REQ_ADD;
162 op_tmp.o_protocol = LDAP_VERSION3;
163 op_tmp.o_callback = &cb;
164 op_tmp.o_time = slap_get_time();
165 op_tmp.o_do_not_cache = 1;
168 op_tmp.o_req_dn = e->e_name;
169 op_tmp.o_req_ndn = e->e_nname;
170 rc = op->o_bd->be_add( &op_tmp, &sreply );
172 if ( rc != LDAP_SUCCESS ) {
173 if ( rc == LDAP_ALREADY_EXISTS ) {
174 slap_entry2mods( e, &modlist, &text );
175 op_tmp.o_tag = LDAP_REQ_MODIFY;
176 op_tmp.orm_modlist = modlist;
177 op_tmp.o_req_dn = e->e_name;
178 op_tmp.o_req_ndn = e->e_nname;
179 rc = op->o_bd->be_modify( &op_tmp, &sreply );
180 result->rc = info.added;
181 } else if ( rc == LDAP_REFERRAL ||
182 rc == LDAP_NO_SUCH_OBJECT ) {
183 slap_entry2mods( e, &modlist, &text );
184 syncrepl_add_glue( NULL, NULL, &op_tmp, e, modlist, 0, NULL, NULL );
185 result->rc = info.added;
189 if ( modlist != NULL ) slap_mods_free( modlist );
192 result->rc = info.added;
193 be_entry_release_w( &op_tmp, e );
197 info.size_final = get_entry_size( e, info.size_init, result );
199 info.size_final = info.size_init;
201 return ( info.size_final - info.size_init );
205 add_attribute(AttributeDescription *ad,
207 BerVarray value_array)
209 Attribute* new_attr, *last_attr;
212 if (e->e_attrs == NULL)
215 for (last_attr = e->e_attrs; last_attr->a_next;
216 last_attr = last_attr->a_next)
219 new_attr = (Attribute*)malloc(sizeof(Attribute));
221 last_attr->a_next = new_attr;
223 e->e_attrs = new_attr;
225 new_attr->a_next = NULL;
226 new_attr->a_desc = NULL;
227 new_attr->a_vals = value_array;
228 new_attr->a_desc = ad;
242 normalize_values( Attribute* attr )
246 if (attr->a_vals == NULL) {
247 attr->a_nvals = NULL;
251 for ( nvals = 0; attr->a_vals[nvals].bv_val; nvals++ )
254 attr->a_nvals = (struct berval*)ch_malloc((nvals+1)*sizeof(struct berval));
256 if ( attr->a_desc->ad_type->sat_equality &&
257 attr->a_desc->ad_type->sat_equality->smr_normalize )
259 for ( i = 0; i < nvals; i++ ) {
260 rc = attr->a_desc->ad_type->sat_equality->smr_normalize(
262 attr->a_desc->ad_type->sat_syntax,
263 attr->a_desc->ad_type->sat_equality,
264 &attr->a_vals[i], &attr->a_nvals[i], NULL );
267 LDAP_LOG( OPERATION, DETAIL1,
268 "Error in normalizing attribute %s value %d (%d)\n",
269 attr->a_desc->ad_cname.bv_val, i, rc );
271 Debug( LDAP_DEBUG_ANY,
272 "Error in normalizing attribute %s value %d (%d)\n",
273 attr->a_desc->ad_cname.bv_val, i, rc );
279 for ( i = 0; i < nvals; i++ ) {
280 ber_dupbv( &attr->a_nvals[i], &attr->a_vals[i] );
284 attr->a_nvals[i].bv_val = NULL;
285 attr->a_nvals[i].bv_len = 0;
290 #endif /* LDAP_CACHING */