winStrings.cc 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493
  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 "platformWin32/platformWin32.h"
  23. #ifndef _STRINGTABLE_H_
  24. #include "string/stringTable.h"
  25. #endif
  26. #ifdef HAS_VSSCANF
  27. # undef HAS_VSSCANF
  28. #endif
  29. #if defined(TORQUE_COMPILER_CODEWARRIOR)
  30. # define HAS_VSSCANF
  31. # define __vsscanf vsscanf
  32. #endif
  33. #if defined(TORQUE_COMPILER_GCC)
  34. # include <stdlib.h>
  35. # include <ctype.h>
  36. #endif
  37. char *dStrdup_r(const char *src, const char *fileName, dsize_t lineNumber)
  38. {
  39. char *buffer = (char *) dMalloc_r(dStrlen(src) + 1, fileName, lineNumber);
  40. dStrcpy(buffer, src);
  41. return buffer;
  42. }
  43. char* dStrcat(char *dst, const char *src)
  44. {
  45. return strcat(dst,src);
  46. }
  47. /*UTF8* dStrcat(UTF8 *dst, const UTF8 *src)
  48. {
  49. return (UTF8*)strcat((char*)dst,(char*)src);
  50. } */
  51. char* dStrncat(char *dst, const char *src, dsize_t len)
  52. {
  53. return strncat(dst,src,len);
  54. }
  55. // concatenates a list of src's onto the end of dst
  56. // the list of src's MUST be terminated by a NULL parameter
  57. // dStrcatl(dst, sizeof(dst), src1, src2, NULL);
  58. char* dStrcatl(char *dst, dsize_t dstSize, ...)
  59. {
  60. const char* src;
  61. char *p = dst;
  62. AssertFatal(dstSize > 0, "dStrcatl: destination size is set zero");
  63. dstSize--; // leave room for string termination
  64. // find end of dst
  65. while (dstSize && *p)
  66. {
  67. p++;
  68. dstSize--;
  69. }
  70. va_list args;
  71. va_start(args, dstSize);
  72. // concatenate each src to end of dst
  73. while ( (src = va_arg(args, const char*)) != NULL )
  74. {
  75. while( dstSize && *src )
  76. {
  77. *p++ = *src++;
  78. dstSize--;
  79. }
  80. }
  81. va_end(args);
  82. // make sure the string is terminated
  83. *p = 0;
  84. return dst;
  85. }
  86. // copy a list of src's into dst
  87. // the list of src's MUST be terminated by a NULL parameter
  88. // dStrccpyl(dst, sizeof(dst), src1, src2, NULL);
  89. char* dStrcpyl(char *dst, dsize_t dstSize, ...)
  90. {
  91. const char* src;
  92. char *p = dst;
  93. AssertFatal(dstSize > 0, "dStrcpyl: destination size is set zero");
  94. dstSize--; // leave room for string termination
  95. va_list args;
  96. va_start(args, dstSize);
  97. // concatenate each src to end of dst
  98. while ( (src = va_arg(args, const char*)) != NULL )
  99. while( dstSize && *src )
  100. {
  101. *p++ = *src++;
  102. dstSize--;
  103. }
  104. va_end(args);
  105. // make sure the string is terminated
  106. *p = 0;
  107. return dst;
  108. }
  109. int dStrcmp(const char *str1, const char *str2)
  110. {
  111. return strcmp(str1, str2);
  112. }
  113. int dStrcmp(const UTF16 *str1, const UTF16 *str2)
  114. {
  115. return wcscmp(str1, str2);
  116. }
  117. int dStricmp(const char *str1, const char *str2)
  118. {
  119. return stricmp(str1, str2);
  120. }
  121. int dStrncmp(const char *str1, const char *str2, dsize_t len)
  122. {
  123. return strncmp(str1, str2, len);
  124. }
  125. int dStrnicmp(const char *str1, const char *str2, dsize_t len)
  126. {
  127. return strnicmp(str1, str2, len);
  128. }
  129. char* dStrcpy(UTF8 *dst, const UTF8 *src)
  130. {
  131. return strcpy((char*)dst,(char*)src);
  132. }
  133. char* dStrncpy(char *dst, const char *src, dsize_t len)
  134. {
  135. return strncpy(dst,src,len);
  136. }
  137. /*char* dStrncpy(UTF8 *dst, const UTF8 *src, dsize_t len)
  138. {
  139. return strncpy((char*)dst,(char*)src,len);
  140. } */
  141. dsize_t dStrlen(const char *str)
  142. {
  143. return (dsize_t)strlen(str);
  144. }
  145. /*dsize_t dStrlen(const UTF8 *str)
  146. {
  147. // [tom, 7/12/2005] http://mail.nl.linux.org/linux-utf8/2000-06/msg00002.html
  148. int c = 0;
  149. for(; str; str = getNextUTF8Char(str))
  150. c++;
  151. return c;
  152. }*/
  153. dsize_t dStrlen(const UTF16 *str)
  154. {
  155. return (dsize_t)wcslen(str);
  156. }
  157. char* dStrupr(char *str)
  158. {
  159. #if defined(TORQUE_COMPILER_CODEWARRIOR)
  160. // metrowerks strupr is broken
  161. _strupr(str);
  162. return str;
  163. #else
  164. return strupr(str);
  165. #endif
  166. }
  167. char* dStrlwr(char *str)
  168. {
  169. return strlwr(str);
  170. }
  171. char* dStrchr(char *str, S32 c)
  172. {
  173. return strchr(str,c);
  174. }
  175. const char* dStrchr(const char *str, S32 c)
  176. {
  177. return strchr(str,c);
  178. }
  179. const char* dStrrchr(const char *str, S32 c)
  180. {
  181. return strrchr(str,c);
  182. }
  183. char* dStrrchr(char *str, S32 c)
  184. {
  185. return strrchr(str,c);
  186. }
  187. dsize_t dStrspn(const char *str, const char *set)
  188. {
  189. return (dsize_t)strspn(str, set);
  190. }
  191. dsize_t dStrcspn(const char *str, const char *set)
  192. {
  193. return (dsize_t)strcspn(str, set);
  194. }
  195. char* dStrstr(char *str1, char *str2)
  196. {
  197. return strstr(str1,str2);
  198. }
  199. char* dStrstr(const char *str1, const char *str2)
  200. {
  201. return strstr((char *)str1,str2);
  202. }
  203. char* dStrtok(char *str, const char *sep)
  204. {
  205. return strtok(str, sep);
  206. }
  207. S32 dAtoi(const char *str)
  208. {
  209. return atoi(str);
  210. }
  211. F32 dAtof(const char *str)
  212. {
  213. // Warning: metrowerks crashes when strange strings are passed in '0x [enter]' for example!
  214. return (F32)atof(str);
  215. }
  216. bool dAtob(const char *str)
  217. {
  218. return !dStricmp(str, "true") || dAtof(str);
  219. }
  220. bool dIsalnum(const char c)
  221. {
  222. return isalnum(c)!=0;
  223. }
  224. bool dIsalpha(const char c)
  225. {
  226. return isalpha(c)!=0;
  227. }
  228. bool dIsspace(const char c)
  229. {
  230. return isspace(c)!=0;
  231. }
  232. bool dIsdigit(const char c)
  233. {
  234. return isdigit(c)!=0;
  235. }
  236. void dPrintf(const char *format, ...)
  237. {
  238. va_list args;
  239. va_start(args, format);
  240. vprintf(format, args);
  241. }
  242. S32 dVprintf(const char *format, void *arglist)
  243. {
  244. S32 len = vprintf(format, (char*)arglist);
  245. return (len);
  246. }
  247. S32 dSprintf(char *buffer, U32 bufferSize, const char *format, ...)
  248. {
  249. va_list args;
  250. va_start(args, format);
  251. S32 len = vsnprintf(buffer, bufferSize, format, args);
  252. AssertFatal( (U32)len < bufferSize, "dSprintf wrote to more memory than the specified buffer size - Stack Corruption Possible" ); //Added
  253. return (len);
  254. }
  255. S32 dVsprintf(char *buffer, U32 bufferSize, const char *format, void *arglist)
  256. {
  257. S32 len = vsnprintf(buffer, bufferSize, format, (char*)arglist);
  258. AssertFatal( (U32)len < bufferSize, "dVsprintf wrote to more memory than the specified buffer size - Stack Corruption Possible" );
  259. return (len);
  260. }
  261. //%PUAP% -Mat -----------------------------------------------------------------------------------------------
  262. int dStrrev(char* str)
  263. {
  264. int l=dStrlen(str)-1; //get the string length
  265. for(int x=0;x < l;x++,l--)
  266. {
  267. str[x]^=str[l]; //triple XOR Trick
  268. str[l]^=str[x]; //for not using a temp
  269. str[x]^=str[l];
  270. }
  271. return l;
  272. }
  273. int dItoa(int n, char s[])
  274. {
  275. int i, sign;
  276. if ((sign = n) < 0) /* record sign */
  277. n = -n; /* make n positive */
  278. i = 0;
  279. do { /* generate digits in reverse order */
  280. s[i++] = n % 10 + '0'; /* get next digit */
  281. } while ((n /= 10) > 0); /* delete it */
  282. if (sign < 0)
  283. s[i++] = '-';
  284. s[i] = '\0';
  285. dStrrev(s);
  286. return dStrlen(s);
  287. }
  288. //%PUAP%-----------------------------------------------------------------------------------------------------
  289. S32 dSscanf(const char *buffer, const char *format, ...)
  290. {
  291. va_list args;
  292. #if defined(HAS_VSSCANF)
  293. va_start(args, format);
  294. return __vsscanf(buffer, format, args);
  295. #else
  296. va_start(args, format);
  297. // Boy is this lame. We have to scan through the format string, and find out how many
  298. // arguments there are. We'll store them off as void*, and pass them to the sscanf
  299. // function through specialized calls. We're going to have to put a cap on the number of args that
  300. // can be passed, 8 for the moment. Sigh.
  301. void* sVarArgs[20];
  302. U32 numArgs = 0;
  303. for (const char* search = format; *search != '\0'; search++) {
  304. if (search[0] == '%' && search[1] != '%')
  305. numArgs++;
  306. }
  307. AssertFatal(numArgs <= 20, "Error, too many arguments to lame implementation of dSscanf. Fix implmentation");
  308. // Ok, we have the number of arguments...
  309. for (U32 i = 0; i < numArgs; i++)
  310. sVarArgs[i] = va_arg(args, void*);
  311. va_end(args);
  312. switch (numArgs) {
  313. case 0: return 0;
  314. case 1: return sscanf(buffer, format, sVarArgs[0]);
  315. case 2: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1]);
  316. case 3: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2]);
  317. case 4: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3]);
  318. case 5: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4]);
  319. case 6: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5]);
  320. case 7: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6]);
  321. case 8: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7]);
  322. case 9: return sscanf(buffer, format, sVarArgs[0], sVarArgs[1], sVarArgs[2], sVarArgs[3], sVarArgs[4], sVarArgs[5], sVarArgs[6], sVarArgs[7], sVarArgs[8]);
  323. 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]);
  324. 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]);
  325. 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]);
  326. 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]);
  327. 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]);
  328. 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]);
  329. 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]);
  330. 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]);
  331. 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]);
  332. 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]);
  333. 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]);
  334. }
  335. return 0;
  336. #endif
  337. }
  338. S32 dFflushStdout()
  339. {
  340. return fflush(stdout);
  341. }
  342. S32 dFflushStderr()
  343. {
  344. return fflush(stderr);
  345. }
  346. void dQsort(void *base, U32 nelem, U32 width, S32 (QSORT_CALLBACK *fcmp)(const void *, const void *))
  347. {
  348. if ( nelem == 0 )
  349. return;
  350. qsort(base, nelem, width, fcmp);
  351. }
  352. UTF8 * convertUTF16toUTF8(const UTF16 *string, UTF8 *buffer, U32 bufsize)
  353. {
  354. int nRet;
  355. if((nRet = WideCharToMultiByte(CP_UTF8, 0, string, dStrlen(string), (LPSTR)buffer, bufsize, NULL, NULL)) != 0)
  356. {
  357. buffer[nRet] = 0;
  358. return buffer;
  359. }
  360. else
  361. return NULL;
  362. }
  363. UTF16 * convertUTF8toUTF16(const UTF8 *string, UTF16 *buffer, U32 bufsize)
  364. {
  365. int nRet;
  366. if((nRet = MultiByteToWideChar(CP_UTF8, 0, (LPCSTR)string, dStrlen((const char *)string), buffer, bufsize)) != 0)
  367. {
  368. buffer[nRet] = 0;
  369. return buffer;
  370. }
  371. else
  372. return NULL;
  373. }
  374. //-----------------------------------------------------------------------------
  375. StringTableEntry Platform::createUUID( void )
  376. {
  377. // Create UUID.
  378. UUID id;
  379. UuidCreate( &id );
  380. // Format UUID.
  381. char uuidBuffer[128];
  382. dSprintf( uuidBuffer, sizeof(uuidBuffer),
  383. "%08x-%04x-%04x-%02x%02x-%02x%02x%02x%02x%02x%02x",
  384. id.Data1,
  385. id.Data2,
  386. id.Data3,
  387. id.Data4[0],
  388. id.Data4[1],
  389. id.Data4[2],
  390. id.Data4[3],
  391. id.Data4[4],
  392. id.Data4[5],
  393. id.Data4[6],
  394. id.Data4[7]);
  395. return StringTable->insert(uuidBuffer);
  396. }