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
|
/*
SSSD
ID-mapping library
Authors:
Sumit Bose <sbose@redhat.com>
Copyright (C) 2012 Red Hat
This program is free software; you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
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, see <http://www.gnu.org/licenses/>.
*/
#include <string.h>
#include <stdio.h>
#include <errno.h>
#include "lib/idmap/sss_idmap.h"
#include "lib/idmap/sss_idmap_private.h"
#include "util/murmurhash3.h"
#define SID_FMT "%s-%d"
#define SID_STR_MAX_LEN 1024
struct idmap_domain_info {
char *name;
char *sid;
struct sss_idmap_range *range;
struct idmap_domain_info *next;
};
static void *default_alloc(size_t size, void *pvt)
{
return malloc(size);
}
static void default_free(void *ptr, void *pvt)
{
free(ptr);
}
static char *idmap_strdup(struct sss_idmap_ctx *ctx, const char *str)
{
char *new = NULL;
size_t len;
CHECK_IDMAP_CTX(ctx, NULL);
len = strlen(str) + 1;
new = ctx->alloc_func(len, ctx->alloc_pvt);
if (new == NULL) {
return NULL;
}
memcpy(new, str, len);
return new;
}
static struct sss_idmap_range *idmap_range_dup(struct sss_idmap_ctx *ctx,
struct sss_idmap_range *range)
{
struct sss_idmap_range *new = NULL;
CHECK_IDMAP_CTX(ctx, NULL);
new = ctx->alloc_func(sizeof(struct sss_idmap_range), ctx->alloc_pvt);
if (new == NULL) {
return NULL;
}
memset(new, 0, sizeof(struct sss_idmap_range));
new->min = range->min;
new->max = range->max;
return new;
}
static bool id_is_in_range(uint32_t id, struct sss_idmap_range *range,
uint32_t *rid)
{
if (id == 0 || range == NULL) {
return false;
}
if (id >= range->min && id <= range->max) {
if (rid != NULL) {
*rid = id - range->min;
}
return true;
}
return false;
}
const char *idmap_error_string(enum idmap_error_code err)
{
switch (err) {
case IDMAP_SUCCESS:
return "IDMAP operation successful";
break;
case IDMAP_NOT_IMPLEMENTED:
return "IDMAP Function is not yet implemented";
break;
case IDMAP_ERROR:
return "IDMAP general error";
break;
case IDMAP_OUT_OF_MEMORY:
return "IDMAP operation ran out of memory";
break;
case IDMAP_NO_DOMAIN:
return "IDMAP domain not found";
break;
case IDMAP_CONTEXT_INVALID:
return "IDMAP context is invalid";
break;
case IDMAP_SID_INVALID:
return "IDMAP SID is invalid";
break;
case IDMAP_SID_UNKNOWN:
return "IDMAP SID not found";
break;
case IDMAP_NO_RANGE:
return "IDMAP range not found";
default:
return "IDMAP unknown error code";
}
}
bool is_domain_sid(const char *sid)
{
const char *p;
long long a;
char *endptr;
size_t c;
if (sid == NULL || strncmp(sid, DOM_SID_PREFIX, DOM_SID_PREFIX_LEN) != 0) {
return false;
}
p = sid + DOM_SID_PREFIX_LEN;
c = 0;
do {
errno = 0;
a = strtoull(p, &endptr, 10);
if (errno != 0 || a > UINT32_MAX) {
return false;
}
if (*endptr == '-') {
p = endptr + 1;
} else if (*endptr != '\0') {
return false;
}
c++;
} while(c < 3 && *endptr != '\0');
if (c != 3 || *endptr != '\0') {
return false;
}
return true;
}
enum idmap_error_code sss_idmap_init(idmap_alloc_func *alloc_func,
void *alloc_pvt,
idmap_free_func *free_func,
struct sss_idmap_ctx **_ctx)
{
struct sss_idmap_ctx *ctx;
if (alloc_func == NULL) {
alloc_func = default_alloc;
}
ctx = alloc_func(sizeof(struct sss_idmap_ctx), alloc_pvt);
if (ctx == NULL) {
return IDMAP_OUT_OF_MEMORY;
}
memset(ctx, 0, sizeof(struct sss_idmap_ctx));
ctx->alloc_func = alloc_func;
ctx->alloc_pvt = alloc_pvt;
ctx->free_func = (free_func == NULL) ? default_free : free_func;
/* Set default values. */
ctx->idmap_opts.autorid_mode = SSS_IDMAP_DEFAULT_AUTORID;
ctx->idmap_opts.idmap_lower = SSS_IDMAP_DEFAULT_LOWER;
ctx->idmap_opts.idmap_upper = SSS_IDMAP_DEFAULT_UPPER;
ctx->idmap_opts.rangesize = SSS_IDMAP_DEFAULT_RANGESIZE;
*_ctx = ctx;
return IDMAP_SUCCESS;
}
enum idmap_error_code sss_idmap_free(struct sss_idmap_ctx *ctx)
{
struct idmap_domain_info *dom;
struct idmap_domain_info *next;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
next = ctx->idmap_domain_info;
while (next) {
dom = next;
next = dom->next;
ctx->free_func(dom->range, ctx->alloc_pvt);
ctx->free_func(dom->name, ctx->alloc_pvt);
ctx->free_func(dom->sid, ctx->alloc_pvt);
ctx->free_func(dom, ctx->alloc_pvt);
}
ctx->free_func(ctx, ctx->alloc_pvt);
return IDMAP_SUCCESS;
}
enum idmap_error_code sss_idmap_calculate_range(struct sss_idmap_ctx *ctx,
const char *dom_sid,
id_t *slice_num,
struct sss_idmap_range *_range)
{
id_t max_slices;
id_t orig_slice;
id_t new_slice;
id_t min;
id_t max;
id_t idmap_lower;
id_t idmap_upper;
id_t rangesize;
bool autorid_mode;
uint32_t hash_val;
struct idmap_domain_info *dom;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
idmap_lower = ctx->idmap_opts.idmap_lower;
idmap_upper = ctx->idmap_opts.idmap_upper;
rangesize = ctx->idmap_opts.rangesize;
autorid_mode = ctx->idmap_opts.autorid_mode;
max_slices = (idmap_upper - idmap_lower) / rangesize;
if (slice_num && *slice_num != -1) {
/* The slice is being set explicitly.
* This may happen at system startup when we're loading
* previously-determined slices. In the future, we may also
* permit configuration to select the slice for a domain
* explicitly.
*/
new_slice = *slice_num;
} else {
/* If slice is -1, we're being asked to pick a new slice */
if (autorid_mode) {
/* In autorid compatibility mode, always start at 0 and find the
* first free value.
*/
orig_slice = 0;
} else {
/* Hash the domain sid string */
hash_val = murmurhash3(dom_sid, strlen(dom_sid), 0xdeadbeef);
/* Now get take the modulus of the hash val and the max_slices
* to determine its optimal position in the range.
*/
new_slice = hash_val % max_slices;
orig_slice = new_slice;
}
min = (rangesize * new_slice) + idmap_lower;
max = min + rangesize;
/* Verify that this slice is not already in use */
do {
for (dom = ctx->idmap_domain_info; dom != NULL; dom = dom->next) {
if ((dom->range->min <= min && dom->range->max >= max) ||
(dom->range->min >= min && dom->range->min <= max) ||
(dom->range->max >= min && dom->range->max <= max)) {
/* This range overlaps one already registered
* We'll try the next available slot
*/
new_slice++;
if (new_slice >= max_slices) {
/* loop around to the beginning if necessary */
new_slice = 0;
}
min = (rangesize * new_slice) + idmap_lower;
max = min + rangesize;
break;
}
}
/* Keep trying until dom is NULL (meaning we got to the end
* without matching) or we have run out of slices and gotten
* back to the first one we tried.
*/
} while (dom && new_slice != orig_slice);
if (dom) {
/* We looped all the way through and found no empty slots */
return IDMAP_OUT_OF_SLICES;
}
}
_range->min = (rangesize * new_slice) + idmap_lower;
_range->max = _range->min + rangesize;
if (slice_num) {
*slice_num = new_slice;
}
return IDMAP_SUCCESS;
}
enum idmap_error_code sss_idmap_add_domain(struct sss_idmap_ctx *ctx,
const char *domain_name,
const char *domain_sid,
struct sss_idmap_range *range)
{
struct idmap_domain_info *dom = NULL;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
if (domain_name == NULL) {
return IDMAP_NO_DOMAIN;
}
if (range == NULL) {
return IDMAP_NO_RANGE;
}
if (!is_domain_sid(domain_sid)) {
return IDMAP_SID_INVALID;
}
dom = ctx->alloc_func(sizeof(struct idmap_domain_info), ctx->alloc_pvt);
if (dom == NULL) {
return IDMAP_OUT_OF_MEMORY;
}
memset(dom, 0, sizeof(struct idmap_domain_info));
dom->name = idmap_strdup(ctx, domain_name);
if (dom->name == NULL) {
goto fail;
}
dom->sid = idmap_strdup(ctx, domain_sid);
if (dom->sid == NULL) {
goto fail;
}
dom->range = idmap_range_dup(ctx, range);
if (dom->range == NULL) {
goto fail;
}
dom->next = ctx->idmap_domain_info;
ctx->idmap_domain_info = dom;
return IDMAP_SUCCESS;
fail:
ctx->free_func(dom->sid, ctx->alloc_pvt);
ctx->free_func(dom->name, ctx->alloc_pvt);
ctx->free_func(dom, ctx->alloc_pvt);
return IDMAP_OUT_OF_MEMORY;
}
static bool sss_idmap_sid_is_builtin(const char *sid)
{
if (strncmp(sid, "S-1-5-32-", 9) == 0) {
return true;
}
return false;
}
enum idmap_error_code sss_idmap_sid_to_unix(struct sss_idmap_ctx *ctx,
const char *sid,
uint32_t *id)
{
struct idmap_domain_info *idmap_domain_info;
size_t dom_len;
long long rid;
char *endptr;
if (sid == NULL || id == NULL) {
return IDMAP_ERROR;
}
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
idmap_domain_info = ctx->idmap_domain_info;
if (sss_idmap_sid_is_builtin(sid)) {
return IDMAP_BUILTIN_SID;
}
while (idmap_domain_info != NULL) {
dom_len = strlen(idmap_domain_info->sid);
if (strlen(sid) > dom_len && sid[dom_len] == '-' &&
strncmp(sid, idmap_domain_info->sid, dom_len) == 0) {
errno = 0;
rid = strtoull(sid + dom_len + 1, &endptr, 10);
if (errno != 0 || rid > UINT32_MAX || *endptr != '\0') {
return IDMAP_SID_INVALID;
}
if (rid + idmap_domain_info->range->min >
idmap_domain_info->range->max) {
return IDMAP_NO_RANGE;
}
*id = rid + idmap_domain_info->range->min;
return IDMAP_SUCCESS;
}
idmap_domain_info = idmap_domain_info->next;
}
return IDMAP_NO_DOMAIN;
}
enum idmap_error_code sss_idmap_unix_to_sid(struct sss_idmap_ctx *ctx,
uint32_t id,
char **_sid)
{
struct idmap_domain_info *idmap_domain_info;
int len;
int ret;
uint32_t rid;
char *sid = NULL;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
idmap_domain_info = ctx->idmap_domain_info;
while (idmap_domain_info != NULL) {
if (id_is_in_range(id, idmap_domain_info->range, &rid)) {
len = snprintf(NULL, 0, SID_FMT, idmap_domain_info->sid, rid);
if (len <= 0 || len > SID_STR_MAX_LEN) {
return IDMAP_ERROR;
}
sid = ctx->alloc_func(len + 1, ctx->alloc_pvt);
if (sid == NULL) {
return IDMAP_OUT_OF_MEMORY;
}
ret = snprintf(sid, len + 1, SID_FMT, idmap_domain_info->sid, rid);
if (ret != len) {
ctx->free_func(sid, ctx->alloc_pvt);
return IDMAP_ERROR;
}
*_sid = sid;
return IDMAP_SUCCESS;
}
idmap_domain_info = idmap_domain_info->next;
}
return IDMAP_NO_DOMAIN;
}
enum idmap_error_code sss_idmap_dom_sid_to_unix(struct sss_idmap_ctx *ctx,
struct sss_dom_sid *dom_sid,
uint32_t *id)
{
enum idmap_error_code err;
char *sid;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
err = sss_idmap_dom_sid_to_sid(ctx, dom_sid, &sid);
if (err != IDMAP_SUCCESS) {
goto done;
}
err = sss_idmap_sid_to_unix(ctx, sid, id);
done:
ctx->free_func(sid, ctx->alloc_pvt);
return err;
}
enum idmap_error_code sss_idmap_bin_sid_to_unix(struct sss_idmap_ctx *ctx,
uint8_t *bin_sid,
size_t length,
uint32_t *id)
{
enum idmap_error_code err;
char *sid;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
err = sss_idmap_bin_sid_to_sid(ctx, bin_sid, length, &sid);
if (err != IDMAP_SUCCESS) {
goto done;
}
err = sss_idmap_sid_to_unix(ctx, sid, id);
done:
ctx->free_func(sid, ctx->alloc_pvt);
return err;
}
enum idmap_error_code sss_idmap_smb_sid_to_unix(struct sss_idmap_ctx *ctx,
struct dom_sid *smb_sid,
uint32_t *id)
{
enum idmap_error_code err;
char *sid;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
err = sss_idmap_smb_sid_to_sid(ctx, smb_sid, &sid);
if (err != IDMAP_SUCCESS) {
goto done;
}
err = sss_idmap_sid_to_unix(ctx, sid, id);
done:
ctx->free_func(sid, ctx->alloc_pvt);
return err;
}
enum idmap_error_code sss_idmap_unix_to_dom_sid(struct sss_idmap_ctx *ctx,
uint32_t id,
struct sss_dom_sid **_dom_sid)
{
enum idmap_error_code err;
char *sid = NULL;
struct sss_dom_sid *dom_sid = NULL;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
err = sss_idmap_unix_to_sid(ctx, id, &sid);
if (err != IDMAP_SUCCESS) {
goto done;
}
err = sss_idmap_sid_to_dom_sid(ctx, sid, &dom_sid);
if (err != IDMAP_SUCCESS) {
goto done;
}
*_dom_sid = dom_sid;
err = IDMAP_SUCCESS;
done:
ctx->free_func(sid, ctx->alloc_pvt);
if (err != IDMAP_SUCCESS) {
ctx->free_func(dom_sid, ctx->alloc_pvt);
}
return err;
}
enum idmap_error_code sss_idmap_unix_to_bin_sid(struct sss_idmap_ctx *ctx,
uint32_t id,
uint8_t **_bin_sid,
size_t *_length)
{
enum idmap_error_code err;
char *sid = NULL;
uint8_t *bin_sid = NULL;
size_t length;
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
err = sss_idmap_unix_to_sid(ctx, id, &sid);
if (err != IDMAP_SUCCESS) {
goto done;
}
err = sss_idmap_sid_to_bin_sid(ctx, sid, &bin_sid, &length);
if (err != IDMAP_SUCCESS) {
goto done;
}
*_bin_sid = bin_sid;
*_length = length;
err = IDMAP_SUCCESS;
done:
ctx->free_func(sid, ctx->alloc_pvt);
if (err != IDMAP_SUCCESS) {
ctx->free_func(bin_sid, ctx->alloc_pvt);
}
return err;
}
enum idmap_error_code
sss_idmap_ctx_set_autorid(struct sss_idmap_ctx *ctx, bool use_autorid)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
ctx->idmap_opts.autorid_mode = use_autorid;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_set_lower(struct sss_idmap_ctx *ctx, id_t lower)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
ctx->idmap_opts.idmap_lower = lower;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_set_upper(struct sss_idmap_ctx *ctx, id_t upper)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
ctx->idmap_opts.idmap_upper = upper;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_set_rangesize(struct sss_idmap_ctx *ctx, id_t rangesize)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
ctx->idmap_opts.rangesize = rangesize;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_get_autorid(struct sss_idmap_ctx *ctx, bool *_autorid)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
*_autorid = ctx->idmap_opts.autorid_mode;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_get_lower(struct sss_idmap_ctx *ctx, id_t *_lower)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
*_lower = ctx->idmap_opts.idmap_lower;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_get_upper(struct sss_idmap_ctx *ctx, id_t *_upper)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
*_upper = ctx->idmap_opts.idmap_upper;
return IDMAP_SUCCESS;
}
enum idmap_error_code
sss_idmap_ctx_get_rangesize(struct sss_idmap_ctx *ctx, id_t *_rangesize)
{
CHECK_IDMAP_CTX(ctx, IDMAP_CONTEXT_INVALID);
*_rangesize = ctx->idmap_opts.rangesize;
return IDMAP_SUCCESS;
}
|