2 Unix SMB/CIFS implementation.
4 UUID/GUID/policy_handle functions
6 Copyright (C) Theodore Ts'o 1996, 1997,
7 Copyright (C) Jim McDonough 2002.
8 Copyright (C) Andrew Tridgell 2003.
9 Copyright (C) Stefan (metze) Metzmacher 2004.
11 This program is free software; you can redistribute it and/or modify
12 it under the terms of the GNU General Public License as published by
13 the Free Software Foundation; either version 2 of the License, or
14 (at your option) any later version.
16 This program is distributed in the hope that it will be useful,
17 but WITHOUT ANY WARRANTY; without even the implied warranty of
18 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
19 GNU General Public License for more details.
21 You should have received a copy of the GNU General Public License
22 along with this program; if not, write to the Free Software
23 Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
27 #include "system/network.h"
29 void ndr_print_ipv4_addr(struct ndr_print *ndr, const char *name, const struct ipv4_addr *_ip)
33 ip.addr = htonl(_ip->addr);
35 ndr->print(ndr, "%-25s: %s", name, sys_inet_ntoa(ip));
39 build a GUID from a string
41 NTSTATUS GUID_from_string(const char *s, struct GUID *guid)
43 NTSTATUS status = NT_STATUS_INVALID_PARAMETER;
45 uint32_t time_mid, time_hi_and_version;
46 uint32_t clock_seq[2];
51 return NT_STATUS_INVALID_PARAMETER;
54 if (11 == sscanf(s, "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
55 &time_low, &time_mid, &time_hi_and_version,
56 &clock_seq[0], &clock_seq[1],
57 &node[0], &node[1], &node[2], &node[3], &node[4], &node[5])) {
58 status = NT_STATUS_OK;
59 } else if (11 == sscanf(s, "{%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x}",
60 &time_low, &time_mid, &time_hi_and_version,
61 &clock_seq[0], &clock_seq[1],
62 &node[0], &node[1], &node[2], &node[3], &node[4], &node[5])) {
63 status = NT_STATUS_OK;
66 if (!NT_STATUS_IS_OK(status)) {
70 guid->time_low = time_low;
71 guid->time_mid = time_mid;
72 guid->time_hi_and_version = time_hi_and_version;
73 guid->clock_seq[0] = clock_seq[0];
74 guid->clock_seq[1] = clock_seq[1];
76 guid->node[i] = node[i];
82 /* generate a random GUID */
83 struct GUID GUID_random(void)
87 generate_random_buffer((uint8_t *)&guid, sizeof(guid));
88 guid.clock_seq[0] = (guid.clock_seq[0] & 0x3F) | 0x80;
89 guid.time_hi_and_version = (guid.time_hi_and_version & 0x0FFF) | 0x4000;
94 /* generate a random GUID */
95 struct GUID GUID_zero(void)
104 BOOL GUID_all_zero(const struct GUID *u)
106 if (u->time_low != 0 ||
108 u->time_hi_and_version != 0 ||
109 u->clock_seq[0] != 0 ||
110 u->clock_seq[1] != 0 ||
111 !all_zero(u->node, 6)) {
117 BOOL GUID_equal(const struct GUID *u1, const struct GUID *u2)
119 if (u1->time_low != u2->time_low ||
120 u1->time_mid != u2->time_mid ||
121 u1->time_hi_and_version != u2->time_hi_and_version ||
122 u1->clock_seq[0] != u2->clock_seq[0] ||
123 u1->clock_seq[1] != u2->clock_seq[1] ||
124 memcmp(u1->node, u2->node, 6) != 0) {
131 its useful to be able to display these in debugging messages
133 char *GUID_string(TALLOC_CTX *mem_ctx, const struct GUID *guid)
135 return talloc_asprintf(mem_ctx,
136 "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
137 guid->time_low, guid->time_mid,
138 guid->time_hi_and_version,
141 guid->node[0], guid->node[1],
142 guid->node[2], guid->node[3],
143 guid->node[4], guid->node[5]);
146 char *GUID_string2(TALLOC_CTX *mem_ctx, const struct GUID *guid)
148 return talloc_asprintf(mem_ctx,
149 "{%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x}",
150 guid->time_low, guid->time_mid,
151 guid->time_hi_and_version,
154 guid->node[0], guid->node[1],
155 guid->node[2], guid->node[3],
156 guid->node[4], guid->node[5]);
159 void ndr_print_GUID(struct ndr_print *ndr, const char *name, const struct GUID *guid)
161 ndr->print(ndr, "%-25s: %s", name, GUID_string(ndr, guid));
164 BOOL policy_handle_empty(struct policy_handle *h)
166 return (h->handle_type == 0 && GUID_all_zero(&h->uuid));