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
|
/*
Unix SMB/CIFS implementation.
RPC pipe client
Copyright (C) Tim Potter 2000-2001,
Copyright (C) Andrew Tridgell 1992-1997,2000,
Copyright (C) Rafal Szczesniak 2002
Copyright (C) Jeremy Allison 2005.
Copyright (C) Michael Adam 2007.
Copyright (C) Guenther Deschner 2008.
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 "includes.h"
#include "../librpc/gen_ndr/cli_lsa.h"
#include "rpc_client/cli_lsarpc.h"
#include "rpc_client/init_lsa.h"
#include "../libcli/security/security.h"
/** @defgroup lsa LSA - Local Security Architecture
* @ingroup rpc_client
*
* @{
**/
/**
* @file cli_lsarpc.c
*
* RPC client routines for the LSA RPC pipe. LSA means "local
* security authority", which is half of a password database.
**/
NTSTATUS dcerpc_lsa_open_policy(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
bool sec_qos,
uint32_t des_access,
struct policy_handle *pol,
NTSTATUS *result)
{
struct lsa_ObjectAttribute attr;
struct lsa_QosInfo qos;
uint16_t system_name = '\\';
ZERO_STRUCT(attr);
attr.len = 0x18;
if (sec_qos) {
qos.len = 0xc;
qos.impersonation_level = 2;
qos.context_mode = 1;
qos.effective_only = 0;
attr.sec_qos = &qos;
}
return dcerpc_lsa_OpenPolicy(h,
mem_ctx,
&system_name,
&attr,
des_access,
pol,
result);
}
/** Open a LSA policy handle
*
* @param cli Handle on an initialised SMB connection */
NTSTATUS rpccli_lsa_open_policy(struct rpc_pipe_client *cli,
TALLOC_CTX *mem_ctx,
bool sec_qos, uint32 des_access,
struct policy_handle *pol)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
status = dcerpc_lsa_open_policy(cli->binding_handle,
mem_ctx,
sec_qos,
des_access,
pol,
&result);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
return result;
}
NTSTATUS dcerpc_lsa_open_policy2(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
const char *srv_name_slash,
bool sec_qos,
uint32_t des_access,
struct policy_handle *pol,
NTSTATUS *result)
{
struct lsa_ObjectAttribute attr;
struct lsa_QosInfo qos;
ZERO_STRUCT(attr);
attr.len = 0x18;
if (sec_qos) {
qos.len = 0xc;
qos.impersonation_level = 2;
qos.context_mode = 1;
qos.effective_only = 0;
attr.sec_qos = &qos;
}
return dcerpc_lsa_OpenPolicy2(h,
mem_ctx,
srv_name_slash,
&attr,
des_access,
pol,
result);
}
/** Open a LSA policy handle
*
* @param cli Handle on an initialised SMB connection
*/
NTSTATUS rpccli_lsa_open_policy2(struct rpc_pipe_client *cli,
TALLOC_CTX *mem_ctx, bool sec_qos,
uint32 des_access, struct policy_handle *pol)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
status = dcerpc_lsa_open_policy(cli->binding_handle,
mem_ctx,
sec_qos,
des_access,
pol,
&result);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
return result;
}
/* Lookup a list of sids
*
* internal version withOUT memory allocation of the target arrays.
* this assumes suffciently sized arrays to store domains, names and types. */
static NTSTATUS dcerpc_lsa_lookup_sids_noalloc(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_sids,
const struct dom_sid *sids,
char **domains,
char **names,
enum lsa_SidType *types,
bool use_lookupsids3,
NTSTATUS *presult)
{
NTSTATUS status = NT_STATUS_OK;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
struct lsa_SidArray sid_array;
struct lsa_RefDomainList *ref_domains = NULL;
struct lsa_TransNameArray lsa_names;
enum lsa_LookupNamesLevel level = LSA_LOOKUP_NAMES_ALL;
uint32_t count = 0;
int i;
ZERO_STRUCT(lsa_names);
sid_array.num_sids = num_sids;
sid_array.sids = TALLOC_ARRAY(mem_ctx, struct lsa_SidPtr, num_sids);
if (sid_array.sids == NULL) {
return NT_STATUS_NO_MEMORY;
}
for (i = 0; i<num_sids; i++) {
sid_array.sids[i].sid = dom_sid_dup(mem_ctx, &sids[i]);
if (!sid_array.sids[i].sid) {
return NT_STATUS_NO_MEMORY;
}
}
if (use_lookupsids3) {
struct lsa_TransNameArray2 lsa_names2;
uint32_t n;
ZERO_STRUCT(lsa_names2);
status = dcerpc_lsa_LookupSids3(h,
mem_ctx,
&sid_array,
&ref_domains,
&lsa_names2,
level,
&count,
LSA_LOOKUP_OPTION_SEARCH_ISOLATED_NAMES,
LSA_CLIENT_REVISION_2,
&result);
if (NT_STATUS_IS_OK(status)) {
return status;
}
if(!NT_STATUS_IS_ERR(result)) {
lsa_names.count = lsa_names2.count;
lsa_names.names = talloc_array(mem_ctx,
struct lsa_TranslatedName,
lsa_names.count);
if (lsa_names.names == NULL) {
return NT_STATUS_NO_MEMORY;
}
for (n=0; n < lsa_names.count; n++) {
lsa_names.names[n].sid_type = lsa_names2.names[n].sid_type;
lsa_names.names[n].name = lsa_names2.names[n].name;
lsa_names.names[n].sid_index = lsa_names2.names[n].sid_index;
}
}
} else {
status = dcerpc_lsa_LookupSids(h,
mem_ctx,
pol,
&sid_array,
&ref_domains,
&lsa_names,
level,
&count,
&result);
}
DEBUG(10, ("LSA_LOOKUPSIDS returned status: '%s', result: '%s', "
"mapped count = %d'\n",
nt_errstr(status), nt_errstr(result), count));
if (!NT_STATUS_IS_OK(status)) {
return status;
}
if (!NT_STATUS_IS_OK(result) &&
!NT_STATUS_EQUAL(result, NT_STATUS_NONE_MAPPED) &&
!NT_STATUS_EQUAL(result, STATUS_SOME_UNMAPPED))
{
*presult = result;
return status;
}
/* Return output parameters */
if (NT_STATUS_EQUAL(result, NT_STATUS_NONE_MAPPED) ||
(count == 0))
{
for (i = 0; i < num_sids; i++) {
(names)[i] = NULL;
(domains)[i] = NULL;
(types)[i] = SID_NAME_UNKNOWN;
}
*presult = NT_STATUS_NONE_MAPPED;
return status;
}
for (i = 0; i < num_sids; i++) {
const char *name, *dom_name;
uint32_t dom_idx = lsa_names.names[i].sid_index;
/* Translate optimised name through domain index array */
if (dom_idx != 0xffffffff) {
dom_name = ref_domains->domains[dom_idx].name.string;
name = lsa_names.names[i].name.string;
if (name) {
(names)[i] = talloc_strdup(names, name);
if ((names)[i] == NULL) {
DEBUG(0, ("cli_lsa_lookup_sids_noalloc(): out of memory\n"));
*presult = NT_STATUS_UNSUCCESSFUL;
return status;
}
} else {
(names)[i] = NULL;
}
domains[i] = talloc_strdup(domains,
dom_name ? dom_name : "");
(types)[i] = lsa_names.names[i].sid_type;
if (((domains)[i] == NULL)) {
DEBUG(0, ("cli_lsa_lookup_sids_noalloc(): out of memory\n"));
*presult = NT_STATUS_UNSUCCESSFUL;
return status;
}
} else {
(names)[i] = NULL;
(domains)[i] = NULL;
(types)[i] = SID_NAME_UNKNOWN;
}
}
*presult = NT_STATUS_OK;
return status;
}
/* Lookup a list of sids
*
* do it the right way: there is a limit (of 20480 for w2k3) entries
* returned by this call. when the sids list contains more entries,
* empty lists are returned. This version of lsa_lookup_sids passes
* the list of sids in hunks of LOOKUP_SIDS_HUNK_SIZE to the lsa call. */
/* This constant defines the limit of how many sids to look up
* in one call (maximum). the limit from the server side is
* at 20480 for win2k3, but we keep it at a save 1000 for now. */
#define LOOKUP_SIDS_HUNK_SIZE 1000
static NTSTATUS dcerpc_lsa_lookup_sids_generic(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_sids,
const struct dom_sid *sids,
char ***pdomains,
char ***pnames,
enum lsa_SidType **ptypes,
bool use_lookupsids3,
NTSTATUS *presult)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_OK;
int sids_left = 0;
int sids_processed = 0;
const struct dom_sid *hunk_sids = sids;
char **hunk_domains;
char **hunk_names;
enum lsa_SidType *hunk_types;
char **domains = NULL;
char **names = NULL;
enum lsa_SidType *types = NULL;
bool have_mapped = false;
bool have_unmapped = false;
if (num_sids) {
if (!(domains = TALLOC_ARRAY(mem_ctx, char *, num_sids))) {
DEBUG(0, ("rpccli_lsa_lookup_sids(): out of memory\n"));
result = NT_STATUS_NO_MEMORY;
goto fail;
}
if (!(names = TALLOC_ARRAY(mem_ctx, char *, num_sids))) {
DEBUG(0, ("rpccli_lsa_lookup_sids(): out of memory\n"));
result = NT_STATUS_NO_MEMORY;
goto fail;
}
if (!(types = TALLOC_ARRAY(mem_ctx, enum lsa_SidType, num_sids))) {
DEBUG(0, ("rpccli_lsa_lookup_sids(): out of memory\n"));
result = NT_STATUS_NO_MEMORY;
goto fail;
}
}
sids_left = num_sids;
hunk_domains = domains;
hunk_names = names;
hunk_types = types;
while (sids_left > 0) {
int hunk_num_sids;
NTSTATUS hunk_result;
hunk_num_sids = ((sids_left > LOOKUP_SIDS_HUNK_SIZE)
? LOOKUP_SIDS_HUNK_SIZE
: sids_left);
DEBUG(10, ("rpccli_lsa_lookup_sids: processing items "
"%d -- %d of %d.\n",
sids_processed,
sids_processed + hunk_num_sids - 1,
num_sids));
status = dcerpc_lsa_lookup_sids_noalloc(h,
mem_ctx,
pol,
hunk_num_sids,
hunk_sids,
hunk_domains,
hunk_names,
hunk_types,
use_lookupsids3,
&hunk_result);
if (!NT_STATUS_IS_OK(status)) {
goto fail;
}
if (!NT_STATUS_IS_OK(hunk_result) &&
!NT_STATUS_EQUAL(hunk_result, STATUS_SOME_UNMAPPED) &&
!NT_STATUS_EQUAL(hunk_result, NT_STATUS_NONE_MAPPED))
{
/* An actual error occured */
*presult = hunk_result;
goto fail;
}
if (NT_STATUS_IS_OK(hunk_result)) {
have_mapped = true;
}
if (NT_STATUS_EQUAL(hunk_result, NT_STATUS_NONE_MAPPED)) {
have_unmapped = true;
}
if (NT_STATUS_EQUAL(hunk_result, STATUS_SOME_UNMAPPED)) {
int i;
for (i=0; i<hunk_num_sids; i++) {
if (hunk_types[i] == SID_NAME_UNKNOWN) {
have_unmapped = true;
} else {
have_mapped = true;
}
}
}
sids_left -= hunk_num_sids;
sids_processed += hunk_num_sids; /* only used in DEBUG */
hunk_sids += hunk_num_sids;
hunk_domains += hunk_num_sids;
hunk_names += hunk_num_sids;
hunk_types += hunk_num_sids;
}
*pdomains = domains;
*pnames = names;
*ptypes = types;
if (!have_mapped) {
result = NT_STATUS_NONE_MAPPED;
}
if (have_unmapped) {
result = STATUS_SOME_UNMAPPED;
}
*presult = result;
return status;
fail:
TALLOC_FREE(domains);
TALLOC_FREE(names);
TALLOC_FREE(types);
return status;
}
NTSTATUS dcerpc_lsa_lookup_sids(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_sids,
const struct dom_sid *sids,
char ***pdomains,
char ***pnames,
enum lsa_SidType **ptypes,
NTSTATUS *result)
{
return dcerpc_lsa_lookup_sids_generic(h,
mem_ctx,
pol,
num_sids,
sids,
pdomains,
pnames,
ptypes,
false,
result);
}
NTSTATUS rpccli_lsa_lookup_sids(struct rpc_pipe_client *cli,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_sids,
const struct dom_sid *sids,
char ***pdomains,
char ***pnames,
enum lsa_SidType **ptypes)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
status = dcerpc_lsa_lookup_sids_generic(cli->binding_handle,
mem_ctx,
pol,
num_sids,
sids,
pdomains,
pnames,
ptypes,
false,
&result);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
return result;
}
NTSTATUS dcerpc_lsa_lookup_sids3(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_sids,
const struct dom_sid *sids,
char ***pdomains,
char ***pnames,
enum lsa_SidType **ptypes,
NTSTATUS *result)
{
return dcerpc_lsa_lookup_sids_generic(h,
mem_ctx,
pol,
num_sids,
sids,
pdomains,
pnames,
ptypes,
true,
result);
}
NTSTATUS rpccli_lsa_lookup_sids3(struct rpc_pipe_client *cli,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_sids,
const struct dom_sid *sids,
char ***pdomains,
char ***pnames,
enum lsa_SidType **ptypes)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
status = dcerpc_lsa_lookup_sids_generic(cli->binding_handle,
mem_ctx,
pol,
num_sids,
sids,
pdomains,
pnames,
ptypes,
true,
&result);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
return result;
}
/** Lookup a list of names */
static NTSTATUS dcerpc_lsa_lookup_names_generic(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
uint32_t num_names,
const char **names,
const char ***dom_names,
enum lsa_LookupNamesLevel level,
struct dom_sid **sids,
enum lsa_SidType **types,
bool use_lookupnames4,
NTSTATUS *presult)
{
NTSTATUS status;
struct lsa_String *lsa_names = NULL;
struct lsa_RefDomainList *domains = NULL;
struct lsa_TransSidArray sid_array;
struct lsa_TransSidArray3 sid_array3;
uint32_t count = 0;
uint32_t i;
ZERO_STRUCT(sid_array);
ZERO_STRUCT(sid_array3);
lsa_names = TALLOC_ARRAY(mem_ctx, struct lsa_String, num_names);
if (lsa_names == NULL) {
return NT_STATUS_NO_MEMORY;
}
for (i = 0; i < num_names; i++) {
init_lsa_String(&lsa_names[i], names[i]);
}
if (use_lookupnames4) {
status = dcerpc_lsa_LookupNames4(h,
mem_ctx,
num_names,
lsa_names,
&domains,
&sid_array3,
level,
&count,
LSA_LOOKUP_OPTION_SEARCH_ISOLATED_NAMES,
LSA_CLIENT_REVISION_2,
presult);
} else {
status = dcerpc_lsa_LookupNames(h,
mem_ctx,
pol,
num_names,
lsa_names,
&domains,
&sid_array,
level,
&count,
presult);
}
if (!NT_STATUS_IS_OK(status)) {
goto done;
}
if (!NT_STATUS_IS_OK(*presult) &&
!NT_STATUS_EQUAL(*presult, STATUS_SOME_UNMAPPED)) {
/* An actual error occured */
goto done;
}
/* Return output parameters */
if (count == 0) {
*presult = NT_STATUS_NONE_MAPPED;
goto done;
}
if (num_names) {
if (!((*sids = TALLOC_ARRAY(mem_ctx, struct dom_sid, num_names)))) {
DEBUG(0, ("cli_lsa_lookup_sids(): out of memory\n"));
*presult = NT_STATUS_NO_MEMORY;
goto done;
}
if (!((*types = TALLOC_ARRAY(mem_ctx, enum lsa_SidType, num_names)))) {
DEBUG(0, ("cli_lsa_lookup_sids(): out of memory\n"));
*presult = NT_STATUS_NO_MEMORY;
goto done;
}
if (dom_names != NULL) {
*dom_names = TALLOC_ARRAY(mem_ctx, const char *, num_names);
if (*dom_names == NULL) {
DEBUG(0, ("cli_lsa_lookup_sids(): out of memory\n"));
*presult = NT_STATUS_NO_MEMORY;
goto done;
}
}
} else {
*sids = NULL;
*types = NULL;
if (dom_names != NULL) {
*dom_names = NULL;
}
}
for (i = 0; i < num_names; i++) {
uint32_t dom_idx;
struct dom_sid *sid = &(*sids)[i];
if (use_lookupnames4) {
dom_idx = sid_array3.sids[i].sid_index;
(*types)[i] = sid_array3.sids[i].sid_type;
} else {
dom_idx = sid_array.sids[i].sid_index;
(*types)[i] = sid_array.sids[i].sid_type;
}
/* Translate optimised sid through domain index array */
if (dom_idx == 0xffffffff) {
/* Nothing to do, this is unknown */
ZERO_STRUCTP(sid);
(*types)[i] = SID_NAME_UNKNOWN;
continue;
}
if (use_lookupnames4) {
sid_copy(sid, sid_array3.sids[i].sid);
} else {
sid_copy(sid, domains->domains[dom_idx].sid);
if (sid_array.sids[i].rid != 0xffffffff) {
sid_append_rid(sid, sid_array.sids[i].rid);
}
}
if (dom_names == NULL) {
continue;
}
(*dom_names)[i] = domains->domains[dom_idx].name.string;
}
done:
return status;
}
NTSTATUS dcerpc_lsa_lookup_names(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
uint32_t num_names,
const char **names,
const char ***dom_names,
enum lsa_LookupNamesLevel level,
struct dom_sid **sids,
enum lsa_SidType **types,
NTSTATUS *result)
{
return dcerpc_lsa_lookup_names_generic(h,
mem_ctx,
pol,
num_names,
names,
dom_names,
level,
sids,
types,
false,
result);
}
NTSTATUS rpccli_lsa_lookup_names(struct rpc_pipe_client *cli,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_names,
const char **names,
const char ***dom_names,
int level,
struct dom_sid **sids,
enum lsa_SidType **types)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
status = dcerpc_lsa_lookup_names(cli->binding_handle,
mem_ctx,
pol,
num_names,
names,
dom_names,
level,
sids,
types,
&result);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
return result;
}
NTSTATUS dcerpc_lsa_lookup_names4(struct dcerpc_binding_handle *h,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
uint32_t num_names,
const char **names,
const char ***dom_names,
enum lsa_LookupNamesLevel level,
struct dom_sid **sids,
enum lsa_SidType **types,
NTSTATUS *result)
{
return dcerpc_lsa_lookup_names_generic(h,
mem_ctx,
pol,
num_names,
names,
dom_names,
level,
sids,
types,
true,
result);
}
NTSTATUS rpccli_lsa_lookup_names4(struct rpc_pipe_client *cli,
TALLOC_CTX *mem_ctx,
struct policy_handle *pol,
int num_names,
const char **names,
const char ***dom_names,
int level,
struct dom_sid **sids,
enum lsa_SidType **types)
{
NTSTATUS status;
NTSTATUS result = NT_STATUS_UNSUCCESSFUL;
status = dcerpc_lsa_lookup_names4(cli->binding_handle,
mem_ctx,
pol,
num_names,
names,
dom_names,
level,
sids,
types,
&result);
if (!NT_STATUS_IS_OK(status)) {
return status;
}
return result;
}
|