sqstdstring.cpp 17 KB

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