x86UNIXStrings.cc 13 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426
  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 <stdarg.h>
  24. #include <ctype.h>
  25. #include <stdlib.h>
  26. #ifdef HAS_VSSCANF
  27. # undef HAS_VSSCANF
  28. #endif
  29. /* this routine turns a string to all uppercase - rjp */
  30. char *__strtoup(char *str)
  31. {
  32. char *newStr = str;
  33. if (newStr == NULL)
  34. return(NULL);
  35. while (*newStr)
  36. {
  37. *newStr = toupper(*newStr);
  38. *newStr++;
  39. }
  40. return(str);
  41. }
  42. /* this routine turns a string to all lowercase - rjp */
  43. char *__strtolwr(char *str)
  44. {
  45. char *newStr = str;
  46. if (newStr == NULL)
  47. return(NULL);
  48. while (*newStr)
  49. {
  50. *newStr = tolower(*newStr);
  51. *newStr++;
  52. }
  53. return(str);
  54. }
  55. char *strtolwr(char* str)
  56. {
  57. return __strtolwr(str);
  58. }
  59. char *stristr(char *szStringToBeSearched, const char *szSubstringToSearchFor)
  60. {
  61. char *pPos = NULL;
  62. char *szCopy1 = NULL;
  63. char *szCopy2 = NULL;
  64. // verify parameters
  65. if ( szStringToBeSearched == NULL ||
  66. szSubstringToSearchFor == NULL )
  67. {
  68. return szStringToBeSearched;
  69. }
  70. // empty substring - return input (consistent with strstr)
  71. if (strlen(szSubstringToSearchFor) == 0 ) {
  72. return szStringToBeSearched;
  73. }
  74. szCopy1 = __strtolwr(strdup(szStringToBeSearched));
  75. szCopy2 = __strtolwr(strdup(szSubstringToSearchFor));
  76. if ( szCopy1 == NULL || szCopy2 == NULL ) {
  77. // another option is to raise an exception here
  78. free((void*)szCopy1);
  79. free((void*)szCopy2);
  80. return NULL;
  81. }
  82. pPos = strstr(szCopy1, szCopy2);
  83. if ( pPos != NULL ) {
  84. // map to the original string
  85. pPos = szStringToBeSearched + (pPos - szCopy1);
  86. }
  87. free((void*)szCopy1);
  88. free((void*)szCopy2);
  89. return pPos;
  90. } // stristr(...)
  91. char *dStrdup_r(const char *src, const char *fileName, U32 lineNumber)
  92. {
  93. char *buffer = (char *) dMalloc_r(dStrlen(src) + 1, fileName, lineNumber);
  94. dStrcpy(buffer, src);
  95. return buffer;
  96. }
  97. char* dStrcat(char *dst, const char *src)
  98. {
  99. return strcat(dst,src);
  100. }
  101. char* dStrncat(char *dst, const char *src, U32 len)
  102. {
  103. return strncat(dst,src,len);
  104. }
  105. // concatenates a list of src's onto the end of dst
  106. // the list of src's MUST be terminated by a NULL parameter
  107. // dStrcatl(dst, sizeof(dst), src1, src2, NULL);
  108. char* dStrcatl(char *dst, U32 dstSize, ...)
  109. {
  110. const char* src;
  111. char *p = dst;
  112. AssertFatal(dstSize > 0, "dStrcatl: destination size is set zero");
  113. dstSize--; // leave room for string termination
  114. // find end of dst
  115. while (dstSize && *p++)
  116. dstSize--;
  117. va_list args;
  118. va_start(args, dstSize);
  119. // concatenate each src to end of dst
  120. while ( (src = va_arg(args, const char*)) != NULL )
  121. while( dstSize && *src )
  122. {
  123. *p++ = *src++;
  124. dstSize--;
  125. }
  126. va_end(args);
  127. // make sure the string is terminated
  128. *p = 0;
  129. return dst;
  130. }
  131. // copy a list of src's into dst
  132. // the list of src's MUST be terminated by a NULL parameter
  133. // dStrccpyl(dst, sizeof(dst), src1, src2, NULL);
  134. char* dStrcpyl(char *dst, U32 dstSize, ...)
  135. {
  136. const char* src;
  137. char *p = dst;
  138. AssertFatal(dstSize > 0, "dStrcpyl: destination size is set zero");
  139. dstSize--; // leave room for string termination
  140. va_list args;
  141. va_start(args, dstSize);
  142. // concatenate each src to end of dst
  143. while ( (src = va_arg(args, const char*)) != NULL )
  144. while( dstSize && *src )
  145. {
  146. *p++ = *src++;
  147. dstSize--;
  148. }
  149. va_end(args);
  150. // make sure the string is terminated
  151. *p = 0;
  152. return dst;
  153. }
  154. S32 dStrcmp(const char *str1, const char *str2)
  155. {
  156. return strcmp(str1, str2);
  157. }
  158. S32 dStricmp(const char *str1, const char *str2)
  159. {
  160. return strcasecmp(str1, str2);
  161. }
  162. S32 dStrncmp(const char *str1, const char *str2, U32 len)
  163. {
  164. return strncmp(str1, str2, len);
  165. }
  166. S32 dStrnicmp(const char *str1, const char *str2, U32 len)
  167. {
  168. return strncasecmp(str1, str2, len);
  169. }
  170. char* dStrcpy(char *dst, const char *src)
  171. {
  172. return strcpy(dst,src);
  173. }
  174. char* dStrncpy(char *dst, const char *src, U32 len)
  175. {
  176. return strncpy(dst,src,len);
  177. }
  178. U32 dStrlen(const char *str)
  179. {
  180. return strlen(str);
  181. }
  182. char* dStrupr(char *str)
  183. {
  184. #ifdef __MWERKS__ // metrowerks strupr is broken
  185. _strupr(str);
  186. return str;
  187. #else
  188. return __strtoup(str);
  189. #endif
  190. }
  191. char* dStrlwr(char *str)
  192. {
  193. return __strtolwr(str);
  194. }
  195. char* dStrchr(char *str, S32 c)
  196. {
  197. return strchr(str,c);
  198. }
  199. const char* dStrchr(const char *str, S32 c)
  200. {
  201. return strchr(str,c);
  202. }
  203. const char* dStrrchr(const char *str, S32 c)
  204. {
  205. return strrchr(str,c);
  206. }
  207. char* dStrrchr(char *str, S32 c)
  208. {
  209. return strrchr(str,c);
  210. }
  211. U32 dStrspn(const char *str, const char *set)
  212. {
  213. return(strspn(str, set));
  214. }
  215. U32 dStrcspn(const char *str, const char *set)
  216. {
  217. return strcspn(str, set);
  218. }
  219. char* dStrstr(char *str1, char *str2)
  220. {
  221. return strstr(str1,str2);
  222. }
  223. char* dStrstr(const char *str1, const char *str2)
  224. {
  225. return strstr(str1,str2);
  226. }
  227. char* dStrtok(char *str, const char *sep)
  228. {
  229. return strtok(str, sep);
  230. }
  231. S32 dAtoi(const char *str)
  232. {
  233. return atoi(str);
  234. }
  235. F32 dAtof(const char *str)
  236. {
  237. return atof(str);
  238. }
  239. bool dAtob(const char *str)
  240. {
  241. return !dStricmp(str, "true") || dAtof(str);
  242. }
  243. bool dIsalnum(const char c)
  244. {
  245. return isalnum(c);
  246. }
  247. bool dIsalpha(const char c)
  248. {
  249. return(isalpha(c));
  250. }
  251. bool dIsspace(const char c)
  252. {
  253. return(isspace(c));
  254. }
  255. bool dIsdigit(const char c)
  256. {
  257. return(isdigit(c));
  258. }
  259. void dPrintf(const char *format, ...)
  260. {
  261. va_list args;
  262. va_start(args, format);
  263. vprintf(format, args);
  264. }
  265. S32 dVprintf(const char *format, void *arglist)
  266. {
  267. S32 len = vprintf(format, (char*)arglist);
  268. return (len);
  269. }
  270. S32 dSprintf(char *buffer, U32 bufferSize, const char *format, ...)
  271. {
  272. va_list args;
  273. va_start(args, format);
  274. S32 len = vsnprintf(buffer, bufferSize, format, args);
  275. return (len);
  276. }
  277. S32 dVsprintf(char *buffer, U32 bufferSize, const char *format, void *arglist)
  278. {
  279. S32 len = vsnprintf(buffer, bufferSize, format, (char*)arglist);
  280. return (len);
  281. }
  282. S32 dSscanf(const char *buffer, const char *format, ...)
  283. {
  284. va_list args;
  285. #if defined(HAS_VSSCANF)
  286. va_start(args, format);
  287. return __vsscanf(buffer, format, args);
  288. #else
  289. va_start(args, format);
  290. // Boy is this lame. We have to scan through the format string, and find out how many
  291. // arguments there are. We'll store them off as void*, and pass them to the sscanf
  292. // function through specialized calls. We're going to have to put a cap on the number of args that
  293. // can be passed, 8 for the moment. Sigh.
  294. static void* sVarArgs[20];
  295. U32 numArgs = 0;
  296. for (const char* search = format; *search != '\0'; search++) {
  297. if (search[0] == '%' && search[1] != '%')
  298. numArgs++;
  299. }
  300. AssertFatal(numArgs <= 20, "Error, too many arguments to lame implementation of dSscanf. Fix implmentation");
  301. // Ok, we have the number of arguments...
  302. for (U32 i = 0; i < numArgs; i++)
  303. sVarArgs[i] = va_arg(args, void*);
  304. va_end(args);
  305. switch (numArgs) {
  306. case 0: return 0;
  307. case 1: return sscanf(buffer, format, sVarArgs[0]);
  308. case 2: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1]);
  309. case 3: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2]);
  310. case 4: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3]);
  311. case 5: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4]);
  312. case 6: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5]);
  313. case 7: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6]);
  314. case 8: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7]);
  315. case 9: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8]);
  316. 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]);
  317. 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]);
  318. 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]);
  319. 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]);
  320. 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]);
  321. 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]);
  322. 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]);
  323. 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]);
  324. 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]);
  325. 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]);
  326. 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]);
  327. }
  328. return 0;
  329. #endif
  330. }
  331. S32 dFflushStdout()
  332. {
  333. return fflush(stdout);
  334. }
  335. S32 dFflushStderr()
  336. {
  337. return fflush(stderr);
  338. }
  339. void dQsort(void *base, U32 nelem, U32 width, S32 (QSORT_CALLBACK *fcmp)(const void *, const void *))
  340. {
  341. qsort(base, nelem, width, fcmp);
  342. }