2 Unix SMB/CIFS implementation.
3 Samba utility functions
5 Copyright (C) Stefan (metze) Metzmacher 2002-2004
6 Copyright (C) Andrew Tridgell 1992-2004
7 Copyright (C) Jeremy Allison 1999
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.
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.
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/>.
24 #include "librpc/gen_ndr/security.h"
26 /*****************************************************************
27 Compare the auth portion of two sids.
28 *****************************************************************/
30 static int dom_sid_compare_auth(const struct dom_sid *sid1, const struct dom_sid *sid2)
41 if (sid1->sid_rev_num != sid2->sid_rev_num)
42 return sid1->sid_rev_num - sid2->sid_rev_num;
44 for (i = 0; i < 6; i++)
45 if (sid1->id_auth[i] != sid2->id_auth[i])
46 return sid1->id_auth[i] - sid2->id_auth[i];
51 /*****************************************************************
53 *****************************************************************/
55 static int dom_sid_compare(const struct dom_sid *sid1, const struct dom_sid *sid2)
66 /* Compare most likely different rids, first: i.e start at end */
67 if (sid1->num_auths != sid2->num_auths)
68 return sid1->num_auths - sid2->num_auths;
70 for (i = sid1->num_auths-1; i >= 0; --i)
71 if (sid1->sub_auths[i] != sid2->sub_auths[i])
72 return sid1->sub_auths[i] - sid2->sub_auths[i];
74 return dom_sid_compare_auth(sid1, sid2);
77 /*****************************************************************
79 *****************************************************************/
81 BOOL dom_sid_equal(const struct dom_sid *sid1, const struct dom_sid *sid2)
83 return dom_sid_compare(sid1, sid2) == 0;
88 convert a string to a dom_sid, returning a talloc'd dom_sid
90 struct dom_sid *dom_sid_parse_talloc(TALLOC_CTX *mem_ctx, const char *sidstr)
93 uint_t rev, ia, num_sub_auths, i;
96 if (strncasecmp(sidstr, "S-", 2)) {
102 rev = strtol(sidstr, &p, 10);
108 ia = strtol(sidstr, &p, 10);
115 for (i=0;sidstr[i];i++) {
116 if (sidstr[i] == '-') num_sub_auths++;
119 ret = talloc(mem_ctx, struct dom_sid);
124 ret->sub_auths = talloc_array(ret, uint32_t, num_sub_auths);
125 if (!ret->sub_auths) {
129 ret->sid_rev_num = rev;
132 ret->id_auth[2] = ia >> 24;
133 ret->id_auth[3] = ia >> 16;
134 ret->id_auth[4] = ia >> 8;
135 ret->id_auth[5] = ia;
136 ret->num_auths = num_sub_auths;
138 for (i=0;i<num_sub_auths;i++) {
139 if (sidstr[0] != '-') {
143 ret->sub_auths[i] = strtoul(sidstr, &p, 10);
154 copy a dom_sid structure
156 struct dom_sid *dom_sid_dup(TALLOC_CTX *mem_ctx, const struct dom_sid *dom_sid)
165 ret = talloc(mem_ctx, struct dom_sid);
170 ret->sub_auths = talloc_array(ret, uint32_t, dom_sid->num_auths);
171 if (!ret->sub_auths) {
175 ret->sid_rev_num = dom_sid->sid_rev_num;
176 ret->id_auth[0] = dom_sid->id_auth[0];
177 ret->id_auth[1] = dom_sid->id_auth[1];
178 ret->id_auth[2] = dom_sid->id_auth[2];
179 ret->id_auth[3] = dom_sid->id_auth[3];
180 ret->id_auth[4] = dom_sid->id_auth[4];
181 ret->id_auth[5] = dom_sid->id_auth[5];
182 ret->num_auths = dom_sid->num_auths;
184 for (i=0;i<dom_sid->num_auths;i++) {
185 ret->sub_auths[i] = dom_sid->sub_auths[i];
192 add a rid to a domain dom_sid to make a full dom_sid. This function
193 returns a new sid in the suppplied memory context
195 struct dom_sid *dom_sid_add_rid(TALLOC_CTX *mem_ctx,
196 const struct dom_sid *domain_sid,
201 sid = talloc(mem_ctx, struct dom_sid);
202 if (!sid) return NULL;
206 sid->sub_auths = talloc_array(sid, uint32_t, sid->num_auths+1);
207 if (!sid->sub_auths) {
210 memcpy(sid->sub_auths, domain_sid->sub_auths, sid->num_auths*sizeof(uint32_t));
211 sid->sub_auths[sid->num_auths] = rid;
218 Split up a SID into its domain and RID part
220 NTSTATUS dom_sid_split_rid(TALLOC_CTX *mem_ctx, const struct dom_sid *sid,
221 struct dom_sid **domain, uint32_t *rid)
223 if (sid->num_auths == 0) {
224 return NT_STATUS_INVALID_PARAMETER;
228 if (!(*domain = dom_sid_dup(mem_ctx, sid))) {
229 return NT_STATUS_NO_MEMORY;
232 (*domain)->num_auths -= 1;
236 *rid = sid->sub_auths[sid->num_auths - 1];
243 return True if the 2nd sid is in the domain given by the first sid
245 BOOL dom_sid_in_domain(const struct dom_sid *domain_sid,
246 const struct dom_sid *sid)
250 if (!domain_sid || !sid) {
254 if (domain_sid->num_auths > sid->num_auths) {
258 for (i = domain_sid->num_auths-1; i >= 0; --i) {
259 if (domain_sid->sub_auths[i] != sid->sub_auths[i]) {
264 return dom_sid_compare_auth(domain_sid, sid) == 0;
268 convert a dom_sid to a string
270 char *dom_sid_string(TALLOC_CTX *mem_ctx, const struct dom_sid *sid)
277 return talloc_strdup(mem_ctx, "(NULL SID)");
280 maxlen = sid->num_auths * 11 + 25;
281 ret = talloc_size(mem_ctx, maxlen);
282 if (!ret) return talloc_strdup(mem_ctx, "(SID ERR)");
284 ia = (sid->id_auth[5]) +
285 (sid->id_auth[4] << 8 ) +
286 (sid->id_auth[3] << 16) +
287 (sid->id_auth[2] << 24);
289 ofs = snprintf(ret, maxlen, "S-%u-%lu",
290 (unsigned int)sid->sid_rev_num, (unsigned long)ia);
292 for (i = 0; i < sid->num_auths; i++) {
293 ofs += snprintf(ret + ofs, maxlen - ofs, "-%lu", (unsigned long)sid->sub_auths[i]);