/
ldap.c
1511 lines (1246 loc) · 37.4 KB
/
ldap.c
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
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
/*
* This program is is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License, version 2 if the
* License as published by the Free Software Foundation.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program; if not, write to the Free Software
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
*/
/**
* $Id$
* @file ldap.c
* @brief LDAP module library functions.
*
* @author Arran Cudbard-Bell <a.cudbardb@freeradius.org>
* @copyright 2013 Network RADIUS SARL <info@networkradius.com>
* @copyright 2013 The FreeRADIUS Server Project.
*/
#include <freeradius-devel/radiusd.h>
#include <freeradius-devel/modules.h>
#include <freeradius-devel/rad_assert.h>
#include <stdarg.h>
#include <ctype.h>
#include <lber.h>
#include <ldap.h>
#include "ldap.h"
/** Converts "bad" strings into ones which are safe for LDAP
*
* This is a callback for xlat operations.
*
* Will escape any characters in input strings that would cause the string to be interpreted as part of a DN and or
* filter. Escape sequence is @verbatim \<hex><hex> @endverbatim
*
* @param request The current request.
* @param out Pointer to output buffer.
* @param outlen Size of the output buffer.
* @param in Raw unescaped string.
* @param arg Any additional arguments (unused).
*/
size_t rlm_ldap_escape_func(UNUSED REQUEST *request, char *out, size_t outlen, char const *in, UNUSED void *arg)
{
static char const encode[] = ",+\"\\<>;*=()";
static char const hextab[] = "0123456789abcdef";
size_t left = outlen;
if (*in && ((*in == ' ') || (*in == '#'))) {
goto encode;
}
while (*in) {
/*
* Encode unsafe characters.
*/
if (memchr(encode, *in, sizeof(encode) - 1)) {
encode:
/*
* Only 3 or less bytes available.
*/
if (left <= 3) break;
*out++ = '\\';
*out++ = hextab[(*in >> 4) & 0x0f];
*out++ = hextab[*in & 0x0f];
in++;
left -= 3;
continue;
}
if (left <= 1) break;
/*
* Doesn't need encoding
*/
*out++ = *in++;
left--;
}
*out = '\0';
return outlen - left;
}
/** Check whether a string looks like a DN
*
* @param[in] in Str to check.
* @param[in] inlen Length of string to check.
* @return true if string looks like a DN, else false.
*/
bool rlm_ldap_is_dn(char const *in, size_t inlen)
{
char const *p;
char want = '=';
bool too_soon = true;
int comp = 1;
for (p = in; inlen > 0; p++, inlen--) {
if (p[0] == '\\') {
char c;
too_soon = false;
/*
* Invalid escape sequence, not a DN
*/
if (inlen < 2) return false;
/*
* Double backslash, consume two chars
*/
if (p[1] == '\\') {
inlen--;
p++;
continue;
}
/*
* Special, consume two chars
*/
switch (p[1]) {
case ' ':
case '#':
case '=':
case '"':
case '+':
case ',':
case ';':
case '<':
case '>':
case '\'':
inlen -= 1;
p += 1;
continue;
default:
break;
}
/*
* Invalid escape sequence, not a DN
*/
if (inlen < 3) return false;
/*
* Hex encoding, consume three chars
*/
if (fr_hex2bin((uint8_t *) &c, 1, p + 1, 2) == 1) {
inlen -= 2;
p += 2;
continue;
}
/*
* Invalid escape sequence, not a DN
*/
return false;
}
switch (*p) {
case '=':
if (too_soon || (*p != want)) return false; /* Too soon after last , or = */
want = ',';
too_soon = true;
break;
case ',':
if (too_soon || (*p != want)) return false; /* Too soon after last , or = */
want = '=';
too_soon = true;
comp++;
break;
default:
too_soon = false;
break;
}
}
/*
* If the string ended with , or =, or the number
* of components was less than 2
*
* i.e. we don't have <attr>=<val>,<attr>=<val>
*/
if (too_soon || (comp < 2)) return false;
return true;
}
/** Convert a berval to a talloced string
*
* The ldap_get_values function is deprecated, and ldap_get_values_len
* does not guarantee the berval buffers it returns are \0 terminated.
*
* For some cases this is fine, for others we require a \0 terminated
* buffer (feeding DNs back into libldap for example).
*
* @param ctx to allocate in.
* @param in Berval to copy.
* @return \0 terminated buffer containing in->bv_val.
*/
char *rlm_ldap_berval_to_string(TALLOC_CTX *ctx, struct berval const *in)
{
char *out;
out = talloc_array(ctx, char, in->bv_len + 1);
if (!out) return NULL;
memcpy(out, in->bv_val, in->bv_len);
out[in->bv_len] = '\0';
return out;
}
/** Normalise escape sequences in a DN
*
* Characters in a DN can either be escaped as
* @verbatim \<hex><hex> @endverbatim or @verbatim \<special> @endverbatim
*
* The LDAP directory chooses how characters are escaped, which can make
* local comparisons of DNs difficult.
*
* Here we search for hex sequences that match special chars, and convert
* them to the @verbatim \<special> @endverbatim form.
*
* @note the resulting output string will only ever be shorter than the
* input, so it's fine to use the same buffer for both out and in.
*
* @param out Where to write the normalised DN.
* @param in The input DN.
* @return The number of bytes written to out.
*/
size_t rlm_ldap_normalise_dn(char *out, char const *in)
{
char const *p;
char *o = out;
for (p = in; *p != '\0'; p++) {
if (p[0] == '\\') {
char c;
/*
* Double backslashes get processed specially
*/
if (p[1] == '\\') {
p += 1;
*o++ = p[0];
*o++ = p[1];
continue;
}
/*
* Hex encodings that have an alternative
* special encoding, get rewritten to the
* special encoding.
*/
if (fr_hex2bin((uint8_t *) &c, 1, p + 1, 2) == 1) {
switch (c) {
case ' ':
case '#':
case '=':
case '"':
case '+':
case ',':
case ';':
case '<':
case '>':
case '\'':
*o++ = '\\';
*o++ = c;
p += 2;
continue;
default:
break;
}
}
}
*o++ = *p;
}
*o = '\0';
return o - out;
}
/** Find the place at which the two DN strings diverge
*
* Returns the length of the non matching string in full.
*
* @param full DN.
* @param part Partial DN as returned by ldap_parse_result.
* @return the length of the portion of full which wasn't matched or -1 on error.
*/
static size_t rlm_ldap_common_dn(char const *full, char const *part)
{
size_t f_len, p_len, i;
if (!full) {
return -1;
}
f_len = strlen(full);
if (!part) {
return -1;
}
p_len = strlen(part);
if (!p_len) {
return f_len;
}
if ((f_len < p_len) || !f_len) {
return -1;
}
for (i = 0; i < p_len; i++) {
if (part[p_len - i] != full[f_len - i]) {
return -1;
}
}
return f_len - p_len;
}
/** Combine and expand filters
*
* @param request Current request.
* @param out Where to write the expanded string.
* @param outlen Length of output buffer.
* @param sub Array of subfilters (may contain NULLs).
* @param sublen Number of potential subfilters in array.
* @return length of expanded data.
*/
ssize_t rlm_ldap_xlat_filter(REQUEST *request, char const **sub, size_t sublen, char *out, size_t outlen)
{
char buffer[LDAP_MAX_FILTER_STR_LEN + 1];
char const *in = NULL;
char *p = buffer;
ssize_t len = 0;
unsigned int i;
int cnt = 0;
/*
* Figure out how many filter elements we need to integrate
*/
for (i = 0; i < sublen; i++) {
if (sub[i] && *sub[i]) {
in = sub[i];
cnt++;
}
}
if (!cnt) {
out[0] = '\0';
return 0;
}
if (cnt > 1) {
if (outlen < 3) {
goto oob;
}
p[len++] = '(';
p[len++] = '&';
for (i = 0; i < sublen; i++) {
if (sub[i] && (*sub[i] != '\0')) {
len += strlcpy(p + len, sub[i], outlen - len);
if ((size_t) len >= outlen) {
oob:
REDEBUG("Out of buffer space creating filter");
return -1;
}
}
}
if ((outlen - len) < 2) {
goto oob;
}
p[len++] = ')';
p[len] = '\0';
in = buffer;
}
len = radius_xlat(out, outlen, request, in, rlm_ldap_escape_func, NULL);
if (len < 0) {
REDEBUG("Failed creating filter");
return -1;
}
return len;
}
/** Return the error string associated with a handle
*
* @param conn to retrieve error from.
* @return error string.
*/
char const *rlm_ldap_error_str(ldap_handle_t const *conn)
{
int lib_errno;
ldap_get_option(conn->handle, LDAP_OPT_ERROR_NUMBER, &lib_errno);
if (lib_errno == LDAP_SUCCESS) {
return "unknown";
}
return ldap_err2string(lib_errno);
}
/** Parse response from LDAP server dealing with any errors
*
* Should be called after an LDAP operation. Will check result of operation and if it was successful, then attempt
* to retrieve and parse the result.
*
* Will also produce extended error output including any messages the server sent, and information about partial
* DN matches.
*
* @param[in] inst of LDAP module.
* @param[in] conn Current connection.
* @param[in] msgid returned from last operation.
* @param[in] dn Last search or bind DN.
* @param[out] result Where to write result, if NULL result will be freed.
* @param[out] error Where to write the error string, may be NULL, must not be freed.
* @param[out] extra Where to write additional error string to, may be NULL (faster) or must be freed
* (with talloc_free).
* @return One of the LDAP_PROC_* codes.
*/
static ldap_rcode_t rlm_ldap_result(ldap_instance_t const *inst, ldap_handle_t const *conn, int msgid, char const *dn,
LDAPMessage **result, char const **error, char **extra)
{
ldap_rcode_t status = LDAP_PROC_SUCCESS;
int lib_errno = LDAP_SUCCESS; // errno returned by the library.
int srv_errno = LDAP_SUCCESS; // errno in the result message.
char *part_dn = NULL; // Partial DN match.
char *our_err = NULL; // Our extended error message.
char *srv_err = NULL; // Server's extended error message.
char *p, *a;
bool freeit = false; // Whether the message should be freed after being processed.
int len;
struct timeval tv; // Holds timeout values.
LDAPMessage *tmp_msg; // Temporary message pointer storage if we weren't provided with one.
char const *tmp_err; // Temporary error pointer storage if we weren't provided with one.
if (!error) {
error = &tmp_err;
}
*error = NULL;
if (extra) {
*extra = NULL;
}
/*
* We always need the result, but our caller may not
*/
if (!result) {
result = &tmp_msg;
freeit = true;
}
*result = NULL;
/*
* Check if there was an error sending the request
*/
ldap_get_option(conn->handle, LDAP_OPT_ERROR_NUMBER, &lib_errno);
if (lib_errno != LDAP_SUCCESS) goto process_error;
memset(&tv, 0, sizeof(tv));
tv.tv_sec = inst->res_timeout;
/*
* Now retrieve the result and check for errors
* ldap_result returns -1 on error, and 0 on timeout
*/
lib_errno = ldap_result(conn->handle, msgid, 1, &tv, result);
if (lib_errno == 0) {
lib_errno = LDAP_TIMEOUT;
goto process_error;
}
if (lib_errno == -1) {
ldap_get_option(conn->handle, LDAP_OPT_ERROR_NUMBER, &lib_errno);
goto process_error;
}
/*
* Parse the result and check for errors sent by the server
*/
lib_errno = ldap_parse_result(conn->handle, *result,
&srv_errno,
extra ? &part_dn : NULL,
extra ? &srv_err : NULL,
NULL, NULL, freeit);
if (freeit) *result = NULL;
if (lib_errno != LDAP_SUCCESS) {
ldap_get_option(conn->handle, LDAP_OPT_ERROR_NUMBER, &lib_errno);
goto process_error;
}
process_error:
if ((lib_errno == LDAP_SUCCESS) && (srv_errno != LDAP_SUCCESS)) {
lib_errno = srv_errno;
} else if ((lib_errno != LDAP_SUCCESS) && (srv_errno == LDAP_SUCCESS)) {
srv_errno = lib_errno;
}
switch (lib_errno) {
case LDAP_SUCCESS:
*error = "Success";
break;
case LDAP_NO_SUCH_OBJECT:
*error = "The specified DN wasn't found, check base_dn and identity";
status = LDAP_PROC_BAD_DN;
if (!extra) break;
/*
* Build our own internal diagnostic string
*/
len = rlm_ldap_common_dn(dn, part_dn);
if (len < 0) break;
our_err = talloc_typed_asprintf(conn, "Match stopped here: [%.*s]%s", len, dn, part_dn ? part_dn : "");
goto error_string;
case LDAP_INSUFFICIENT_ACCESS:
*error = "Insufficient access. Check the identity and password configuration directives";
status = LDAP_PROC_NOT_PERMITTED;
break;
case LDAP_UNWILLING_TO_PERFORM:
*error = "Server was unwilling to perform";
status = LDAP_PROC_NOT_PERMITTED;
break;
case LDAP_FILTER_ERROR:
*error = "Bad search filter";
status = LDAP_PROC_ERROR;
break;
case LDAP_TIMEOUT:
*error = "Timed out while waiting for server to respond";
goto timeout;
case LDAP_TIMELIMIT_EXCEEDED:
*error = "Time limit exceeded";
timeout:
exec_trigger(NULL, inst->cs, "modules.ldap.timeout", true);
/* FALL-THROUGH */
case LDAP_BUSY:
case LDAP_UNAVAILABLE:
case LDAP_SERVER_DOWN:
status = LDAP_PROC_RETRY;
goto error_string;
case LDAP_INVALID_CREDENTIALS:
case LDAP_CONSTRAINT_VIOLATION:
status = LDAP_PROC_REJECT;
goto error_string;
case LDAP_OPERATIONS_ERROR:
*error = "Please set 'chase_referrals=yes' and 'rebind=yes'. See the ldap module configuration "
"for details.";
/* FALL-THROUGH */
default:
status = LDAP_PROC_ERROR;
error_string:
if (!*error) *error = ldap_err2string(lib_errno);
if (!extra || ((lib_errno == srv_errno) && !our_err && !srv_err)) break;
/*
* Output the error codes from the library and server
*/
p = talloc_zero_array(conn, char, 1);
if (!p) break;
if (lib_errno != srv_errno) {
a = talloc_asprintf_append(p, "LDAP lib error: %s (%u), srv error: %s (%u). ",
ldap_err2string(lib_errno), lib_errno,
ldap_err2string(srv_errno), srv_errno);
if (!a) {
talloc_free(p);
break;
}
p = a;
}
if (our_err) {
a = talloc_asprintf_append_buffer(p, "%s. ", our_err);
if (!a) {
talloc_free(p);
break;
}
p = a;
}
if (srv_err) {
a = talloc_asprintf_append_buffer(p, "Server said: %s. ", srv_err);
if (!a) {
talloc_free(p);
break;
}
p = a;
}
*extra = p;
break;
}
/*
* Cleanup memory
*/
if (srv_err) ldap_memfree(srv_err);
if (part_dn) ldap_memfree(part_dn);
talloc_free(our_err);
if ((lib_errno || srv_errno) && *result) {
ldap_msgfree(*result);
*result = NULL;
}
return status;
}
/** Bind to the LDAP directory as a user
*
* Performs a simple bind to the LDAP directory, and handles any errors that occur.
*
* @param[in] inst rlm_ldap configuration.
* @param[in] request Current request, this may be NULL, in which case all debug logging is done with radlog.
* @param[in,out] pconn to use. May change as this function calls functions which auto re-connect.
* @param[in] dn of the user, may be NULL to bind anonymously.
* @param[in] password of the user, may be NULL if no password is specified.
* @param[in] retry if the server is down.
* @return one of the LDAP_PROC_* values.
*/
ldap_rcode_t rlm_ldap_bind(ldap_instance_t const *inst, REQUEST *request, ldap_handle_t **pconn, char const *dn,
char const *password, bool retry)
{
ldap_rcode_t status = LDAP_PROC_ERROR;
int msgid;
char const *error = NULL;
char *extra = NULL;
int i, num;
rad_assert(*pconn && (*pconn)->handle);
rad_assert(!retry || inst->pool);
/*
* Bind as anonymous user
*/
if (!dn) dn = "";
/*
* For sanity, for when no connections are viable,
* and we can't make a new one.
*/
num = retry ? fr_connection_get_num(inst->pool) : 0;
for (i = num; i >= 0; i--) {
msgid = ldap_bind((*pconn)->handle, dn, password, LDAP_AUTH_SIMPLE);
/* We got a valid message ID */
if (msgid >= 0) {
if (request) {
RDEBUG2("Waiting for bind result...");
} else {
DEBUG2("rlm_ldap (%s): Waiting for bind result...", inst->xlat_name);
}
}
status = rlm_ldap_result(inst, *pconn, msgid, dn, NULL, &error, &extra);
switch (status) {
case LDAP_PROC_SUCCESS:
LDAP_DBG_REQ("Bind successful");
break;
case LDAP_PROC_NOT_PERMITTED:
LDAP_ERR_REQ("Bind was not permitted: %s", error);
LDAP_EXT_REQ();
break;
case LDAP_PROC_REJECT:
LDAP_ERR_REQ("Bind credentials incorrect: %s", error);
LDAP_EXT_REQ();
break;
case LDAP_PROC_RETRY:
if (retry) {
*pconn = fr_connection_reconnect(inst->pool, *pconn);
if (*pconn) {
LDAP_DBGW_REQ("Bind with %s to %s:%d failed: %s. Got new socket, retrying...",
dn, inst->server, inst->port, error);
talloc_free(extra); /* don't leak debug info */
continue;
}
};
status = LDAP_PROC_ERROR;
/*
* Were not allowed to retry, or there are no more
* sockets, treat this as a hard failure.
*/
/* FALL-THROUGH */
default:
LDAP_ERR_REQ("Bind with %s to %s:%d failed: %s", dn, inst->server, inst->port, error);
LDAP_EXT_REQ();
break;
}
break;
}
if (retry && (i < 0)) {
LDAP_ERR_REQ("Hit reconnection limit");
status = LDAP_PROC_ERROR;
}
talloc_free(extra);
return status; /* caller closes the connection */
}
/** Search for something in the LDAP directory
*
* Binds as the administrative user and performs a search, dealing with any errors.
*
* @param[in] inst rlm_ldap configuration.
* @param[in] request Current request.
* @param[in,out] pconn to use. May change as this function calls functions which auto re-connect.
* @param[in] dn to use as base for the search.
* @param[in] scope to use (LDAP_SCOPE_BASE, LDAP_SCOPE_ONE, LDAP_SCOPE_SUB).
* @param[in] filter to use, should be pre-escaped.
* @param[in] attrs to retrieve.
* @param[out] result Where to store the result. Must be freed with ldap_msgfree if LDAP_PROC_SUCCESS is returned.
* May be NULL in which case result will be automatically freed after use.
* @return One of the LDAP_PROC_* values.
*/
ldap_rcode_t rlm_ldap_search(ldap_instance_t const *inst, REQUEST *request, ldap_handle_t **pconn,
char const *dn, int scope, char const *filter, char const * const *attrs,
LDAPMessage **result)
{
ldap_rcode_t status;
LDAPMessage *our_result = NULL;
int msgid; // Message id returned by
// ldap_search_ext.
int count = 0; // Number of results we got.
struct timeval tv; // Holds timeout values.
char const *error = NULL;
char *extra = NULL;
int i;
rad_assert(*pconn && (*pconn)->handle);
/*
* OpenLDAP library doesn't declare attrs array as const, but
* it really should be *sigh*.
*/
char **search_attrs;
memcpy(&search_attrs, &attrs, sizeof(attrs));
/*
* Do all searches as the admin user.
*/
if ((*pconn)->rebound) {
status = rlm_ldap_bind(inst, request, pconn, inst->admin_dn, inst->password, true);
if (status != LDAP_PROC_SUCCESS) {
return LDAP_PROC_ERROR;
}
rad_assert(*pconn);
(*pconn)->rebound = false;
}
if (filter) {
LDAP_DBG_REQ("Performing search in '%s' with filter '%s', scope '%s'", dn, filter,
fr_int2str(ldap_scope, scope, "<INVALID>"));
} else {
LDAP_DBG_REQ("Performing unfiltered search in '%s', scope '%s'", dn,
fr_int2str(ldap_scope, scope, "<INVALID>"));
}
/*
* If LDAP search produced an error it should also be logged
* to the ld. result should pick it up without us
* having to pass it explicitly.
*/
memset(&tv, 0, sizeof(tv));
tv.tv_sec = inst->res_timeout;
/*
* For sanity, for when no connections are viable,
* and we can't make a new one.
*/
for (i = fr_connection_get_num(inst->pool); i >= 0; i--) {
(void) ldap_search_ext((*pconn)->handle, dn, scope, filter, search_attrs,
0, NULL, NULL, &tv, 0, &msgid);
LDAP_DBG_REQ("Waiting for search result...");
status = rlm_ldap_result(inst, *pconn, msgid, dn, &our_result, &error, &extra);
switch (status) {
case LDAP_PROC_SUCCESS:
break;
case LDAP_PROC_RETRY:
*pconn = fr_connection_reconnect(inst->pool, *pconn);
if (*pconn) {
LDAP_DBGW_REQ("Search failed: %s. Got new socket, retrying...", error);
talloc_free(extra); /* don't leak debug info */
continue;
}
status = LDAP_PROC_ERROR;
/* FALL-THROUGH */
default:
LDAP_ERR_REQ("Failed performing search: %s", error);
if (extra) LDAP_ERR_REQ("%s", extra);
goto finish;
}
break;
}
if (i < 0) {
LDAP_ERR_REQ("Hit reconnection limit");
status = LDAP_PROC_ERROR;
goto finish;
}
count = ldap_count_entries((*pconn)->handle, our_result);
if (count < 0) {
LDAP_ERR_REQ("Error counting results: %s", rlm_ldap_error_str(*pconn));
status = LDAP_PROC_ERROR;
ldap_msgfree(our_result);
our_result = NULL;
} else if (count == 0) {
LDAP_DBG_REQ("Search returned no results");
status = LDAP_PROC_NO_RESULT;
ldap_msgfree(our_result);
our_result = NULL;
}
finish:
talloc_free(extra);
/*
* We always need to get the result to count entries, but the caller
* may not of requested one. If that's the case, free it, else write
* it to where our caller said.
*/
if (!result) {
if (our_result) {
ldap_msgfree(our_result);
}
} else {
*result = our_result;
}
return status;
}
/** Modify something in the LDAP directory
*
* Binds as the administrative user and attempts to modify an LDAP object.
*
* @param[in] inst rlm_ldap configuration.
* @param[in] request Current request.
* @param[in,out] pconn to use. May change as this function calls functions which auto re-connect.
* @param[in] dn of the object to modify.
* @param[in] mods to make, see 'man ldap_modify' for more information.
* @return One of the LDAP_PROC_* values.
*/
ldap_rcode_t rlm_ldap_modify(ldap_instance_t const *inst, REQUEST *request, ldap_handle_t **pconn,
char const *dn, LDAPMod *mods[])
{
ldap_rcode_t status;
int msgid; // Message id returned by ldap_search_ext.
char const *error = NULL;
char *extra = NULL;
int i;
rad_assert(*pconn && (*pconn)->handle);
/*
* Perform all modifications as the admin user.
*/
if ((*pconn)->rebound) {
status = rlm_ldap_bind(inst, request, pconn, inst->admin_dn, inst->password, true);
if (status != LDAP_PROC_SUCCESS) {
return LDAP_PROC_ERROR;
}
rad_assert(*pconn);
(*pconn)->rebound = false;
}
/*
* For sanity, for when no connections are viable,
* and we can't make a new one.
*/
for (i = fr_connection_get_num(inst->pool); i >= 0; i--) {
RDEBUG2("Modifying object with DN \"%s\"", dn);
(void) ldap_modify_ext((*pconn)->handle, dn, mods, NULL, NULL, &msgid);
RDEBUG2("Waiting for modify result...");
status = rlm_ldap_result(inst, *pconn, msgid, dn, NULL, &error, &extra);
switch (status) {
case LDAP_PROC_SUCCESS:
break;
case LDAP_PROC_RETRY:
*pconn = fr_connection_reconnect(inst->pool, *pconn);
if (*pconn) {
RWDEBUG("Modify failed: %s. Got new socket, retrying...", error);
talloc_free(extra); /* don't leak debug info */
continue;
}
status = LDAP_PROC_ERROR;
/* FALL-THROUGH */
default:
REDEBUG("Failed modifying object: %s", error);
REDEBUG("%s", extra);
goto finish;
}
break;
}
if (i < 0) {
LDAP_ERR_REQ("Hit reconnection limit");
status = LDAP_PROC_ERROR;
}