/* $OpenLDAP$ */
/*
- * Copyright 2000 The OpenLDAP Foundation, All Rights Reserved.
+ * Copyright 2000-2002 The OpenLDAP Foundation, All Rights Reserved.
* COPYING RESTRICTIONS APPLY, see COPYRIGHT file
*/
#include "slap.h"
#include "sets.h"
-static BVarray set_join (BVarray lset, int op, BVarray rset);
-static BVarray set_chase (SET_GATHER gatherer,
- void *cookie, BVarray set, struct berval *attr, int closure);
+static BerVarray set_join (BerVarray lset, int op, BerVarray rset);
+static BerVarray set_chase (SLAP_SET_GATHER gatherer,
+ void *cookie, BerVarray set, struct berval *attr, int closure);
static int set_samedn (char *dn1, char *dn2);
long
-set_size (BVarray set)
+slap_set_size (BerVarray set)
{
int i;
}
void
-set_dispose (BVarray set)
+slap_set_dispose (BerVarray set)
{
- bvarray_free(set);
+ ber_bvarray_free(set);
}
-static BVarray
-set_join (BVarray lset, int op, BVarray rset)
+static BerVarray
+set_join (BerVarray lset, int op, BerVarray rset)
{
- BVarray set;
+ BerVarray set;
long i, j, last;
set = NULL;
return(ch_calloc(1, sizeof(struct berval)));
return(lset);
}
- set_dispose(lset);
+ slap_set_dispose(lset);
return(rset);
}
if (rset == NULL || rset->bv_val == NULL) {
- set_dispose(rset);
+ slap_set_dispose(rset);
return(lset);
}
- i = set_size(lset) + set_size(rset) + 1;
+ i = slap_set_size(lset) + slap_set_size(rset) + 1;
set = ch_calloc(i, sizeof(struct berval));
if (set != NULL) {
/* set_chase() depends on this routine to
} else {
set = lset;
lset = NULL;
- last = set_size(set) - 1;
+ last = slap_set_size(set) - 1;
for (i = 0; set[i].bv_val; i++) {
for (j = 0; rset[j].bv_val; j++) {
if (set_samedn(set[i].bv_val, rset[j].bv_val))
}
}
- set_dispose(lset);
- set_dispose(rset);
+ slap_set_dispose(lset);
+ slap_set_dispose(rset);
return(set);
}
-static BVarray
-set_chase (SET_GATHER gatherer,
- void *cookie, BVarray set, struct berval *attr, int closure)
+static BerVarray
+set_chase (SLAP_SET_GATHER gatherer,
+ void *cookie, BerVarray set, struct berval *attr, int closure)
{
- BVarray vals, nset;
+ BerVarray vals, nset;
char attrstr[32];
struct berval bv = {attr->bv_len, attrstr};
int i;
return(set);
if (attr->bv_len > (sizeof(attrstr) - 1)) {
- set_dispose(set);
+ slap_set_dispose(set);
return(NULL);
}
AC_MEMCPY(attrstr, attr->bv_val, attr->bv_len);
nset = ch_calloc(1, sizeof(struct berval));
if (nset == NULL) {
- set_dispose(set);
+ slap_set_dispose(set);
return(NULL);
}
for (i = 0; set[i].bv_val; i++) {
if (vals != NULL)
nset = set_join(nset, '|', vals);
}
- set_dispose(set);
+ slap_set_dispose(set);
if (closure) {
for (i = 0; nset[i].bv_val; i++) {
}
int
-set_filter (SET_GATHER gatherer,
- void *cookie, struct berval *fbv, char *user, char *this, BVarray *results)
+slap_set_filter (SLAP_SET_GATHER gatherer,
+ void *cookie, struct berval *fbv,
+ char *user, char *this, BerVarray *results)
{
#define IS_SET(x) ( (long)(x) >= 256 )
#define IS_OP(x) ( (long)(x) < 256 )
#define SF_ERROR(x) do { rc = -1; goto _error; } while (0)
-#define SF_TOP() ( (BVarray)( (stp < 0) ? 0 : stack[stp] ) )
-#define SF_POP() ( (BVarray)( (stp < 0) ? 0 : stack[stp--] ) )
+#define SF_TOP() ( (BerVarray)( (stp < 0) ? 0 : stack[stp] ) )
+#define SF_POP() ( (BerVarray)( (stp < 0) ? 0 : stack[stp--] ) )
#define SF_PUSH(x) do { \
if (stp >= 63) SF_ERROR(overflow); \
- stack[++stp] = (BVarray)(long)(x); \
+ stack[++stp] = (BerVarray)(long)(x); \
} while (0)
- BVarray set, lset;
- BVarray stack[64];
+ BerVarray set, lset;
+ BerVarray stack[64];
int len, op, rc, stp;
char c, *filter = fbv->bv_val;
} else if (SF_TOP() != (void *)'/') {
SF_ERROR(syntax);
} else {
- SF_POP();
struct berval fb2;
+ SF_POP();
fb2.bv_val = filter;
fb2.bv_len = len;
set = set_chase(gatherer,
SF_ERROR(syntax);
}
- rc = set_size(set);
+ rc = slap_set_size(set);
if (results) {
*results = set;
set = NULL;
_error:
if (IS_SET(set))
- set_dispose(set);
+ slap_set_dispose(set);
while ((set = SF_POP())) {
if (IS_SET(set))
- set_dispose(set);
+ slap_set_dispose(set);
}
return(rc);
}