Date.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403
  1. /*
  2. * Copyright (c) 2020-2022, Linus Groh <linusg@serenityos.org>
  3. * Copyright (c) 2022, Tim Flynn <trflynn89@serenityos.org>
  4. *
  5. * SPDX-License-Identifier: BSD-2-Clause
  6. */
  7. #include <AK/NumericLimits.h>
  8. #include <AK/StringBuilder.h>
  9. #include <AK/Time.h>
  10. #include <LibJS/Runtime/AbstractOperations.h>
  11. #include <LibJS/Runtime/Date.h>
  12. #include <LibJS/Runtime/GlobalObject.h>
  13. #include <LibTimeZone/TimeZone.h>
  14. #include <time.h>
  15. namespace JS {
  16. Date* Date::create(GlobalObject& global_object, double date_value)
  17. {
  18. return global_object.heap().allocate<Date>(global_object, date_value, *global_object.date_prototype());
  19. }
  20. Date::Date(double date_value, Object& prototype)
  21. : Object(prototype)
  22. , m_date_value(date_value)
  23. {
  24. }
  25. String Date::iso_date_string() const
  26. {
  27. int year = year_from_time(m_date_value);
  28. StringBuilder builder;
  29. if (year < 0)
  30. builder.appendff("-{:06}", -year);
  31. else if (year > 9999)
  32. builder.appendff("+{:06}", year);
  33. else
  34. builder.appendff("{:04}", year);
  35. builder.append('-');
  36. builder.appendff("{:02}", month_from_time(m_date_value) + 1);
  37. builder.append('-');
  38. builder.appendff("{:02}", date_from_time(m_date_value));
  39. builder.append('T');
  40. builder.appendff("{:02}", hour_from_time(m_date_value));
  41. builder.append(':');
  42. builder.appendff("{:02}", min_from_time(m_date_value));
  43. builder.append(':');
  44. builder.appendff("{:02}", sec_from_time(m_date_value));
  45. builder.append('.');
  46. builder.appendff("{:03}", ms_from_time(m_date_value));
  47. builder.append('Z');
  48. return builder.build();
  49. }
  50. // DayWithinYear(t), https://tc39.es/ecma262/#eqn-DayWithinYear
  51. u16 day_within_year(double t)
  52. {
  53. if (!Value(t).is_finite_number())
  54. return 0;
  55. // Day(t) - DayFromYear(YearFromTime(t))
  56. return static_cast<u16>(day(t) - day_from_year(year_from_time(t)));
  57. }
  58. // DateFromTime(t), https://tc39.es/ecma262/#sec-date-number
  59. u8 date_from_time(double t)
  60. {
  61. switch (month_from_time(t)) {
  62. // DayWithinYear(t) + 1𝔽 if MonthFromTime(t) = +0𝔽
  63. case 0:
  64. return day_within_year(t) + 1;
  65. // DayWithinYear(t) - 30𝔽 if MonthFromTime(t) = 1𝔽
  66. case 1:
  67. return day_within_year(t) - 30;
  68. // DayWithinYear(t) - 58𝔽 - InLeapYear(t) if MonthFromTime(t) = 2𝔽
  69. case 2:
  70. return day_within_year(t) - 58 - in_leap_year(t);
  71. // DayWithinYear(t) - 89𝔽 - InLeapYear(t) if MonthFromTime(t) = 3𝔽
  72. case 3:
  73. return day_within_year(t) - 89 - in_leap_year(t);
  74. // DayWithinYear(t) - 119𝔽 - InLeapYear(t) if MonthFromTime(t) = 4𝔽
  75. case 4:
  76. return day_within_year(t) - 119 - in_leap_year(t);
  77. // DayWithinYear(t) - 150𝔽 - InLeapYear(t) if MonthFromTime(t) = 5𝔽
  78. case 5:
  79. return day_within_year(t) - 150 - in_leap_year(t);
  80. // DayWithinYear(t) - 180𝔽 - InLeapYear(t) if MonthFromTime(t) = 6𝔽
  81. case 6:
  82. return day_within_year(t) - 180 - in_leap_year(t);
  83. // DayWithinYear(t) - 211𝔽 - InLeapYear(t) if MonthFromTime(t) = 7𝔽
  84. case 7:
  85. return day_within_year(t) - 211 - in_leap_year(t);
  86. // DayWithinYear(t) - 242𝔽 - InLeapYear(t) if MonthFromTime(t) = 8𝔽
  87. case 8:
  88. return day_within_year(t) - 242 - in_leap_year(t);
  89. // DayWithinYear(t) - 272𝔽 - InLeapYear(t) if MonthFromTime(t) = 9𝔽
  90. case 9:
  91. return day_within_year(t) - 272 - in_leap_year(t);
  92. // DayWithinYear(t) - 303𝔽 - InLeapYear(t) if MonthFromTime(t) = 10𝔽
  93. case 10:
  94. return day_within_year(t) - 303 - in_leap_year(t);
  95. // DayWithinYear(t) - 333𝔽 - InLeapYear(t) if MonthFromTime(t) = 11𝔽
  96. case 11:
  97. return day_within_year(t) - 333 - in_leap_year(t);
  98. default:
  99. VERIFY_NOT_REACHED();
  100. }
  101. }
  102. // DaysInYear(y), https://tc39.es/ecma262/#eqn-DaysInYear
  103. u16 days_in_year(i32 y)
  104. {
  105. // 365𝔽 if (ℝ(y) modulo 4) ≠ 0
  106. if (y % 4 != 0)
  107. return 365;
  108. // 366𝔽 if (ℝ(y) modulo 4) = 0 and (ℝ(y) modulo 100) ≠ 0
  109. if (y % 4 == 0 && y % 100 != 0)
  110. return 366;
  111. // 365𝔽 if (ℝ(y) modulo 100) = 0 and (ℝ(y) modulo 400) ≠ 0
  112. if (y % 100 == 0 && y % 400 != 0)
  113. return 365;
  114. // 366𝔽 if (ℝ(y) modulo 400) = 0
  115. if (y % 400 == 0)
  116. return 366;
  117. VERIFY_NOT_REACHED();
  118. }
  119. // DayFromYear(y), https://tc39.es/ecma262/#eqn-DaysFromYear
  120. double day_from_year(i32 y)
  121. {
  122. // 𝔽(365 × (ℝ(y) - 1970) + floor((ℝ(y) - 1969) / 4) - floor((ℝ(y) - 1901) / 100) + floor((ℝ(y) - 1601) / 400))
  123. return 365.0 * (y - 1970) + floor((y - 1969) / 4.0) - floor((y - 1901) / 100.0) + floor((y - 1601) / 400.0);
  124. }
  125. // TimeFromYear(y), https://tc39.es/ecma262/#eqn-TimeFromYear
  126. double time_from_year(i32 y)
  127. {
  128. // msPerDay × DayFromYear(y)
  129. return ms_per_day * day_from_year(y);
  130. }
  131. // YearFromTime(t), https://tc39.es/ecma262/#eqn-YearFromTime
  132. i32 year_from_time(double t)
  133. {
  134. // the largest integral Number y (closest to +∞) such that TimeFromYear(y) ≤ t
  135. if (!Value(t).is_finite_number())
  136. return NumericLimits<i32>::max();
  137. // Approximation using average number of milliseconds per year. We might have to adjust this guess afterwards.
  138. auto year = static_cast<i32>(t / (365.2425 * ms_per_day) + 1970);
  139. auto year_t = time_from_year(year);
  140. if (year_t > t)
  141. year--;
  142. else if (year_t + days_in_year(year) * ms_per_day <= t)
  143. year++;
  144. return year;
  145. }
  146. // InLeapYear(t), https://tc39.es/ecma262/#eqn-InLeapYear
  147. bool in_leap_year(double t)
  148. {
  149. // +0𝔽 if DaysInYear(YearFromTime(t)) = 365𝔽
  150. // 1𝔽 if DaysInYear(YearFromTime(t)) = 366𝔽
  151. return days_in_year(year_from_time(t)) == 366;
  152. }
  153. // MonthFromTime(t), https://tc39.es/ecma262/#eqn-MonthFromTime
  154. u8 month_from_time(double t)
  155. {
  156. auto in_leap_year = JS::in_leap_year(t);
  157. auto day_within_year = JS::day_within_year(t);
  158. // +0𝔽 if +0𝔽 ≤ DayWithinYear(t) < 31𝔽
  159. if (day_within_year < 31)
  160. return 0;
  161. // 1𝔽 if 31𝔽 ≤ DayWithinYear(t) < 59𝔽 + InLeapYear(t)
  162. if (31 <= day_within_year && day_within_year < 59 + in_leap_year)
  163. return 1;
  164. // 2𝔽 if 59𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 90𝔽 + InLeapYear(t)
  165. if (59 + in_leap_year <= day_within_year && day_within_year < 90 + in_leap_year)
  166. return 2;
  167. // 3𝔽 if 90𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 120𝔽 + InLeapYear(t)
  168. if (90 + in_leap_year <= day_within_year && day_within_year < 120 + in_leap_year)
  169. return 3;
  170. // 4𝔽 if 120𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 151𝔽 + InLeapYear(t)
  171. if (120 + in_leap_year <= day_within_year && day_within_year < 151 + in_leap_year)
  172. return 4;
  173. // 5𝔽 if 151𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 181𝔽 + InLeapYear(t)
  174. if (151 + in_leap_year <= day_within_year && day_within_year < 181 + in_leap_year)
  175. return 5;
  176. // 6𝔽 if 181𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 212𝔽 + InLeapYear(t)
  177. if (181 + in_leap_year <= day_within_year && day_within_year < 212 + in_leap_year)
  178. return 6;
  179. // 7𝔽 if 212𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 243𝔽 + InLeapYear(t)
  180. if (212 + in_leap_year <= day_within_year && day_within_year < 243 + in_leap_year)
  181. return 7;
  182. // 8𝔽 if 243𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 273𝔽 + InLeapYear(t)
  183. if (243 + in_leap_year <= day_within_year && day_within_year < 273 + in_leap_year)
  184. return 8;
  185. // 9𝔽 if 273𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 304𝔽 + InLeapYear(t)
  186. if (273 + in_leap_year <= day_within_year && day_within_year < 304 + in_leap_year)
  187. return 9;
  188. // 10𝔽 if 304𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 334𝔽 + InLeapYear(t)
  189. if (304 + in_leap_year <= day_within_year && day_within_year < 334 + in_leap_year)
  190. return 10;
  191. // 11𝔽 if 334𝔽 + InLeapYear(t) ≤ DayWithinYear(t) < 365𝔽 + InLeapYear(t)
  192. if (334 + in_leap_year <= day_within_year && day_within_year < 365 + in_leap_year)
  193. return 11;
  194. VERIFY_NOT_REACHED();
  195. }
  196. // HourFromTime(t), https://tc39.es/ecma262/#eqn-HourFromTime
  197. u8 hour_from_time(double t)
  198. {
  199. if (!Value(t).is_finite_number())
  200. return 0;
  201. // 𝔽(floor(ℝ(t / msPerHour)) modulo HoursPerDay)
  202. return static_cast<u8>(modulo(floor(t / ms_per_hour), hours_per_day));
  203. }
  204. // MinFromTime(t), https://tc39.es/ecma262/#eqn-MinFromTime
  205. u8 min_from_time(double t)
  206. {
  207. if (!Value(t).is_finite_number())
  208. return 0;
  209. // 𝔽(floor(ℝ(t / msPerMinute)) modulo MinutesPerHour)
  210. return static_cast<u8>(modulo(floor(t / ms_per_minute), minutes_per_hour));
  211. }
  212. // SecFromTime(t), https://tc39.es/ecma262/#eqn-SecFromTime
  213. u8 sec_from_time(double t)
  214. {
  215. if (!Value(t).is_finite_number())
  216. return 0;
  217. // 𝔽(floor(ℝ(t / msPerSecond)) modulo SecondsPerMinute)
  218. return static_cast<u8>(modulo(floor(t / ms_per_second), seconds_per_minute));
  219. }
  220. // msFromTime(t), https://tc39.es/ecma262/#eqn-msFromTime
  221. u16 ms_from_time(double t)
  222. {
  223. if (!Value(t).is_finite_number())
  224. return 0;
  225. // 𝔽(ℝ(t) modulo ℝ(msPerSecond))
  226. return static_cast<u16>(modulo(t, ms_per_second));
  227. }
  228. // 21.4.1.6 Week Day, https://tc39.es/ecma262/#sec-week-day
  229. u8 week_day(double t)
  230. {
  231. if (!Value(t).is_finite_number())
  232. return 0;
  233. // 𝔽(ℝ(Day(t) + 4𝔽) modulo 7)
  234. return static_cast<u8>(modulo(day(t) + 4, 7));
  235. }
  236. // 21.4.1.7 LocalTZA ( t, isUTC ), https://tc39.es/ecma262/#sec-local-time-zone-adjustment
  237. double local_tza(double time, [[maybe_unused]] bool is_utc, Optional<StringView> time_zone_override)
  238. {
  239. // The time_zone_override parameter is non-standard, but allows callers to override the system
  240. // time zone with a specific value without setting environment variables.
  241. auto time_zone = time_zone_override.value_or(TimeZone::current_time_zone());
  242. // When isUTC is true, LocalTZA( tUTC, true ) should return the offset of the local time zone from
  243. // UTC measured in milliseconds at time represented by time value tUTC. When the result is added to
  244. // tUTC, it should yield the corresponding Number tlocal.
  245. // When isUTC is false, LocalTZA( tlocal, false ) should return the offset of the local time zone from
  246. // UTC measured in milliseconds at local time represented by Number tlocal. When the result is subtracted
  247. // from tlocal, it should yield the corresponding time value tUTC.
  248. auto time_since_epoch = Value(time).is_finite_number() ? AK::Time::from_milliseconds(time) : AK::Time::max();
  249. auto maybe_offset = TimeZone::get_time_zone_offset(time_zone, time_since_epoch);
  250. return maybe_offset.has_value() ? static_cast<double>(maybe_offset->seconds) * 1000 : 0;
  251. }
  252. // 21.4.1.8 LocalTime ( t ), https://tc39.es/ecma262/#sec-localtime
  253. double local_time(double time)
  254. {
  255. // 1. Return t + LocalTZA(t, true).
  256. return time + local_tza(time, true);
  257. }
  258. // 21.4.1.9 UTC ( t ), https://tc39.es/ecma262/#sec-utc-t
  259. double utc_time(double time)
  260. {
  261. // 1. Return t - LocalTZA(t, false).
  262. return time - local_tza(time, false);
  263. }
  264. // 21.4.1.11 MakeTime ( hour, min, sec, ms ), https://tc39.es/ecma262/#sec-maketime
  265. double make_time(double hour, double min, double sec, double ms)
  266. {
  267. // 1. If hour is not finite or min is not finite or sec is not finite or ms is not finite, return NaN.
  268. if (!isfinite(hour) || !isfinite(min) || !isfinite(sec) || !isfinite(ms))
  269. return NAN;
  270. // 2. Let h be 𝔽(! ToIntegerOrInfinity(hour)).
  271. auto h = to_integer_or_infinity(hour);
  272. // 3. Let m be 𝔽(! ToIntegerOrInfinity(min)).
  273. auto m = to_integer_or_infinity(min);
  274. // 4. Let s be 𝔽(! ToIntegerOrInfinity(sec)).
  275. auto s = to_integer_or_infinity(sec);
  276. // 5. Let milli be 𝔽(! ToIntegerOrInfinity(ms)).
  277. auto milli = to_integer_or_infinity(ms);
  278. // 6. Let t be ((h * msPerHour + m * msPerMinute) + s * msPerSecond) + milli, performing the arithmetic according to IEEE 754-2019 rules (that is, as if using the ECMAScript operators * and +).
  279. // NOTE: C++ arithmetic abides by IEEE 754 rules
  280. auto t = ((h * ms_per_hour + m * ms_per_minute) + s * ms_per_second) + milli;
  281. // 7. Return t.
  282. return t;
  283. }
  284. // Day(t), https://tc39.es/ecma262/#eqn-Day
  285. double day(double time_value)
  286. {
  287. return floor(time_value / ms_per_day);
  288. }
  289. // TimeWithinDay(t), https://tc39.es/ecma262/#eqn-TimeWithinDay
  290. double time_within_day(double time)
  291. {
  292. // 𝔽(ℝ(t) modulo ℝ(msPerDay))
  293. return modulo(time, ms_per_day);
  294. }
  295. // 21.4.1.12 MakeDay ( year, month, date ), https://tc39.es/ecma262/#sec-makeday
  296. double make_day(double year, double month, double date)
  297. {
  298. // 1. If year is not finite or month is not finite or date is not finite, return NaN.
  299. if (!isfinite(year) || !isfinite(month) || !isfinite(date))
  300. return NAN;
  301. // 2. Let y be 𝔽(! ToIntegerOrInfinity(year)).
  302. auto y = to_integer_or_infinity(year);
  303. // 3. Let m be 𝔽(! ToIntegerOrInfinity(month)).
  304. auto m = to_integer_or_infinity(month);
  305. // 4. Let dt be 𝔽(! ToIntegerOrInfinity(date)).
  306. auto dt = to_integer_or_infinity(date);
  307. // 5. Let ym be y + 𝔽(floor(ℝ(m) / 12)).
  308. auto ym = y + floor(m / 12);
  309. // 6. If ym is not finite, return NaN.
  310. if (!isfinite(ym))
  311. return NAN;
  312. // 7. Let mn be 𝔽(ℝ(m) modulo 12).
  313. auto mn = modulo(m, 12);
  314. // 8. Find a finite time value t such that YearFromTime(t) is ym and MonthFromTime(t) is mn and DateFromTime(t) is 1𝔽; but if this is not possible (because some argument is out of range), return NaN.
  315. if (!AK::is_within_range<int>(ym) || !AK::is_within_range<int>(mn + 1))
  316. return NAN;
  317. // FIXME: We are avoiding AK::years_to_days_since_epoch here because it is implemented by looping over
  318. // the range [1970, ym), which will spin for any time value with an extremely large year.
  319. auto t = time_from_year(ym) + (day_of_year(static_cast<int>(ym), static_cast<int>(mn) + 1, 1) * ms_per_day);
  320. // 9. Return Day(t) + dt - 1𝔽.
  321. return day(static_cast<double>(t)) + dt - 1;
  322. }
  323. // 21.4.1.13 MakeDate ( day, time ), https://tc39.es/ecma262/#sec-makedate
  324. double make_date(double day, double time)
  325. {
  326. // 1. If day is not finite or time is not finite, return NaN.
  327. if (!isfinite(day) || !isfinite(time))
  328. return NAN;
  329. // 2. Let tv be day × msPerDay + time.
  330. auto tv = day * ms_per_day + time;
  331. // 3. If tv is not finite, return NaN.
  332. if (!isfinite(tv))
  333. return NAN;
  334. // 4. Return tv.
  335. return tv;
  336. }
  337. // 21.4.1.14 TimeClip ( time ), https://tc39.es/ecma262/#sec-timeclip
  338. double time_clip(double time)
  339. {
  340. // 1. If time is not finite, return NaN.
  341. if (!isfinite(time))
  342. return NAN;
  343. // 2. If abs(ℝ(time)) > 8.64 × 10^15, return NaN.
  344. if (fabs(time) > 8.64E15)
  345. return NAN;
  346. // 3. Return 𝔽(! ToIntegerOrInfinity(time)).
  347. return to_integer_or_infinity(time);
  348. }
  349. }