mirror of
https://github.com/samba-team/samba.git
synced 2024-12-25 23:21:54 +03:00
41525152f5
(This used to be commit 0df0e81784
)
470 lines
11 KiB
C
470 lines
11 KiB
C
/*
|
|
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"
|
|
|
|
/** @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.
|
|
**/
|
|
|
|
/** 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,
|
|
POLICY_HND *pol)
|
|
{
|
|
struct lsa_ObjectAttribute attr;
|
|
struct lsa_QosInfo qos;
|
|
uint16_t system_name = '\\';
|
|
|
|
if (sec_qos) {
|
|
init_lsa_sec_qos(&qos, 0xc, 2, 1, 0);
|
|
init_lsa_obj_attr(&attr,
|
|
0x18,
|
|
NULL,
|
|
NULL,
|
|
0,
|
|
NULL,
|
|
&qos);
|
|
} else {
|
|
init_lsa_obj_attr(&attr,
|
|
0x18,
|
|
NULL,
|
|
NULL,
|
|
0,
|
|
NULL,
|
|
NULL);
|
|
}
|
|
|
|
return rpccli_lsa_OpenPolicy(cli, mem_ctx,
|
|
&system_name,
|
|
&attr,
|
|
des_access,
|
|
pol);
|
|
}
|
|
|
|
/** 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, POLICY_HND *pol)
|
|
{
|
|
struct lsa_ObjectAttribute attr;
|
|
struct lsa_QosInfo qos;
|
|
|
|
if (sec_qos) {
|
|
init_lsa_sec_qos(&qos, 0xc, 2, 1, 0);
|
|
init_lsa_obj_attr(&attr,
|
|
0x18,
|
|
NULL,
|
|
NULL,
|
|
0,
|
|
NULL,
|
|
&qos);
|
|
} else {
|
|
init_lsa_obj_attr(&attr,
|
|
0x18,
|
|
NULL,
|
|
NULL,
|
|
0,
|
|
NULL,
|
|
NULL);
|
|
}
|
|
|
|
return rpccli_lsa_OpenPolicy2(cli, mem_ctx,
|
|
cli->srv_name_slash,
|
|
&attr,
|
|
des_access,
|
|
pol);
|
|
}
|
|
|
|
/* 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 rpccli_lsa_lookup_sids_noalloc(struct rpc_pipe_client *cli,
|
|
TALLOC_CTX *mem_ctx,
|
|
POLICY_HND *pol,
|
|
int num_sids,
|
|
const DOM_SID *sids,
|
|
char **domains,
|
|
char **names,
|
|
enum lsa_SidType *types)
|
|
{
|
|
NTSTATUS result = NT_STATUS_OK;
|
|
TALLOC_CTX *tmp_ctx = NULL;
|
|
int i;
|
|
struct lsa_SidArray sid_array;
|
|
struct lsa_RefDomainList *ref_domains = NULL;
|
|
struct lsa_TransNameArray lsa_names;
|
|
uint32_t count = 0;
|
|
uint16_t level = 1;
|
|
|
|
ZERO_STRUCT(lsa_names);
|
|
|
|
tmp_ctx = talloc_new(mem_ctx);
|
|
if (!tmp_ctx) {
|
|
DEBUG(0, ("rpccli_lsa_lookup_sids_noalloc: out of memory!\n"));
|
|
result = NT_STATUS_UNSUCCESSFUL;
|
|
goto done;
|
|
}
|
|
|
|
sid_array.num_sids = num_sids;
|
|
sid_array.sids = TALLOC_ARRAY(mem_ctx, struct lsa_SidPtr, num_sids);
|
|
if (!sid_array.sids) {
|
|
return NT_STATUS_NO_MEMORY;
|
|
}
|
|
|
|
for (i = 0; i<num_sids; i++) {
|
|
sid_array.sids[i].sid = sid_dup_talloc(mem_ctx, &sids[i]);
|
|
if (!sid_array.sids[i].sid) {
|
|
return NT_STATUS_NO_MEMORY;
|
|
}
|
|
}
|
|
|
|
result = rpccli_lsa_LookupSids(cli, mem_ctx,
|
|
pol,
|
|
&sid_array,
|
|
&ref_domains,
|
|
&lsa_names,
|
|
level,
|
|
&count);
|
|
|
|
DEBUG(10, ("LSA_LOOKUPSIDS returned '%s', mapped count = %d'\n",
|
|
nt_errstr(result), count));
|
|
|
|
if (!NT_STATUS_IS_OK(result) &&
|
|
!NT_STATUS_EQUAL(result, NT_STATUS_NONE_MAPPED) &&
|
|
!NT_STATUS_EQUAL(result, STATUS_SOME_UNMAPPED))
|
|
{
|
|
/* An actual error occured */
|
|
goto done;
|
|
}
|
|
|
|
/* 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;
|
|
}
|
|
result = NT_STATUS_NONE_MAPPED;
|
|
goto done;
|
|
}
|
|
|
|
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(mem_ctx, name);
|
|
if ((names)[i] == NULL) {
|
|
DEBUG(0, ("cli_lsa_lookup_sids_noalloc(): out of memory\n"));
|
|
result = NT_STATUS_UNSUCCESSFUL;
|
|
goto done;
|
|
}
|
|
} else {
|
|
(names)[i] = NULL;
|
|
}
|
|
(domains)[i] = talloc_strdup(mem_ctx, 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"));
|
|
result = NT_STATUS_UNSUCCESSFUL;
|
|
goto done;
|
|
}
|
|
|
|
} else {
|
|
(names)[i] = NULL;
|
|
(domains)[i] = NULL;
|
|
(types)[i] = SID_NAME_UNKNOWN;
|
|
}
|
|
}
|
|
|
|
done:
|
|
TALLOC_FREE(tmp_ctx);
|
|
return result;
|
|
}
|
|
|
|
/* 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
|
|
|
|
NTSTATUS rpccli_lsa_lookup_sids(struct rpc_pipe_client *cli,
|
|
TALLOC_CTX *mem_ctx,
|
|
POLICY_HND *pol,
|
|
int num_sids,
|
|
const DOM_SID *sids,
|
|
char ***pdomains,
|
|
char ***pnames,
|
|
enum lsa_SidType **ptypes)
|
|
{
|
|
NTSTATUS result = NT_STATUS_OK;
|
|
int sids_left = 0;
|
|
int sids_processed = 0;
|
|
const 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;
|
|
|
|
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 = NT_STATUS_OK;
|
|
|
|
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));
|
|
|
|
hunk_result = rpccli_lsa_lookup_sids_noalloc(cli,
|
|
mem_ctx,
|
|
pol,
|
|
hunk_num_sids,
|
|
hunk_sids,
|
|
hunk_domains,
|
|
hunk_names,
|
|
hunk_types);
|
|
|
|
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 */
|
|
result = hunk_result;
|
|
goto fail;
|
|
}
|
|
|
|
/* adapt overall result */
|
|
if (( NT_STATUS_IS_OK(result) &&
|
|
!NT_STATUS_IS_OK(hunk_result))
|
|
||
|
|
( NT_STATUS_EQUAL(result, NT_STATUS_NONE_MAPPED) &&
|
|
!NT_STATUS_EQUAL(hunk_result, NT_STATUS_NONE_MAPPED)))
|
|
{
|
|
result = STATUS_SOME_UNMAPPED;
|
|
}
|
|
|
|
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;
|
|
return result;
|
|
|
|
fail:
|
|
TALLOC_FREE(domains);
|
|
TALLOC_FREE(names);
|
|
TALLOC_FREE(types);
|
|
return result;
|
|
}
|
|
|
|
/** Lookup a list of names */
|
|
|
|
NTSTATUS rpccli_lsa_lookup_names(struct rpc_pipe_client *cli,
|
|
TALLOC_CTX *mem_ctx,
|
|
POLICY_HND *pol, int num_names,
|
|
const char **names,
|
|
const char ***dom_names,
|
|
int level,
|
|
DOM_SID **sids,
|
|
enum lsa_SidType **types)
|
|
{
|
|
NTSTATUS result;
|
|
int i;
|
|
struct lsa_String *lsa_names = NULL;
|
|
struct lsa_RefDomainList *domains = NULL;
|
|
struct lsa_TransSidArray sid_array;
|
|
uint32_t count = 0;
|
|
|
|
ZERO_STRUCT(sid_array);
|
|
|
|
lsa_names = TALLOC_ARRAY(mem_ctx, struct lsa_String, num_names);
|
|
if (!lsa_names) {
|
|
return NT_STATUS_NO_MEMORY;
|
|
}
|
|
|
|
for (i=0; i<num_names; i++) {
|
|
init_lsa_String(&lsa_names[i], names[i]);
|
|
}
|
|
|
|
result = rpccli_lsa_LookupNames(cli, mem_ctx,
|
|
pol,
|
|
num_names,
|
|
lsa_names,
|
|
&domains,
|
|
&sid_array,
|
|
level,
|
|
&count);
|
|
|
|
if (!NT_STATUS_IS_OK(result) && NT_STATUS_V(result) !=
|
|
NT_STATUS_V(STATUS_SOME_UNMAPPED)) {
|
|
|
|
/* An actual error occured */
|
|
|
|
goto done;
|
|
}
|
|
|
|
/* Return output parameters */
|
|
|
|
if (count == 0) {
|
|
result = NT_STATUS_NONE_MAPPED;
|
|
goto done;
|
|
}
|
|
|
|
if (num_names) {
|
|
if (!((*sids = TALLOC_ARRAY(mem_ctx, DOM_SID, num_names)))) {
|
|
DEBUG(0, ("cli_lsa_lookup_sids(): out of memory\n"));
|
|
result = 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"));
|
|
result = 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"));
|
|
result = 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 = sid_array.sids[i].sid_index;
|
|
uint32_t dom_rid = sid_array.sids[i].rid;
|
|
DOM_SID *sid = &(*sids)[i];
|
|
|
|
/* 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;
|
|
}
|
|
|
|
sid_copy(sid, domains->domains[dom_idx].sid);
|
|
|
|
if (dom_rid != 0xffffffff) {
|
|
sid_append_rid(sid, dom_rid);
|
|
}
|
|
|
|
(*types)[i] = sid_array.sids[i].sid_type;
|
|
|
|
if (dom_names == NULL) {
|
|
continue;
|
|
}
|
|
|
|
(*dom_names)[i] = domains->domains[dom_idx].name.string;
|
|
}
|
|
|
|
done:
|
|
|
|
return result;
|
|
}
|