int
makeListOrganisations (struct namelist **olistp)
{
entrystruct * x;
int retval;
if (rebind() != OK)
return NOTOK;
retval = ds_search(&sarg, &serror, &sresult);
if ((retval == DSE_INTR_ABANDONED) &&
(serror.dse_type == DSE_ABANDONED))
abandoned = TRUE;
if (retval != OK)
return NOTOK;
correlate_search_results (&sresult);
setProblemFlags(sresult);
highNumber = 0;
for (x = sresult.CSR_entries; x != NULLENTRYINFO; x = x->ent_next) {
*olistp = list_alloc();
(*olistp)->name = dn2pstr(x->ent_dn);
(*olistp)->ats = as_cpy(x->ent_attr);
olistp = &(*olistp)->next;
highNumber++;
}
*olistp = NULLLIST;
entryinfo_free(sresult.CSR_entries, 0);
dn_free (sresult.CSR_object);
crefs_free (sresult.CSR_cr);
filter_free(sarg.sra_filter);
return OK;
}
int
turbo_sibling_search (Entry e, struct search_kid_arg *ska)
{
EntryInfo *list;
Entry *tmp;
DN dn;
Index *pindex;
*ska->ska_einfo = NULLENTRYINFO;
if ( e->e_leaf )
return;
if ( e->e_children == NULLAVL ) {
search_refer( ska->ska_arg, e, ska->ska_local, ska->ska_refer,
ska->ska_ismanager );
return;
}
dn = get_copy_dn( e );
if ( (pindex = get_sibling_index( dn )) == NULLINDEX ) {
LLOG( log_dsap, LLOG_EXCEPTIONS, ("Cannot find sibling index") );
dn_free( dn );
return;
}
dn_free( dn );
g_size_normalizer = 1;
list = turbo_filterkids( e, ska->ska_arg->sra_filter, ska, pindex, 1 );
apply_sacl( &list, e, ska );
/* security error coming back */
if ( ska->ska_saclerror < 0 ) {
entryinfo_free( list, 0 );
return;
}
if ( *ska->ska_einfo == NULLENTRYINFO )
*ska->ska_einfo = list;
else if ( list != NULLENTRYINFO )
entryinfo_append( *ska->ska_einfo, list );
/* sizelimit already exceeded */
if ( ska->ska_saclerror > 0 )
return;
if ( ska->ska_arg->sra_searchaliases && pindex->i_nonlocalaliases
!= (Entry *) 0 ) {
for ( tmp = pindex->i_nonlocalaliases; *tmp; tmp++ )
do_alias( ska->ska_arg, *tmp, ska->ska_local );
}
}
dsEnqError list_start()
{
struct ds_search_arg search_arg;
struct ds_search_result result;
struct DSError error;
dsEnqError return_error;
return_error = Okay;
if (get_default_service (&search_arg.sra_common) != 0) {
return localdsaerror;
}
search_arg.sra_common.ca_servicecontrol.svc_options = SVC_OPT_PREFERCHAIN;
search_arg.sra_baseobject = (*base_path != 'T'?
str2dn (base_path):
NULLDN);
search_arg.sra_eis.eis_allattributes = FALSE;
search_arg.sra_eis.eis_infotypes = EIS_ATTRIBUTETYPESONLY;
search_arg.sra_eis.eis_select = 0;
search_arg.sra_searchaliases = TRUE;
search_arg.sra_subset = SRA_ONELEVEL;
search_arg.sra_filter = filter_alloc();
search_arg.sra_filter->flt_type = FILTER_NOT;
search_arg.sra_filter->flt_next = NULLFILTER;
search_arg.sra_filter->flt_un.flt_un_filter = filter_alloc();
search_arg.sra_filter->flt_un.flt_un_filter->flt_type = FILTER_ITEM;
search_arg.sra_filter->flt_un.flt_un_filter->flt_next = NULLFILTER;
search_arg.sra_filter->flt_un.flt_un_filter->flt_un.flt_un_item.fi_type
= FILTERITEM_EQUALITY;
search_arg.sra_filter->flt_un.flt_un_filter->flt_un.flt_un_item.fi_un.
fi_un_ava.ava_type = AttrT_new("2.5.4.0");
search_arg.sra_filter->flt_un.flt_un_filter->flt_un.flt_un_item.fi_un.
fi_un_ava.ava_value =
str2AttrV("dsa", search_arg.sra_filter->flt_un.flt_un_filter->
flt_un.flt_un_item.fi_un.fi_un_ava.ava_type->
oa_syntax);
#ifndef NO_STATS
LLOG (log_stat,LLOG_NOTICE,("search +%s,extent %d, val objectClass != dsa",
base_path,search_arg.sra_subset));
#endif
if (search_arg.sra_filter->flt_un.flt_un_filter->flt_un.flt_un_item.
fi_un.fi_un_ava.ava_value == NULLAttrV) {
return_error = localdsaerror;
} else if (ds_search (&search_arg, &error, &result) != DS_OK) {
free_seq(dnseq);
dnseq = NULLDS;
dn_number = 0;
log_ds_error(&error);
ds_error_free(&error);
switch (error.dse_type) {
case DSE_LOCALERROR:
return_error = duaerror;
break;
case DSE_REMOTEERROR:
return_error = localdsaerror;
break;
case DSE_ATTRIBUTEERROR:
return_error = attributerror;
break;
case DSE_REFERRAL:
case DSE_DSAREFERRAL:
return_error = remotedsaerror;
break;
case DSE_SECURITYERROR:
return_error = security;
break;
case DSE_NAMEERROR:
return_error = namerror;
break;
case DSE_SERVICEERROR:
return_error = serviceerror;
break;
default:
return_error = localdsaerror;
break;
}
} else {
dn_number = 0;
if (result.CSR_entries != NULLENTRYINFO) {
register EntryInfo *ptr;
free_seq(dnseq);
dnseq = NULLDS;
dn_number = 0;
for (ptr = result.CSR_entries; ptr != NULLENTRYINFO;
ptr = ptr->ent_next) {
dn_number++;
dn2buf ((caddr_t)ptr->ent_dn, goto_path);
add_seq (&dnseq, goto_path);
}
if (dn_number) dnseq = SortList(dnseq);
} else if (result.CSR_limitproblem == LSR_NOLIMITPROBLEM) {
free_seq(dnseq);
dnseq = NULLDS;
dn_number = 0;
return_error = nothingfound;
}
if (result.CSR_limitproblem != LSR_NOLIMITPROBLEM) {
switch (result.CSR_limitproblem) {
case LSR_TIMELIMITEXCEEDED:
if (dn_number > 0) return_error = timelimit_w_partial;
else {
free_seq(dnseq);
dnseq = NULLDS;
return_error = timelimit;
}
break;
case LSR_SIZELIMITEXCEEDED:
return_error = listsizelimit;
break;
case LSR_ADMINSIZEEXCEEDED:
if (dn_number > 0) return_error = adminlimit_w_partial;
else {
free_seq(dnseq);
dnseq = NULLDS;
return_error = adminlimit;
}
break;
}
}
if (result.CSR_entries) entryinfo_free(result.CSR_entries, 0);
}
entry_number = dn_number;
filter_free(search_arg.sra_filter);
dn_free(search_arg.sra_baseobject);
ds_error_free(&error);
return return_error;
}
int
turbo_subtree_search (Entry e, struct search_kid_arg *ska)
{
EntryInfo *list;
Entry *tmp;
DN dn;
Index *pindex;
dn = get_copy_dn( e );
if ( (pindex = get_subtree_index( dn )) == NULLINDEX ) {
LLOG( log_dsap, LLOG_EXCEPTIONS, ("Cannot find subtree index") );
dn_free( dn );
return;
}
dn_free( dn );
g_size_normalizer = 1;
list = turbo_filterkids( e, ska->ska_arg->sra_filter, ska, pindex, 1 );
apply_sacl( &list, e, ska );
/* security error coming back */
if ( ska->ska_saclerror < 0 ) {
entryinfo_free( list, 0 );
return;
}
if ( *ska->ska_einfo == NULLENTRYINFO )
*ska->ska_einfo = list;
else if ( list != NULLENTRYINFO )
entryinfo_append( *ska->ska_einfo, list );
/* sizelimit already exceeded */
if ( ska->ska_saclerror > 0 )
return;
/*
* at this point, anything held locally below this point has been
* searched. we now search through the nonleaf children recursively
* for one whose children are not held locally, referring any that
* we find. next, we search through the list of nonlocal aliases
* searching for one that matches (if dereferencing is allowed).
*/
if ( pindex->i_nonleafkids != (Entry *) 0 )
subtree_refer( pindex, ska );
if ( ska->ska_arg->sra_searchaliases && pindex->i_nonlocalaliases
!= (Entry *) 0 ) {
for ( tmp = pindex->i_nonlocalaliases; *tmp; tmp++ ) {
int i;
i = th_prefix( (*ska->ska_local)->st_originalbase,
(*tmp)->e_alias );
if ( i > 0 ) {
do_alias( ska->ska_arg, *tmp,
ska->ska_local );
}
}
}
}
dsEnqError srch_start()
{
struct ds_search_arg search_arg;
struct ds_search_result result;
struct DSError error;
dsEnqError return_error;
extern Filter make_filter();
DN curr_rdn;
if (*mvalue == '\0') {
return list_start();
}
if (get_default_service (&search_arg.sra_common) != 0) {
return nothingfound;
}
search_arg.sra_common.ca_servicecontrol.svc_options = SVC_OPT_PREFERCHAIN;
curr_rdn = search_arg.sra_baseobject = (*base_path != 'T'?
str2dn (base_path):
NULLDN);
search_arg.sra_eis.eis_allattributes = FALSE;
search_arg.sra_eis.eis_infotypes = EIS_ATTRIBUTETYPESONLY;
search_arg.sra_eis.eis_select = 0;
search_arg.sra_searchaliases = TRUE;
search_arg.sra_subset = SRA_ONELEVEL;
while (curr_rdn != NULLDN) {
if (!strcmp(curr_rdn->dn_rdn->rdn_at->oa_ot.ot_stroid,
"2.5.4.10")) {
search_arg.sra_subset = SRA_WHOLESUBTREE;
break;
}
curr_rdn = curr_rdn->dn_parent;
}
if ((search_arg.sra_filter = make_filter(filt_arr[typeindx])) == NULLFILTER)
return duaerror;
#ifndef NO_STATS
LLOG (log_stat, LLOG_NOTICE, ("search +%s, extent %d, val %s",
base_path,search_arg.sra_subset, mvalue));
#endif
if(ds_search (&search_arg, &error, &result) != DS_OK) {
/* deal with error */
free_seq(dnseq);
dnseq = NULLDS;
dn_number = 0;
log_ds_error(&error);
ds_error_free(&error);
switch (error.dse_type) {
case DSE_LOCALERROR:
return_error = duaerror;
break;
case DSE_REMOTEERROR:
return_error = localdsaerror;
break;
case DSE_ATTRIBUTEERROR:
return_error = attributerror;
break;
case DSE_REFERRAL:
case DSE_DSAREFERRAL:
return_error = remotedsaerror;
break;
case DSE_SECURITYERROR:
return_error = security;
break;
case DSE_NAMEERROR:
return_error = namerror;
break;
case DSE_SERVICEERROR:
return_error = serviceerror;
break;
default:
return_error = localdsaerror;
break;
}
} else {
correlate_search_results (&result);
dn_number = 0;
if (result.CSR_entries != NULLENTRYINFO) {
register EntryInfo *ptr;
return_error = Okay;
free_seq(dnseq);
dnseq = NULLDS;
dn_number = 0;
for (ptr = result.CSR_entries;
ptr != NULLENTRYINFO;
ptr = ptr->ent_next){
dn_number++;
dn2buf((caddr_t) ptr->ent_dn, goto_path);
add_seq(&dnseq, goto_path);
}
if (dn_number) dnseq = SortList(dnseq);
} else if (result.CSR_limitproblem == LSR_NOLIMITPROBLEM) {
free_seq(dnseq);
dnseq = NULLDS;
dn_number = 0;
return_error = nothingfound;
}
if(result.CSR_limitproblem != LSR_NOLIMITPROBLEM) {
switch (result.CSR_limitproblem) {
case LSR_TIMELIMITEXCEEDED:
if (dn_number > 0) return_error = timelimit_w_partial;
else {
free_seq(dnseq);
dnseq = NULLDS;
return_error = timelimit;
}
break;
case LSR_SIZELIMITEXCEEDED:
return_error = listsizelimit;
break;
case LSR_ADMINSIZEEXCEEDED:
if (dn_number > 0) return_error = adminlimit_w_partial;
else {
free_seq(dnseq);
dnseq = NULLDS;
return_error = adminlimit;
}
break;
}
entryinfo_free(result.CSR_entries, 0);
}
}
entry_number = dn_number;
filter_free(search_arg.sra_filter);
dn_free(search_arg.sra_baseobject);
ds_error_free(&error);
return return_error;
}
