OLD | NEW |
| (Empty) |
1 // Copyright (c) 2007, Google Inc. | |
2 // All rights reserved. | |
3 // | |
4 // Redistribution and use in source and binary forms, with or without | |
5 // modification, are permitted provided that the following conditions are | |
6 // met: | |
7 // | |
8 // * Redistributions of source code must retain the above copyright | |
9 // notice, this list of conditions and the following disclaimer. | |
10 // * Redistributions in binary form must reproduce the above | |
11 // copyright notice, this list of conditions and the following disclaimer | |
12 // in the documentation and/or other materials provided with the | |
13 // distribution. | |
14 // * Neither the name of Google Inc. nor the names of its | |
15 // contributors may be used to endorse or promote products derived from | |
16 // this software without specific prior written permission. | |
17 // | |
18 // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
19 // "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
20 // LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
21 // A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT | |
22 // OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, | |
23 // SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT | |
24 // LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, | |
25 // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY | |
26 // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT | |
27 // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE | |
28 // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
29 | |
30 // Author: Alfred Peng | |
31 | |
32 #include <cassert> | |
33 #include <ctime> | |
34 | |
35 #include <stdio.h> | |
36 #include <stdlib.h> | |
37 #include <unistd.h> | |
38 | |
39 #include "common/solaris/guid_creator.h" | |
40 | |
41 // | |
42 // GUIDGenerator | |
43 // | |
44 // This class is used to generate random GUID. | |
45 // Currently use random number to generate a GUID. This should be OK since | |
46 // we don't expect crash to happen very offen. | |
47 // | |
48 class GUIDGenerator { | |
49 public: | |
50 GUIDGenerator() { | |
51 srandom(time(NULL)); | |
52 } | |
53 | |
54 bool CreateGUID(GUID *guid) const { | |
55 guid->data1 = random(); | |
56 guid->data2 = (u_int16_t)(random()); | |
57 guid->data3 = (u_int16_t)(random()); | |
58 *reinterpret_cast<u_int32_t*>(&guid->data4[0]) = random(); | |
59 *reinterpret_cast<u_int32_t*>(&guid->data4[4]) = random(); | |
60 return true; | |
61 } | |
62 }; | |
63 | |
64 // Guid generator. | |
65 const GUIDGenerator kGuidGenerator; | |
66 | |
67 bool CreateGUID(GUID *guid) { | |
68 return kGuidGenerator.CreateGUID(guid); | |
69 }; | |
70 | |
71 // Parse guid to string. | |
72 bool GUIDToString(const GUID *guid, char *buf, int buf_len) { | |
73 // Should allow more space the the max length of GUID. | |
74 assert(buf_len > kGUIDStringLength); | |
75 int num = snprintf(buf, buf_len, kGUIDFormatString, | |
76 guid->data1, guid->data2, guid->data3, | |
77 *reinterpret_cast<const u_int32_t *>(&(guid->data4[0])), | |
78 *reinterpret_cast<const u_int32_t *>(&(guid->data4[4]))); | |
79 if (num != kGUIDStringLength) | |
80 return false; | |
81 | |
82 buf[num] = '\0'; | |
83 return true; | |
84 } | |
OLD | NEW |