2011-03-10 08:54:52 +00:00
|
|
|
// Copyright Joyent, Inc. and other Node contributors.
|
|
|
|
//
|
|
|
|
// Permission is hereby granted, free of charge, to any person obtaining a
|
|
|
|
// copy of this software and associated documentation files (the
|
|
|
|
// "Software"), to deal in the Software without restriction, including
|
|
|
|
// without limitation the rights to use, copy, modify, merge, publish,
|
|
|
|
// distribute, sublicense, and/or sell copies of the Software, and to permit
|
|
|
|
// persons to whom the Software is furnished to do so, subject to the
|
|
|
|
// following conditions:
|
|
|
|
//
|
|
|
|
// The above copyright notice and this permission notice shall be included
|
|
|
|
// in all copies or substantial portions of the Software.
|
|
|
|
//
|
|
|
|
// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS
|
|
|
|
// OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
|
|
|
|
// MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN
|
|
|
|
// NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM,
|
|
|
|
// DAMAGES OR OTHER 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 SOFTWARE.
|
|
|
|
|
2011-06-08 02:35:50 +00:00
|
|
|
var Timer = process.binding('timer_wrap').Timer;
|
2011-01-18 22:26:32 +00:00
|
|
|
var L = require('_linklist');
|
2011-01-28 00:59:28 +00:00
|
|
|
var assert = require('assert').ok;
|
2010-10-26 18:56:32 +00:00
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
var debug;
|
2011-02-04 17:00:21 +00:00
|
|
|
if (process.env.NODE_DEBUG && /timer/.test(process.env.NODE_DEBUG)) {
|
2010-12-02 04:59:06 +00:00
|
|
|
debug = function() { require('util').error.apply(this, arguments); };
|
|
|
|
} else {
|
|
|
|
debug = function() { };
|
2010-10-26 18:56:32 +00:00
|
|
|
}
|
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
|
2011-01-13 10:09:03 +00:00
|
|
|
// IDLE TIMEOUTS
|
|
|
|
//
|
|
|
|
// Because often many sockets will have the same idle timeout we will not
|
|
|
|
// use one timeout watcher per item. It is too much overhead. Instead
|
|
|
|
// we'll use a single watcher for all sockets with the same timeout value
|
|
|
|
// and a linked list. This technique is described in the libev manual:
|
|
|
|
// http://pod.tst.eu/http://cvs.schmorp.de/libev/ev.pod#Be_smart_about_timeouts
|
|
|
|
|
|
|
|
// Object containing all lists, timers
|
|
|
|
// key = time in milliseconds
|
|
|
|
// value = list
|
|
|
|
var lists = {};
|
2010-10-26 18:56:32 +00:00
|
|
|
|
|
|
|
|
|
|
|
// the main function - creates lists on demand and the watchers associated
|
|
|
|
// with them.
|
2010-12-02 04:59:06 +00:00
|
|
|
function insert(item, msecs) {
|
2010-10-26 19:14:17 +00:00
|
|
|
item._idleStart = new Date();
|
|
|
|
item._idleTimeout = msecs;
|
2010-10-26 18:56:32 +00:00
|
|
|
|
2010-10-26 19:52:31 +00:00
|
|
|
if (msecs < 0) return;
|
2010-10-26 18:56:32 +00:00
|
|
|
|
|
|
|
var list;
|
|
|
|
|
|
|
|
if (lists[msecs]) {
|
|
|
|
list = lists[msecs];
|
|
|
|
} else {
|
|
|
|
list = new Timer();
|
2011-06-08 02:35:50 +00:00
|
|
|
list.start(msecs, 0);
|
|
|
|
|
2011-01-18 22:26:32 +00:00
|
|
|
L.init(list);
|
2010-10-26 18:56:32 +00:00
|
|
|
|
|
|
|
lists[msecs] = list;
|
|
|
|
|
2011-06-08 02:35:50 +00:00
|
|
|
list.ontimeout = function() {
|
2010-10-26 18:56:32 +00:00
|
|
|
debug('timeout callback ' + msecs);
|
2011-07-04 23:31:00 +00:00
|
|
|
|
2010-10-26 18:56:32 +00:00
|
|
|
var now = new Date();
|
2010-12-02 04:59:06 +00:00
|
|
|
debug('now: ' + now);
|
2011-01-13 10:09:03 +00:00
|
|
|
|
2010-10-26 18:56:32 +00:00
|
|
|
var first;
|
2011-01-18 22:26:32 +00:00
|
|
|
while (first = L.peek(list)) {
|
2010-10-26 18:56:32 +00:00
|
|
|
var diff = now - first._idleStart;
|
2011-01-12 00:51:07 +00:00
|
|
|
if (diff + 1 < msecs) {
|
2011-07-04 23:31:00 +00:00
|
|
|
list.start(msecs - diff, 0);
|
2010-12-02 04:59:06 +00:00
|
|
|
debug(msecs + ' list wait because diff is ' + diff);
|
2010-10-26 18:56:32 +00:00
|
|
|
return;
|
|
|
|
} else {
|
2011-01-18 22:26:32 +00:00
|
|
|
L.remove(first);
|
|
|
|
assert(first !== L.peek(list));
|
2010-10-26 18:56:32 +00:00
|
|
|
if (first._onTimeout) first._onTimeout();
|
|
|
|
}
|
|
|
|
}
|
2011-01-13 10:09:03 +00:00
|
|
|
|
2010-10-26 18:56:32 +00:00
|
|
|
debug(msecs + ' list empty');
|
2011-01-18 22:26:32 +00:00
|
|
|
assert(L.isEmpty(list));
|
2011-06-08 02:35:50 +00:00
|
|
|
list.close();
|
|
|
|
delete lists[msecs];
|
2010-10-26 18:56:32 +00:00
|
|
|
};
|
|
|
|
}
|
|
|
|
|
2011-01-18 22:26:32 +00:00
|
|
|
L.append(list, item);
|
|
|
|
assert(!L.isEmpty(list)); // list is not empty
|
2010-10-26 18:56:32 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
var unenroll = exports.unenroll = function(item) {
|
2011-01-18 22:26:32 +00:00
|
|
|
L.remove(item);
|
2010-10-26 18:56:32 +00:00
|
|
|
|
2011-01-13 10:22:09 +00:00
|
|
|
var list = lists[item._idleTimeout];
|
|
|
|
// if empty then stop the watcher
|
|
|
|
debug('unenroll');
|
2011-01-18 22:26:32 +00:00
|
|
|
if (list && L.isEmpty(list)) {
|
2011-01-13 10:22:09 +00:00
|
|
|
debug('unenroll: list empty');
|
2011-06-08 02:35:50 +00:00
|
|
|
list.close();
|
|
|
|
delete lists[item._idleTimeout];
|
2010-10-26 18:56:32 +00:00
|
|
|
}
|
2011-12-22 13:42:20 +00:00
|
|
|
// if active is called later, then we want to make sure not to insert again
|
|
|
|
item._idleTimeout = -1;
|
2010-10-26 18:56:32 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
|
|
|
// Does not start the time, just sets up the members needed.
|
2010-12-02 04:59:06 +00:00
|
|
|
exports.enroll = function(item, msecs) {
|
2010-10-26 19:14:17 +00:00
|
|
|
// if this item was already in a list somewhere
|
2010-10-26 18:56:32 +00:00
|
|
|
// then we should unenroll it from that
|
2010-10-26 19:14:17 +00:00
|
|
|
if (item._idleNext) unenroll(item);
|
2010-10-26 18:56:32 +00:00
|
|
|
|
2010-10-26 19:14:17 +00:00
|
|
|
item._idleTimeout = msecs;
|
2011-01-18 22:26:32 +00:00
|
|
|
L.init(item);
|
2010-10-26 18:56:32 +00:00
|
|
|
};
|
|
|
|
|
2011-01-13 10:22:09 +00:00
|
|
|
|
2010-10-26 19:14:17 +00:00
|
|
|
// call this whenever the item is active (not idle)
|
2010-10-26 18:56:32 +00:00
|
|
|
// it will reset its timeout.
|
2010-12-02 04:59:06 +00:00
|
|
|
exports.active = function(item) {
|
2010-10-26 19:14:17 +00:00
|
|
|
var msecs = item._idleTimeout;
|
2010-10-26 19:52:31 +00:00
|
|
|
if (msecs >= 0) {
|
2010-10-26 18:56:32 +00:00
|
|
|
var list = lists[msecs];
|
2011-07-01 19:01:12 +00:00
|
|
|
if (!list || L.isEmpty(list)) {
|
2010-10-26 19:14:17 +00:00
|
|
|
insert(item, msecs);
|
2010-10-26 18:56:32 +00:00
|
|
|
} else {
|
2010-10-26 19:14:17 +00:00
|
|
|
item._idleStart = new Date();
|
2011-01-18 22:26:32 +00:00
|
|
|
L.append(list, item);
|
2010-10-26 18:56:32 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
};
|
2010-10-26 19:14:17 +00:00
|
|
|
|
|
|
|
|
2010-10-26 19:52:31 +00:00
|
|
|
/*
|
|
|
|
* DOM-style timers
|
|
|
|
*/
|
2010-10-26 19:14:17 +00:00
|
|
|
|
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
exports.setTimeout = function(callback, after) {
|
2011-11-12 12:31:26 +00:00
|
|
|
var timer;
|
2010-10-26 19:14:17 +00:00
|
|
|
|
2010-10-26 19:52:31 +00:00
|
|
|
if (after <= 0) {
|
|
|
|
// Use the slow case for after == 0
|
|
|
|
timer = new Timer();
|
2011-12-22 13:42:20 +00:00
|
|
|
timer._callback = callback;
|
2011-06-08 02:35:50 +00:00
|
|
|
|
2011-11-12 12:31:26 +00:00
|
|
|
if (arguments.length <= 2) {
|
2011-12-18 00:22:22 +00:00
|
|
|
timer._onTimeout = function() {
|
2011-12-22 13:42:20 +00:00
|
|
|
this._callback();
|
|
|
|
this.close();
|
2011-12-18 00:22:22 +00:00
|
|
|
}
|
2011-11-12 12:31:26 +00:00
|
|
|
} else {
|
|
|
|
var args = Array.prototype.slice.call(arguments, 2);
|
|
|
|
timer._onTimeout = function() {
|
2011-12-22 13:42:20 +00:00
|
|
|
this._callback.apply(timer, args);
|
|
|
|
this.close();
|
2011-11-12 12:31:26 +00:00
|
|
|
}
|
2011-06-08 02:35:50 +00:00
|
|
|
}
|
|
|
|
|
2011-11-12 12:31:26 +00:00
|
|
|
timer.ontimeout = timer._onTimeout;
|
2011-06-08 02:35:50 +00:00
|
|
|
timer.start(0, 0);
|
2010-10-26 19:52:31 +00:00
|
|
|
} else {
|
2011-06-08 02:35:50 +00:00
|
|
|
timer = { _idleTimeout: after };
|
2010-10-26 19:52:31 +00:00
|
|
|
timer._idlePrev = timer;
|
|
|
|
timer._idleNext = timer;
|
|
|
|
|
2011-06-08 02:35:50 +00:00
|
|
|
if (arguments.length <= 2) {
|
|
|
|
timer._onTimeout = callback;
|
2010-10-26 19:52:31 +00:00
|
|
|
} else {
|
2011-11-12 12:31:26 +00:00
|
|
|
var args = Array.prototype.slice.call(arguments, 2);
|
2011-06-08 02:35:50 +00:00
|
|
|
timer._onTimeout = function() {
|
|
|
|
callback.apply(timer, args);
|
|
|
|
}
|
2010-10-26 19:52:31 +00:00
|
|
|
}
|
2010-10-26 19:14:17 +00:00
|
|
|
|
2010-10-26 19:52:31 +00:00
|
|
|
exports.active(timer);
|
|
|
|
}
|
2010-10-26 19:14:17 +00:00
|
|
|
|
|
|
|
return timer;
|
|
|
|
};
|
|
|
|
|
2010-10-26 19:52:31 +00:00
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
exports.clearTimeout = function(timer) {
|
2011-06-08 02:35:50 +00:00
|
|
|
if (timer && (timer.ontimeout || timer._onTimeout)) {
|
|
|
|
timer.ontimeout = timer._onTimeout = null;
|
|
|
|
if (timer instanceof Timer) {
|
|
|
|
timer.close(); // for after === 0
|
|
|
|
} else {
|
|
|
|
exports.unenroll(timer);
|
|
|
|
}
|
2010-10-29 07:00:43 +00:00
|
|
|
}
|
2010-10-26 19:52:31 +00:00
|
|
|
};
|
|
|
|
|
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
exports.setInterval = function(callback, repeat) {
|
2010-10-26 19:14:17 +00:00
|
|
|
var timer = new Timer();
|
2010-10-26 19:52:31 +00:00
|
|
|
|
2011-06-08 02:35:50 +00:00
|
|
|
var args = Array.prototype.slice.call(arguments, 2);
|
|
|
|
timer.ontimeout = function() {
|
|
|
|
callback.apply(timer, args);
|
2010-10-26 19:52:31 +00:00
|
|
|
}
|
|
|
|
|
2010-10-26 19:14:17 +00:00
|
|
|
timer.start(repeat, repeat ? repeat : 1);
|
|
|
|
return timer;
|
|
|
|
};
|
|
|
|
|
2010-10-26 19:52:31 +00:00
|
|
|
|
2010-12-02 04:59:06 +00:00
|
|
|
exports.clearInterval = function(timer) {
|
2010-10-26 19:14:17 +00:00
|
|
|
if (timer instanceof Timer) {
|
2011-06-08 02:35:50 +00:00
|
|
|
timer.ontimeout = null;
|
|
|
|
timer.close();
|
2010-10-26 19:14:17 +00:00
|
|
|
}
|
|
|
|
};
|