sqstdstring.cpp 9.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378
  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. switch(format[n]) {
  95. case 's':
  96. if(SQ_FAILED(sq_getstring(v,nparam,&ts)))
  97. return sq_throwerror(v,_SC("string expected for the specified format"));
  98. addlen = (sq_getsize(v,nparam)*sizeof(SQChar))+((w+1)*sizeof(SQChar));
  99. valtype = 's';
  100. break;
  101. case 'i': case 'd': case 'o': case 'u': case 'x': case 'X':
  102. #ifdef _SQ64
  103. {
  104. size_t flen = scstrlen(fmt);
  105. SQInteger fpos = flen - 1;
  106. SQChar f = fmt[fpos];
  107. SQChar *prec = (SQChar *)_PRINT_INT_PREC;
  108. while(*prec != _SC('\0')) {
  109. fmt[fpos++] = *prec++;
  110. }
  111. fmt[fpos++] = f;
  112. fmt[fpos++] = _SC('\0');
  113. }
  114. #endif
  115. case 'c':
  116. if(SQ_FAILED(sq_getinteger(v,nparam,&ti)))
  117. return sq_throwerror(v,_SC("integer expected for the specified format"));
  118. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  119. valtype = 'i';
  120. break;
  121. case 'f': case 'g': case 'G': case 'e': case 'E':
  122. if(SQ_FAILED(sq_getfloat(v,nparam,&tf)))
  123. return sq_throwerror(v,_SC("float expected for the specified format"));
  124. addlen = (ADDITIONAL_FORMAT_SPACE)+((w+1)*sizeof(SQChar));
  125. valtype = 'f';
  126. break;
  127. default:
  128. return sq_throwerror(v,_SC("invalid format"));
  129. }
  130. n++;
  131. allocated += addlen + sizeof(SQChar);
  132. dest = sq_getscratchpad(v,allocated);
  133. switch(valtype) {
  134. case 's': i += scsprintf(&dest[i],fmt,ts); break;
  135. case 'i': i += scsprintf(&dest[i],fmt,ti); break;
  136. case 'f': i += scsprintf(&dest[i],fmt,tf); break;
  137. };
  138. nparam ++;
  139. }
  140. }
  141. *outlen = i;
  142. dest[i] = '\0';
  143. *output = dest;
  144. return SQ_OK;
  145. }
  146. static SQInteger _string_format(HSQUIRRELVM v)
  147. {
  148. SQChar *dest = NULL;
  149. SQInteger length = 0;
  150. if(SQ_FAILED(sqstd_format(v,2,&length,&dest)))
  151. return -1;
  152. sq_pushstring(v,dest,length);
  153. return 1;
  154. }
  155. static void __strip_l(const SQChar *str,const SQChar **start)
  156. {
  157. const SQChar *t = str;
  158. while(((*t) != '\0') && scisspace(*t)){ t++; }
  159. *start = t;
  160. }
  161. static void __strip_r(const SQChar *str,SQInteger len,const SQChar **end)
  162. {
  163. if(len == 0) {
  164. *end = str;
  165. return;
  166. }
  167. const SQChar *t = &str[len-1];
  168. while(t >= str && scisspace(*t)) { t--; }
  169. *end = t + 1;
  170. }
  171. static SQInteger _string_strip(HSQUIRRELVM v)
  172. {
  173. const SQChar *str,*start,*end;
  174. sq_getstring(v,2,&str);
  175. SQInteger len = sq_getsize(v,2);
  176. __strip_l(str,&start);
  177. __strip_r(str,len,&end);
  178. sq_pushstring(v,start,end - start);
  179. return 1;
  180. }
  181. static SQInteger _string_lstrip(HSQUIRRELVM v)
  182. {
  183. const SQChar *str,*start;
  184. sq_getstring(v,2,&str);
  185. __strip_l(str,&start);
  186. sq_pushstring(v,start,-1);
  187. return 1;
  188. }
  189. static SQInteger _string_rstrip(HSQUIRRELVM v)
  190. {
  191. const SQChar *str,*end;
  192. sq_getstring(v,2,&str);
  193. SQInteger len = sq_getsize(v,2);
  194. __strip_r(str,len,&end);
  195. sq_pushstring(v,str,end - str);
  196. return 1;
  197. }
  198. static SQInteger _string_split(HSQUIRRELVM v)
  199. {
  200. const SQChar *str,*seps;
  201. SQChar *stemp,*tok;
  202. sq_getstring(v,2,&str);
  203. sq_getstring(v,3,&seps);
  204. if(sq_getsize(v,3) == 0) return sq_throwerror(v,_SC("empty separators string"));
  205. SQInteger memsize = (sq_getsize(v,2)+1)*sizeof(SQChar);
  206. stemp = sq_getscratchpad(v,memsize);
  207. memcpy(stemp,str,memsize);
  208. tok = scstrtok(stemp,seps);
  209. sq_newarray(v,0);
  210. while( tok != NULL ) {
  211. sq_pushstring(v,tok,-1);
  212. sq_arrayappend(v,-2);
  213. tok = scstrtok( NULL, seps );
  214. }
  215. return 1;
  216. }
  217. #define SETUP_REX(v) \
  218. SQRex *self = NULL; \
  219. sq_getinstanceup(v,1,(SQUserPointer *)&self,0);
  220. static SQInteger _rexobj_releasehook(SQUserPointer p, SQInteger size)
  221. {
  222. SQRex *self = ((SQRex *)p);
  223. sqstd_rex_free(self);
  224. return 1;
  225. }
  226. static SQInteger _regexp_match(HSQUIRRELVM v)
  227. {
  228. SETUP_REX(v);
  229. const SQChar *str;
  230. sq_getstring(v,2,&str);
  231. if(sqstd_rex_match(self,str) == SQTrue)
  232. {
  233. sq_pushbool(v,SQTrue);
  234. return 1;
  235. }
  236. sq_pushbool(v,SQFalse);
  237. return 1;
  238. }
  239. static void _addrexmatch(HSQUIRRELVM v,const SQChar *str,const SQChar *begin,const SQChar *end)
  240. {
  241. sq_newtable(v);
  242. sq_pushstring(v,_SC("begin"),-1);
  243. sq_pushinteger(v,begin - str);
  244. sq_rawset(v,-3);
  245. sq_pushstring(v,_SC("end"),-1);
  246. sq_pushinteger(v,end - str);
  247. sq_rawset(v,-3);
  248. }
  249. static SQInteger _regexp_search(HSQUIRRELVM v)
  250. {
  251. SETUP_REX(v);
  252. const SQChar *str,*begin,*end;
  253. SQInteger start = 0;
  254. sq_getstring(v,2,&str);
  255. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  256. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  257. _addrexmatch(v,str,begin,end);
  258. return 1;
  259. }
  260. return 0;
  261. }
  262. static SQInteger _regexp_capture(HSQUIRRELVM v)
  263. {
  264. SETUP_REX(v);
  265. const SQChar *str,*begin,*end;
  266. SQInteger start = 0;
  267. sq_getstring(v,2,&str);
  268. if(sq_gettop(v) > 2) sq_getinteger(v,3,&start);
  269. if(sqstd_rex_search(self,str+start,&begin,&end) == SQTrue) {
  270. SQInteger n = sqstd_rex_getsubexpcount(self);
  271. SQRexMatch match;
  272. sq_newarray(v,0);
  273. for(SQInteger i = 0;i < n; i++) {
  274. sqstd_rex_getsubexp(self,i,&match);
  275. if(match.len > 0)
  276. _addrexmatch(v,str,match.begin,match.begin+match.len);
  277. else
  278. _addrexmatch(v,str,str,str); //empty match
  279. sq_arrayappend(v,-2);
  280. }
  281. return 1;
  282. }
  283. return 0;
  284. }
  285. static SQInteger _regexp_subexpcount(HSQUIRRELVM v)
  286. {
  287. SETUP_REX(v);
  288. sq_pushinteger(v,sqstd_rex_getsubexpcount(self));
  289. return 1;
  290. }
  291. static SQInteger _regexp_constructor(HSQUIRRELVM v)
  292. {
  293. const SQChar *error,*pattern;
  294. sq_getstring(v,2,&pattern);
  295. SQRex *rex = sqstd_rex_compile(pattern,&error);
  296. if(!rex) return sq_throwerror(v,error);
  297. sq_setinstanceup(v,1,rex);
  298. sq_setreleasehook(v,1,_rexobj_releasehook);
  299. return 0;
  300. }
  301. static SQInteger _regexp__typeof(HSQUIRRELVM v)
  302. {
  303. sq_pushstring(v,_SC("regexp"),-1);
  304. return 1;
  305. }
  306. #define _DECL_REX_FUNC(name,nparams,pmask) {_SC(#name),_regexp_##name,nparams,pmask}
  307. static SQRegFunction rexobj_funcs[]={
  308. _DECL_REX_FUNC(constructor,2,_SC(".s")),
  309. _DECL_REX_FUNC(search,-2,_SC("xsn")),
  310. _DECL_REX_FUNC(match,2,_SC("xs")),
  311. _DECL_REX_FUNC(capture,-2,_SC("xsn")),
  312. _DECL_REX_FUNC(subexpcount,1,_SC("x")),
  313. _DECL_REX_FUNC(_typeof,1,_SC("x")),
  314. {0,0}
  315. };
  316. #undef _DECL_REX_FUNC
  317. #define _DECL_FUNC(name,nparams,pmask) {_SC(#name),_string_##name,nparams,pmask}
  318. static SQRegFunction stringlib_funcs[]={
  319. _DECL_FUNC(format,-2,_SC(".s")),
  320. _DECL_FUNC(strip,2,_SC(".s")),
  321. _DECL_FUNC(lstrip,2,_SC(".s")),
  322. _DECL_FUNC(rstrip,2,_SC(".s")),
  323. _DECL_FUNC(split,3,_SC(".ss")),
  324. {0,0}
  325. };
  326. #undef _DECL_FUNC
  327. SQInteger sqstd_register_stringlib(HSQUIRRELVM v)
  328. {
  329. sq_pushstring(v,_SC("regexp"),-1);
  330. sq_newclass(v,SQFalse);
  331. SQInteger i = 0;
  332. while(rexobj_funcs[i].name != 0) {
  333. SQRegFunction &f = rexobj_funcs[i];
  334. sq_pushstring(v,f.name,-1);
  335. sq_newclosure(v,f.f,0);
  336. sq_setparamscheck(v,f.nparamscheck,f.typemask);
  337. sq_setnativeclosurename(v,-1,f.name);
  338. sq_newslot(v,-3,SQFalse);
  339. i++;
  340. }
  341. sq_newslot(v,-3,SQFalse);
  342. i = 0;
  343. while(stringlib_funcs[i].name!=0)
  344. {
  345. sq_pushstring(v,stringlib_funcs[i].name,-1);
  346. sq_newclosure(v,stringlib_funcs[i].f,0);
  347. sq_setparamscheck(v,stringlib_funcs[i].nparamscheck,stringlib_funcs[i].typemask);
  348. sq_setnativeclosurename(v,-1,stringlib_funcs[i].name);
  349. sq_newslot(v,-3,SQFalse);
  350. i++;
  351. }
  352. return 1;
  353. }