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
27 /* This is the max handles across all instances of a pipe name. */
29 #define MAX_OPEN_POLS 1024
32 /****************************************************************************
33 Hack as handles need to be persisant over lsa pipe closes so long as a samr
35 ****************************************************************************/
37 static bool is_samr_lsa_pipe(const char *pipe_name
)
39 return (strstr(pipe_name
, "samr") || strstr(pipe_name
, "lsa"));
42 /****************************************************************************
43 Initialise a policy handle list on a pipe. Handle list is shared between all
44 pipes of the same name.
45 ****************************************************************************/
47 bool init_pipe_handle_list(pipes_struct
*p
, const char *pipe_name
)
49 pipes_struct
*plist
= get_first_internal_pipe();
50 struct handle_list
*hl
= NULL
;
52 for (plist
= get_first_internal_pipe(); plist
; plist
= get_next_internal_pipe(plist
)) {
53 if (strequal( plist
->name
, pipe_name
) ||
54 (is_samr_lsa_pipe(plist
->name
) && is_samr_lsa_pipe(pipe_name
))) {
55 if (!plist
->pipe_handles
) {
57 if (asprintf(&msg
, "init_pipe_handles: NULL "
58 "pipe_handle pointer in pipe %s",
62 smb_panic("init_pipe_handle_list");
65 hl
= plist
->pipe_handles
;
72 * No handle list for this pipe (first open of pipe).
76 if ((hl
= SMB_MALLOC_P(struct handle_list
)) == NULL
)
80 DEBUG(10,("init_pipe_handles: created handle list for pipe %s\n", pipe_name
));
84 * One more pipe is using this list.
90 * Point this pipe at this list.
95 DEBUG(10,("init_pipe_handles: pipe_handles ref count = %lu for pipe %s\n",
96 (unsigned long)p
->pipe_handles
->pipe_ref_count
, pipe_name
));
101 /****************************************************************************
102 find first available policy slot. creates a policy handle for you.
103 ****************************************************************************/
105 bool create_policy_hnd(pipes_struct
*p
, POLICY_HND
*hnd
, void (*free_fn
)(void *), void *data_ptr
)
107 static uint32 pol_hnd_low
= 0;
108 static uint32 pol_hnd_high
= 0;
109 time_t t
= time(NULL
);
113 if (p
->pipe_handles
->count
> MAX_OPEN_POLS
) {
114 DEBUG(0,("create_policy_hnd: ERROR: too many handles (%d) on this pipe.\n",
115 (int)p
->pipe_handles
->count
));
119 pol
= SMB_MALLOC_P(struct policy
);
121 DEBUG(0,("create_policy_hnd: ERROR: out of memory!\n"));
127 pol
->data_ptr
= data_ptr
;
128 pol
->free_fn
= free_fn
;
131 if (pol_hnd_low
== 0)
134 SIVAL(&pol
->pol_hnd
.handle_type
, 0 , 0); /* first bit must be null */
135 SIVAL(&pol
->pol_hnd
.uuid
.time_low
, 0 , pol_hnd_low
); /* second bit is incrementing */
136 SSVAL(&pol
->pol_hnd
.uuid
.time_mid
, 0 , pol_hnd_high
); /* second bit is incrementing */
137 SSVAL(&pol
->pol_hnd
.uuid
.time_hi_and_version
, 0 , (pol_hnd_high
>>16)); /* second bit is incrementing */
139 /* split the current time into two 16 bit values */
141 SSVAL(pol
->pol_hnd
.uuid
.clock_seq
, 0, (t
>>16)); /* something random */
142 SSVAL(pol
->pol_hnd
.uuid
.node
, 0, t
); /* something random */
144 SIVAL(pol
->pol_hnd
.uuid
.node
, 2, sys_getpid()); /* something more random */
146 DLIST_ADD(p
->pipe_handles
->Policy
, pol
);
147 p
->pipe_handles
->count
++;
151 DEBUG(4,("Opened policy hnd[%d] ", (int)p
->pipe_handles
->count
));
152 dump_data(4, (uint8
*)hnd
, sizeof(*hnd
));
157 /****************************************************************************
158 find policy by handle - internal version.
159 ****************************************************************************/
161 static struct policy
*find_policy_by_hnd_internal(pipes_struct
*p
, POLICY_HND
*hnd
, void **data_p
)
169 for (i
= 0, pol
=p
->pipe_handles
->Policy
;pol
;pol
=pol
->next
, i
++) {
170 if (memcmp(&pol
->pol_hnd
, hnd
, sizeof(*hnd
)) == 0) {
171 DEBUG(4,("Found policy hnd[%d] ", (int)i
));
172 dump_data(4, (uint8
*)hnd
, sizeof(*hnd
));
174 *data_p
= pol
->data_ptr
;
179 DEBUG(4,("Policy not found: "));
180 dump_data(4, (uint8
*)hnd
, sizeof(*hnd
));
182 p
->bad_handle_fault_state
= True
;
187 /****************************************************************************
188 find policy by handle
189 ****************************************************************************/
191 bool find_policy_by_hnd(pipes_struct
*p
, POLICY_HND
*hnd
, void **data_p
)
193 return find_policy_by_hnd_internal(p
, hnd
, data_p
) == NULL
? False
: True
;
196 /****************************************************************************
198 ****************************************************************************/
200 bool close_policy_hnd(pipes_struct
*p
, POLICY_HND
*hnd
)
202 struct policy
*pol
= find_policy_by_hnd_internal(p
, hnd
, NULL
);
205 DEBUG(3,("Error closing policy\n"));
209 DEBUG(3,("Closed policy\n"));
211 if (pol
->free_fn
&& pol
->data_ptr
)
212 (*pol
->free_fn
)(pol
->data_ptr
);
214 p
->pipe_handles
->count
--;
216 DLIST_REMOVE(p
->pipe_handles
->Policy
, pol
);
225 /****************************************************************************
226 Close a pipe - free the handle list if it was the last pipe reference.
227 ****************************************************************************/
229 void close_policy_by_pipe(pipes_struct
*p
)
231 p
->pipe_handles
->pipe_ref_count
--;
233 if (p
->pipe_handles
->pipe_ref_count
== 0) {
235 * Last pipe open on this list - free the list.
237 while (p
->pipe_handles
->Policy
)
238 close_policy_hnd(p
, &p
->pipe_handles
->Policy
->pol_hnd
);
240 p
->pipe_handles
->Policy
= NULL
;
241 p
->pipe_handles
->count
= 0;
243 SAFE_FREE(p
->pipe_handles
);
244 DEBUG(10,("close_policy_by_pipe: deleted handle list for pipe %s\n", p
->name
));
248 /*******************************************************************
249 Shall we allow access to this rpc? Currently this function
250 implements the 'restrict anonymous' setting by denying access to
251 anonymous users if the restrict anonymous level is > 0. Further work
252 will be checking a security descriptor to determine whether a user
253 token has enough access to access the pipe.
254 ********************************************************************/
256 bool pipe_access_check(pipes_struct
*p
)
258 /* Don't let anonymous users access this RPC if restrict
261 if (lp_restrict_anonymous() > 0) {
263 /* schannel, so we must be ok */
264 if (p
->pipe_bound
&& (p
->auth
.auth_type
== PIPE_AUTH_TYPE_SCHANNEL
)) {
268 if (p
->server_info
->guest
) {