You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.

css_parser.cxx 21KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761
  1. /*-
  2. * Copyright 2021 Vsevolod Stakhov
  3. *
  4. * Licensed under the Apache License, Version 2.0 (the "License");
  5. * you may not use this file except in compliance with the License.
  6. * You may obtain a copy of the License at
  7. *
  8. * http://www.apache.org/licenses/LICENSE-2.0
  9. *
  10. * Unless required by applicable law or agreed to in writing, software
  11. * distributed under the License is distributed on an "AS IS" BASIS,
  12. * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  13. * See the License for the specific language governing permissions and
  14. * limitations under the License.
  15. */
  16. #include "css_parser.hxx"
  17. #include "css_tokeniser.hxx"
  18. #include "css_selector.hxx"
  19. #include "css_rule.hxx"
  20. #include "css_util.hxx"
  21. #include "css.hxx"
  22. #include "fmt/core.h"
  23. #include <vector>
  24. #include <unicode/utf8.h>
  25. #define DOCTEST_CONFIG_IMPLEMENTATION_IN_DLL
  26. #include "doctest/doctest.h"
  27. namespace rspamd::css {
  28. const css_consumed_block css_parser_eof_block{};
  29. auto css_consumed_block::attach_block(consumed_block_ptr &&block) -> bool {
  30. if (std::holds_alternative<std::monostate>(content)) {
  31. /* Switch from monostate */
  32. content = std::vector<consumed_block_ptr>();
  33. }
  34. else if (!std::holds_alternative<std::vector<consumed_block_ptr>>(content)) {
  35. /* A single component, cannot attach a block ! */
  36. return false;
  37. }
  38. auto &value_vec = std::get<std::vector<consumed_block_ptr>>(content);
  39. value_vec.push_back(std::move(block));
  40. return true;
  41. }
  42. auto css_consumed_block::add_function_argument(consumed_block_ptr &&block) -> bool {
  43. if (!std::holds_alternative<css_function_block>(content)) {
  44. return false;
  45. }
  46. auto &&func_bloc = std::get<css_function_block>(content);
  47. func_bloc.args.push_back(std::move(block));
  48. return true;
  49. }
  50. auto css_consumed_block::token_type_str(void) const -> const char *
  51. {
  52. const auto *ret = "";
  53. switch(tag) {
  54. case parser_tag_type::css_top_block:
  55. ret = "top";
  56. break;
  57. case parser_tag_type::css_qualified_rule:
  58. ret = "qualified rule";
  59. break;
  60. case parser_tag_type::css_at_rule:
  61. ret = "at rule";
  62. break;
  63. case parser_tag_type::css_simple_block:
  64. ret = "simple block";
  65. break;
  66. case parser_tag_type::css_function:
  67. ret = "function";
  68. break;
  69. case parser_tag_type::css_function_arg:
  70. ret = "function arg";
  71. break;
  72. case parser_tag_type::css_component:
  73. ret = "component";
  74. break;
  75. case parser_tag_type::css_eof_block:
  76. ret = "eof";
  77. break;
  78. }
  79. return ret;
  80. }
  81. auto css_consumed_block::debug_str(void) -> std::string {
  82. std::string ret = fmt::format(R"("type": "{}", "value": )", token_type_str());
  83. std::visit([&](auto& arg) {
  84. using T = std::decay_t<decltype(arg)>;
  85. if constexpr (std::is_same_v<T, std::vector<consumed_block_ptr>>) {
  86. /* Array of blocks */
  87. ret += "[";
  88. for (const auto &block : arg) {
  89. ret += "{";
  90. ret += block->debug_str();
  91. ret += "}, ";
  92. }
  93. if (*(--ret.end()) == ' ') {
  94. ret.pop_back();
  95. ret.pop_back(); /* Last ',' */
  96. }
  97. ret += "]";
  98. }
  99. else if constexpr (std::is_same_v<T, std::monostate>) {
  100. /* Empty block */
  101. ret += R"("empty")";
  102. }
  103. else if constexpr (std::is_same_v<T, css_function_block>) {
  104. ret += R"({ "content": {"token": )";
  105. ret += "\"" + arg.function.debug_token_str() + "\", ";
  106. ret += R"("arguments": [)";
  107. for (const auto &block : arg.args) {
  108. ret += "{";
  109. ret += block->debug_str();
  110. ret += "}, ";
  111. }
  112. if (*(--ret.end()) == ' ') {
  113. ret.pop_back();
  114. ret.pop_back(); /* Last ',' */
  115. }
  116. ret += "]}}";
  117. }
  118. else {
  119. /* Single element block */
  120. ret += "\"" + arg.debug_token_str() + "\"";
  121. }
  122. },
  123. content);
  124. return ret;
  125. }
  126. class css_parser {
  127. public:
  128. css_parser(void) = delete; /* Require mempool to be set for logging */
  129. explicit css_parser(rspamd_mempool_t *pool) : pool (pool) {}
  130. std::unique_ptr<css_consumed_block> consume_css_blocks(const std::string_view &sv);
  131. bool consume_input(const std::string_view &sv);
  132. auto get_object_maybe(void) -> tl::expected<std::unique_ptr<css_style_sheet>, css_parse_error> {
  133. if (style_object) {
  134. return std::move(style_object);
  135. }
  136. return tl::make_unexpected(error);
  137. }
  138. /* Helper parser methods */
  139. bool need_unescape(const std::string_view &sv);
  140. private:
  141. std::unique_ptr<css_style_sheet> style_object;
  142. std::unique_ptr<css_tokeniser> tokeniser;
  143. css_parse_error error;
  144. rspamd_mempool_t *pool;
  145. int rec_level = 0;
  146. const int max_rec = 20;
  147. bool eof = false;
  148. /* Consumers */
  149. auto component_value_consumer(std::unique_ptr<css_consumed_block> &top) -> bool;
  150. auto function_consumer(std::unique_ptr<css_consumed_block> &top) -> bool;
  151. auto simple_block_consumer(std::unique_ptr<css_consumed_block> &top,
  152. css_parser_token::token_type expected_end,
  153. bool consume_current) -> bool;
  154. auto qualified_rule_consumer(std::unique_ptr<css_consumed_block> &top) -> bool;
  155. auto at_rule_consumer(std::unique_ptr<css_consumed_block> &top) -> bool;
  156. };
  157. /*
  158. * Find if we need to unescape css
  159. */
  160. bool
  161. css_parser::need_unescape(const std::string_view &sv)
  162. {
  163. bool in_quote = false;
  164. char quote_char, prev_c = 0;
  165. for (const auto c : sv) {
  166. if (!in_quote) {
  167. if (c == '"' || c == '\'') {
  168. in_quote = true;
  169. quote_char = c;
  170. }
  171. else if (c == '\\') {
  172. return true;
  173. }
  174. }
  175. else {
  176. if (c == quote_char) {
  177. if (prev_c != '\\') {
  178. in_quote = false;
  179. }
  180. }
  181. prev_c = c;
  182. }
  183. }
  184. return false;
  185. }
  186. auto css_parser::function_consumer(std::unique_ptr<css_consumed_block> &top) -> bool
  187. {
  188. auto ret = true, want_more = true;
  189. msg_debug_css("consume function block; top block: %s, recursion level %d",
  190. top->token_type_str(), rec_level);
  191. if (++rec_level > max_rec) {
  192. msg_err_css("max nesting reached, ignore style");
  193. error = css_parse_error(css_parse_error_type::PARSE_ERROR_BAD_NESTING);
  194. return false;
  195. }
  196. while (ret && want_more && !eof) {
  197. auto next_token = tokeniser->next_token();
  198. switch (next_token.type) {
  199. case css_parser_token::token_type::eof_token:
  200. eof = true;
  201. break;
  202. case css_parser_token::token_type::whitespace_token:
  203. /* Ignore whitespaces */
  204. break;
  205. case css_parser_token::token_type::ebrace_token:
  206. ret = true;
  207. want_more = false;
  208. break;
  209. case css_parser_token::token_type::comma_token:
  210. case css_parser_token::token_type::delim_token:
  211. case css_parser_token::token_type::obrace_token:
  212. break;
  213. default:
  214. /* Attach everything to the function block */
  215. top->add_function_argument(std::make_unique<css_consumed_block>(
  216. css::css_consumed_block::parser_tag_type::css_function_arg,
  217. std::move(next_token)));
  218. break;
  219. }
  220. }
  221. --rec_level;
  222. return ret;
  223. }
  224. auto css_parser::simple_block_consumer(std::unique_ptr<css_consumed_block> &top,
  225. css_parser_token::token_type expected_end,
  226. bool consume_current) -> bool
  227. {
  228. auto ret = true;
  229. std::unique_ptr<css_consumed_block> block;
  230. msg_debug_css("consume simple block; top block: %s, recursion level %d",
  231. top->token_type_str(), rec_level);
  232. if (!consume_current && ++rec_level > max_rec) {
  233. msg_err_css("max nesting reached, ignore style");
  234. error = css_parse_error(css_parse_error_type::PARSE_ERROR_BAD_NESTING);
  235. return false;
  236. }
  237. if (!consume_current) {
  238. block = std::make_unique<css_consumed_block>(
  239. css_consumed_block::parser_tag_type::css_simple_block);
  240. }
  241. while (ret && !eof) {
  242. auto next_token = tokeniser->next_token();
  243. if (next_token.type == expected_end) {
  244. break;
  245. }
  246. switch (next_token.type) {
  247. case css_parser_token::token_type::eof_token:
  248. eof = true;
  249. break;
  250. case css_parser_token::token_type::whitespace_token:
  251. /* Ignore whitespaces */
  252. break;
  253. default:
  254. tokeniser->pushback_token(std::move(next_token));
  255. ret = component_value_consumer(consume_current ? top : block);
  256. break;
  257. }
  258. }
  259. if (!consume_current && ret) {
  260. msg_debug_css("attached node 'simple block' rule %s; length=%d",
  261. block->token_type_str(), (int)block->size());
  262. top->attach_block(std::move(block));
  263. }
  264. if (!consume_current) {
  265. --rec_level;
  266. }
  267. return ret;
  268. }
  269. auto css_parser::qualified_rule_consumer(std::unique_ptr<css_consumed_block> &top) -> bool
  270. {
  271. msg_debug_css("consume qualified block; top block: %s, recursion level %d",
  272. top->token_type_str(), rec_level);
  273. if (++rec_level > max_rec) {
  274. msg_err_css("max nesting reached, ignore style");
  275. error = css_parse_error(css_parse_error_type::PARSE_ERROR_BAD_NESTING);
  276. return false;
  277. }
  278. auto ret = true, want_more = true;
  279. auto block = std::make_unique<css_consumed_block>(
  280. css_consumed_block::parser_tag_type::css_qualified_rule);
  281. while (ret && want_more && !eof) {
  282. auto next_token = tokeniser->next_token();
  283. switch (next_token.type) {
  284. case css_parser_token::token_type::eof_token:
  285. eof = true;
  286. break;
  287. case css_parser_token::token_type::cdo_token:
  288. case css_parser_token::token_type::cdc_token:
  289. if (top->tag == css_consumed_block::parser_tag_type::css_top_block) {
  290. /* Ignore */
  291. ret = true;
  292. }
  293. else {
  294. }
  295. break;
  296. case css_parser_token::token_type::ocurlbrace_token:
  297. ret = simple_block_consumer(block,
  298. css_parser_token::token_type::ecurlbrace_token, false);
  299. want_more = false;
  300. break;
  301. case css_parser_token::token_type::whitespace_token:
  302. /* Ignore whitespaces */
  303. break;
  304. default:
  305. tokeniser->pushback_token(std::move(next_token));
  306. ret = component_value_consumer(block);
  307. break;
  308. };
  309. }
  310. if (ret) {
  311. if (top->tag == css_consumed_block::parser_tag_type::css_top_block) {
  312. msg_debug_css("attached node qualified rule %s; length=%d",
  313. block->token_type_str(), (int)block->size());
  314. top->attach_block(std::move(block));
  315. }
  316. }
  317. --rec_level;
  318. return ret;
  319. }
  320. auto css_parser::at_rule_consumer(std::unique_ptr<css_consumed_block> &top) -> bool
  321. {
  322. msg_debug_css("consume at-rule block; top block: %s, recursion level %d",
  323. top->token_type_str(), rec_level);
  324. if (++rec_level > max_rec) {
  325. msg_err_css("max nesting reached, ignore style");
  326. error = css_parse_error(css_parse_error_type::PARSE_ERROR_BAD_NESTING);
  327. return false;
  328. }
  329. auto ret = true, want_more = true;
  330. auto block = std::make_unique<css_consumed_block>(
  331. css_consumed_block::parser_tag_type::css_at_rule);
  332. while (ret && want_more && !eof) {
  333. auto next_token = tokeniser->next_token();
  334. switch (next_token.type) {
  335. case css_parser_token::token_type::eof_token:
  336. eof = true;
  337. break;
  338. case css_parser_token::token_type::cdo_token:
  339. case css_parser_token::token_type::cdc_token:
  340. if (top->tag == css_consumed_block::parser_tag_type::css_top_block) {
  341. /* Ignore */
  342. ret = true;
  343. }
  344. else {
  345. }
  346. break;
  347. case css_parser_token::token_type::ocurlbrace_token:
  348. ret = simple_block_consumer(block,
  349. css_parser_token::token_type::ecurlbrace_token, false);
  350. want_more = false;
  351. break;
  352. case css_parser_token::token_type::whitespace_token:
  353. /* Ignore whitespaces */
  354. break;
  355. case css_parser_token::token_type::semicolon_token:
  356. want_more = false;
  357. break;
  358. default:
  359. tokeniser->pushback_token(std::move(next_token));
  360. ret = component_value_consumer(block);
  361. break;
  362. };
  363. }
  364. if (ret) {
  365. if (top->tag == css_consumed_block::parser_tag_type::css_top_block) {
  366. msg_debug_css("attached node qualified rule %s; length=%d",
  367. block->token_type_str(), (int)block->size());
  368. top->attach_block(std::move(block));
  369. }
  370. }
  371. --rec_level;
  372. return ret;
  373. }
  374. auto css_parser::component_value_consumer(std::unique_ptr<css_consumed_block> &top) -> bool
  375. {
  376. auto ret = true, need_more = true;
  377. std::unique_ptr<css_consumed_block> block;
  378. msg_debug_css("consume component block; top block: %s, recursion level %d",
  379. top->token_type_str(), rec_level);
  380. if (++rec_level > max_rec) {
  381. error = css_parse_error(css_parse_error_type::PARSE_ERROR_BAD_NESTING);
  382. return false;
  383. }
  384. while (ret && need_more && !eof) {
  385. auto next_token = tokeniser->next_token();
  386. switch (next_token.type) {
  387. case css_parser_token::token_type::eof_token:
  388. eof = true;
  389. break;
  390. case css_parser_token::token_type::ocurlbrace_token:
  391. block = std::make_unique<css_consumed_block>(
  392. css_consumed_block::parser_tag_type::css_simple_block);
  393. ret = simple_block_consumer(block,
  394. css_parser_token::token_type::ecurlbrace_token,
  395. true);
  396. need_more = false;
  397. break;
  398. case css_parser_token::token_type::obrace_token:
  399. block = std::make_unique<css_consumed_block>(
  400. css_consumed_block::parser_tag_type::css_simple_block);
  401. ret = simple_block_consumer(block,
  402. css_parser_token::token_type::ebrace_token,
  403. true);
  404. need_more = false;
  405. break;
  406. case css_parser_token::token_type::osqbrace_token:
  407. block = std::make_unique<css_consumed_block>(
  408. css_consumed_block::parser_tag_type::css_simple_block);
  409. ret = simple_block_consumer(block,
  410. css_parser_token::token_type::esqbrace_token,
  411. true);
  412. need_more = false;
  413. break;
  414. case css_parser_token::token_type::whitespace_token:
  415. /* Ignore whitespaces */
  416. break;
  417. case css_parser_token::token_type::function_token: {
  418. need_more = false;
  419. block = std::make_unique<css_consumed_block>(
  420. css_consumed_block::parser_tag_type::css_function,
  421. std::move(next_token));
  422. /* Consume the rest */
  423. ret = function_consumer(block);
  424. break;
  425. }
  426. default:
  427. block = std::make_unique<css_consumed_block>(
  428. css_consumed_block::parser_tag_type::css_component,
  429. std::move(next_token));
  430. need_more = false;
  431. break;
  432. }
  433. }
  434. if (ret && block) {
  435. msg_debug_css("attached node component rule %s; length=%d",
  436. block->token_type_str(), (int)block->size());
  437. top->attach_block(std::move(block));
  438. }
  439. --rec_level;
  440. return ret;
  441. }
  442. auto
  443. css_parser::consume_css_blocks(const std::string_view &sv) -> std::unique_ptr<css_consumed_block>
  444. {
  445. tokeniser = std::make_unique<css_tokeniser>(pool, sv);
  446. auto ret = true;
  447. auto consumed_blocks =
  448. std::make_unique<css_consumed_block>(css_consumed_block::parser_tag_type::css_top_block);
  449. while (!eof && ret) {
  450. auto next_token = tokeniser->next_token();
  451. switch (next_token.type) {
  452. case css_parser_token::token_type::whitespace_token:
  453. /* Ignore whitespaces */
  454. break;
  455. case css_parser_token::token_type::eof_token:
  456. eof = true;
  457. break;
  458. case css_parser_token::token_type::at_keyword_token:
  459. tokeniser->pushback_token(std::move(next_token));
  460. ret = at_rule_consumer(consumed_blocks);
  461. break;
  462. default:
  463. tokeniser->pushback_token(std::move(next_token));
  464. ret = qualified_rule_consumer(consumed_blocks);
  465. break;
  466. }
  467. }
  468. tokeniser.reset(nullptr); /* No longer needed */
  469. return consumed_blocks;
  470. }
  471. bool css_parser::consume_input(const std::string_view &sv)
  472. {
  473. auto &&consumed_blocks = consume_css_blocks(sv);
  474. const auto &rules = consumed_blocks->get_blocks_or_empty();
  475. if (rules.empty()) {
  476. return false;
  477. }
  478. style_object = std::make_unique<css_style_sheet>(pool);
  479. for (auto &&rule : rules) {
  480. /*
  481. * For now, we do not need any of the at rules, so we can safely ignore them
  482. */
  483. auto &&children = rule->get_blocks_or_empty();
  484. if (children.size() > 1 &&
  485. children[0]->tag == css_consumed_block::parser_tag_type::css_component) {
  486. auto simple_block = std::find_if(children.begin(), children.end(),
  487. [](auto &bl) {
  488. return bl->tag == css_consumed_block::parser_tag_type::css_simple_block;
  489. });
  490. if (simple_block != children.end()) {
  491. /*
  492. * We have a component and a simple block,
  493. * so we can parse a selector and then extract
  494. * declarations from a simple block
  495. */
  496. /* First, tag all components as preamble */
  497. auto selector_it = children.cbegin();
  498. auto selector_token_functor = [&selector_it,&simple_block](void)
  499. -> const css_consumed_block & {
  500. for (;;) {
  501. if (selector_it == simple_block) {
  502. return css_parser_eof_block;
  503. }
  504. const auto &ret = (*selector_it);
  505. ++selector_it;
  506. return *ret;
  507. }
  508. };
  509. auto selectors_vec = process_selector_tokens(pool, selector_token_functor);
  510. if (selectors_vec.size() > 0) {
  511. msg_debug_css("processed %d selectors", (int)selectors_vec.size());
  512. auto decls_it = (*simple_block)->get_blocks_or_empty().cbegin();
  513. auto decls_end = (*simple_block)->get_blocks_or_empty().cend();
  514. auto declaration_token_functor = [&decls_it, &decls_end](void)
  515. -> const css_consumed_block & {
  516. for (;;) {
  517. if (decls_it == decls_end) {
  518. return css_parser_eof_block;
  519. }
  520. const auto &ret = (*decls_it);
  521. ++decls_it;
  522. return *ret;
  523. }
  524. };
  525. auto declarations_vec = process_declaration_tokens(pool,
  526. declaration_token_functor);
  527. if (declarations_vec && !declarations_vec->get_rules().empty()) {
  528. msg_debug_css("processed %d rules",
  529. (int)declarations_vec->get_rules().size());
  530. for (auto &&selector : selectors_vec) {
  531. style_object->add_selector_rule(std::move(selector),
  532. declarations_vec);
  533. }
  534. }
  535. }
  536. }
  537. }
  538. }
  539. auto debug_str = consumed_blocks->debug_str();
  540. msg_debug_css("consumed css: {%*s}", (int)debug_str.size(), debug_str.data());
  541. return true;
  542. }
  543. auto
  544. get_selectors_parser_functor(rspamd_mempool_t *pool,
  545. const std::string_view &st) -> blocks_gen_functor
  546. {
  547. css_parser parser(pool);
  548. auto &&consumed_blocks = parser.consume_css_blocks(st);
  549. const auto &rules = consumed_blocks->get_blocks_or_empty();
  550. auto rules_it = rules.begin();
  551. auto &&children = (*rules_it)->get_blocks_or_empty();
  552. auto cur = children.begin();
  553. auto last = children.end();
  554. /*
  555. * We use move only wrapper to state the fact that the cosumed blocks
  556. * are moved into the closure, not copied.
  557. * It prevents us from thinking about copies of the blocks and
  558. * functors.
  559. * Mutable lambda is required to copy iterators inside of the closure,
  560. * as, again, it is C++ where lifetime of the objects must be explicitly
  561. * transferred. On the other hand, we could move all stuff inside and remove
  562. * mutable.
  563. */
  564. return [cur, consumed_blocks = std::move(consumed_blocks), last](void) mutable
  565. -> const css_consumed_block & {
  566. if (cur != last) {
  567. const auto &ret = (*cur);
  568. ++cur;
  569. return *ret;
  570. }
  571. return css_parser_eof_block;
  572. };
  573. }
  574. /*
  575. * Wrapper for the parser
  576. */
  577. auto parse_css(rspamd_mempool_t *pool, const std::string_view &st) ->
  578. tl::expected<std::unique_ptr<css_style_sheet>, css_parse_error>
  579. {
  580. css_parser parser(pool);
  581. std::string_view processed_input;
  582. if (parser.need_unescape(st)) {
  583. processed_input = rspamd::css::unescape_css(pool, st);
  584. }
  585. else {
  586. /* Lowercase inplace */
  587. auto *nspace = reinterpret_cast<char *>(rspamd_mempool_alloc(pool, st.length()));
  588. auto *p = nspace;
  589. for (const auto c : st) {
  590. *p++ = g_ascii_tolower(c);
  591. }
  592. processed_input = std::string_view{nspace, (std::size_t)(p - nspace)};
  593. }
  594. if (parser.consume_input(processed_input)) {
  595. return parser.get_object_maybe();
  596. }
  597. return tl::make_unexpected(css_parse_error{css_parse_error_type::PARSE_ERROR_INVALID_SYNTAX,
  598. "cannot parse input"});
  599. }
  600. TEST_SUITE("css parser") {
  601. TEST_CASE("parse colors") {
  602. const std::vector<const char *> cases{
  603. "p { color: rgb(100%, 50%, 0%); opacity: -1; width: 1em; display: none; } /* very transparent solid orange */",
  604. "p { color: rgb(100%, 50%, 0%); opacity: 2; display: inline; } /* very transparent solid orange */",
  605. "p { color: rgb(100%, 50%, 0%); opacity: 0.5; } /* very transparent solid orange */\n",
  606. "p { color: rgb(100%, 50%, 0%); opacity: 1; width: 99%; } /* very transparent solid orange */\n",
  607. "p { color: rgb(100%, 50%, 0%); opacity: 10%; width: 99%; } /* very transparent solid orange */\n",
  608. "p { color: rgb(100%, 50%, 0%); opacity: 10%; width: 100px; } /* very transparent solid orange */\n",
  609. "p { color: rgb(100%, 50%, 0%); opacity: 10% } /* very transparent solid orange */\n",
  610. "* { color: hsl(0, 100%, 50%) !important } /* red */\n",
  611. "* { color: hsl(120, 100%, 50%) important } /* lime */\n",
  612. "* { color: hsl(120, 100%, 25%) } /* dark green */\n",
  613. "* { color: hsl(120, 100%, 75%) } /* light green */\n",
  614. "* { color: hsl(120, 75%, 75%) } /* pastel green, and so on */\n",
  615. "em { color: #f00 } /* #rgb */\n",
  616. "em { color: #ff0000 } /* #rrggbb */\n",
  617. "em { color: rgb(255,0,0) }\n",
  618. "em { color: rgb(100%, 0%, 0%) }\n",
  619. "body {color: black; background: white }\n",
  620. "h1 { color: maroon }\n",
  621. "h2 { color: olive }\n",
  622. "em { color: rgb(255,0,0) } /* integer range 0 - 255 */\n",
  623. "em { color: rgb(300,0,0) } /* clipped to rgb(255,0,0) */\n",
  624. "em { color: rgb(255,-10,0) } /* clipped to rgb(255,0,0) */\n",
  625. "em { color: rgb(110%, 0%, 0%) } /* clipped to rgb(100%,0%,0%) */\n",
  626. "em { color: rgb(255,0,0) } /* integer range 0 - 255 */\n",
  627. "em { color: rgba(255,0,0,1) /* the same, with explicit opacity of 1 */\n",
  628. "em { color: rgb(100%,0%,0%) } /* float range 0.0% - 100.0% */\n",
  629. "em { color: rgba(100%,0%,0%,1) } /* the same, with explicit opacity of 1 */\n",
  630. "p { color: rgba(0,0,255,0.5) } /* semi-transparent solid blue */\n",
  631. "p { color: rgba(100%, 50%, 0%, 0.1) } /* very transparent solid orange */",
  632. };
  633. rspamd_mempool_t *pool = rspamd_mempool_new(rspamd_mempool_suggest_size(),
  634. "css", 0);
  635. for (const auto &c : cases) {
  636. CHECK_UNARY(parse_css(pool, c));
  637. }
  638. rspamd_mempool_delete(pool);
  639. }
  640. }
  641. }