forked from rescatux/chntpw
-
Notifications
You must be signed in to change notification settings - Fork 3
/
libsam.c
1889 lines (1411 loc) · 49.7 KB
/
libsam.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
/*
* libsam.c - SAM database functions, user and group editing
*
* Functions to edit SAM database, like adding and removing
* users to groups, list users and groups
* list user data and reset passwords
* low level SID handling functions
*
* 2013-aug: Cleaned up a bit for release, still some debug/strange things left
* 2013-aug: actually having functions doing listings in library is not good, bu
* have to do with that for now.
* 2013-apr-may: Functions for password reset, more group stuff etc
* 2012-oct: Split off from functions in chntpw.c
* 2012-jun-oct: Made routines for group handling (add/remove user from group etc)
*
* See HISTORY.txt for more detailed info on history.
*
*****
*
* Copyright (c) 1997-2013 Petter Nordahl-Hagen.
*
* 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; version 2 of the License.
*
* 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.
*
* See file GPL.txt for the full license.
*
*****
*
* Some information and ideas taken from pwdump by Jeremy Allison.
* More info from NTCrack by Jonathan Wilkins.
*
*/
#include <stdio.h>
#include <sys/types.h>
#include <stdlib.h>
#include <string.h>
#include "ntreg.h"
#include "sam.h"
extern int gverbose; /* Ehm.. must get rid of this some day */
/* Strings for account bits fields */
char *acb_fields[16] = {
"Disabled" ,
"Homedir req." ,
"Passwd not req." ,
"Temp. duplicate" ,
"Normal account" ,
"NMS account" ,
"Domain trust act." ,
"Wks trust act." ,
"Srv trust act" ,
"Pwd don't expire" ,
"Auto lockout" ,
"(unknown 0x08)" ,
"(unknown 0x10)" ,
"(unknown 0x20)" ,
"(unknown 0x40)" ,
"(unknown 0x80)" ,
};
/* Number of paths we find group info under, needed by some later routines */
#define SAM_NUM_GROUPPATHS 2
/* Paths for group ID list*/
static char *SAM_GRPCPATHS[] = {
"\\SAM\\Domains\\Builtin\\Aliases",
"\\SAM\\Domains\\Account\\Aliases",
"" };
/* Paths for C (group data) value under group ID %08X */
static char *SAM_GRPCPATHID[] = {
"\\SAM\\Domains\\Builtin\\Aliases\\%08X\\C",
"\\SAM\\Domains\\Account\\Aliases\\%08X\\C",
"" };
/* Paths for users lists of group memberships, machine SID %s , user RID %08x
* each key contains one default value (no name) with TYPE indicating number of group IDs it contains
* value contents is then an array of 32 bit group IDs
*/
static char *SAM_GRPMEMBERSPATH[] = {
"\\SAM\\Domains\\Builtin\\Aliases\\Members\\%s\\%08X",
"\\SAM\\Domains\\Account\\Aliases\\Members\\%s\\%08X",
"" };
static char *SAM_GRPSIDPATH[] = {
"\\SAM\\Domains\\Builtin\\Aliases\\Members\\%s",
"\\SAM\\Domains\\Account\\Aliases\\Members\\%s",
"" };
/* Check if hive is SAM, and if it is, extract some
* global policy information from it, like lockout counts etc
* show = 1 means also print some more info
* Returns the number of allowed logins before lockout (locklimit)
* or -1 if error (not SAM, key not found etc)
*/
int sam_get_lockoutinfo(struct hive *hdesc, int show)
{
struct accountdb_F *f;
struct keyval *v;
if (hdesc->type == HTYPE_SAM) {
/* Get accoundb F value */
v = get_val2buf(hdesc, NULL, 0, ACCOUNTDB_F_PATH, REG_BINARY, TPF_VK);
if (!v) {
fprintf(stderr,"WARNING: Login counts data not found in SAM\n");
return (-1);
}
f = (struct accountdb_F *)&v->data;
if (show) {
printf("\n* SAM policy limits:\n");
printf("Failed logins before lockout is: %d\n",f->locklimit);
printf("Minimum password length : %d\n",f->minpwlen);
printf("Password history count : %d\n",f->minpwlen);
}
return(f->locklimit);
}
return(-1); /* Not SAM */
}
/* Try to decode and possibly change account lockout etc
* This is \SAM\Domains\Account\Users\<RID>\F
* It's size seems to always be 0x50.
* Params: RID - user ID, mode - 0 silent, 1 print info, 2 edit.
* Returns: ACB bits with high bit set if lockout count is >0
*/
short sam_handle_accountbits(struct hive *hdesc, int rid, int mode)
{
struct user_F *f;
char s[200];
struct keyval *v;
unsigned short acb;
int b;
int max_sam_lock;
if (hdesc->type != HTYPE_SAM) return(0);
/* Get users F value */
snprintf(s,180,"\\SAM\\Domains\\Account\\Users\\%08X\\F",rid);
v = get_val2buf(hdesc, NULL, 0, s, REG_BINARY, TPF_VK_EXACT);
if (!v) {
printf("Cannot find value <%s>\n",s);
return(0);
}
if (v->len < 0x48) {
printf("handle_F: F value is 0x%x bytes, need >= 0x48, unable to check account flags!\n",v->len);
FREE(v);
return(0);
}
max_sam_lock = sam_get_lockoutinfo(hdesc, 0);
f = (struct user_F *)&v->data;
acb = f->ACB_bits;
if (mode == 1) {
printf("Account bits: 0x%04x =\n",acb);
for (b=0; b < 15; b++) {
printf("[%s] %-15.15s | ",
(acb & (1<<b)) ? "X" : " ", acb_fields[b] );
if (b%3 == 2) printf("\n");
}
printf("\nFailed login count: %u, while max tries is: %u\n",f->failedcnt,max_sam_lock);
printf("Total login count: %u\n",f->logins);
}
if (mode == 2) { /* MODE = 2, reset to default sane sets of bits and null failed login counter */
acb |= ACB_PWNOEXP;
acb &= ~ACB_DISABLED;
acb &= ~ACB_AUTOLOCK;
f->ACB_bits = acb;
f->failedcnt = 0;
put_buf2val(hdesc, v, 0, s, REG_BINARY,TPF_VK_EXACT); /* TODO: Check error return */
printf("Unlocked!\n");
}
return (acb | ( (f->failedcnt > 0 && f->failedcnt >= max_sam_lock)<<15 ) | (acb & ACB_AUTOLOCK)<<15 | (acb & ACB_DISABLED)<<15);
}
/***** SID data handling routines **********/
/* Get machines SID as binary (raw data)
* str = pointer to buffer, first 20 bytes will be filled in
* returns true if found, else 0
*/
int sam_get_machine_sid(struct hive *hdesc, char *sidbuf)
{
struct accountdb_V *v;
struct keyval *kv;
uint32_t ofs;
uint32_t len;
/* Get accoundb V value */
kv = get_val2buf(hdesc, NULL, 0, ACCOUNTDB_V_PATH, REG_BINARY, TPF_VK);
if (!kv) {
fprintf(stderr,"sam_get_machine_sid: Machine SID not found in SAM\n");
return(0);
}
// hexdump(&(kv->data), 0, kv->len,1);
v = (struct accountdb_V *)&kv->data;
ofs = v->sid_ofs;
len = v->sid_len + 4;
ofs += 0x40;
if (len != SID_BIN_LEN) {
fprintf(stderr,"sam_get_machine_sid: WARNING: SID found, but it has len=%d instead of expected %d bytes\n",len,SID_BIN_LEN);
}
// printf("get_machine_sid: adjusted ofs = %x, len = %x (%d)\n",ofs,len,len);
memcpy(sidbuf, (char *)v+ofs, len);
// hexdump(sidbuf, 0, len, 1);
return(1);
}
/* Make string out of SID, in S-1-5 authority (NT authority)
* like S-1-5-21-516312364-151943033-2698651
* Will allocate return string (which can be of variable lenght)
* NOTE: caller must free it
* sidbuf = the SID binary data structure with it's type+counter first
*
* returns str:
* 6 chars athority prefix (S-1-5-)
* 4 * 10 digits (the 4 32 bit groups)
* 3 for the - between the groups
* 1 for null termination
* 50 chars
*/
char *sam_sid_to_string(struct sid_binary *sidbuf)
{
int cnt, i;
char *str = NULL;
// hexdump(sidbuf, 0, 24, 1);
if (sidbuf->revision != 1) {
fprintf(stderr,"sam_sid_to_string: DEBUG: first byte unexpected: %d\n",sidbuf->revision);
}
cnt = sidbuf->sections;
// printf("sid_to_string: DEBUG: sections = %d\n",cnt);
str = str_dup("S-");
str = str_catf(str, "%u-%u", sidbuf->revision, sidbuf->authority);
for (i = 0; i < cnt; i++) {
str = str_catf(str,"-%u",sidbuf->array[i]);
}
// printf("sid_to_string: returning <%s>\n",str);
return(str);
}
/* Stuff SID binary list into more easily handled arrays
* sidbuf = binary list buffer (not changed, may point into value structure)
* size = number of bytes of raw data
* returns pointer to array, terminated with NULL pointer.
* Keeps full binary data from each SID
* All array space is allocated, call sam_free_sid_array() to free it.
*/
struct sid_array *sam_make_sid_array(struct sid_binary *sidbuf, int size)
{
int num = 0;
int sidlen;
struct sid_binary *sb;
struct sid_array *array;
CREATE(array, struct sid_array, 1);
array[0].len = 0;
array[0].sidptr = NULL;
while (size > 0) {
sidlen = sidbuf->sections * 4 + 8;
// printf("make_sid_array: sidlen = %d\n",sidlen);
ALLOC(sb, 1, sidlen);
memcpy(sb, sidbuf, sidlen);
array[num].len = sidlen;
array[num].sidptr = sb;
sidbuf = (void *)sidbuf + sidlen;
size -= sidlen;
num++;
array = realloc(array, (num + 1) * sizeof(struct sid_array));
array[num].len = 0;
array[num].sidptr = NULL;
}
return(array);
}
/* Free the sid array (from the function above) */
void sam_free_sid_array(struct sid_array *array)
{
int num = 0;
while (array[num].sidptr) {
free(array[num].sidptr);
num++;
}
free(array);
}
/* Compare two SIDs, and return like strcmp */
int sam_sid_cmp(struct sid_binary *s1, struct sid_binary *s2)
{
int p;
if (!s1 && !s2) return(0);
if (!s1) return(-1);
if (!s2) return(1);
if (s1->sections < s2->sections) return(-1); /* s1 has shorter len, always smaller */
if (s1->sections > s2->sections) return(1); /* s1 has longer len, always larger */
/* Run compare since same length */
for (p = 0; p < s1->sections; p++) {
if (s1->array[p] < s2->array[p]) return (-1);
if (s1->array[p] > s2->array[p]) return (1);
}
/* At end. Thus equal */
return(0);
}
/************** GROUP DATA HANDLING ROUTINES ****************/
/* Get C value of a group ID, searching botg bult-in and user defined
* hdesc - hive
* grp - group ID
* returns pointer to value buffer or NULL if not found
*/
struct keyval *sam_get_grpC(struct hive *hdesc, int grp)
{
struct keyval *c = NULL;
int n = 0;
char g[200];
/* Try built-in groups first (administrators, user, guests etc) */
while (*SAM_GRPCPATHID[n] && !c) {
snprintf(g, 180, SAM_GRPCPATHID[n], grp);
c = get_val2buf(hdesc, NULL, 0, g, 0, TPF_VK_EXACT);
n++;
}
return(c);
}
/* Get list of group members for a group
* Will get the SID list (as binary) into a buffer that will be allocated
* according to the neccessary size (based on member count)
* NOTE: Caller must free the buffer when not needed any more
* grp = group ID
* sidarray = pointer to pointer to sid array which will be allocated
* Returns number of members in the group
*/
int sam_get_grp_members_sid(struct hive *hdesc, int grp, struct sid_array **sarray)
{
// char groupname[128];
struct sid_array *marray;
struct keyval *c = NULL;
struct group_C *cd;
// int grpnamoffs, grpnamlen;
int mofs, mlen;
c = sam_get_grpC(hdesc, grp);
if (c) {
cd = (struct group_C *)&c->data;
// grpnamoffs = cd->grpname_ofs + 0x34;
// grpnamlen = cd->grpname_len;
// cheap_uni2ascii((char *)cd + grpnamoffs, groupname, grpnamlen);
// printf("get_grp_members_sid: group %x named %s has %d members\n",grp,groupname,cd->grp_members);
mofs = cd->members_ofs;
mlen = cd->members_len;
// printf("get_grp_members_sid: mofs = %x, mlen = %x (%d)\n", mofs,mlen,mlen);
// printf("get_grp_members_sid: ajusted: mofs = %x, mlen = %x (%d)\n", mofs + 0x34 ,mlen,mlen);
// hexdump(&c->data, 0, c->len, 1);
// hexdump(&cd->data[mofs], 0, mlen, 1);
marray = sam_make_sid_array((struct sid_binary *)&cd->data[mofs], mlen);
*sarray = marray;
// sam_free_sid_array(marray);
free(c);
} else {
printf("Group info for %x not found!\n",grp);
*sarray = NULL;
return(0);
}
return(cd->grp_members);
}
/* Put list of group members back into group C structure
* grp = group ID
* sidarray = pointer to sid array
* Returns true if success
*/
int sam_put_grp_members_sid(struct hive *hdesc, int grp, struct sid_array *sarray)
{
char g[200];
char groupname[128];
struct keyval *c = NULL;
struct group_C *cd;
int grpnamoffs, grpnamlen;
int mofs, mlen;
int sidlen = 0;
void *sidptr;
int i, n;
char *str;
/* Try built-in groups first (administrators, user, guests etc) */
n = 0;
while (*SAM_GRPCPATHID[n] && !c) {
snprintf(g, 180, SAM_GRPCPATHID[n], grp);
c = get_val2buf(hdesc, NULL, 0, g, 0, TPF_VK_EXACT);
n++;
}
if (c) {
cd = (struct group_C *)&c->data;
grpnamoffs = cd->grpname_ofs + 0x34;
grpnamlen = cd->grpname_len;
cheap_uni2ascii((char *)cd + grpnamoffs, groupname, grpnamlen);
if (gverbose) printf("put_grp_members_sid: group %x named %s has %d members\n",grp,groupname,cd->grp_members);
mofs = cd->members_ofs;
mlen = cd->members_len;
if (gverbose) printf("put_grp_members_sid: ajusted: mofs = %x, mlen = %x (%d)\n", mofs + 0x34 ,mlen,mlen);
if (gverbose) hexdump(&c->data, 0, c->len, 1);
/* Get total size of new SID data */
for (i = 0; sarray[i].sidptr; i++) sidlen += sarray[i].len;
if (gverbose) printf("put_grp_members_sid: new count : %d, new sidlen: %x\n",i,sidlen);
/* Resize buffer with C structure */
c = realloc(c, 4 + mofs + sidlen + 0x34); /* offset of SIDs + sids lenght + pointer list at start */
c->len = 0x34 + mofs + sidlen;
cd = (struct group_C *)&c->data;
mofs = cd->members_ofs;
sidptr = &cd->data[mofs];
for (i = 0; sarray[i].sidptr; i++) {
if (gverbose) printf(" copying : %d len %x, at %p\n",i,sarray[i].len, sidptr);
str = sam_sid_to_string(sarray[i].sidptr);
if (gverbose) printf(" Member # %d = <%s>\n", i, str);
FREE(str);
memcpy(sidptr, sarray[i].sidptr, sarray[i].len);
sidptr += sarray[i].len;
}
cd->members_len = sidlen; /* Update member count in C struct */
cd->grp_members = i;
if (gverbose) hexdump(&c->data, 0, c->len, 1);
if (!put_buf2val(hdesc, c, 0, g, 0, TPF_VK_EXACT)) {
fprintf(stderr,"put_grp_members_sid: could not write back group info in value %s\n",g);
free(c);
return(0);
}
free(c);
} else {
printf("Group info for %x not found!\n",grp);
return(0);
}
return(1);
}
/* Get group IDs a user is member of
* rid = user ID
* returns: since value data is just an array of grp ids (4 bytes each),
* just return the keyval structure (size + data)
* caller must free() keyval
*/
struct keyval *sam_get_user_grpids(struct hive *hdesc, int rid)
{
char s[200];
struct sid_binary sid;
char *sidstr;
int nk = 0;
struct keyval *m = NULL;
struct keyval *result = NULL;
struct keyval *newresult = NULL;
int count = 0;
int size;
int n;
if (!rid || (hdesc->type != HTYPE_SAM)) return(NULL);
if (!sam_get_machine_sid(hdesc, (char *)&sid)) {
fprintf(stderr,"sam_get_user_grpids: Could not find machine SID\n");
return(0);
}
sidstr = sam_sid_to_string(&sid);
/* Get member list for user on this machine */
n = 0; /* Look up user RID under computer SID under builtin and account path */
while (*SAM_GRPMEMBERSPATH[n]) {
snprintf(s, 180, SAM_GRPMEMBERSPATH[n], sidstr, rid);
if (gverbose) printf("sam_get_user_grpids: member path: %s\n",s);
nk = trav_path(hdesc, 0, s, 0);
if (nk) { /* Found a key */
/* Now, the TYPE field is the number of groups the user is member of */
/* Don't we just love the inconsistent use of fields!! */
nk += 4;
count = get_val_type(hdesc,nk,"@",TPF_VK_EXACT);
if (count == -1) {
printf("sam_get_user_grpids: Cannot find default value <%s\\@>\n",s);
n++;
continue;
}
// printf("sam_get_user_grpids: User is member of %d groups:\n",count);
/* This is the data size */
size = get_val_len(hdesc,nk,"@",TPF_VK_EXACT);
/* It should be 4 bytes for each group */
// if (gverbose) printf("Data size %d bytes.\n",size);
if (size != count * 4) {
printf("sam_get_user_grpids: DEBUG: Size is not 4 * count! May not matter anyway. Continuing..\n");
}
m = get_val2buf(hdesc, NULL, nk, "@", 0, TPF_VK_EXACT);
if (!m) {
printf("sam_get_user_grpids: Could not get value data! Giving up.\n");
FREE(sidstr);
return(NULL);
}
/* At this point we have a value containing member list from this part of the tree */
/* Just append this one to the earlier ones */
newresult = reg_valcat(result, m);
FREE(m);
FREE(result);
result = newresult;
}
n++;
}
FREE(sidstr);
if (!result) {
/* This probably means user is not in any group. Seems to be the case
for a couple of XPs built in support / guest users. So just return */
if (gverbose) printf("sam_get_user_grpids: Cannot find RID under computer SID <%s>\n",s);
return(NULL);
}
// printf(" sam_get_user_grpids done\n");
return(result);
}
/* Put/set group IDs a user is member of
* rid = user ID
* val = keyval structure of data, actual value data is a list
* of ints, one per group
* returns true if successful setting the value
*/
int sam_put_user_grpids(struct hive *hdesc, int rid, struct keyval *val)
{
char s[200];
char news[200];
char ks[12];
struct nk_key *newkey = NULL;
struct sid_binary sid;
char *sidstr;
int n, grp, pnum;
int newcount = 0;
int nk = 0;
int count = 0;
struct keyvala *v;
struct keyvala *new;
struct keyvala entry;
/* Pointers to value lists for each group path in use */
struct keyval *p[SAM_NUM_GROUPPATHS];
if (!rid || (hdesc->type != HTYPE_SAM)) return(0);
if (!val) return(0);
#if 0
if (!val->len) {
printf("sam_put_user_grpids: zero list len\n");
// return(0);
}
#endif
v = (struct keyvala *)val;
if (!sam_get_machine_sid(hdesc, (char *)&sid)) {
fprintf(stderr,"sam_put_user_grpids: Could not find machine SID\n");
return(0);
}
sidstr = sam_sid_to_string(&sid);
for (n = 0; n < SAM_NUM_GROUPPATHS; n++) {
ALLOC(p[n], sizeof(struct keyvala), 1);
p[n]->len = 0;
p[n]->data = 0;
}
/* Split value list into relevant stuff for each path */
for (n = 0; n < val->len >> 2; n++) {
grp = v->data[n];
for (pnum = 0; pnum < SAM_NUM_GROUPPATHS; pnum++) {
snprintf(s, 180, SAM_GRPCPATHID[pnum], grp);
// printf("sam_put_user_grpids: split path: %s\n",s);
nk = trav_path(hdesc, 0, s, TPF_VK_EXACT); /* Check if group is in path?? */
if (nk) { /* Yup, it is here */
entry.data[0] = grp;
entry.len = 4;
// printf("sam_put_user_grpids: path match for grp ID: %x\n", entry.data[1]);
new = (struct keyvala *)reg_valcat( p[pnum], (struct keyval *)&entry);
FREE( p[pnum] );
p[pnum] = (struct keyval *)new;
}
}
}
/* Now put the lists into the correct place */
for (n = 0; n < SAM_NUM_GROUPPATHS; n++) {
/* Get member list for user on this machine */
snprintf(s,180,SAM_GRPMEMBERSPATH[n] ,sidstr, rid);
// printf("sam_put_user_grpids: putting for path: %s\n",s);
newcount = p[n]->len >> 2;
// printf("--- list for that path has len: %d\n",p[n]->len);
for (pnum = 0; pnum < p[n]->len >> 2; pnum++) {
new = (struct keyvala *)p[n];
// printf("%d : %x\n", pnum, new->data[pnum]);
}
/* Find users member list under this path */
nk = trav_path(hdesc, 0, s, 0);
if (!nk) {
/* User is not in any group in this path, see if we need to create key */
if (gverbose) printf("sam_put_user_grpids: Cannot find path <%s>\n",s);
if (!newcount) continue; /* Nothing to put there anyway, so just try next path */
snprintf(news,180,SAM_GRPSIDPATH[n] ,sidstr);
// snprintf(ks, 180, "%08X", rid);
// printf("sam_put_user_grpids: creating key <%s> on path <%s>\n",ks,news);
nk = trav_path(hdesc, 0, news, 0);
newkey = add_key(hdesc, nk+4, ks);
if (!newkey) {
fprintf(stderr,"sam_put_user_grpids: ERROR: creating group list key for RID <%08x> under path <%s>\n",rid,news);
abort();
}
nk = trav_path(hdesc, 0, s, 0);
if (!add_value(hdesc, nk+4, "@", 0)) {
fprintf(stderr,"sam_put_user_grpids: ERROR: creating group list default value for RID <%08x> under path <%s>\n",rid,news);
abort();
}
}
nk += 4;
/* Now, the TYPE field is the number of groups the user is member of */
count = get_val_type(hdesc, nk,"@", TPF_VK_EXACT);
if (count == -1) {
printf("sam_put_user_grpids: Cannot find value <%s\\@>\n",s);
return(1);
}
if (gverbose) printf("sam_put_user_grpids: User was member of %d groups:\n",count);
/* This is the data size */
/* It should be 4 bytes for each group */
if (gverbose) printf("Data size %d bytes.\n",p[n]->len);
if (p[n]->len != newcount << 2) {
printf("set_user_grpids: DEBUG: Size is not 4 * count! May not matter anyway. Continuing..\n");
}
if (gverbose) printf("sam_put_user_grpids: User is NOW member of %d groups:\n",newcount);
if (newcount == 0) { /* Seems windows removes the key and default subvalue when user not in any group */
// printf("sam_put_user_grpids: removing user reference for path %s\n",s);
del_value(hdesc, nk, "@", 0);
nk = trav_path(hdesc, nk, "..", 0);
snprintf(s,180, "%08X", rid);
del_key(hdesc, nk + 4, s);
} else { /* Stuff back list into default value */
set_val_type(hdesc, nk, "@", TPF_VK_EXACT, newcount);
if (!put_buf2val(hdesc, p[n], nk, "@", 0, TPF_VK_EXACT) ) {
printf("sam_put_user_grpids: Could not set reg value data!\n");
return(0);
}
}
} /* for path loop */
FREE(sidstr);
for (n = 0; n < SAM_NUM_GROUPPATHS; n++) {
FREE(p[n]);
}
printf("sam_put_user_grpids: success exit\n");
return(1);
}
/********* GROUP / USER MANIPULATION ROUTINES **************/
/* Add user to a group
* rid = user RID
* grp = group ID
* return true if success
*/
int sam_add_user_to_grp(struct hive *hdesc, int rid, int grp)
{
struct keyvala *usrgrplist, *newusrgrplist;
struct sid_array *sarray, *narray;
struct sid_binary *usid;
struct sid_binary msid;
int members, newmembers;
char *str;
int ugcnt;
int o,n,hit,c;
unsigned int *og, *ng;
char s[200];
if (!rid || !grp || (hdesc->type !=HTYPE_SAM) ) return(0);
snprintf(s,180,"\\SAM\\Domains\\Account\\Users\\%08X\\V",rid);
if (!trav_path(hdesc, 0, s, TPF_VK_EXACT)) {
fprintf(stderr,"sam_add_user_to_grp: user # %x not found!\n",rid);
return(0);
}
/* Build user SID (add RID to machine SID) */
if (!sam_get_machine_sid(hdesc, (char *)&msid)) {
fprintf(stderr,"sam_add_user_to_grp: Could not find machine SID\n");
return(0);
}
/* well, and hope that machine SID is always same size here too */
ALLOC(usid, sizeof(struct sid_binary) +4, 1);
memcpy(usid, &msid, sizeof(struct sid_binary));
usid->array[4] = rid; /* Tack RID on at end */
usid->sections = 5;
str = sam_sid_to_string(usid);
if (gverbose) printf("add_user_to_grp: user SID is <%s>\n", str);
free(str);
/* With all of the above functions, it should now just be to get
* the list of groups the user account has listed under it
* and the list of users the group has listed under it
*/
usrgrplist = (struct keyvala *)sam_get_user_grpids(hdesc, rid);
if (!usrgrplist) {
printf("sam_add_user_to_grp: user # %x WAS IN NO GROUPS!\n",rid);
/* So make new blank list for it */
ALLOC(usrgrplist, sizeof(struct keyvala), 1);
usrgrplist->len = 0;
usrgrplist->data[0] = 0;
}
members = sam_get_grp_members_sid(hdesc, grp, &sarray);
if (!sarray) {
printf("sam_add_user_to_grp: group # %x not found!\n",grp);
FREE(usrgrplist);
return(0);
}
/* Add the group to the users list of groups it is member of */
ugcnt = usrgrplist->len >> 2; /* Count of groups already on user */
/* Allocate new larger usrgrplist for one more entry */
ALLOC(newusrgrplist, usrgrplist->len + 4 + 4, 1);
bzero(newusrgrplist, usrgrplist->len + 4 + 4); /* for sanity.. */
newusrgrplist->len = usrgrplist->len + 4;
og = (unsigned int *)&usrgrplist->data;
ng = (unsigned int *)&newusrgrplist->data;
if (gverbose) printf("usrgrplist-len = %d\n", usrgrplist->len);
#if 0 /* If list should be sorted, but seems windows does not do that? */
/* Copy over users group list, adding in where needed */
hit = 0;
for (o = 0, n = 0; o < ugcnt; o++, n++) {
printf(":: %d %d : %x\n",o,n,og[o]);
if (og[o] == grp) { /* Was already in there, so just don't increase size.. */
newusrgrplist->len = usrgrplist->len;
hit = 1;
}
if (og[o] > grp && !hit) {
ng[n++] = grp; /* Next is higher, so insert out rid */
hit = 1;
printf(" -- insert\n");
}
ng[n] = og[o];
}
printf("n = %d\n",n);
if (!hit) ng[n] = grp; /* Insert at end if we run down */
#endif
/* Copy over users group list, checking if already there */
hit = 0;
for (o = 0; o < ugcnt; o++) {
if (gverbose) printf(":: %d : %x\n",o,og[o]);
if (og[o] == grp) { /* Was already in there, so just don't increase size.. */
newusrgrplist->len = usrgrplist->len;
hit = 1;
if (gverbose) printf(" -- match\n");
}
ng[o] = og[o];
}
if (gverbose) printf(" - end of list at o = %d\n",o);
if (!hit) ng[o] = grp; /* Just stuff new group in at end if not already in list */
if (gverbose) {
for (o = 0; o < (newusrgrplist->len >> 2); o++) {
printf("grp index %d = %08x\n", o, ng[o]);
}
}
/* And then we add the user SID into the groups list of members */
if (gverbose) {
printf("add_user_to_grp: grp memberlist BEFORE:\n");
for (o = 0; sarray[o].sidptr; o++) {
str = sam_sid_to_string(sarray[o].sidptr);
printf(" Member # %d = <%s>\n", o, str);
FREE(str);
}
}
newmembers = members + 1;
ALLOC(narray, sizeof(struct sid_array) * (newmembers + 2), 1); /* Add one entry size */
if (gverbose) printf("members = %d\n", members);
hit = 0;
for (o = 0, n = 0; o <= members; o++, n++) {
c = sam_sid_cmp(sarray[o].sidptr, usid); /* Compare slot with new SID */
if (gverbose) printf("sam_sid_cmp returns %d\n",c);
if (c == 0) {
newmembers--; /* Already there, don't change anything */
hit = 1;