forked from uuidjs/uuid
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathuuid.js
255 lines (208 loc) · 6.98 KB
/
uuid.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
/*
* Generate RFC4122 (v1 and v4) UUIDs
*
* Documentation at https://github.com/broofa/node-uuid
*/
(function() {
var _global = this;
// Random number generator (feature-detected below)
var _rng;
// node.js 'crypto' API
// http://nodejs.org/docs/v0.6.2/api/crypto.html#randomBytes
try {
_rng = require('crypto').randomBytes;
} catch (e) {}
// WHATWG crypto api, available in Chrome
// http://wiki.whatwg.org/wiki/Crypto
if (!_rng && _global.crypto && crypto.getRandomValues) {
var _rnds = new Uint32Array(4), _rndBytes = new Array(16);
var _rng = function() {
// Get 32-bit rnds
crypto.getRandomValues(_rnds);
// Unpack into byte array
for (var c = 0 ; c < 16; c++) {
_rndBytes[c] = _rnds[c >> 2] >>> ((c & 0x03) * 8) & 0xff;
}
return _rndBytes;
};
}
// Math.random - least desirable option since it does not guarantee
// cryptographic quality.
if (!_rng) {
var _rndBytes = new Array(16);
_rng = function() {
var r, b = _rndBytes, i = 0;
for (var i = 0, r; i < 16; i++) {
if ((i & 0x03) == 0) r = Math.random() * 0x100000000;
b[i] = r >>> ((i & 0x03) << 3) & 0xff;
}
return b;
};
}
// Buffer class to use
var BufferClass = typeof(Buffer) == 'function' ? Buffer : Array;
// Maps for number <-> hex string conversion
var _byteToHex = [];
var _hexToByte = {};
for (var i = 0; i < 256; i++) {
_byteToHex[i] = (i + 0x100).toString(16).substr(1);
_hexToByte[_byteToHex[i]] = i;
}
/** See docs at https://github.com/broofa/node-uuid */
function parse(s, buf, offset) {
var i = (buf && offset) || 0, ii = 0;
buf = buf || [];
s.toLowerCase().replace(/[0-9a-f]{2}/g, function(byte) {
if (ii < 16) { // Don't overflow!
buf[i + ii++] = _hexToByte[byte];
}
});
// Zero out remaining bytes if string was short
while (ii < 16) {
buf[i + ii++] = 0;
}
return buf;
}
/** See docs at https://github.com/broofa/node-uuid */
function unparse(buf, offset) {
var i = offset || 0, bth = _byteToHex;
return bth[buf[i++]] + bth[buf[i++]] +
bth[buf[i++]] + bth[buf[i++]] + '-' +
bth[buf[i++]] + bth[buf[i++]] + '-' +
bth[buf[i++]] + bth[buf[i++]] + '-' +
bth[buf[i++]] + bth[buf[i++]] + '-' +
bth[buf[i++]] + bth[buf[i++]] +
bth[buf[i++]] + bth[buf[i++]] +
bth[buf[i++]] + bth[buf[i++]];
}
// Pre allocate array for constructing uuids
var _buffer = new BufferClass(16);
//
// v1 UUID support
//
// Inspired by https://github.com/LiosK/UUID.js
// and http://docs.python.org/library/uuid.html
//
// Per 4.1.4 - Offset (in msecs) from JS time to UUID (gregorian) time
var EPOCH_OFFSET = 12219292800000;
// random #'s we need to init node and clockseq
var _seedBytes = _rng(10);
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
var _nodeId = [
_seedBytes[0] | 0x01,
_seedBytes[1], _seedBytes[2], _seedBytes[3], _seedBytes[4], _seedBytes[5]
];
// Per 4.2.2, randomize (14 bit) clockseq
var _clockSeq = (_seedBytes[6] << 8 | _seedBytes[7]) & 0x3fff;
// Previous uuid creation time
var _last = 0;
// Count of UUIDs created during current time tick
var _count = 0;
/** See docs at https://github.com/broofa/node-uuid */
function v1(options, buf, offset) {
var i = buf && offset || 0;
var b = buf || _buffer;
options = options || {};
// JS Numbers aren't capable of representing time in the RFC-specified
// 100-nanosecond units. To deal with this, we represent time as the usual
// JS milliseconds, plus an additional 100-nanosecond unit offset.
var msecs = 0; // JS time (msecs since Unix epoch)
var nsecs = 0; // additional 100-nanosecond units to add to msecs
if (options.msecs != null) {
// Explicit time specified. Not that this turns off the internal logic
// around uuid count and clock sequence used insure uniqueness
msecs = (+options.msecs) + EPOCH_OFFSET;
nsecs = options.nsecs || 0;
} else {
// No time options - Follow the RFC logic (4.2.1.2) for maintaining
// clock seq and uuid count to help insure UUID uniqueness.
msecs = new Date().getTime() + EPOCH_OFFSET;
if (msecs < _last) {
// Clock regression - Per 4.2.1.2, increment clock seq
_clockSeq++;
_count = 0;
} else {
// Per 4.2.1.2, use a count of uuid's generated during the current
// clock cycle to simulate higher resolution clock
_count = (msecs == _last) ? _count + 1 : 0;
}
_last = msecs;
// Per 4.2.1.2 If generator creates more than one id per uuid 100-ns
// interval, throw an error
// (Requires generating > 10M uuids/sec. While unlikely, it's not
// entirely inconceivable given the benchmark results we're getting)
if (_count >= 10000) {
throw new Error('uuid.v1(): Can\'t create more than 10M uuids/sec');
}
nsecs = _count;
}
// Per 4.1.4, timestamp composition
// time_low
var tl = ((msecs & 0xfffffff) * 10000 + nsecs) % 0x100000000;
b[i++] = tl >>> 24 & 0xff;
b[i++] = tl >>> 16 & 0xff;
b[i++] = tl >>> 8 & 0xff;
b[i++] = tl & 0xff;
// time_mid
var tmh = (msecs / 0x100000000 * 10000) & 0xfffffff;
b[i++] = tmh >>> 8 & 0xff;
b[i++] = tmh & 0xff;
// time_high_and_version
b[i++] = tmh >>> 24 & 0xf | 0x10; // include version
b[i++] = tmh >>> 16 & 0xff;
// Clock sequence
var cs = options.clockseq != null ? options.clockseq : _clockSeq;
// clock_seq_hi_and_reserved (Per 4.2.2 - include variant)
b[i++] = cs >>> 8 | 0x80;
// clock_seq_low
b[i++] = cs & 0xff;
// node
var node = options.node || _nodeId;
for (var n = 0; n < 6; n++) {
b[i + n] = node[n];
}
return buf ? buf : unparse(b);
}
//
// v4 UUID support
//
/** See docs at https://github.com/broofa/node-uuid */
function v4(options, buf, offset) {
// Deprecated - 'format' argument, as supported in v1.2
var i = buf && offset || 0;
if (typeof(options) == 'string') {
buf = options == 'binary' ? new BufferClass(16) : null;
options = null;
}
var rnds = options && options.random || _rng(16);
// Per 4.4, set bits for version and clock_seq_hi_and_reserved
rnds[6] = (rnds[6] & 0x0f) | 0x40;
rnds[8] = (rnds[8] & 0x3f) | 0x80;
// Copy bytes to buffer, if provided
if (buf) {
for (var ii = 0; ii < 16; ii++) {
buf[i + ii] = rnds[ii];
}
}
return buf || unparse(rnds);
}
//
// Export API
//
var uuid = v4;
uuid.v1 = v1;
uuid.v4 = v4;
uuid.parse = parse;
uuid.unparse = unparse;
uuid.BufferClass = BufferClass;
if (typeof(module) != 'undefined') {
module.exports = uuid;
} else {
var _previousRoot = _global.uuid;
uuid.noConflict = function() {
_global.uuid = _previousRoot;
return uuid;
}
_global.uuid = uuid;
}
}());