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