source: vendor/current/libcli/security/dom_sid.c@ 581

Last change on this file since 581 was 581, checked in by Herwig Bauernfeind, 14 years ago

Samba 3.5: Update vendor to version 3.5.5
File size: 7.1 KB
Line 
1/*
2 Unix SMB/CIFS implementation.
3 Samba utility functions
4
5 Copyright (C) Stefan (metze) Metzmacher 2002-2004
6 Copyright (C) Andrew Tridgell 1992-2004
7 Copyright (C) Jeremy Allison 1999
8
9 This program is free software; you can redistribute it and/or modify
10 it under the terms of the GNU General Public License as published by
11 the Free Software Foundation; either version 3 of the License, or
12 (at your option) any later version.
13
14 This program is distributed in the hope that it will be useful,
15 but WITHOUT ANY WARRANTY; without even the implied warranty of
16 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
17 GNU General Public License for more details.
18
19 You should have received a copy of the GNU General Public License
20 along with this program. If not, see <http://www.gnu.org/licenses/>.
21*/
22
23#include "includes.h"
24#include "librpc/gen_ndr/security.h"
25#include "dom_sid.h"
26
27/*****************************************************************
28 Compare the auth portion of two sids.
29*****************************************************************/
30
31static int dom_sid_compare_auth(const struct dom_sid *sid1,
32 const struct dom_sid *sid2)
33{
34 int i;
35
36 if (sid1 == sid2)
37 return 0;
38 if (!sid1)
39 return -1;
40 if (!sid2)
41 return 1;
42
43 if (sid1->sid_rev_num != sid2->sid_rev_num)
44 return sid1->sid_rev_num - sid2->sid_rev_num;
45
46 for (i = 0; i < 6; i++)
47 if (sid1->id_auth[i] != sid2->id_auth[i])
48 return sid1->id_auth[i] - sid2->id_auth[i];
49
50 return 0;
51}
52
53/*****************************************************************
54 Compare two sids.
55*****************************************************************/
56
57int dom_sid_compare(const struct dom_sid *sid1, const struct dom_sid *sid2)
58{
59 int i;
60
61 if (sid1 == sid2)
62 return 0;
63 if (!sid1)
64 return -1;
65 if (!sid2)
66 return 1;
67
68 /* Compare most likely different rids, first: i.e start at end */
69 if (sid1->num_auths != sid2->num_auths)
70 return sid1->num_auths - sid2->num_auths;
71
72 for (i = sid1->num_auths-1; i >= 0; --i)
73 if (sid1->sub_auths[i] != sid2->sub_auths[i])
74 return sid1->sub_auths[i] - sid2->sub_auths[i];
75
76 return dom_sid_compare_auth(sid1, sid2);
77}
78
79/*****************************************************************
80 Compare two sids.
81*****************************************************************/
82
83bool dom_sid_equal(const struct dom_sid *sid1, const struct dom_sid *sid2)
84{
85 return dom_sid_compare(sid1, sid2) == 0;
86}
87
88/* Yes, I did think about multibyte issues here, and for all I can see there's
89 * none of those for parsing a SID. */
90#undef strncasecmp
91
92bool dom_sid_parse(const char *sidstr, struct dom_sid *ret)
93{
94 uint_t rev, ia, num_sub_auths, i;
95 char *p;
96
97 if (strncasecmp(sidstr, "S-", 2)) {
98 return false;
99 }
100
101 sidstr += 2;
102
103 rev = strtol(sidstr, &p, 10);
104 if (*p != '-') {
105 return false;
106 }
107 sidstr = p+1;
108
109 ia = strtol(sidstr, &p, 10);
110 if (p == sidstr) {
111 return false;
112 }
113 sidstr = p;
114
115 num_sub_auths = 0;
116 for (i=0;sidstr[i];i++) {
117 if (sidstr[i] == '-') num_sub_auths++;
118 }
119
120 if (num_sub_auths > MAXSUBAUTHS) {
121 return false;
122 }
123
124 ret->sid_rev_num = rev;
125 ret->id_auth[0] = 0;
126 ret->id_auth[1] = 0;
127 ret->id_auth[2] = ia >> 24;
128 ret->id_auth[3] = ia >> 16;
129 ret->id_auth[4] = ia >> 8;
130 ret->id_auth[5] = ia;
131 ret->num_auths = num_sub_auths;
132
133 for (i=0;i<num_sub_auths;i++) {
134 if (sidstr[0] != '-') {
135 return false;
136 }
137 sidstr++;
138 ret->sub_auths[i] = strtoul(sidstr, &p, 10);
139 if (p == sidstr) {
140 return false;
141 }
142 sidstr = p;
143 }
144
145 return true;
146}
147
148/*
149 convert a string to a dom_sid, returning a talloc'd dom_sid
150*/
151struct dom_sid *dom_sid_parse_talloc(TALLOC_CTX *mem_ctx, const char *sidstr)
152{
153 struct dom_sid *ret;
154 ret = talloc(mem_ctx, struct dom_sid);
155 if (!ret) {
156 return NULL;
157 }
158 if (!dom_sid_parse(sidstr, ret)) {
159 talloc_free(ret);
160 return NULL;
161 }
162
163 return ret;
164}
165
166/*
167 convert a string to a dom_sid, returning a talloc'd dom_sid
168*/
169struct dom_sid *dom_sid_parse_length(TALLOC_CTX *mem_ctx, const DATA_BLOB *sid)
170{
171 struct dom_sid *ret;
172 char *p = talloc_strndup(mem_ctx, (char *)sid->data, sid->length);
173 if (!p) {
174 return NULL;
175 }
176 ret = dom_sid_parse_talloc(mem_ctx, p);
177 talloc_free(p);
178 return ret;
179}
180
181/*
182 copy a dom_sid structure
183*/
184struct dom_sid *dom_sid_dup(TALLOC_CTX *mem_ctx, const struct dom_sid *dom_sid)
185{
186 struct dom_sid *ret;
187 int i;
188
189 if (!dom_sid) {
190 return NULL;
191 }
192
193 ret = talloc(mem_ctx, struct dom_sid);
194 if (!ret) {
195 return NULL;
196 }
197
198 ret->sid_rev_num = dom_sid->sid_rev_num;
199 ret->id_auth[0] = dom_sid->id_auth[0];
200 ret->id_auth[1] = dom_sid->id_auth[1];
201 ret->id_auth[2] = dom_sid->id_auth[2];
202 ret->id_auth[3] = dom_sid->id_auth[3];
203 ret->id_auth[4] = dom_sid->id_auth[4];
204 ret->id_auth[5] = dom_sid->id_auth[5];
205 ret->num_auths = dom_sid->num_auths;
206
207 for (i=0;i<dom_sid->num_auths;i++) {
208 ret->sub_auths[i] = dom_sid->sub_auths[i];
209 }
210
211 return ret;
212}
213
214/*
215 add a rid to a domain dom_sid to make a full dom_sid. This function
216 returns a new sid in the supplied memory context
217*/
218struct dom_sid *dom_sid_add_rid(TALLOC_CTX *mem_ctx,
219 const struct dom_sid *domain_sid,
220 uint32_t rid)
221{
222 struct dom_sid *sid;
223
224 sid = talloc(mem_ctx, struct dom_sid);
225 if (!sid) return NULL;
226
227 *sid = *domain_sid;
228
229 sid->sub_auths[sid->num_auths] = rid;
230 sid->num_auths++;
231
232 return sid;
233}
234
235/*
236 Split up a SID into its domain and RID part
237*/
238NTSTATUS dom_sid_split_rid(TALLOC_CTX *mem_ctx, const struct dom_sid *sid,
239 struct dom_sid **domain, uint32_t *rid)
240{
241 if (sid->num_auths == 0) {
242 return NT_STATUS_INVALID_PARAMETER;
243 }
244
245 if (domain) {
246 if (!(*domain = dom_sid_dup(mem_ctx, sid))) {
247 return NT_STATUS_NO_MEMORY;
248 }
249
250 (*domain)->num_auths -= 1;
251 }
252
253 if (rid) {
254 *rid = sid->sub_auths[sid->num_auths - 1];
255 }
256
257 return NT_STATUS_OK;
258}
259
260/*
261 return true if the 2nd sid is in the domain given by the first sid
262*/
263bool dom_sid_in_domain(const struct dom_sid *domain_sid,
264 const struct dom_sid *sid)
265{
266 int i;
267
268 if (!domain_sid || !sid) {
269 return false;
270 }
271
272 if (domain_sid->num_auths > sid->num_auths) {
273 return false;
274 }
275
276 for (i = domain_sid->num_auths-1; i >= 0; --i) {
277 if (domain_sid->sub_auths[i] != sid->sub_auths[i]) {
278 return false;
279 }
280 }
281
282 return dom_sid_compare_auth(domain_sid, sid) == 0;
283}
284
285/*
286 convert a dom_sid to a string
287*/
288char *dom_sid_string(TALLOC_CTX *mem_ctx, const struct dom_sid *sid)
289{
290 int i, ofs, maxlen;
291 uint32_t ia;
292 char *ret;
293
294 if (!sid) {
295 return talloc_strdup(mem_ctx, "(NULL SID)");
296 }
297
298 maxlen = sid->num_auths * 11 + 25;
299 ret = talloc_array(mem_ctx, char, maxlen);
300 if (!ret) return talloc_strdup(mem_ctx, "(SID ERR)");
301
302 ia = (sid->id_auth[5]) +
303 (sid->id_auth[4] << 8 ) +
304 (sid->id_auth[3] << 16) +
305 (sid->id_auth[2] << 24);
306
307 ofs = snprintf(ret, maxlen, "S-%u-%lu",
308 (unsigned int)sid->sid_rev_num, (unsigned long)ia);
309
310 for (i = 0; i < sid->num_auths; i++) {
311 ofs += snprintf(ret + ofs, maxlen - ofs, "-%lu",
312 (unsigned long)sid->sub_auths[i]);
313 }
314
315 return ret;
316}
Note: See TracBrowser for help on using the repository browser.