Home | History | Annotate | Download | only in overlays

Lines Matching defs:uuids

150 	Avlnode *uuids;
630 BerVarray uuids;
646 pc->uuids[pc->num].bv_val = pc->last;
647 AC_MEMCPY( pc->uuids[pc->num].bv_val, a->a_nvals[0].bv_val,
648 pc->uuids[pc->num].bv_len );
650 pc->last = pc->uuids[pc->num].bv_val;
651 pc->uuids[pc->num].bv_val = NULL;
661 0, pc->uuids, 0 );
662 pc->uuids[pc->num].bv_val = pc->last;
664 pc->last = pc->uuids[0].bv_val;
796 pcookie.uuids = op->o_tmpalloc( (SLAP_SYNCUUID_SET_SIZE+1) *
799 pcookie.last = (char *)(pcookie.uuids + SLAP_SYNCUUID_SET_SIZE+1);
800 pcookie.uuids[0].bv_val = pcookie.last;
801 pcookie.uuids[0].bv_len = UUID_LEN;
803 pcookie.uuids[i].bv_val = pcookie.uuids[i-1].bv_val + UUID_LEN;
804 pcookie.uuids[i].bv_len = UUID_LEN;
841 op->o_tmpfree( pcookie.uuids, op->o_tmpmemctx );
1692 /* Allocate a record. UUIDs are not NUL-terminated. */
1783 * Check whether the last nmods UUIDs in the uuids list exist in the database
1785 * and return the number of UUIDs we have confirmed are gone now.
1790 struct berval *uuids,
1824 mf.f_av_value = uuids[ len - 1 - i ];
1836 uuids[ len - 1 - i ].bv_len = 0;
1964 bv = ldap_avl_find( uuid_progress->uuids, uuid, sp_uuid_cmp );
1988 rc = ldap_avl_insert( &uuid_progress->uuids, bv, sp_uuid_cmp, ldap_avl_dup_error );
2005 ndel = ldap_avl_free( uuid_progress->uuids, NULL );
2007 uuid_progress->uuids = NULL;
2023 BerVarray uuids, csns;
2069 uuids = op->o_tmpalloc( (num) * sizeof( struct berval ) +
2071 uuids[0].bv_val = (char *)(uuids + num);
2077 /* Make a copy of the relevant UUIDs. Put the Deletes up front
2138 uuids[j].bv_val = uuids[0].bv_val + (j * UUID_LEN);
2139 AC_MEMCPY(uuids[j].bv_val, se->se_uuid.bv_val, UUID_LEN);
2140 uuids[j].bv_len = UUID_LEN;
2149 lutil_uuidstr_from_normalized( uuids[j].bv_val, uuids[j].bv_len,
2167 uuids[i].bv_len = 0;
2176 if ( bvmatch( &uuids[j], &uuids[num - 1 - i] )) {
2177 uuids[num - 1 - i].bv_len = 0;
2182 if ( uuids[num - 1 - i].bv_len == 0 ) continue;
2184 if ( bvmatch( &uuids[num - 1 - j], &uuids[num - 1 - i] )) {
2185 uuids[num - 1 - i].bv_len = 0;
2194 check_uuidlist_presence( op, uuids, num, nmods );
2204 if ( j < nmods && BER_BVISEMPTY( &uuids[ num - 1 - j ] ) ) {
2221 uuid[0] = uuids[index];
2239 op->o_tmpfree( uuids, op->o_tmpmemctx );
2385 * Allocate memory for list_len uuids for use by the callback, populate
2393 * - number of uuids we already have in the list
2408 ldap_avl_free( uuid_progress.uuids, NULL );
3489 /* If changed and doing Present lookup, send Present UUIDs */