smc-hub
Version:
CoCalc: Backend webserver component
151 lines • 7.67 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 __values = (this && this.__values) || function(o) {
var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
if (m) return m.call(o);
if (o && typeof o.length === "number") return {
next: function () {
if (o && i >= o.length) o = void 0;
return { value: o && o[i++], done: !o };
}
};
throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
};
Object.defineProperty(exports, "__esModule", { value: true });
exports.init_start_always_running_projects = exports.projects_that_need_to_be_started = void 0;
var awaiting_1 = require("awaiting");
// Return an array of project_id's of projects that have the always_running run_quota set,
// but are not in the running or starting state.
// We only check for stable states, i.e. there is no state transition going on right now.
// Ref: smc-util/compute-states.js
// Performance: only an `x IN <array>` clause uses the index, not a `NOT IN`.
function projects_that_need_to_be_started(database, limit) {
if (limit === void 0) { limit = 10; }
return __awaiter(this, void 0, void 0, function () {
var result, projects, _a, _b, row;
var e_1, _c;
return __generator(this, function (_d) {
switch (_d.label) {
case 0: return [4 /*yield*/, database.async_query({
query: "SELECT project_id FROM projects WHERE (run_quota ->> 'always_running' = 'true') AND (state ->> 'state' IN ('archived', 'closed', 'opened') OR state IS NULL) LIMIT " + limit,
})];
case 1:
result = _d.sent();
projects = [];
try {
for (_a = __values(result.rows), _b = _a.next(); !_b.done; _b = _a.next()) {
row = _b.value;
projects.push(row.project_id);
}
}
catch (e_1_1) { e_1 = { error: e_1_1 }; }
finally {
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_1) throw e_1.error; }
}
return [2 /*return*/, projects];
}
});
});
}
exports.projects_that_need_to_be_started = projects_that_need_to_be_started;
function init_start_always_running_projects(database, interval_s) {
if (interval_s === void 0) { interval_s = 15; }
return __awaiter(this, void 0, void 0, function () {
var _a, _b, project_id, compute_server, project, e_2_1, err_1;
var e_2, _c;
return __generator(this, function (_d) {
switch (_d.label) {
case 0:
if (!true) return [3 /*break*/, 13];
_d.label = 1;
case 1:
_d.trys.push([1, 10, , 11]);
_d.label = 2;
case 2:
_d.trys.push([2, 7, 8, 9]);
e_2 = void 0;
return [4 /*yield*/, projects_that_need_to_be_started(database)];
case 3:
_a = (__values.apply(void 0, [_d.sent()])), _b = _a.next();
_d.label = 4;
case 4:
if (!!_b.done) return [3 /*break*/, 6];
project_id = _b.value;
compute_server = database.compute_server;
if (compute_server == null)
return [3 /*break*/, 5]; // not initialized (?)
project = compute_server(project_id);
project.start(); // we fire this off, but do not wait on it
_d.label = 5;
case 5:
_b = _a.next();
return [3 /*break*/, 4];
case 6: return [3 /*break*/, 9];
case 7:
e_2_1 = _d.sent();
e_2 = { error: e_2_1 };
return [3 /*break*/, 9];
case 8:
try {
if (_b && !_b.done && (_c = _a.return)) _c.call(_a);
}
finally { if (e_2) throw e_2.error; }
return [7 /*endfinally*/];
case 9: return [3 /*break*/, 11];
case 10:
err_1 = _d.sent();
console.warn("init_start_always_running_projects", err_1);
return [3 /*break*/, 11];
case 11: return [4 /*yield*/, awaiting_1.delay(interval_s * 1000)];
case 12:
_d.sent();
return [3 /*break*/, 0];
case 13: return [2 /*return*/];
}
});
});
}
exports.init_start_always_running_projects = init_start_always_running_projects;
//# sourceMappingURL=always-running.js.map