Attempt to fix the build on IRIX
[Samba.git] / source3 / rpc_server / srv_lsa_hnd.c
blob377ed505b4e2448380c6027cdffb5ffc12342b40
1 /*
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.
7 *
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/>.
22 #include "includes.h"
24 #undef DBGC_CLASS
25 #define DBGC_CLASS DBGC_RPC_SRV
27 /* This is the max handles across all instances of a pipe name. */
28 #ifndef MAX_OPEN_POLS
29 #define MAX_OPEN_POLS 1024
30 #endif
32 /****************************************************************************
33 Hack as handles need to be persisant over lsa pipe closes so long as a samr
34 pipe is open. JRA.
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) {
56 char *msg;
57 asprintf(&msg, "init_pipe_handles: NULL "
58 "pipe_handle pointer in pipe %s",
59 pipe_name);
60 smb_panic(msg);
62 hl = plist->pipe_handles;
63 break;
67 if (!hl) {
69 * No handle list for this pipe (first open of pipe).
70 * Create list.
73 if ((hl = SMB_MALLOC_P(struct handle_list)) == NULL)
74 return False;
75 ZERO_STRUCTP(hl);
77 DEBUG(10,("init_pipe_handles: created handle list for pipe %s\n", pipe_name ));
81 * One more pipe is using this list.
84 hl->pipe_ref_count++;
87 * Point this pipe at this list.
90 p->pipe_handles = hl;
92 DEBUG(10,("init_pipe_handles: pipe_handles ref count = %lu for pipe %s\n",
93 (unsigned long)p->pipe_handles->pipe_ref_count, pipe_name ));
95 return True;
98 /****************************************************************************
99 find first available policy slot. creates a policy handle for you.
100 ****************************************************************************/
102 bool create_policy_hnd(pipes_struct *p, POLICY_HND *hnd, void (*free_fn)(void *), void *data_ptr)
104 static uint32 pol_hnd_low = 0;
105 static uint32 pol_hnd_high = 0;
106 time_t t = time(NULL);
108 struct policy *pol;
110 if (p->pipe_handles->count > MAX_OPEN_POLS) {
111 DEBUG(0,("create_policy_hnd: ERROR: too many handles (%d) on this pipe.\n",
112 (int)p->pipe_handles->count));
113 return False;
116 pol = SMB_MALLOC_P(struct policy);
117 if (!pol) {
118 DEBUG(0,("create_policy_hnd: ERROR: out of memory!\n"));
119 return False;
122 ZERO_STRUCTP(pol);
124 pol->data_ptr = data_ptr;
125 pol->free_fn = free_fn;
127 pol_hnd_low++;
128 if (pol_hnd_low == 0)
129 (pol_hnd_high)++;
131 SIVAL(&pol->pol_hnd.handle_type, 0 , 0); /* first bit must be null */
132 SIVAL(&pol->pol_hnd.uuid.time_low, 0 , pol_hnd_low ); /* second bit is incrementing */
133 SSVAL(&pol->pol_hnd.uuid.time_mid, 0 , pol_hnd_high); /* second bit is incrementing */
134 SSVAL(&pol->pol_hnd.uuid.time_hi_and_version, 0 , (pol_hnd_high>>16)); /* second bit is incrementing */
136 /* split the current time into two 16 bit values */
138 SSVAL(pol->pol_hnd.uuid.clock_seq, 0, (t>>16)); /* something random */
139 SSVAL(pol->pol_hnd.uuid.node, 0, t); /* something random */
141 SIVAL(pol->pol_hnd.uuid.node, 2, sys_getpid()); /* something more random */
143 DLIST_ADD(p->pipe_handles->Policy, pol);
144 p->pipe_handles->count++;
146 *hnd = pol->pol_hnd;
148 DEBUG(4,("Opened policy hnd[%d] ", (int)p->pipe_handles->count));
149 dump_data(4, (uint8 *)hnd, sizeof(*hnd));
151 return True;
154 /****************************************************************************
155 find policy by handle - internal version.
156 ****************************************************************************/
158 static struct policy *find_policy_by_hnd_internal(pipes_struct *p, POLICY_HND *hnd, void **data_p)
160 struct policy *pol;
161 size_t i;
163 if (data_p)
164 *data_p = NULL;
166 for (i = 0, pol=p->pipe_handles->Policy;pol;pol=pol->next, i++) {
167 if (memcmp(&pol->pol_hnd, hnd, sizeof(*hnd)) == 0) {
168 DEBUG(4,("Found policy hnd[%d] ", (int)i));
169 dump_data(4, (uint8 *)hnd, sizeof(*hnd));
170 if (data_p)
171 *data_p = pol->data_ptr;
172 return pol;
176 DEBUG(4,("Policy not found: "));
177 dump_data(4, (uint8 *)hnd, sizeof(*hnd));
179 p->bad_handle_fault_state = True;
181 return NULL;
184 /****************************************************************************
185 find policy by handle
186 ****************************************************************************/
188 bool find_policy_by_hnd(pipes_struct *p, POLICY_HND *hnd, void **data_p)
190 return find_policy_by_hnd_internal(p, hnd, data_p) == NULL ? False : True;
193 /****************************************************************************
194 Close a policy.
195 ****************************************************************************/
197 bool close_policy_hnd(pipes_struct *p, POLICY_HND *hnd)
199 struct policy *pol = find_policy_by_hnd_internal(p, hnd, NULL);
201 if (!pol) {
202 DEBUG(3,("Error closing policy\n"));
203 return False;
206 DEBUG(3,("Closed policy\n"));
208 if (pol->free_fn && pol->data_ptr)
209 (*pol->free_fn)(pol->data_ptr);
211 p->pipe_handles->count--;
213 DLIST_REMOVE(p->pipe_handles->Policy, pol);
215 ZERO_STRUCTP(pol);
217 SAFE_FREE(pol);
219 return True;
222 /****************************************************************************
223 Close a pipe - free the handle list if it was the last pipe reference.
224 ****************************************************************************/
226 void close_policy_by_pipe(pipes_struct *p)
228 p->pipe_handles->pipe_ref_count--;
230 if (p->pipe_handles->pipe_ref_count == 0) {
232 * Last pipe open on this list - free the list.
234 while (p->pipe_handles->Policy)
235 close_policy_hnd(p, &p->pipe_handles->Policy->pol_hnd);
237 p->pipe_handles->Policy = NULL;
238 p->pipe_handles->count = 0;
240 SAFE_FREE(p->pipe_handles);
241 DEBUG(10,("close_policy_by_pipe: deleted handle list for pipe %s\n", p->name ));
245 /*******************************************************************
246 Shall we allow access to this rpc? Currently this function
247 implements the 'restrict anonymous' setting by denying access to
248 anonymous users if the restrict anonymous level is > 0. Further work
249 will be checking a security descriptor to determine whether a user
250 token has enough access to access the pipe.
251 ********************************************************************/
253 bool pipe_access_check(pipes_struct *p)
255 /* Don't let anonymous users access this RPC if restrict
256 anonymous > 0 */
258 if (lp_restrict_anonymous() > 0) {
260 /* schannel, so we must be ok */
261 if (p->pipe_bound && (p->auth.auth_type == PIPE_AUTH_TYPE_SCHANNEL)) {
262 return True;
265 if (p->server_info->guest) {
266 return False;
270 return True;