template_parser.c 7.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419
  1. /*
  2. * LuCI Template - Parser implementation
  3. *
  4. * Copyright (C) 2009-2012 Jo-Philipp Wich <jow@openwrt.org>
  5. *
  6. * Licensed under the Apache License, Version 2.0 (the "License");
  7. * you may not use this file except in compliance with the License.
  8. * You may obtain a copy of the License at
  9. *
  10. * http://www.apache.org/licenses/LICENSE-2.0
  11. *
  12. * Unless required by applicable law or agreed to in writing, software
  13. * distributed under the License is distributed on an "AS IS" BASIS,
  14. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  15. * See the License for the specific language governing permissions and
  16. * limitations under the License.
  17. */
  18. #include "template_parser.h"
  19. #include "template_utils.h"
  20. #include "template_lmo.h"
  21. /* leading and trailing code for different types */
  22. static const char *const gen_code[9][2] = {
  23. {NULL, NULL},
  24. {"write(\"", "\")"},
  25. {NULL, NULL},
  26. {"write(tostring(", " or \"\"))"},
  27. {"include(\"", "\")"},
  28. {"write(\"", "\")"},
  29. {"write(\"", "\")"},
  30. {NULL, " "},
  31. {}
  32. };
  33. /* Simple strstr() like function that takes len arguments for both haystack and needle. */
  34. static char *strfind(char *haystack, int hslen, const char *needle, int ndlen)
  35. {
  36. int match = 0;
  37. int i, j;
  38. for( i = 0; i < hslen; i++ )
  39. {
  40. if( haystack[i] == needle[0] )
  41. {
  42. match = ((ndlen == 1) || ((i + ndlen) <= hslen));
  43. for( j = 1; (j < ndlen) && ((i + j) < hslen); j++ )
  44. {
  45. if( haystack[i+j] != needle[j] )
  46. {
  47. match = 0;
  48. break;
  49. }
  50. }
  51. if( match )
  52. return &haystack[i];
  53. }
  54. }
  55. return NULL;
  56. }
  57. struct template_parser * template_open(const char *file)
  58. {
  59. struct stat s;
  60. struct template_parser *parser;
  61. if (!(parser = malloc(sizeof(*parser))))
  62. goto err;
  63. memset(parser, 0, sizeof(*parser));
  64. parser->fd = -1;
  65. parser->file = file;
  66. if (stat(file, &s))
  67. goto err;
  68. if ((parser->fd = open(file, O_RDONLY)) < 0)
  69. goto err;
  70. parser->size = s.st_size;
  71. parser->data = mmap(NULL, parser->size, PROT_READ, MAP_PRIVATE,
  72. parser->fd, 0);
  73. if (parser->data != MAP_FAILED)
  74. {
  75. parser->off = parser->data;
  76. parser->cur_chunk.type = T_TYPE_INIT;
  77. parser->cur_chunk.s = parser->data;
  78. parser->cur_chunk.e = parser->data;
  79. return parser;
  80. }
  81. err:
  82. template_close(parser);
  83. return NULL;
  84. }
  85. struct template_parser * template_string(const char *str, uint32_t len)
  86. {
  87. struct template_parser *parser;
  88. if (!str) {
  89. errno = EINVAL;
  90. return NULL;
  91. }
  92. if (!(parser = malloc(sizeof(*parser))))
  93. goto err;
  94. memset(parser, 0, sizeof(*parser));
  95. parser->fd = -1;
  96. parser->size = len;
  97. parser->data = (char*)str;
  98. parser->off = parser->data;
  99. parser->cur_chunk.type = T_TYPE_INIT;
  100. parser->cur_chunk.s = parser->data;
  101. parser->cur_chunk.e = parser->data;
  102. return parser;
  103. err:
  104. template_close(parser);
  105. return NULL;
  106. }
  107. void template_close(struct template_parser *parser)
  108. {
  109. if (!parser)
  110. return;
  111. if (parser->gc != NULL)
  112. free(parser->gc);
  113. /* if file is not set, we were parsing a string */
  114. if (parser->file) {
  115. if ((parser->data != NULL) && (parser->data != MAP_FAILED))
  116. munmap(parser->data, parser->size);
  117. if (parser->fd >= 0)
  118. close(parser->fd);
  119. }
  120. free(parser);
  121. }
  122. static void template_text(struct template_parser *parser, const char *e)
  123. {
  124. const char *s = parser->off;
  125. if (s < (parser->data + parser->size))
  126. {
  127. if (parser->strip_after)
  128. {
  129. while ((s <= e) && isspace(*s))
  130. s++;
  131. }
  132. parser->cur_chunk.type = T_TYPE_TEXT;
  133. }
  134. else
  135. {
  136. parser->cur_chunk.type = T_TYPE_EOF;
  137. }
  138. parser->cur_chunk.line = parser->line;
  139. parser->cur_chunk.s = s;
  140. parser->cur_chunk.e = e;
  141. }
  142. static void template_code(struct template_parser *parser, const char *e)
  143. {
  144. const char *s = parser->off;
  145. parser->strip_before = 0;
  146. parser->strip_after = 0;
  147. if (*s == '-')
  148. {
  149. parser->strip_before = 1;
  150. for (s++; (s <= e) && (*s == ' ' || *s == '\t'); s++);
  151. }
  152. if (*(e-1) == '-')
  153. {
  154. parser->strip_after = 1;
  155. for (e--; (e >= s) && (*e == ' ' || *e == '\t'); e--);
  156. }
  157. switch (*s)
  158. {
  159. /* comment */
  160. case '#':
  161. s++;
  162. parser->cur_chunk.type = T_TYPE_COMMENT;
  163. break;
  164. /* include */
  165. case '+':
  166. s++;
  167. parser->cur_chunk.type = T_TYPE_INCLUDE;
  168. break;
  169. /* translate */
  170. case ':':
  171. s++;
  172. parser->cur_chunk.type = T_TYPE_I18N;
  173. break;
  174. /* translate raw */
  175. case '_':
  176. s++;
  177. parser->cur_chunk.type = T_TYPE_I18N_RAW;
  178. break;
  179. /* expr */
  180. case '=':
  181. s++;
  182. parser->cur_chunk.type = T_TYPE_EXPR;
  183. break;
  184. /* code */
  185. default:
  186. parser->cur_chunk.type = T_TYPE_CODE;
  187. break;
  188. }
  189. parser->cur_chunk.line = parser->line;
  190. parser->cur_chunk.s = s;
  191. parser->cur_chunk.e = e;
  192. }
  193. static const char *
  194. template_format_chunk(struct template_parser *parser, size_t *sz)
  195. {
  196. const char *s, *p;
  197. const char *head, *tail;
  198. struct template_chunk *c = &parser->prv_chunk;
  199. struct template_buffer *buf;
  200. *sz = 0;
  201. s = parser->gc = NULL;
  202. if (parser->strip_before && c->type == T_TYPE_TEXT)
  203. {
  204. while ((c->e > c->s) && isspace(*(c->e - 1)))
  205. c->e--;
  206. }
  207. /* empty chunk */
  208. if (c->s == c->e)
  209. {
  210. if (c->type == T_TYPE_EOF)
  211. {
  212. *sz = 0;
  213. s = NULL;
  214. }
  215. else
  216. {
  217. *sz = 1;
  218. s = " ";
  219. }
  220. }
  221. /* format chunk */
  222. else if ((buf = buf_init(c->e - c->s)) != NULL)
  223. {
  224. if ((head = gen_code[c->type][0]) != NULL)
  225. buf_append(buf, head, strlen(head));
  226. switch (c->type)
  227. {
  228. case T_TYPE_TEXT:
  229. luastr_escape(buf, c->s, c->e - c->s, 0);
  230. break;
  231. case T_TYPE_EXPR:
  232. buf_append(buf, c->s, c->e - c->s);
  233. for (p = c->s; p < c->e; p++)
  234. parser->line += (*p == '\n');
  235. break;
  236. case T_TYPE_INCLUDE:
  237. luastr_escape(buf, c->s, c->e - c->s, 0);
  238. break;
  239. case T_TYPE_I18N:
  240. luastr_translate(buf, c->s, c->e - c->s, 1);
  241. break;
  242. case T_TYPE_I18N_RAW:
  243. luastr_translate(buf, c->s, c->e - c->s, 0);
  244. break;
  245. case T_TYPE_CODE:
  246. buf_append(buf, c->s, c->e - c->s);
  247. for (p = c->s; p < c->e; p++)
  248. parser->line += (*p == '\n');
  249. break;
  250. }
  251. if ((tail = gen_code[c->type][1]) != NULL)
  252. buf_append(buf, tail, strlen(tail));
  253. *sz = buf_length(buf);
  254. s = parser->gc = buf_destroy(buf);
  255. if (!*sz)
  256. {
  257. *sz = 1;
  258. s = " ";
  259. }
  260. }
  261. return s;
  262. }
  263. const char *template_reader(lua_State *L, void *ud, size_t *sz)
  264. {
  265. struct template_parser *parser = ud;
  266. int rem = parser->size - (parser->off - parser->data);
  267. char *tag;
  268. parser->prv_chunk = parser->cur_chunk;
  269. /* free previous string */
  270. if (parser->gc)
  271. {
  272. free(parser->gc);
  273. parser->gc = NULL;
  274. }
  275. /* before tag */
  276. if (!parser->in_expr)
  277. {
  278. if ((tag = strfind(parser->off, rem, "<%", 2)) != NULL)
  279. {
  280. template_text(parser, tag);
  281. parser->off = tag + 2;
  282. parser->in_expr = 1;
  283. }
  284. else
  285. {
  286. template_text(parser, parser->data + parser->size);
  287. parser->off = parser->data + parser->size;
  288. }
  289. }
  290. /* inside tag */
  291. else
  292. {
  293. if ((tag = strfind(parser->off, rem, "%>", 2)) != NULL)
  294. {
  295. template_code(parser, tag);
  296. parser->off = tag + 2;
  297. parser->in_expr = 0;
  298. }
  299. else
  300. {
  301. /* unexpected EOF */
  302. template_code(parser, parser->data + parser->size);
  303. *sz = 1;
  304. return "\033";
  305. }
  306. }
  307. return template_format_chunk(parser, sz);
  308. }
  309. int template_error(lua_State *L, struct template_parser *parser)
  310. {
  311. const char *err = luaL_checkstring(L, -1);
  312. const char *off = parser->prv_chunk.s;
  313. const char *ptr;
  314. char msg[1024];
  315. int line = 0;
  316. int chunkline = 0;
  317. if ((ptr = strfind((char *)err, strlen(err), "]:", 2)) != NULL)
  318. {
  319. chunkline = atoi(ptr + 2) - parser->prv_chunk.line;
  320. while (*ptr)
  321. {
  322. if (*ptr++ == ' ')
  323. {
  324. err = ptr;
  325. break;
  326. }
  327. }
  328. }
  329. if (strfind((char *)err, strlen(err), "'char(27)'", 10) != NULL)
  330. {
  331. off = parser->data + parser->size;
  332. err = "'%>' expected before end of file";
  333. chunkline = 0;
  334. }
  335. for (ptr = parser->data; ptr < off; ptr++)
  336. if (*ptr == '\n')
  337. line++;
  338. snprintf(msg, sizeof(msg), "Syntax error in %s:%d: %s",
  339. parser->file ? parser->file : "[string]", line + chunkline, err ? err : "(unknown error)");
  340. lua_pushnil(L);
  341. lua_pushinteger(L, line + chunkline);
  342. lua_pushstring(L, msg);
  343. return 3;
  344. }