137 lines
3.4 KiB
TypeScript
137 lines
3.4 KiB
TypeScript
/**
|
|
* Copyright 2013-2019 GenieACS Inc.
|
|
*
|
|
* This file is part of GenieACS.
|
|
*
|
|
* GenieACS is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as
|
|
* published by the Free Software Foundation, either version 3 of the
|
|
* License, or (at your option) any later version.
|
|
*
|
|
* GenieACS is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU Affero General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Affero General Public License
|
|
* along with GenieACS. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
import * as store from "./store";
|
|
import { Task } from "../lib/types";
|
|
import * as notifications from "./notifications";
|
|
|
|
export interface QueueTask extends Task {
|
|
status?: string;
|
|
device: string;
|
|
}
|
|
|
|
export interface StageTask extends Task {
|
|
devices: string[];
|
|
}
|
|
|
|
const MAX_QUEUE = 100;
|
|
|
|
const queue: Set<QueueTask> = new Set();
|
|
const staging: Set<StageTask> = new Set();
|
|
|
|
function canQueue(tasks: QueueTask[]): boolean {
|
|
let count = queue.size;
|
|
for (const task of tasks) if (!queue.has(task)) ++count;
|
|
return count <= MAX_QUEUE;
|
|
}
|
|
|
|
export function queueTask(...tasks: QueueTask[]): void {
|
|
if (!canQueue(tasks)) {
|
|
notifications.push("error", "Too many tasks in queue");
|
|
return;
|
|
}
|
|
|
|
for (const task of tasks) {
|
|
task.status = "queued";
|
|
queue.add(task);
|
|
}
|
|
}
|
|
|
|
export function deleteTask(task: QueueTask): void {
|
|
queue.delete(task);
|
|
}
|
|
|
|
export function getQueue(): Set<QueueTask> {
|
|
return queue;
|
|
}
|
|
|
|
export function clear(): void {
|
|
queue.clear();
|
|
}
|
|
|
|
export function getStaging(): Set<StageTask> {
|
|
return staging;
|
|
}
|
|
|
|
export function clearStaging(): void {
|
|
staging.clear();
|
|
}
|
|
|
|
export function stageSpv(task: StageTask): void {
|
|
if (queue.size + task.devices.length > MAX_QUEUE) {
|
|
notifications.push("error", "Too many tasks in queue");
|
|
return;
|
|
}
|
|
staging.add(task);
|
|
}
|
|
|
|
export function stageDownload(task: StageTask): void {
|
|
if (queue.size + task.devices.length > MAX_QUEUE) {
|
|
notifications.push("error", "Too many tasks in queue");
|
|
return;
|
|
}
|
|
staging.add(task);
|
|
}
|
|
|
|
export function commit(
|
|
tasks: QueueTask[],
|
|
callback: (
|
|
deviceId: string,
|
|
err: Error,
|
|
conReqStatus: string,
|
|
_tasks: QueueTask[]
|
|
) => void
|
|
): Promise<void> {
|
|
const devices: { [deviceId: string]: any[] } = {};
|
|
|
|
if (!canQueue(tasks))
|
|
return Promise.reject(new Error("Too many tasks in queue"));
|
|
|
|
for (const t of tasks) {
|
|
devices[t.device] = devices[t.device] || [];
|
|
devices[t.device].push(t);
|
|
t.status = "queued";
|
|
queue.add(t);
|
|
}
|
|
|
|
return new Promise((resolve) => {
|
|
let counter = 1;
|
|
for (const [deviceId, tasks2] of Object.entries(devices)) {
|
|
++counter;
|
|
store
|
|
.postTasks(deviceId, tasks2)
|
|
.then((connectionRequestStatus) => {
|
|
for (const t of tasks2) {
|
|
if (t.status === "pending") t.status = "stale";
|
|
else if (t.status === "done") queue.delete(t);
|
|
}
|
|
callback(deviceId, null, connectionRequestStatus, tasks2);
|
|
if (--counter === 0) resolve();
|
|
})
|
|
.catch((err) => {
|
|
for (const t of tasks2) t.status = "stale";
|
|
callback(deviceId, err, null, tasks2);
|
|
if (--counter === 0) resolve();
|
|
});
|
|
}
|
|
|
|
if (--counter === 0) resolve();
|
|
});
|
|
}
|