1*86d7f5d3SJohn Marino /* $NetBSD: uuid_stream.c,v 1.3 2008/04/19 18:21:38 plunky Exp $ */
2*86d7f5d3SJohn Marino
3*86d7f5d3SJohn Marino /*-
4*86d7f5d3SJohn Marino * Copyright (c) 2002 Marcel Moolenaar
5*86d7f5d3SJohn Marino * All rights reserved.
6*86d7f5d3SJohn Marino *
7*86d7f5d3SJohn Marino * Redistribution and use in source and binary forms, with or without
8*86d7f5d3SJohn Marino * modification, are permitted provided that the following conditions
9*86d7f5d3SJohn Marino * are met:
10*86d7f5d3SJohn Marino *
11*86d7f5d3SJohn Marino * 1. Redistributions of source code must retain the above copyright
12*86d7f5d3SJohn Marino * notice, this list of conditions and the following disclaimer.
13*86d7f5d3SJohn Marino * 2. Redistributions in binary form must reproduce the above copyright
14*86d7f5d3SJohn Marino * notice, this list of conditions and the following disclaimer in the
15*86d7f5d3SJohn Marino * documentation and/or other materials provided with the distribution.
16*86d7f5d3SJohn Marino *
17*86d7f5d3SJohn Marino * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
18*86d7f5d3SJohn Marino * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
19*86d7f5d3SJohn Marino * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
20*86d7f5d3SJohn Marino * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
21*86d7f5d3SJohn Marino * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
22*86d7f5d3SJohn Marino * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
23*86d7f5d3SJohn Marino * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
24*86d7f5d3SJohn Marino * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
25*86d7f5d3SJohn Marino * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
26*86d7f5d3SJohn Marino * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
27*86d7f5d3SJohn Marino *
28*86d7f5d3SJohn Marino * $FreeBSD: src/lib/libc/uuid/uuid_stream.c,v 1.1 2008/08/14 22:23:16 emax Exp $
29*86d7f5d3SJohn Marino */
30*86d7f5d3SJohn Marino
31*86d7f5d3SJohn Marino #include <sys/endian.h>
32*86d7f5d3SJohn Marino #include <uuid.h>
33*86d7f5d3SJohn Marino
34*86d7f5d3SJohn Marino /*
35*86d7f5d3SJohn Marino * Encode/Decode UUID into octet-stream.
36*86d7f5d3SJohn Marino * http://www.opengroup.org/dce/info/draft-leach-uuids-guids-01.txt
37*86d7f5d3SJohn Marino *
38*86d7f5d3SJohn Marino * 0 1 2 3
39*86d7f5d3SJohn Marino * 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1 2 3 4 5 6 7 8 9 0 1
40*86d7f5d3SJohn Marino * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
41*86d7f5d3SJohn Marino * | time_low |
42*86d7f5d3SJohn Marino * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
43*86d7f5d3SJohn Marino * | time_mid | time_hi_and_version |
44*86d7f5d3SJohn Marino * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
45*86d7f5d3SJohn Marino * |clk_seq_hi_res | clk_seq_low | node (0-1) |
46*86d7f5d3SJohn Marino * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
47*86d7f5d3SJohn Marino * | node (2-5) |
48*86d7f5d3SJohn Marino * +-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+
49*86d7f5d3SJohn Marino *
50*86d7f5d3SJohn Marino * NOTE: These routines are not part of the DCE RPC API. They are
51*86d7f5d3SJohn Marino * provided for convenience.
52*86d7f5d3SJohn Marino */
53*86d7f5d3SJohn Marino
54*86d7f5d3SJohn Marino void
uuid_enc_le(void * buf,const uuid_t * uuid)55*86d7f5d3SJohn Marino uuid_enc_le(void *buf, const uuid_t *uuid)
56*86d7f5d3SJohn Marino {
57*86d7f5d3SJohn Marino uint8_t *p = buf;
58*86d7f5d3SJohn Marino int i;
59*86d7f5d3SJohn Marino
60*86d7f5d3SJohn Marino le32enc(p, uuid->time_low);
61*86d7f5d3SJohn Marino le16enc(p + 4, uuid->time_mid);
62*86d7f5d3SJohn Marino le16enc(p + 6, uuid->time_hi_and_version);
63*86d7f5d3SJohn Marino p[8] = uuid->clock_seq_hi_and_reserved;
64*86d7f5d3SJohn Marino p[9] = uuid->clock_seq_low;
65*86d7f5d3SJohn Marino for (i = 0; i < _UUID_NODE_LEN; i++)
66*86d7f5d3SJohn Marino p[10 + i] = uuid->node[i];
67*86d7f5d3SJohn Marino }
68*86d7f5d3SJohn Marino
69*86d7f5d3SJohn Marino void
uuid_dec_le(const void * buf,uuid_t * uuid)70*86d7f5d3SJohn Marino uuid_dec_le(const void *buf, uuid_t *uuid)
71*86d7f5d3SJohn Marino {
72*86d7f5d3SJohn Marino const uint8_t *p = buf;
73*86d7f5d3SJohn Marino int i;
74*86d7f5d3SJohn Marino
75*86d7f5d3SJohn Marino uuid->time_low = le32dec(p);
76*86d7f5d3SJohn Marino uuid->time_mid = le16dec(p + 4);
77*86d7f5d3SJohn Marino uuid->time_hi_and_version = le16dec(p + 6);
78*86d7f5d3SJohn Marino uuid->clock_seq_hi_and_reserved = p[8];
79*86d7f5d3SJohn Marino uuid->clock_seq_low = p[9];
80*86d7f5d3SJohn Marino for (i = 0; i < _UUID_NODE_LEN; i++)
81*86d7f5d3SJohn Marino uuid->node[i] = p[10 + i];
82*86d7f5d3SJohn Marino }
83*86d7f5d3SJohn Marino
84*86d7f5d3SJohn Marino void
uuid_enc_be(void * buf,const uuid_t * uuid)85*86d7f5d3SJohn Marino uuid_enc_be(void *buf, const uuid_t *uuid)
86*86d7f5d3SJohn Marino {
87*86d7f5d3SJohn Marino uint8_t *p = buf;
88*86d7f5d3SJohn Marino int i;
89*86d7f5d3SJohn Marino
90*86d7f5d3SJohn Marino be32enc(p, uuid->time_low);
91*86d7f5d3SJohn Marino be16enc(p + 4, uuid->time_mid);
92*86d7f5d3SJohn Marino be16enc(p + 6, uuid->time_hi_and_version);
93*86d7f5d3SJohn Marino p[8] = uuid->clock_seq_hi_and_reserved;
94*86d7f5d3SJohn Marino p[9] = uuid->clock_seq_low;
95*86d7f5d3SJohn Marino for (i = 0; i < _UUID_NODE_LEN; i++)
96*86d7f5d3SJohn Marino p[10 + i] = uuid->node[i];
97*86d7f5d3SJohn Marino }
98*86d7f5d3SJohn Marino
99*86d7f5d3SJohn Marino void
uuid_dec_be(const void * buf,uuid_t * uuid)100*86d7f5d3SJohn Marino uuid_dec_be(const void *buf, uuid_t *uuid)
101*86d7f5d3SJohn Marino {
102*86d7f5d3SJohn Marino const uint8_t *p = buf;
103*86d7f5d3SJohn Marino int i;
104*86d7f5d3SJohn Marino
105*86d7f5d3SJohn Marino uuid->time_low = be32dec(p);
106*86d7f5d3SJohn Marino uuid->time_mid = be16dec(p + 4);
107*86d7f5d3SJohn Marino uuid->time_hi_and_version = be16dec(p + 6);
108*86d7f5d3SJohn Marino uuid->clock_seq_hi_and_reserved = p[8];
109*86d7f5d3SJohn Marino uuid->clock_seq_low = p[9];
110*86d7f5d3SJohn Marino for (i = 0; i < _UUID_NODE_LEN; i++)
111*86d7f5d3SJohn Marino uuid->node[i] = p[10 + i];
112*86d7f5d3SJohn Marino }
113