sqstdstring.cpp 15 KB

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