time.c 63 KB

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