sqstdstring.cpp 15 KB

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