2 * Unix SMB/CIFS implementation.
3 * RPC Pipe client / server routines
4 * Copyright (C) Andrew Tridgell 1992-1997,
5 * Copyright (C) Luke Kenneth Casson Leighton 1996-1997,
6 * Copyright (C) Jeremy Allison 2001.
8 * This program is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License as published by
10 * the Free Software Foundation; either version 3 of the License, or
11 * (at your option) any later version.
13 * This program is distributed in the hope that it will be useful,
14 * but WITHOUT ANY WARRANTY; without even the implied warranty of
15 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
16 * GNU General Public License for more details.
18 * You should have received a copy of the GNU General Public License
19 * along with this program; if not, see <http://www.gnu.org/licenses/>.
25 #define DBGC_CLASS DBGC_RPC_SRV
28 * Handle database - stored per pipe.
32 struct policy
*next
, *prev
;
34 struct policy_handle pol_hnd
;
36 uint32_t access_granted
;
42 struct policy
*Policy
; /* List of policies. */
43 size_t count
; /* Current number of handles. */
44 size_t pipe_ref_count
; /* Number of pipe handles referring to this list. */
47 /* This is the max handles across all instances of a pipe name. */
49 #define MAX_OPEN_POLS 2048
52 /****************************************************************************
53 Hack as handles need to be persisant over lsa pipe closes so long as a samr
55 ****************************************************************************/
57 static bool is_samr_lsa_pipe(const struct ndr_syntax_id
*syntax
)
59 return (ndr_syntax_id_equal(syntax
, &ndr_table_samr
.syntax_id
)
60 || ndr_syntax_id_equal(syntax
, &ndr_table_lsarpc
.syntax_id
));
63 size_t num_pipe_handles(struct handle_list
*list
)
71 /****************************************************************************
72 Initialise a policy handle list on a pipe. Handle list is shared between all
73 pipes of the same name.
74 ****************************************************************************/
76 bool init_pipe_handle_list(pipes_struct
*p
, const struct ndr_syntax_id
*syntax
)
79 struct handle_list
*hl
;
81 for (plist
= get_first_internal_pipe();
83 plist
= get_next_internal_pipe(plist
)) {
84 if (ndr_syntax_id_equal(syntax
, &plist
->syntax
)) {
87 if (is_samr_lsa_pipe(&plist
->syntax
)
88 && is_samr_lsa_pipe(syntax
)) {
90 * samr and lsa share a handle space (same process
98 hl
= plist
->pipe_handles
;
104 * First open, we have to create the handle list
106 hl
= SMB_MALLOC_P(struct handle_list
);
112 DEBUG(10,("init_pipe_handle_list: created handle list for "
114 get_pipe_name_from_syntax(talloc_tos(), syntax
)));
118 * One more pipe is using this list.
121 hl
->pipe_ref_count
++;
124 * Point this pipe at this list.
127 p
->pipe_handles
= hl
;
129 DEBUG(10,("init_pipe_handle_list: pipe_handles ref count = %lu for "
130 "pipe %s\n", (unsigned long)p
->pipe_handles
->pipe_ref_count
,
131 get_pipe_name_from_syntax(talloc_tos(), syntax
)));
136 /****************************************************************************
137 find first available policy slot. creates a policy handle for you.
139 If "data_ptr" is given, this must be a talloc'ed object, create_policy_hnd
140 talloc_moves this into the handle. If the policy_hnd is closed,
141 data_ptr is TALLOC_FREE()'ed
142 ****************************************************************************/
144 static struct policy
*create_policy_hnd_internal(pipes_struct
*p
,
145 struct policy_handle
*hnd
,
148 static uint32 pol_hnd_low
= 0;
149 static uint32 pol_hnd_high
= 0;
150 time_t t
= time(NULL
);
154 if (p
->pipe_handles
->count
> MAX_OPEN_POLS
) {
155 DEBUG(0,("create_policy_hnd: ERROR: too many handles (%d) on this pipe.\n",
156 (int)p
->pipe_handles
->count
));
160 pol
= TALLOC_ZERO_P(NULL
, struct policy
);
162 DEBUG(0,("create_policy_hnd: ERROR: out of memory!\n"));
166 if (data_ptr
!= NULL
) {
167 pol
->data_ptr
= talloc_move(pol
, &data_ptr
);
171 if (pol_hnd_low
== 0)
174 SIVAL(&pol
->pol_hnd
.handle_type
, 0 , 0); /* first bit must be null */
175 SIVAL(&pol
->pol_hnd
.uuid
.time_low
, 0 , pol_hnd_low
); /* second bit is incrementing */
176 SSVAL(&pol
->pol_hnd
.uuid
.time_mid
, 0 , pol_hnd_high
); /* second bit is incrementing */
177 SSVAL(&pol
->pol_hnd
.uuid
.time_hi_and_version
, 0 , (pol_hnd_high
>>16)); /* second bit is incrementing */
179 /* split the current time into two 16 bit values */
181 SSVAL(pol
->pol_hnd
.uuid
.clock_seq
, 0, (t
>>16)); /* something random */
182 SSVAL(pol
->pol_hnd
.uuid
.node
, 0, t
); /* something random */
184 SIVAL(pol
->pol_hnd
.uuid
.node
, 2, sys_getpid()); /* something more random */
186 DLIST_ADD(p
->pipe_handles
->Policy
, pol
);
187 p
->pipe_handles
->count
++;
191 DEBUG(4,("Opened policy hnd[%d] ", (int)p
->pipe_handles
->count
));
192 dump_data(4, (uint8
*)hnd
, sizeof(*hnd
));
197 bool create_policy_hnd(pipes_struct
*p
, struct policy_handle
*hnd
,
200 return create_policy_hnd_internal(p
, hnd
, data_ptr
) != NULL
;
203 /****************************************************************************
204 find policy by handle - internal version.
205 ****************************************************************************/
207 static struct policy
*find_policy_by_hnd_internal(pipes_struct
*p
,
208 const struct policy_handle
*hnd
,
217 for (i
= 0, pol
=p
->pipe_handles
->Policy
;pol
;pol
=pol
->next
, i
++) {
218 if (memcmp(&pol
->pol_hnd
, hnd
, sizeof(*hnd
)) == 0) {
219 DEBUG(4,("Found policy hnd[%d] ", (int)i
));
220 dump_data(4, (uint8
*)hnd
, sizeof(*hnd
));
222 *data_p
= pol
->data_ptr
;
227 DEBUG(4,("Policy not found: "));
228 dump_data(4, (uint8
*)hnd
, sizeof(*hnd
));
230 p
->bad_handle_fault_state
= True
;
235 /****************************************************************************
236 find policy by handle
237 ****************************************************************************/
239 bool find_policy_by_hnd(pipes_struct
*p
, const struct policy_handle
*hnd
,
242 return find_policy_by_hnd_internal(p
, hnd
, data_p
) == NULL
? False
: True
;
245 /****************************************************************************
247 ****************************************************************************/
249 bool close_policy_hnd(pipes_struct
*p
, struct policy_handle
*hnd
)
251 struct policy
*pol
= find_policy_by_hnd_internal(p
, hnd
, NULL
);
254 DEBUG(3,("Error closing policy\n"));
258 DEBUG(3,("Closed policy\n"));
260 p
->pipe_handles
->count
--;
262 DLIST_REMOVE(p
->pipe_handles
->Policy
, pol
);
269 /****************************************************************************
270 Close a pipe - free the handle list if it was the last pipe reference.
271 ****************************************************************************/
273 void close_policy_by_pipe(pipes_struct
*p
)
275 p
->pipe_handles
->pipe_ref_count
--;
277 if (p
->pipe_handles
->pipe_ref_count
== 0) {
279 * Last pipe open on this list - free the list.
281 while (p
->pipe_handles
->Policy
)
282 close_policy_hnd(p
, &p
->pipe_handles
->Policy
->pol_hnd
);
284 p
->pipe_handles
->Policy
= NULL
;
285 p
->pipe_handles
->count
= 0;
287 SAFE_FREE(p
->pipe_handles
);
288 DEBUG(10,("close_policy_by_pipe: deleted handle list for "
290 get_pipe_name_from_syntax(talloc_tos(), &p
->syntax
)));
294 /*******************************************************************
295 Shall we allow access to this rpc? Currently this function
296 implements the 'restrict anonymous' setting by denying access to
297 anonymous users if the restrict anonymous level is > 0. Further work
298 will be checking a security descriptor to determine whether a user
299 token has enough access to access the pipe.
300 ********************************************************************/
302 bool pipe_access_check(pipes_struct
*p
)
304 /* Don't let anonymous users access this RPC if restrict
307 if (lp_restrict_anonymous() > 0) {
309 /* schannel, so we must be ok */
310 if (p
->pipe_bound
&& (p
->auth
.auth_type
== PIPE_AUTH_TYPE_SCHANNEL
)) {
314 if (p
->server_info
->guest
) {
322 void *_policy_handle_create(struct pipes_struct
*p
, struct policy_handle
*hnd
,
323 uint32_t access_granted
, size_t data_size
,
324 const char *type
, NTSTATUS
*pstatus
)
329 if (p
->pipe_handles
->count
> MAX_OPEN_POLS
) {
330 DEBUG(0, ("policy_handle_create: ERROR: too many handles (%d) "
331 "on pipe %s.\n", (int)p
->pipe_handles
->count
,
332 get_pipe_name_from_syntax(talloc_tos(), &p
->syntax
)));
333 *pstatus
= NT_STATUS_INSUFFICIENT_RESOURCES
;
337 data
= talloc_size(talloc_tos(), data_size
);
339 *pstatus
= NT_STATUS_NO_MEMORY
;
342 talloc_set_name_const(data
, type
);
344 pol
= create_policy_hnd_internal(p
, hnd
, data
);
347 *pstatus
= NT_STATUS_NO_MEMORY
;
350 pol
->access_granted
= access_granted
;
351 *pstatus
= NT_STATUS_OK
;
355 void *_policy_handle_find(struct pipes_struct
*p
,
356 const struct policy_handle
*hnd
,
357 uint32_t access_required
,
358 uint32_t *paccess_granted
,
359 const char *name
, const char *location
,
365 pol
= find_policy_by_hnd_internal(p
, hnd
, &data
);
367 *pstatus
= NT_STATUS_INVALID_HANDLE
;
370 if (strcmp(name
, talloc_get_name(data
)) != 0) {
371 DEBUG(10, ("expected %s, got %s\n", name
,
372 talloc_get_name(data
)));
373 *pstatus
= NT_STATUS_INVALID_HANDLE
;
376 if ((access_required
& pol
->access_granted
) != access_required
) {
377 if (geteuid() == sec_initial_uid()) {
378 DEBUG(4, ("%s: ACCESS should be DENIED (granted: "
379 "%#010x; required: %#010x)\n", location
,
380 pol
->access_granted
, access_required
));
381 DEBUGADD(4,("but overwritten by euid == 0\n"));
384 DEBUG(2,("%s: ACCESS DENIED (granted: %#010x; required: "
385 "%#010x)\n", location
, pol
->access_granted
,
387 *pstatus
= NT_STATUS_ACCESS_DENIED
;
392 DEBUG(10, ("found handle of type %s\n", talloc_get_name(data
)));
393 if (paccess_granted
!= NULL
) {
394 *paccess_granted
= pol
->access_granted
;
396 *pstatus
= NT_STATUS_OK
;