-
Notifications
You must be signed in to change notification settings - Fork 1.4k
/
DateMath.cpp
1054 lines (916 loc) · 39.7 KB
/
DateMath.cpp
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
998
999
1000
/*
* Copyright (C) 1999-2000 Harri Porten (porten@kde.org)
* Copyright (C) 2006-2019 Apple Inc. All rights reserved.
* Copyright (C) 2009 Google Inc. All rights reserved.
* Copyright (C) 2007-2009 Torch Mobile, Inc.
* Copyright (C) 2010 &yet, LLC. (nate@andyet.net)
*
* The Original Code is Mozilla Communicator client code, released
* March 31, 1998.
*
* The Initial Developer of the Original Code is
* Netscape Communications Corporation.
* Portions created by the Initial Developer are Copyright (C) 1998
* the Initial Developer. All Rights Reserved.
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library 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
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this library; if not, write to the Free Software
* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA
*
* Alternatively, the contents of this file may be used under the terms
* of either the Mozilla Public License Version 1.1, found at
* http://www.mozilla.org/MPL/ (the "MPL") or the GNU General Public
* License Version 2.0, found at http://www.fsf.org/copyleft/gpl.html
* (the "GPL"), in which case the provisions of the MPL or the GPL are
* applicable instead of those above. If you wish to allow use of your
* version of this file only under the terms of one of those two
* licenses (the MPL or the GPL) and not to allow others to use your
* version of this file under the LGPL, indicate your decision by
* deletingthe provisions above and replace them with the notice and
* other provisions required by the MPL or the GPL, as the case may be.
* If you do not delete the provisions above, a recipient may use your
* version of this file under any of the LGPL, the MPL or the GPL.
* Copyright 2006-2008 the V8 project authors. All rights reserved.
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are
* met:
*
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above
* copyright notice, this list of conditions and the following
* disclaimer in the documentation and/or other materials provided
* with the distribution.
* * Neither the name of Google Inc. nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include <wtf/DateMath.h>
#include <algorithm>
#include <limits>
#include <stdint.h>
#include <time.h>
#include <unicode/ucal.h>
#include <wtf/Assertions.h>
#include <wtf/ASCIICType.h>
#include <wtf/Language.h>
#include <wtf/NeverDestroyed.h>
#include <wtf/ThreadSpecific.h>
#include <wtf/text/StringBuilder.h>
#include <wtf/unicode/UTF8Conversion.h>
#include <wtf/unicode/icu/ICUHelpers.h>
#if OS(WINDOWS)
#include <windows.h>
#endif
namespace WTF {
static Lock innerTimeZoneOverrideLock;
static Vector<UChar>& innerTimeZoneOverride() WTF_REQUIRES_LOCK(innerTimeZoneOverrideLock)
{
static NeverDestroyed<Vector<UChar>> timeZoneOverride;
return timeZoneOverride;
}
/* Constants */
const std::array<ASCIILiteral, 7> weekdayName { "Mon"_s, "Tue"_s, "Wed"_s, "Thu"_s, "Fri"_s, "Sat"_s, "Sun"_s };
const std::array<ASCIILiteral, 12> monthName { "Jan"_s, "Feb"_s, "Mar"_s, "Apr"_s, "May"_s, "Jun"_s, "Jul"_s, "Aug"_s, "Sep"_s, "Oct"_s, "Nov"_s, "Dec"_s };
const std::array<ASCIILiteral, 12> monthFullName { "January"_s, "February"_s, "March"_s, "April"_s, "May"_s, "June"_s, "July"_s, "August"_s, "September"_s, "October"_s, "November"_s, "December"_s };
// Day of year for the first day of each month, where index 0 is January, and day 0 is January 1.
// First for non-leap years, then for leap years.
const std::array<std::array<int, 12>, 2> firstDayOfMonth {
std::array<int, 12> { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 },
std::array<int, 12> { 0, 31, 60, 91, 121, 152, 182, 213, 244, 274, 305, 335 }
};
const std::array<int8_t, 12> daysInMonths {
31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31
};
#if !OS(WINDOWS) || HAVE(TM_GMTOFF)
static inline void getLocalTime(const time_t* localTime, struct tm* localTM)
{
#if HAVE(LOCALTIME_R)
localtime_r(localTime, localTM);
#else
localtime_s(localTime, localTM);
#endif
}
#endif
static void appendTwoDigitNumber(StringBuilder& builder, int number)
{
ASSERT(number >= 0);
ASSERT(number < 100);
builder.append(static_cast<LChar>('0' + number / 10));
builder.append(static_cast<LChar>('0' + number % 10));
}
static inline double msToMilliseconds(double ms)
{
double result = fmod(ms, msPerDay);
if (result < 0)
result += msPerDay;
return result;
}
// There is a hard limit at 2038 that we currently do not have a workaround
// for (rdar://problem/5052975).
static inline int maximumYearForDST()
{
return 2037;
}
static inline int minimumYearForDST()
{
// Because of the 2038 issue (see maximumYearForDST) if the current year is
// greater than the max year minus 27 (2010), we want to use the max year
// minus 27 instead, to ensure there is a range of 28 years that all years
// can map to.
return std::min(msToYear(jsCurrentTime()), maximumYearForDST() - 27) ;
}
/*
* Find an equivalent year for the one given, where equivalence is deterined by
* the two years having the same leapness and the first day of the year, falling
* on the same day of the week.
*
* This function returns a year between this current year and 2037, however this
* function will potentially return incorrect results if the current year is after
* 2010, (rdar://problem/5052975), if the year passed in is before 1900 or after
* 2100, (rdar://problem/5055038).
*/
int equivalentYearForDST(int year)
{
// It is ok if the cached year is not the current year as long as the rules
// for DST did not change between the two years; if they did the app would need
// to be restarted.
static int minYear = minimumYearForDST();
int maxYear = maximumYearForDST();
int difference;
if (year > maxYear)
difference = minYear - year;
else if (year < minYear)
difference = maxYear - year;
else
return year;
int quotient = difference / 28;
int product = (quotient) * 28;
year += product;
return year;
}
static int32_t calculateUTCOffset()
{
#if OS(WINDOWS)
TIME_ZONE_INFORMATION timeZoneInformation;
DWORD rc = 0;
SYSTEMTIME systemTime;
::GetSystemTime(&systemTime);
rc = ::GetTimeZoneInformationForYear(systemTime.wYear, nullptr, &timeZoneInformation);
if (rc == TIME_ZONE_ID_INVALID)
return 0;
int32_t bias = timeZoneInformation.Bias;
if (rc == TIME_ZONE_ID_DAYLIGHT)
bias += timeZoneInformation.DaylightBias;
else if (rc == TIME_ZONE_ID_STANDARD || rc == TIME_ZONE_ID_UNKNOWN)
bias += timeZoneInformation.StandardBias;
return -bias * 60 * 1000;
#else
time_t localTime = time(0);
tm localt;
getLocalTime(&localTime, &localt);
// Get the difference between this time zone and UTC on the 1st of January of this year.
localt.tm_sec = 0;
localt.tm_min = 0;
localt.tm_hour = 0;
localt.tm_mday = 1;
localt.tm_mon = 0;
// Not setting localt.tm_year!
localt.tm_wday = 0;
localt.tm_yday = 0;
localt.tm_isdst = 0;
#if HAVE(TM_GMTOFF)
localt.tm_gmtoff = 0;
#endif
#if HAVE(TM_ZONE)
localt.tm_zone = 0;
#endif
#if HAVE(TIMEGM)
time_t utcOffset = timegm(&localt) - mktime(&localt);
#else
// Using a canned date of 01/01/2019 on platforms with weaker date-handling foo.
localt.tm_year = 119;
time_t utcOffset = 1546300800 - mktime(&localt);
#endif
return static_cast<int32_t>(utcOffset * 1000);
#endif
}
#if !HAVE(TM_GMTOFF)
#if OS(WINDOWS)
// Code taken from <https://learn.microsoft.com/en-us/windows/win32/sysinfo/converting-a-time-t-value-to-a-file-time>
static void UnixTimeToFileTime(time_t t, LPFILETIME pft)
{
ULARGE_INTEGER timeValue;
timeValue.QuadPart = (t * 10000000LL) + 116444736000000000LL;
pft->dwLowDateTime = timeValue.LowPart;
pft->dwHighDateTime = timeValue.HighPart;
}
#endif
/*
* Get the DST offset for the time passed in.
*/
static double calculateDSTOffset(time_t localTime, double utcOffset)
{
// input is UTC so we have to shift back to local time to determine DST thus the + getUTCOffset()
double offsetTime = (localTime * msPerSecond) + utcOffset;
// Offset from UTC but doesn't include DST obviously
int offsetHour = msToHours(offsetTime);
int offsetMinute = msToMinutes(offsetTime);
#if OS(WINDOWS)
FILETIME utcFileTime;
UnixTimeToFileTime(localTime, &utcFileTime);
SYSTEMTIME utcSystemTime, localSystemTime;
if (!::FileTimeToSystemTime(&utcFileTime, &utcSystemTime))
return 0;
if (!::SystemTimeToTzSpecificLocalTime(nullptr, &utcSystemTime, &localSystemTime))
return 0;
double diff = ((localSystemTime.wHour - offsetHour) * secondsPerHour) + ((localSystemTime.wMinute - offsetMinute) * 60);
#else
tm localTM;
getLocalTime(&localTime, &localTM);
double diff = ((localTM.tm_hour - offsetHour) * secondsPerHour) + ((localTM.tm_min - offsetMinute) * 60);
#endif
if (diff < 0)
diff += secondsPerDay;
return (diff * msPerSecond);
}
#endif
// Returns combined offset in millisecond (UTC + DST).
LocalTimeOffset calculateLocalTimeOffset(double ms, TimeType inputTimeType)
{
#if HAVE(TM_GMTOFF)
double localToUTCTimeOffset = inputTimeType == LocalTime ? calculateUTCOffset() : 0;
#else
double localToUTCTimeOffset = calculateUTCOffset();
#endif
if (inputTimeType == LocalTime)
ms -= localToUTCTimeOffset;
// On Mac OS X, the call to localtime (see calculateDSTOffset) will return historically accurate
// DST information (e.g. New Zealand did not have DST from 1946 to 1974) however the JavaScript
// standard explicitly dictates that historical information should not be considered when
// determining DST. For this reason we shift away from years that localtime can handle but would
// return historically accurate information.
int year = msToYear(ms);
int equivalentYear = equivalentYearForDST(year);
if (year != equivalentYear) {
bool leapYear = isLeapYear(year);
int dayInYearLocal = dayInYear(ms, year);
int dayInMonth = dayInMonthFromDayInYear(dayInYearLocal, leapYear);
int month = monthFromDayInYear(dayInYearLocal, leapYear);
double day = dateToDaysFrom1970(equivalentYear, month, dayInMonth);
ms = (day * msPerDay) + msToMilliseconds(ms);
}
double localTimeSeconds = ms / msPerSecond;
if (localTimeSeconds > maxUnixTime)
localTimeSeconds = maxUnixTime;
else if (localTimeSeconds < 0) // Go ahead a day to make localtime work (does not work with 0).
localTimeSeconds += secondsPerDay;
// FIXME: time_t has a potential problem in 2038.
time_t localTime = static_cast<time_t>(localTimeSeconds);
#if HAVE(TM_GMTOFF)
tm localTM;
getLocalTime(&localTime, &localTM);
return LocalTimeOffset(localTM.tm_isdst, localTM.tm_gmtoff * msPerSecond);
#else
double dstOffset = calculateDSTOffset(localTime, localToUTCTimeOffset);
return LocalTimeOffset(dstOffset, localToUTCTimeOffset + dstOffset);
#endif
}
void initializeDates()
{
#if ASSERT_ENABLED
static bool alreadyInitialized;
ASSERT(!alreadyInitialized);
alreadyInitialized = true;
#endif
equivalentYearForDST(2000); // Need to call once to initialize a static used in this function.
}
static inline double ymdhmsToMilliseconds(int year, long mon, long day, long hour, long minute, long second, double milliseconds)
{
int mday = firstDayOfMonth[isLeapYear(year)][mon - 1];
double ydays = daysFrom1970ToYear(year);
double dateMilliseconds = milliseconds + second * msPerSecond + minute * (secondsPerMinute * msPerSecond) + hour * (secondsPerHour * msPerSecond) + (mday + day - 1 + ydays) * (secondsPerDay * msPerSecond);
// Clamp to EcmaScript standard (ecma262/#sec-time-values-and-time-range) of
// +/- 100,000,000 days from 01 January, 1970.
if (dateMilliseconds < -8640000000000000.0 || dateMilliseconds > 8640000000000000.0)
return std::numeric_limits<double>::quiet_NaN();
return dateMilliseconds;
}
// We follow the recommendation of RFC 2822 to consider all
// obsolete time zones not listed here equivalent to "-0000".
static constexpr struct KnownZone {
ASCIILiteral tzName;
int tzOffset;
} knownZones[] = {
{ "ut"_s, 0 },
{ "gmt"_s, 0 },
{ "est"_s, -300 },
{ "edt"_s, -240 },
{ "cst"_s, -360 },
{ "cdt"_s, -300 },
{ "mst"_s, -420 },
{ "mdt"_s, -360 },
{ "pst"_s, -480 },
{ "pdt"_s, -420 }
};
inline static void skipSpacesAndComments(std::span<const LChar>& s)
{
int nesting = 0;
while (!s.empty()) {
auto ch = s.front();
if (!isUnicodeCompatibleASCIIWhitespace(ch)) {
if (ch == '(')
nesting++;
else if (ch == ')' && nesting > 0)
nesting--;
else if (nesting == 0)
break;
}
s = s.subspan(1);
}
}
// returns 0-11 (Jan-Dec); -1 on failure
static int findMonth(std::span<const LChar> monthStr)
{
if (monthStr.size() < 3)
return -1;
std::array<char, 4> needle;
for (unsigned i = 0; i < 3; ++i)
needle[i] = static_cast<char>(toASCIILower(monthStr[i]));
needle[3] = '\0';
const char* haystack = "janfebmaraprmayjunjulaugsepoctnovdec";
const char* str = strstr(haystack, needle.data());
if (str) {
int position = static_cast<int>(str - haystack);
if (position % 3 == 0)
return position / 3;
}
return -1;
}
static bool parseInt(std::span<const LChar>& string, int base, int* result)
{
char* stopPosition;
long longResult = strtol(byteCast<char>(string.data()), &stopPosition, base);
// Avoid the use of errno as it is not available on Windows CE
if (byteCast<char>(string.data()) == stopPosition || longResult <= std::numeric_limits<int>::min() || longResult >= std::numeric_limits<int>::max())
return false;
string = string.subspan(stopPosition - byteCast<char>(string.data()));
*result = longResult;
return true;
}
static bool parseLong(std::span<const LChar>& string, int base, long* result)
{
char* stopPosition;
*result = strtol(byteCast<char>(string.data()), &stopPosition, base);
// Avoid the use of errno as it is not available on Windows CE
if (byteCast<char>(string.data()) == stopPosition || *result == std::numeric_limits<long>::min() || *result == std::numeric_limits<long>::max())
return false;
string = string.subspan(stopPosition - byteCast<char>(string.data()));
return true;
}
// Parses a date with the format YYYY[-MM[-DD]].
// Year parsing is lenient, allows any number of digits, and +/-.
// Returns 0 if a parse error occurs, else returns the end of the parsed portion of the string.
static bool parseES5DatePortion(std::span<const LChar>& currentPosition, int& year, long& month, long& day)
{
// This is a bit more lenient on the year string than ES5 specifies:
// instead of restricting to 4 digits (or 6 digits with mandatory +/-),
// it accepts any integer value. Consider this an implementation fallback.
bool hasNegativeYear = !currentPosition.empty() && currentPosition.front() == '-';
if (!parseInt(currentPosition, 10, &year))
return false;
if (!year && hasNegativeYear)
return false;
// Check for presence of -MM portion.
if (currentPosition.empty() || currentPosition.front() != '-')
return true;
currentPosition = currentPosition.subspan(1);
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
auto postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &month))
return false;
if ((postParsePosition.data() - currentPosition.data()) != 2)
return false;
currentPosition = postParsePosition;
// Check for presence of -DD portion.
if (currentPosition.empty() || currentPosition.front() != '-')
return true;
currentPosition = currentPosition.subspan(1);
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &day))
return false;
if ((postParsePosition.data() - currentPosition.data()) != 2)
return false;
currentPosition = postParsePosition;
return true;
}
// Parses a time with the format HH:mm[:ss[.sss]][Z|(+|-)(00:00|0000|00)].
// Fractional seconds parsing is lenient, allows any number of digits.
// Returns 0 if a parse error occurs, else returns the end of the parsed portion of the string.
static bool parseES5TimePortion(std::span<const LChar>& currentPosition, long& hours, long& minutes, long& seconds, double& milliseconds, bool& isLocalTime, long& timeZoneSeconds)
{
isLocalTime = false;
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
auto postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &hours))
return false;
if (postParsePosition.empty() || postParsePosition.front() != ':' || (postParsePosition.data() - currentPosition.data()) != 2)
return false;
currentPosition = postParsePosition.subspan(1);
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &minutes))
return false;
if ((postParsePosition.data() - currentPosition.data()) != 2)
return false;
currentPosition = postParsePosition;
// Seconds are optional.
if (!currentPosition.empty() && currentPosition.front() == ':') {
currentPosition = currentPosition.subspan(1);
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &seconds))
return false;
if ((postParsePosition.data() - currentPosition.data()) != 2)
return false;
if (!postParsePosition.empty() && postParsePosition.front() == '.') {
currentPosition = postParsePosition.subspan(1);
// In ECMA-262-5 it's a bit unclear if '.' can be present without milliseconds, but
// a reasonable interpretation guided by the given examples and RFC 3339 says "no".
// We check the next character to avoid reading +/- timezone hours after an invalid decimal.
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
// We are more lenient than ES5 by accepting more or less than 3 fraction digits.
long fracSeconds;
postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &fracSeconds))
return false;
long numFracDigits = postParsePosition.data() - currentPosition.data();
milliseconds = fracSeconds * pow(10.0, static_cast<double>(-numFracDigits + 3));
}
currentPosition = postParsePosition;
}
if (!currentPosition.empty() && currentPosition.front() == 'Z') {
currentPosition = currentPosition.subspan(1);
return true;
}
// Parse (+|-)(00:00|0000|00).
bool tzNegative;
if (!currentPosition.empty() && currentPosition.front() == '-')
tzNegative = true;
else if (!currentPosition.empty() && currentPosition.front() == '+')
tzNegative = false;
else {
isLocalTime = true;
return true;
}
currentPosition = currentPosition.subspan(1);
long tzHours = 0;
long tzHoursAbs = 0;
long tzMinutes = 0;
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &tzHours))
return false;
if (postParsePosition.empty() || postParsePosition.front() != ':') {
if ((postParsePosition.data() - currentPosition.data()) == 2) {
// "00" case.
tzHoursAbs = labs(tzHours);
} else if ((postParsePosition.data() - currentPosition.data()) == 4) {
// "0000" case.
tzHoursAbs = labs(tzHours);
tzMinutes = tzHoursAbs % 100;
tzHoursAbs = tzHoursAbs / 100;
} else
return false;
} else {
// "00:00" case.
if ((postParsePosition.data() - currentPosition.data()) != 2)
return false;
tzHoursAbs = labs(tzHours);
currentPosition = postParsePosition.subspan(1); // Skip ":".
if (currentPosition.empty() || !isASCIIDigit(currentPosition.front()))
return false;
postParsePosition = currentPosition;
if (!parseLong(postParsePosition, 10, &tzMinutes))
return false;
if ((postParsePosition.data() - currentPosition.data()) != 2)
return false;
}
currentPosition = postParsePosition;
if (tzHoursAbs > 24)
return false;
if (tzMinutes < 0 || tzMinutes > 59)
return false;
timeZoneSeconds = 60 * (tzMinutes + (60 * tzHoursAbs));
if (tzNegative)
timeZoneSeconds = -timeZoneSeconds;
return true;
}
double parseES5Date(std::span<const LChar> dateString, bool& isLocalTime)
{
isLocalTime = false;
// This parses a date of the form defined in ecma262/#sec-date-time-string-format
// (similar to RFC 3339 / ISO 8601: YYYY-MM-DDTHH:mm:ss[.sss]Z).
// In most cases it is intentionally strict (e.g. correct field widths, no stray whitespace).
static constexpr std::array<long, 12> daysPerMonth { 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 };
// The year must be present, but the other fields may be omitted - see ES5.1 15.9.1.15.
int year = 0;
long month = 1;
long day = 1;
long hours = 0;
long minutes = 0;
long seconds = 0;
double milliseconds = 0;
long timeZoneSeconds = 0;
// Parse the date YYYY[-MM[-DD]]
if (!parseES5DatePortion(dateString, year, month, day))
return std::numeric_limits<double>::quiet_NaN();
// Look for a time portion.
// Note: As of ES2016, when a UTC offset is missing, date-time forms are local time while date-only forms are UTC.
if (!dateString.empty() && (dateString.front() == 'T' || dateString.front() == 't' || dateString.front() == ' ')) {
dateString = dateString.subspan(1);
// Parse the time HH:mm[:ss[.sss]][Z|(+|-)(00:00|0000|00)]
if (!parseES5TimePortion(dateString, hours, minutes, seconds, milliseconds, isLocalTime, timeZoneSeconds))
return std::numeric_limits<double>::quiet_NaN();
}
// Check that we have parsed all characters in the string.
if (!dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
// A few of these checks could be done inline above, but since many of them are interrelated
// we would be sacrificing readability to "optimize" the (presumably less common) failure path.
if (month < 1 || month > 12)
return std::numeric_limits<double>::quiet_NaN();
if (day < 1 || day > daysPerMonth[month - 1])
return std::numeric_limits<double>::quiet_NaN();
if (month == 2 && day > 28 && !isLeapYear(year))
return std::numeric_limits<double>::quiet_NaN();
if (hours < 0 || hours > 24)
return std::numeric_limits<double>::quiet_NaN();
if (hours == 24 && (minutes || seconds))
return std::numeric_limits<double>::quiet_NaN();
if (minutes < 0 || minutes > 59)
return std::numeric_limits<double>::quiet_NaN();
if (seconds < 0 || seconds >= 61)
return std::numeric_limits<double>::quiet_NaN();
if (seconds == 60) {
// Discard leap seconds by clamping to the end of a minute.
milliseconds = 0;
}
return ymdhmsToMilliseconds(year, month, day, hours, minutes, seconds, milliseconds) - (timeZoneSeconds * msPerSecond);
}
// Odd case where 'exec' is allowed to be 0, to accomodate a caller in WebCore.
double parseDate(std::span<const LChar> dateString, bool& isLocalTime)
{
isLocalTime = true;
int offset = 0;
// This parses a date in the form:
// Tuesday, 09-Nov-99 23:12:40 GMT
// or
// Sat, 01-Jan-2000 08:00:00 GMT
// or
// Sat, 01 Jan 2000 08:00:00 GMT
// or
// 01 Jan 99 22:00 +0100 (exceptions in rfc822/rfc2822)
// ### non RFC formats, added for Javascript:
// [Wednesday] January 09 1999 23:12:40 GMT
// [Wednesday] January 09 23:12:40 GMT 1999
//
// We ignore the weekday.
// Skip leading space
skipSpacesAndComments(dateString);
long month = -1;
auto wordStart = dateString;
// Check contents of first words if not number
while (!dateString.empty() && !isASCIIDigit(dateString.front())) {
if (isUnicodeCompatibleASCIIWhitespace(dateString.front()) || dateString.front() == '(') {
if (dateString.data() - wordStart.data() >= 3)
month = findMonth(wordStart);
skipSpacesAndComments(dateString);
wordStart = dateString;
} else
dateString = dateString.subspan(1);
}
// Missing delimiter between month and day (like "January29")?
if (month == -1 && wordStart.data() != dateString.data())
month = findMonth(wordStart);
skipSpacesAndComments(dateString);
if (dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
// ' 09-Nov-99 23:12:40 GMT'
long day;
if (!parseLong(dateString, 10, &day))
return std::numeric_limits<double>::quiet_NaN();
if (day < 0)
return std::numeric_limits<double>::quiet_NaN();
std::optional<int> year;
if (day > 31) {
// ### where is the boundary and what happens below?
if (dateString.empty() || dateString.front() != '/')
return std::numeric_limits<double>::quiet_NaN();
dateString = dateString.subspan(1);
// looks like a YYYY/MM/DD date
if (dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
if (day <= std::numeric_limits<int>::min() || day >= std::numeric_limits<int>::max())
return std::numeric_limits<double>::quiet_NaN();
year = static_cast<int>(day);
if (!parseLong(dateString, 10, &month))
return std::numeric_limits<double>::quiet_NaN();
month -= 1;
if (dateString.empty() || dateString.front() != '/')
return std::numeric_limits<double>::quiet_NaN();
dateString = dateString.subspan(1);
if (dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
if (!parseLong(dateString, 10, &day))
return std::numeric_limits<double>::quiet_NaN();
} else if (!dateString.empty() && dateString.front() == '/' && month == -1) {
dateString = dateString.subspan(1);
// This looks like a MM/DD/YYYY date, not an RFC date.
month = day - 1; // 0-based
if (!parseLong(dateString, 10, &day))
return std::numeric_limits<double>::quiet_NaN();
if (day < 1 || day > 31)
return std::numeric_limits<double>::quiet_NaN();
if (!dateString.empty() && dateString.front() == '/')
dateString = dateString.subspan(1);
if (dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
} else {
if (!dateString.empty() && dateString.front() == '-')
dateString = dateString.subspan(1);
skipSpacesAndComments(dateString);
if (!dateString.empty() && dateString.front() == ',')
dateString = dateString.subspan(1);
if (month == -1) { // not found yet
month = findMonth(dateString);
if (month == -1)
return std::numeric_limits<double>::quiet_NaN();
while (!dateString.empty() && dateString.front() != '-' && dateString.front() != ',' && !isUnicodeCompatibleASCIIWhitespace(dateString.front()))
dateString = dateString.subspan(1);
if (dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
// '-99 23:12:40 GMT'
if (dateString.front() != '-' && dateString.front() != '/' && dateString.front() != ',' && !isUnicodeCompatibleASCIIWhitespace(dateString.front()))
return std::numeric_limits<double>::quiet_NaN();
dateString = dateString.subspan(1);
}
}
if (month < 0 || month > 11)
return std::numeric_limits<double>::quiet_NaN();
auto newPosStr = dateString;
// '99 23:12:40 GMT'
if (!dateString.empty() && !year) {
int result = 0;
if (!parseInt(newPosStr, 10, &result))
return std::numeric_limits<double>::quiet_NaN();
year = result;
}
// Don't fail if the time is missing.
long hour = 0;
long minute = 0;
long second = 0;
if (newPosStr.empty())
dateString = newPosStr;
else {
// ' 23:12:40 GMT'
if (!(isUnicodeCompatibleASCIIWhitespace(newPosStr.front()) || newPosStr.front() == ',')) {
if (newPosStr.front() != ':')
return std::numeric_limits<double>::quiet_NaN();
// There was no year; the number was the hour.
year = std::nullopt;
} else {
// in the normal case (we parsed the year), advance to the next number
// ' at 23:12:40 GMT'
if (newPosStr.size() >= 3 && isUnicodeCompatibleASCIIWhitespace(newPosStr[0]) && isASCIIAlphaCaselessEqual(newPosStr[1], 'a') && isASCIIAlphaCaselessEqual(newPosStr[2], 't'))
newPosStr = newPosStr.subspan(3);
else
newPosStr = newPosStr.subspan(1); // space or comma
dateString = newPosStr;
skipSpacesAndComments(dateString);
}
newPosStr = dateString;
parseLong(newPosStr, 10, &hour);
// Do not check for errno here since we want to continue
// even if errno was set becasue we are still looking
// for the timezone!
// Read a number? If not, this might be a timezone name.
if (newPosStr.data() != dateString.data()) {
dateString = newPosStr;
if (hour < 0 || hour > 23)
return std::numeric_limits<double>::quiet_NaN();
if (dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
// ':12:40 GMT'
if (dateString.front() != ':')
return std::numeric_limits<double>::quiet_NaN();
dateString = dateString.subspan(1); // skip ':'.
if (!parseLong(dateString, 10, &minute))
return std::numeric_limits<double>::quiet_NaN();
if (minute < 0 || minute > 59)
return std::numeric_limits<double>::quiet_NaN();
// ':40 GMT'
if (!dateString.empty() && dateString.front() != ':' && !isUnicodeCompatibleASCIIWhitespace(dateString.front()))
return std::numeric_limits<double>::quiet_NaN();
// seconds are optional in rfc822 + rfc2822
if (!dateString.empty() && dateString.front() == ':') {
dateString = dateString.subspan(1);
if (!parseLong(dateString, 10, &second))
return std::numeric_limits<double>::quiet_NaN();
if (second < 0 || second > 59)
return std::numeric_limits<double>::quiet_NaN();
}
skipSpacesAndComments(dateString);
if (startsWithLettersIgnoringASCIICase(StringView(dateString), "am"_s)) {
if (hour > 12)
return std::numeric_limits<double>::quiet_NaN();
if (hour == 12)
hour = 0;
dateString = dateString.subspan(2);
skipSpacesAndComments(dateString);
} else if (startsWithLettersIgnoringASCIICase(StringView(dateString), "pm"_s)) {
if (hour > 12)
return std::numeric_limits<double>::quiet_NaN();
if (hour != 12)
hour += 12;
dateString = dateString.subspan(2);
skipSpacesAndComments(dateString);
}
}
}
// The year may be after the time but before the time zone.
if (!dateString.empty() && isASCIIDigit(dateString.front()) && !year) {
int result = 0;
if (!parseInt(dateString, 10, &result))
return std::numeric_limits<double>::quiet_NaN();
year = result;
skipSpacesAndComments(dateString);
}
// Don't fail if the time zone is missing.
// Some websites omit the time zone (4275206).
if (!dateString.empty()) {
if (startsWithLettersIgnoringASCIICase(StringView(dateString), "gmt"_s) || startsWithLettersIgnoringASCIICase(StringView(dateString), "utc"_s)) {
dateString = dateString.subspan(3);
isLocalTime = false;
}
if (!dateString.empty() && (dateString.front() == '+' || dateString.front() == '-')) {
int o;
if (!parseInt(dateString, 10, &o))
return std::numeric_limits<double>::quiet_NaN();
if (o < -9959 || o > 9959)
return std::numeric_limits<double>::quiet_NaN();
int sgn = (o < 0) ? -1 : 1;
o = std::abs(o);
if (dateString.empty() || dateString.front() != ':') {
if (o >= 24)
offset = ((o / 100) * 60 + (o % 100)) * sgn;
else
offset = o * 60 * sgn;
} else { // GMT+05:00
dateString = dateString.subspan(1); // skip the ':'
int o2;
if (!parseInt(dateString, 10, &o2))
return std::numeric_limits<double>::quiet_NaN();
offset = (o * 60 + o2) * sgn;
}
isLocalTime = false;
} else {
for (auto& knownZone : knownZones) {
// Since the passed-in length is used for both strings, the following checks that
// dateString has the time zone name as a prefix, not that it is equal.
auto tzName = span8(knownZone.tzName);
if (dateString.size() >= tzName.size() && equalLettersIgnoringASCIICaseWithLength(dateString, tzName, tzName.size())) {
offset = knownZone.tzOffset;
dateString = dateString.subspan(tzName.size());
isLocalTime = false;
break;
}
}
}
}
skipSpacesAndComments(dateString);
if (!dateString.empty() && !year) {
int result = 0;
if (!parseInt(dateString, 10, &result))
return std::numeric_limits<double>::quiet_NaN();
year = result;
skipSpacesAndComments(dateString);
}
// Trailing garbage
if (!dateString.empty())
return std::numeric_limits<double>::quiet_NaN();
// Y2K: Handle 2 digit years.
if (year) {
int yearValue = year.value();
if (yearValue >= 0 && yearValue < 100) {
if (yearValue < 50)
yearValue += 2000;
else
yearValue += 1900;
}
year = yearValue;
} else {
// We select 2000 as default value. This is because of the following reasons.
// 1. Year 2000 was used for the initial value of the variable `year`. While it won't be posed to users in WebKit,
// V8 used this 2000 as its default value. (As of April 2017, V8 is using the year 2001 and Spider Monkey is
// not doing this kind of fallback.)
// 2. It is a leap year. When using `new Date("Feb 29")`, we assume that people want to save month and day.
// Leap year can save user inputs if they is valid. If we use the current year instead, the current year
// may not be a leap year. In that case, `new Date("Feb 29").getMonth()` becomes 2 (March).
year = 2000;
}
ASSERT(year);
return ymdhmsToMilliseconds(year.value(), month + 1, day, hour, minute, second, 0) - offset * (secondsPerMinute * msPerSecond);
}
double parseDate(std::span<const LChar> dateString)
{
bool isLocalTime;
double value = parseDate(dateString, isLocalTime);
if (isLocalTime)
value -= calculateLocalTimeOffset(value, LocalTime).offset;
return value;
}
// See http://tools.ietf.org/html/rfc2822#section-3.3 for more information.
String makeRFC2822DateString(unsigned dayOfWeek, unsigned day, unsigned month, unsigned year, unsigned hours, unsigned minutes, unsigned seconds, int utcOffset)
{
StringBuilder stringBuilder;
stringBuilder.append(weekdayName[dayOfWeek], ", "_s, day, ' ', monthName[month], ' ', year, ' ');
appendTwoDigitNumber(stringBuilder, hours);
stringBuilder.append(':');
appendTwoDigitNumber(stringBuilder, minutes);