/
index.js
998 lines (745 loc) · 20.5 KB
/
index.js
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
"use strict";
var fs = require( 'fs' );
var dronosInstance = null;
module.exports.init = function ( config ) {
// should only run one dronos per process
if ( dronosInstance ) {
return dronosInstance;
}
config = {
libDir: './lib',
collectionPrefix: config.collectionPrefix || null,
ensureEntries: config.ensureEntries || [],
deleteEntries: config.deleteEntries || [],
mongoose: config.mongoose || false
};
if ( !config.mongoose ) {
return false;
}
var context = {
options: config
};
if ( typeof context.options.collectionPrefix !== 'string' ) {
context.options.collectionPrefix = "";
}
if ( !Array.isArray( context.options.ensureEntries ) ) {
context.options.ensureEntries = [];
}
context.DronosModel = require( './models/Dronos.js' ).init( {
mongoose: config.mongoose,
prefix: context.options.collectionPrefix
} );
if ( !context.DronosModel ) {
return false;
}
dronosInstance = startUp( context );
return dronosInstance;
};
function startUp( context ) {
var dronos = new Dronos( context );
dronos.ensureEntries();
dronos.deleteEntries();
dronos.run();
return dronos;
}
var Dronos = function ( context ) {
this.context = context;
};
Dronos.prototype.deleteEntries = function () {
var entries = this.context.options.deleteEntries;
for ( var i = 0; i < entries.length; i++ ) {
this._deleteEntry( entries[i] );
}
};
Dronos.prototype.ensureEntries = function () {
var entries = this.context.options.ensureEntries;
for ( var i = 0; i < entries.length; i++ ) {
this.ensureEntry( entries[i] );
}
};
Dronos.prototype.ensureEntry = function ( entry ) {
// using serialization to clone
var template = {
account: null,
name: null,
recurrencePattern: {
minute: null,
hour: null,
dayOfMonth: null,
month: null,
dayOfWeek: null
},
lib: null,
method: null,
processingLimit: null
};
// create default by cloning template, then mixing in the entry
entry = mixin( clone( template ), entry );
if ( !this._verifyDataContainsRequiredFields( template, entry ) ) {
return false;
}
this._ensureChronEntry( entry );
return true;
};
Dronos.prototype._deleteEntry = function ( entry ) {
entry = {
account: entry.account || null,
name: entry.name || null
};
if ( entry.account !== null && entry.name !== null ) {
this.context.DronosModel.remove(
{
account: entry.account,
name: entry.name
}
).exec();
return true;
}
return false;
};
Dronos.prototype._ensureChronEntry = function ( entry ) {
var self = this;
this.context.DronosModel.findOneAndUpdate(
{
account: entry.account,
name: entry.name
},
{
account: entry.account,
name: entry.name,
lastUpdate: new Date(),
repeat: true,
recurrencePattern: {
minute: entry.recurrencePattern.minute,
hour: entry.recurrencePattern.hour,
dayOfMonth: entry.recurrencePattern.dayOfMonth,
month: entry.recurrencePattern.month,
dayOfWeek: entry.recurrencePattern.dayOfWeek
},
lib: entry.lib,
method: entry.method,
processingLimit: entry.processingLimit,
params: ( entry.params ? entry.params : null )
},
{
new: true,
upsert: true
},
function ( err, data ) {
if ( data && data._id ) {
var threshold = new Date();
threshold.setSeconds( threshold.getSeconds() + 15 );
self.context.DronosModel.update(
{
_id: data._id,
$or: [
{
nextRun: {
$gt: threshold
}
},
{
nextRun: {
$exists: false
}
}
]
},
{
nextRun: _getNextRunTime( entry.recurrencePattern ),
lastUpdate: new Date()
}
).exec();
}
}
);
};
Dronos.prototype._verifyDataContainsRequiredFields = function ( template, data, path ) {
if ( !path ) {
path = "";
}
for ( var field in template ) {
if ( template.hasOwnProperty( field ) ) {
var val = template[field];
// check for scalar in template
if ( val === null ) {
if ( typeof data[field] === 'undefined' || data[field] === null ) {
return false;
}
}
else if ( Object.isObject( val ) ) {
// data not an object, so don't bother recurse
if ( !Object.isObject( data[field] ) ) {
return false;
}
// recurse
if ( !this._verifyDataContainsRequiredFields( val, data[field], path + field + "." ) ) {
return false;
}
}
else {
return false;
}
}
}
return true;
};
Dronos.prototype.run = function () {
//console.log( process.pid, 'Dronos: start running', new Date().toISOString() );
var self = this;
this.context.runningIds = [];
this._resetBrokenEntries();
// run entries, until no more are ready for the current minute, then sleep
this._executeEntries( function () {
// make sure run gets called again
self._nextRunTimeout();
} );
};
Dronos.prototype._resetBrokenEntries = function () {
var threshold = new Date();
// no process should execute for more than 15 seconds, so if it still has processing count above a 30 second threshold, clear stuff
threshold.setSeconds( threshold.getSeconds() - 45 );
this.context.DronosModel.update(
{
$or: [
{
nextRun: { $lt: threshold }, // if entry should have finished, but process count still high, assume node process failed to decrement
processingCount: { $gt: 0 }
},
{
lastUpdate: { $lt: threshold }, // if entry last update was more than 30 seconds ago, but processing count still up, decrement
processingCount: { $gt: 0 }
},
{
processingCount: { $lt: 0 } // processing count should never be below 0. can't have negative number of processing working
}
]
},
{
$set: {
processingCount: 0
},
lastUpdate: new Date()
},
{
multi: true
}
).exec( function ( err, count ) {
if ( count ) {
console.log( process.pid, 'Dronos: reset broken entries', count );
}
} );
};
Dronos.prototype._executeEntries = function ( callback, time ) {
var self = this;
if ( !time ) {
time = new Date();
// we run right on the minute, and servers may be off in
// time by a couple seconds, but less than 60 seconds. this
// makes sure we aren't missing items for the current second
// if this server's time is actually a little slow
time.setSeconds( time.getSeconds() + 10 );
}
this.context.DronosModel.findOneAndUpdate(
{
_id: { $nin: this.context.runningIds },
nextRun: { $lte: time }, // must be ready to run
$or: [
// must have less than max limit processes running, or unlimited processing limit
{
processingLimit: 0
},
{
$where: 'this.processingCount < this.processingLimit'
},
{
processingCount: {
$exists: false
}
}
]
},
{
$inc: { processingCount: 1 },
lastUpdate: new Date()
},
{
sort: {
nextRun: 1, // ones waiting longest get priority
processingCount: 1 // if tied for longest waiting, one with fewest running gets priority
},
new: true
},
function ( err, data ) {
// no more entries
if ( !data ) {
process.nextTick( callback );
return;
}
data = data.toObject ? data.toObject() : {};
var entry = {
_id: data._id || null,
lib: data.lib || null,
method: data.method || null,
params: data.params || null
};
// no entry, we are done
if ( entry._id === null ) {
process.nextTick( callback );
}
else {
// make sure we don't run multiple instances of the same entry
self.context.runningIds.push( entry._id );
// start the entry running
self._executeEntry( entry );
// break up execution a little
process.nextTick( function () {
// if we just ran an entry, we always look for one more runable entry and forward the callback down
self._executeEntries( callback, time );
} );
}
}
);
};
Dronos.prototype._executeEntry = function ( entry, callback ) {
var lib = (process.cwd() + '/' + this.context.options.libDir + '/' + entry.lib).replace( /\/+/g, '/' );
var method = entry.method;
var params = entry.params;
if ( !lib || !method ) {
return;
}
var self = this;
var schedulerUtils = {
nextRunTime: _getNextRunTime,
incrementTime: _incrementTime
};
var doneCalled = false;
var doneTimeout = null;
var done = function () {
if ( doneTimeout ) {
clearTimeout( doneTimeout );
}
if ( doneCalled ) {
console.error( process.pid, 'Dronos: done already called for execution of lib', entry.lib, method, new Date().toISOString() );
return;
}
doneCalled = true;
process.nextTick( function () {
if ( entry._id ) {
if ( entry.repeat ) {
// build update object
var update = {
$inc: { processingCount: -1 },
lastRun: new Date(),
lastUpdate: new Date()
};
if ( entry.recurrencePattern ) {
update.nextRun = _getNextRunTime( entry.recurrencePattern );
}
self.context.DronosModel.findByIdAndUpdate( entry._id, update, { new: true }, function () {
if ( typeof callback === 'function' ) {
process.nextTick( callback );
}
} );
}
else {
self.context.DronosModel.findByIdAndRemove( entry._id, function () {
if ( typeof callback === 'function' ) {
process.nextTick( callback );
}
} );
}
}
} );
};
fs.exists( lib, function ( exists ) {
if ( !exists ) {
console.error( 'missing lib', entry.lib );
done();
return;
}
var module = null;
try {
module = require( lib );
}
catch ( e ) {
console.error( 'exception lib', entry.lib, e );
done();
return;
}
if ( !module || typeof module[method] !== 'function' ) {
console.error( 'missing function', entry.lib, method );
done();
return;
}
process.nextTick( function () {
//console.log( process.pid, 'Dronos: executing', entry.lib + "." + method, new Date().toISOString() );
module[method]( params, done, schedulerUtils );
} );
} );
// triggered event code has 15 seconds to call done, before we consider it auto-done
doneTimeout = setTimeout( function () {
console.error( process.pid, 'Dronos: lib.method failed to call done in 15 seconds', entry.lib, method );
done();
}, 15000 );
};
Dronos.prototype._nextRunTimeout = function () {
var now = new Date();
var offset = clone( now );
var self = this;
var seconds = offset.getSeconds() + 1;
var interval = 30; // number of seconds between cron interval check
// calculate next interval in constant time
var secondsOffset = interval - (seconds % interval);
if ( secondsOffset >= interval ) {
secondsOffset = 0;
}
offset.setSeconds( seconds + secondsOffset );
offset.setMilliseconds( 0 );
this.context.runTimeout = setTimeout( function () {
self.context.runTimeout = null;
self.run();
}, offset.getTime() - now.getTime() );
// console.log( process.pid, 'Dronos: done running', new Date().toISOString() );
// console.log( process.pid, 'Dronos: nextRun', offset.toISOString() );
};
function _getNextRunTime( pattern ) {
return _incrementTime( new Date(), pattern );
}
function _incrementTime( time, pattern ) {
pattern = clone( pattern );
_parseRecurrencePattern( pattern );
if ( pattern.dayOfMonth.type !== 'all' && pattern.dayOfWeek.type !== 'all' ) {
var dOM = _incrementTimeDayOfMonth( time, pattern );
var dOW = _incrementTimeDayOfWeek( time, pattern );
if ( dOM.getMilliseconds() < dOW.getMilliseconds() ) {
return dOM;
}
else {
return dOW;
}
}
else {
return _realIncrementTime( time, pattern );
}
}
function _incrementTimeDayOfMonth( time, pattern ) {
pattern = clone( pattern );
pattern.dayOfWeek = { type: 'all' };
return _realIncrementTime( time, pattern );
}
function _incrementTimeDayOfWeek( time, pattern ) {
pattern = clone( pattern );
pattern.dayOfMonth = { type: 'all' };
return _realIncrementTime( time, pattern );
}
function _realIncrementTime( time, pattern ) {
var newTime = clone( time );
var secondsMilliSeconds = newTime.getSeconds() + newTime.getMilliseconds();
// we always start at the top of the minute
newTime.setSeconds( 0 );
newTime.setMilliseconds( 0 );
// round up to nearest minute
if ( secondsMilliSeconds > 0 ) {
newTime.setMinutes( newTime.getMinutes() + 1 );
}
_incrementField( newTime, 'FullYear', pattern.year );
_incrementField( newTime, 'Month', pattern.month );
// these are mutually exclusive at this level of processing
if ( pattern.dayOfMonth.type !== 'all' ) {
_incrementField( newTime, 'Date', pattern.dayOfMonth );
}
else if ( pattern.dayOfWeek.type !== 'all' ) {
_incrementField( newTime, 'Day', pattern.dayOfWeek );
}
_incrementField( newTime, 'Hours', pattern.hour );
_incrementField( newTime, 'Minutes', pattern.minute );
return newTime;
}
function _incrementField( time, field, pattern ) {
var currentValue = time['get' + field]();
var newValue = _calculateNewValue( time, field, pattern );
// if newValue is not an increment, nothing to do
if ( newValue <= currentValue ) {
return;
}
// clamp all units of time less than the current unit
switch ( field ) {
case 'FullYear':
time.setMonth( 0 );
/* falls through */
case 'Month':
time.setDate( 1 );
/* falls through */
case 'Day': // dayOfWeek
case 'Date': // dayOfMonth
time.setHours( 0 );
/* falls through */
case 'Hours':
time.setMinutes( 0 );
}
// convert day of week value to day of month
if ( field === 'Day' ) {
field = 'Date';
newValue = time.getDate() + _convertDayOfWeekOffsetToDateOffset( currentValue, newValue );
}
// apply increment to current field
time['set' + field]( newValue );
}
function _convertDayOfWeekOffsetToDateOffset( currentValue, newValue ) {
// no overflow, so its just the straight distance forward from currentValue to newValue
if ( newValue >= currentValue ) {
return newValue - currentValue;
}
// we overflowed, so calculate days until early day in next week
return 7 - currentValue + newValue;
}
function _calculateNewValue( time, field, pattern ) {
var type = pattern.type;
var currentValue = time['get' + field]();
var newValue = currentValue; // default is for no value to change, such as 'all' type
// year doesn't overflow
if ( field === 'FullYear' ) {
return newValue;
}
// determine the minimum and maximum possible values for the current field
var min = 0;
var max = null;
switch ( field ) {
case 'Month':
max = 11;
break;
case 'Day': // dayOfWeek
max = 6;
break;
case 'Date': // dayOfMonth
min = 1;
max = _lastDayOfMonth( time );
break;
case 'Hours':
max = 23;
break;
case 'Minutes':
max = 59;
break;
}
// months are stored in Date as ints 0-11, but for humans, we think of them as jan=1, mar=3, etc. so we convert to 1-12 scale for calculations
if ( field === 'Month' ) {
min++;
max++;
currentValue++;
newValue++;
}
// handle last day of the time period for given field
if ( type === 'last' ) {
if ( field !== 'FullYear' ) { // year doesn't support last, unless you happen to know the year the earth will end.
newValue = max;
}
}
// handle literal values
else if ( type === 'literals' ) {
newValue = _nextLiteral( pattern.parts, currentValue );
}
// handle modulus
else if ( type === 'modulus' && field !== 'FullYear' ) {
newValue = _nextModulus( min, max, currentValue, pattern.mod );
}
newValue = _handleOverflow( min, max, currentValue, newValue );
// undo month offsets used for calculations
if ( field === 'Month' ) {
newValue--;
}
return newValue;
}
function _handleOverflow( min, max, currentValue, newValue ) {
// no overflow
if ( newValue >= currentValue ) {
return newValue;
}
// overflow, calculate offset
return max + newValue - min + 1;
}
function _nextLiteral( literals, current ) {
for ( var i = 0; i < literals.length; i++ ) {
if ( literals[i] >= current ) {
return literals[i];
}
}
return literals[0];
}
function _nextModulus( start, end, current, mod ) {
var originalCurrent = current;
while ( current <= end ) {
if ( current % mod === 0 ) {
return current;
}
current++;
}
current = start;
while ( current < originalCurrent ) {
if ( current % mod === 0 ) {
return current;
}
current++;
}
return null;
}
function _lastDayOfMonth( time ) {
var value = null;
switch ( time.getMonth() + 1 ) { // we don't need the +1, it just makes it easier to understand the cases, since we already think of jan = 1, mar = 3, etc.
case 1:
case 3:
case 5:
case 7:
case 8:
case 10:
case 12:
value = 31;
break;
case 4:
case 6:
case 9:
case 11:
value = 30;
break;
case 2:
value = 28 + (time.getFullYear % 4 === 0 ? 1 : 0); // account for leap year
break;
}
return value;
}
function _parseRecurrencePattern( recurrencePattern ) {
var fields = ['minute', 'hour', 'dayOfMonth', 'dayOfWeek', 'month', 'year'];
for ( var i = 0; i < fields.length; i++ ) {
if ( recurrencePattern.hasOwnProperty( fields[i] ) ) {
recurrencePattern[fields[i]] = _parseRecurrencePatternEntry( recurrencePattern[fields[i]] );
}
}
}
function _parseRecurrencePatternEntry( entry ) {
// used throughout function
var matches = null;
// check for meta "last" indicator
if ( entry.match( /^L$/ ) ) {
return {
type: 'last'
};
}
// check for literal exact numbers
if ( entry.match( /^[0-9,\-]+$/ ) ) {
var split = entry.split( /,/ );
var parts = [];
// handle comma separation
for ( var i = 0; i < split.length; i++ ) {
// handle single value
if ( split[i].match( /^[0-9]+$/ ) ) {
parts.push( Math.floor( split[i] ) );
}
// handle range
else {
matches = split[i].match( /^([0-9]+)-([0-9]+)$/ );
if ( matches && matches.length > 0 ) {
var start = Math.min( matches[1], matches[2] );
var end = Math.max( matches[1], matches[2] );
for ( ; start <= end; start++ ) {
parts.push( start );
}
}
}
}
// see if there were valid combination of numbers and commas
if ( parts.length > 0 ) {
return {
type: "literals",
parts: parts
};
}
}
// check for modulus pattern
matches = entry.match( /^\*\/([0-9]+)$/ );
if ( matches && matches.length > 1 ) {
return {
type: "modulus",
mod: Math.min( Math.floor( matches[1] ), 60 ) // modulus limited to 60 because of the units where modulus makes sense (minutes, hours, dayOfMonth), 60 is the highest modulus that doesn't clamp to 0.
};
}
// default to * if nothing else matches
return {
type: "all"
};
}
function isObject( thing ) {
return typeof thing === 'object' && !Array.isArray( thing ) && thing !== null;
}
function clone( thing ) {
var target = null;
var type = typeof thing;
if ( thing === undefined ) {
target = undefined;
}
else if ( thing === null ) {
target = null;
}
else if ( type === 'string' || type === 'number' || type === 'boolean' ) {
target = thing;
}
else if ( thing instanceof Date ) {
target = new Date( thing.toISOString() );
}
else if ( isObject( thing ) || Array.isArray( thing ) ) {
target = JSON.parse( JSON.stringify( thing ) ); // probably a slightly more efficient way to do thing, but thing is ok for now
}
else { // functions, etc. not clonable yet
target = undefined;
}
return target;
}
function mixin() {
var child = arguments[0];
// Handle case when target is a string or something (possible in deep copy)
if ( typeof child !== "object" && typeof child !== 'function' ) {
child = {};
}
// handle arbitrary number of mixins. precedence is from last to first item passed in.
for ( var i = 1; i < arguments.length; i++ ) {
var parent = arguments[i];
if ( !parent || (!Array.isArray( parent ) && !isObject( parent ) ) ) {
continue;
}
// Extend the base object
for ( var name in parent ) {
// don't copy parent stuffs
if ( parent.hasOwnProperty( name ) ) {
var target = child[ name ];
var source = parent[ name ];
// Prevent never-ending loop
if ( child === source ) {
continue;
}
// if target exists and is an array...
if ( Array.isArray( target ) ) {
if ( Array.isArray( source ) ) {
// ...merge source array into target array
for ( var j = 0; j < source.length; j++ ) {
if ( typeof child[ name ][j] === 'object' ) {
child[ name ][j] = mixin( child[ name ][j], source[j] );
}
else {
child[ name ][j] = source[j];
}
}
}
}
// if target is an object, try to mixin source
else if ( isObject( target ) ) {
mixin( target, source );
}
// otherwise, target becomes source
else {
child[ name ] = source;
}
}
}
}
return child;
}