x86UNIXStrings.cc 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494
  1. //-----------------------------------------------------------------------------
  2. // Copyright (c) 2013 GarageGames, LLC
  3. //
  4. // Permission is hereby granted, free of charge, to any person obtaining a copy
  5. // of this software and associated documentation files (the "Software"), to
  6. // deal in the Software without restriction, including without limitation the
  7. // rights to use, copy, modify, merge, publish, distribute, sublicense, and/or
  8. // sell copies of the Software, and to permit persons to whom the Software is
  9. // furnished to do so, subject to the following conditions:
  10. //
  11. // The above copyright notice and this permission notice shall be included in
  12. // all copies or substantial portions of the Software.
  13. //
  14. // THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  15. // IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  16. // FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  17. // AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  18. // LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
  19. // FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS
  20. // IN THE SOFTWARE.
  21. //-----------------------------------------------------------------------------
  22. #include "platformX86UNIX/platformX86UNIX.h"
  23. #include "platform/platform.h"
  24. #include <stdarg.h>
  25. #include <ctype.h>
  26. #include <stdlib.h>
  27. #ifdef HAS_VSSCANF
  28. # undef HAS_VSSCANF
  29. #endif
  30. /* this routine turns a string to all uppercase - rjp */
  31. char *__strtoup(char *str)
  32. {
  33. char *newStr = str;
  34. if (newStr == NULL)
  35. return(NULL);
  36. while (*newStr)
  37. {
  38. *newStr = toupper(*newStr);
  39. *newStr++;
  40. }
  41. return(str);
  42. }
  43. /* this routine turns a string to all lowercase - rjp */
  44. char *__strtolwr(char *str)
  45. {
  46. char *newStr = str;
  47. if (newStr == NULL)
  48. return(NULL);
  49. while (*newStr)
  50. {
  51. *newStr = tolower(*newStr);
  52. *newStr++;
  53. }
  54. return(str);
  55. }
  56. char *strtolwr(char* str)
  57. {
  58. return __strtolwr(str);
  59. }
  60. char *stristr(char *szStringToBeSearched, const char *szSubstringToSearchFor)
  61. {
  62. char *pPos = NULL;
  63. char *szCopy1 = NULL;
  64. char *szCopy2 = NULL;
  65. // verify parameters
  66. if ( szStringToBeSearched == NULL ||
  67. szSubstringToSearchFor == NULL )
  68. {
  69. return szStringToBeSearched;
  70. }
  71. // empty substring - return input (consistent with strstr)
  72. if (strlen(szSubstringToSearchFor) == 0 ) {
  73. return szStringToBeSearched;
  74. }
  75. szCopy1 = __strtolwr(strdup(szStringToBeSearched));
  76. szCopy2 = __strtolwr(strdup(szSubstringToSearchFor));
  77. if ( szCopy1 == NULL || szCopy2 == NULL ) {
  78. // another option is to raise an exception here
  79. free((void*)szCopy1);
  80. free((void*)szCopy2);
  81. return NULL;
  82. }
  83. pPos = strstr(szCopy1, szCopy2);
  84. if ( pPos != NULL ) {
  85. // map to the original string
  86. pPos = szStringToBeSearched + (pPos - szCopy1);
  87. }
  88. free((void*)szCopy1);
  89. free((void*)szCopy2);
  90. return pPos;
  91. } // stristr(...)
  92. char *dStrdup_r(const char *src, const char *fileName, size_t lineNumber)
  93. {
  94. char *buffer = (char *) dMalloc_r(dStrlen(src) + 1, fileName, lineNumber);
  95. dStrcpy(buffer, src);
  96. return buffer;
  97. }
  98. char* dStrcat(char *dst, const char *src)
  99. {
  100. return strcat(dst,src);
  101. }
  102. char* dStrncat(char *dst, const char *src, size_t len)
  103. {
  104. return strncat(dst,src,len);
  105. }
  106. // concatenates a list of src's onto the end of dst
  107. // the list of src's MUST be terminated by a NULL parameter
  108. // dStrcatl(dst, sizeof(dst), src1, src2, NULL);
  109. char* dStrcatl(char *dst, size_t dstSize, ...)
  110. {
  111. const char* src;
  112. char *p = dst;
  113. AssertFatal(dstSize > 0, "dStrcatl: destination size is set zero");
  114. dstSize--; // leave room for string termination
  115. // find end of dst
  116. while (dstSize && *p++)
  117. dstSize--;
  118. va_list args;
  119. va_start(args, dstSize);
  120. // concatenate each src to end of dst
  121. while ( (src = va_arg(args, const char*)) != NULL )
  122. while( dstSize && *src )
  123. {
  124. *p++ = *src++;
  125. dstSize--;
  126. }
  127. va_end(args);
  128. // make sure the string is terminated
  129. *p = 0;
  130. return dst;
  131. }
  132. // copy a list of src's into dst
  133. // the list of src's MUST be terminated by a NULL parameter
  134. // dStrccpyl(dst, sizeof(dst), src1, src2, NULL);
  135. char* dStrcpyl(char *dst, size_t dstSize, ...)
  136. {
  137. const char* src;
  138. char *p = dst;
  139. AssertFatal(dstSize > 0, "dStrcpyl: destination size is set zero");
  140. dstSize--; // leave room for string termination
  141. va_list args;
  142. va_start(args, dstSize);
  143. // concatenate each src to end of dst
  144. while ( (src = va_arg(args, const char*)) != NULL )
  145. while( dstSize && *src )
  146. {
  147. *p++ = *src++;
  148. dstSize--;
  149. }
  150. va_end(args);
  151. // make sure the string is terminated
  152. *p = 0;
  153. return dst;
  154. }
  155. S32 dStrcmp(const char *str1, const char *str2)
  156. {
  157. return strcmp(str1, str2);
  158. }
  159. S32 dStrcmp(const UTF16 *str1, const UTF16 *str2)
  160. {
  161. int ret;
  162. const UTF16 *a, *b;
  163. a = str1;
  164. b = str2;
  165. while (*a && *b && (ret = *a - *b) == 0)
  166. {
  167. a++, b++;
  168. }
  169. if (*a == 0 && *b != 0)
  170. return -1;
  171. if (*b == 0 && *a != 0)
  172. return 1;
  173. return ret;
  174. }
  175. S32 dStricmp(const char *str1, const char *str2)
  176. {
  177. return strcasecmp(str1, str2);
  178. }
  179. S32 dStrncmp(const char *str1, const char *str2, size_t len)
  180. {
  181. return strncmp(str1, str2, len);
  182. }
  183. S32 dStrnicmp(const char *str1, const char *str2, size_t len)
  184. {
  185. return strncasecmp(str1, str2, len);
  186. }
  187. char* dStrcpy(char *dst, const char *src)
  188. {
  189. return strcpy(dst,src);
  190. }
  191. char* dStrncpy(char *dst, const char *src, size_t len)
  192. {
  193. return strncpy(dst,src,len);
  194. }
  195. U32 dStrlen(const char *str)
  196. {
  197. return strlen(str);
  198. }
  199. char* dStrupr(char *str)
  200. {
  201. #ifdef __MWERKS__ // metrowerks strupr is broken
  202. _strupr(str);
  203. return str;
  204. #else
  205. return __strtoup(str);
  206. #endif
  207. }
  208. char* dStrlwr(char *str)
  209. {
  210. return __strtolwr(str);
  211. }
  212. char* dStrchr(char *str, S32 c)
  213. {
  214. return strchr(str,c);
  215. }
  216. const char* dStrchr(const char *str, S32 c)
  217. {
  218. return strchr(str,c);
  219. }
  220. const char* dStrrchr(const char *str, S32 c)
  221. {
  222. return strrchr(str,c);
  223. }
  224. char* dStrrchr(char *str, S32 c)
  225. {
  226. return strrchr(str,c);
  227. }
  228. U32 dStrspn(const char *str, const char *set)
  229. {
  230. return(strspn(str, set));
  231. }
  232. U32 dStrcspn(const char *str, const char *set)
  233. {
  234. return strcspn(str, set);
  235. }
  236. char* dStrstr(char *str1, const char *str2)
  237. {
  238. return strstr(str1,str2);
  239. }
  240. const char* dStrstr(const char *str1, const char *str2)
  241. {
  242. return strstr((char *)str1,str2);
  243. }
  244. char* dStrtok(char *str, const char *sep)
  245. {
  246. return strtok(str, sep);
  247. }
  248. S32 dAtoi(const char *str)
  249. {
  250. return atoi(str);
  251. }
  252. F32 dAtof(const char *str)
  253. {
  254. return atof(str);
  255. }
  256. bool dAtob(const char *str)
  257. {
  258. return !dStricmp(str, "true") || dAtof(str);
  259. }
  260. bool dIsalnum(const char c)
  261. {
  262. return isalnum(c);
  263. }
  264. bool dIsalpha(const char c)
  265. {
  266. return(isalpha(c));
  267. }
  268. bool dIsspace(const char c)
  269. {
  270. return(isspace(c));
  271. }
  272. bool dIsdigit(const char c)
  273. {
  274. return(isdigit(c));
  275. }
  276. void dPrintf(const char *format, ...)
  277. {
  278. va_list args;
  279. va_start(args, format);
  280. vprintf(format, args);
  281. va_end(args);
  282. }
  283. S32 dVprintf(const char *format, va_list arglist)
  284. {
  285. S32 len = vprintf(format, arglist);
  286. return (len);
  287. }
  288. S32 dSprintf(char *buffer, size_t bufferSize, const char *format, ...)
  289. {
  290. va_list args;
  291. va_start(args, format);
  292. S32 len = vsnprintf(buffer, bufferSize, format, args);
  293. va_end(args);
  294. return len;
  295. }
  296. S32 dVsprintf(char *buffer, size_t bufferSize, const char *format, va_list arglist)
  297. {
  298. S32 len = vsnprintf(buffer, bufferSize, format, arglist);
  299. return len;
  300. }
  301. S32 dStrrev(char *str)
  302. {
  303. // Get string length
  304. S32 l = dStrlen(str) - 1;
  305. for (int x = 0; x < 1; x++,l--)
  306. {
  307. // triple XOR trick
  308. str[x]^=str[l];
  309. str[l]^=str[x];
  310. str[x]^=str[l];
  311. }
  312. return l;
  313. }
  314. S32 dItoa(S32 n, char s[])
  315. {
  316. S32 i, sign;
  317. if ((sign = n) < 0)
  318. n = -n;
  319. i = 0;
  320. do {
  321. s[i++] = n % 10 + '0';
  322. } while((n /= 10) > 0);
  323. if (sign < 0)
  324. s[i++] = '-';
  325. dStrrev(s);
  326. return dStrlen(s);
  327. }
  328. S32 dSscanf(const char *buffer, const char *format, ...)
  329. {
  330. va_list args;
  331. #if defined(HAS_VSSCANF)
  332. va_start(args, format);
  333. return __vsscanf(buffer, format, args);
  334. #else
  335. va_start(args, format);
  336. // Boy is this lame. We have to scan through the format string, and find out how many
  337. // arguments there are. We'll store them off as void*, and pass them to the sscanf
  338. // function through specialized calls. We're going to have to put a cap on the number of args that
  339. // can be passed, 8 for the moment. Sigh.
  340. static void* sVarArgs[20];
  341. U32 numArgs = 0;
  342. for (const char* search = format; *search != '\0'; search++) {
  343. if (search[0] == '%' && search[1] != '%')
  344. numArgs++;
  345. }
  346. AssertFatal(numArgs <= 20, "Error, too many arguments to lame implementation of dSscanf. Fix implmentation");
  347. // Ok, we have the number of arguments...
  348. for (U32 i = 0; i < numArgs; i++)
  349. sVarArgs[i] = va_arg(args, void*);
  350. va_end(args);
  351. switch (numArgs) {
  352. case 0: return 0;
  353. case 1: return sscanf(buffer, format, sVarArgs[0]);
  354. case 2: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1]);
  355. case 3: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2]);
  356. case 4: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3]);
  357. case 5: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4]);
  358. case 6: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5]);
  359. case 7: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6]);
  360. case 8: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7]);
  361. case 9: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8]);
  362. case 10: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9]);
  363. case 11: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10]);
  364. case 12: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11]);
  365. case 13: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12]);
  366. case 14: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13]);
  367. case 15: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13], sVarArgs[14]);
  368. case 16: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13], sVarArgs[14], sVarArgs[15]);
  369. case 17: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13], sVarArgs[14], sVarArgs[15], sVarArgs[16]);
  370. case 18: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13], sVarArgs[14], sVarArgs[15], sVarArgs[16], sVarArgs[17]);
  371. case 19: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13], sVarArgs[14], sVarArgs[15], sVarArgs[16], sVarArgs[17], sVarArgs[18]);
  372. case 20: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8], sVarArgs[9], sVarArgs[10], sVarArgs[11], sVarArgs[12], sVarArgs[13], sVarArgs[14], sVarArgs[15], sVarArgs[16], sVarArgs[17], sVarArgs[18], sVarArgs[19]);
  373. }
  374. return 0;
  375. #endif
  376. }
  377. S32 dFflushStdout()
  378. {
  379. return fflush(stdout);
  380. }
  381. S32 dFflushStderr()
  382. {
  383. return fflush(stderr);
  384. }
  385. void dQsort(void *base, U32 nelem, U32 width, S32 (QSORT_CALLBACK *fcmp)(const void *, const void *))
  386. {
  387. qsort(base, nelem, width, fcmp);
  388. }
  389. StringTableEntry Platform::createUUID(void)
  390. {
  391. return NULL;
  392. }