winStrings.cc 14 KB

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