sqstdstring.cpp 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526
  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. SQRESULT sqstd_format(HSQUIRRELVM v,SQInteger nformatstringidx,SQInteger *outlen,SQChar **output)
  65. {
  66. const SQChar *format;
  67. SQChar *dest;
  68. SQChar fmt[MAX_FORMAT_LEN];
  69. sq_getstring(v,nformatstringidx,&format);
  70. SQInteger allocated = (sq_getsize(v,nformatstringidx)+2)*sizeof(SQChar);
  71. dest = sq_getscratchpad(v,allocated);
  72. SQInteger n = 0,i = 0, nparam = nformatstringidx+1, w = 0;
  73. while(format[n] != '\0') {
  74. if(format[n] != '%') {
  75. assert(i < allocated);
  76. dest[i++] = format[n];
  77. n++;
  78. }
  79. else if(format[n+1] == '%') { //handles %%
  80. dest[i++] = '%';
  81. n += 2;
  82. }
  83. else {
  84. n++;
  85. if( nparam > sq_gettop(v) )
  86. return sq_throwerror(v,_SC("not enough paramters for the given format string"));
  87. n = validate_format(v,fmt,format,n,w);
  88. if(n < 0) return -1;
  89. SQInteger addlen = 0;
  90. SQInteger valtype = 0;
  91. const SQChar *ts;
  92. SQInteger ti;
  93. SQFloat tf;
  94. SQInteger fc = format[n];
  95. switch(fc) {
  96. case 'q':
  97. case 's':
  98. if(SQ_FAILED(sq_getstring(v,nparam,&ts)))
  99. return sq_throwerror(v,_SC("string expected for the specified format"));
  100. if(fc == 'q'){
  101. addlen = 2; //quotes before and after
  102. SQInteger size = sq_getsize(v,nparam);
  103. SQChar *ts2 = (SQChar*)ts;
  104. while (size--) {
  105. ++addlen;
  106. if (*ts2 == '\r' && *(ts2+1) == '\n' ) {
  107. ++addlen;
  108. ++ts2; //eat \r and output only \n
  109. }
  110. else if (*ts2 == '"' || *ts2 == '\\' || *ts2 == '\n') {
  111. ++addlen;
  112. }
  113. else if (*ts2 == '\0' || iscntrl(uchar(*ts2))) {
  114. SQChar buff[10];
  115. addlen += scsprintf(buff, "\\x%x", (int)uchar(*ts2))-1; //-1 because we already added the original char to the sum
  116. }
  117. ++ts2;
  118. }
  119. ts2 = (SQChar*)i; //save the i position using pointer as integer
  120. i += addlen;
  121. allocated += addlen;
  122. dest = sq_getscratchpad(v,allocated);
  123. size = sq_getsize(v,nparam);
  124. ts2 = &dest[(int)ts2]; //use saved i position saved on pointer as integer
  125. *ts2++ = '"';
  126. while (size--) {
  127. if (*ts == '\r' && *(ts+1) == '\n' ) {
  128. ++ts; //eat \r and output only \n
  129. }
  130. if (*ts == '"' || *ts == '\\') {
  131. *ts2++ = '\\';
  132. *ts2++ = *ts;
  133. }
  134. else if (*ts == '\n') {
  135. *ts2++ = '\\';
  136. *ts2++ = 'n';
  137. }
  138. else if (*ts == '\0' || iscntrl(uchar(*ts))) {
  139. SQChar buff[10];
  140. int iw;
  141. iw = scsprintf(buff, "\\x%x", (int)uchar(*ts));
  142. for(int i=0; i< iw; ++i) *ts2++ = buff[i];
  143. }
  144. else
  145. *ts2++ = *ts;
  146. ++ts;
  147. }
  148. *ts2++ = '"';
  149. ++n;
  150. ++nparam;
  151. continue;
  152. }
  153. else
  154. {
  155. addlen = (sq_getsize(v,nparam)*sizeof(SQChar))+((w+1)*sizeof(SQChar));
  156. valtype = 's';
  157. }
  158. break;
  159. case 'i': case 'd': case 'o': case 'u': case 'x': case 'X':
  160. #ifdef _SQ64
  161. {
  162. size_t flen = scstrlen(fmt);
  163. SQInteger fpos = flen - 1;
  164. SQChar f = fmt[fpos];
  165. SQChar *prec = (SQChar *)_PRINT_INT_PREC;
  166. while(*prec != _SC('\0')) {
  167. fmt[fpos++] = *prec++;
  168. }
  169. fmt[fpos++] = f;
  170. fmt[fpos++] = _SC('\0');
  171. }
  172. #endif
  173. case 'c':
  174. if(SQ_FAILED(sq_getinteger(v,nparam,&ti)))
  175. return sq_throwerror(v,_SC("integer expected for the specified format"));
  176. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  177. valtype = 'i';
  178. break;
  179. case 'f': case 'g': case 'G': case 'e': case 'E':
  180. if(SQ_FAILED(sq_getfloat(v,nparam,&tf)))
  181. return sq_throwerror(v,_SC("float expected for the specified format"));
  182. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  183. valtype = 'f';
  184. break;
  185. default:
  186. return sq_throwerror(v,_SC("invalid format"));
  187. }
  188. n++;
  189. allocated += addlen + sizeof(SQChar);
  190. dest = sq_getscratchpad(v,allocated);
  191. switch(valtype) {
  192. case 's': i += scsprintf(&dest[i],fmt,ts); break;
  193. case 'i': i += scsprintf(&dest[i],fmt,ti); break;
  194. case 'f': i += scsprintf(&dest[i],fmt,tf); break;
  195. };
  196. nparam ++;
  197. }
  198. }
  199. *outlen = i;
  200. dest[i] = '\0';
  201. *output = dest;
  202. return SQ_OK;
  203. }
  204. static SQInteger _string_format(HSQUIRRELVM v)
  205. {
  206. SQChar *dest = NULL;
  207. SQInteger length = 0;
  208. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  209. return -1;
  210. sq_pushstring(v,dest,length);
  211. return 1;
  212. }
  213. static SQInteger _string_printf(HSQUIRRELVM v)
  214. {
  215. SQChar *dest = NULL;
  216. SQInteger length = 0;
  217. SQPRINTFUNCTION sqprint = sq_getprintfunc(v);
  218. if(sqprint){
  219. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  220. return -1;
  221. sqprint(v,_SC("%s"),dest);
  222. sq_pushinteger(v, length);
  223. return 1;
  224. }
  225. return 0;
  226. }
  227. #define SETUP_REX(v) \
  228. SQRex *self = NULL; \
  229. sq_getinstanceup(v,1,(SQUserPointer *)&self,0);
  230. static SQInteger _rexobj_releasehook(SQUserPointer p, SQInteger size, HSQUIRRELVM v)
  231. {
  232. SQRex *self = ((SQRex *)p);
  233. sqstd_rex_free(self);
  234. return 1;
  235. }
  236. static SQInteger _regexp_match(HSQUIRRELVM v)
  237. {
  238. SETUP_REX(v);
  239. const SQChar *str;
  240. sq_getstring(v,2,&str);
  241. if(sqstd_rex_match(self,str) == SQTrue)
  242. {
  243. sq_pushbool(v,SQTrue);
  244. return 1;
  245. }
  246. sq_pushbool(v,SQFalse);
  247. return 1;
  248. }
  249. static SQInteger _regexp_gmatch(HSQUIRRELVM v)
  250. {
  251. SETUP_REX(v);
  252. const SQChar *str;
  253. SQInteger str_size;
  254. sq_getstring(v,2,&str);
  255. str_size = sq_getsize(v, 2);
  256. const SQChar *begin,*end;
  257. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  258. SQInteger n = sqstd_rex_getsubexpcount(self);
  259. SQRexMatch match;
  260. sq_pushroottable(v); //this
  261. SQInteger i = 0;
  262. for(;i < n; i++) {
  263. sqstd_rex_getsubexp(self,i,&match);
  264. if(i > 0){ //skip whole match
  265. sq_pushstring(v, match.begin, match.len);
  266. }
  267. }
  268. i = sq_call(v, n, SQFalse, SQTrue);
  269. if(i < 0) return i;
  270. str_size -= end-str;
  271. str = end;
  272. }
  273. sq_pushbool(v,SQFalse);
  274. return 1;
  275. }
  276. #include "sqstdblobimpl.h"
  277. static SQInteger _regexp_gsub(HSQUIRRELVM v)
  278. {
  279. SETUP_REX(v);
  280. const SQChar *str;
  281. SQInteger str_size;
  282. sq_getstring(v,2,&str);
  283. str_size = sq_getsize(v, 2);
  284. const SQChar *begin,*end;
  285. SQBlob blob(0,8192);
  286. SQObjectType ptype = sq_gettype(v, 3);
  287. const SQChar *replacement;
  288. SQInteger replacement_size;
  289. while(sqstd_rex_searchrange(self,str, str+str_size,&begin,&end)){
  290. blob.Write(str, begin-str);
  291. SQInteger n = sqstd_rex_getsubexpcount(self);
  292. SQRexMatch match;
  293. SQInteger i = 0;
  294. switch(ptype){
  295. case OT_CLOSURE:{
  296. sq_pushroottable(v); //this
  297. for(;i < n; i++) {
  298. sqstd_rex_getsubexp(self,i,&match);
  299. if(i > 0){ //skip whole match
  300. sq_pushstring(v, match.begin, match.len);
  301. }
  302. }
  303. i = sq_call(v, n, SQTrue, SQTrue);
  304. if(i < 0) return i;
  305. if(sq_gettype(v, -1) == OT_STRING){
  306. const SQChar *svalue;
  307. sq_getstring(v, -1, &svalue);
  308. blob.Write(svalue, sq_getsize(v, -1));
  309. }
  310. sq_poptop(v);
  311. }
  312. break;
  313. case OT_ARRAY:{
  314. for(;i < n; i++) {
  315. sqstd_rex_getsubexp(self,i,&match);
  316. if(i > 0){ //skip whole match
  317. sq_pushinteger(v, i-1);
  318. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  319. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  320. blob.Write(replacement, replacement_size);
  321. sq_pop(v, 1); //remove value
  322. }
  323. }
  324. }
  325. }
  326. break;
  327. case OT_TABLE:{
  328. for(;i < n; i++) {
  329. sqstd_rex_getsubexp(self,i,&match);
  330. if(i > 0){ //skip whole match
  331. sq_pushstring(v, match.begin, match.len);
  332. if(SQ_SUCCEEDED(sq_get(v, 3)) &&
  333. SQ_SUCCEEDED(sq_getstr_and_size(v, -1, &replacement, &replacement_size))){
  334. blob.Write(replacement, replacement_size);
  335. sq_pop(v, 1); //remove value
  336. }
  337. }
  338. }
  339. }
  340. break;
  341. default:
  342. return sq_throwerror(v, _SC("gsub only works with closure, array, table for replacement"));
  343. }
  344. str_size -= end-str;
  345. str = end;
  346. }
  347. if(str_size) blob.Write(str, str_size);
  348. sq_pushstring(v, (const SQChar *)blob.GetBuf(), blob.Len());
  349. return 1;
  350. }
  351. static void _addrexmatch(HSQUIRRELVM v,const SQChar *str,const SQChar *begin,const SQChar *end)
  352. {
  353. sq_newtable(v);
  354. sq_pushstring(v,_SC("begin"),-1);
  355. sq_pushinteger(v,begin - str);
  356. sq_rawset(v,-3);
  357. sq_pushstring(v,_SC("end"),-1);
  358. sq_pushinteger(v,end - str);
  359. sq_rawset(v,-3);
  360. }
  361. static SQInteger _regexp_search(HSQUIRRELVM v)
  362. {
  363. SETUP_REX(v);
  364. const SQChar *str,*begin,*end;
  365. SQInteger start = 0;
  366. sq_getstring(v,2,&str);
  367. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  368. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  369. _addrexmatch(v,str,begin,end);
  370. return 1;
  371. }
  372. return 0;
  373. }
  374. static SQInteger _regexp_capture(HSQUIRRELVM v)
  375. {
  376. SETUP_REX(v);
  377. const SQChar *str,*begin,*end;
  378. SQInteger start = 0;
  379. sq_getstring(v,2,&str);
  380. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  381. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  382. SQInteger n = sqstd_rex_getsubexpcount(self);
  383. SQRexMatch match;
  384. sq_newarray(v,0);
  385. for(SQInteger i = 0;i < n; i++) {
  386. sqstd_rex_getsubexp(self,i,&match);
  387. if(match.len > 0)
  388. _addrexmatch(v,str,match.begin,match.begin+match.len);
  389. else
  390. _addrexmatch(v,str,str,str); //empty match
  391. sq_arrayappend(v,-2);
  392. }
  393. return 1;
  394. }
  395. return 0;
  396. }
  397. static SQInteger _regexp_xcapture(HSQUIRRELVM v)
  398. {
  399. SETUP_REX(v);
  400. const SQChar *str,*begin,*end;
  401. SQInteger start = 0;
  402. sq_getstring(v,2,&str);
  403. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  404. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  405. sq_pushbool(v, SQTrue);
  406. return 1;
  407. }
  408. return 0;
  409. }
  410. static SQInteger _regexp_getxcapture(HSQUIRRELVM v)
  411. {
  412. SETUP_REX(v);
  413. SQInteger n, start;
  414. const SQChar *str;
  415. sq_getstring(v,2,&str);
  416. sq_getinteger(v,3,&n);
  417. SQRexMatch match;
  418. sqstd_rex_getsubexp(self,n,&match);
  419. if(match.len > 0){
  420. start = match.begin-str;
  421. sq_pushinteger(v, start);
  422. sq_arrayappend(v,-2);
  423. sq_pushinteger(v, start+match.len);
  424. sq_arrayappend(v,-2);
  425. sq_pushbool(v, SQTrue);
  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 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(gmatch,3,_SC("xsc")),
  457. _DECL_REX_FUNC(gsub,3,_SC("xs c|a|t")),
  458. _DECL_REX_FUNC(capture,-2,_SC("xsn")),
  459. _DECL_REX_FUNC(xcapture,-2,_SC("xsn")),
  460. _DECL_REX_FUNC(getxcapture,4,_SC("xsna")),
  461. _DECL_REX_FUNC(subexpcount,1,_SC("x")),
  462. _DECL_REX_FUNC(_typeof,1,_SC("x")),
  463. {0,0}
  464. };
  465. #undef _DECL_REX_FUNC
  466. #define _DECL_FUNC(name,nparams,pmask) {_SC(#name),_string_##name,nparams,pmask}
  467. static SQRegFunction stringlib_funcs[]={
  468. _DECL_FUNC(printf,-2,_SC(".s")),
  469. _DECL_FUNC(format,-2,_SC(".s")),
  470. {0,0}
  471. };
  472. #undef _DECL_FUNC
  473. SQInteger sqstd_register_stringlib(HSQUIRRELVM v)
  474. {
  475. sq_pushstring(v,_SC("regexp"),-1);
  476. sq_newclass(v,SQFalse);
  477. SQInteger i = 0;
  478. while(rexobj_funcs[i].name != 0) {
  479. SQRegFunction &f = rexobj_funcs[i];
  480. sq_pushstring(v,f.name,-1);
  481. sq_newclosure(v,f.f,0);
  482. sq_setparamscheck(v,f.nparamscheck,f.typemask);
  483. sq_setnativeclosurename(v,-1,f.name);
  484. sq_newslot(v,-3,SQFalse);
  485. i++;
  486. }
  487. sq_newslot(v,-3,SQFalse);
  488. i = 0;
  489. while(stringlib_funcs[i].name!=0)
  490. {
  491. sq_pushstring(v,stringlib_funcs[i].name,-1);
  492. sq_newclosure(v,stringlib_funcs[i].f,0);
  493. sq_setparamscheck(v,stringlib_funcs[i].nparamscheck,stringlib_funcs[i].typemask);
  494. sq_setnativeclosurename(v,-1,stringlib_funcs[i].name);
  495. sq_newslot(v,-3,SQFalse);
  496. i++;
  497. }
  498. return 1;
  499. }