strutil.c 49 KB

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