2018-07-23 14:46:30 -04:00
|
|
|
// Copyright 2018 the Deno authors. All rights reserved. MIT license.
|
2018-07-06 11:20:35 -04:00
|
|
|
import { assert } from "./util";
|
2018-10-03 21:18:23 -04:00
|
|
|
import * as msg from "gen/msg_generated";
|
2018-08-09 15:17:08 -04:00
|
|
|
import { flatbuffers } from "flatbuffers";
|
2018-10-02 20:47:40 -04:00
|
|
|
import { sendSync, setFireTimersCallback } from "./dispatch";
|
2018-07-06 11:20:35 -04:00
|
|
|
|
2018-10-02 20:47:40 -04:00
|
|
|
// Tell the dispatcher which function it should call to fire timers that are
|
|
|
|
// due. This is done using a callback because circular imports are disallowed.
|
|
|
|
setFireTimersCallback(fireTimers);
|
2018-07-06 11:20:35 -04:00
|
|
|
|
|
|
|
interface Timer {
|
|
|
|
id: number;
|
2018-10-02 20:47:40 -04:00
|
|
|
callback: () => void;
|
|
|
|
delay: number;
|
|
|
|
due: number;
|
|
|
|
repeat: boolean;
|
|
|
|
scheduled: boolean;
|
|
|
|
}
|
|
|
|
|
|
|
|
// We'll subtract EPOCH every time we retrieve the time with Date.now(). This
|
|
|
|
// ensures that absolute time values stay below UINT32_MAX - 2, which is the
|
|
|
|
// maximum object key that EcmaScript considers "numerical". After running for
|
|
|
|
// about a month, this is no longer true, and Deno explodes.
|
|
|
|
// TODO(piscisaureus): fix that ^.
|
|
|
|
const EPOCH = Date.now();
|
|
|
|
const APOCALYPS = 2 ** 32 - 2;
|
|
|
|
|
|
|
|
let globalTimeoutDue: number | null = null;
|
|
|
|
|
|
|
|
let nextTimerId = 1;
|
|
|
|
const idMap = new Map<number, Timer>();
|
|
|
|
const dueMap: { [due: number]: Timer[] } = Object.create(null);
|
|
|
|
|
|
|
|
function getTime() {
|
|
|
|
// TODO: use a monotonic clock.
|
|
|
|
const now = Date.now() - EPOCH;
|
|
|
|
assert(now >= 0 && now < APOCALYPS);
|
|
|
|
return now;
|
2018-07-06 11:20:35 -04:00
|
|
|
}
|
|
|
|
|
2018-10-02 20:47:40 -04:00
|
|
|
function setGlobalTimeout(due: number | null, now: number) {
|
|
|
|
// Since JS and Rust don't use the same clock, pass the time to rust as a
|
|
|
|
// relative time value. On the Rust side we'll turn that into an absolute
|
|
|
|
// value again.
|
|
|
|
// Note that a negative time-out value stops the global timer.
|
|
|
|
let timeout;
|
|
|
|
if (due === null) {
|
|
|
|
timeout = -1;
|
|
|
|
} else {
|
|
|
|
timeout = due - now;
|
|
|
|
assert(timeout >= 0);
|
|
|
|
}
|
|
|
|
// Send message to the backend.
|
2018-09-24 22:46:36 -04:00
|
|
|
const builder = new flatbuffers.Builder();
|
2018-10-03 21:18:23 -04:00
|
|
|
msg.SetTimeout.startSetTimeout(builder);
|
|
|
|
msg.SetTimeout.addTimeout(builder, timeout);
|
|
|
|
const inner = msg.SetTimeout.endSetTimeout(builder);
|
|
|
|
const res = sendSync(builder, msg.Any.SetTimeout, inner);
|
2018-09-24 22:46:36 -04:00
|
|
|
assert(res == null);
|
2018-10-02 20:47:40 -04:00
|
|
|
// Remember when when the global timer will fire.
|
|
|
|
globalTimeoutDue = due;
|
2018-09-24 22:46:36 -04:00
|
|
|
}
|
|
|
|
|
2018-10-02 20:47:40 -04:00
|
|
|
function schedule(timer: Timer, now: number) {
|
|
|
|
assert(!timer.scheduled);
|
|
|
|
assert(now <= timer.due);
|
|
|
|
// Find or create the list of timers that will fire at point-in-time `due`.
|
|
|
|
let list = dueMap[timer.due];
|
|
|
|
if (list === undefined) {
|
|
|
|
list = dueMap[timer.due] = [];
|
|
|
|
}
|
|
|
|
// Append the newly scheduled timer to the list and mark it as scheduled.
|
|
|
|
list.push(timer);
|
|
|
|
timer.scheduled = true;
|
|
|
|
// If the new timer is scheduled to fire before any timer that existed before,
|
|
|
|
// update the global timeout to reflect this.
|
|
|
|
if (globalTimeoutDue === null || globalTimeoutDue > timer.due) {
|
|
|
|
setGlobalTimeout(timer.due, now);
|
|
|
|
}
|
|
|
|
}
|
2018-09-05 22:13:36 -04:00
|
|
|
|
2018-10-02 20:47:40 -04:00
|
|
|
function unschedule(timer: Timer) {
|
|
|
|
if (!timer.scheduled) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// Find the list of timers that will fire at point-in-time `due`.
|
|
|
|
const list = dueMap[timer.due];
|
|
|
|
if (list.length === 1) {
|
|
|
|
// Time timer is the only one in the list. Remove the entire list.
|
|
|
|
assert(list[0] === timer);
|
|
|
|
delete dueMap[timer.due];
|
|
|
|
// If the unscheduled timer was 'next up', find when the next timer that
|
|
|
|
// still exists is due, and update the global alarm accordingly.
|
|
|
|
if (timer.due === globalTimeoutDue) {
|
|
|
|
let nextTimerDue: number | null = null;
|
|
|
|
for (const key in dueMap) {
|
|
|
|
nextTimerDue = Number(key);
|
|
|
|
break;
|
2018-09-05 22:13:36 -04:00
|
|
|
}
|
2018-10-02 20:47:40 -04:00
|
|
|
setGlobalTimeout(nextTimerDue, getTime());
|
2018-09-05 22:13:36 -04:00
|
|
|
}
|
2018-10-02 20:47:40 -04:00
|
|
|
} else {
|
|
|
|
// Multiple timers that are due at the same point in time.
|
|
|
|
// Remove this timer from the list.
|
|
|
|
const index = list.indexOf(timer);
|
2018-10-08 03:46:49 -04:00
|
|
|
assert(index > -1);
|
2018-10-02 20:47:40 -04:00
|
|
|
list.splice(index, 1);
|
|
|
|
}
|
2018-07-06 11:20:35 -04:00
|
|
|
}
|
|
|
|
|
2018-10-02 20:47:40 -04:00
|
|
|
function fire(timer: Timer) {
|
|
|
|
// If the timer isn't found in the ID map, that means it has been cancelled
|
|
|
|
// between the timer firing and the promise callback (this function).
|
|
|
|
if (!idMap.has(timer.id)) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// Reschedule the timer if it is a repeating one, otherwise drop it.
|
|
|
|
if (!timer.repeat) {
|
|
|
|
// One-shot timer: remove the timer from this id-to-timer map.
|
|
|
|
idMap.delete(timer.id);
|
|
|
|
} else {
|
|
|
|
// Interval timer: compute when timer was supposed to fire next.
|
|
|
|
// However make sure to never schedule the next interval in the past.
|
|
|
|
const now = getTime();
|
|
|
|
timer.due = Math.max(now, timer.due + timer.delay);
|
|
|
|
schedule(timer, now);
|
|
|
|
}
|
|
|
|
// Call the user callback. Intermediate assignment is to avoid leaking `this`
|
|
|
|
// to it, while also keeping the stack trace neat when it shows up in there.
|
|
|
|
const callback = timer.callback;
|
|
|
|
callback();
|
|
|
|
}
|
|
|
|
|
|
|
|
function fireTimers() {
|
|
|
|
const now = getTime();
|
|
|
|
// Bail out if we're not expecting the global timer to fire (yet).
|
|
|
|
if (globalTimeoutDue === null || now < globalTimeoutDue) {
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// After firing the timers that are due now, this will hold the due time of
|
|
|
|
// the first timer that hasn't fired yet.
|
|
|
|
let nextTimerDue: number | null = null;
|
|
|
|
// Walk over the keys of the 'due' map. Since dueMap is actually a regular
|
|
|
|
// object and its keys are numerical and smaller than UINT32_MAX - 2,
|
|
|
|
// keys are iterated in ascending order.
|
|
|
|
for (const key in dueMap) {
|
|
|
|
// Convert the object key (a string) to a number.
|
|
|
|
const due = Number(key);
|
|
|
|
// Break out of the loop if the next timer isn't due to fire yet.
|
|
|
|
if (Number(due) > now) {
|
|
|
|
nextTimerDue = due;
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
// Get the list of timers that have this due time, then drop it.
|
|
|
|
const list = dueMap[key];
|
|
|
|
delete dueMap[key];
|
|
|
|
// Fire all the timers in the list.
|
|
|
|
for (const timer of list) {
|
|
|
|
// With the list dropped, the timer is no longer scheduled.
|
|
|
|
timer.scheduled = false;
|
|
|
|
// Place the callback on the microtask queue.
|
|
|
|
Promise.resolve(timer).then(fire);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
// Update the global alarm to go off when the first-up timer that hasn't fired
|
|
|
|
// yet is due.
|
|
|
|
setGlobalTimeout(nextTimerDue, now);
|
|
|
|
}
|
|
|
|
|
|
|
|
function setTimer<Args extends Array<unknown>>(
|
|
|
|
cb: (...args: Args) => void,
|
2018-07-06 11:20:35 -04:00
|
|
|
delay: number,
|
2018-10-02 20:47:40 -04:00
|
|
|
args: Args,
|
|
|
|
repeat: boolean
|
2018-07-06 11:20:35 -04:00
|
|
|
): number {
|
2018-10-02 20:47:40 -04:00
|
|
|
// If any `args` were provided (which is uncommon), bind them to the callback.
|
|
|
|
const callback: () => void = args.length === 0 ? cb : cb.bind(null, ...args);
|
|
|
|
// In the browser, the delay value must be coercable to an integer between 0
|
|
|
|
// and INT32_MAX. Any other value will cause the timer to fire immediately.
|
|
|
|
// We emulate this behavior.
|
|
|
|
const now = getTime();
|
|
|
|
delay = Math.max(0, delay | 0);
|
|
|
|
// Create a new, unscheduled timer object.
|
|
|
|
const timer = {
|
|
|
|
id: nextTimerId++,
|
|
|
|
callback,
|
|
|
|
args,
|
|
|
|
delay,
|
|
|
|
due: now + delay,
|
|
|
|
repeat,
|
|
|
|
scheduled: false
|
|
|
|
};
|
|
|
|
// Register the timer's existence in the id-to-timer map.
|
|
|
|
idMap.set(timer.id, timer);
|
|
|
|
// Schedule the timer in the due table.
|
|
|
|
schedule(timer, now);
|
|
|
|
return timer.id;
|
2018-07-06 11:20:35 -04:00
|
|
|
}
|
|
|
|
|
2018-10-14 16:29:50 -04:00
|
|
|
/** Sets a timer which executes a function once after the timer expires. */
|
2018-10-02 20:47:40 -04:00
|
|
|
export function setTimeout<Args extends Array<unknown>>(
|
|
|
|
cb: (...args: Args) => void,
|
2018-07-06 11:20:35 -04:00
|
|
|
delay: number,
|
2018-10-02 20:47:40 -04:00
|
|
|
...args: Args
|
2018-07-06 11:20:35 -04:00
|
|
|
): number {
|
2018-10-02 20:47:40 -04:00
|
|
|
return setTimer(cb, delay, args, false);
|
2018-07-06 11:20:35 -04:00
|
|
|
}
|
|
|
|
|
2018-10-14 16:29:50 -04:00
|
|
|
/** Repeatedly calls a function , with a fixed time delay between each call. */
|
2018-10-02 20:47:40 -04:00
|
|
|
export function setInterval<Args extends Array<unknown>>(
|
|
|
|
cb: (...args: Args) => void,
|
|
|
|
delay: number,
|
|
|
|
...args: Args
|
|
|
|
): number {
|
|
|
|
return setTimer(cb, delay, args, true);
|
|
|
|
}
|
|
|
|
|
2018-10-14 16:29:50 -04:00
|
|
|
/** Clears a previously set timer by id. */
|
2018-10-02 20:47:40 -04:00
|
|
|
export function clearTimer(id: number): void {
|
|
|
|
const timer = idMap.get(id);
|
|
|
|
if (timer === undefined) {
|
|
|
|
// Timer doesn't exist any more or never existed. This is not an error.
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
// Unschedule the timer if it is currently scheduled, and forget about it.
|
|
|
|
unschedule(timer);
|
|
|
|
idMap.delete(timer.id);
|
2018-07-06 11:20:35 -04:00
|
|
|
}
|