2 Unix SMB/CIFS implementation.
6 Copyright (C) Theodore Ts'o 1996, 1997,
7 Copyright (C) Jim McDonough 2002.
8 Copyright (C) Andrew Tridgell 2003.
10 This program is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 3 of the License, or
13 (at your option) any later version.
15 This program is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
20 You should have received a copy of the GNU General Public License
21 along with this program. If not, see <http://www.gnu.org/licenses/>.
25 #include "librpc/ndr/libndr.h"
26 #include "librpc/gen_ndr/ndr_misc.h"
29 build a GUID from a string
31 _PUBLIC_ NTSTATUS GUID_from_data_blob(const DATA_BLOB *s, struct GUID *guid)
33 NTSTATUS status = NT_STATUS_INVALID_PARAMETER;
35 uint32_t time_mid, time_hi_and_version;
36 uint32_t clock_seq[2];
40 DATA_BLOB blob16 = data_blob_const(buf16, sizeof(buf16));
43 if (s->data == NULL) {
44 return NT_STATUS_INVALID_PARAMETER;
47 if (s->length == 36) {
51 mem_ctx = talloc_new(NULL);
52 NT_STATUS_HAVE_NO_MEMORY(mem_ctx);
53 string = talloc_strndup(mem_ctx, (const char *)s->data, s->length);
54 NT_STATUS_HAVE_NO_MEMORY(string);
55 if (11 == sscanf(string,
56 "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
57 &time_low, &time_mid, &time_hi_and_version,
58 &clock_seq[0], &clock_seq[1],
59 &node[0], &node[1], &node[2], &node[3], &node[4], &node[5])) {
60 status = NT_STATUS_OK;
64 } else if (s->length == 38) {
68 mem_ctx = talloc_new(NULL);
69 NT_STATUS_HAVE_NO_MEMORY(mem_ctx);
70 string = talloc_strndup(mem_ctx, (const char *)s->data, s->length);
71 NT_STATUS_HAVE_NO_MEMORY(string);
72 if (11 == sscanf((const char *)s->data,
73 "{%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x}",
74 &time_low, &time_mid, &time_hi_and_version,
75 &clock_seq[0], &clock_seq[1],
76 &node[0], &node[1], &node[2], &node[3], &node[4], &node[5])) {
77 status = NT_STATUS_OK;
81 } else if (s->length == 32) {
82 size_t rlen = strhex_to_str((char *)blob16.data, blob16.length,
83 (const char *)s->data, s->length);
84 if (rlen == blob16.length) {
85 /* goto the ndr_pull_struct_blob() path */
86 status = NT_STATUS_OK;
91 if (s->length == 16) {
92 enum ndr_err_code ndr_err;
96 mem_ctx = talloc_new(NULL);
97 NT_STATUS_HAVE_NO_MEMORY(mem_ctx);
99 ndr_err = ndr_pull_struct_blob(s, mem_ctx, NULL, &guid2,
100 (ndr_pull_flags_fn_t)ndr_pull_GUID);
101 talloc_free(mem_ctx);
102 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
103 return ndr_map_error2ntstatus(ndr_err);
109 if (!NT_STATUS_IS_OK(status)) {
113 guid->time_low = time_low;
114 guid->time_mid = time_mid;
115 guid->time_hi_and_version = time_hi_and_version;
116 guid->clock_seq[0] = clock_seq[0];
117 guid->clock_seq[1] = clock_seq[1];
119 guid->node[i] = node[i];
126 build a GUID from a string
128 _PUBLIC_ NTSTATUS GUID_from_string(const char *s, struct GUID *guid)
130 DATA_BLOB blob = data_blob_string_const(s);
131 return GUID_from_data_blob(&blob, guid);
136 build a GUID from a string
138 _PUBLIC_ NTSTATUS NS_GUID_from_string(const char *s, struct GUID *guid)
140 NTSTATUS status = NT_STATUS_INVALID_PARAMETER;
142 uint32_t time_mid, time_hi_and_version;
143 uint32_t clock_seq[2];
148 return NT_STATUS_INVALID_PARAMETER;
151 if (11 == sscanf(s, "%08x-%04x%04x-%02x%02x%02x%02x-%02x%02x%02x%02x",
152 &time_low, &time_mid, &time_hi_and_version,
153 &clock_seq[0], &clock_seq[1],
154 &node[0], &node[1], &node[2], &node[3], &node[4], &node[5])) {
155 status = NT_STATUS_OK;
158 if (!NT_STATUS_IS_OK(status)) {
162 guid->time_low = time_low;
163 guid->time_mid = time_mid;
164 guid->time_hi_and_version = time_hi_and_version;
165 guid->clock_seq[0] = clock_seq[0];
166 guid->clock_seq[1] = clock_seq[1];
168 guid->node[i] = node[i];
175 * generate a random GUID
177 _PUBLIC_ struct GUID GUID_random(void)
181 generate_random_buffer((uint8_t *)&guid, sizeof(guid));
182 guid.clock_seq[0] = (guid.clock_seq[0] & 0x3F) | 0x80;
183 guid.time_hi_and_version = (guid.time_hi_and_version & 0x0FFF) | 0x4000;
189 * generate an empty GUID
191 _PUBLIC_ struct GUID GUID_zero(void)
200 _PUBLIC_ bool GUID_all_zero(const struct GUID *u)
202 if (u->time_low != 0 ||
204 u->time_hi_and_version != 0 ||
205 u->clock_seq[0] != 0 ||
206 u->clock_seq[1] != 0 ||
207 !all_zero(u->node, 6)) {
213 _PUBLIC_ bool GUID_equal(const struct GUID *u1, const struct GUID *u2)
215 if (u1->time_low != u2->time_low ||
216 u1->time_mid != u2->time_mid ||
217 u1->time_hi_and_version != u2->time_hi_and_version ||
218 u1->clock_seq[0] != u2->clock_seq[0] ||
219 u1->clock_seq[1] != u2->clock_seq[1] ||
220 memcmp(u1->node, u2->node, 6) != 0) {
226 _PUBLIC_ int GUID_compare(const struct GUID *u1, const struct GUID *u2)
228 if (u1->time_low != u2->time_low) {
229 return u1->time_low - u2->time_low;
232 if (u1->time_mid != u2->time_mid) {
233 return u1->time_mid - u2->time_mid;
236 if (u1->time_hi_and_version != u2->time_hi_and_version) {
237 return u1->time_hi_and_version - u2->time_hi_and_version;
240 if (u1->clock_seq[0] != u2->clock_seq[0]) {
241 return u1->clock_seq[0] - u2->clock_seq[0];
244 if (u1->clock_seq[1] != u2->clock_seq[1]) {
245 return u1->clock_seq[1] - u2->clock_seq[1];
248 return memcmp(u1->node, u2->node, 6);
252 its useful to be able to display these in debugging messages
254 _PUBLIC_ char *GUID_string(TALLOC_CTX *mem_ctx, const struct GUID *guid)
256 return talloc_asprintf(mem_ctx,
257 "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
258 guid->time_low, guid->time_mid,
259 guid->time_hi_and_version,
262 guid->node[0], guid->node[1],
263 guid->node[2], guid->node[3],
264 guid->node[4], guid->node[5]);
267 _PUBLIC_ char *GUID_string2(TALLOC_CTX *mem_ctx, const struct GUID *guid)
269 char *ret, *s = GUID_string(mem_ctx, guid);
270 ret = talloc_asprintf(mem_ctx, "{%s}", s);
275 _PUBLIC_ char *GUID_hexstring(TALLOC_CTX *mem_ctx, const struct GUID *guid)
279 enum ndr_err_code ndr_err;
282 tmp_mem = talloc_new(mem_ctx);
286 ndr_err = ndr_push_struct_blob(&guid_blob, tmp_mem,
289 (ndr_push_flags_fn_t)ndr_push_GUID);
290 if (!NDR_ERR_CODE_IS_SUCCESS(ndr_err)) {
291 talloc_free(tmp_mem);
295 ret = data_blob_hex_string(mem_ctx, &guid_blob);
296 talloc_free(tmp_mem);
300 _PUBLIC_ char *NS_GUID_string(TALLOC_CTX *mem_ctx, const struct GUID *guid)
302 return talloc_asprintf(mem_ctx,
303 "%08x-%04x%04x-%02x%02x%02x%02x-%02x%02x%02x%02x",
304 guid->time_low, guid->time_mid,
305 guid->time_hi_and_version,
308 guid->node[0], guid->node[1],
309 guid->node[2], guid->node[3],
310 guid->node[4], guid->node[5]);
313 _PUBLIC_ bool policy_handle_empty(struct policy_handle *h)
315 return (h->handle_type == 0 && GUID_all_zero(&h->uuid));