strutil.c 48 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038103910401041104210431044104510461047104810491050105110521053105410551056105710581059106010611062106310641065106610671068106910701071107210731074107510761077107810791080108110821083108410851086108710881089109010911092109310941095109610971098109911001101110211031104110511061107110811091110111111121113111411151116111711181119112011211122112311241125112611271128112911301131113211331134113511361137113811391140114111421143114411451146114711481149115011511152115311541155115611571158115911601161116211631164116511661167116811691170117111721173117411751176117711781179118011811182118311841185118611871188118911901191119211931194119511961197119811991200120112021203120412051206120712081209121012111212121312141215121612171218121912201221122212231224122512261227122812291230123112321233123412351236123712381239124012411242124312441245124612471248124912501251125212531254125512561257125812591260126112621263126412651266126712681269127012711272127312741275127612771278127912801281128212831284128512861287128812891290129112921293129412951296129712981299130013011302130313041305130613071308130913101311131213131314131513161317131813191320132113221323132413251326132713281329133013311332133313341335133613371338133913401341134213431344134513461347134813491350135113521353135413551356135713581359136013611362136313641365136613671368136913701371137213731374137513761377137813791380138113821383138413851386138713881389139013911392139313941395139613971398139914001401140214031404140514061407140814091410141114121413141414151416141714181419142014211422142314241425142614271428142914301431143214331434143514361437143814391440144114421443144414451446144714481449145014511452145314541455145614571458145914601461146214631464146514661467146814691470147114721473147414751476147714781479148014811482148314841485148614871488148914901491149214931494149514961497149814991500150115021503150415051506150715081509151015111512151315141515151615171518151915201521152215231524152515261527152815291530153115321533153415351536153715381539154015411542154315441545154615471548154915501551155215531554155515561557155815591560156115621563156415651566156715681569157015711572157315741575157615771578157915801581158215831584158515861587158815891590159115921593159415951596159715981599160016011602160316041605160616071608160916101611161216131614161516161617161816191620162116221623162416251626162716281629163016311632163316341635163616371638163916401641164216431644164516461647164816491650165116521653165416551656165716581659166016611662166316641665166616671668166916701671167216731674167516761677167816791680168116821683168416851686168716881689169016911692169316941695169616971698169917001701170217031704170517061707170817091710171117121713171417151716171717181719172017211722172317241725172617271728172917301731173217331734173517361737173817391740174117421743174417451746174717481749175017511752175317541755175617571758175917601761176217631764176517661767176817691770177117721773177417751776177717781779178017811782178317841785178617871788178917901791179217931794179517961797179817991800180118021803180418051806180718081809181018111812181318141815181618171818181918201821182218231824182518261827182818291830183118321833183418351836183718381839184018411842184318441845184618471848184918501851185218531854185518561857185818591860186118621863186418651866186718681869187018711872187318741875187618771878187918801881188218831884188518861887188818891890189118921893189418951896189718981899190019011902190319041905190619071908190919101911191219131914191519161917191819191920192119221923192419251926192719281929193019311932193319341935193619371938193919401941194219431944194519461947194819491950195119521953195419551956195719581959196019611962196319641965196619671968196919701971197219731974197519761977197819791980198119821983198419851986198719881989199019911992199319941995199619971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202020212022202320242025202620272028202920302031203220332034203520362037203820392040204120422043204420452046204720482049205020512052205320542055205620572058205920602061206220632064206520662067206820692070207120722073207420752076207720782079208020812082208320842085208620872088208920902091209220932094209520962097209820992100210121022103210421052106210721082109211021112112211321142115211621172118211921202121212221232124212521262127212821292130213121322133213421352136213721382139214021412142214321442145214621472148214921502151215221532154215521562157215821592160216121622163216421652166216721682169217021712172217321742175217621772178217921802181218221832184218521862187218821892190219121922193219421952196219721982199220022012202220322042205220622072208220922102211221222132214221522162217221822192220222122222223222422252226222722282229223022312232223322342235223622372238223922402241224222432244224522462247224822492250225122522253225422552256225722582259226022612262226322642265226622672268226922702271227222732274227522762277227822792280228122822283228422852286228722882289229022912292229322942295229622972298229923002301230223032304230523062307230823092310231123122313231423152316231723182319232023212322232323242325232623272328232923302331233223332334233523362337233823392340234123422343234423452346234723482349235023512352235323542355235623572358235923602361236223632364236523662367236823692370237123722373237423752376237723782379238023812382238323842385
  1. #include "precompile.h"
  2. #include <float.h>
  3. #include <ctype.h>
  4. #include <stdarg.h>
  5. #include <assert.h>
  6. #include <string.h>
  7. #include "strutil.h"
  8. #include "memutil.h"
  9. #include <winpr/wtypes.h>
  10. #include <winpr/string.h>
  11. #pragma warning(disable : 4311)
  12. TOOLKIT_API const char *memstr(const char *buf, int n, const char *str)
  13. {
  14. const char *p, *e;
  15. size_t len;
  16. assert(buf);
  17. assert(str);
  18. len = strlen(str);
  19. for (p = buf, e = buf+n-len; p <= e; ++p) {
  20. if (memcmp(p, str, len) == 0)
  21. return p;
  22. }
  23. return NULL;
  24. }
  25. TOOLKIT_API char *memstr1(char *buf, int n, const char *str)
  26. {
  27. char *p, *e;
  28. size_t len;
  29. assert(buf);
  30. assert(str);
  31. len = strlen(str);
  32. for (p = buf, e = buf+n-len; p <= e; ++p) {
  33. if (memcmp(p, str, len) == 0)
  34. return p;
  35. }
  36. return NULL;
  37. }
  38. TOOLKIT_API const char *memrstr(const char *buf, int n, const char *str)
  39. {
  40. const char *p, *e;
  41. size_t len;
  42. assert(buf);
  43. assert(str);
  44. len = strlen(str);
  45. for (p = buf, e = buf+n-len; e >= p; e--) {
  46. if (memcmp(e, str, len) == 0)
  47. return e;
  48. }
  49. return NULL;
  50. }
  51. TOOLKIT_API const char *memistr(const char *buf, int n, const char *str)
  52. {
  53. const char *p, *e;
  54. size_t len;
  55. assert(buf);
  56. assert(str);
  57. len = strlen(str);
  58. for (p = buf, e = buf+n-len; p <= e; ++p) {
  59. if (_memicmp(p, str, len) == 0)
  60. return p;
  61. }
  62. return NULL;
  63. }
  64. TOOLKIT_API const char *memristr(const char *buf, int n, const char *str)
  65. {
  66. const char *p, *e;
  67. size_t len;
  68. assert(buf);
  69. assert(str);
  70. len = strlen(str);
  71. for (p = buf, e = buf+n-len; e >= p; e--) {
  72. if (_memicmp(e, str, len) == 0)
  73. return e;
  74. }
  75. return NULL;
  76. }
  77. #ifdef _WIN32
  78. /* Naive implementation of memmem() */
  79. TOOLKIT_API void *memmem(const void *haystack, size_t haystacklen,
  80. const void *needle, size_t needlelen)
  81. {
  82. size_t i;
  83. char const *hs = haystack;
  84. if (needlelen == 0)
  85. return (void *)haystack;
  86. if (needlelen > haystacklen || haystack == NULL || needle == NULL)
  87. return NULL;
  88. for (i = 0; i <= haystacklen - needlelen; i++) {
  89. if (memcmp(hs + i, needle, needlelen) == 0)
  90. return (void *)(hs + i);
  91. }
  92. return NULL;
  93. }
  94. /* Naive implementation of strcasestr() */
  95. TOOLKIT_API char *strcasestr(const char *haystack,
  96. const char *needle)
  97. {
  98. unsigned char lcn, ucn;
  99. unsigned i;
  100. if (haystack == NULL || needle == NULL)
  101. return NULL;
  102. lcn = ucn = needle[0];
  103. if (isupper(lcn))
  104. lcn = tolower(lcn);
  105. else if (islower(ucn))
  106. ucn = toupper(ucn);
  107. if (lcn == 0)
  108. return (char *)haystack;
  109. while (haystack[0] != 0) {
  110. if (lcn == haystack[0] || ucn == haystack[0]) {
  111. for (i = 1; ; i++) {
  112. char n = needle[i], h = haystack[i];
  113. if (n == 0)
  114. return (char *)haystack;
  115. if (h == 0)
  116. return NULL;
  117. if (isupper(n)) n = tolower(n);
  118. if (isupper(h)) h = tolower(h);
  119. if (n != h)
  120. break;
  121. }
  122. }
  123. haystack++;
  124. }
  125. return NULL; /* Not found */
  126. }
  127. #endif //_WIN32
  128. TOOLKIT_API char *strltrim(char *s, const char *trims)
  129. {
  130. char *k = s;
  131. char *p;
  132. while (strchr(trims, *k))
  133. ++k;
  134. if (k != s)
  135. for (p = s; *p++ = *k++;);
  136. return s;
  137. }
  138. TOOLKIT_API char *strrtrim(char *s, const char *trims)
  139. {
  140. size_t n = strlen(s);
  141. while (n && strchr(trims, s[n-1]))
  142. n--;
  143. s[n] = 0;
  144. return s;
  145. }
  146. TOOLKIT_API char *strtrim(char *s, const char *trims)
  147. {
  148. return strltrim(strrtrim(s, trims), trims);
  149. }
  150. TOOLKIT_API char *strnormws(char *s)
  151. {
  152. char *in = s, *out = s;
  153. int ch;
  154. while (isspace((ch = *in++)))
  155. ;
  156. if (ch != '\0')
  157. for (;;) {
  158. *out++ = ch;
  159. ch = *in++;
  160. if (ch == '\0')
  161. break;
  162. if (isspace(ch)) {
  163. while(isspace((ch = *in++)))
  164. ;
  165. if (ch == '\0')
  166. break;
  167. *out++ = ' ';
  168. }
  169. }
  170. *out = '\0';
  171. return s;
  172. }
  173. #define ONES_WORD 0x01010101
  174. #define EIGHTS_WORD 0x80808080
  175. #ifdef _WIN32
  176. #define word_has_nullbyte(w) (((w) - 0x01010101) & ~(w) & EIGHTS_WORD)
  177. TOOLKIT_API char *stpcpy(char *dst, const char *src)
  178. {
  179. const int *p = (const int *)src;
  180. int *q = (int*)dst;
  181. const char *sp;
  182. char *sq;
  183. if (!((int)p&(sizeof(int)-1)) && !((int)q&(sizeof(int)-1))) {
  184. int x = *p;
  185. while (!word_has_nullbyte(x)) {
  186. *q++ = x;
  187. x = *++p;
  188. }
  189. }
  190. sp = (const char*)p;
  191. sq = (char*)q;
  192. while (*sq = *sp++)
  193. sq++;
  194. return sq;
  195. }
  196. TOOLKIT_API char* strsep(char** stringp, const char* delim)
  197. {
  198. char* str, * end;
  199. str = *stringp + strspn(*stringp, delim);
  200. if (*str == '\0') {
  201. end = str;
  202. str = NULL;
  203. }
  204. else {
  205. end = str + strcspn(str, delim);
  206. if (*end != '\0')
  207. *end++ = '\0';
  208. }
  209. *stringp = end;
  210. return str;
  211. }
  212. TOOLKIT_API char* strtok_r(char* str, const char* delim, char** tracker)
  213. {
  214. if (str != NULL)
  215. *tracker = str;
  216. return strsep(tracker, delim);
  217. }
  218. #endif //_WIN32
  219. TOOLKIT_API char * strreplace(const char *src, const char *old, const char *news)
  220. {
  221. # define SUBS_TOP 32
  222. const char *subs[SUBS_TOP], *p, *sub_start, *src_without_old;
  223. char *dest, *ret;
  224. size_t old_len, new_len, dest_size, tmp;
  225. int i;
  226. old_len = strlen(old);
  227. new_len = strlen(news);
  228. /* Find substrings and compute size of result */
  229. dest_size = 1;
  230. src_without_old = src;
  231. for (i = 0, p = src ;; p = sub_start + old_len) {
  232. sub_start = strstr(p, old);
  233. if (i < SUBS_TOP)
  234. subs[i++] = sub_start;
  235. if (sub_start == NULL)
  236. break;
  237. dest_size += new_len;
  238. if (dest_size < new_len) {
  239. return NULL;
  240. }
  241. src_without_old += old_len;
  242. }
  243. tmp = (p - src_without_old) + strlen(p);
  244. dest_size += tmp;
  245. if (dest_size < tmp) {
  246. return NULL;
  247. }
  248. /* Make result string */
  249. ret = malloc(dest_size);
  250. if (ret) {
  251. dest = ret;
  252. for (i = 0;; ) {
  253. p = (i < SUBS_TOP ? subs[i++] : strstr(src, old));
  254. if (p == NULL)
  255. break;
  256. tmp = p - src;
  257. memcpy(dest, src, tmp);
  258. src += tmp + old_len;
  259. dest = stpcpy(dest + tmp, news);
  260. }
  261. strcpy(dest, src);
  262. }
  263. return ret;
  264. }
  265. TOOLKIT_API char **strsplit(const char *s, const char *delim)
  266. {
  267. const char *sp;
  268. char *p, **ret, **rp;
  269. size_t i;
  270. /* skip to first substring */
  271. s += strspn(s, delim);
  272. /* allocate array */
  273. for (i = 1, sp = s; *sp != '\0'; i++) {
  274. sp += strcspn(sp, delim);
  275. sp += strspn(sp, delim);
  276. }
  277. ret = rp = malloc(i * sizeof(char *));
  278. if (ret != NULL) {
  279. while (*s != '\0') {
  280. /* found new substring */
  281. i = strcspn(s, delim);
  282. *rp++ = p = malloc(i + 1);
  283. if (p == NULL) {
  284. strfreev(ret);
  285. return NULL;
  286. }
  287. memcpy(p, s, i);
  288. p[i] = '\0';
  289. s += i;
  290. s += strspn(s, delim);
  291. }
  292. *rp = NULL;
  293. }
  294. return ret;
  295. }
  296. TOOLKIT_API void strfreev(char **strings)
  297. {
  298. if (strings) {
  299. char **p;
  300. for (p = strings; *p != NULL; ++p)
  301. free(*p);
  302. free(strings);
  303. }
  304. }
  305. TOOLKIT_API char *strsub(char *dest,char *src,size_t offset,size_t len)
  306. {
  307. *dest = '\0';
  308. if (!memchr(src, '\0', offset))
  309. strncat(dest, src + offset, len);
  310. return dest;
  311. }
  312. TOOLKIT_API char *strleft(char *dest, char *src, size_t len)
  313. {
  314. *dest = '\0';
  315. strncat(dest, src, len);
  316. return dest;
  317. }
  318. TOOLKIT_API char *strright(char *dest, char *src, size_t len)
  319. {
  320. size_t src_len;
  321. src_len = strlen(src);
  322. if(src_len > len)
  323. src += src_len - len;
  324. return strcpy(dest, src);
  325. }
  326. static char * TOOLKIT_CC __strallocv(int stack, const char *arg1, va_list arg_list)
  327. {
  328. size_t len;
  329. const char *arg;
  330. char *ret, *end;
  331. int bad;
  332. va_list ap;
  333. /* compute length of result string */
  334. len = 1;
  335. bad = 0;
  336. //TODO: need to test its validity
  337. #ifdef _WIN32
  338. /*gcc compile error: assignment to expression with array type*/
  339. ap = arg_list;
  340. #else
  341. va_copy(ap, arg_list);
  342. #endif
  343. for (arg = arg1; arg != (char *)0; arg = va_arg(ap, char *)) {
  344. size_t arglen = strlen(arg);
  345. len += arglen;
  346. if(len < arglen) {
  347. /* string length too large for size_t */
  348. bad = 1;
  349. break;
  350. }
  351. }
  352. if(bad) {
  353. return NULL;
  354. }
  355. /* create result string */
  356. if (!stack)
  357. ret = malloc(len);
  358. else
  359. ret = _alloca(len);
  360. if(ret != NULL) {
  361. end = ret;
  362. *end = '\0';
  363. #ifdef _WIN32
  364. /*gcc compile error: assignment to expression with array type*/
  365. ap = arg_list;
  366. #else
  367. va_copy(ap, arg_list);
  368. #endif
  369. for (arg = arg1; arg != (char *)0; arg = va_arg(ap, char *))
  370. end = stpcpy(end, arg);
  371. }
  372. return ret;
  373. }
  374. TOOLKIT_API char * TOOLKIT_CC stralloc(const char *arg1, ...)
  375. {
  376. char *r;
  377. va_list ap;
  378. va_start(ap, arg1);
  379. r = __strallocv(0, arg1, ap);
  380. va_end(ap);
  381. return r;
  382. }
  383. TOOLKIT_API char * TOOLKIT_CC stralloca(const char *arg1, ...)
  384. {
  385. char *r;
  386. va_list ap;
  387. va_start(ap, arg1);
  388. r = __strallocv(1, arg1, ap);
  389. va_end(ap);
  390. return r;
  391. }
  392. TOOLKIT_API void *memdup(const void *buf, int len)
  393. {
  394. void *ret;
  395. if (buf) {
  396. ret = malloc(len);
  397. if (ret) {
  398. memcpy(ret, buf, len);
  399. }
  400. } else {
  401. ret = NULL;
  402. }
  403. return ret;
  404. }
  405. TOOLKIT_API void *memdupa(const void *buf, int len)
  406. {
  407. void *ret;
  408. if (buf) {
  409. ret = _alloca(len);
  410. if (ret) {
  411. memcpy(ret, buf, len);
  412. }
  413. } else {
  414. ret = NULL;
  415. }
  416. return ret;
  417. }
  418. #ifdef _WIN32
  419. TOOLKIT_API char *strdupa(const char * s)
  420. {
  421. size_t size;
  422. char *p;
  423. assert(s);
  424. size = strlen(s) + 1;
  425. if (size == 0)
  426. p = NULL;
  427. else if ((p = _alloca(size)) != NULL)
  428. memcpy(p, s, size);
  429. return p;
  430. }
  431. TOOLKIT_API char *strndup(const char *str, int n)
  432. {
  433. char *new_str;
  434. if (str) {
  435. new_str = (char*)malloc(n+1);
  436. strncpy(new_str, str, n);
  437. new_str[n] = '\0';
  438. } else {
  439. new_str = NULL;
  440. }
  441. return new_str;
  442. }
  443. #endif //_WIN32
  444. TOOLKIT_API char* strnfill(int length, int fill_char)
  445. {
  446. char *str;
  447. str = (char*)malloc(length + 1);
  448. memset (str, fill_char, length);
  449. str[length] = '\0';
  450. return str;
  451. }
  452. TOOLKIT_API int strcmp0 (const char *str1,const char *str2)
  453. {
  454. if (!str1)
  455. return -(str1 != str2);
  456. if (!str2)
  457. return str1 != str2;
  458. return strcmp (str1, str2);
  459. }
  460. TOOLKIT_API char* TOOLKIT_CC strdup_printf(const char *format, ...)
  461. {
  462. char *buffer;
  463. va_list args;
  464. va_start(args, format);
  465. buffer = strdup_vprintf(format, args);
  466. va_end(args);
  467. return buffer;
  468. }
  469. static char *vasnprintf (char *resultbuf, size_t *lengthp, const char *format, va_list args);
  470. TOOLKIT_API char* TOOLKIT_CC strdup_vprintf(const char *format, va_list args)
  471. {
  472. size_t length;
  473. return vasnprintf (NULL, &length, format, args);
  474. }
  475. TOOLKIT_API size_t strlcpy(char *dest, const char *src, size_t size)
  476. {
  477. const char *start;
  478. start = src;
  479. if (size) {
  480. while (--size && *src)
  481. *dest++ = *src++;
  482. *dest = '\0';
  483. }
  484. while (*src)
  485. ++src;
  486. return src - start;
  487. }
  488. TOOLKIT_API size_t strlcat(char * dest, const char *src, size_t size)
  489. {
  490. size_t len;
  491. char *end;
  492. for (end = dest; *end; ++end) ;
  493. len = end - dest;
  494. return len + strlcpy(end, src, size > len ? size - len : 0);
  495. }
  496. TOOLKIT_API char** strdupv (char **str_array)
  497. {
  498. if (str_array)
  499. {
  500. int i;
  501. char **retval;
  502. i = 0;
  503. while (str_array[i])
  504. ++i;
  505. retval = (char**)malloc(i+1);
  506. i = 0;
  507. while (str_array[i])
  508. {
  509. retval[i] = _strdup (str_array[i]);
  510. ++i;
  511. }
  512. retval[i] = NULL;
  513. return retval;
  514. }
  515. else
  516. return NULL;
  517. }
  518. TOOLKIT_API char* strjoinv (const char *separator,char **str_array)
  519. {
  520. char *string;
  521. char *ptr;
  522. if (separator == NULL)
  523. separator = "";
  524. if (*str_array)
  525. {
  526. int i;
  527. size_t len;
  528. size_t separator_len;
  529. separator_len = strlen (separator);
  530. /* First part, getting length */
  531. len = 1 + strlen (str_array[0]);
  532. for (i = 1; str_array[i] != NULL; i++)
  533. len += strlen (str_array[i]);
  534. len += separator_len * (i - 1);
  535. /* Second part, building string */
  536. string = (char*)malloc(len);
  537. ptr = stpcpy (string, *str_array);
  538. for (i = 1; str_array[i] != NULL; i++)
  539. {
  540. ptr = stpcpy (ptr, separator);
  541. ptr = stpcpy (ptr, str_array[i]);
  542. }
  543. }
  544. else
  545. string = _strdup ("");
  546. return string;
  547. }
  548. TOOLKIT_API char* TOOLKIT_CC strjoin (const char *separator, ...)
  549. {
  550. char *string, *s;
  551. va_list args;
  552. size_t len;
  553. size_t separator_len;
  554. char *ptr;
  555. if (separator == NULL)
  556. separator = "";
  557. separator_len = strlen (separator);
  558. va_start (args, separator);
  559. s = va_arg (args, char*);
  560. if (s)
  561. {
  562. /* First part, getting length */
  563. len = 1 + strlen (s);
  564. s = va_arg (args, char*);
  565. while (s)
  566. {
  567. len += separator_len + strlen (s);
  568. s = va_arg (args, char*);
  569. }
  570. va_end (args);
  571. /* Second part, building string */
  572. string = (char*)malloc(len);
  573. va_start (args, separator);
  574. s = va_arg (args, char*);
  575. ptr = stpcpy (string, s);
  576. s = va_arg (args, char*);
  577. while (s)
  578. {
  579. ptr = stpcpy (ptr, separator);
  580. ptr = stpcpy (ptr, s);
  581. s = va_arg (args, char*);
  582. }
  583. }
  584. else
  585. string = _strdup ("");
  586. va_end (args);
  587. return string;
  588. }
  589. TOOLKIT_API int str_has_suffix (const char *str, const char *suffix)
  590. {
  591. size_t str_len;
  592. size_t suffix_len;
  593. str_len = strlen (str);
  594. suffix_len = strlen (suffix);
  595. if (str_len < suffix_len)
  596. return FALSE;
  597. return strcmp (str + str_len - suffix_len, suffix) == 0;
  598. }
  599. TOOLKIT_API int str_has_prefix (const char *str,const char *prefix)
  600. {
  601. size_t str_len;
  602. size_t prefix_len;
  603. str_len = strlen (str);
  604. prefix_len = strlen (prefix);
  605. if (str_len < prefix_len)
  606. return FALSE;
  607. return strncmp (str, prefix, prefix_len) == 0;
  608. }
  609. TOOLKIT_API unsigned int strv_length (char **str_array)
  610. {
  611. unsigned int i = 0;
  612. while (str_array[i])
  613. ++i;
  614. return i;
  615. }
  616. /* asnprintf, extract from glib */
  617. #define FLAG_GROUP 1 /* ' flag */
  618. #define FLAG_LEFT 2 /* - flag */
  619. #define FLAG_SHOWSIGN 4 /* + flag */
  620. #define FLAG_SPACE 8 /* space flag */
  621. #define FLAG_ALT 16 /* # flag */
  622. #define FLAG_ZERO 32
  623. /* A parsed directive. */
  624. typedef struct
  625. {
  626. const char* dir_start;
  627. const char* dir_end;
  628. int flags;
  629. const char* width_start;
  630. const char* width_end;
  631. int width_arg_index;
  632. const char* precision_start;
  633. const char* precision_end;
  634. int precision_arg_index;
  635. char conversion; /* d i o u x X f e E g G c s p n U % but not C S */
  636. int arg_index;
  637. }
  638. char_directive;
  639. /* A parsed format string. */
  640. typedef struct
  641. {
  642. unsigned int count;
  643. char_directive *dir;
  644. unsigned int max_width_length;
  645. unsigned int max_precision_length;
  646. }
  647. char_directives;
  648. /* Argument types */
  649. typedef enum
  650. {
  651. TYPE_NONE,
  652. TYPE_SCHAR,
  653. TYPE_UCHAR,
  654. TYPE_SHORT,
  655. TYPE_USHORT,
  656. TYPE_INT,
  657. TYPE_UINT,
  658. TYPE_LONGINT,
  659. TYPE_ULONGINT,
  660. TYPE_LONGLONGINT,
  661. TYPE_ULONGLONGINT,
  662. TYPE_INT64,
  663. TYPE_UINT64,
  664. TYPE_DOUBLE,
  665. TYPE_LONGDOUBLE,
  666. TYPE_CHAR,
  667. TYPE_STRING,
  668. TYPE_POINTER,
  669. TYPE_COUNT_SCHAR_POINTER,
  670. TYPE_COUNT_SHORT_POINTER,
  671. TYPE_COUNT_INT_POINTER,
  672. TYPE_COUNT_LONGINT_POINTER
  673. , TYPE_COUNT_LONGLONGINT_POINTER
  674. } arg_type;
  675. /* Polymorphic argument */
  676. typedef struct
  677. {
  678. arg_type type;
  679. union
  680. {
  681. signed char a_schar;
  682. unsigned char a_uchar;
  683. short a_short;
  684. unsigned short a_ushort;
  685. int a_int;
  686. unsigned int a_uint;
  687. long int a_longint;
  688. unsigned long int a_ulongint;
  689. long long int a_longlongint;
  690. unsigned long long int a_ulonglongint;
  691. __int64 a_int64;
  692. u__int64_t a_uint64;
  693. float a_float;
  694. double a_double;
  695. long double a_longdouble;
  696. int a_char;
  697. const char* a_string;
  698. void* a_pointer;
  699. signed char * a_count_schar_pointer;
  700. short * a_count_short_pointer;
  701. int * a_count_int_pointer;
  702. long int * a_count_longint_pointer;
  703. long long int * a_count_longlongint_pointer;
  704. }
  705. a;
  706. }
  707. argument;
  708. typedef struct
  709. {
  710. unsigned int count;
  711. argument *arg;
  712. }
  713. arguments;
  714. static int printf_parse (const char *format, char_directives *d, arguments *a)
  715. {
  716. const char *cp = format; /* pointer into format */
  717. int arg_posn = 0; /* number of regular arguments consumed */
  718. unsigned int d_allocated; /* allocated elements of d->dir */
  719. unsigned int a_allocated; /* allocated elements of a->arg */
  720. unsigned int max_width_length = 0;
  721. unsigned int max_precision_length = 0;
  722. d->count = 0;
  723. d_allocated = 1;
  724. d->dir = malloc (d_allocated * sizeof (char_directive));
  725. if (d->dir == NULL)
  726. /* Out of memory. */
  727. return -1;
  728. a->count = 0;
  729. a_allocated = 0;
  730. a->arg = NULL;
  731. #define REGISTER_ARG(_index_,_type_) \
  732. { \
  733. unsigned int n = (_index_); \
  734. if (n >= a_allocated) \
  735. { \
  736. argument *memory; \
  737. a_allocated = 2 * a_allocated; \
  738. if (a_allocated <= n) \
  739. a_allocated = n + 1; \
  740. memory = (a->arg \
  741. ? realloc (a->arg, a_allocated * sizeof (argument)) \
  742. : malloc (a_allocated * sizeof (argument))); \
  743. if (memory == NULL) \
  744. /* Out of memory. */ \
  745. goto error; \
  746. a->arg = memory; \
  747. } \
  748. while (a->count <= n) \
  749. a->arg[a->count++].type = TYPE_NONE; \
  750. if (a->arg[n].type == TYPE_NONE) \
  751. a->arg[n].type = (_type_); \
  752. else if (a->arg[n].type != (_type_)) \
  753. /* Ambiguous type for positional argument. */ \
  754. goto error; \
  755. }
  756. while (*cp != '\0')
  757. {
  758. char c = *cp++;
  759. if (c == '%')
  760. {
  761. int arg_index = -1;
  762. char_directive *dp = &d->dir[d->count];/* pointer to next directive */
  763. /* Initialize the next directive. */
  764. dp->dir_start = cp - 1;
  765. dp->flags = 0;
  766. dp->width_start = NULL;
  767. dp->width_end = NULL;
  768. dp->width_arg_index = -1;
  769. dp->precision_start = NULL;
  770. dp->precision_end = NULL;
  771. dp->precision_arg_index = -1;
  772. dp->arg_index = -1;
  773. /* Test for positional argument. */
  774. if (*cp >= '0' && *cp <= '9')
  775. {
  776. const char *np;
  777. for (np = cp; *np >= '0' && *np <= '9'; np++)
  778. ;
  779. if (*np == '$')
  780. {
  781. unsigned int n = 0;
  782. for (np = cp; *np >= '0' && *np <= '9'; np++)
  783. n = 10 * n + (*np - '0');
  784. if (n == 0)
  785. /* Positional argument 0. */
  786. goto error;
  787. arg_index = n - 1;
  788. cp = np + 1;
  789. }
  790. }
  791. /* Read the flags. */
  792. for (;;)
  793. {
  794. if (*cp == '\'')
  795. {
  796. dp->flags |= FLAG_GROUP;
  797. cp++;
  798. }
  799. else if (*cp == '-')
  800. {
  801. dp->flags |= FLAG_LEFT;
  802. cp++;
  803. }
  804. else if (*cp == '+')
  805. {
  806. dp->flags |= FLAG_SHOWSIGN;
  807. cp++;
  808. }
  809. else if (*cp == ' ')
  810. {
  811. dp->flags |= FLAG_SPACE;
  812. cp++;
  813. }
  814. else if (*cp == '#')
  815. {
  816. dp->flags |= FLAG_ALT;
  817. cp++;
  818. }
  819. else if (*cp == '0')
  820. {
  821. dp->flags |= FLAG_ZERO;
  822. cp++;
  823. }
  824. else
  825. break;
  826. }
  827. /* Parse the field width. */
  828. if (*cp == '*')
  829. {
  830. dp->width_start = cp;
  831. cp++;
  832. dp->width_end = cp;
  833. if (max_width_length < 1)
  834. max_width_length = 1;
  835. /* Test for positional argument. */
  836. if (*cp >= '0' && *cp <= '9')
  837. {
  838. const char *np;
  839. for (np = cp; *np >= '0' && *np <= '9'; np++)
  840. ;
  841. if (*np == '$')
  842. {
  843. unsigned int n = 0;
  844. for (np = cp; *np >= '0' && *np <= '9'; np++)
  845. n = 10 * n + (*np - '0');
  846. if (n == 0)
  847. /* Positional argument 0. */
  848. goto error;
  849. dp->width_arg_index = n - 1;
  850. cp = np + 1;
  851. }
  852. }
  853. if (dp->width_arg_index < 0)
  854. dp->width_arg_index = arg_posn++;
  855. REGISTER_ARG (dp->width_arg_index, TYPE_INT);
  856. }
  857. else if (*cp >= '0' && *cp <= '9')
  858. {
  859. unsigned int width_length;
  860. dp->width_start = cp;
  861. for (; *cp >= '0' && *cp <= '9'; cp++)
  862. ;
  863. dp->width_end = cp;
  864. width_length = (unsigned int)(dp->width_end - dp->width_start);
  865. if (max_width_length < width_length)
  866. max_width_length = width_length;
  867. }
  868. /* Parse the precision. */
  869. if (*cp == '.')
  870. {
  871. cp++;
  872. if (*cp == '*')
  873. {
  874. dp->precision_start = cp - 1;
  875. cp++;
  876. dp->precision_end = cp;
  877. if (max_precision_length < 2)
  878. max_precision_length = 2;
  879. /* Test for positional argument. */
  880. if (*cp >= '0' && *cp <= '9')
  881. {
  882. const char *np;
  883. for (np = cp; *np >= '0' && *np <= '9'; np++)
  884. ;
  885. if (*np == '$')
  886. {
  887. unsigned int n = 0;
  888. for (np = cp; *np >= '0' && *np <= '9'; np++)
  889. n = 10 * n + (*np - '0');
  890. if (n == 0)
  891. /* Positional argument 0. */
  892. goto error;
  893. dp->precision_arg_index = n - 1;
  894. cp = np + 1;
  895. }
  896. }
  897. if (dp->precision_arg_index < 0)
  898. dp->precision_arg_index = arg_posn++;
  899. REGISTER_ARG (dp->precision_arg_index, TYPE_INT);
  900. }
  901. else
  902. {
  903. unsigned int precision_length;
  904. dp->precision_start = cp - 1;
  905. for (; *cp >= '0' && *cp <= '9'; cp++)
  906. ;
  907. dp->precision_end = cp;
  908. precision_length = (unsigned int)(dp->precision_end - dp->precision_start);
  909. if (max_precision_length < precision_length)
  910. max_precision_length = precision_length;
  911. }
  912. }
  913. {
  914. arg_type type;
  915. /* Parse argument type/size specifiers. */
  916. {
  917. int flags = 0;
  918. for (;;)
  919. {
  920. if (*cp == 'h')
  921. {
  922. flags |= (1 << (flags & 1));
  923. cp++;
  924. }
  925. else if (*cp == 'L')
  926. {
  927. flags |= 4;
  928. cp++;
  929. }
  930. else if (*cp == 'l')
  931. {
  932. flags += 8;
  933. cp++;
  934. }
  935. else if (cp[0] == 'I' &&
  936. cp[1] == '6' &&
  937. cp[2] == '4')
  938. {
  939. flags = 64;
  940. cp += 3;
  941. }
  942. else if (*cp == 'z' || *cp == 'Z')
  943. {
  944. /* 'z' is standardized in ISO C 99, but glibc uses 'Z'
  945. because the warning facility in gcc-2.95.2 understands
  946. only 'Z' (see gcc-2.95.2/gcc/c-common.c:1784). */
  947. if (sizeof (size_t) > sizeof (long))
  948. {
  949. /* size_t = long long */
  950. flags += 16;
  951. }
  952. else if (sizeof (size_t) > sizeof (int))
  953. {
  954. /* size_t = long */
  955. flags += 8;
  956. }
  957. cp++;
  958. }
  959. else if (*cp == 't')
  960. {
  961. if (sizeof (ptrdiff_t) > sizeof (long))
  962. {
  963. /* ptrdiff_t = long long */
  964. flags += 16;
  965. }
  966. else if (sizeof (ptrdiff_t) > sizeof (int))
  967. {
  968. /* ptrdiff_t = long */
  969. flags += 8;
  970. }
  971. cp++;
  972. }
  973. else
  974. break;
  975. }
  976. /* Read the conversion character. */
  977. c = *cp++;
  978. switch (c)
  979. {
  980. case 'd': case 'i':
  981. if (flags == 64)
  982. type = TYPE_INT64;
  983. else
  984. if (flags >= 16 || (flags & 4))
  985. type = TYPE_LONGLONGINT;
  986. else
  987. if (flags >= 8)
  988. type = TYPE_LONGINT;
  989. else if (flags & 2)
  990. type = TYPE_SCHAR;
  991. else if (flags & 1)
  992. type = TYPE_SHORT;
  993. else
  994. type = TYPE_INT;
  995. break;
  996. case 'o': case 'u': case 'x': case 'X':
  997. if (flags == 64)
  998. type = TYPE_UINT64;
  999. else
  1000. if (flags >= 16 || (flags & 4))
  1001. type = TYPE_ULONGLONGINT;
  1002. else
  1003. if (flags >= 8)
  1004. type = TYPE_ULONGINT;
  1005. else if (flags & 2)
  1006. type = TYPE_UCHAR;
  1007. else if (flags & 1)
  1008. type = TYPE_USHORT;
  1009. else
  1010. type = TYPE_UINT;
  1011. break;
  1012. case 'f': case 'F': case 'e': case 'E': case 'g': case 'G':
  1013. case 'a': case 'A':
  1014. if (flags >= 16 || (flags & 4))
  1015. type = TYPE_LONGDOUBLE;
  1016. else
  1017. type = TYPE_DOUBLE;
  1018. break;
  1019. case 'c':
  1020. if (flags >= 8)
  1021. goto error;
  1022. else
  1023. type = TYPE_CHAR;
  1024. break;
  1025. case 's':
  1026. if (flags >= 8)
  1027. goto error;
  1028. else
  1029. type = TYPE_STRING;
  1030. break;
  1031. case 'p':
  1032. type = TYPE_POINTER;
  1033. break;
  1034. case 'n':
  1035. if (flags >= 16 || (flags & 4))
  1036. type = TYPE_COUNT_LONGLONGINT_POINTER;
  1037. else
  1038. if (flags >= 8)
  1039. type = TYPE_COUNT_LONGINT_POINTER;
  1040. else if (flags & 2)
  1041. type = TYPE_COUNT_SCHAR_POINTER;
  1042. else if (flags & 1)
  1043. type = TYPE_COUNT_SHORT_POINTER;
  1044. else
  1045. type = TYPE_COUNT_INT_POINTER;
  1046. break;
  1047. case '%':
  1048. type = TYPE_NONE;
  1049. break;
  1050. default:
  1051. /* Unknown conversion character. */
  1052. goto error;
  1053. }
  1054. }
  1055. if (type != TYPE_NONE)
  1056. {
  1057. dp->arg_index = arg_index;
  1058. if (dp->arg_index < 0)
  1059. dp->arg_index = arg_posn++;
  1060. REGISTER_ARG (dp->arg_index, type);
  1061. }
  1062. dp->conversion = c;
  1063. dp->dir_end = cp;
  1064. }
  1065. d->count++;
  1066. if (d->count >= d_allocated)
  1067. {
  1068. char_directive *memory;
  1069. d_allocated = 2 * d_allocated;
  1070. memory = realloc (d->dir, d_allocated * sizeof (char_directive));
  1071. if (memory == NULL)
  1072. /* Out of memory. */
  1073. goto error;
  1074. d->dir = memory;
  1075. }
  1076. }
  1077. }
  1078. d->dir[d->count].dir_start = cp;
  1079. d->max_width_length = max_width_length;
  1080. d->max_precision_length = max_precision_length;
  1081. return 0;
  1082. error:
  1083. if (a->arg)
  1084. free (a->arg);
  1085. if (d->dir)
  1086. free (d->dir);
  1087. return -1;
  1088. }
  1089. static int printf_fetchargs (va_list args, arguments *a)
  1090. {
  1091. unsigned int i;
  1092. argument *ap;
  1093. for (i = 0, ap = &a->arg[0]; i < a->count; i++, ap++)
  1094. switch (ap->type)
  1095. {
  1096. case TYPE_SCHAR:
  1097. ap->a.a_schar = va_arg (args, /*signed char*/ int);
  1098. break;
  1099. case TYPE_UCHAR:
  1100. ap->a.a_uchar = va_arg (args, /*unsigned char*/ int);
  1101. break;
  1102. case TYPE_SHORT:
  1103. ap->a.a_short = va_arg (args, /*short*/ int);
  1104. break;
  1105. case TYPE_USHORT:
  1106. ap->a.a_ushort = va_arg (args, /*unsigned short*/ int);
  1107. break;
  1108. case TYPE_INT:
  1109. ap->a.a_int = va_arg (args, int);
  1110. break;
  1111. case TYPE_UINT:
  1112. ap->a.a_uint = va_arg (args, unsigned int);
  1113. break;
  1114. case TYPE_LONGINT:
  1115. ap->a.a_longint = va_arg (args, long int);
  1116. break;
  1117. case TYPE_ULONGINT:
  1118. ap->a.a_ulongint = va_arg (args, unsigned long int);
  1119. break;
  1120. case TYPE_LONGLONGINT:
  1121. ap->a.a_longlongint = va_arg (args, long long int);
  1122. break;
  1123. case TYPE_ULONGLONGINT:
  1124. ap->a.a_ulonglongint = va_arg (args, unsigned long long int);
  1125. break;
  1126. case TYPE_INT64:
  1127. ap->a.a_int64 = va_arg (args, __int64);
  1128. break;
  1129. case TYPE_UINT64:
  1130. ap->a.a_uint64 = va_arg (args, u__int64_t);
  1131. break;
  1132. case TYPE_DOUBLE:
  1133. ap->a.a_double = va_arg (args, double);
  1134. break;
  1135. case TYPE_LONGDOUBLE:
  1136. ap->a.a_longdouble = va_arg (args, long double);
  1137. break;
  1138. case TYPE_CHAR:
  1139. ap->a.a_char = va_arg (args, int);
  1140. break;
  1141. case TYPE_STRING:
  1142. ap->a.a_string = va_arg (args, const char *);
  1143. break;
  1144. case TYPE_POINTER:
  1145. ap->a.a_pointer = va_arg (args, void *);
  1146. break;
  1147. case TYPE_COUNT_SCHAR_POINTER:
  1148. ap->a.a_count_schar_pointer = va_arg (args, signed char *);
  1149. break;
  1150. case TYPE_COUNT_SHORT_POINTER:
  1151. ap->a.a_count_short_pointer = va_arg (args, short *);
  1152. break;
  1153. case TYPE_COUNT_INT_POINTER:
  1154. ap->a.a_count_int_pointer = va_arg (args, int *);
  1155. break;
  1156. case TYPE_COUNT_LONGINT_POINTER:
  1157. ap->a.a_count_longint_pointer = va_arg (args, long int *);
  1158. break;
  1159. case TYPE_COUNT_LONGLONGINT_POINTER:
  1160. ap->a.a_count_longlongint_pointer = va_arg (args, long long int *);
  1161. break;
  1162. default:
  1163. /* Unknown type. */
  1164. return -1;
  1165. }
  1166. return 0;
  1167. }
  1168. static int print_long_long (char *buf, int len, int width,int precision,unsigned long flags,char conversion,unsigned long long number)
  1169. {
  1170. int negative = FALSE;
  1171. char buffer[128];
  1172. char *bufferend;
  1173. char *pointer;
  1174. int base;
  1175. static const char *upper = "0123456789ABCDEFX";
  1176. static const char *lower = "0123456789abcdefx";
  1177. const char *digits;
  1178. int i;
  1179. char *p;
  1180. int count;
  1181. #define EMIT(c) \
  1182. if (p - buf == len - 1) \
  1183. { \
  1184. *p++ = '\0'; \
  1185. return len; \
  1186. } \
  1187. else \
  1188. *p++ = c;
  1189. p = buf;
  1190. switch (conversion)
  1191. {
  1192. case 'o':
  1193. base = 8;
  1194. digits = lower;
  1195. negative = FALSE;
  1196. break;
  1197. case 'x':
  1198. base = 16;
  1199. digits = lower;
  1200. negative = FALSE;
  1201. break;
  1202. case 'X':
  1203. base = 16;
  1204. digits = upper;
  1205. negative = FALSE;
  1206. break;
  1207. default:
  1208. base = 10;
  1209. digits = lower;
  1210. negative = (long long)number < 0;
  1211. if (negative)
  1212. number = -((long long)number);
  1213. break;
  1214. }
  1215. /* Build number */
  1216. pointer = bufferend = &buffer[sizeof(buffer) - 1];
  1217. *pointer-- = '\0';
  1218. for (i = 1; i < (int)sizeof(buffer); i++)
  1219. {
  1220. *pointer-- = digits[number % base];
  1221. number /= base;
  1222. if (number == 0)
  1223. break;
  1224. }
  1225. /* Adjust width */
  1226. width -= (int)((bufferend - pointer) - 1);
  1227. /* Adjust precision */
  1228. if (precision != -1)
  1229. {
  1230. precision -= (int)((bufferend - pointer) - 1);
  1231. if (precision < 0)
  1232. precision = 0;
  1233. flags |= FLAG_ZERO;
  1234. }
  1235. /* Adjust width further */
  1236. if (negative || (flags & FLAG_SHOWSIGN) || (flags & FLAG_SPACE))
  1237. width--;
  1238. if (flags & FLAG_ALT)
  1239. {
  1240. switch (base)
  1241. {
  1242. case 16:
  1243. width -= 2;
  1244. break;
  1245. case 8:
  1246. width--;
  1247. break;
  1248. default:
  1249. break;
  1250. }
  1251. }
  1252. /* Output prefixes spaces if needed */
  1253. if (! ((flags & FLAG_LEFT) ||
  1254. ((flags & FLAG_ZERO) && (precision == -1))))
  1255. {
  1256. count = (precision == -1) ? 0 : precision;
  1257. while (width-- > count)
  1258. *p++ = ' ';
  1259. }
  1260. /* width has been adjusted for signs and alternatives */
  1261. if (negative)
  1262. {
  1263. EMIT ('-');
  1264. }
  1265. else if (flags & FLAG_SHOWSIGN)
  1266. {
  1267. EMIT('+');
  1268. }
  1269. else if (flags & FLAG_SPACE)
  1270. {
  1271. EMIT(' ');
  1272. }
  1273. if (flags & FLAG_ALT)
  1274. {
  1275. switch (base)
  1276. {
  1277. case 8:
  1278. EMIT('0');
  1279. break;
  1280. case 16:
  1281. EMIT('0');
  1282. EMIT(digits[16]);
  1283. break;
  1284. default:
  1285. break;
  1286. } /* switch base */
  1287. }
  1288. /* Output prefixed zero padding if needed */
  1289. if (flags & FLAG_ZERO)
  1290. {
  1291. if (precision == -1)
  1292. precision = width;
  1293. while (precision-- > 0)
  1294. {
  1295. EMIT('0');
  1296. width--;
  1297. }
  1298. }
  1299. /* Output the number itself */
  1300. while (*(++pointer))
  1301. {
  1302. EMIT(*pointer);
  1303. }
  1304. /* Output trailing spaces if needed */
  1305. if (flags & FLAG_LEFT)
  1306. {
  1307. while (width-- > 0)
  1308. EMIT(' ');
  1309. }
  1310. EMIT('\0');
  1311. return (int)(p - buf - 1);
  1312. }
  1313. static char *vasnprintf (char *resultbuf, size_t *lengthp, const char *format, va_list args)
  1314. {
  1315. char_directives d;
  1316. arguments a;
  1317. if (printf_parse (format, &d, &a) < 0)
  1318. {
  1319. errno = EINVAL;
  1320. return NULL;
  1321. }
  1322. #define CLEANUP() \
  1323. free (d.dir); \
  1324. if (a.arg) \
  1325. free (a.arg);
  1326. if (printf_fetchargs (args, &a) < 0)
  1327. {
  1328. CLEANUP ();
  1329. errno = EINVAL;
  1330. return NULL;
  1331. }
  1332. {
  1333. char *buf =
  1334. (char *) alloca (7 + d.max_width_length + d.max_precision_length + 6);
  1335. const char *cp;
  1336. unsigned int i;
  1337. char_directive *dp;
  1338. /* Output string accumulator. */
  1339. char *result;
  1340. size_t allocated;
  1341. size_t length;
  1342. if (resultbuf != NULL)
  1343. {
  1344. result = resultbuf;
  1345. allocated = *lengthp;
  1346. }
  1347. else
  1348. {
  1349. result = NULL;
  1350. allocated = 0;
  1351. }
  1352. length = 0;
  1353. /* Invariants:
  1354. result is either == resultbuf or == NULL or malloc-allocated.
  1355. If length > 0, then result != NULL. */
  1356. #define ENSURE_ALLOCATION(needed) \
  1357. if ((needed) > allocated) \
  1358. { \
  1359. char *memory; \
  1360. \
  1361. allocated = (allocated > 0 ? 2 * allocated : 12); \
  1362. if ((needed) > allocated) \
  1363. allocated = (needed); \
  1364. if (result == resultbuf || result == NULL) \
  1365. memory = (char *) malloc (allocated); \
  1366. else \
  1367. memory = (char *) realloc (result, allocated); \
  1368. \
  1369. if (memory == NULL) \
  1370. { \
  1371. if (!(result == resultbuf || result == NULL)) \
  1372. free (result); \
  1373. CLEANUP (); \
  1374. errno = ENOMEM; \
  1375. return NULL; \
  1376. } \
  1377. if (result == resultbuf && length > 0) \
  1378. memcpy (memory, result, length); \
  1379. result = memory; \
  1380. }
  1381. for (cp = format, i = 0, dp = &d.dir[0]; ; cp = dp->dir_end, i++, dp++)
  1382. {
  1383. if (cp != dp->dir_start)
  1384. {
  1385. size_t n = dp->dir_start - cp;
  1386. ENSURE_ALLOCATION (length + n);
  1387. memcpy (result + length, cp, n);
  1388. length += n;
  1389. }
  1390. if (i == d.count)
  1391. break;
  1392. /* Execute a single directive. */
  1393. if (dp->conversion == '%')
  1394. {
  1395. if (!(dp->arg_index < 0))
  1396. abort ();
  1397. ENSURE_ALLOCATION (length + 1);
  1398. result[length] = '%';
  1399. length += 1;
  1400. }
  1401. else
  1402. {
  1403. if (!(dp->arg_index >= 0))
  1404. abort ();
  1405. if (dp->conversion == 'n')
  1406. {
  1407. switch (a.arg[dp->arg_index].type)
  1408. {
  1409. case TYPE_COUNT_SCHAR_POINTER:
  1410. *a.arg[dp->arg_index].a.a_count_schar_pointer = (char)length;
  1411. break;
  1412. case TYPE_COUNT_SHORT_POINTER:
  1413. *a.arg[dp->arg_index].a.a_count_short_pointer = (short)length;
  1414. break;
  1415. case TYPE_COUNT_INT_POINTER:
  1416. *a.arg[dp->arg_index].a.a_count_int_pointer = (int)length;
  1417. break;
  1418. case TYPE_COUNT_LONGINT_POINTER:
  1419. *a.arg[dp->arg_index].a.a_count_longint_pointer = (long)length;
  1420. break;
  1421. case TYPE_COUNT_LONGLONGINT_POINTER:
  1422. *a.arg[dp->arg_index].a.a_count_longlongint_pointer = length;
  1423. break;
  1424. default:
  1425. abort ();
  1426. }
  1427. }
  1428. else
  1429. {
  1430. arg_type type = a.arg[dp->arg_index].type;
  1431. char *p;
  1432. unsigned int prefix_count;
  1433. int prefixes[2];
  1434. unsigned int tmp_length;
  1435. char tmpbuf[700];
  1436. char *tmp;
  1437. /* Allocate a temporary buffer of sufficient size for calling
  1438. sprintf. */
  1439. {
  1440. unsigned int width;
  1441. unsigned int precision;
  1442. width = 0;
  1443. if (dp->width_start != dp->width_end)
  1444. {
  1445. if (dp->width_arg_index >= 0)
  1446. {
  1447. int arg;
  1448. if (!(a.arg[dp->width_arg_index].type == TYPE_INT))
  1449. abort ();
  1450. arg = a.arg[dp->width_arg_index].a.a_int;
  1451. width = (arg < 0 ? -arg : arg);
  1452. }
  1453. else
  1454. {
  1455. const char *digitp = dp->width_start;
  1456. do
  1457. width = width * 10 + (*digitp++ - '0');
  1458. while (digitp != dp->width_end);
  1459. }
  1460. }
  1461. precision = 6;
  1462. if (dp->precision_start != dp->precision_end)
  1463. {
  1464. if (dp->precision_arg_index >= 0)
  1465. {
  1466. int arg;
  1467. if (!(a.arg[dp->precision_arg_index].type == TYPE_INT))
  1468. abort ();
  1469. arg = a.arg[dp->precision_arg_index].a.a_int;
  1470. precision = (arg < 0 ? 0 : arg);
  1471. }
  1472. else
  1473. {
  1474. const char *digitp = dp->precision_start + 1;
  1475. precision = 0;
  1476. while (digitp != dp->precision_end)
  1477. precision = precision * 10 + (*digitp++ - '0');
  1478. }
  1479. }
  1480. switch (dp->conversion)
  1481. {
  1482. case 'd': case 'i': case 'u':
  1483. if (type == TYPE_LONGLONGINT || type == TYPE_ULONGLONGINT)
  1484. tmp_length =
  1485. (unsigned int) (sizeof (unsigned long long) * CHAR_BIT
  1486. * 0.30103 /* binary -> decimal */
  1487. * 2 /* estimate for FLAG_GROUP */
  1488. )
  1489. + 1 /* turn floor into ceil */
  1490. + 1; /* account for leading sign */
  1491. else
  1492. if (type == TYPE_LONGINT || type == TYPE_ULONGINT)
  1493. tmp_length =
  1494. (unsigned int) (sizeof (unsigned long) * CHAR_BIT
  1495. * 0.30103 /* binary -> decimal */
  1496. * 2 /* estimate for FLAG_GROUP */
  1497. )
  1498. + 1 /* turn floor into ceil */
  1499. + 1; /* account for leading sign */
  1500. else
  1501. tmp_length =
  1502. (unsigned int) (sizeof (unsigned int) * CHAR_BIT
  1503. * 0.30103 /* binary -> decimal */
  1504. * 2 /* estimate for FLAG_GROUP */
  1505. )
  1506. + 1 /* turn floor into ceil */
  1507. + 1; /* account for leading sign */
  1508. break;
  1509. case 'o':
  1510. if (type == TYPE_LONGLONGINT || type == TYPE_ULONGLONGINT)
  1511. tmp_length =
  1512. (unsigned int) (sizeof (unsigned long long) * CHAR_BIT
  1513. * 0.333334 /* binary -> octal */
  1514. )
  1515. + 1 /* turn floor into ceil */
  1516. + 1; /* account for leading sign */
  1517. else
  1518. if (type == TYPE_LONGINT || type == TYPE_ULONGINT)
  1519. tmp_length =
  1520. (unsigned int) (sizeof (unsigned long) * CHAR_BIT
  1521. * 0.333334 /* binary -> octal */
  1522. )
  1523. + 1 /* turn floor into ceil */
  1524. + 1; /* account for leading sign */
  1525. else
  1526. tmp_length =
  1527. (unsigned int) (sizeof (unsigned int) * CHAR_BIT
  1528. * 0.333334 /* binary -> octal */
  1529. )
  1530. + 1 /* turn floor into ceil */
  1531. + 1; /* account for leading sign */
  1532. break;
  1533. case 'x': case 'X':
  1534. if (type == TYPE_LONGLONGINT || type == TYPE_ULONGLONGINT)
  1535. tmp_length =
  1536. (unsigned int) (sizeof (unsigned long long) * CHAR_BIT
  1537. * 0.25 /* binary -> hexadecimal */
  1538. )
  1539. + 1 /* turn floor into ceil */
  1540. + 2; /* account for leading sign or alternate form */
  1541. else
  1542. if (type == TYPE_INT64 || type == TYPE_UINT64)
  1543. tmp_length =
  1544. (unsigned int) (sizeof (u__int64_t) * CHAR_BIT
  1545. * 0.25 /* binary -> hexadecimal */
  1546. )
  1547. + 1 /* turn floor into ceil */
  1548. + 2; /* account for leading sign or alternate form */
  1549. else
  1550. if (type == TYPE_LONGINT || type == TYPE_ULONGINT)
  1551. tmp_length =
  1552. (unsigned int) (sizeof (unsigned long) * CHAR_BIT
  1553. * 0.25 /* binary -> hexadecimal */
  1554. )
  1555. + 1 /* turn floor into ceil */
  1556. + 2; /* account for leading sign or alternate form */
  1557. else
  1558. tmp_length =
  1559. (unsigned int) (sizeof (unsigned int) * CHAR_BIT
  1560. * 0.25 /* binary -> hexadecimal */
  1561. )
  1562. + 1 /* turn floor into ceil */
  1563. + 2; /* account for leading sign or alternate form */
  1564. break;
  1565. case 'f': case 'F':
  1566. if (type == TYPE_LONGDOUBLE)
  1567. tmp_length =
  1568. (unsigned int) (LDBL_MAX_EXP
  1569. * 0.30103 /* binary -> decimal */
  1570. * 2 /* estimate for FLAG_GROUP */
  1571. )
  1572. + 1 /* turn floor into ceil */
  1573. + precision
  1574. + 10; /* sign, decimal point etc. */
  1575. else
  1576. tmp_length =
  1577. (unsigned int) (DBL_MAX_EXP
  1578. * 0.30103 /* binary -> decimal */
  1579. * 2 /* estimate for FLAG_GROUP */
  1580. )
  1581. + 1 /* turn floor into ceil */
  1582. + precision
  1583. + 10; /* sign, decimal point etc. */
  1584. break;
  1585. case 'e': case 'E': case 'g': case 'G':
  1586. case 'a': case 'A':
  1587. tmp_length =
  1588. precision
  1589. + 12; /* sign, decimal point, exponent etc. */
  1590. break;
  1591. case 'c':
  1592. tmp_length = 1;
  1593. break;
  1594. case 's':
  1595. tmp_length = (unsigned int)strlen (a.arg[dp->arg_index].a.a_string);
  1596. break;
  1597. case 'p':
  1598. tmp_length =
  1599. (unsigned int) (sizeof (void *) * CHAR_BIT
  1600. * 0.25 /* binary -> hexadecimal */
  1601. )
  1602. + 1 /* turn floor into ceil */
  1603. + 2; /* account for leading 0x */
  1604. break;
  1605. default:
  1606. abort ();
  1607. }
  1608. if (tmp_length < width)
  1609. tmp_length = width;
  1610. tmp_length++; /* account for trailing NUL */
  1611. }
  1612. if (tmp_length <= sizeof (tmpbuf))
  1613. tmp = tmpbuf;
  1614. else
  1615. {
  1616. tmp = (char *) malloc (tmp_length);
  1617. if (tmp == NULL)
  1618. {
  1619. /* Out of memory. */
  1620. if (!(result == resultbuf || result == NULL))
  1621. free (result);
  1622. CLEANUP ();
  1623. errno = ENOMEM;
  1624. return NULL;
  1625. }
  1626. }
  1627. /* Construct the format string for calling snprintf or
  1628. sprintf. */
  1629. p = buf;
  1630. *p++ = '%';
  1631. if (dp->flags & FLAG_GROUP)
  1632. *p++ = '\'';
  1633. if (dp->flags & FLAG_LEFT)
  1634. *p++ = '-';
  1635. if (dp->flags & FLAG_SHOWSIGN)
  1636. *p++ = '+';
  1637. if (dp->flags & FLAG_SPACE)
  1638. *p++ = ' ';
  1639. if (dp->flags & FLAG_ALT)
  1640. *p++ = '#';
  1641. if (dp->flags & FLAG_ZERO)
  1642. *p++ = '0';
  1643. if (dp->width_start != dp->width_end)
  1644. {
  1645. size_t n = dp->width_end - dp->width_start;
  1646. memcpy (p, dp->width_start, n);
  1647. p += n;
  1648. }
  1649. if (dp->precision_start != dp->precision_end)
  1650. {
  1651. size_t n = dp->precision_end - dp->precision_start;
  1652. memcpy (p, dp->precision_start, n);
  1653. p += n;
  1654. }
  1655. switch (type)
  1656. {
  1657. case TYPE_INT64:
  1658. case TYPE_UINT64:
  1659. *p++ = 'I';
  1660. *p++ = '6';
  1661. *p++ = '4';
  1662. break;
  1663. case TYPE_LONGLONGINT:
  1664. case TYPE_ULONGLONGINT:
  1665. *p++ = 'I';
  1666. *p++ = '6';
  1667. *p++ = '4';
  1668. break;
  1669. *p++ = 'l';
  1670. /*FALLTHROUGH*/
  1671. case TYPE_LONGINT:
  1672. case TYPE_ULONGINT:
  1673. *p++ = 'l';
  1674. break;
  1675. case TYPE_LONGDOUBLE:
  1676. *p++ = 'L';
  1677. break;
  1678. default:
  1679. break;
  1680. }
  1681. *p = dp->conversion;
  1682. p[1] = '\0';
  1683. /* Construct the arguments for calling snprintf or sprintf. */
  1684. prefix_count = 0;
  1685. if (dp->width_arg_index >= 0)
  1686. {
  1687. if (!(a.arg[dp->width_arg_index].type == TYPE_INT))
  1688. abort ();
  1689. prefixes[prefix_count++] = a.arg[dp->width_arg_index].a.a_int;
  1690. }
  1691. if (dp->precision_arg_index >= 0)
  1692. {
  1693. if (!(a.arg[dp->precision_arg_index].type == TYPE_INT))
  1694. abort ();
  1695. prefixes[prefix_count++] = a.arg[dp->precision_arg_index].a.a_int;
  1696. }
  1697. for (;;)
  1698. {
  1699. size_t maxlen;
  1700. int count;
  1701. int retcount;
  1702. maxlen = allocated - length;
  1703. count = -1;
  1704. retcount = 0;
  1705. #define SNPRINTF_BUF(arg) \
  1706. switch (prefix_count) \
  1707. { \
  1708. case 0: \
  1709. count = sprintf (tmp, buf, arg); \
  1710. break; \
  1711. case 1: \
  1712. count = sprintf (tmp, buf, prefixes[0], arg); \
  1713. break; \
  1714. case 2: \
  1715. count = sprintf (tmp, buf, prefixes[0], prefixes[1],\
  1716. arg); \
  1717. break; \
  1718. default: \
  1719. abort (); \
  1720. }
  1721. switch (type)
  1722. {
  1723. case TYPE_SCHAR:
  1724. {
  1725. int arg = a.arg[dp->arg_index].a.a_schar;
  1726. SNPRINTF_BUF (arg);
  1727. }
  1728. break;
  1729. case TYPE_UCHAR:
  1730. {
  1731. unsigned int arg = a.arg[dp->arg_index].a.a_uchar;
  1732. SNPRINTF_BUF (arg);
  1733. }
  1734. break;
  1735. case TYPE_SHORT:
  1736. {
  1737. int arg = a.arg[dp->arg_index].a.a_short;
  1738. SNPRINTF_BUF (arg);
  1739. }
  1740. break;
  1741. case TYPE_USHORT:
  1742. {
  1743. unsigned int arg = a.arg[dp->arg_index].a.a_ushort;
  1744. SNPRINTF_BUF (arg);
  1745. }
  1746. break;
  1747. case TYPE_INT:
  1748. {
  1749. int arg = a.arg[dp->arg_index].a.a_int;
  1750. SNPRINTF_BUF (arg);
  1751. }
  1752. break;
  1753. case TYPE_UINT:
  1754. {
  1755. unsigned int arg = a.arg[dp->arg_index].a.a_uint;
  1756. SNPRINTF_BUF (arg);
  1757. }
  1758. break;
  1759. case TYPE_LONGINT:
  1760. {
  1761. long int arg = a.arg[dp->arg_index].a.a_longint;
  1762. SNPRINTF_BUF (arg);
  1763. }
  1764. break;
  1765. case TYPE_ULONGINT:
  1766. {
  1767. unsigned long int arg = a.arg[dp->arg_index].a.a_ulongint;
  1768. SNPRINTF_BUF (arg);
  1769. }
  1770. break;
  1771. case TYPE_INT64:
  1772. {
  1773. __int64 arg = a.arg[dp->arg_index].a.a_int64;
  1774. SNPRINTF_BUF (arg);
  1775. }
  1776. break;
  1777. case TYPE_UINT64:
  1778. {
  1779. u__int64_t arg = a.arg[dp->arg_index].a.a_uint64;
  1780. SNPRINTF_BUF (arg);
  1781. }
  1782. break;
  1783. case TYPE_LONGLONGINT:
  1784. case TYPE_ULONGLONGINT:
  1785. {
  1786. unsigned long long int arg = a.arg[dp->arg_index].a.a_ulonglongint;
  1787. int width;
  1788. int precision;
  1789. width = 0;
  1790. if (dp->width_start != dp->width_end)
  1791. {
  1792. if (dp->width_arg_index >= 0)
  1793. {
  1794. int arg;
  1795. if (!(a.arg[dp->width_arg_index].type == TYPE_INT))
  1796. abort ();
  1797. arg = a.arg[dp->width_arg_index].a.a_int;
  1798. width = (arg < 0 ? -arg : arg);
  1799. }
  1800. else
  1801. {
  1802. const char *digitp = dp->width_start;
  1803. do
  1804. width = width * 10 + (*digitp++ - '0');
  1805. while (digitp != dp->width_end);
  1806. }
  1807. }
  1808. precision = -1;
  1809. if (dp->precision_start != dp->precision_end)
  1810. {
  1811. if (dp->precision_arg_index >= 0)
  1812. {
  1813. int arg;
  1814. if (!(a.arg[dp->precision_arg_index].type == TYPE_INT))
  1815. abort ();
  1816. arg = a.arg[dp->precision_arg_index].a.a_int;
  1817. precision = (arg < 0 ? 0 : arg);
  1818. }
  1819. else
  1820. {
  1821. const char *digitp = dp->precision_start + 1;
  1822. precision = 0;
  1823. do
  1824. precision = precision * 10 + (*digitp++ - '0');
  1825. while (digitp != dp->precision_end);
  1826. }
  1827. }
  1828. count = print_long_long (tmp, tmp_length,
  1829. width, precision,
  1830. dp->flags,
  1831. dp->conversion,
  1832. arg);
  1833. }
  1834. break;
  1835. case TYPE_DOUBLE:
  1836. {
  1837. double arg = a.arg[dp->arg_index].a.a_double;
  1838. SNPRINTF_BUF (arg);
  1839. }
  1840. break;
  1841. case TYPE_LONGDOUBLE:
  1842. {
  1843. long double arg = a.arg[dp->arg_index].a.a_longdouble;
  1844. SNPRINTF_BUF (arg);
  1845. }
  1846. break;
  1847. case TYPE_CHAR:
  1848. {
  1849. int arg = a.arg[dp->arg_index].a.a_char;
  1850. SNPRINTF_BUF (arg);
  1851. }
  1852. break;
  1853. case TYPE_STRING:
  1854. {
  1855. const char *arg = a.arg[dp->arg_index].a.a_string;
  1856. SNPRINTF_BUF (arg);
  1857. }
  1858. break;
  1859. case TYPE_POINTER:
  1860. {
  1861. void *arg = a.arg[dp->arg_index].a.a_pointer;
  1862. SNPRINTF_BUF (arg);
  1863. }
  1864. break;
  1865. default:
  1866. abort ();
  1867. }
  1868. /* Attempt to handle failure. */
  1869. if (count < 0)
  1870. {
  1871. if (!(result == resultbuf || result == NULL))
  1872. free (result);
  1873. CLEANUP ();
  1874. errno = EINVAL;
  1875. return NULL;
  1876. }
  1877. if (count >= (int)tmp_length)
  1878. /* tmp_length was incorrectly calculated - fix the
  1879. code above! */
  1880. abort ();
  1881. /* Make room for the result. */
  1882. if (count >= (int)maxlen)
  1883. {
  1884. /* Need at least count bytes. But allocate
  1885. proportionally, to avoid looping eternally if
  1886. snprintf() reports a too small count. */
  1887. size_t n = length + count;
  1888. if (n < 2 * allocated)
  1889. n = 2 * allocated;
  1890. ENSURE_ALLOCATION (n);
  1891. }
  1892. /* Append the sprintf() result. */
  1893. memcpy (result + length, tmp, count);
  1894. if (tmp != tmpbuf)
  1895. free (tmp);
  1896. length += count;
  1897. break;
  1898. }
  1899. }
  1900. }
  1901. }
  1902. /* Add the final NUL. */
  1903. ENSURE_ALLOCATION (length + 1);
  1904. result[length] = '\0';
  1905. if (result != resultbuf && length + 1 < allocated)
  1906. {
  1907. /* Shrink the allocated memory if possible. */
  1908. char *memory;
  1909. memory = (char *) realloc (result, length + 1);
  1910. if (memory != NULL)
  1911. result = memory;
  1912. }
  1913. CLEANUP ();
  1914. *lengthp = length;
  1915. return result;
  1916. }
  1917. }
  1918. #define _XT(str) str
  1919. #define CHR_LT_ _XT('<')
  1920. #define CHR_GT_ _XT('>')
  1921. #define CHR_AMP_ _XT('&')
  1922. #define CHR_APOS_ _XT('\'')
  1923. #define CHR_QUOT_ _XT('"')
  1924. #define XML_LT_ _XT("&lt;")
  1925. #define XML_GT_ _XT("&gt;")
  1926. #define XML_AMP_ _XT("&amp;")
  1927. #define XML_APOS_ _XT("&apos;")
  1928. #define XML_QUOT_ _XT("&quot;")
  1929. enum
  1930. {
  1931. LT_SIZE_ = 4, /**< Size of &lt; */
  1932. GT_SIZE_ = 4, /**< Size of &gt; */
  1933. AMP_SIZE_ = 5, /**< Size of &amp; */
  1934. APOS_SIZE_ = 6, /**< Size of &apos; */
  1935. QUOT_SIZE_ = 6 /**< Size of &quot; */
  1936. };
  1937. TOOLKIT_API char *str_xml_escape(const char *src)
  1938. {
  1939. char *p = (char *) src;
  1940. char *escaped = NULL;
  1941. unsigned int len = 0;
  1942. assert (src != NULL);
  1943. /* We first need to calculate the size of the new escaped string. */
  1944. while (*p != _XT('\0'))
  1945. {
  1946. switch (*p)
  1947. {
  1948. case CHR_LT_:
  1949. len += LT_SIZE_;
  1950. break;
  1951. case CHR_GT_:
  1952. len += GT_SIZE_;
  1953. break;
  1954. case CHR_AMP_:
  1955. len += AMP_SIZE_;
  1956. break;
  1957. case CHR_APOS_:
  1958. len += APOS_SIZE_;
  1959. break;
  1960. case CHR_QUOT_:
  1961. len += QUOT_SIZE_;
  1962. break;
  1963. default:
  1964. len += 1;
  1965. break;
  1966. }
  1967. p += 1;
  1968. }
  1969. /* Allocate new string (if necessary). */
  1970. escaped = calloc (len + 1, sizeof (char));
  1971. /* Append characters to new string, escaping the needed ones. */
  1972. p = (char *) src;
  1973. len = 0;
  1974. while (*p != _XT('\0'))
  1975. {
  1976. switch (*p)
  1977. {
  1978. case CHR_LT_:
  1979. memcpy (&escaped[len], XML_LT_, LT_SIZE_);
  1980. len += LT_SIZE_;
  1981. break;
  1982. case CHR_GT_:
  1983. memcpy (&escaped[len], XML_GT_, GT_SIZE_);
  1984. len += GT_SIZE_;
  1985. break;
  1986. case CHR_AMP_:
  1987. memcpy (&escaped[len], XML_AMP_, AMP_SIZE_);
  1988. len += AMP_SIZE_;
  1989. break;
  1990. case CHR_APOS_:
  1991. memcpy (&escaped[len], XML_APOS_, APOS_SIZE_);
  1992. len += APOS_SIZE_;
  1993. break;
  1994. case CHR_QUOT_:
  1995. memcpy (&escaped[len], XML_QUOT_, QUOT_SIZE_);
  1996. len += QUOT_SIZE_;
  1997. break;
  1998. default:
  1999. escaped[len] = *p;
  2000. len += 1;
  2001. break;
  2002. }
  2003. p += 1;
  2004. }
  2005. return escaped;
  2006. }
  2007. /*!
  2008. * @brief
  2009. * @param[in] cmdstart
  2010. * @param[out] argv, args, numargs, numchars
  2011. * @return :
  2012. */
  2013. TOOLKIT_API void str_parse_cmdline (char *cmdstart, char **argv, char *args, int *numargs, int *numchars)
  2014. {
  2015. char *p;
  2016. char c;
  2017. int inquote; /* 1 = inside quotes */
  2018. int copychar; /* 1 = copy char to *args */
  2019. unsigned numslash; /* num of backslashes seen */
  2020. assert(numargs);
  2021. assert(numchars);
  2022. *numchars = 0;
  2023. *numargs = 1; /* the program name at least */
  2024. /* first scan the program name, copy it, and count the bytes */
  2025. p = cmdstart;
  2026. if (argv)
  2027. *argv++ = args;
  2028. /* A quoted program name is handled here. The handling is much
  2029. simpler than for other arguments. Basically, whatever lies
  2030. between the leading double-quote and next one, or a terminal null
  2031. character is simply accepted. Fancier handling is not required
  2032. because the program name must be a legal NTFS/HPFS file name.
  2033. Note that the double-quote characters are not copied, nor do they
  2034. contribute to numchars. */
  2035. inquote = FALSE;
  2036. do {
  2037. if (*p == '\"' )
  2038. {
  2039. inquote = !inquote;
  2040. c = (char) *p++;
  2041. continue;
  2042. }
  2043. ++*numchars;
  2044. if (args)
  2045. *args++ = *p; /*char in cmdstart, the capacity of {args} equals with numchars*/
  2046. c = (char) *p++;
  2047. } while ( (c != 0 && (inquote || (c !=' ' && c != '\t'))) );
  2048. if ( c == 0 ) {
  2049. p--;
  2050. } else {
  2051. if (args)
  2052. *(args-1) = 0;
  2053. }
  2054. inquote = 0;
  2055. /* loop on each argument */
  2056. for(;;) {
  2057. if ( *p ) {
  2058. while (*p == ' ' || *p == '\t')
  2059. ++p;
  2060. }
  2061. if (*p == 0)
  2062. break; /* end of args */
  2063. /* scan an argument */
  2064. if (argv)
  2065. *argv++ = args; /* store ptr to arg */
  2066. ++*numargs;
  2067. /* loop through scanning one argument */
  2068. for (;;) {
  2069. copychar = 1;
  2070. /* Rules: 2N backslashes + " ==> N backslashes and begin/end quote
  2071. 2N+1 backslashes + " ==> N backslashes + literal "
  2072. N backslashes ==> N backslashes */
  2073. numslash = 0;
  2074. while (*p == '\\') {
  2075. /* count number of backslashes for use below */
  2076. ++p;
  2077. ++numslash;
  2078. }
  2079. if (*p == '\"') {
  2080. /* if 2N backslashes before, start/end quote, otherwise
  2081. copy literally */
  2082. if (numslash % 2 == 0) {
  2083. if (inquote && p[1] == '\"') {
  2084. p++; /* Double quote inside quoted string */
  2085. } else { /* skip first quote char and copy second */
  2086. copychar = 0; /* don't copy quote */
  2087. inquote = !inquote;
  2088. }
  2089. }
  2090. numslash /= 2; /* divide numslash by two */
  2091. }
  2092. /* copy slashes */
  2093. while (numslash--) {
  2094. if (args)
  2095. *args++ = '\\';
  2096. ++*numchars;
  2097. }
  2098. /* if at end of arg, break loop */
  2099. if (*p == 0 || (!inquote && (*p == ' ' || *p == '\t')))
  2100. break;
  2101. if (copychar) {
  2102. if (args)
  2103. *args++ = *p;
  2104. ++*numchars;
  2105. }
  2106. ++p;
  2107. }
  2108. /* null-terminate the argument */
  2109. if (args)
  2110. *args++ = 0; /* terminate string */
  2111. ++*numchars;
  2112. }
  2113. /* We put one last argument in -- a null ptr */
  2114. if (argv)
  2115. *argv++ = NULL;
  2116. ++*numargs;
  2117. }