1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/* $OpenLDAP: pkg/ldap/servers/slapd/back-ldbm/alias.c,v 1.47.2.3 2006/01/03 22:16:19 kurt Exp $ */
/* This work is part of OpenLDAP Software <http://www.openldap.org/>.
*
* Copyright 1998-2006 The OpenLDAP Foundation.
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted only as authorized by the OpenLDAP
* Public License.
*
* A copy of this license is available in the file LICENSE in the
* top-level directory of the distribution or, alternatively, at
* <http://www.OpenLDAP.org/license.html>.
*/
#include "portable.h"
#include <stdio.h>
#include <ac/string.h>
#include <ac/socket.h>
#include "slap.h"
#include "back-ldbm.h"
#include "proto-back-ldbm.h"
static void new_superior(
struct berval *dn,
struct berval *oldSup,
struct berval *newSup,
struct berval *res );
static int dnlist_subordinate(
BerVarray dnlist,
struct berval *dn );
Entry *deref_internal_r(
Backend* be,
Entry* alias,
struct berval* dn_in,
int* err,
Entry** matched,
const char** text )
{
struct berval dn;
struct ldbminfo *li = (struct ldbminfo *) be->be_private;
Entry *entry;
Entry *sup;
unsigned depth;
BerVarray dnlist;
assert( ( alias != NULL && dn_in == NULL )
|| ( alias == NULL && dn_in != NULL ) );
*matched = NULL;
*err = LDAP_NO_SUCH_OBJECT;
*text = NULL;
if( alias == NULL ) {
ber_dupbv( &dn, dn_in );
entry = dn2entry_r( be, &dn, &sup );
} else {
ber_dupbv( &dn, &alias->e_nname );
entry = alias;
sup = NULL;
}
dnlist = NULL;
ber_bvarray_add( &dnlist, &dn );
for( depth=0 ; ; depth++ ) {
if( entry != NULL ) {
Entry *newe;
struct berval aliasDN;
/* have entry, may be an alias */
if( !is_entry_alias( entry ) ) {
/* entry is not an alias */
break;
}
/* entry is alias */
if( depth > be->be_max_deref_depth ) {
*matched = entry;
entry = NULL;
*err = LDAP_ALIAS_DEREF_PROBLEM;
*text = "maximum deref depth exceeded";
break;
}
/* deref entry */
if( get_alias_dn( entry, &aliasDN, err, text )) {
*matched = entry;
entry = NULL;
break;
}
/* check if aliasDN is a subordinate of any DN in our list */
if( dnlist_subordinate( dnlist, &aliasDN ) ) {
ch_free( aliasDN.bv_val );
*matched = entry;
entry = NULL;
*err = LDAP_ALIAS_PROBLEM;
*text = "circular alias";
break;
}
/* attempt to dereference alias */
newe = dn2entry_r( be, &aliasDN, &sup );
ch_free( aliasDN.bv_val );
if( newe != NULL ) {
cache_return_entry_r(&li->li_cache, entry );
entry = newe;
ber_dupbv( &dn, &entry->e_nname );
ber_bvarray_add( &dnlist, &dn );
continue;
}
if ( sup != NULL ) {
cache_return_entry_r(&li->li_cache, entry );
entry = NULL;
continue;
}
/* no newe and no superior, we're done */
break;
} else if( sup != NULL ) {
/* have superior, may be an alias */
Entry *newe;
Entry *newSup;
struct berval supDN;
struct berval aliasDN;
if( !is_entry_alias( sup ) ) {
/* entry is not an alias */
*matched = sup;
sup = NULL;
break;
}
/* entry is alias */
if( depth > be->be_max_deref_depth ) {
*matched = sup;
entry = NULL;
*err = LDAP_ALIAS_DEREF_PROBLEM;
*text = "maximum deref depth exceeded";
break;
}
/* deref entry */
if( get_alias_dn( sup, &supDN, err, text )) {
*matched = sup;
break;
}
new_superior( &dn, &sup->e_nname, &supDN, &aliasDN );
free(supDN.bv_val);
/* check if aliasDN is a subordinate of any DN in our list */
if( dnlist_subordinate( dnlist, &aliasDN ) ) {
free(aliasDN.bv_val);
*matched = entry;
entry = NULL;
*err = LDAP_ALIAS_PROBLEM;
*text = "subordinate circular alias";
break;
}
/* attempt to dereference alias */
newe = dn2entry_r( be, &aliasDN, &newSup );
if( newe != NULL ) {
free(aliasDN.bv_val);
cache_return_entry_r(&li->li_cache, sup );
entry = newe;
ber_dupbv( &dn, &entry->e_nname );
ber_bvarray_add( &dnlist, &dn );
continue;
}
if ( newSup != NULL ) {
cache_return_entry_r(&li->li_cache, sup );
sup = newSup;
ber_dupbv( &dn, &aliasDN );
continue;
}
break;
} else {
/* no newe and no superior, we're done */
break;
}
}
ber_bvarray_free( dnlist );
return entry;
}
static void new_superior(
struct berval *dn,
struct berval *oldSup,
struct berval *newSup,
struct berval *newDN )
{
size_t dnlen, olen, nlen;
assert( dn && oldSup && newSup && newDN );
dnlen = dn->bv_len;
olen = oldSup->bv_len;
nlen = newSup->bv_len;
newDN->bv_val = ch_malloc( dnlen - olen + nlen + 1 );
AC_MEMCPY( newDN->bv_val, dn->bv_val, dnlen - olen );
AC_MEMCPY( &newDN->bv_val[dnlen - olen], newSup->bv_val, nlen );
newDN->bv_val[dnlen - olen + nlen] = '\0';
return;
}
static int dnlist_subordinate(
BerVarray dnlist,
struct berval *dn )
{
assert( dnlist != NULL );
for( ; dnlist->bv_val != NULL; dnlist++ ) {
if( dnIsSuffix( dnlist, dn ) ) {
return 1;
}
}
return 0;
}
|
