sqstdstring.cpp 16 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590
  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. #ifdef SQUNICODE
  10. #define scstrchr wcschr
  11. #define scsnprintf wsnprintf
  12. #define scatoi _wtoi
  13. #define scstrtok wcstok
  14. #else
  15. #define scstrchr strchr
  16. #define scsnprintf snprintf
  17. #define scatoi atoi
  18. #define scstrtok strtok
  19. #endif
  20. #define MAX_FORMAT_LEN 20
  21. #define MAX_WFORMAT_LEN 3
  22. #define ADDITIONAL_FORMAT_SPACE (100*sizeof(SQChar))
  23. static SQInteger validate_format(HSQUIRRELVM v, SQChar *fmt, const SQChar *src, SQInteger n,SQInteger &width)
  24. {
  25. SQChar swidth[MAX_WFORMAT_LEN];
  26. SQInteger wc = 0;
  27. SQInteger start = n;
  28. fmt[0] = '%';
  29. while (scstrchr(_SC("-+ #0"), src[n])) n++;
  30. while (scisdigit(src[n])) {
  31. swidth[wc] = src[n];
  32. n++;
  33. wc++;
  34. if(wc>=MAX_WFORMAT_LEN)
  35. return sq_throwerror(v,_SC("width format too long"));
  36. }
  37. swidth[wc] = '\0';
  38. if(wc > 0) {
  39. width = scatoi(swidth);
  40. }
  41. else
  42. width = 0;
  43. if (src[n] == '.') {
  44. n++;
  45. wc = 0;
  46. while (scisdigit(src[n])) {
  47. swidth[wc] = src[n];
  48. n++;
  49. wc++;
  50. if(wc>=MAX_WFORMAT_LEN)
  51. return sq_throwerror(v,_SC("precision format too long"));
  52. }
  53. swidth[wc] = '\0';
  54. if(wc > 0) {
  55. width += scatoi(swidth);
  56. }
  57. }
  58. if (n-start > MAX_FORMAT_LEN )
  59. return sq_throwerror(v,_SC("format too long"));
  60. memcpy(&fmt[1],&src[start],((n-start)+1)*sizeof(SQChar));
  61. fmt[(n-start)+2] = '\0';
  62. return n;
  63. }
  64. /* macro to `unsign' a character */
  65. #define uchar(c) ((unsigned SQChar)(c))
  66. SQRESULT sqstd_format(HSQUIRRELVM v,SQInteger nformatstringidx,SQInteger *outlen,SQChar **output)
  67. {
  68. const SQChar *format;
  69. SQChar *dest;
  70. SQChar fmt[MAX_FORMAT_LEN];
  71. sq_getstring(v,nformatstringidx,&format);
  72. SQInteger allocated = (sq_getsize(v,nformatstringidx)+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. if(format[n] != '%') {
  77. assert(i < allocated);
  78. dest[i++] = format[n];
  79. n++;
  80. }
  81. else if(format[n+1] == '%') { //handles %%
  82. dest[i++] = '%';
  83. n += 2;
  84. }
  85. else {
  86. n++;
  87. if( nparam > sq_gettop(v) )
  88. return sq_throwerror(v,_SC("not enough paramters for the given format string"));
  89. n = validate_format(v,fmt,format,n,w);
  90. if(n < 0) return -1;
  91. SQInteger addlen = 0;
  92. SQInteger valtype = 0;
  93. const SQChar *ts;
  94. SQInteger ti;
  95. SQFloat tf;
  96. SQInteger fc = format[n];
  97. switch(fc) {
  98. case 'q':
  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. if(fc == 'q'){
  103. addlen = 2; //quotes before and after
  104. SQInteger size = sq_getsize(v,nparam);
  105. SQChar *ts2 = (SQChar*)ts;
  106. while (size--) {
  107. ++addlen;
  108. if (*ts2 == '"' || *ts2 == '\\') {
  109. ++addlen;
  110. }
  111. else if (*ts2 == '\0' || iscntrl(uchar(*ts2))) {
  112. SQChar buff[10];
  113. addlen += scsprintf(buff, "\\x%x", (int)uchar(*ts2))-1; //-1 because we already added the original char to the sum
  114. }
  115. ts2++;
  116. }
  117. ts2 = (SQChar*)i; //save the i position using pointer as integer
  118. i += addlen;
  119. allocated += addlen;
  120. dest = sq_getscratchpad(v,allocated);
  121. size = sq_getsize(v,nparam);
  122. ts2 = &dest[(int)ts2]; //use saved i position saved on pointer as integer
  123. *ts2++ = '"';
  124. while (size--) {
  125. if (*ts == '"' || *ts == '\\') {
  126. *ts2++ = '\\';
  127. *ts2++ = *ts;
  128. }
  129. else if (*ts == '\0' || iscntrl(uchar(*ts))) {
  130. SQChar buff[10];
  131. int iw;
  132. iw = scsprintf(buff, "\\x%x", (int)uchar(*ts));
  133. for(int i=0; i< iw; ++i) *ts2++ = buff[i];
  134. }
  135. else
  136. *ts2++ = *ts;
  137. ts++;
  138. }
  139. *ts2++ = '"';
  140. n++;
  141. nparam ++;
  142. continue;
  143. }
  144. else
  145. {
  146. addlen = (sq_getsize(v,nparam)*sizeof(SQChar))+((w+1)*sizeof(SQChar));
  147. valtype = 's';
  148. }
  149. break;
  150. case 'i': case 'd': case 'o': case 'u': case 'x': case 'X':
  151. #ifdef _SQ64
  152. {
  153. size_t flen = scstrlen(fmt);
  154. SQInteger fpos = flen - 1;
  155. SQChar f = fmt[fpos];
  156. SQChar *prec = (SQChar *)_PRINT_INT_PREC;
  157. while(*prec != _SC('\0')) {
  158. fmt[fpos++] = *prec++;
  159. }
  160. fmt[fpos++] = f;
  161. fmt[fpos++] = _SC('\0');
  162. }
  163. #endif
  164. case 'c':
  165. if(SQ_FAILED(sq_getinteger(v,nparam,&ti)))
  166. return sq_throwerror(v,_SC("integer expected for the specified format"));
  167. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  168. valtype = 'i';
  169. break;
  170. case 'f': case 'g': case 'G': case 'e': case 'E':
  171. if(SQ_FAILED(sq_getfloat(v,nparam,&tf)))
  172. return sq_throwerror(v,_SC("float expected for the specified format"));
  173. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  174. valtype = 'f';
  175. break;
  176. default:
  177. return sq_throwerror(v,_SC("invalid format"));
  178. }
  179. n++;
  180. allocated += addlen + sizeof(SQChar);
  181. dest = sq_getscratchpad(v,allocated);
  182. switch(valtype) {
  183. case 's': i += scsprintf(&dest[i],fmt,ts); break;
  184. case 'i': i += scsprintf(&dest[i],fmt,ti); break;
  185. case 'f': i += scsprintf(&dest[i],fmt,tf); break;
  186. };
  187. nparam ++;
  188. }
  189. }
  190. *outlen = i;
  191. dest[i] = '\0';
  192. *output = dest;
  193. return SQ_OK;
  194. }
  195. static SQInteger _string_format(HSQUIRRELVM v)
  196. {
  197. SQChar *dest = NULL;
  198. SQInteger length = 0;
  199. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  200. return -1;
  201. sq_pushstring(v,dest,length);
  202. return 1;
  203. }
  204. static SQInteger _string_printf(HSQUIRRELVM v)
  205. {
  206. SQChar *dest = NULL;
  207. SQInteger length = 0;
  208. SQPRINTFUNCTION sqprint = sq_getprintfunc(v);
  209. if(sqprint){
  210. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  211. return -1;
  212. sqprint(v,_SC("%s"),dest);
  213. sq_pushinteger(v, length);
  214. return 1;
  215. }
  216. return 0;
  217. }
  218. static void __strip_l(const SQChar *str,const SQChar **start)
  219. {
  220. const SQChar *t = str;
  221. while(((*t) != '\0') && scisspace(*t)){ t++; }
  222. *start = t;
  223. }
  224. static void __strip_r(const SQChar *str,SQInteger len,const SQChar **end)
  225. {
  226. if(len == 0) {
  227. *end = str;
  228. return;
  229. }
  230. const SQChar *t = &str[len-1];
  231. while(t >= str && scisspace(*t)) { t--; }
  232. *end = t + 1;
  233. }
  234. static SQInteger _string_strip(HSQUIRRELVM v)
  235. {
  236. const SQChar *str,*start,*end;
  237. sq_getstring(v,2,&str);
  238. SQInteger len = sq_getsize(v,2);
  239. __strip_l(str,&start);
  240. __strip_r(str,len,&end);
  241. sq_pushstring(v,start,end - start);
  242. return 1;
  243. }
  244. static SQInteger _string_lstrip(HSQUIRRELVM v)
  245. {
  246. const SQChar *str,*start;
  247. sq_getstring(v,2,&str);
  248. __strip_l(str,&start);
  249. sq_pushstring(v,start,-1);
  250. return 1;
  251. }
  252. static SQInteger _string_rstrip(HSQUIRRELVM v)
  253. {
  254. const SQChar *str,*end;
  255. sq_getstring(v,2,&str);
  256. SQInteger len = sq_getsize(v,2);
  257. __strip_r(str,len,&end);
  258. sq_pushstring(v,str,end - str);
  259. return 1;
  260. }
  261. static SQInteger _string_split(HSQUIRRELVM v)
  262. {
  263. const SQChar *str,*seps;
  264. SQChar *stemp,*tok;
  265. sq_getstring(v,2,&str);
  266. sq_getstring(v,3,&seps);
  267. if(sq_getsize(v,3) == 0) return sq_throwerror(v,_SC("empty separators string"));
  268. SQInteger memsize = (sq_getsize(v,2)+1)*sizeof(SQChar);
  269. stemp = sq_getscratchpad(v,memsize);
  270. memcpy(stemp,str,memsize);
  271. tok = scstrtok(stemp,seps);
  272. sq_newarray(v,0);
  273. while( tok != NULL ) {
  274. sq_pushstring(v,tok,-1);
  275. sq_arrayappend(v,-2);
  276. tok = scstrtok( NULL, seps );
  277. }
  278. return 1;
  279. }
  280. #define SETUP_REX(v) \
  281. SQRex *self = NULL; \
  282. sq_getinstanceup(v,1,(SQUserPointer *)&self,0);
  283. static SQInteger _rexobj_releasehook(SQUserPointer p, SQInteger size, HSQUIRRELVM v)
  284. {
  285. SQRex *self = ((SQRex *)p);
  286. sqstd_rex_free(self);
  287. return 1;
  288. }
  289. static SQInteger _regexp_match(HSQUIRRELVM v)
  290. {
  291. SETUP_REX(v);
  292. const SQChar *str;
  293. sq_getstring(v,2,&str);
  294. if(sqstd_rex_match(self,str) == SQTrue)
  295. {
  296. sq_pushbool(v,SQTrue);
  297. return 1;
  298. }
  299. sq_pushbool(v,SQFalse);
  300. return 1;
  301. }
  302. static SQInteger _regexp_gmatch(HSQUIRRELVM v)
  303. {
  304. SETUP_REX(v);
  305. const SQChar *str;
  306. SQInteger str_size;
  307. sq_getstring(v,2,&str);
  308. str_size = sq_getsize(v, 2);
  309. const SQChar *begin,*end;
  310. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  311. SQInteger n = sqstd_rex_getsubexpcount(self);
  312. SQRexMatch match;
  313. sq_pushroottable(v); //this
  314. SQInteger i = 0;
  315. for(;i < n; i++) {
  316. sqstd_rex_getsubexp(self,i,&match);
  317. if(i > 0){ //skip whole match
  318. sq_pushstring(v, match.begin, match.len);
  319. }
  320. }
  321. i = sq_call(v, n, SQFalse, SQTrue);
  322. if(i < 0) return i;
  323. str_size -= end-str;
  324. str = end;
  325. }
  326. sq_pushbool(v,SQFalse);
  327. return 1;
  328. }
  329. #include "sqstdblobimpl.h"
  330. static SQInteger _regexp_gsub(HSQUIRRELVM v)
  331. {
  332. SETUP_REX(v);
  333. const SQChar *str;
  334. SQInteger str_size;
  335. sq_getstring(v,2,&str);
  336. str_size = sq_getsize(v, 2);
  337. const SQChar *begin,*end;
  338. SQBlob blob(0,8192);
  339. SQObjectType ptype = sq_gettype(v, 3);
  340. const SQChar *replacement;
  341. SQInteger replacement_size;
  342. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  343. blob.Write(str, begin-str);
  344. SQInteger n = sqstd_rex_getsubexpcount(self);
  345. SQRexMatch match;
  346. SQInteger i = 0;
  347. switch(ptype){
  348. case OT_CLOSURE:{
  349. sq_pushroottable(v); //this
  350. for(;i < n; i++) {
  351. sqstd_rex_getsubexp(self,i,&match);
  352. if(i > 0){ //skip whole match
  353. sq_pushstring(v, match.begin, match.len);
  354. }
  355. }
  356. i = sq_call(v, n, SQTrue, SQTrue);
  357. if(i < 0) return i;
  358. if(sq_gettype(v, -1) == OT_STRING){
  359. const SQChar *svalue;
  360. sq_getstring(v, -1, &svalue);
  361. blob.Write(svalue, sq_getsize(v, -1));
  362. }
  363. sq_poptop(v);
  364. }
  365. break;
  366. case OT_ARRAY:{
  367. for(;i < n; i++) {
  368. sqstd_rex_getsubexp(self,i,&match);
  369. if(i > 0){ //skip whole match
  370. sq_pushinteger(v, i-1);
  371. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  372. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  373. blob.Write(replacement, replacement_size);
  374. sq_pop(v, 1); //remove value
  375. }
  376. }
  377. }
  378. }
  379. break;
  380. case OT_TABLE:{
  381. for(;i < n; i++) {
  382. sqstd_rex_getsubexp(self,i,&match);
  383. if(i > 0){ //skip whole match
  384. sq_pushstring(v, match.begin, match.len);
  385. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  386. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  387. blob.Write(replacement, replacement_size);
  388. sq_pop(v, 1); //remove value
  389. }
  390. }
  391. }
  392. }
  393. break;
  394. default:
  395. return sq_throwerror(v, _SC("gsub only works with closure, array, table for replacement"));
  396. }
  397. str_size -= end-str;
  398. str = end;
  399. }
  400. if(str_size) blob.Write(str, str_size);
  401. sq_pushstring(v, (const SQChar *)blob.GetBuf(), blob.Len());
  402. return 1;
  403. }
  404. static void _addrexmatch(HSQUIRRELVM v,const SQChar *str,const SQChar *begin,const SQChar *end)
  405. {
  406. sq_newtable(v);
  407. sq_pushstring(v,_SC("begin"),-1);
  408. sq_pushinteger(v,begin - str);
  409. sq_rawset(v,-3);
  410. sq_pushstring(v,_SC("end"),-1);
  411. sq_pushinteger(v,end - str);
  412. sq_rawset(v,-3);
  413. }
  414. static SQInteger _regexp_search(HSQUIRRELVM v)
  415. {
  416. SETUP_REX(v);
  417. const SQChar *str,*begin,*end;
  418. SQInteger start = 0;
  419. sq_getstring(v,2,&str);
  420. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  421. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  422. _addrexmatch(v,str,begin,end);
  423. return 1;
  424. }
  425. return 0;
  426. }
  427. static SQInteger _regexp_capture(HSQUIRRELVM v)
  428. {
  429. SETUP_REX(v);
  430. const SQChar *str,*begin,*end;
  431. SQInteger start = 0;
  432. sq_getstring(v,2,&str);
  433. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  434. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  435. SQInteger n = sqstd_rex_getsubexpcount(self);
  436. SQRexMatch match;
  437. sq_newarray(v,0);
  438. for(SQInteger i = 0;i < n; i++) {
  439. sqstd_rex_getsubexp(self,i,&match);
  440. if(match.len > 0)
  441. _addrexmatch(v,str,match.begin,match.begin+match.len);
  442. else
  443. _addrexmatch(v,str,str,str); //empty match
  444. sq_arrayappend(v,-2);
  445. }
  446. return 1;
  447. }
  448. return 0;
  449. }
  450. static SQInteger _regexp_xcapture(HSQUIRRELVM v)
  451. {
  452. SETUP_REX(v);
  453. const SQChar *str,*begin,*end;
  454. SQInteger start = 0;
  455. sq_getstring(v,2,&str);
  456. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  457. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  458. sq_pushbool(v, SQTrue);
  459. return 1;
  460. }
  461. return 0;
  462. }
  463. static SQInteger _regexp_getxcapture(HSQUIRRELVM v)
  464. {
  465. SETUP_REX(v);
  466. SQInteger n, start;
  467. const SQChar *str;
  468. sq_getstring(v,2,&str);
  469. sq_getinteger(v,3,&n);
  470. SQRexMatch match;
  471. sqstd_rex_getsubexp(self,n,&match);
  472. if(match.len > 0){
  473. start = match.begin-str;
  474. sq_pushinteger(v, start);
  475. sq_arrayappend(v,-2);
  476. sq_pushinteger(v, start+match.len);
  477. sq_arrayappend(v,-2);
  478. sq_pushbool(v, SQTrue);
  479. return 1;
  480. }
  481. return 0;
  482. }
  483. static SQInteger _regexp_subexpcount(HSQUIRRELVM v)
  484. {
  485. SETUP_REX(v);
  486. sq_pushinteger(v,sqstd_rex_getsubexpcount(self));
  487. return 1;
  488. }
  489. static SQInteger _regexp_constructor(HSQUIRRELVM v)
  490. {
  491. const SQChar *error,*pattern;
  492. sq_getstring(v,2,&pattern);
  493. SQRex *rex = sqstd_rex_compile(pattern,&error);
  494. if(!rex) return sq_throwerror(v,error);
  495. sq_setinstanceup(v,1,rex);
  496. sq_setreleasehook(v,1,_rexobj_releasehook);
  497. return 0;
  498. }
  499. static SQInteger _regexp__typeof(HSQUIRRELVM v)
  500. {
  501. sq_pushstring(v,_SC("regexp"),-1);
  502. return 1;
  503. }
  504. #define _DECL_REX_FUNC(name,nparams,pmask) {_SC(#name),_regexp_##name,nparams,pmask}
  505. static SQRegFunction rexobj_funcs[]={
  506. _DECL_REX_FUNC(constructor,2,_SC(".s")),
  507. _DECL_REX_FUNC(search,-2,_SC("xsn")),
  508. _DECL_REX_FUNC(match,2,_SC("xs")),
  509. _DECL_REX_FUNC(gmatch,3,_SC("xsc")),
  510. _DECL_REX_FUNC(gsub,3,_SC("xs c|a|t")),
  511. _DECL_REX_FUNC(capture,-2,_SC("xsn")),
  512. _DECL_REX_FUNC(xcapture,-2,_SC("xsn")),
  513. _DECL_REX_FUNC(getxcapture,4,_SC("xsna")),
  514. _DECL_REX_FUNC(subexpcount,1,_SC("x")),
  515. _DECL_REX_FUNC(_typeof,1,_SC("x")),
  516. {0,0}
  517. };
  518. #undef _DECL_REX_FUNC
  519. #define _DECL_FUNC(name,nparams,pmask) {_SC(#name),_string_##name,nparams,pmask}
  520. static SQRegFunction stringlib_funcs[]={
  521. _DECL_FUNC(printf,-2,_SC(".s")),
  522. _DECL_FUNC(format,-2,_SC(".s")),
  523. _DECL_FUNC(strip,2,_SC(".s")),
  524. _DECL_FUNC(lstrip,2,_SC(".s")),
  525. _DECL_FUNC(rstrip,2,_SC(".s")),
  526. _DECL_FUNC(split,3,_SC(".ss")),
  527. {0,0}
  528. };
  529. #undef _DECL_FUNC
  530. SQInteger sqstd_register_stringlib(HSQUIRRELVM v)
  531. {
  532. sq_pushstring(v,_SC("regexp"),-1);
  533. sq_newclass(v,SQFalse);
  534. SQInteger i = 0;
  535. while(rexobj_funcs[i].name != 0) {
  536. SQRegFunction &f = rexobj_funcs[i];
  537. sq_pushstring(v,f.name,-1);
  538. sq_newclosure(v,f.f,0);
  539. sq_setparamscheck(v,f.nparamscheck,f.typemask);
  540. sq_setnativeclosurename(v,-1,f.name);
  541. sq_newslot(v,-3,SQFalse);
  542. i++;
  543. }
  544. sq_newslot(v,-3,SQFalse);
  545. i = 0;
  546. while(stringlib_funcs[i].name!=0)
  547. {
  548. sq_pushstring(v,stringlib_funcs[i].name,-1);
  549. sq_newclosure(v,stringlib_funcs[i].f,0);
  550. sq_setparamscheck(v,stringlib_funcs[i].nparamscheck,stringlib_funcs[i].typemask);
  551. sq_setnativeclosurename(v,-1,stringlib_funcs[i].name);
  552. sq_newslot(v,-3,SQFalse);
  553. i++;
  554. }
  555. return 1;
  556. }