sqstdstring.cpp 15 KB

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