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
|
/*
* Unix SMB/CIFS implementation.
* RPC Pipe client / server routines
* Copyright (C) Andrew Tridgell 1992-1997,
* Copyright (C) Luke Kenneth Casson Leighton 1996-1997,
* Copyright (C) Jeremy Allison 2001.
*
* 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"
#undef DBGC_CLASS
#define DBGC_CLASS DBGC_RPC_SRV
/*
* Handle database - stored per pipe.
*/
struct policy {
struct policy *next, *prev;
struct policy_handle pol_hnd;
uint32_t access_granted;
void *data_ptr;
};
struct handle_list {
struct policy *Policy; /* List of policies. */
size_t count; /* Current number of handles. */
size_t pipe_ref_count; /* Number of pipe handles referring to this list. */
};
/* This is the max handles across all instances of a pipe name. */
#ifndef MAX_OPEN_POLS
#define MAX_OPEN_POLS 2048
#endif
/****************************************************************************
Hack as handles need to be persisant over lsa pipe closes so long as a samr
pipe is open. JRA.
****************************************************************************/
static bool is_samr_lsa_pipe(const struct ndr_syntax_id *syntax)
{
return (ndr_syntax_id_equal(syntax, &ndr_table_samr.syntax_id)
|| ndr_syntax_id_equal(syntax, &ndr_table_lsarpc.syntax_id));
}
size_t num_pipe_handles(struct handle_list *list)
{
if (list == NULL) {
return 0;
}
return list->count;
}
/****************************************************************************
Initialise a policy handle list on a pipe. Handle list is shared between all
pipes of the same name.
****************************************************************************/
bool init_pipe_handle_list(pipes_struct *p, const struct ndr_syntax_id *syntax)
{
pipes_struct *plist;
struct handle_list *hl;
for (plist = get_first_internal_pipe();
plist;
plist = get_next_internal_pipe(plist)) {
if (ndr_syntax_id_equal(syntax, &plist->syntax)) {
break;
}
if (is_samr_lsa_pipe(&plist->syntax)
&& is_samr_lsa_pipe(syntax)) {
/*
* samr and lsa share a handle space (same process
* under Windows?)
*/
break;
}
}
if (plist != NULL) {
hl = plist->pipe_handles;
if (hl == NULL) {
return false;
}
} else {
/*
* First open, we have to create the handle list
*/
hl = SMB_MALLOC_P(struct handle_list);
if (hl == NULL) {
return false;
}
ZERO_STRUCTP(hl);
DEBUG(10,("init_pipe_handles: created handle list for "
"pipe %s\n",
get_pipe_name_from_syntax(talloc_tos(), syntax)));
}
/*
* One more pipe is using this list.
*/
hl->pipe_ref_count++;
/*
* Point this pipe at this list.
*/
p->pipe_handles = hl;
DEBUG(10,("init_pipe_handles: pipe_handles ref count = %lu for pipe %s\n",
(unsigned long)p->pipe_handles->pipe_ref_count,
get_pipe_name_from_syntax(talloc_tos(), syntax)));
return True;
}
/****************************************************************************
find first available policy slot. creates a policy handle for you.
If "data_ptr" is given, this must be a talloc'ed object, create_policy_hnd
talloc_moves this into the handle. If the policy_hnd is closed,
data_ptr is TALLOC_FREE()'ed
****************************************************************************/
static struct policy *create_policy_hnd_internal(pipes_struct *p,
struct policy_handle *hnd,
void *data_ptr)
{
static uint32 pol_hnd_low = 0;
static uint32 pol_hnd_high = 0;
time_t t = time(NULL);
struct policy *pol;
if (p->pipe_handles->count > MAX_OPEN_POLS) {
DEBUG(0,("create_policy_hnd: ERROR: too many handles (%d) on this pipe.\n",
(int)p->pipe_handles->count));
return NULL;
}
pol = TALLOC_ZERO_P(NULL, struct policy);
if (!pol) {
DEBUG(0,("create_policy_hnd: ERROR: out of memory!\n"));
return NULL;
}
if (data_ptr != NULL) {
pol->data_ptr = talloc_move(pol, &data_ptr);
}
pol_hnd_low++;
if (pol_hnd_low == 0)
(pol_hnd_high)++;
SIVAL(&pol->pol_hnd.handle_type, 0 , 0); /* first bit must be null */
SIVAL(&pol->pol_hnd.uuid.time_low, 0 , pol_hnd_low ); /* second bit is incrementing */
SSVAL(&pol->pol_hnd.uuid.time_mid, 0 , pol_hnd_high); /* second bit is incrementing */
SSVAL(&pol->pol_hnd.uuid.time_hi_and_version, 0 , (pol_hnd_high>>16)); /* second bit is incrementing */
/* split the current time into two 16 bit values */
SSVAL(pol->pol_hnd.uuid.clock_seq, 0, (t>>16)); /* something random */
SSVAL(pol->pol_hnd.uuid.node, 0, t); /* something random */
SIVAL(pol->pol_hnd.uuid.node, 2, sys_getpid()); /* something more random */
DLIST_ADD(p->pipe_handles->Policy, pol);
p->pipe_handles->count++;
*hnd = pol->pol_hnd;
DEBUG(4,("Opened policy hnd[%d] ", (int)p->pipe_handles->count));
dump_data(4, (uint8 *)hnd, sizeof(*hnd));
return pol;
}
bool create_policy_hnd(pipes_struct *p, struct policy_handle *hnd,
void *data_ptr)
{
return create_policy_hnd_internal(p, hnd, data_ptr) != NULL;
}
/****************************************************************************
find policy by handle - internal version.
****************************************************************************/
static struct policy *find_policy_by_hnd_internal(pipes_struct *p,
const struct policy_handle *hnd,
void **data_p)
{
struct policy *pol;
size_t i;
if (data_p)
*data_p = NULL;
for (i = 0, pol=p->pipe_handles->Policy;pol;pol=pol->next, i++) {
if (memcmp(&pol->pol_hnd, hnd, sizeof(*hnd)) == 0) {
DEBUG(4,("Found policy hnd[%d] ", (int)i));
dump_data(4, (uint8 *)hnd, sizeof(*hnd));
if (data_p)
*data_p = pol->data_ptr;
return pol;
}
}
DEBUG(4,("Policy not found: "));
dump_data(4, (uint8 *)hnd, sizeof(*hnd));
p->bad_handle_fault_state = True;
return NULL;
}
/****************************************************************************
find policy by handle
****************************************************************************/
bool find_policy_by_hnd(pipes_struct *p, const struct policy_handle *hnd,
void **data_p)
{
return find_policy_by_hnd_internal(p, hnd, data_p) == NULL ? False : True;
}
/****************************************************************************
Close a policy.
****************************************************************************/
bool close_policy_hnd(pipes_struct *p, struct policy_handle *hnd)
{
struct policy *pol = find_policy_by_hnd_internal(p, hnd, NULL);
if (!pol) {
DEBUG(3,("Error closing policy\n"));
return False;
}
DEBUG(3,("Closed policy\n"));
p->pipe_handles->count--;
DLIST_REMOVE(p->pipe_handles->Policy, pol);
TALLOC_FREE(pol);
return True;
}
/****************************************************************************
Close a pipe - free the handle list if it was the last pipe reference.
****************************************************************************/
void close_policy_by_pipe(pipes_struct *p)
{
p->pipe_handles->pipe_ref_count--;
if (p->pipe_handles->pipe_ref_count == 0) {
/*
* Last pipe open on this list - free the list.
*/
while (p->pipe_handles->Policy)
close_policy_hnd(p, &p->pipe_handles->Policy->pol_hnd);
p->pipe_handles->Policy = NULL;
p->pipe_handles->count = 0;
SAFE_FREE(p->pipe_handles);
DEBUG(10,("close_policy_by_pipe: deleted handle list for "
"pipe %s\n",
get_pipe_name_from_syntax(talloc_tos(), &p->syntax)));
}
}
/*******************************************************************
Shall we allow access to this rpc? Currently this function
implements the 'restrict anonymous' setting by denying access to
anonymous users if the restrict anonymous level is > 0. Further work
will be checking a security descriptor to determine whether a user
token has enough access to access the pipe.
********************************************************************/
bool pipe_access_check(pipes_struct *p)
{
/* Don't let anonymous users access this RPC if restrict
anonymous > 0 */
if (lp_restrict_anonymous() > 0) {
/* schannel, so we must be ok */
if (p->pipe_bound && (p->auth.auth_type == PIPE_AUTH_TYPE_SCHANNEL)) {
return True;
}
if (p->server_info->guest) {
return False;
}
}
return True;
}
void *_policy_handle_create(struct pipes_struct *p, struct policy_handle *hnd,
uint32_t access_granted, size_t data_size,
const char *type, NTSTATUS *pstatus)
{
struct policy *pol;
void *data;
if (p->pipe_handles->count > MAX_OPEN_POLS) {
DEBUG(0, ("policy_handle_create: ERROR: too many handles (%d) "
"on pipe %s.\n", (int)p->pipe_handles->count,
get_pipe_name_from_syntax(talloc_tos(), &p->syntax)));
*pstatus = NT_STATUS_INSUFFICIENT_RESOURCES;
return NULL;
}
data = talloc_size(talloc_tos(), data_size);
if (data == NULL) {
*pstatus = NT_STATUS_NO_MEMORY;
return NULL;
}
talloc_set_name_const(data, type);
pol = create_policy_hnd_internal(p, hnd, data);
if (pol == NULL) {
TALLOC_FREE(data);
*pstatus = NT_STATUS_NO_MEMORY;
return NULL;
}
pol->access_granted = access_granted;
*pstatus = NT_STATUS_OK;
return data;
}
void *_policy_handle_find(struct pipes_struct *p,
const struct policy_handle *hnd,
uint32_t access_required,
uint32_t *paccess_granted,
const char *name, const char *location,
NTSTATUS *pstatus)
{
struct policy *pol;
void *data;
pol = find_policy_by_hnd_internal(p, hnd, &data);
if (pol == NULL) {
*pstatus = NT_STATUS_INVALID_HANDLE;
return NULL;
}
if (strcmp(name, talloc_get_name(data)) != 0) {
DEBUG(10, ("expected %s, got %s\n", name,
talloc_get_name(data)));
*pstatus = NT_STATUS_INVALID_HANDLE;
return NULL;
}
if ((access_required & pol->access_granted) != access_required) {
if (geteuid() == sec_initial_uid()) {
DEBUG(4, ("%s: ACCESS should be DENIED (granted: "
"%#010x; required: %#010x)\n", location,
pol->access_granted, access_required));
DEBUGADD(4,("but overwritten by euid == 0\n"));
goto okay;
}
DEBUG(2,("%s: ACCESS DENIED (granted: %#010x; required: "
"%#010x)\n", location, pol->access_granted,
access_required));
*pstatus = NT_STATUS_ACCESS_DENIED;
return NULL;
}
okay:
DEBUG(10, ("found handle of type %s\n", talloc_get_name(data)));
if (paccess_granted != NULL) {
*paccess_granted = pol->access_granted;
}
*pstatus = NT_STATUS_OK;
return data;
}
|