time.c 66 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106110711081109111011111112111311141115111611171118111911201121112211231124112511261127112811291130113111321133113411351136113711381139114011411142114311441145114611471148114911501151115211531154115511561157115811591160116111621163116411651166116711681169117011711172117311741175117611771178117911801181118211831184118511861187118811891190119111921193119411951196119711981199120012011202120312041205120612071208120912101211121212131214121512161217121812191220122112221223122412251226122712281229123012311232123312341235123612371238123912401241124212431244124512461247124812491250125112521253125412551256125712581259126012611262126312641265126612671268126912701271127212731274127512761277127812791280128112821283128412851286128712881289129012911292129312941295129612971298129913001301130213031304130513061307130813091310131113121313131413151316131713181319132013211322132313241325132613271328132913301331133213331334133513361337133813391340134113421343134413451346134713481349135013511352135313541355135613571358135913601361136213631364136513661367136813691370137113721373137413751376137713781379138013811382138313841385138613871388138913901391139213931394139513961397139813991400140114021403140414051406140714081409141014111412141314141415141614171418141914201421142214231424142514261427142814291430143114321433143414351436143714381439144014411442144314441445144614471448144914501451145214531454145514561457145814591460146114621463146414651466146714681469147014711472147314741475147614771478147914801481148214831484148514861487148814891490149114921493149414951496149714981499150015011502150315041505150615071508150915101511151215131514151515161517151815191520152115221523152415251526152715281529153015311532153315341535153615371538153915401541154215431544154515461547154815491550155115521553155415551556155715581559156015611562156315641565156615671568156915701571157215731574157515761577157815791580158115821583158415851586158715881589159015911592159315941595159615971598159916001601160216031604160516061607160816091610161116121613161416151616161716181619162016211622162316241625162616271628162916301631163216331634163516361637163816391640164116421643164416451646164716481649165016511652165316541655165616571658165916601661166216631664166516661667166816691670167116721673167416751676167716781679168016811682168316841685168616871688168916901691169216931694169516961697169816991700170117021703170417051706170717081709171017111712171317141715171617171718171917201721172217231724172517261727172817291730173117321733173417351736173717381739174017411742174317441745174617471748174917501751175217531754175517561757175817591760176117621763176417651766176717681769177017711772177317741775177617771778177917801781178217831784178517861787178817891790179117921793179417951796179717981799180018011802180318041805180618071808180918101811181218131814181518161817181818191820182118221823182418251826182718281829183018311832183318341835183618371838183918401841184218431844184518461847184818491850185118521853185418551856185718581859186018611862186318641865186618671868186918701871187218731874187518761877187818791880188118821883188418851886188718881889189018911892189318941895189618971898189919001901190219031904190519061907190819091910191119121913191419151916191719181919192019211922192319241925192619271928192919301931193219331934193519361937193819391940194119421943194419451946194719481949195019511952195319541955195619571958195919601961196219631964196519661967196819691970197119721973197419751976197719781979198019811982198319841985198619871988198919901991199219931994199519961997199819992000200120022003200420052006200720082009201020112012201320142015201620172018201920202021202220232024202520262027202820292030203120322033203420352036203720382039204020412042204320442045204620472048204920502051205220532054205520562057205820592060206120622063206420652066206720682069207020712072207320742075207620772078207920802081208220832084208520862087208820892090209120922093209420952096209720982099210021012102210321042105210621072108210921102111211221132114211521162117211821192120212121222123212421252126212721282129213021312132213321342135213621372138213921402141214221432144214521462147214821492150215121522153215421552156215721582159216021612162216321642165216621672168216921702171217221732174217521762177217821792180218121822183218421852186218721882189219021912192219321942195219621972198219922002201220222032204220522062207220822092210221122122213221422152216221722182219222022212222222322242225222622272228222922302231223222332234223522362237223822392240224122422243224422452246224722482249225022512252225322542255225622572258225922602261226222632264226522662267226822692270227122722273227422752276227722782279228022812282228322842285228622872288228922902291229222932294229522962297229822992300230123022303230423052306230723082309231023112312231323142315231623172318231923202321232223232324232523262327232823292330233123322333233423352336233723382339234023412342234323442345234623472348234923502351235223532354235523562357235823592360236123622363236423652366236723682369237023712372237323742375237623772378237923802381238223832384238523862387238823892390239123922393239423952396239723982399240024012402240324042405240624072408240924102411241224132414241524162417241824192420242124222423242424252426242724282429243024312432243324342435243624372438243924402441244224432444244524462447244824492450245124522453245424552456245724582459246024612462246324642465246624672468246924702471247224732474247524762477247824792480248124822483248424852486248724882489249024912492249324942495249624972498249925002501250225032504250525062507250825092510251125122513251425152516251725182519252025212522252325242525252625272528252925302531253225332534
  1. /* Copyright (C) 2002-2004 Manuel Novoa III <mjn3@codepoet.org>
  2. *
  3. * GNU Library General Public License (LGPL) version 2 or later.
  4. *
  5. * Dedicated to Toni. See uClibc/DEDICATION.mjn3 for details.
  6. */
  7. /* June 15, 2002 Initial Notes:
  8. *
  9. * Note: It is assumed throught that time_t is either long or unsigned long.
  10. * Similarly, clock_t is assumed to be long int.
  11. *
  12. * Warning: Assumptions are made about the layout of struct tm! It is
  13. * assumed that the initial fields of struct tm are (in order):
  14. * tm_sec, tm_min, tm_hour, tm_mday, tm_mon, tm_year, tm_wday, tm_yday
  15. *
  16. * Reached the inital goal of supporting the ANSI/ISO C99 time functions
  17. * as well as SUSv3's strptime. All timezone info is obtained from the
  18. * TZ env variable.
  19. *
  20. * Differences from glibc worth noting:
  21. *
  22. * Leap seconds are not considered here.
  23. *
  24. * glibc stores additional timezone info the struct tm, whereas we don't.
  25. *
  26. * Alternate digits and era handling are not currently implemented.
  27. * The modifiers are accepted, and tested for validity with the following
  28. * specifier, but are ignored otherwise.
  29. *
  30. * strftime does not implement glibc extension modifiers or widths for
  31. * conversion specifiers. However it does implement the glibc
  32. * extension specifiers %l, %k, and %s. It also recognizes %P, but
  33. * treats it as a synonym for %p; i.e. doesn't convert to lower case.
  34. *
  35. * strptime implements the glibc extension specifiers. However, it follows
  36. * SUSv3 in requiring at least one non-alphanumeric char between
  37. * conversion specifiers. Also, strptime only sets struct tm fields
  38. * for which format specifiers appear and does not try to infer other
  39. * fields (such as wday) as glibc's version does.
  40. *
  41. * TODO - Since glibc's %l and %k can space-pad their output in strftime,
  42. * it might be reasonable to eat whitespace first for those specifiers.
  43. * This could be done by pushing " %I" and " %H" respectively so that
  44. * leading whitespace is consumed. This is really only an issue if %l
  45. * or %k occurs at the start of the format string.
  46. *
  47. * TODO - Implement getdate? tzfile? struct tm extensions?
  48. *
  49. * TODO - Rework _time_mktime to remove the dependency on long long.
  50. */
  51. /* Oct 28, 2002
  52. *
  53. * Fixed allowed char check for std and dst TZ fields.
  54. *
  55. * Added several options concerned with timezone support. The names will
  56. * probably change once Erik gets the new config system in place.
  57. *
  58. * Defining __TIME_TZ_FILE causes tzset() to attempt to read the TZ value
  59. * from the file /etc/TZ if the TZ env variable isn't set. The file contents
  60. * must be the intended value of TZ, followed by a newline. No other chars,
  61. * spacing, etc is allowed. As an example, an easy way for me to init
  62. * /etc/TZ appropriately would be: echo CST6CDT > /etc/TZ
  63. *
  64. * Defining __TIME_TZ_FILE_ONCE will cause all further accesses of /etc/TZ
  65. * to be skipped once a legal value has been read.
  66. *
  67. * Defining __TIME_TZ_OPT_SPEED will cause a tzset() to keep a copy of the
  68. * last TZ setting string and do a "fast out" if the current string is the
  69. * same.
  70. *
  71. * Nov 21, 2002 Fix an error return case in _time_mktime.
  72. *
  73. * Nov 26, 2002 Fix bug in setting daylight and timezone when no (valid) TZ.
  74. * Bug reported by Arne Bernin <arne@alamut.de> in regards to freeswan.
  75. *
  76. * July 27, 2003 Adjust the struct tm extension field support.
  77. * Change __tm_zone back to a ptr and add the __tm_tzname[] buffer for
  78. * __tm_zone to point to. This gets around complaints from g++.
  79. * Who knows... it might even fix the PPC timezone init problem.
  80. *
  81. * July 29, 2003 Fix a bug in mktime behavior when tm_isdst was -1.
  82. * Bug reported by "Sid Wade" <sid@vivato.net> in regards to busybox.
  83. *
  84. * NOTE: uClibc mktime behavior is different than glibc's when
  85. * the struct tm has tm_isdst == -1 and also had fields outside of
  86. * the normal ranges.
  87. *
  88. * Apparently, glibc examines (at least) tm_sec and guesses the app's
  89. * intention of assuming increasing or decreasing time when entering an
  90. * ambiguous time period at the dst<->st boundaries.
  91. *
  92. * The uClibc behavior is to always normalize the struct tm and then
  93. * try to determing the dst setting.
  94. *
  95. * As long as tm_isdst != -1 or the time specifiec by struct tm is
  96. * unambiguous (not falling in the dst<->st transition region) both
  97. * uClibc and glibc should produce the same result for mktime.
  98. *
  99. * Oct 31, 2003 Kill the seperate __tm_zone and __tm_tzname[] and which
  100. * doesn't work if you want the memcpy the struct. Sigh... I didn't
  101. * think about that. So now, when the extensions are enabled, we
  102. * malloc space when necessary and keep the timezone names in a linked
  103. * list.
  104. *
  105. * Fix a dst-related bug which resulted in use of uninitialized data.
  106. *
  107. * Nov 15, 2003 I forgot to update the thread locking in the last dst fix.
  108. *
  109. * Dec 14, 2003 Fix some dst issues in _time_mktime().
  110. * Normalize the tm_isdst value to -1, 0, or 1.
  111. * If no dst for this timezone, then reset tm_isdst to 0.
  112. *
  113. * May 7, 2004
  114. * Change clock() to allow wrapping.
  115. * Add timegm() function.
  116. * Make lookup_tzname() static (as it should have been).
  117. * Have strftime() get timezone information from the passed struct
  118. * for the %z and %Z conversions when using struct tm extensions.
  119. *
  120. * Jul 24, 2004
  121. * Fix 2 bugs in strftime related to glibc struct tm extensions.
  122. * 1) Need to negate tm_gmtoff field value when used. (bug 336).
  123. * 2) Deal with NULL ptr case for tm_zone field, which was causing
  124. * segfaults in both the NIST/PCTS tests and the Python 2.4.1
  125. * self-test suite.
  126. * NOTE: We set uninitialized timezone names to "???", and this
  127. * differs (intentionally) from glibc's behavior.
  128. */
  129. #include <stdio.h>
  130. #include <stdlib.h>
  131. #include <stddef.h>
  132. #include <string.h>
  133. #include <time.h>
  134. #include <sys/time.h>
  135. #include <limits.h>
  136. #include <assert.h>
  137. #include <errno.h>
  138. #include <ctype.h>
  139. #include <langinfo.h>
  140. #include <locale.h>
  141. #include <fcntl.h>
  142. #include <unistd.h>
  143. #include <bits/uClibc_uintmaxtostr.h>
  144. #include <bits/uClibc_mutex.h>
  145. #if defined __UCLIBC_HAS_WCHAR__ && (defined L_wcsftime || defined L_wcsftime_l)
  146. #include <wchar.h>
  147. # define CHAR_T wchar_t
  148. # define UCHAR_T unsigned int
  149. # ifdef L_wcsftime
  150. # define strftime wcsftime
  151. # define L_strftime
  152. # if defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE)
  153. # define strftime_l wcsftime_l
  154. # endif
  155. # endif
  156. # ifdef L_wcsftime_l
  157. # define strftime_l wcsftime_l
  158. # define L_strftime_l
  159. # endif
  160. #else
  161. # define CHAR_T char
  162. # define UCHAR_T unsigned char
  163. #endif
  164. #ifndef __isleap
  165. #define __isleap(y) ( !((y) % 4) && ( ((y) % 100) || !((y) % 400) ) )
  166. #endif
  167. #ifndef TZNAME_MAX
  168. #define TZNAME_MAX _POSIX_TZNAME_MAX
  169. #endif
  170. #if defined (L_tzset) || defined (L_localtime_r) || defined(L_strftime) || \
  171. defined(L__time_mktime) || defined(L__time_mktime_tzi) || \
  172. ((defined(L_strftime) || defined(L_strftime_l)) && \
  173. defined(__UCLIBC_HAS_XLOCALE__))
  174. void _time_tzset(int use_old_rules) attribute_hidden;
  175. #ifndef L__time_mktime
  176. /* Jan 1, 2007 Z - tm = 0,0,0,1,0,107,1,0,0 */
  177. static const time_t new_rule_starts = 1167609600;
  178. #endif
  179. #endif
  180. /**********************************************************************/
  181. /* The era code is currently unfinished. */
  182. /* #define ENABLE_ERA_CODE */
  183. #define TZ_BUFLEN (2*TZNAME_MAX + 56)
  184. #ifdef __UCLIBC_HAS_TZ_FILE__
  185. #include <sys/stat.h>
  186. #include "paths.h"
  187. /* ":<tzname>+hh:mm:ss<tzname>+hh:mm:ss,Mmm.w.d/hh:mm:ss,Mmm.w.d/hh:mm:ss" + nul */
  188. /* 1 + 2*(1+TZNAME_MAX+1 + 9 + 7 + 9) + 1 = 2*TZNAME_MAX + 56 */
  189. #else /* __UCLIBC_HAS_TZ_FILE__ */
  190. /* Probably no longer needed. */
  191. #undef __UCLIBC_HAS_TZ_FILE_READ_MANY__
  192. #endif /* __UCLIBC_HAS_TZ_FILE__ */
  193. /**********************************************************************/
  194. extern struct tm __time_tm attribute_hidden;
  195. typedef struct {
  196. long gmt_offset;
  197. long dst_offset;
  198. short day; /* for J or normal */
  199. short week;
  200. short month;
  201. short rule_type; /* J, M, \0 */
  202. char tzname[TZNAME_MAX+1];
  203. } rule_struct;
  204. __UCLIBC_MUTEX_EXTERN(_time_tzlock) attribute_hidden;
  205. extern rule_struct _time_tzinfo[2] attribute_hidden;
  206. extern struct tm *_time_t2tm(const time_t *__restrict timer,
  207. int offset, struct tm *__restrict result) attribute_hidden;
  208. extern time_t _time_mktime(struct tm *timeptr, int store_on_success) attribute_hidden;
  209. extern struct tm *__time_localtime_tzi(const time_t *__restrict timer,
  210. struct tm *__restrict result,
  211. rule_struct *tzi) attribute_hidden;
  212. extern time_t _time_mktime_tzi(struct tm *timeptr, int store_on_success,
  213. rule_struct *tzi) attribute_hidden;
  214. /**********************************************************************/
  215. #ifdef L_asctime
  216. static char __time_str[26];
  217. char *asctime(const struct tm *ptm)
  218. {
  219. return asctime_r(ptm, __time_str);
  220. }
  221. libc_hidden_def(asctime)
  222. #endif
  223. /**********************************************************************/
  224. #ifdef L_asctime_r
  225. /* Strictly speaking, this implementation isn't correct. ANSI/ISO specifies
  226. * that the implementation of asctime() be equivalent to
  227. *
  228. * char *asctime(const struct tm *timeptr)
  229. * {
  230. * static char wday_name[7][3] = {
  231. * "Sun", "Mon", "Tue", "Wed", "Thu", "Fri", "Sat"
  232. * };
  233. * static char mon_name[12][3] = {
  234. * "Jan", "Feb", "Mar", "Apr", "May", "Jun",
  235. * "Jul", "Aug", "Sep", "Oct", "Nov", "Dec"
  236. * };
  237. * static char result[26];
  238. *
  239. * sprintf(result, "%.3s %.3s%3d %.2d:%.2d:%.2d %d\n",
  240. * wday_name[timeptr->tm_wday],
  241. * mon_name[timeptr->tm_mon],
  242. * timeptr->tm_mday, timeptr->tm_hour,
  243. * timeptr->tm_min, timeptr->tm_sec,
  244. * 1900 + timeptr->tm_year);
  245. * return result;
  246. * }
  247. *
  248. * but the above is either inherently unsafe, or carries with it the implicit
  249. * assumption that all fields of timeptr fall within their usual ranges, and
  250. * that the tm_year value falls in the range [-2899,8099] to avoid overflowing
  251. * the static buffer.
  252. *
  253. * If we take the implicit assumption as given, then the implementation below
  254. * is still incorrect for tm_year values < -900, as there will be either
  255. * 0-padding and/or a missing negative sign for the year conversion . But given
  256. * the usual use of asctime(), I think it isn't unreasonable to restrict correct
  257. * operation to the domain of years between 1000 and 9999.
  258. */
  259. /* This is generally a good thing, but if you're _sure_ any data passed will be
  260. * in range, you can #undef this. */
  261. #define SAFE_ASCTIME_R 1
  262. static const unsigned char at_data[] = {
  263. 'S', 'u', 'n', 'M', 'o', 'n', 'T', 'u', 'e', 'W', 'e', 'd',
  264. 'T', 'h', 'u', 'F', 'r', 'i', 'S', 'a', 't',
  265. 'J', 'a', 'n', 'F', 'e', 'b', 'M', 'a', 'r', 'A', 'p', 'r',
  266. 'M', 'a', 'y', 'J', 'u', 'n', 'J', 'u', 'l', 'A', 'u', 'g',
  267. 'S', 'e', 'p', 'O', 'c', 't', 'N', 'o', 'v', 'D', 'e', 'c',
  268. #ifdef SAFE_ASCTIME_R
  269. '?', '?', '?',
  270. #endif
  271. ' ', '?', '?', '?',
  272. ' ', '0',
  273. offsetof(struct tm, tm_mday),
  274. ' ', '0',
  275. offsetof(struct tm, tm_hour),
  276. ':', '0',
  277. offsetof(struct tm, tm_min),
  278. ':', '0',
  279. offsetof(struct tm, tm_sec),
  280. ' ', '?', '?', '?', '?', '\n', 0
  281. };
  282. char *asctime_r(register const struct tm *__restrict ptm,
  283. register char *__restrict buffer)
  284. {
  285. int tmp;
  286. assert(ptm);
  287. assert(buffer);
  288. #ifdef SAFE_ASCTIME_R
  289. memcpy(buffer, at_data + 3*(7 + 12), sizeof(at_data) - 3*(7 + 12));
  290. if (((unsigned int)(ptm->tm_wday)) <= 6) {
  291. memcpy(buffer, at_data + 3 * ptm->tm_wday, 3);
  292. }
  293. if (((unsigned int)(ptm->tm_mon)) <= 11) {
  294. memcpy(buffer + 4, at_data + 3*7 + 3 * ptm->tm_mon, 3);
  295. }
  296. #else
  297. assert(((unsigned int)(ptm->tm_wday)) <= 6);
  298. assert(((unsigned int)(ptm->tm_mon)) <= 11);
  299. memcpy(buffer, at_data + 3*(7 + 12) - 3, sizeof(at_data) + 3 - 3*(7 + 12));
  300. memcpy(buffer, at_data + 3 * ptm->tm_wday, 3);
  301. memcpy(buffer + 4, at_data + 3*7 + 3 * ptm->tm_mon, 3);
  302. #endif
  303. #ifdef SAFE_ASCTIME_R
  304. buffer += 19;
  305. tmp = ptm->tm_year + 1900;
  306. if (((unsigned int) tmp) < 10000) {
  307. buffer += 4;
  308. do {
  309. *buffer = '0' + (tmp % 10);
  310. tmp /= 10;
  311. } while (*--buffer == '?');
  312. }
  313. /* Not sure if we should even bother ...
  314. } else {
  315. __set_errno(EOVERFLOW);
  316. return NULL;
  317. }
  318. */
  319. #else /* SAFE_ASCTIME_R */
  320. buffer += 23;
  321. tmp = ptm->tm_year + 1900;
  322. assert( ((unsigned int) tmp) < 10000 );
  323. /* Not sure if we should even bother ...
  324. if ( ((unsigned int) tmp) >= 10000 ) {
  325. __set_errno(EOVERFLOW);
  326. return NULL;
  327. }
  328. */
  329. do {
  330. *buffer = '0' + (tmp % 10);
  331. tmp /= 10;
  332. } while (*--buffer == '?');
  333. #endif /* SAFE_ASCTIME_R */
  334. do {
  335. --buffer;
  336. tmp = *((int *)(((const char *) ptm) + (int) *buffer));
  337. #ifdef SAFE_ASCTIME_R
  338. if (((unsigned int) tmp) >= 100) { /* Just check 2 digit non-neg. */
  339. buffer[-1] = *buffer = '?';
  340. } else
  341. #else
  342. assert(((unsigned int) tmp) < 100); /* Just check 2 digit non-neg. */
  343. #endif
  344. {
  345. *buffer = '0' + (tmp % 10);
  346. #ifdef __BCC__
  347. buffer[-1] = '0' + (tmp/10);
  348. #else
  349. buffer[-1] += (tmp/10);
  350. #endif
  351. }
  352. } while ((buffer -= 2)[-2] == '0');
  353. if (*++buffer == '0') { /* Space-pad day of month. */
  354. *buffer = ' ';
  355. }
  356. return buffer - 8;
  357. }
  358. libc_hidden_def(asctime_r)
  359. #endif
  360. /**********************************************************************/
  361. #ifdef L_clock
  362. #include <sys/times.h>
  363. #ifndef __BCC__
  364. #if CLOCKS_PER_SEC != 1000000L
  365. #error unexpected value for CLOCKS_PER_SEC!
  366. #endif
  367. #endif
  368. #ifdef __UCLIBC_CLK_TCK_CONST
  369. # if __UCLIBC_CLK_TCK_CONST > CLOCKS_PER_SEC
  370. # error __UCLIBC_CLK_TCK_CONST > CLOCKS_PER_SEC!
  371. # elif __UCLIBC_CLK_TCK_CONST < 1
  372. # error __UCLIBC_CLK_TCK_CONST < 1!
  373. # endif
  374. #endif
  375. /* Note: SUSv3 notes
  376. *
  377. * On XSI-conformant systems, CLOCKS_PER_SEC is defined to be one million.
  378. *
  379. * The value returned by clock() may wrap around on some implementations.
  380. * For example, on a machine with 32-bit values for clock_t, it wraps
  381. * after 2147 seconds.
  382. *
  383. * This implies that we should bitwise and with LONG_MAX.
  384. */
  385. clock_t clock(void)
  386. {
  387. struct tms xtms;
  388. unsigned long t;
  389. times(&xtms);
  390. t = ((unsigned long) xtms.tms_utime) + xtms.tms_stime;
  391. #ifndef __UCLIBC_CLK_TCK_CONST
  392. # error __UCLIBC_CLK_TCK_CONST not defined!
  393. #elif ((CLOCKS_PER_SEC % __UCLIBC_CLK_TCK_CONST) == 0)
  394. /* CLOCKS_PER_SEC == k * __UCLIBC_CLK_TCK_CONST for some integer k >= 1. */
  395. return ((t * (CLOCKS_PER_SEC/__UCLIBC_CLK_TCK_CONST)) & LONG_MAX);
  396. #else
  397. /* Unlike the previous case, the scaling factor is not an integer.
  398. * So when tms_utime, tms_stime, or their sum wraps, some of the
  399. * "visible" bits in the return value are affected. Nothing we
  400. * can really do about this though other than handle tms_utime and
  401. * tms_stime seperately and then sum. But since that doesn't really
  402. * buy us much, we don't bother. */
  403. return ((((t / __UCLIBC_CLK_TCK_CONST) * CLOCKS_PER_SEC)
  404. + ((((t % __UCLIBC_CLK_TCK_CONST) * CLOCKS_PER_SEC)
  405. / __UCLIBC_CLK_TCK_CONST))
  406. ) & LONG_MAX);
  407. #endif
  408. }
  409. #endif
  410. /**********************************************************************/
  411. #ifdef L_ctime
  412. char *ctime(const time_t *t)
  413. {
  414. /* ANSI/ISO/SUSv3 say that ctime is equivalent to the following:
  415. * return asctime(localtime(t));
  416. * I don't think "equivalent" means "it uses the same internal buffer",
  417. * it means "gives the same resultant string".
  418. *
  419. * I doubt anyone ever uses weird code like:
  420. * struct tm *ptm = localtime(t1); ...; ctime(t2); use(ptm);
  421. * which relies on the assumption that ctime's and localtime's
  422. * internal static struct tm is the same.
  423. *
  424. * Using localtime_r instead of localtime avoids linking in
  425. * localtime's static buffer:
  426. */
  427. struct tm xtm;
  428. memset(&xtm, 0, sizeof(xtm));
  429. return asctime(localtime_r(t, &xtm));
  430. }
  431. libc_hidden_def(ctime)
  432. #endif
  433. /**********************************************************************/
  434. #ifdef L_ctime_r
  435. char *ctime_r(const time_t *t, char *buf)
  436. {
  437. struct tm xtm;
  438. return asctime_r(localtime_r(t, &xtm), buf);
  439. }
  440. #endif
  441. /**********************************************************************/
  442. #ifdef L_difftime
  443. #include <float.h>
  444. #if FLT_RADIX != 2
  445. #error difftime implementation assumptions violated for you arch!
  446. #endif
  447. double difftime(time_t time1, time_t time0)
  448. {
  449. #if (LONG_MAX >> DBL_MANT_DIG) == 0
  450. /* time_t fits in the mantissa of a double. */
  451. return (double)time1 - (double)time0;
  452. #elif ((LONG_MAX >> DBL_MANT_DIG) >> DBL_MANT_DIG) == 0
  453. /* time_t can overflow the mantissa of a double. */
  454. time_t t1, t0, d;
  455. d = ((time_t) 1) << DBL_MANT_DIG;
  456. t1 = time1 / d;
  457. time1 -= (t1 * d);
  458. t0 = time0 / d;
  459. time0 -= (t0*d);
  460. /* Since FLT_RADIX==2 and d is a power of 2, the only possible
  461. * rounding error in the expression below would occur from the
  462. * addition. */
  463. return (((double) t1) - t0) * d + (((double) time1) - time0);
  464. #else
  465. #error difftime needs special implementation on your arch.
  466. #endif
  467. }
  468. #endif
  469. /**********************************************************************/
  470. #ifdef L_gmtime
  471. struct tm *gmtime(const time_t *timer)
  472. {
  473. register struct tm *ptm = &__time_tm;
  474. _time_t2tm(timer, 0, ptm); /* Can return NULL... */
  475. return ptm;
  476. }
  477. #endif
  478. /**********************************************************************/
  479. #ifdef L_gmtime_r
  480. struct tm *gmtime_r(const time_t *__restrict timer,
  481. struct tm *__restrict result)
  482. {
  483. return _time_t2tm(timer, 0, result);
  484. }
  485. #endif
  486. /**********************************************************************/
  487. #ifdef L_localtime
  488. struct tm *localtime(const time_t *timer)
  489. {
  490. register struct tm *ptm = &__time_tm;
  491. /* In this implementation, tzset() is called by localtime_r(). */
  492. localtime_r(timer, ptm); /* Can return NULL... */
  493. return ptm;
  494. }
  495. libc_hidden_def(localtime)
  496. #endif
  497. /**********************************************************************/
  498. #ifdef L_localtime_r
  499. struct tm *localtime_r(register const time_t *__restrict timer,
  500. register struct tm *__restrict result)
  501. {
  502. __UCLIBC_MUTEX_LOCK(_time_tzlock);
  503. _time_tzset(*timer < new_rule_starts);
  504. __time_localtime_tzi(timer, result, _time_tzinfo);
  505. __UCLIBC_MUTEX_UNLOCK(_time_tzlock);
  506. return result;
  507. }
  508. libc_hidden_def(localtime_r)
  509. #endif
  510. /**********************************************************************/
  511. #ifdef L__time_localtime_tzi
  512. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  513. struct ll_tzname_item;
  514. typedef struct ll_tzname_item {
  515. struct ll_tzname_item *next;
  516. char tzname[1];
  517. } ll_tzname_item_t;
  518. /* Structures form a list "UTC" -> "???" -> "tzname1" -> "tzname2"... */
  519. static struct {
  520. struct ll_tzname_item *next;
  521. char tzname[4];
  522. } ll_tzname_UNKNOWN = { NULL, "???" };
  523. static const struct {
  524. struct ll_tzname_item *next;
  525. char tzname[4];
  526. } ll_tzname_UTC = { (void*)&ll_tzname_UNKNOWN, "UTC" };
  527. static const char *lookup_tzname(const char *key)
  528. {
  529. int len;
  530. ll_tzname_item_t *p = (void*) &ll_tzname_UTC;
  531. do {
  532. if (strcmp(p->tzname, key) == 0)
  533. return p->tzname;
  534. p = p->next;
  535. } while (p != NULL);
  536. /* Hmm... a new name. */
  537. len = strnlen(key, TZNAME_MAX+1);
  538. if (len < TZNAME_MAX+1) { /* Verify legal length */
  539. p = malloc(sizeof(ll_tzname_item_t) + len);
  540. if (p != NULL) {
  541. /* Insert as 3rd item in the list. */
  542. p->next = ll_tzname_UNKNOWN.next;
  543. ll_tzname_UNKNOWN.next = p;
  544. return strcpy(p->tzname, key);
  545. }
  546. }
  547. /* Either invalid or couldn't alloc. */
  548. return ll_tzname_UNKNOWN.tzname;
  549. }
  550. #endif /* __UCLIBC_HAS_TM_EXTENSIONS__ */
  551. static const unsigned char day_cor[] = { /* non-leap */
  552. 31, 31, 34, 34, 35, 35, 36, 36, 36, 37, 37, 38, 38
  553. /* 0, 0, 3, 3, 4, 4, 5, 5, 5, 6, 6, 7, 7 */
  554. /* 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31 */
  555. };
  556. /* Note: timezone locking is done by localtime_r. */
  557. static int tm_isdst(register const struct tm *__restrict ptm,
  558. register rule_struct *r)
  559. {
  560. long sec;
  561. int i, isdst, isleap, day, day0, monlen, mday;
  562. int oday = oday; /* ok to be uninitialized, shutting up compiler warning */
  563. isdst = 0;
  564. if (r[1].tzname[0] != 0) {
  565. /* First, get the current seconds offset from the start of the year.
  566. * Fields of ptm are assumed to be in their normal ranges. */
  567. sec = ptm->tm_sec
  568. + 60 * (ptm->tm_min
  569. + 60 * (long)(ptm->tm_hour
  570. + 24 * ptm->tm_yday));
  571. /* Do some prep work. */
  572. i = (ptm->tm_year % 400) + 1900; /* Make sure we don't overflow. */
  573. isleap = __isleap(i);
  574. --i;
  575. day0 = (1
  576. + i /* Normal years increment 1 wday. */
  577. + (i/4)
  578. - (i/100)
  579. + (i/400) ) % 7;
  580. i = 0;
  581. do {
  582. day = r->day; /* Common for 'J' and # case. */
  583. if (r->rule_type == 'J') {
  584. if (!isleap || (day < (31+29))) {
  585. --day;
  586. }
  587. } else if (r->rule_type == 'M') {
  588. /* Find 0-based day number for 1st of the month. */
  589. day = 31 * r->month - day_cor[r->month - 1];
  590. if (isleap && (day >= 59)) {
  591. ++day;
  592. }
  593. monlen = 31 + day_cor[r->month - 1] - day_cor[r->month];
  594. if (isleap && (r->month == 2)) {
  595. ++monlen;
  596. }
  597. /* Weekday (0 is Sunday) of 1st of the month
  598. * is (day0 + day) % 7. */
  599. mday = r->day - ((day0 + day) % 7);
  600. if (mday >= 0) {
  601. mday -= 7; /* Back up into prev month since r->week > 0. */
  602. }
  603. mday += 7 * r->week;
  604. if (mday >= monlen) {
  605. mday -= 7;
  606. }
  607. /* So, 0-based day number is... */
  608. day += mday;
  609. }
  610. if (i != 0) {
  611. /* Adjust sec since dst->std change time is in dst. */
  612. sec += (r[-1].gmt_offset - r->gmt_offset);
  613. if (oday > day) {
  614. ++isdst; /* Year starts in dst. */
  615. }
  616. }
  617. oday = day;
  618. /* Now convert day to seconds and add offset and compare. */
  619. if (sec >= (day * 86400L) + r->dst_offset) {
  620. ++isdst;
  621. }
  622. ++r;
  623. } while (++i < 2);
  624. }
  625. return (isdst & 1);
  626. }
  627. struct tm attribute_hidden *__time_localtime_tzi(register const time_t *__restrict timer,
  628. register struct tm *__restrict result,
  629. rule_struct *tzi)
  630. {
  631. time_t x[1];
  632. long offset;
  633. int days, dst;
  634. dst = 0;
  635. do {
  636. days = -7;
  637. offset = 604800L - tzi[dst].gmt_offset;
  638. if (*timer > (LONG_MAX - 604800L)) {
  639. days = -days;
  640. offset = -offset;
  641. }
  642. *x = *timer + offset;
  643. _time_t2tm(x, days, result);
  644. result->tm_isdst = dst;
  645. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  646. # ifdef __USE_BSD
  647. result->tm_gmtoff = - tzi[dst].gmt_offset;
  648. result->tm_zone = lookup_tzname(tzi[dst].tzname);
  649. # else
  650. result->__tm_gmtoff = - tzi[dst].gmt_offset;
  651. result->__tm_zone = lookup_tzname(tzi[dst].tzname);
  652. # endif
  653. #endif /* __UCLIBC_HAS_TM_EXTENSIONS__ */
  654. } while ((++dst < 2)
  655. && ((result->tm_isdst = tm_isdst(result, tzi)) != 0));
  656. return result;
  657. }
  658. #endif
  659. /**********************************************************************/
  660. #ifdef L_mktime
  661. time_t mktime(struct tm *timeptr)
  662. {
  663. return _time_mktime(timeptr, 1);
  664. }
  665. /* Another name for `mktime'. */
  666. /* time_t timelocal(struct tm *tp) */
  667. strong_alias(mktime,timelocal)
  668. #endif
  669. /**********************************************************************/
  670. #ifdef L_timegm
  671. /* Like `mktime' but timeptr represents Universal Time, not local time. */
  672. time_t timegm(struct tm *timeptr)
  673. {
  674. rule_struct gmt_tzinfo[2];
  675. memset(gmt_tzinfo, 0, sizeof(gmt_tzinfo));
  676. strcpy(gmt_tzinfo[0].tzname, "GMT"); /* Match glibc behavior here. */
  677. return _time_mktime_tzi(timeptr, 1, gmt_tzinfo);
  678. }
  679. #endif
  680. /**********************************************************************/
  681. #if defined(L_strftime) || defined(L_strftime_l) \
  682. || defined(L_wcsftime) || defined(L_wcsftime_l)
  683. #if defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE)
  684. size_t strftime(CHAR_T *__restrict s, size_t maxsize,
  685. const CHAR_T *__restrict format,
  686. const struct tm *__restrict timeptr)
  687. {
  688. return strftime_l(s, maxsize, format, timeptr, __UCLIBC_CURLOCALE);
  689. }
  690. #else /* defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE) */
  691. #define NO_E_MOD 0x80
  692. #define NO_O_MOD 0x40
  693. #define ILLEGAL_SPEC 0x3f
  694. #define INT_SPEC 0x00 /* must be 0x00!! */
  695. #define STRING_SPEC 0x10 /* must be 0x10!! */
  696. #define CALC_SPEC 0x20
  697. #define STACKED_SPEC 0x30
  698. #define MASK_SPEC 0x30
  699. /* Compatibility:
  700. *
  701. * No alternate digit (%O?) handling. Always uses 0-9.
  702. * Alternate locale format (%E?) handling is broken for nontrivial ERAs.
  703. * glibc's %P is currently faked by %p. This means it doesn't do lower case.
  704. * glibc's %k, %l, and %s are handled.
  705. * glibc apparently allows (and ignores) extraneous 'E' and 'O' modifiers,
  706. * while they are flagged as illegal conversions here.
  707. */
  708. /* Warning: Assumes ASCII values! (as do lots of other things in the lib...) */
  709. static const unsigned char spec[] = {
  710. /* A */ 0x03 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  711. /* B */ 0x04 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  712. /* C */ 0x0a | INT_SPEC | NO_O_MOD,
  713. /* D */ 0x02 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  714. /* E */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  715. /* F */ 0x03 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  716. /* G */ 0x03 | CALC_SPEC | NO_E_MOD | NO_O_MOD,
  717. /* H */ 0x0b | INT_SPEC | NO_E_MOD,
  718. /* I */ 0x0c | INT_SPEC | NO_E_MOD,
  719. /* J */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  720. /* K */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  721. /* L */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  722. /* M */ 0x0d | INT_SPEC | NO_E_MOD,
  723. /* N */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  724. /* O */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  725. /* P */ 0x05 | STRING_SPEC | NO_E_MOD | NO_O_MOD, /* glibc ; use %p */
  726. /* Q */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  727. /* R */ 0x04 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  728. /* S */ 0x0e | INT_SPEC | NO_E_MOD,
  729. /* T */ 0x05 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  730. /* U */ 0x04 | CALC_SPEC | NO_E_MOD,
  731. /* V */ 0x05 | CALC_SPEC | NO_E_MOD,
  732. /* W */ 0x06 | CALC_SPEC | NO_E_MOD,
  733. /* X */ 0x0a | STACKED_SPEC | NO_O_MOD,
  734. /* Y */ 0x0f | INT_SPEC | NO_O_MOD,
  735. /* Z */ 0x01 | CALC_SPEC | NO_E_MOD | NO_O_MOD,
  736. '?', /* 26 */
  737. '?', /* 27 */
  738. '?', /* 28 */
  739. '?', /* 29 */
  740. 0, /* 30 */
  741. 0, /* 31 */
  742. /* a */ 0x00 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  743. /* b */ 0x01 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  744. /* c */ 0x08 | STACKED_SPEC | NO_O_MOD,
  745. /* d */ 0x00 | INT_SPEC | NO_E_MOD,
  746. /* e */ 0x01 | INT_SPEC | NO_E_MOD,
  747. /* f */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  748. /* g */ 0x02 | CALC_SPEC | NO_E_MOD | NO_O_MOD,
  749. /* h */ 0x01 | STRING_SPEC | NO_E_MOD | NO_O_MOD, /* same as b */
  750. /* i */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  751. /* j */ 0x08 | INT_SPEC | NO_E_MOD | NO_O_MOD,
  752. /* k */ 0x03 | INT_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  753. /* l */ 0x04 | INT_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  754. /* m */ 0x05 | INT_SPEC | NO_E_MOD,
  755. /* n */ 0x00 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  756. /* o */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  757. /* p */ 0x02 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  758. /* q */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  759. /* r */ 0x0b | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  760. /* s */ 0x07 | CALC_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  761. /* t */ 0x01 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  762. /* u */ 0x07 | INT_SPEC | NO_E_MOD,
  763. /* v */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  764. /* w */ 0x02 | INT_SPEC | NO_E_MOD,
  765. /* x */ 0x09 | STACKED_SPEC | NO_O_MOD,
  766. /* y */ 0x09 | INT_SPEC,
  767. /* z */ 0x00 | CALC_SPEC | NO_E_MOD | NO_O_MOD,
  768. /* WARNING!!! These are dependent on the layout of struct tm!!! */
  769. #define FIELD_MAX (26+6+26)
  770. 60 /* 61? */, 59, 23, 31, 11, 0 /* 9999 */, 6, 0 /* 365 */,
  771. #define TP_OFFSETS (FIELD_MAX+8)
  772. 3, /* d */
  773. 3, /* e */
  774. 6, /* w */
  775. 2, /* k */
  776. 2, /* l */
  777. 4, /* m */
  778. 0, /* CURRENTLY UNUSED */
  779. /* NOTE: u,j,y order must be preserved as 6,7,5 seq is used in the code! */
  780. #define CALC_OFFSETS (TP_OFFSETS + 7)
  781. 6, /* u */
  782. 7, /* j */
  783. 5, /* y */
  784. 5, /* C */
  785. 2, /* H */
  786. 2, /* I */
  787. 1, /* M */
  788. 0, /* S */
  789. 5, /* Y */
  790. 6, /* a */
  791. 4, /* b, h */
  792. 2, /* p */
  793. 6, /* A */
  794. 4, /* B */
  795. 2, /* P */
  796. #define TP_CODES (TP_OFFSETS + 16 + 6)
  797. 2 | 16, /* d */
  798. 2, /* e */
  799. 0 | 16, /* w */
  800. 2, /* k */
  801. 2 | 32 | 0, /* l */
  802. 2 | 16 | 1, /* m */
  803. 0, /* CURRENTLY UNUSED */
  804. 0 | 16 | 8 , /* u */
  805. 4 | 16 | 1, /* j */
  806. 2 | 128 | 32 | 16 , /* y */
  807. 2 | 128 | 64 | 32 | 16 , /* C */
  808. 2 | 16, /* H */
  809. 2 | 32 | 16 | 0, /* I */
  810. 2 | 16, /* M */
  811. 2 | 16, /* S */
  812. 6 | 16, /* Y */
  813. 2, /* a */
  814. 2, /* b, h */
  815. 2 | 64, /* p */
  816. 2, /* A */
  817. 2, /* B */
  818. 2 | 64, /* P */
  819. #define STRINGS_NL_ITEM_START (TP_CODES + 16 + 6)
  820. _NL_ITEM_INDEX(ABDAY_1), /* a */
  821. _NL_ITEM_INDEX(ABMON_1), /* b, h */
  822. _NL_ITEM_INDEX(AM_STR), /* p */
  823. _NL_ITEM_INDEX(DAY_1), /* A */
  824. _NL_ITEM_INDEX(MON_1), /* B */
  825. _NL_ITEM_INDEX(AM_STR), /* P -- wrong! need lower case */
  826. #define STACKED_STRINGS_START (STRINGS_NL_ITEM_START+6)
  827. 6, 7, 8, 16, 24, 29, /* 6 - offsets from offset-count to strings */
  828. '\n', 0, /* 2 */
  829. '\t', 0, /* 2 */
  830. '%', 'm', '/', '%', 'd', '/', '%', 'y', 0, /* 9 - %D */
  831. '%', 'Y', '-', '%', 'm', '-', '%', 'd', 0, /* 9 - %F (glibc extension) */
  832. '%', 'H', ':', '%', 'M', 0, /* 6 - %R*/
  833. '%', 'H', ':', '%', 'M', ':', '%', 'S', 0, /* 9 - %T */
  834. #define STACKED_STRINGS_NL_ITEM_START (STACKED_STRINGS_START + 43)
  835. _NL_ITEM_INDEX(D_T_FMT), /* c */
  836. _NL_ITEM_INDEX(D_FMT), /* x */
  837. _NL_ITEM_INDEX(T_FMT), /* X */
  838. _NL_ITEM_INDEX(T_FMT_AMPM), /* r */
  839. #ifdef ENABLE_ERA_CODE
  840. _NL_ITEM_INDEX(ERA_D_T_FMT), /* Ec */
  841. _NL_ITEM_INDEX(ERA_D_FMT), /* Ex */
  842. _NL_ITEM_INDEX(ERA_T_FMT), /* EX */
  843. #endif
  844. };
  845. static int load_field(int k, const struct tm *__restrict timeptr)
  846. {
  847. int r;
  848. int r_max;
  849. r = ((int *) timeptr)[k];
  850. r_max = spec[FIELD_MAX + k];
  851. if (k == 7) {
  852. r_max = 365;
  853. } else if (k == 5) {
  854. r += 1900;
  855. r_max = 9999;
  856. }
  857. if ((((unsigned int) r) > r_max) || ((k == 3) && !r)) {
  858. r = -1;
  859. }
  860. return r;
  861. }
  862. #if defined __UCLIBC_HAS_WCHAR__ && (defined L_wcsftime || defined L_wcsftime_l)
  863. static wchar_t* fmt_to_wc_1(const char *src)
  864. {
  865. mbstate_t mbstate;
  866. size_t src_len = strlen(src);
  867. wchar_t *dest = (wchar_t *)malloc((src_len + 1) * sizeof(wchar_t));
  868. if (dest == NULL)
  869. return NULL;
  870. mbstate.__mask = 0;
  871. if (mbsrtowcs(dest, &src, src_len + 1, &mbstate) == (size_t) -1) {
  872. free(dest);
  873. return NULL;
  874. }
  875. return dest;
  876. }
  877. # define fmt_to_wc(dest, src) \
  878. dest = alloc[++allocno] = fmt_to_wc_1(src)
  879. # define to_wc(dest, src) \
  880. dest = fmt_to_wc_1(src)
  881. #else
  882. # define fmt_to_wc(dest, src) (dest) = (src)
  883. # define to_wc(dest, src) (dest) = (src)
  884. #endif
  885. #define MAX_PUSH 4
  886. size_t __XL_NPP(strftime)(CHAR_T *__restrict s, size_t maxsize,
  887. const CHAR_T *__restrict format,
  888. const struct tm *__restrict timeptr __LOCALE_PARAM )
  889. {
  890. long tzo;
  891. register const CHAR_T *p;
  892. const CHAR_T *o;
  893. const char *ccp;
  894. #ifndef __UCLIBC_HAS_TM_EXTENSIONS__
  895. const rule_struct *rsp;
  896. #endif
  897. const CHAR_T *stack[MAX_PUSH];
  898. #if defined __UCLIBC_HAS_WCHAR__ && (defined L_wcsftime || defined L_wcsftime_l)
  899. const CHAR_T *alloc[MAX_PUSH];
  900. int allocno = -1;
  901. #endif
  902. size_t count;
  903. size_t o_count;
  904. int field_val = 0, i = 0, j, lvl;
  905. int x[3]; /* wday, yday, year */
  906. int isofm, days;
  907. char buf[__UIM_BUFLEN_LONG] = {0,};
  908. unsigned char mod;
  909. unsigned char code;
  910. /* We'll, let's get this out of the way. */
  911. _time_tzset(_time_mktime((struct tm *) timeptr, 0) < new_rule_starts);
  912. lvl = 0;
  913. p = format;
  914. count = maxsize;
  915. LOOP:
  916. if (!count) {
  917. return 0;
  918. }
  919. if (!*p) {
  920. if (lvl == 0) {
  921. *s = 0; /* nul-terminate */
  922. return maxsize - count;
  923. }
  924. p = stack[--lvl];
  925. goto LOOP;
  926. }
  927. o_count = 1;
  928. if ((*(o = (CHAR_T *)p) == '%') && (*++p != '%')) {
  929. #if 0 /* TODO, same for strptime */
  930. /* POSIX.1-2008 allows %0xY %+nY %-nY etc. for certain formats.
  931. * Just accept these for all (for now) */
  932. const int plus = *p == '+';
  933. CHAR_T *q = (CHAR_T *)p;
  934. long int o_width = __XL_NPP(strtol)(p, &q, 0 __LOCALE_ARG);
  935. if (o_width > 0 && o_width < 256) { /* arbitrary upper limit */
  936. o_count = o_width;
  937. if (plus) {
  938. *s++ = '+';
  939. --count;
  940. }
  941. p = q;
  942. } else {
  943. o_count = 2;
  944. }
  945. #else
  946. o_count = 2;
  947. #endif
  948. mod = ILLEGAL_SPEC;
  949. if ((*p == 'O') || (*p == 'E')) { /* modifier */
  950. mod |= ((*p == 'O') ? NO_O_MOD : NO_E_MOD);
  951. ++o_count;
  952. ++p;
  953. }
  954. if ((((unsigned char)(((*p) | 0x20) - 'a')) >= 26)
  955. || (((code = spec[(int)(*p - 'A')]) & mod) >= ILLEGAL_SPEC)
  956. ) {
  957. if (!*p) {
  958. --p;
  959. --o_count;
  960. }
  961. goto OUTPUT;
  962. }
  963. code &= ILLEGAL_SPEC; /* modifiers are preserved in mod var. */
  964. if ((code & MASK_SPEC) == STACKED_SPEC) {
  965. if (lvl == MAX_PUSH) {
  966. goto OUTPUT; /* Stack full so treat as illegal spec. */
  967. }
  968. stack[lvl++] = ++p;
  969. if ((code &= 0xf) < 8) {
  970. ccp = (const char *)(spec + STACKED_STRINGS_START + code);
  971. ccp += *ccp;
  972. fmt_to_wc(p, ccp);
  973. goto LOOP;
  974. }
  975. ccp = (const char *)spec + STACKED_STRINGS_NL_ITEM_START + (code & 7);
  976. fmt_to_wc(p, ccp);
  977. #ifdef ENABLE_ERA_CODE
  978. if ((mod & NO_E_MOD) /* Actually, this means E modifier present. */
  979. && (*(ccp = __XL_NPP(nl_langinfo)(_NL_ITEM(LC_TIME,
  980. (int)(((unsigned char *)p)[4]))
  981. __LOCALE_ARG
  982. )))
  983. ) {
  984. fmt_to_wc(p, ccp);
  985. goto LOOP;
  986. }
  987. #endif
  988. ccp = __XL_NPP(nl_langinfo)(_NL_ITEM(LC_TIME,
  989. (int)(*((unsigned char *)p)))
  990. __LOCALE_ARG
  991. );
  992. fmt_to_wc(p, ccp);
  993. goto LOOP;
  994. }
  995. ccp = (const char *)(spec + 26); /* set to "????" */
  996. if ((code & MASK_SPEC) == CALC_SPEC) {
  997. if (*p == 's') {
  998. time_t t;
  999. /* Use a cast to silence the warning since *timeptr won't
  1000. * be changed. */
  1001. if ((t = _time_mktime((struct tm *) timeptr, 0))
  1002. == ((time_t) -1)
  1003. ) {
  1004. o_count = 1;
  1005. goto OUTPUT;
  1006. }
  1007. #ifdef TIME_T_IS_UNSIGNED
  1008. ccp = _uintmaxtostr(buf + sizeof(buf) - 1,
  1009. (uintmax_t) t,
  1010. 10, __UIM_DECIMAL);
  1011. #else
  1012. ccp = _uintmaxtostr(buf + sizeof(buf) - 1,
  1013. (uintmax_t) t,
  1014. -10, __UIM_DECIMAL);
  1015. #endif
  1016. o_count = sizeof(buf);
  1017. fmt_to_wc(o, ccp);
  1018. goto OUTPUT;
  1019. } else if (((*p) | 0x20) == 'z') { /* 'z' or 'Z' */
  1020. if (timeptr->tm_isdst < 0) {
  1021. /* SUSv3 specifies this behavior for 'z', but we'll also
  1022. * treat it as "no timezone info" for 'Z' too. */
  1023. o_count = 0;
  1024. goto OUTPUT;
  1025. }
  1026. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  1027. # ifdef __USE_BSD
  1028. # define RSP_TZNAME timeptr->tm_zone
  1029. # define RSP_GMT_OFFSET (-timeptr->tm_gmtoff)
  1030. # else
  1031. # define RSP_TZNAME timeptr->__tm_zone
  1032. # define RSP_GMT_OFFSET (-timeptr->__tm_gmtoff)
  1033. # endif
  1034. #else
  1035. #define RSP_TZNAME rsp->tzname
  1036. #define RSP_GMT_OFFSET rsp->gmt_offset
  1037. __UCLIBC_MUTEX_LOCK(_time_tzlock);
  1038. rsp = _time_tzinfo;
  1039. if (timeptr->tm_isdst > 0) {
  1040. ++rsp;
  1041. }
  1042. #endif
  1043. if (*p == 'Z') {
  1044. ccp = RSP_TZNAME;
  1045. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  1046. /* Sigh... blasted glibc extensions. Of course we can't
  1047. * count on the pointer being valid. Best we can do is
  1048. * handle NULL, which looks to be all that glibc does.
  1049. * At least that catches the memset() with 0 case.
  1050. * NOTE: We handle this case differently than glibc!
  1051. * It uses system timezone name (based on tm_isdst) in this
  1052. * case... although it always seems to use the embedded
  1053. * tm_gmtoff value. What we'll do instead is treat the
  1054. * timezone name as unknown/invalid and return "???". */
  1055. if (!ccp) {
  1056. ccp = (const char *)(spec + 27); /* "???" */
  1057. }
  1058. #endif
  1059. assert(ccp != NULL);
  1060. #if 0
  1061. if (!ccp) { /* PARANOIA */
  1062. ccp = spec+30; /* empty string */
  1063. }
  1064. #endif
  1065. o_count = SIZE_MAX;
  1066. fmt_to_wc(o, ccp);
  1067. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  1068. goto OUTPUT;
  1069. #endif
  1070. } else { /* z */
  1071. *s = '+';
  1072. if ((tzo = -RSP_GMT_OFFSET) < 0) {
  1073. tzo = -tzo;
  1074. *s = '-';
  1075. }
  1076. ++s;
  1077. --count;
  1078. i = tzo / 60;
  1079. field_val = ((i / 60) * 100) + (i % 60);
  1080. i = 16 + 6; /* 0-fill, width = 4 */
  1081. }
  1082. #ifndef __UCLIBC_HAS_TM_EXTENSIONS__
  1083. __UCLIBC_MUTEX_UNLOCK(_time_tzlock);
  1084. if (*p == 'Z') {
  1085. goto OUTPUT;
  1086. }
  1087. #endif
  1088. } else {
  1089. /* TODO: don't need year for U, W */
  1090. for (i=0 ; i < 3 ; i++) {
  1091. if ((x[i] = load_field(spec[CALC_OFFSETS+i],timeptr)) < 0) {
  1092. goto OUTPUT;
  1093. }
  1094. }
  1095. i = 16 + 2; /* 0-fill, width = 2 */
  1096. if ((*p == 'U') || (*p == 'W')) {
  1097. field_val = ((x[1] - x[0]) + 7);
  1098. if (*p == 'W') {
  1099. ++field_val;
  1100. }
  1101. field_val /= 7;
  1102. if ((*p == 'W') && !x[0]) {
  1103. --field_val;
  1104. }
  1105. } else { /* ((*p == 'g') || (*p == 'G') || (*p == 'V')) */
  1106. ISO_LOOP:
  1107. isofm = (((x[1] - x[0]) + 11) % 7) - 3; /* [-3,3] */
  1108. if (x[1] < isofm) { /* belongs to previous year */
  1109. --x[2];
  1110. x[1] += 365 + __isleap(x[2]);
  1111. goto ISO_LOOP;
  1112. }
  1113. field_val = ((x[1] - isofm) / 7) + 1; /* week # */
  1114. days = 365 + __isleap(x[2]);
  1115. isofm = ((isofm + 7*53 + 3 - days)) % 7 + days - 3; /* next year */
  1116. if (x[1] >= isofm) { /* next year */
  1117. x[1] -= days;
  1118. ++x[2];
  1119. goto ISO_LOOP;
  1120. }
  1121. if (*p != 'V') { /* need year */
  1122. field_val = x[2]; /* TODO: what if x[2] now 10000 ?? */
  1123. if (*p == 'g') {
  1124. field_val %= 100;
  1125. } else {
  1126. i = 16 + 6; /* 0-fill, width = 4 */
  1127. }
  1128. }
  1129. }
  1130. }
  1131. } else {
  1132. i = TP_OFFSETS + (code & 0x1f);
  1133. if ((field_val = load_field(spec[i], timeptr)) < 0) {
  1134. goto OUTPUT;
  1135. }
  1136. i = spec[i+(TP_CODES - TP_OFFSETS)];
  1137. j = (i & 128) ? 100: 12;
  1138. if (i & 64) {
  1139. field_val /= j;;
  1140. }
  1141. if (i & 32) {
  1142. field_val %= j;
  1143. if (((i & 128) + field_val) == 0) { /* mod 12? == 0 */
  1144. field_val = j; /* set to 12 */
  1145. }
  1146. }
  1147. field_val += (i & 1);
  1148. if ((i & 8) && !field_val) {
  1149. field_val += 7;
  1150. }
  1151. }
  1152. if ((code & MASK_SPEC) == STRING_SPEC) {
  1153. o_count = SIZE_MAX;
  1154. field_val += spec[STRINGS_NL_ITEM_START + (code & 0xf)];
  1155. ccp = __XL_NPP(nl_langinfo)(_NL_ITEM(LC_TIME, field_val) __LOCALE_ARG);
  1156. fmt_to_wc(o, ccp);
  1157. } else {
  1158. #if 0 /* TODO, same for strptime */
  1159. size_t min_count = ((i >> 1) & 3) + 1;
  1160. if (o_count < min_count)
  1161. o_count = min_count;
  1162. #else
  1163. o_count = ((i >> 1) & 3) + 1;
  1164. #endif
  1165. ccp = buf + o_count;
  1166. do {
  1167. *(char *)(--ccp) = '0' + (field_val % 10);
  1168. field_val /= 10;
  1169. } while (ccp > buf);
  1170. if (*buf == '0') {
  1171. *buf = ' ' + (i & 16);
  1172. }
  1173. fmt_to_wc(o, ccp);
  1174. }
  1175. }
  1176. OUTPUT:
  1177. ++p;
  1178. while (o_count && count && *o) {
  1179. *s++ = *o++;
  1180. --o_count;
  1181. --count;
  1182. }
  1183. #if defined __UCLIBC_HAS_WCHAR__ && (defined L_wcsftime || defined L_wcsftime_l)
  1184. if (allocno >= 0)
  1185. free((void *)alloc[allocno--]);
  1186. #endif
  1187. goto LOOP;
  1188. }
  1189. # ifdef L_strftime_l
  1190. libc_hidden_def(strftime_l)
  1191. # endif
  1192. #endif /* defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE) */
  1193. #endif
  1194. /**********************************************************************/
  1195. #if defined(L_strptime) || defined(L_strptime_l)
  1196. #define ISDIGIT(C) __isdigit_char((C))
  1197. #ifdef __UCLIBC_DO_XLOCALE
  1198. #define ISSPACE(C) isspace_l((C), locale_arg)
  1199. #else
  1200. #define ISSPACE(C) isspace((C))
  1201. #endif
  1202. #if defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE)
  1203. char *strptime(const char *__restrict buf, const char *__restrict format,
  1204. struct tm *__restrict tm)
  1205. {
  1206. return strptime_l(buf, format, tm, __UCLIBC_CURLOCALE);
  1207. }
  1208. #else /* defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE) */
  1209. /* TODO:
  1210. * 1) %l and %k are space-padded, so "%l" by itself fails while " %l" succeeds.
  1211. * Both work for glibc. So, should we always strip spaces?
  1212. * 2) %Z
  1213. */
  1214. /* Notes:
  1215. * There are several differences between this strptime and glibc's strptime.
  1216. * 1) glibc strips leading space before numeric conversions.
  1217. * 2) glibc will read fields without whitespace in between. SUSv3 states
  1218. * that you must have whitespace between conversion operators. Besides,
  1219. * how do you know how long a number should be if there are leading 0s?
  1220. * 3) glibc attempts to compute some the struct tm fields based on the
  1221. * data retrieved; tm_wday in particular. I don't as I consider it
  1222. * another glibc attempt at mind-reading...
  1223. */
  1224. #define NO_E_MOD 0x80
  1225. #define NO_O_MOD 0x40
  1226. #define ILLEGAL_SPEC 0x3f
  1227. #define INT_SPEC 0x00 /* must be 0x00!! */
  1228. #define STRING_SPEC 0x10 /* must be 0x10!! */
  1229. #define CALC_SPEC 0x20
  1230. #define STACKED_SPEC 0x30
  1231. #define MASK_SPEC 0x30
  1232. /* Warning: Assumes ASCII values! (as do lots of other things in the lib...) */
  1233. static const unsigned char spec[] = {
  1234. /* A */ 0x02 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  1235. /* B */ 0x01 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  1236. /* C */ 0x08 | INT_SPEC | NO_O_MOD,
  1237. /* D */ 0x01 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  1238. /* E */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1239. /* F */ 0x02 | STACKED_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1240. /* G */ 0x0f | INT_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1241. /* H */ 0x06 | INT_SPEC | NO_E_MOD,
  1242. /* I */ 0x07 | INT_SPEC | NO_E_MOD,
  1243. /* J */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1244. /* K */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1245. /* L */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1246. /* M */ 0x04 | INT_SPEC | NO_E_MOD,
  1247. /* N */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1248. /* O */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1249. /* P */ 0x00 | STRING_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1250. /* Q */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1251. /* R */ 0x03 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  1252. /* S */ 0x05 | INT_SPEC | NO_E_MOD,
  1253. /* T */ 0x04 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  1254. /* U */ 0x0c | INT_SPEC | NO_E_MOD,
  1255. /* V */ 0x0d | INT_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1256. /* W */ 0x0c | INT_SPEC | NO_E_MOD,
  1257. /* X */ 0x0a | STACKED_SPEC | NO_O_MOD,
  1258. /* Y */ 0x0a | INT_SPEC | NO_O_MOD,
  1259. /* Z */ 0x02 | CALC_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1260. /* WARNING! This assumes orderings:
  1261. * AM,PM
  1262. * ABDAY_1-ABDAY-7,DAY_1-DAY_7
  1263. * ABMON_1-ABMON_12,MON_1-MON12
  1264. * Also, there are exactly 6 bytes between 'Z' and 'a'.
  1265. */
  1266. #define STRINGS_NL_ITEM_START (26)
  1267. _NL_ITEM_INDEX(AM_STR), /* p (P) */
  1268. _NL_ITEM_INDEX(ABMON_1), /* B, b */
  1269. _NL_ITEM_INDEX(ABDAY_1), /* A, a */
  1270. 2,
  1271. 24,
  1272. 14,
  1273. /* a */ 0x02 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  1274. /* b */ 0x01 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  1275. /* c */ 0x08 | STACKED_SPEC | NO_O_MOD,
  1276. /* d */ 0x00 | INT_SPEC | NO_E_MOD,
  1277. /* e */ 0x00 | INT_SPEC | NO_E_MOD,
  1278. /* f */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1279. /* g */ 0x0e | INT_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1280. /* h */ 0x01 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  1281. /* i */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1282. /* j */ 0x01 | INT_SPEC | NO_E_MOD | NO_O_MOD,
  1283. /* k */ 0x06 | INT_SPEC | NO_E_MOD, /* glibc */
  1284. /* l */ 0x07 | INT_SPEC | NO_E_MOD, /* glibc */
  1285. /* m */ 0x02 | INT_SPEC | NO_E_MOD,
  1286. /* n */ 0x00 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  1287. /* o */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1288. /* p */ 0x00 | STRING_SPEC | NO_E_MOD | NO_O_MOD,
  1289. /* q */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1290. /* r */ 0x0b | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  1291. /* s */ 0x00 | CALC_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1292. /* t */ 0x00 | STACKED_SPEC | NO_E_MOD | NO_O_MOD,
  1293. /* u */ 0x0b | INT_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1294. /* v */ ILLEGAL_SPEC | NO_E_MOD | NO_O_MOD,
  1295. /* w */ 0x03 | INT_SPEC | NO_E_MOD,
  1296. /* x */ 0x09 | STACKED_SPEC | NO_O_MOD,
  1297. /* y */ 0x09 | INT_SPEC,
  1298. /* z */ 0x01 | CALC_SPEC | NO_E_MOD | NO_O_MOD, /* glibc */
  1299. #define INT_FIELD_START (26+6+26)
  1300. /* (field #) << 3 + lower bound (0|1) + correction 0:none, 2:-1, 4:-1900
  1301. * followed by upper bound prior to correction with 1=>366 and 2=>9999. */
  1302. /* d, e */ (3 << 3) + 1 + 0, 31,
  1303. /* j */ (7 << 3) + 1 + 2, /* 366 */ 1,
  1304. /* m */ (4 << 3) + 1 + 2, 12,
  1305. /* w */ (6 << 3) + 0 + 0, 6,
  1306. /* M */ (1 << 3) + 0 + 0, 59,
  1307. /* S */ 0 + 0 + 0, 60,
  1308. /* H (k) */ (2 << 3) + 0 + 0, 23,
  1309. /* I (l) */ (9 << 3) + 1 + 0, 12, /* goes with 8 -- am/pm */
  1310. /* C */ (10<< 3) + 0 + 0, 99,
  1311. /* y */ (11<< 3) + 0 + 0, 99,
  1312. /* Y */ (5 << 3) + 0 + 4, /* 9999 */ 2,
  1313. /* u */ (6 << 3) + 1 + 0, 7,
  1314. /* The following are processed and range-checked, but ignored otherwise. */
  1315. /* U, W */ (12<< 3) + 0 + 0, 53,
  1316. /* V */ (12<< 3) + 1 + 0, 53,
  1317. /* g */ (12<< 3) + 0 + 0, 99,
  1318. /* G */ (12<< 3) + 0 /*+ 4*/, /* 9999 */ 2, /* Note: -1 or 10000? */
  1319. #define STACKED_STRINGS_START (INT_FIELD_START+32)
  1320. 5, 6, 14, 22, 27, /* 5 - offsets from offset-count to strings */
  1321. ' ', 0, /* 2 - %n or %t */
  1322. '%', 'm', '/', '%', 'd', '/', '%', 'y', 0, /* 9 - %D */
  1323. '%', 'Y', '-', '%', 'm', '-', '%', 'd', 0, /* 9 - %F (glibc extension) */
  1324. '%', 'H', ':', '%', 'M', 0, /* 6 - %R*/
  1325. '%', 'H', ':', '%', 'M', ':', '%', 'S', 0, /* 9 - %T */
  1326. #define STACKED_STRINGS_NL_ITEM_START (STACKED_STRINGS_START + 40)
  1327. _NL_ITEM_INDEX(D_T_FMT), /* c */
  1328. _NL_ITEM_INDEX(D_FMT), /* x */
  1329. _NL_ITEM_INDEX(T_FMT), /* X */
  1330. _NL_ITEM_INDEX(T_FMT_AMPM), /* r */
  1331. #ifdef ENABLE_ERA_CODE
  1332. _NL_ITEM_INDEX(ERA_D_T_FMT), /* Ec */
  1333. _NL_ITEM_INDEX(ERA_D_FMT), /* Ex */
  1334. _NL_ITEM_INDEX(ERA_T_FMT), /* EX */
  1335. #endif
  1336. };
  1337. #define MAX_PUSH 4
  1338. char *__XL_NPP(strptime)(const char *__restrict buf, const char *__restrict format,
  1339. struct tm *__restrict tm __LOCALE_PARAM)
  1340. {
  1341. register const char *p;
  1342. char *o;
  1343. const char *stack[MAX_PUSH];
  1344. int i, j, lvl;
  1345. int fields[13];
  1346. unsigned char mod;
  1347. unsigned char code;
  1348. i = 0;
  1349. do {
  1350. fields[i] = INT_MIN;
  1351. } while (++i < 13);
  1352. lvl = 0;
  1353. p = format;
  1354. LOOP:
  1355. if (!*p) {
  1356. if (lvl == 0) { /* Done. */
  1357. if (fields[6] == 7) { /* Cleanup for %u here since just once. */
  1358. fields[6] = 0; /* Don't use mod in case unset. */
  1359. }
  1360. i = 0;
  1361. do { /* Store the values into tm. */
  1362. if (fields[i] != INT_MIN) {
  1363. ((int *) tm)[i] = fields[i];
  1364. }
  1365. } while (++i < 8);
  1366. return (char *) buf; /* Success. */
  1367. }
  1368. p = stack[--lvl];
  1369. goto LOOP;
  1370. }
  1371. if ((*p == '%') && (*++p != '%')) {
  1372. mod = ILLEGAL_SPEC;
  1373. if ((*p == 'O') || (*p == 'E')) { /* Modifier? */
  1374. mod |= ((*p == 'O') ? NO_O_MOD : NO_E_MOD);
  1375. ++p;
  1376. }
  1377. if (!*p
  1378. || (((unsigned char)(((*p) | 0x20) - 'a')) >= 26)
  1379. || (((code = spec[(int)(*p - 'A')]) & mod) >= ILLEGAL_SPEC)
  1380. ) {
  1381. return NULL; /* Illegal spec. */
  1382. }
  1383. if ((code & MASK_SPEC) == STACKED_SPEC) {
  1384. if (lvl == MAX_PUSH) {
  1385. return NULL; /* Stack full so treat as illegal spec. */
  1386. }
  1387. stack[lvl++] = ++p;
  1388. if ((code &= 0xf) < 8) {
  1389. p = ((const char *) spec) + STACKED_STRINGS_START + code;
  1390. p += *((unsigned char *)p);
  1391. goto LOOP;
  1392. }
  1393. p = ((const char *) spec) + STACKED_STRINGS_NL_ITEM_START
  1394. + (code & 7);
  1395. #ifdef ENABLE_ERA_CODE
  1396. if ((mod & NO_E_MOD) /* Actually, this means E modifier present. */
  1397. && (*(o = __XL_NPP(nl_langinfo)(_NL_ITEM(LC_TIME,
  1398. (int)(((unsigned char *)p)[4]))
  1399. __LOCALE_ARG
  1400. )))
  1401. ) {
  1402. p = o;
  1403. goto LOOP;
  1404. }
  1405. #endif
  1406. p = __XL_NPP(nl_langinfo)(_NL_ITEM(LC_TIME,
  1407. (int)(*((unsigned char *)p)))
  1408. __LOCALE_ARG
  1409. );
  1410. goto LOOP;
  1411. }
  1412. ++p;
  1413. if ((code & MASK_SPEC) == STRING_SPEC) {
  1414. code &= 0xf;
  1415. j = spec[STRINGS_NL_ITEM_START + 3 + code];
  1416. i = _NL_ITEM(LC_TIME, spec[STRINGS_NL_ITEM_START + code]);
  1417. /* Go backwards to check full names before abreviations. */
  1418. do {
  1419. --j;
  1420. o = __XL_NPP(nl_langinfo)(i+j __LOCALE_ARG);
  1421. if (!__XL_NPP(strncasecmp)(buf, o, strlen(o) __LOCALE_ARG) && *o) {
  1422. do { /* Found a match. */
  1423. ++buf;
  1424. } while (*++o);
  1425. if (!code) { /* am/pm */
  1426. fields[8] = j * 12;
  1427. if (fields[9] >= 0) { /* We have a previous %I or %l. */
  1428. fields[2] = fields[9] + fields[8];
  1429. }
  1430. } else { /* day (4) or month (6) */
  1431. fields[2 + (code << 1)]
  1432. = j % (spec[STRINGS_NL_ITEM_START + 3 + code] >> 1);
  1433. }
  1434. goto LOOP;
  1435. }
  1436. } while (j);
  1437. return NULL; /* Failed to match. */
  1438. }
  1439. if ((code & MASK_SPEC) == CALC_SPEC) {
  1440. if ((code &= 0xf) < 1) { /* s or z*/
  1441. time_t t;
  1442. o = (char *) buf;
  1443. i = errno;
  1444. __set_errno(0);
  1445. if (!ISSPACE(*buf)) { /* Signal an error if whitespace. */
  1446. #ifdef TIME_T_IS_UNSIGNED
  1447. t = __XL_NPP(strtoul)(buf, &o, 10 __LOCALE_ARG);
  1448. #else
  1449. t = __XL_NPP(strtol)(buf, &o, 10 __LOCALE_ARG);
  1450. #endif
  1451. }
  1452. if ((o == buf) || errno) { /* Not a number or overflow. */
  1453. return NULL;
  1454. }
  1455. __set_errno(i); /* Restore errno. */
  1456. buf = o;
  1457. if (!code) { /* s */
  1458. localtime_r(&t, tm); /* TODO: check for failure? */
  1459. i = 0;
  1460. do { /* Now copy values from tm to fields. */
  1461. fields[i] = ((int *) tm)[i];
  1462. } while (++i < 8);
  1463. }
  1464. }
  1465. /* TODO: glibc treats %Z as a nop. For now, do the same. */
  1466. goto LOOP;
  1467. }
  1468. assert((code & MASK_SPEC) == INT_SPEC);
  1469. {
  1470. register const unsigned char *x;
  1471. code &= 0xf;
  1472. x = spec + INT_FIELD_START + (code << 1);
  1473. if ((j = x[1]) < 3) { /* upper bound (inclusive) */
  1474. j = ((j==1) ? 366 : 9999);
  1475. }
  1476. i = -1;
  1477. while (ISDIGIT(*buf)) {
  1478. if (i < 0) {
  1479. i = 0;
  1480. }
  1481. if ((i = 10*i + (*buf - '0')) > j) { /* Overflow. */
  1482. return NULL;
  1483. }
  1484. ++buf;
  1485. }
  1486. if (i < (*x & 1)) { /* This catches no-digit case too. */
  1487. return NULL;
  1488. }
  1489. if (*x & 2) {
  1490. --i;
  1491. }
  1492. if (*x & 4) {
  1493. i -= 1900;
  1494. }
  1495. if (*x == (9 << 3) + 1 + 0) { /* %I or %l */
  1496. if (i == 12) {
  1497. i = 0;
  1498. }
  1499. if (fields[8] >= 0) { /* We have a previous %p or %P. */
  1500. fields[2] = i + fields[8];
  1501. }
  1502. }
  1503. fields[(*x) >> 3] = i;
  1504. if (((unsigned char)(*x - (10 << 3) + 0 + 0)) <= 8) { /* %C or %y */
  1505. if ((j = fields[10]) < 0) { /* No %C, so i must be %y data. */
  1506. if (i <= 68) { /* Map [0-68] to 2000+i */
  1507. i += 100;
  1508. }
  1509. } else { /* Have %C data, but what about %y? */
  1510. if ((i = fields[11]) < 0) { /* No %y data. */
  1511. i = 0; /* Treat %y val as 0 following glibc's example. */
  1512. }
  1513. i += 100*(j - 19);
  1514. }
  1515. fields[5] = i;
  1516. }
  1517. }
  1518. goto LOOP;
  1519. } else if (ISSPACE(*p)) {
  1520. ++p;
  1521. while (ISSPACE(*buf)) {
  1522. ++buf;
  1523. }
  1524. goto LOOP;
  1525. } else if (*buf++ == *p++) {
  1526. goto LOOP;
  1527. }
  1528. return NULL;
  1529. }
  1530. # ifdef L_strptime_l
  1531. libc_hidden_def(strptime_l)
  1532. # endif
  1533. #endif /* defined(__UCLIBC_HAS_XLOCALE__) && !defined(__UCLIBC_DO_XLOCALE) */
  1534. #endif
  1535. /**********************************************************************/
  1536. #ifdef L_time
  1537. #ifndef __BCC__
  1538. #error The uClibc version of time is in sysdeps/linux/common.
  1539. #endif
  1540. time_t time(register time_t *tloc)
  1541. {
  1542. struct timeval tv;
  1543. register struct timeval *p = &tv;
  1544. gettimeofday(p, NULL); /* This should never fail... */
  1545. if (tloc) {
  1546. *tloc = p->tv_sec;
  1547. }
  1548. return p->tv_sec;
  1549. }
  1550. #endif
  1551. /**********************************************************************/
  1552. #ifdef L_tzset
  1553. static const char vals[] = {
  1554. 'T', 'Z', 0, /* 3 */
  1555. 'U', 'T', 'C', 0, /* 4 */
  1556. 25, 60, 60, 1, /* 4 */
  1557. '.', 1, /* M */
  1558. 5, '.', 1,
  1559. 6, 0, 0, /* Note: overloaded for non-M non-J case... */
  1560. 0, 1, 0, /* J */
  1561. ',', 'M', '4', '.', '1', '.', '0',
  1562. ',', 'M', '1', '0', '.', '5', '.', '0', 0,
  1563. ',', 'M', '3', '.', '2', '.', '0',
  1564. ',', 'M', '1', '1', '.', '1', '.', '0', 0
  1565. };
  1566. #define TZ vals
  1567. #define UTC (vals + 3)
  1568. #define RANGE (vals + 7)
  1569. #define RULE (vals + 11 - 1)
  1570. #define DEFAULT_RULES (vals + 22)
  1571. #define DEFAULT_2007_RULES (vals + 38)
  1572. /* Initialize to UTC. */
  1573. int daylight = 0;
  1574. long timezone = 0;
  1575. char *tzname[2] = { (char *) UTC, (char *) (UTC-1) };
  1576. __UCLIBC_MUTEX_INIT(_time_tzlock, PTHREAD_RECURSIVE_MUTEX_INITIALIZER_NP);
  1577. rule_struct _time_tzinfo[2];
  1578. static const char *getoffset(register const char *e, long *pn)
  1579. {
  1580. register const char *s = RANGE-1;
  1581. long n;
  1582. int f;
  1583. n = 0;
  1584. f = -1;
  1585. do {
  1586. ++s;
  1587. if (__isdigit_char(*e)) {
  1588. f = *e++ - '0';
  1589. }
  1590. if (__isdigit_char(*e)) {
  1591. f = 10 * f + (*e++ - '0');
  1592. }
  1593. if (((unsigned int)f) >= *s) {
  1594. return NULL;
  1595. }
  1596. n = (*s) * n + f;
  1597. f = 0;
  1598. if (*e == ':') {
  1599. ++e;
  1600. --f;
  1601. }
  1602. } while (*s > 1);
  1603. *pn = n;
  1604. return e;
  1605. }
  1606. static const char *getnumber(register const char *e, int *pn)
  1607. {
  1608. #ifdef __BCC__
  1609. /* bcc can optimize the counter if it thinks it is a pointer... */
  1610. register const char *n = (const char *) 3;
  1611. int f;
  1612. f = 0;
  1613. while (n && __isdigit_char(*e)) {
  1614. f = 10 * f + (*e++ - '0');
  1615. --n;
  1616. }
  1617. *pn = f;
  1618. return (n == (const char *) 3) ? NULL : e;
  1619. #else /* __BCC__ */
  1620. int n, f;
  1621. n = 3;
  1622. f = 0;
  1623. while (n && __isdigit_char(*e)) {
  1624. f = 10 * f + (*e++ - '0');
  1625. --n;
  1626. }
  1627. *pn = f;
  1628. return (n == 3) ? NULL : e;
  1629. #endif /* __BCC__ */
  1630. }
  1631. #ifdef __UCLIBC_HAS_TZ_FILE__
  1632. #ifndef __UCLIBC_HAS_TZ_FILE_READ_MANY__
  1633. static smallint TZ_file_read; /* Let BSS initialization set this to 0. */
  1634. #endif
  1635. static char *read_TZ_file(char *buf)
  1636. {
  1637. int r;
  1638. int fd;
  1639. char *p = NULL;
  1640. fd = open(__UCLIBC_TZ_FILE_PATH__, O_RDONLY);
  1641. if (fd >= 0) {
  1642. #if 0
  1643. /* TZ are small *files*. On files, short reads
  1644. * only occur on EOF (unlike, say, pipes).
  1645. * The code below is pedanticallly more correct,
  1646. * but this way we always read at least twice:
  1647. * 1st read is short, 2nd one is zero bytes.
  1648. */
  1649. size_t todo = TZ_BUFLEN;
  1650. p = buf;
  1651. do {
  1652. r = read(fd, p, todo);
  1653. if (r < 0)
  1654. goto ERROR;
  1655. if (r == 0)
  1656. break;
  1657. p += r;
  1658. todo -= r;
  1659. } while (todo);
  1660. #else
  1661. /* Shorter, and does one fewer read syscall */
  1662. r = read(fd, buf, TZ_BUFLEN);
  1663. if (r < 0)
  1664. goto ERROR;
  1665. p = buf + r;
  1666. #endif
  1667. if ((p > buf) && (p[-1] == '\n')) { /* Must end with newline */
  1668. p[-1] = 0;
  1669. p = buf;
  1670. #ifndef __UCLIBC_HAS_TZ_FILE_READ_MANY__
  1671. TZ_file_read = 1;
  1672. #endif
  1673. } else {
  1674. ERROR:
  1675. p = NULL;
  1676. }
  1677. close(fd);
  1678. }
  1679. #ifdef __UCLIBC_FALLBACK_TO_ETC_LOCALTIME__
  1680. else {
  1681. fd = open("/etc/localtime", O_RDONLY);
  1682. if (fd >= 0) {
  1683. r = read(fd, buf, TZ_BUFLEN);
  1684. if (r != TZ_BUFLEN
  1685. || strncmp(buf, "TZif", 4) != 0
  1686. || (unsigned char)buf[4] < 2
  1687. || lseek(fd, -TZ_BUFLEN, SEEK_END) < 0
  1688. ) {
  1689. goto ERROR;
  1690. }
  1691. /* tzfile.h from tzcode database says about TZif2+ files:
  1692. **
  1693. ** If tzh_version is '2' or greater, the above is followed by a second instance
  1694. ** of tzhead and a second instance of the data in which each coded transition
  1695. ** time uses 8 rather than 4 chars,
  1696. ** then a POSIX-TZ-environment-variable-style string for use in handling
  1697. ** instants after the last transition time stored in the file
  1698. ** (with nothing between the newlines if there is no POSIX representation for
  1699. ** such instants).
  1700. */
  1701. r = read(fd, buf, TZ_BUFLEN);
  1702. if (r <= 0 || buf[--r] != '\n')
  1703. goto ERROR;
  1704. buf[r] = 0;
  1705. while (r != 0) {
  1706. if (buf[--r] == '\n') {
  1707. p = buf + r + 1;
  1708. #ifndef __UCLIBC_HAS_TZ_FILE_READ_MANY__
  1709. TZ_file_read = 1;
  1710. #endif
  1711. break;
  1712. }
  1713. } /* else ('\n' not found): p remains NULL */
  1714. close(fd);
  1715. }
  1716. }
  1717. #endif /* __UCLIBC_FALLBACK_TO_ETC_LOCALTIME__ */
  1718. return p;
  1719. }
  1720. #endif /* __UCLIBC_HAS_TZ_FILE__ */
  1721. void tzset(void)
  1722. {
  1723. _time_tzset((time(NULL)) < new_rule_starts);
  1724. }
  1725. void _time_tzset(int use_old_rules)
  1726. {
  1727. register const char *e;
  1728. register char *s;
  1729. long off = 0;
  1730. short *p;
  1731. rule_struct new_rules[2];
  1732. int n, count, f;
  1733. char c;
  1734. #ifdef __UCLIBC_HAS_TZ_FILE__
  1735. char buf[TZ_BUFLEN];
  1736. #endif
  1737. #ifdef __UCLIBC_HAS_TZ_CACHING__
  1738. static char oldval[TZ_BUFLEN]; /* BSS-zero'd. */
  1739. #endif
  1740. /* Put this inside the lock to prevent the possibility of two different
  1741. * timezones being used in a threaded app. */
  1742. __UCLIBC_MUTEX_LOCK(_time_tzlock);
  1743. e = getenv(TZ); /* TZ env var always takes precedence. */
  1744. #if defined(__UCLIBC_HAS_TZ_FILE__) && !defined(__UCLIBC_HAS_TZ_FILE_READ_MANY__)
  1745. if (e) {
  1746. /* Never use TZfile if TZ env var is set. */
  1747. TZ_file_read = 0;
  1748. }
  1749. if (TZ_file_read) {
  1750. /* We already parsed TZfile before, skip everything. */
  1751. goto FAST_DONE;
  1752. }
  1753. #endif
  1754. /* Warning!!! Since uClibc doesn't do lib locking, the following is
  1755. * potentially unsafe in a multi-threaded program since it is remotely
  1756. * possible that another thread could call setenv() for TZ and overwrite
  1757. * the string being parsed. So, don't do that... */
  1758. #ifdef __UCLIBC_HAS_TZ_FILE__
  1759. if (!e)
  1760. e = read_TZ_file(buf);
  1761. #endif
  1762. if (!e /* TZ env var not set and no TZfile (or bad TZfile) */
  1763. || !*e /* or set to empty string. */
  1764. ) {
  1765. goto ILLEGAL;
  1766. }
  1767. if (*e == ':') { /* Ignore leading ':'. */
  1768. ++e;
  1769. }
  1770. #ifdef __UCLIBC_HAS_TZ_CACHING__
  1771. if (strcmp(e, oldval) == 0) {
  1772. /* Same string as last time... nothing to do. */
  1773. goto FAST_DONE;
  1774. }
  1775. /* Make a copy of the TZ env string. It won't be nul-terminated if
  1776. * it is too long, but it that case it will be illegal and will be reset
  1777. * to the empty string anyway. */
  1778. strncpy(oldval, e, TZ_BUFLEN);
  1779. #endif
  1780. count = 0;
  1781. new_rules[1].tzname[0] = 0;
  1782. LOOP:
  1783. /* Get std or dst name. */
  1784. c = 0;
  1785. if (*e == '<') {
  1786. ++e;
  1787. c = '>';
  1788. }
  1789. s = new_rules[count].tzname;
  1790. n = 0;
  1791. while (*e
  1792. && isascii(*e) /* SUSv3 requires char in portable char set. */
  1793. && (isalpha(*e)
  1794. || (c && (isalnum(*e) || (*e == '+') || (*e == '-')))
  1795. )
  1796. ) {
  1797. *s++ = *e++;
  1798. if (++n > TZNAME_MAX) {
  1799. goto ILLEGAL;
  1800. }
  1801. }
  1802. *s = 0;
  1803. if ((n < 3) /* Check for minimum length. */
  1804. || (c && (*e++ != c)) /* Match any quoting '<'. */
  1805. ) {
  1806. goto ILLEGAL;
  1807. }
  1808. /* Get offset */
  1809. s = (char *) e;
  1810. if ((*e != '-') && (*e != '+')) {
  1811. if (count && !__isdigit_char(*e)) {
  1812. off -= 3600; /* Default to 1 hour ahead of std. */
  1813. goto SKIP_OFFSET;
  1814. }
  1815. --e;
  1816. }
  1817. ++e;
  1818. e = getoffset(e, &off);
  1819. if (!e) {
  1820. goto ILLEGAL;
  1821. }
  1822. if (*s == '-') {
  1823. off = -off; /* Save off in case needed for dst default. */
  1824. }
  1825. SKIP_OFFSET:
  1826. new_rules[count].gmt_offset = off;
  1827. if (!count) {
  1828. new_rules[1].gmt_offset = off; /* Shouldn't be needed... */
  1829. if (*e) {
  1830. ++count;
  1831. goto LOOP;
  1832. }
  1833. } else { /* OK, we have dst, so get some rules. */
  1834. count = 0;
  1835. if (!*e) { /* No rules so default to US rules. */
  1836. e = use_old_rules ? DEFAULT_RULES : DEFAULT_2007_RULES;
  1837. #ifdef DEBUG_TZSET
  1838. if (e == DEFAULT_RULES)
  1839. printf("tzset: Using old rules.\n");
  1840. else if (e == DEFAULT_2007_RULES)
  1841. printf("tzset: Using new rules\n");
  1842. else
  1843. printf("tzset: Using undefined rules\n");
  1844. #endif
  1845. }
  1846. do {
  1847. if (*e++ != ',') {
  1848. goto ILLEGAL;
  1849. }
  1850. n = 365;
  1851. s = (char *) RULE;
  1852. c = *e++;
  1853. if (c == 'M') {
  1854. n = 12;
  1855. } else if (c == 'J') {
  1856. s += 8;
  1857. } else {
  1858. --e;
  1859. c = 0;
  1860. s += 6;
  1861. }
  1862. p = &new_rules[count].rule_type;
  1863. *p = c;
  1864. if (c != 'M') {
  1865. p -= 2;
  1866. }
  1867. do {
  1868. ++s;
  1869. e = getnumber(e, &f);
  1870. if (!e
  1871. || ((unsigned int)(f - s[1]) > n)
  1872. || (*s && (*e++ != *s))
  1873. ) {
  1874. goto ILLEGAL;
  1875. }
  1876. *--p = f;
  1877. s += 2;
  1878. n = *s;
  1879. } while (n > 0);
  1880. off = 2 * 60 * 60; /* Default to 2:00:00 */
  1881. if (*e == '/') {
  1882. ++e;
  1883. e = getoffset(e, &off);
  1884. if (!e) {
  1885. goto ILLEGAL;
  1886. }
  1887. }
  1888. new_rules[count].dst_offset = off;
  1889. } while (++count < 2);
  1890. if (*e) {
  1891. ILLEGAL:
  1892. #ifdef __UCLIBC_HAS_TZ_CACHING__
  1893. oldval[0] = 0; /* oldval = "" */
  1894. #endif
  1895. memset(_time_tzinfo, 0, sizeof(_time_tzinfo));
  1896. strcpy(_time_tzinfo[0].tzname, UTC);
  1897. goto DONE;
  1898. }
  1899. }
  1900. memcpy(_time_tzinfo, new_rules, sizeof(new_rules));
  1901. DONE:
  1902. tzname[0] = _time_tzinfo[0].tzname;
  1903. tzname[1] = _time_tzinfo[1].tzname;
  1904. daylight = !!_time_tzinfo[1].tzname[0];
  1905. timezone = _time_tzinfo[0].gmt_offset;
  1906. #if (defined(__UCLIBC_HAS_TZ_FILE__) && !defined(__UCLIBC_HAS_TZ_FILE_READ_MANY__)) || \
  1907. defined(__UCLIBC_HAS_TZ_CACHING__)
  1908. FAST_DONE:
  1909. #endif
  1910. __UCLIBC_MUTEX_UNLOCK(_time_tzlock);
  1911. }
  1912. libc_hidden_def(tzset)
  1913. #endif
  1914. /**********************************************************************/
  1915. /* #ifdef L_utime */
  1916. /* utime is a syscall in both linux and elks. */
  1917. /* int utime(const char *path, const struct utimbuf *times) */
  1918. /* #endif */
  1919. /**********************************************************************/
  1920. /* Non-SUSv3 */
  1921. /**********************************************************************/
  1922. #ifdef L_utimes
  1923. #ifndef __BCC__
  1924. #error The uClibc version of utimes is in sysdeps/linux/common.
  1925. #endif
  1926. #include <utime.h>
  1927. int utimes(const char *filename, register const struct timeval *tvp)
  1928. {
  1929. register struct utimbuf *p = NULL;
  1930. struct utimbuf utb;
  1931. if (tvp) {
  1932. p = &utb;
  1933. p->actime = tvp[0].tv_sec;
  1934. p->modtime = tvp[1].tv_sec;
  1935. }
  1936. return utime(filename, p);
  1937. }
  1938. #endif
  1939. /**********************************************************************/
  1940. #ifdef L__time_t2tm
  1941. static const uint16_t _vals[] = {
  1942. 60, 60, 24, 7 /* special */, 36524, 1461, 365, 0
  1943. };
  1944. static const unsigned char days[] = {
  1945. 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, /* non-leap */
  1946. 29,
  1947. };
  1948. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  1949. static const char utc_string[] = "UTC";
  1950. #endif
  1951. /* Notes:
  1952. * If time_t is 32 bits, then no overflow is possible.
  1953. * It time_t is > 32 bits, this needs to be adjusted to deal with overflow.
  1954. */
  1955. /* Note: offset is the correction in _days_ to *timer! */
  1956. struct tm attribute_hidden *_time_t2tm(const time_t *__restrict timer,
  1957. int offset, struct tm *__restrict result)
  1958. {
  1959. register int *p;
  1960. time_t t1, t, v;
  1961. int wday = wday; /* ok to be uninitialized, shutting up warning */
  1962. {
  1963. register const uint16_t *vp;
  1964. t = *timer;
  1965. p = (int *) result;
  1966. p[7] = 0;
  1967. vp = _vals;
  1968. do {
  1969. if ((v = *vp) == 7) {
  1970. /* Overflow checking, assuming time_t is long int... */
  1971. #if (LONG_MAX > INT_MAX) && (LONG_MAX > 2147483647L)
  1972. #if (INT_MAX == 2147483647L) && (LONG_MAX == 9223372036854775807L)
  1973. /* Valid range for t is [-784223472856L, 784223421720L].
  1974. * Outside of this range, the tm_year field will overflow. */
  1975. if (((unsigned long)(t + offset- -784223472856L))
  1976. > (784223421720L - -784223472856L)
  1977. ) {
  1978. return NULL;
  1979. }
  1980. #else
  1981. #error overflow conditions unknown
  1982. #endif
  1983. #endif
  1984. /* We have days since the epoch, so caluclate the weekday. */
  1985. #if defined(__BCC__) && TIME_T_IS_UNSIGNED
  1986. wday = (t + 4) % (*vp); /* t is unsigned */
  1987. #else
  1988. wday = ((int)((t % (*vp)) + 11)) % ((int)(*vp)); /* help bcc */
  1989. #endif
  1990. /* Set divisor to days in 400 years. Be kind to bcc... */
  1991. v = ((time_t)(vp[1])) << 2;
  1992. ++v;
  1993. /* Change to days since 1/1/1601 so that for 32 bit time_t
  1994. * values, we'll have t >= 0. This should be changed for
  1995. * archs with larger time_t types.
  1996. * Also, correct for offset since a multiple of 7. */
  1997. /* TODO: Does this still work on archs with time_t > 32 bits? */
  1998. t += (135140L - 366) + offset; /* 146097 - (365*30 + 7) -366 */
  1999. }
  2000. #if defined(__BCC__) && TIME_T_IS_UNSIGNED
  2001. t -= ((t1 = t / v) * v);
  2002. #else
  2003. if ((t -= ((t1 = t / v) * v)) < 0) {
  2004. t += v;
  2005. --t1;
  2006. }
  2007. #endif
  2008. if ((*vp == 7) && (t == v-1)) {
  2009. --t; /* Correct for 400th year leap case */
  2010. ++p[4]; /* Stash the extra day... */
  2011. }
  2012. #if defined(__BCC__) && 0
  2013. *p = t1;
  2014. if (v <= 60) {
  2015. *p = t;
  2016. t = t1;
  2017. }
  2018. ++p;
  2019. #else
  2020. if (v <= 60) {
  2021. *p++ = t;
  2022. t = t1;
  2023. } else {
  2024. *p++ = t1;
  2025. }
  2026. #endif
  2027. } while (*++vp);
  2028. }
  2029. if (p[-1] == 4) {
  2030. --p[-1];
  2031. t = 365;
  2032. }
  2033. *p += ((int) t); /* result[7] .. tm_yday */
  2034. p -= 2; /* at result[5] */
  2035. #if (LONG_MAX > INT_MAX) && (LONG_MAX > 2147483647L)
  2036. /* Protect against overflow. TODO: Unecessary if int arith wraps? */
  2037. *p = ((((p[-2]<<2) + p[-1])*25 + p[0])<< 2) + (p[1] - 299); /* tm_year */
  2038. #else
  2039. *p = ((((p[-2]<<2) + p[-1])*25 + p[0])<< 2) + p[1] - 299; /* tm_year */
  2040. #endif
  2041. p[1] = wday; /* result[6] .. tm_wday */
  2042. {
  2043. register const unsigned char *d = days;
  2044. wday = 1900 + *p;
  2045. if (__isleap(wday)) {
  2046. d += 11;
  2047. }
  2048. wday = p[2] + 1; /* result[7] .. tm_yday */
  2049. *--p = 0; /* at result[4] .. tm_mon */
  2050. while (wday > *d) {
  2051. wday -= *d;
  2052. if (*d == 29) {
  2053. d -= 11; /* Backup to non-leap Feb. */
  2054. }
  2055. ++d;
  2056. ++*p; /* Increment tm_mon. */
  2057. }
  2058. p[-1] = wday; /* result[3] .. tm_mday */
  2059. }
  2060. /* TODO -- should this be 0? */
  2061. p[4] = 0; /* result[8] .. tm_isdst */
  2062. #ifdef __UCLIBC_HAS_TM_EXTENSIONS__
  2063. # ifdef __USE_BSD
  2064. result->tm_gmtoff = 0;
  2065. result->tm_zone = utc_string;
  2066. # else
  2067. result->__tm_gmtoff = 0;
  2068. result->__tm_zone = utc_string;
  2069. # endif
  2070. #endif /* __UCLIBC_HAS_TM_EXTENSIONS__ */
  2071. return result;
  2072. }
  2073. #endif
  2074. /**********************************************************************/
  2075. #ifdef L___time_tm
  2076. struct tm __time_tm; /* Global shared by gmtime() and localtime(). */
  2077. #endif
  2078. /**********************************************************************/
  2079. #ifdef L__time_mktime
  2080. time_t attribute_hidden _time_mktime(struct tm *timeptr, int store_on_success)
  2081. {
  2082. time_t t;
  2083. __UCLIBC_MUTEX_LOCK(_time_tzlock);
  2084. tzset();
  2085. t = _time_mktime_tzi(timeptr, store_on_success, _time_tzinfo);
  2086. __UCLIBC_MUTEX_UNLOCK(_time_tzlock);
  2087. return t;
  2088. }
  2089. #endif
  2090. /**********************************************************************/
  2091. #ifdef L__time_mktime_tzi
  2092. static const unsigned char __vals[] = {
  2093. 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31, /* non-leap */
  2094. 29,
  2095. };
  2096. time_t attribute_hidden _time_mktime_tzi(struct tm *timeptr, int store_on_success,
  2097. rule_struct *tzi)
  2098. {
  2099. #ifdef __BCC__
  2100. long days, secs;
  2101. #else
  2102. long long secs;
  2103. #endif
  2104. time_t t;
  2105. struct tm x;
  2106. /* 0:sec 1:min 2:hour 3:mday 4:mon 5:year 6:wday 7:yday 8:isdst */
  2107. register int *p = (int *) &x;
  2108. register const unsigned char *s;
  2109. int d, default_dst;
  2110. memcpy(p, timeptr, sizeof(struct tm));
  2111. if (!tzi[1].tzname[0]) { /* No dst in this timezone, */
  2112. p[8] = 0; /* so set tm_isdst to 0. */
  2113. }
  2114. default_dst = 0;
  2115. if (p[8]) { /* Either dst or unknown? */
  2116. default_dst = 1; /* Assume advancing (even if unknown). */
  2117. p[8] = ((p[8] > 0) ? 1 : -1); /* Normalize so abs() <= 1. */
  2118. }
  2119. d = 400;
  2120. p[5] = (p[5] - ((p[6] = p[5]/d) * d)) + (p[7] = p[4]/12);
  2121. if ((p[4] -= 12 * p[7]) < 0) {
  2122. p[4] += 12;
  2123. --p[5];
  2124. }
  2125. s = __vals;
  2126. d = (p[5] += 1900); /* Correct year. Now between 1900 and 2300. */
  2127. if (__isleap(d)) {
  2128. s += 11;
  2129. }
  2130. p[7] = 0;
  2131. d = p[4];
  2132. while (d) {
  2133. p[7] += *s;
  2134. if (*s == 29) {
  2135. s -= 11; /* Backup to non-leap Feb. */
  2136. }
  2137. ++s;
  2138. --d;
  2139. }
  2140. _time_tzset (x.tm_year < 2007); /* tm_year was expanded above */
  2141. #ifdef __BCC__
  2142. d = p[5] - 1;
  2143. days = -719163L + ((long)d)*365 + ((d/4) - (d/100) + (d/400) + p[3] + p[7]);
  2144. secs = p[0] + 60*( p[1] + 60*((long)(p[2])) )
  2145. + tzi[default_dst].gmt_offset;
  2146. DST_CORRECT:
  2147. if (secs < 0) {
  2148. secs += 120009600L;
  2149. days -= 1389;
  2150. }
  2151. if ( ((unsigned long)(days + secs/86400L)) > 49710L) {
  2152. t = ((time_t)(-1));
  2153. goto DONE;
  2154. }
  2155. secs += (days * 86400L);
  2156. #else
  2157. d = p[5] - 1;
  2158. d = -719163L + d*365 + (d/4) - (d/100) + (d/400);
  2159. secs = p[0]
  2160. + tzi[default_dst].gmt_offset
  2161. + 60*( p[1]
  2162. + 60*(p[2]
  2163. + 24*(((146073L * ((long long)(p[6])) + d)
  2164. + p[3]) + p[7])));
  2165. DST_CORRECT:
  2166. if (((unsigned long long)(secs - LONG_MIN))
  2167. > (((unsigned long long)LONG_MAX) - LONG_MIN)
  2168. ) {
  2169. t = ((time_t)(-1));
  2170. goto DONE;
  2171. }
  2172. #endif
  2173. d = ((struct tm *)p)->tm_isdst;
  2174. t = secs;
  2175. __time_localtime_tzi(&t, (struct tm *)p, tzi);
  2176. if (t == ((time_t)(-1))) { /* Remember, time_t can be unsigned. */
  2177. goto DONE;
  2178. }
  2179. if ((d < 0) && (((struct tm *)p)->tm_isdst != default_dst)) {
  2180. #ifdef __BCC__
  2181. secs -= (days * 86400L);
  2182. #endif
  2183. secs += (tzi[1-default_dst].gmt_offset
  2184. - tzi[default_dst].gmt_offset);
  2185. goto DST_CORRECT;
  2186. }
  2187. if (store_on_success) {
  2188. memcpy(timeptr, p, sizeof(struct tm));
  2189. }
  2190. DONE:
  2191. return t;
  2192. }
  2193. #endif
  2194. /**********************************************************************/
  2195. #if (defined(L_wcsftime) || defined(L_wcsftime_l))
  2196. /* Implemented via strftime / strftime_l wchar_t variants */
  2197. #endif
  2198. /**********************************************************************/
  2199. #ifdef L_dysize
  2200. /* Return the number of days in YEAR. */
  2201. int dysize(int year)
  2202. {
  2203. return __isleap(year) ? 366 : 365;
  2204. }
  2205. #endif
  2206. /**********************************************************************/