mirror of
https://github.com/penpot/penpot.git
synced 2025-08-06 14:58:28 +02:00
♻️ Refactor uuid impl module.
Make it crossplatform (browser, nodejs, jvm).
This commit is contained in:
Andrey Antukh
parent
bcb2609b18
commit
b8526c6e3b
2 changed files with 174 additions and 159 deletions
|
|
@ -14,7 +14,7 @@
|
||||||
(:require [clj-uuid :as impl]
|
(:require [clj-uuid :as impl]
|
||||||
[clojure.core :as c])
|
[clojure.core :as c])
|
||||||
:cljs
|
:cljs
|
||||||
(:require ["./uuid_impl.js" :as impl]
|
(:require [uxbox.common.uuid-impl :as impl]
|
||||||
[cljs.core :as c])))
|
[cljs.core :as c])))
|
||||||
|
|
||||||
(def zero #uuid "00000000-0000-0000-0000-000000000000")
|
(def zero #uuid "00000000-0000-0000-0000-000000000000")
|
||||||
|
|
|
||||||
|
|
@ -1,4 +1,4 @@
|
||||||
/*
|
/**
|
||||||
* This Source Code Form is subject to the terms of the Mozilla Public
|
* This Source Code Form is subject to the terms of the Mozilla Public
|
||||||
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
* License, v. 2.0. If a copy of the MPL was not distributed with this
|
||||||
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
|
||||||
|
|
@ -10,174 +10,189 @@
|
||||||
*/
|
*/
|
||||||
"use strict";
|
"use strict";
|
||||||
|
|
||||||
import cljs from "goog:cljs.core";
|
goog.require("cljs.core");
|
||||||
|
goog.provide("uxbox.common.uuid_impl");
|
||||||
|
|
||||||
const global = goog.global;
|
goog.scope(function() {
|
||||||
const crypto = global.crypto;
|
const core = cljs.core;
|
||||||
|
const self = uxbox.common.uuid_impl;
|
||||||
|
|
||||||
function fill(buf) {
|
const fill = (() => {
|
||||||
crypto.getRandomValues(buf);
|
if (typeof window === "object") {
|
||||||
return buf;
|
return (buf) => {
|
||||||
};
|
window.crypto.getRandomValues(buf);
|
||||||
|
return buf;
|
||||||
|
};
|
||||||
|
} else if (typeof self === "object") {
|
||||||
|
return (buf) => {
|
||||||
|
self.crypto.getRandomValues(buf);
|
||||||
|
return buf;
|
||||||
|
};
|
||||||
|
} else if (typeof require === "function") {
|
||||||
|
const crypto = require("crypto");
|
||||||
|
return (buf) => {
|
||||||
|
crypto.getRandomValues(buf);
|
||||||
|
return buf;
|
||||||
|
};
|
||||||
|
} else {
|
||||||
|
// FALLBACK
|
||||||
|
console.warn("No high quality RNG available, switching back to Math.random.");
|
||||||
|
|
||||||
// NOTE: NodeJS compatibility
|
return (buf) => {
|
||||||
if (typeof require === "function") {
|
for (let i = 0, r; i < buf.length; i++) {
|
||||||
global.crypto = require("crypto");
|
if ((i & 0x03) === 0) { r = Math.random() * 0x100000000; }
|
||||||
}
|
buf[i] = r >>> ((i & 0x03) << 3) & 0xff;
|
||||||
|
}
|
||||||
if (global.crypto === undefined) {
|
return buf;
|
||||||
console.warn("No high quality RNG available, switching back to Math.random.");
|
};
|
||||||
|
|
||||||
fill = function(buf) {
|
|
||||||
for (let i = 0, r; i < buf.length; i++) {
|
|
||||||
if ((i & 0x03) === 0) { r = Math.random() * 0x100000000; }
|
|
||||||
buf[i] = r >>> ((i & 0x03) << 3) & 0xff;
|
|
||||||
}
|
}
|
||||||
return buf;
|
})();
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
/*
|
/*
|
||||||
* The MIT License (MIT)
|
* The MIT License (MIT)
|
||||||
*
|
*
|
||||||
* Copyright (c) 2010-2016 Robert Kieffer and other contributors
|
* Copyright (c) 2010-2016 Robert Kieffer and other contributors
|
||||||
*
|
*
|
||||||
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
* Permission is hereby granted, free of charge, to any person obtaining a copy
|
||||||
* of this software and associated documentation files (the "Software"), to deal
|
* of this software and associated documentation files (the "Software"), to deal
|
||||||
* in the Software without restriction, including without limitation the rights
|
* in the Software without restriction, including without limitation the rights
|
||||||
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
* to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
|
||||||
* copies of the Software, and to permit persons to whom the Software is
|
* copies of the Software, and to permit persons to whom the Software is
|
||||||
* furnished to do so, subject to the following conditions:
|
* furnished to do so, subject to the following conditions:
|
||||||
*
|
*
|
||||||
* The above copyright notice and this permission notice shall be included in all
|
* The above copyright notice and this permission notice shall be included in all
|
||||||
* copies or substantial portions of the Software.
|
* copies or substantial portions of the Software.
|
||||||
*
|
*
|
||||||
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
|
||||||
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
* IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
|
||||||
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
|
||||||
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
* AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
|
||||||
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
* LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
|
||||||
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
* OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
|
||||||
* SOFTWARE.
|
* SOFTWARE.
|
||||||
*/
|
*/
|
||||||
|
|
||||||
const hexMap = [];
|
const hexMap = [];
|
||||||
for (let i = 0; i < 256; i++) {
|
for (let i = 0; i < 256; i++) {
|
||||||
hexMap[i] = (i + 0x100).toString(16).substr(1);
|
hexMap[i] = (i + 0x100).toString(16).substr(1);
|
||||||
}
|
|
||||||
|
|
||||||
function toHexString(buf) {
|
|
||||||
let i = 0;
|
|
||||||
return (hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] + '-' +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] + '-' +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] + '-' +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] + '-' +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]] +
|
|
||||||
hexMap[buf[i++]]);
|
|
||||||
}
|
|
||||||
|
|
||||||
const buff = new Uint8Array(16);
|
|
||||||
|
|
||||||
export function v4() {
|
|
||||||
fill(buff);
|
|
||||||
buff[6] = (buff[6] & 0x0f) | 0x40;
|
|
||||||
buff[8] = (buff[8] & 0x3f) | 0x80;
|
|
||||||
return cljs.uuid(toHexString(buff));
|
|
||||||
}
|
|
||||||
|
|
||||||
let initialized = false;
|
|
||||||
let node;
|
|
||||||
let clockseq;
|
|
||||||
let lastms = 0;
|
|
||||||
let lastns = 0;
|
|
||||||
|
|
||||||
export function v1() {
|
|
||||||
let cs = clockseq;
|
|
||||||
|
|
||||||
if (!initialized) {
|
|
||||||
const seed = new Uint8Array(8)
|
|
||||||
fill(seed);
|
|
||||||
|
|
||||||
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
|
|
||||||
node = [
|
|
||||||
seed[0] | 0x01,
|
|
||||||
seed[1],
|
|
||||||
seed[2],
|
|
||||||
seed[3],
|
|
||||||
seed[4],
|
|
||||||
seed[5]
|
|
||||||
];
|
|
||||||
|
|
||||||
// Per 4.2.2, randomize (14 bit) clockseq
|
|
||||||
cs = clockseq = (seed[6] << 8 | seed[7]) & 0x3fff;
|
|
||||||
initialized = true;
|
|
||||||
}
|
}
|
||||||
|
|
||||||
let ms = Date.now();
|
function toHexString(buf) {
|
||||||
let ns = lastns + 1;
|
let i = 0;
|
||||||
let dt = (ms - lastms) + (ns - lastns) / 10000;
|
return (hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
// Per 4.2.1.2, Bump clockseq on clock regression
|
hexMap[buf[i++]] +
|
||||||
if (dt < 0) {
|
hexMap[buf[i++]] + '-' +
|
||||||
cs = cs + 1 & 0x3fff;
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] + '-' +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] + '-' +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] + '-' +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]] +
|
||||||
|
hexMap[buf[i++]]);
|
||||||
}
|
}
|
||||||
|
|
||||||
// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
|
const buff = new Uint8Array(16);
|
||||||
// time interval
|
|
||||||
if (dt < 0 || ms > lastms) {
|
function v4() {
|
||||||
ns = 0;
|
fill(buff);
|
||||||
|
buff[6] = (buff[6] & 0x0f) | 0x40;
|
||||||
|
buff[8] = (buff[8] & 0x3f) | 0x80;
|
||||||
|
return core.uuid(toHexString(buff));
|
||||||
}
|
}
|
||||||
|
|
||||||
// Per 4.2.1.2 Throw error if too many uuids are requested
|
let initialized = false;
|
||||||
if (ns >= 10000) {
|
let node;
|
||||||
throw new Error("uuid v1 can't create more than 10M uuids/s")
|
let clockseq;
|
||||||
|
let lastms = 0;
|
||||||
|
let lastns = 0;
|
||||||
|
|
||||||
|
function v1() {
|
||||||
|
let cs = clockseq;
|
||||||
|
|
||||||
|
if (!initialized) {
|
||||||
|
const seed = new Uint8Array(8)
|
||||||
|
fill(seed);
|
||||||
|
|
||||||
|
// Per 4.5, create and 48-bit node id, (47 random bits + multicast bit = 1)
|
||||||
|
node = [
|
||||||
|
seed[0] | 0x01,
|
||||||
|
seed[1],
|
||||||
|
seed[2],
|
||||||
|
seed[3],
|
||||||
|
seed[4],
|
||||||
|
seed[5]
|
||||||
|
];
|
||||||
|
|
||||||
|
// Per 4.2.2, randomize (14 bit) clockseq
|
||||||
|
cs = clockseq = (seed[6] << 8 | seed[7]) & 0x3fff;
|
||||||
|
initialized = true;
|
||||||
|
}
|
||||||
|
|
||||||
|
let ms = Date.now();
|
||||||
|
let ns = lastns + 1;
|
||||||
|
let dt = (ms - lastms) + (ns - lastns) / 10000;
|
||||||
|
|
||||||
|
// Per 4.2.1.2, Bump clockseq on clock regression
|
||||||
|
if (dt < 0) {
|
||||||
|
cs = cs + 1 & 0x3fff;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Reset nsecs if clock regresses (new clockseq) or we've moved onto a new
|
||||||
|
// time interval
|
||||||
|
if (dt < 0 || ms > lastms) {
|
||||||
|
ns = 0;
|
||||||
|
}
|
||||||
|
|
||||||
|
// Per 4.2.1.2 Throw error if too many uuids are requested
|
||||||
|
if (ns >= 10000) {
|
||||||
|
throw new Error("uuid v1 can't create more than 10M uuids/s")
|
||||||
|
}
|
||||||
|
|
||||||
|
lastms = ms;
|
||||||
|
lastns = ns;
|
||||||
|
clockseq = cs;
|
||||||
|
|
||||||
|
// Per 4.1.4 - Convert from unix epoch to Gregorian epoch
|
||||||
|
ms += 12219292800000;
|
||||||
|
|
||||||
|
let i = 0;
|
||||||
|
|
||||||
|
// `time_low`
|
||||||
|
var tl = ((ms & 0xfffffff) * 10000 + ns) % 0x100000000;
|
||||||
|
buff[i++] = tl >>> 24 & 0xff;
|
||||||
|
buff[i++] = tl >>> 16 & 0xff;
|
||||||
|
buff[i++] = tl >>> 8 & 0xff;
|
||||||
|
buff[i++] = tl & 0xff;
|
||||||
|
|
||||||
|
// `time_mid`
|
||||||
|
var tmh = (ms / 0x100000000 * 10000) & 0xfffffff;
|
||||||
|
buff[i++] = tmh >>> 8 & 0xff;
|
||||||
|
buff[i++] = tmh & 0xff;
|
||||||
|
|
||||||
|
// `time_high_and_version`
|
||||||
|
buff[i++] = tmh >>> 24 & 0xf | 0x10; // include version
|
||||||
|
buff[i++] = tmh >>> 16 & 0xff;
|
||||||
|
|
||||||
|
// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
|
||||||
|
buff[i++] = cs >>> 8 | 0x80;
|
||||||
|
|
||||||
|
// `clock_seq_low`
|
||||||
|
buff[i++] = cs & 0xff;
|
||||||
|
|
||||||
|
// `node`
|
||||||
|
for (var n = 0; n < 6; ++n) {
|
||||||
|
buff[i + n] = node[n];
|
||||||
|
}
|
||||||
|
|
||||||
|
return core.uuid(toHexString(buff));
|
||||||
}
|
}
|
||||||
|
|
||||||
lastms = ms;
|
self.v1 = v1;
|
||||||
lastns = ns;
|
self.v4 = v4;
|
||||||
clockseq = cs;
|
});
|
||||||
|
|
||||||
// Per 4.1.4 - Convert from unix epoch to Gregorian epoch
|
|
||||||
ms += 12219292800000;
|
|
||||||
|
|
||||||
let i = 0;
|
|
||||||
|
|
||||||
// `time_low`
|
|
||||||
var tl = ((ms & 0xfffffff) * 10000 + ns) % 0x100000000;
|
|
||||||
buff[i++] = tl >>> 24 & 0xff;
|
|
||||||
buff[i++] = tl >>> 16 & 0xff;
|
|
||||||
buff[i++] = tl >>> 8 & 0xff;
|
|
||||||
buff[i++] = tl & 0xff;
|
|
||||||
|
|
||||||
// `time_mid`
|
|
||||||
var tmh = (ms / 0x100000000 * 10000) & 0xfffffff;
|
|
||||||
buff[i++] = tmh >>> 8 & 0xff;
|
|
||||||
buff[i++] = tmh & 0xff;
|
|
||||||
|
|
||||||
// `time_high_and_version`
|
|
||||||
buff[i++] = tmh >>> 24 & 0xf | 0x10; // include version
|
|
||||||
buff[i++] = tmh >>> 16 & 0xff;
|
|
||||||
|
|
||||||
// `clock_seq_hi_and_reserved` (Per 4.2.2 - include variant)
|
|
||||||
buff[i++] = cs >>> 8 | 0x80;
|
|
||||||
|
|
||||||
// `clock_seq_low`
|
|
||||||
buff[i++] = cs & 0xff;
|
|
||||||
|
|
||||||
// `node`
|
|
||||||
for (var n = 0; n < 6; ++n) {
|
|
||||||
buff[i + n] = node[n];
|
|
||||||
}
|
|
||||||
|
|
||||||
return cljs.uuid(toHexString(buff));
|
|
||||||
}
|
|
||||||
|
|
|
||||||
Loading…
Add table
Add a link
Reference in a new issue