time.c 64 KB

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