smc-hub
Version:
CoCalc: Backend webserver component
124 lines • 6.42 kB
JavaScript
;
/*
* This file is part of CoCalc: Copyright © 2020 Sagemath, Inc.
* License: AGPLv3 s.t. "Commons Clause" – see LICENSE.md for details
*/
var __awaiter = (this && this.__awaiter) || function (thisArg, _arguments, P, generator) {
function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }
return new (P || (P = Promise))(function (resolve, reject) {
function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }
function rejected(value) { try { step(generator["throw"](value)); } catch (e) { reject(e); } }
function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }
step((generator = generator.apply(thisArg, _arguments || [])).next());
});
};
var __generator = (this && this.__generator) || function (thisArg, body) {
var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;
return g = { next: verb(0), "throw": verb(1), "return": verb(2) }, typeof Symbol === "function" && (g[Symbol.iterator] = function() { return this; }), g;
function verb(n) { return function (v) { return step([n, v]); }; }
function step(op) {
if (f) throw new TypeError("Generator is already executing.");
while (_) try {
if (f = 1, y && (t = op[0] & 2 ? y["return"] : op[0] ? y["throw"] || ((t = y["return"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;
if (y = 0, t) op = [op[0] & 2, t.value];
switch (op[0]) {
case 0: case 1: t = op; break;
case 4: _.label++; return { value: op[1], done: false };
case 5: _.label++; y = op[1]; op = [0]; continue;
case 7: op = _.ops.pop(); _.trys.pop(); continue;
default:
if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }
if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }
if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }
if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }
if (t[2]) _.ops.pop();
_.trys.pop(); continue;
}
op = body.call(thisArg, _);
} catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }
if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };
}
};
var __importDefault = (this && this.__importDefault) || function (mod) {
return (mod && mod.__esModule) ? mod : { "default": mod };
};
var _a, _b;
Object.defineProperty(exports, "__esModule", { value: true });
exports.delete_patches = void 0;
// This manages deleting patches. The underlying problem is that there could be a large number of patches, which stalls the DB.
// It's better to keep the number of row deletions small, to speed up the operation, only lock less rows for a shorter amount of time, etc.
var debug_1 = __importDefault(require("debug"));
var L = debug_1.default("hub:db:delete-patches");
var awaiting_1 = require("awaiting");
// max number of patches to delete at once – 10000 should take a few seconds
var MAX_AT_ONCE = parseInt((_a = process.env.SYNCSTRING_DELETE_MAX_AT_ONCE) !== null && _a !== void 0 ? _a : "10000");
// delay between deleting a chunk of patches
var DELAY_S = parseInt((_b = process.env.SYNCSTRING_DELETE_DELAY_CHUNK_S) !== null && _b !== void 0 ? _b : "1");
function patchset_limit(opts) {
return __awaiter(this, void 0, void 0, function () {
var db, string_id, q;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
db = opts.db, string_id = opts.string_id;
return [4 /*yield*/, db.async_query({
query: "SELECT time FROM patches",
where: { "string_id = $::CHAR(40)": string_id },
limit: 1,
offset: MAX_AT_ONCE,
})];
case 1:
q = _a.sent();
if (q.rows.length == 0) {
return [2 /*return*/, undefined];
}
else {
return [2 /*return*/, q.rows[0].time];
}
return [2 /*return*/];
}
});
});
}
function delete_patches(opts) {
return __awaiter(this, void 0, void 0, function () {
var db, string_id, cb, limit, where;
return __generator(this, function (_a) {
switch (_a.label) {
case 0:
db = opts.db, string_id = opts.string_id, cb = opts.cb;
_a.label = 1;
case 1:
if (!true) return [3 /*break*/, 7];
return [4 /*yield*/, patchset_limit({ db: db, string_id: string_id })];
case 2:
limit = _a.sent();
L("deleting patches string_id='" + string_id + "' until limit='" + limit + "'");
where = { "string_id = $::CHAR(40)": string_id };
if (limit != null) {
where["time <= $::TIMESTAMP"] = limit;
}
return [4 /*yield*/, db.async_query({
query: "DELETE FROM patches",
where: where,
timeout_s: 300, // delete ops could take a bit
})];
case 3:
_a.sent();
if (!(limit != null)) return [3 /*break*/, 5];
return [4 /*yield*/, awaiting_1.delay(DELAY_S * 1000)];
case 4:
_a.sent();
return [3 /*break*/, 6];
case 5: return [3 /*break*/, 7];
case 6: return [3 /*break*/, 1];
case 7:
if (typeof cb === "function")
cb();
return [2 /*return*/];
}
});
});
}
exports.delete_patches = delete_patches;
//# sourceMappingURL=delete-patches.js.map