sqstdstring.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518
  1. /* see copyright notice in squirrel.h */
  2. #include <squirrel.h>
  3. #include <sqstdstring.h>
  4. #include <string.h>
  5. #include <stdlib.h>
  6. #include <stdio.h>
  7. #include <ctype.h>
  8. #include <assert.h>
  9. #define MAX_FORMAT_LEN 20
  10. #define MAX_WFORMAT_LEN 3
  11. #define ADDITIONAL_FORMAT_SPACE (100*sizeof(SQChar))
  12. static SQBool isfmtchr(SQChar ch)
  13. {
  14. switch(ch) {
  15. case '-': case '+': case ' ': case '#': case '0': return SQTrue;
  16. }
  17. return SQFalse;
  18. }
  19. static SQInteger validate_format(HSQUIRRELVM v, SQChar *fmt, const SQChar *src, SQInteger n,SQInteger &width)
  20. {
  21. SQChar *dummy;
  22. SQChar swidth[MAX_WFORMAT_LEN];
  23. SQInteger wc = 0;
  24. SQInteger start = n;
  25. fmt[0] = '%';
  26. while (isfmtchr(src[n])) n++;
  27. while (scisdigit(src[n])) {
  28. swidth[wc] = src[n];
  29. n++;
  30. wc++;
  31. if(wc>=MAX_WFORMAT_LEN)
  32. return sq_throwerror(v,_SC("width format too long"));
  33. }
  34. swidth[wc] = '\0';
  35. if(wc > 0) {
  36. width = scstrtol(swidth,&dummy,10);
  37. }
  38. else
  39. width = 0;
  40. if (src[n] == '.') {
  41. n++;
  42. wc = 0;
  43. while (scisdigit(src[n])) {
  44. swidth[wc] = src[n];
  45. n++;
  46. wc++;
  47. if(wc>=MAX_WFORMAT_LEN)
  48. return sq_throwerror(v,_SC("precision format too long"));
  49. }
  50. swidth[wc] = '\0';
  51. if(wc > 0) {
  52. width += scstrtol(swidth,&dummy,10);
  53. }
  54. }
  55. if (n-start > MAX_FORMAT_LEN )
  56. return sq_throwerror(v,_SC("format too long"));
  57. memcpy(&fmt[1],&src[start],((n-start)+1)*sizeof(SQChar));
  58. fmt[(n-start)+2] = '\0';
  59. return n;
  60. }
  61. SQRESULT sqstd_format(HSQUIRRELVM v,SQInteger nformatstringidx,SQInteger *outlen,SQChar **output)
  62. {
  63. const SQChar *format;
  64. SQChar *dest;
  65. SQChar fmt[MAX_FORMAT_LEN];
  66. const SQRESULT res = sq_getstring(v,nformatstringidx,&format);
  67. if (SQ_FAILED(res)) {
  68. return res; // propagate the error
  69. }
  70. SQInteger format_size = sq_getsize(v,nformatstringidx);
  71. SQInteger allocated = (format_size+2)*sizeof(SQChar);
  72. dest = sq_getscratchpad(v,allocated);
  73. SQInteger n = 0,i = 0, nparam = nformatstringidx+1, w = 0;
  74. //while(format[n] != '\0')
  75. while(n < format_size)
  76. {
  77. if(format[n] != '%') {
  78. assert(i < allocated);
  79. dest[i++] = format[n];
  80. n++;
  81. }
  82. else if(format[n+1] == '%') { //handles %%
  83. dest[i++] = '%';
  84. n += 2;
  85. }
  86. else {
  87. n++;
  88. if( nparam > sq_gettop(v) )
  89. return sq_throwerror(v,_SC("not enough parameters for the given format string"));
  90. n = validate_format(v,fmt,format,n,w);
  91. if(n < 0) return -1;
  92. SQInteger addlen = 0;
  93. SQInteger valtype = 0;
  94. const SQChar *ts = NULL;
  95. SQInteger ti = 0;
  96. SQFloat tf = 0;
  97. switch(format[n]) {
  98. case 's':
  99. if(SQ_FAILED(sq_getstring(v,nparam,&ts)))
  100. return sq_throwerror(v,_SC("string expected for the specified format"));
  101. addlen = (sq_getsize(v,nparam)*sizeof(SQChar))+((w+1)*sizeof(SQChar));
  102. valtype = 's';
  103. break;
  104. case 'i': case 'd': case 'o': case 'u': case 'x': case 'X':
  105. #ifdef _SQ64
  106. {
  107. size_t flen = scstrlen(fmt);
  108. SQInteger fpos = flen - 1;
  109. SQChar f = fmt[fpos];
  110. const SQChar *prec = (const SQChar *)_PRINT_INT_PREC;
  111. while(*prec != _SC('\0')) {
  112. fmt[fpos++] = *prec++;
  113. }
  114. fmt[fpos++] = f;
  115. fmt[fpos++] = _SC('\0');
  116. }
  117. #endif
  118. case 'c':
  119. if(SQ_FAILED(sq_getinteger(v,nparam,&ti)))
  120. return sq_throwerror(v,_SC("integer expected for the specified format"));
  121. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  122. valtype = 'i';
  123. break;
  124. case 'f': case 'g': case 'G': case 'e': case 'E':
  125. if(SQ_FAILED(sq_getfloat(v,nparam,&tf)))
  126. return sq_throwerror(v,_SC("float expected for the specified format"));
  127. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  128. valtype = 'f';
  129. break;
  130. default:
  131. return sq_throwerror(v,_SC("invalid format"));
  132. }
  133. n++;
  134. allocated += addlen + sizeof(SQChar);
  135. dest = sq_getscratchpad(v,allocated);
  136. switch(valtype) {
  137. case 's': i += scsprintf(&dest[i],allocated,fmt,ts); break;
  138. case 'i': i += scsprintf(&dest[i],allocated,fmt,ti); break;
  139. case 'f': i += scsprintf(&dest[i],allocated,fmt,tf); break;
  140. };
  141. nparam ++;
  142. }
  143. }
  144. *outlen = i;
  145. dest[i] = '\0';
  146. *output = dest;
  147. return SQ_OK;
  148. }
  149. static SQInteger _string_printf(HSQUIRRELVM v)
  150. {
  151. SQChar *dest = NULL;
  152. SQInteger length = 0;
  153. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  154. return -1;
  155. SQPRINTFUNCTION printfunc = sq_getprintfunc(v);
  156. if(printfunc) printfunc(v,dest);
  157. return 0;
  158. }
  159. static SQInteger _string_format(HSQUIRRELVM v)
  160. {
  161. SQChar *dest = NULL;
  162. SQInteger length = 0;
  163. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  164. return -1;
  165. sq_pushstring(v,dest,length);
  166. return 1;
  167. }
  168. static void __strip_l(const SQChar *str,const SQChar **start)
  169. {
  170. const SQChar *t = str;
  171. while(((*t) != '\0') && scisspace(*t)){ t++; }
  172. *start = t;
  173. }
  174. static void __strip_r(const SQChar *str,SQInteger len,const SQChar **end)
  175. {
  176. if(len == 0) {
  177. *end = str;
  178. return;
  179. }
  180. const SQChar *t = &str[len-1];
  181. while(t >= str && scisspace(*t)) { t--; }
  182. *end = t + 1;
  183. }
  184. static SQInteger _string_strip(HSQUIRRELVM v)
  185. {
  186. const SQChar *str,*start,*end;
  187. sq_getstring(v,2,&str);
  188. SQInteger len = sq_getsize(v,2);
  189. __strip_l(str,&start);
  190. __strip_r(str,len,&end);
  191. sq_pushstring(v,start,end - start);
  192. return 1;
  193. }
  194. static SQInteger _string_lstrip(HSQUIRRELVM v)
  195. {
  196. const SQChar *str,*start;
  197. sq_getstring(v,2,&str);
  198. __strip_l(str,&start);
  199. sq_pushstring(v,start,-1);
  200. return 1;
  201. }
  202. static SQInteger _string_rstrip(HSQUIRRELVM v)
  203. {
  204. const SQChar *str,*end;
  205. sq_getstring(v,2,&str);
  206. SQInteger len = sq_getsize(v,2);
  207. __strip_r(str,len,&end);
  208. sq_pushstring(v,str,end - str);
  209. return 1;
  210. }
  211. static SQInteger _string_split(HSQUIRRELVM v)
  212. {
  213. const SQChar *str,*seps;
  214. SQChar *stemp;
  215. sq_getstring(v,2,&str);
  216. sq_getstring(v,3,&seps);
  217. SQInteger sepsize = sq_getsize(v,3);
  218. if(sepsize == 0) return sq_throwerror(v,_SC("empty separators string"));
  219. SQInteger memsize = (sq_getsize(v,2)+1)*sizeof(SQChar);
  220. stemp = sq_getscratchpad(v,memsize);
  221. memcpy(stemp,str,memsize);
  222. SQChar *start = stemp;
  223. SQChar *end = stemp;
  224. sq_newarray(v,0);
  225. while(*end != '\0')
  226. {
  227. SQChar cur = *end;
  228. for(SQInteger i = 0; i < sepsize; i++)
  229. {
  230. if(cur == seps[i])
  231. {
  232. *end = 0;
  233. sq_pushstring(v,start,-1);
  234. sq_arrayappend(v,-2);
  235. start = end + 1;
  236. break;
  237. }
  238. }
  239. end++;
  240. }
  241. if(end != start)
  242. {
  243. sq_pushstring(v,start,-1);
  244. sq_arrayappend(v,-2);
  245. }
  246. return 1;
  247. }
  248. static SQInteger _string_escape(HSQUIRRELVM v)
  249. {
  250. const SQChar *str;
  251. SQChar *dest,*resstr;
  252. SQInteger size;
  253. sq_getstring(v,2,&str);
  254. size = sq_getsize(v,2);
  255. if(size == 0) {
  256. sq_push(v,2);
  257. return 1;
  258. }
  259. #ifdef SQUNICODE
  260. #if WCHAR_SIZE == 2
  261. const SQChar *escpat = _SC("\\x%04x");
  262. const SQInteger maxescsize = 6;
  263. #else //WCHAR_SIZE == 4
  264. const SQChar *escpat = _SC("\\x%08x");
  265. const SQInteger maxescsize = 10;
  266. #endif
  267. #else
  268. const SQChar *escpat = _SC("\\x%02x");
  269. const SQInteger maxescsize = 4;
  270. #endif
  271. SQInteger destcharsize = (size * maxescsize); //assumes every char could be escaped
  272. resstr = dest = (SQChar *)sq_getscratchpad(v,destcharsize * sizeof(SQChar));
  273. SQChar c;
  274. SQChar escch;
  275. SQInteger escaped = 0;
  276. for(int n = 0; n < size; n++){
  277. c = *str++;
  278. escch = 0;
  279. if(scisprint(c) || c == 0) {
  280. switch(c) {
  281. case '\a': escch = 'a'; break;
  282. case '\b': escch = 'b'; break;
  283. case '\t': escch = 't'; break;
  284. case '\n': escch = 'n'; break;
  285. case '\v': escch = 'v'; break;
  286. case '\f': escch = 'f'; break;
  287. case '\r': escch = 'r'; break;
  288. case '\\': escch = '\\'; break;
  289. case '\"': escch = '\"'; break;
  290. case '\'': escch = '\''; break;
  291. case 0: escch = '0'; break;
  292. }
  293. if(escch) {
  294. *dest++ = '\\';
  295. *dest++ = escch;
  296. escaped++;
  297. }
  298. else {
  299. *dest++ = c;
  300. }
  301. }
  302. else {
  303. dest += scsprintf(dest, destcharsize, escpat, c);
  304. escaped++;
  305. }
  306. }
  307. if(escaped) {
  308. sq_pushstring(v,resstr,dest - resstr);
  309. }
  310. else {
  311. sq_push(v,2); //nothing escaped
  312. }
  313. return 1;
  314. }
  315. static SQInteger _string_startswith(HSQUIRRELVM v)
  316. {
  317. const SQChar *str,*cmp;
  318. sq_getstring(v,2,&str);
  319. sq_getstring(v,3,&cmp);
  320. SQInteger len = sq_getsize(v,2);
  321. SQInteger cmplen = sq_getsize(v,3);
  322. SQBool ret = SQFalse;
  323. if(cmplen <= len) {
  324. ret = memcmp(str,cmp,sq_rsl(cmplen)) == 0 ? SQTrue : SQFalse;
  325. }
  326. sq_pushbool(v,ret);
  327. return 1;
  328. }
  329. static SQInteger _string_endswith(HSQUIRRELVM v)
  330. {
  331. const SQChar *str,*cmp;
  332. sq_getstring(v,2,&str);
  333. sq_getstring(v,3,&cmp);
  334. SQInteger len = sq_getsize(v,2);
  335. SQInteger cmplen = sq_getsize(v,3);
  336. SQBool ret = SQFalse;
  337. if(cmplen <= len) {
  338. ret = memcmp(&str[len - cmplen],cmp,sq_rsl(cmplen)) == 0 ? SQTrue : SQFalse;
  339. }
  340. sq_pushbool(v,ret);
  341. return 1;
  342. }
  343. #define SETUP_REX(v) \
  344. SQRex *self = NULL; \
  345. sq_getinstanceup(v,1,(SQUserPointer *)&self,0);
  346. static SQInteger _rexobj_releasehook(SQUserPointer p, SQInteger SQ_UNUSED_ARG(size))
  347. {
  348. SQRex *self = ((SQRex *)p);
  349. sqstd_rex_free(self);
  350. return 1;
  351. }
  352. static SQInteger _regexp_match(HSQUIRRELVM v)
  353. {
  354. SETUP_REX(v);
  355. const SQChar *str;
  356. sq_getstring(v,2,&str);
  357. if(sqstd_rex_match(self,str) == SQTrue)
  358. {
  359. sq_pushbool(v,SQTrue);
  360. return 1;
  361. }
  362. sq_pushbool(v,SQFalse);
  363. return 1;
  364. }
  365. static void _addrexmatch(HSQUIRRELVM v,const SQChar *str,const SQChar *begin,const SQChar *end)
  366. {
  367. sq_newtable(v);
  368. sq_pushstring(v,_SC("begin"),-1);
  369. sq_pushinteger(v,begin - str);
  370. sq_rawset(v,-3);
  371. sq_pushstring(v,_SC("end"),-1);
  372. sq_pushinteger(v,end - str);
  373. sq_rawset(v,-3);
  374. }
  375. static SQInteger _regexp_search(HSQUIRRELVM v)
  376. {
  377. SETUP_REX(v);
  378. const SQChar *str,*begin,*end;
  379. SQInteger start = 0;
  380. sq_getstring(v,2,&str);
  381. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  382. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  383. _addrexmatch(v,str,begin,end);
  384. return 1;
  385. }
  386. return 0;
  387. }
  388. static SQInteger _regexp_capture(HSQUIRRELVM v)
  389. {
  390. SETUP_REX(v);
  391. const SQChar *str,*begin,*end;
  392. SQInteger start = 0;
  393. sq_getstring(v,2,&str);
  394. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  395. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  396. SQInteger n = sqstd_rex_getsubexpcount(self);
  397. SQRexMatch match;
  398. sq_newarray(v,0);
  399. for(SQInteger i = 0;i < n; i++) {
  400. sqstd_rex_getsubexp(self,i,&match);
  401. if(match.len > 0)
  402. _addrexmatch(v,str,match.begin,match.begin+match.len);
  403. else
  404. _addrexmatch(v,str,str,str); //empty match
  405. sq_arrayappend(v,-2);
  406. }
  407. return 1;
  408. }
  409. return 0;
  410. }
  411. static SQInteger _regexp_subexpcount(HSQUIRRELVM v)
  412. {
  413. SETUP_REX(v);
  414. sq_pushinteger(v,sqstd_rex_getsubexpcount(self));
  415. return 1;
  416. }
  417. static SQInteger _regexp_constructor(HSQUIRRELVM v)
  418. {
  419. const SQChar *error,*pattern;
  420. sq_getstring(v,2,&pattern);
  421. SQRex *rex = sqstd_rex_compile(pattern,&error);
  422. if(!rex) return sq_throwerror(v,error);
  423. sq_setinstanceup(v,1,rex);
  424. sq_setreleasehook(v,1,_rexobj_releasehook);
  425. return 0;
  426. }
  427. static SQInteger _regexp__typeof(HSQUIRRELVM v)
  428. {
  429. sq_pushstring(v,_SC("regexp"),-1);
  430. return 1;
  431. }
  432. #define _DECL_REX_FUNC(name,nparams,pmask) {_SC(#name),_regexp_##name,nparams,pmask}
  433. static const SQRegFunction rexobj_funcs[]={
  434. _DECL_REX_FUNC(constructor,2,_SC(".s")),
  435. _DECL_REX_FUNC(search,-2,_SC("xsn")),
  436. _DECL_REX_FUNC(match,2,_SC("xs")),
  437. _DECL_REX_FUNC(capture,-2,_SC("xsn")),
  438. _DECL_REX_FUNC(subexpcount,1,_SC("x")),
  439. _DECL_REX_FUNC(_typeof,1,_SC("x")),
  440. {NULL,(SQFUNCTION)0,0,NULL}
  441. };
  442. #undef _DECL_REX_FUNC
  443. #define _DECL_FUNC(name,nparams,pmask) {_SC(#name),_string_##name,nparams,pmask}
  444. static const SQRegFunction stringlib_funcs[]={
  445. _DECL_FUNC(format,-2,_SC(".s")),
  446. _DECL_FUNC(printf,-2,_SC(".s")),
  447. _DECL_FUNC(strip,2,_SC(".s")),
  448. _DECL_FUNC(lstrip,2,_SC(".s")),
  449. _DECL_FUNC(rstrip,2,_SC(".s")),
  450. _DECL_FUNC(split,3,_SC(".ss")),
  451. _DECL_FUNC(escape,2,_SC(".s")),
  452. _DECL_FUNC(startswith,3,_SC(".ss")),
  453. _DECL_FUNC(endswith,3,_SC(".ss")),
  454. {NULL,(SQFUNCTION)0,0,NULL}
  455. };
  456. #undef _DECL_FUNC
  457. SQInteger sqstd_register_stringlib(HSQUIRRELVM v)
  458. {
  459. sq_pushstring(v,_SC("regexp"),-1);
  460. sq_newclass(v,SQFalse);
  461. SQInteger i = 0;
  462. while(rexobj_funcs[i].name != 0) {
  463. const SQRegFunction &f = rexobj_funcs[i];
  464. sq_pushstring(v,f.name,-1);
  465. sq_newclosure(v,f.f,0);
  466. sq_setparamscheck(v,f.nparamscheck,f.typemask);
  467. sq_setnativeclosurename(v,-1,f.name);
  468. sq_newslot(v,-3,SQFalse);
  469. i++;
  470. }
  471. sq_newslot(v,-3,SQFalse);
  472. i = 0;
  473. while(stringlib_funcs[i].name!=0)
  474. {
  475. sq_pushstring(v,stringlib_funcs[i].name,-1);
  476. sq_newclosure(v,stringlib_funcs[i].f,0);
  477. sq_setparamscheck(v,stringlib_funcs[i].nparamscheck,stringlib_funcs[i].typemask);
  478. sq_setnativeclosurename(v,-1,stringlib_funcs[i].name);
  479. sq_newslot(v,-3,SQFalse);
  480. i++;
  481. }
  482. return 1;
  483. }