time.c 60 KB

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