DataExpression.cpp 31 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189
  1. /*
  2. * This source file is part of RmlUi, the HTML/CSS Interface Middleware
  3. *
  4. * For the latest information, see http://github.com/mikke89/RmlUi
  5. *
  6. * Copyright (c) 2008-2010 CodePoint Ltd, Shift Technology Ltd
  7. * Copyright (c) 2019 The RmlUi Team, and contributors
  8. *
  9. * Permission is hereby granted, free of charge, to any person obtaining a copy
  10. * of this software and associated documentation files (the "Software"), to deal
  11. * in the Software without restriction, including without limitation the rights
  12. * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
  13. * copies of the Software, and to permit persons to whom the Software is
  14. * furnished to do so, subject to the following conditions:
  15. *
  16. * The above copyright notice and this permission notice shall be included in
  17. * all copies or substantial portions of the Software.
  18. *
  19. * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  20. * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
  21. * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
  22. * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
  23. * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
  24. * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
  25. * THE SOFTWARE.
  26. *
  27. */
  28. #include "DataExpression.h"
  29. #include "../../Include/RmlUi/Core/DataModel.h"
  30. #include "../../Include/RmlUi/Core/Event.h"
  31. #include "../../Include/RmlUi/Core/Variant.h"
  32. #include <stack>
  33. #ifdef _MSC_VER
  34. #pragma warning(default : 4061)
  35. #pragma warning(default : 4062)
  36. #endif
  37. namespace Rml {
  38. class DataParser;
  39. /*
  40. The abstract machine for RmlUi data scripts.
  41. The machine can execute a program which contains a list of instructions listed below.
  42. The abstract machine has three registers:
  43. R Typically results and right-hand side arguments.
  44. L Typically left-hand side arguments.
  45. C Typically center arguments (eg. in ternary operator).
  46. And two stacks:
  47. S The main program stack.
  48. A The arguments stack, only used to pass arguments to an external transform function.
  49. In addition, each instruction has an optional payload:
  50. D Instruction data (payload).
  51. Notation used in the instruction list below:
  52. S+ Push to stack S.
  53. S- Pop stack S (returns the popped value).
  54. */
  55. enum class Instruction { // Assignment (register/stack) = Read (register R/L/C, instruction data D, or stack)
  56. Push = 'P', // S+ = R
  57. Pop = 'o', // <R/L/C> = S- (D determines R/L/C)
  58. Literal = 'D', // R = D
  59. Variable = 'V', // R = DataModel.GetVariable(D) (D is an index into the variable address list)
  60. Add = '+', // R = L + R
  61. Subtract = '-', // R = L - R
  62. Multiply = '*', // R = L * R
  63. Divide = '/', // R = L / R
  64. Not = '!', // R = !R
  65. And = '&', // R = L && R
  66. Or = '|', // R = L || R
  67. Less = '<', // R = L < R
  68. LessEq = 'L', // R = L <= R
  69. Greater = '>', // R = L > R
  70. GreaterEq = 'G', // R = L >= R
  71. Equal = '=', // R = L == R
  72. NotEqual = 'N', // R = L != R
  73. Ternary = '?', // R = L ? C : R
  74. Arguments = 'a', // A+ = S- (Repeated D times, where D gives the num. arguments)
  75. TransformFnc = 'T', // R = DataModel.Execute( D, R, A ); A.Clear(); (D determines function name, R the input value, A the arguments)
  76. EventFnc = 'E', // DataModel.EventCallback(D, A); A.Clear();
  77. Assign = 'A', // DataModel.SetVariable(D, R)
  78. };
  79. enum class Register {
  80. R,
  81. L,
  82. C
  83. };
  84. struct InstructionData {
  85. Instruction instruction;
  86. Variant data;
  87. };
  88. namespace Parse {
  89. static void Assignment(DataParser& parser);
  90. static void Expression(DataParser& parser);
  91. }
  92. class DataParser {
  93. public:
  94. DataParser(String expression, DataExpressionInterface expression_interface) : expression(std::move(expression)), expression_interface(expression_interface) {}
  95. char Look() {
  96. if (reached_end)
  97. return '\0';
  98. return expression[index];
  99. }
  100. bool Match(char c, bool skip_whitespace = true) {
  101. if (c == Look()) {
  102. Next();
  103. if (skip_whitespace)
  104. SkipWhitespace();
  105. return true;
  106. }
  107. Expected(c);
  108. return false;
  109. }
  110. char Next() {
  111. ++index;
  112. if (index >= expression.size())
  113. reached_end = true;
  114. return Look();
  115. }
  116. void SkipWhitespace() {
  117. char c = Look();
  118. while (StringUtilities::IsWhitespace(c))
  119. c = Next();
  120. }
  121. void Error(const String message)
  122. {
  123. parse_error = true;
  124. Log::Message(Log::LT_WARNING, "Error in data expression at %d. %s", index, message.c_str());
  125. Log::Message(Log::LT_WARNING, " \"%s\"", expression.c_str());
  126. const size_t cursor_offset = size_t(index) + 3;
  127. const String cursor_string = String(cursor_offset, ' ') + '^';
  128. Log::Message(Log::LT_WARNING, cursor_string.c_str());
  129. }
  130. void Expected(String expected_symbols) {
  131. const char c = Look();
  132. if (c == '\0')
  133. Error(CreateString(expected_symbols.size() + 50, "Expected %s but found end of string.", expected_symbols.c_str()));
  134. else
  135. Error(CreateString(expected_symbols.size() + 50, "Expected %s but found character '%c'.", expected_symbols.c_str(), c));
  136. }
  137. void Expected(char expected) {
  138. Expected(String(1, '\'') + expected + '\'');
  139. }
  140. bool Parse(bool is_assignment_expression)
  141. {
  142. program.clear();
  143. variable_addresses.clear();
  144. index = 0;
  145. reached_end = false;
  146. parse_error = false;
  147. if (expression.empty())
  148. reached_end = true;
  149. SkipWhitespace();
  150. if (is_assignment_expression)
  151. Parse::Assignment(*this);
  152. else
  153. Parse::Expression(*this);
  154. if (!reached_end) {
  155. parse_error = true;
  156. Error(CreateString(50, "Unexpected character '%c' encountered.", Look()));
  157. }
  158. if (!parse_error && program_stack_size != 0) {
  159. parse_error = true;
  160. Error(CreateString(120, "Internal parser error, inconsistent stack operations. Stack size is %d at parse end.", program_stack_size));
  161. }
  162. return !parse_error;
  163. }
  164. Program ReleaseProgram() {
  165. RMLUI_ASSERT(!parse_error);
  166. return std::move(program);
  167. }
  168. AddressList ReleaseAddresses() {
  169. RMLUI_ASSERT(!parse_error);
  170. return std::move(variable_addresses);
  171. }
  172. void Emit(Instruction instruction, Variant data = Variant())
  173. {
  174. RMLUI_ASSERTMSG(instruction != Instruction::Push && instruction != Instruction::Pop &&
  175. instruction != Instruction::Arguments && instruction != Instruction::Variable && instruction != Instruction::Assign,
  176. "Use the Push(), Pop(), Arguments(), Variable(), and Assign() procedures for stack manipulation and variable instructions.");
  177. program.push_back(InstructionData{ instruction, std::move(data) });
  178. }
  179. void Push() {
  180. program_stack_size += 1;
  181. program.push_back(InstructionData{ Instruction::Push, Variant() });
  182. }
  183. void Pop(Register destination) {
  184. if (program_stack_size <= 0) {
  185. Error("Internal parser error: Tried to pop an empty stack.");
  186. return;
  187. }
  188. program_stack_size -= 1;
  189. program.push_back(InstructionData{ Instruction::Pop, Variant(int(destination)) });
  190. }
  191. void Arguments(int num_arguments) {
  192. if (program_stack_size < num_arguments) {
  193. Error(CreateString(128, "Internal parser error: Popping %d arguments, but the stack contains only %d elements.", num_arguments, program_stack_size));
  194. return;
  195. }
  196. program_stack_size -= num_arguments;
  197. program.push_back(InstructionData{ Instruction::Arguments, Variant(int(num_arguments)) });
  198. }
  199. void Variable(const String& name) {
  200. VariableGetSet(name, false);
  201. }
  202. void Assign(const String& name) {
  203. VariableGetSet(name, true);
  204. }
  205. private:
  206. void VariableGetSet(const String& name, bool is_assignment)
  207. {
  208. DataAddress address = expression_interface.ParseAddress(name);
  209. if (address.empty()) {
  210. Error(CreateString(name.size() + 50, "Could not find data variable with name '%s'.", name.c_str()));
  211. return;
  212. }
  213. int index = int(variable_addresses.size());
  214. variable_addresses.push_back(std::move(address));
  215. program.push_back(InstructionData{ is_assignment ? Instruction::Assign : Instruction::Variable, Variant(int(index)) });
  216. }
  217. const String expression;
  218. DataExpressionInterface expression_interface;
  219. size_t index = 0;
  220. bool reached_end = false;
  221. bool parse_error = true;
  222. int program_stack_size = 0;
  223. Program program;
  224. AddressList variable_addresses;
  225. };
  226. namespace Parse {
  227. // Forward declare all parse functions.
  228. static void Assignment(DataParser& parser);
  229. // The following in order of precedence.
  230. static void Expression(DataParser& parser);
  231. static void Relational(DataParser& parser);
  232. static void Additive(DataParser& parser);
  233. static void Term(DataParser& parser);
  234. static void Factor(DataParser& parser);
  235. static void NumberLiteral(DataParser& parser);
  236. static void StringLiteral(DataParser& parser);
  237. static void Variable(DataParser& parser);
  238. static void Add(DataParser& parser);
  239. static void Subtract(DataParser& parser);
  240. static void Multiply(DataParser& parser);
  241. static void Divide(DataParser& parser);
  242. static void Not(DataParser& parser);
  243. static void And(DataParser& parser);
  244. static void Or(DataParser& parser);
  245. static void Less(DataParser& parser);
  246. static void Greater(DataParser& parser);
  247. static void Equal(DataParser& parser);
  248. static void NotEqual(DataParser& parser);
  249. static void Ternary(DataParser& parser);
  250. static void Function(DataParser& parser, Instruction function_type, const String& name);
  251. // Helper functions
  252. static bool IsVariableCharacter(char c, bool is_first_character)
  253. {
  254. const bool is_alpha = (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
  255. if (is_first_character)
  256. return is_alpha;
  257. if (is_alpha || (c >= '0' && c <= '9'))
  258. return true;
  259. for (char valid_char : "_.[] ")
  260. {
  261. if (c == valid_char && valid_char != '\0')
  262. return true;
  263. }
  264. return false;
  265. }
  266. static String VariableName(DataParser& parser)
  267. {
  268. String name;
  269. bool is_first_character = true;
  270. char c = parser.Look();
  271. while (IsVariableCharacter(c, is_first_character))
  272. {
  273. name += c;
  274. c = parser.Next();
  275. is_first_character = false;
  276. }
  277. // Right trim spaces in name
  278. size_t new_size = String::npos;
  279. for (int i = int(name.size()) - 1; i >= 1; i--)
  280. {
  281. if (name[i] == ' ')
  282. new_size = size_t(i);
  283. else
  284. break;
  285. }
  286. if (new_size != String::npos)
  287. name.resize(new_size);
  288. return name;
  289. }
  290. // Parser functions
  291. static void Assignment(DataParser& parser)
  292. {
  293. bool looping = true;
  294. while (looping)
  295. {
  296. if (parser.Look() != '\0')
  297. {
  298. const String variable_name = VariableName(parser);
  299. if (variable_name.empty()) {
  300. parser.Error("Expected a variable for assignment but got an empty name.");
  301. return;
  302. }
  303. const char c = parser.Look();
  304. if (c == '=')
  305. {
  306. parser.Match('=');
  307. Expression(parser);
  308. parser.Assign(variable_name);
  309. }
  310. else if (c == '(' || c == ';' || c == '\0')
  311. {
  312. Function(parser, Instruction::EventFnc, variable_name);
  313. }
  314. else
  315. {
  316. parser.Expected("one of = ; ( or end of string");
  317. return;
  318. }
  319. }
  320. const char c = parser.Look();
  321. if (c == ';')
  322. parser.Match(';');
  323. else if (c == '\0')
  324. looping = false;
  325. else
  326. {
  327. parser.Expected("';' or end of string");
  328. looping = false;
  329. }
  330. }
  331. }
  332. static void Expression(DataParser& parser)
  333. {
  334. Relational(parser);
  335. bool looping = true;
  336. while (looping)
  337. {
  338. switch (parser.Look())
  339. {
  340. case '&': And(parser); break;
  341. case '|':
  342. {
  343. parser.Match('|', false);
  344. if (parser.Look() == '|')
  345. Or(parser);
  346. else
  347. {
  348. parser.SkipWhitespace();
  349. const String fnc_name = VariableName(parser);
  350. if (fnc_name.empty()) {
  351. parser.Error("Expected a transform function name but got an empty name.");
  352. return;
  353. }
  354. Function(parser, Instruction::TransformFnc, fnc_name);
  355. }
  356. }
  357. break;
  358. case '?': Ternary(parser); break;
  359. default:
  360. looping = false;
  361. }
  362. }
  363. }
  364. static void Relational(DataParser& parser)
  365. {
  366. Additive(parser);
  367. bool looping = true;
  368. while (looping)
  369. {
  370. switch (parser.Look())
  371. {
  372. case '=': Equal(parser); break;
  373. case '!': NotEqual(parser); break;
  374. case '<': Less(parser); break;
  375. case '>': Greater(parser); break;
  376. default:
  377. looping = false;
  378. }
  379. }
  380. }
  381. static void Additive(DataParser& parser)
  382. {
  383. Term(parser);
  384. bool looping = true;
  385. while (looping)
  386. {
  387. switch (parser.Look())
  388. {
  389. case '+': Add(parser); break;
  390. case '-': Subtract(parser); break;
  391. default:
  392. looping = false;
  393. }
  394. }
  395. }
  396. static void Term(DataParser& parser)
  397. {
  398. Factor(parser);
  399. bool looping = true;
  400. while (looping)
  401. {
  402. switch (parser.Look())
  403. {
  404. case '*': Multiply(parser); break;
  405. case '/': Divide(parser); break;
  406. default:
  407. looping = false;
  408. }
  409. }
  410. }
  411. static void Factor(DataParser& parser)
  412. {
  413. const char c = parser.Look();
  414. if (c == '(')
  415. {
  416. parser.Match('(');
  417. Expression(parser);
  418. parser.Match(')');
  419. }
  420. else if (c == '\'')
  421. {
  422. parser.Match('\'', false);
  423. StringLiteral(parser);
  424. parser.Match('\'');
  425. }
  426. else if (c == '!')
  427. {
  428. Not(parser);
  429. parser.SkipWhitespace();
  430. }
  431. else if (c == '-' || (c >= '0' && c <= '9'))
  432. {
  433. NumberLiteral(parser);
  434. parser.SkipWhitespace();
  435. }
  436. else if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
  437. {
  438. Variable(parser);
  439. parser.SkipWhitespace();
  440. }
  441. else
  442. parser.Expected("literal, variable name, parenthesis, or '!'");
  443. }
  444. static void NumberLiteral(DataParser& parser)
  445. {
  446. String str;
  447. bool first_match = false;
  448. bool has_dot = false;
  449. char c = parser.Look();
  450. if (c == '-')
  451. {
  452. str += c;
  453. c = parser.Next();
  454. }
  455. while ((c >= '0' && c <= '9') || (c == '.' && !has_dot))
  456. {
  457. first_match = true;
  458. str += c;
  459. if (c == '.')
  460. has_dot = true;
  461. c = parser.Next();
  462. }
  463. if (!first_match)
  464. {
  465. parser.Error(CreateString(100, "Invalid number literal. Expected '0-9' or '.' but found '%c'.", c));
  466. return;
  467. }
  468. const double number = FromString(str, 0.0);
  469. parser.Emit(Instruction::Literal, Variant(number));
  470. }
  471. static void StringLiteral(DataParser& parser)
  472. {
  473. String str;
  474. char c = parser.Look();
  475. char c_prev = '\0';
  476. while (c != '\0' && (c != '\'' || c_prev == '\\'))
  477. {
  478. if (c_prev == '\\' && (c == '\\' || c == '\'')) {
  479. str.pop_back();
  480. c_prev = '\0';
  481. }
  482. else {
  483. c_prev = c;
  484. }
  485. str += c;
  486. c = parser.Next();
  487. }
  488. parser.Emit(Instruction::Literal, Variant(str));
  489. }
  490. static void Variable(DataParser& parser)
  491. {
  492. String name = VariableName(parser);
  493. if (name.empty()) {
  494. parser.Error("Expected a variable but got an empty name.");
  495. return;
  496. }
  497. // Keywords are parsed like variables, but are really literals.
  498. // Check for them here.
  499. if (name == "true")
  500. parser.Emit(Instruction::Literal, Variant(true));
  501. else if (name == "false")
  502. parser.Emit(Instruction::Literal, Variant(false));
  503. else
  504. parser.Variable(name);
  505. }
  506. static void Add(DataParser& parser)
  507. {
  508. parser.Match('+');
  509. parser.Push();
  510. Term(parser);
  511. parser.Pop(Register::L);
  512. parser.Emit(Instruction::Add);
  513. }
  514. static void Subtract(DataParser& parser)
  515. {
  516. parser.Match('-');
  517. parser.Push();
  518. Term(parser);
  519. parser.Pop(Register::L);
  520. parser.Emit(Instruction::Subtract);
  521. }
  522. static void Multiply(DataParser& parser)
  523. {
  524. parser.Match('*');
  525. parser.Push();
  526. Factor(parser);
  527. parser.Pop(Register::L);
  528. parser.Emit(Instruction::Multiply);
  529. }
  530. static void Divide(DataParser& parser)
  531. {
  532. parser.Match('/');
  533. parser.Push();
  534. Factor(parser);
  535. parser.Pop(Register::L);
  536. parser.Emit(Instruction::Divide);
  537. }
  538. static void Not(DataParser& parser)
  539. {
  540. parser.Match('!');
  541. Factor(parser);
  542. parser.Emit(Instruction::Not);
  543. }
  544. static void Or(DataParser& parser)
  545. {
  546. // We already skipped the first '|' during expression
  547. parser.Match('|');
  548. parser.Push();
  549. Relational(parser);
  550. parser.Pop(Register::L);
  551. parser.Emit(Instruction::Or);
  552. }
  553. static void And(DataParser& parser)
  554. {
  555. parser.Match('&', false);
  556. parser.Match('&');
  557. parser.Push();
  558. Relational(parser);
  559. parser.Pop(Register::L);
  560. parser.Emit(Instruction::And);
  561. }
  562. static void Less(DataParser& parser)
  563. {
  564. Instruction instruction = Instruction::Less;
  565. parser.Match('<', false);
  566. if (parser.Look() == '=') {
  567. parser.Match('=');
  568. instruction = Instruction::LessEq;
  569. }
  570. else {
  571. parser.SkipWhitespace();
  572. }
  573. parser.Push();
  574. Additive(parser);
  575. parser.Pop(Register::L);
  576. parser.Emit(instruction);
  577. }
  578. static void Greater(DataParser& parser)
  579. {
  580. Instruction instruction = Instruction::Greater;
  581. parser.Match('>', false);
  582. if (parser.Look() == '=') {
  583. parser.Match('=');
  584. instruction = Instruction::GreaterEq;
  585. }
  586. else {
  587. parser.SkipWhitespace();
  588. }
  589. parser.Push();
  590. Additive(parser);
  591. parser.Pop(Register::L);
  592. parser.Emit(instruction);
  593. }
  594. static void Equal(DataParser& parser)
  595. {
  596. parser.Match('=', false);
  597. parser.Match('=');
  598. parser.Push();
  599. Additive(parser);
  600. parser.Pop(Register::L);
  601. parser.Emit(Instruction::Equal);
  602. }
  603. static void NotEqual(DataParser& parser)
  604. {
  605. parser.Match('!', false);
  606. parser.Match('=');
  607. parser.Push();
  608. Additive(parser);
  609. parser.Pop(Register::L);
  610. parser.Emit(Instruction::NotEqual);
  611. }
  612. static void Ternary(DataParser& parser)
  613. {
  614. parser.Match('?');
  615. parser.Push();
  616. Expression(parser);
  617. parser.Push();
  618. parser.Match(':');
  619. Expression(parser);
  620. parser.Pop(Register::C);
  621. parser.Pop(Register::L);
  622. parser.Emit(Instruction::Ternary);
  623. }
  624. static void Function(DataParser& parser, Instruction function_type, const String& func_name)
  625. {
  626. RMLUI_ASSERT(function_type == Instruction::TransformFnc || function_type == Instruction::EventFnc);
  627. // We already matched the variable name (and '|' for transform functions)
  628. if (parser.Look() == '(')
  629. {
  630. int num_arguments = 0;
  631. bool looping = true;
  632. parser.Match('(');
  633. if (parser.Look() == ')') {
  634. parser.Match(')');
  635. looping = false;
  636. }
  637. else
  638. parser.Push();
  639. while (looping)
  640. {
  641. num_arguments += 1;
  642. Expression(parser);
  643. parser.Push();
  644. switch (parser.Look()) {
  645. case ')': parser.Match(')'); looping = false; break;
  646. case ',': parser.Match(','); break;
  647. default:
  648. parser.Expected("one of ')' or ','");
  649. looping = false;
  650. }
  651. }
  652. if (num_arguments > 0) {
  653. parser.Arguments(num_arguments);
  654. parser.Pop(Register::R);
  655. }
  656. }
  657. else {
  658. parser.SkipWhitespace();
  659. }
  660. parser.Emit(function_type, Variant(func_name));
  661. }
  662. } // </namespace Parse>
  663. class DataInterpreter {
  664. public:
  665. DataInterpreter(const Program& program, const AddressList& addresses, DataExpressionInterface expression_interface)
  666. : program(program), addresses(addresses), expression_interface(expression_interface) {}
  667. bool Error(String message) const
  668. {
  669. message = "Error during execution. " + message;
  670. Log::Message(Log::LT_WARNING, message.c_str());
  671. RMLUI_ERROR;
  672. return false;
  673. }
  674. bool Run()
  675. {
  676. bool success = true;
  677. for (size_t i = 0; i < program.size(); i++)
  678. {
  679. if (!Execute(program[i].instruction, program[i].data))
  680. {
  681. success = false;
  682. break;
  683. }
  684. }
  685. if(success && !stack.empty())
  686. Log::Message(Log::LT_WARNING, "Possible data interpreter stack corruption. Stack size is %d at end of execution (should be zero).", stack.size());
  687. if(!success)
  688. {
  689. String program_str = DumpProgram();
  690. Log::Message(Log::LT_WARNING, "Failed to execute program with %d instructions:", program.size());
  691. Log::Message(Log::LT_WARNING, program_str.c_str());
  692. }
  693. return success;
  694. }
  695. String DumpProgram() const
  696. {
  697. String str;
  698. for (size_t i = 0; i < program.size(); i++)
  699. {
  700. String instruction_str = program[i].data.Get<String>();
  701. str += CreateString(50 + instruction_str.size(), " %4d '%c' %s\n", i, char(program[i].instruction), instruction_str.c_str());
  702. }
  703. return str;
  704. }
  705. Variant Result() const {
  706. return R;
  707. }
  708. private:
  709. Variant R, L, C;
  710. Stack<Variant> stack;
  711. Vector<Variant> arguments;
  712. const Program& program;
  713. const AddressList& addresses;
  714. DataExpressionInterface expression_interface;
  715. bool Execute(const Instruction instruction, const Variant& data)
  716. {
  717. auto AnyString = [](const Variant& v1, const Variant& v2) {
  718. return v1.GetType() == Variant::STRING || v2.GetType() == Variant::STRING;
  719. };
  720. switch (instruction)
  721. {
  722. case Instruction::Push:
  723. {
  724. stack.push(std::move(R));
  725. R.Clear();
  726. }
  727. break;
  728. case Instruction::Pop:
  729. {
  730. if (stack.empty())
  731. return Error("Cannot pop stack, it is empty.");
  732. Register reg = Register(data.Get<int>(-1));
  733. switch (reg) {
  734. case Register::R: R = stack.top(); stack.pop(); break;
  735. case Register::L: L = stack.top(); stack.pop(); break;
  736. case Register::C: C = stack.top(); stack.pop(); break;
  737. default:
  738. return Error(CreateString(50, "Invalid register %d.", int(reg)));
  739. }
  740. }
  741. break;
  742. case Instruction::Literal:
  743. {
  744. R = data;
  745. }
  746. break;
  747. case Instruction::Variable:
  748. {
  749. size_t variable_index = size_t(data.Get<int>(-1));
  750. if (variable_index < addresses.size())
  751. R = expression_interface.GetValue(addresses[variable_index]);
  752. else
  753. return Error("Variable address not found.");
  754. }
  755. break;
  756. case Instruction::Add:
  757. {
  758. if (AnyString(L, R))
  759. R = Variant(L.Get<String>() + R.Get<String>());
  760. else
  761. R = Variant(L.Get<double>() + R.Get<double>());
  762. }
  763. break;
  764. case Instruction::Subtract: R = Variant(L.Get<double>() - R.Get<double>()); break;
  765. case Instruction::Multiply: R = Variant(L.Get<double>() * R.Get<double>()); break;
  766. case Instruction::Divide: R = Variant(L.Get<double>() / R.Get<double>()); break;
  767. case Instruction::Not: R = Variant(!R.Get<bool>()); break;
  768. case Instruction::And: R = Variant(L.Get<bool>() && R.Get<bool>()); break;
  769. case Instruction::Or: R = Variant(L.Get<bool>() || R.Get<bool>()); break;
  770. case Instruction::Less: R = Variant(L.Get<double>() < R.Get<double>()); break;
  771. case Instruction::LessEq: R = Variant(L.Get<double>() <= R.Get<double>()); break;
  772. case Instruction::Greater: R = Variant(L.Get<double>() > R.Get<double>()); break;
  773. case Instruction::GreaterEq: R = Variant(L.Get<double>() >= R.Get<double>()); break;
  774. case Instruction::Equal:
  775. {
  776. if (AnyString(L, R))
  777. R = Variant(L.Get<String>() == R.Get<String>());
  778. else
  779. R = Variant(L.Get<double>() == R.Get<double>());
  780. }
  781. break;
  782. case Instruction::NotEqual:
  783. {
  784. if (AnyString(L, R))
  785. R = Variant(L.Get<String>() != R.Get<String>());
  786. else
  787. R = Variant(L.Get<double>() != R.Get<double>());
  788. }
  789. break;
  790. case Instruction::Ternary:
  791. {
  792. if (L.Get<bool>())
  793. R = C;
  794. }
  795. break;
  796. case Instruction::Arguments:
  797. {
  798. if (!arguments.empty())
  799. return Error("Argument stack is not empty.");
  800. int num_arguments = data.Get<int>(-1);
  801. if (num_arguments < 0)
  802. return Error("Invalid number of arguments.");
  803. if (stack.size() < size_t(num_arguments))
  804. return Error(CreateString(100, "Cannot pop %d arguments, stack contains only %d elements.", num_arguments, stack.size()));
  805. arguments.resize(num_arguments);
  806. for (int i = num_arguments - 1; i >= 0; i--)
  807. {
  808. arguments[i] = std::move(stack.top());
  809. stack.pop();
  810. }
  811. }
  812. break;
  813. case Instruction::TransformFnc:
  814. {
  815. const String function_name = data.Get<String>();
  816. if (!expression_interface.CallTransform(function_name, R, arguments))
  817. {
  818. String arguments_str;
  819. for (size_t i = 0; i < arguments.size(); i++)
  820. {
  821. arguments_str += arguments[i].Get<String>();
  822. if (i < arguments.size() - 1)
  823. arguments_str += ", ";
  824. }
  825. Error(CreateString(50 + function_name.size() + arguments_str.size(), "Failed to execute data function: %s(%s)", function_name.c_str(), arguments_str.c_str()));
  826. }
  827. arguments.clear();
  828. }
  829. break;
  830. case Instruction::EventFnc:
  831. {
  832. const String function_name = data.Get<String>();
  833. if (!expression_interface.EventCallback(function_name, arguments))
  834. {
  835. String arguments_str;
  836. for (size_t i = 0; i < arguments.size(); i++)
  837. {
  838. arguments_str += arguments[i].Get<String>();
  839. if (i < arguments.size() - 1)
  840. arguments_str += ", ";
  841. }
  842. Error(CreateString(50 + function_name.size() + arguments_str.size(), "Failed to execute event callback: %s(%s)", function_name.c_str(), arguments_str.c_str()));
  843. }
  844. arguments.clear();
  845. }
  846. break;
  847. case Instruction::Assign:
  848. {
  849. size_t variable_index = size_t(data.Get<int>(-1));
  850. if (variable_index < addresses.size())
  851. {
  852. if (!expression_interface.SetValue(addresses[variable_index], R))
  853. return Error("Could not assign to variable.");
  854. }
  855. else
  856. return Error("Variable address not found.");
  857. }
  858. break;
  859. default:
  860. RMLUI_ERRORMSG("Instruction not implemented."); break;
  861. }
  862. return true;
  863. }
  864. };
  865. #ifdef RMLUI_TESTS_ENABLED
  866. struct TestParser {
  867. TestParser() : model(type_register.GetTransformFuncRegister())
  868. {
  869. DataModelConstructor handle(&model, &type_register);
  870. handle.Bind("radius", &radius);
  871. handle.Bind("color_name", &color_name);
  872. handle.BindFunc("color_value", [this](Variant& variant) {
  873. variant = ToString(color_value);
  874. });
  875. String result;
  876. result = TestExpression("!!10 - 1 ? 'hello' : 'world' | to_upper", "WORLD");
  877. result = TestExpression("(color_name) + (': rgba(' + color_value + ')')", "color: rgba(180, 100, 255, 255)");
  878. result = TestExpression("'hello world' | to_upper(5 + 12 == 17 ? 'yes' : 'no', 9*2)", "HELLO WORLD");
  879. result = TestExpression("true == false", "0");
  880. result = TestExpression("true != false", "1");
  881. result = TestExpression("true", "1");
  882. result = TestExpression("true || false ? true && 3==1+2 ? 'Absolutely!' : 'well..' : 'no'", "Absolutely!");
  883. result = TestExpression(R"('It\'s a fit')", R"(It's a fit)");
  884. result = TestExpression("2 * 2", "4");
  885. result = TestExpression("50000 / 1500", "33.333");
  886. result = TestExpression("5*1+2", "7");
  887. result = TestExpression("5*(1+2)", "15");
  888. result = TestExpression("2*(-2)/4", "-1");
  889. result = TestExpression("5.2 + 19 + 'px'", "24.2px");
  890. result = TestExpression("(radius | format(2)) + 'm'", "8.70m");
  891. result = TestExpression("radius < 10.5 ? 'smaller' : 'larger'", "smaller");
  892. TestAssignment("radius = 15");
  893. result = TestExpression("radius < 10.5 ? 'smaller' : 'larger'", "larger");
  894. TestAssignment("radius = 4; color_name = 'image-color'");
  895. result = TestExpression("radius == 4 && color_name == 'image-color'", "1");
  896. result = TestExpression("5 == 1 + 2*2 || 8 == 1 + 4 ? 'yes' : 'no'", "yes");
  897. result = TestExpression("!!('fa' + 'lse')", "0");
  898. result = TestExpression("!!('tr' + 'ue')", "1");
  899. result = TestExpression("'fox' + 'dog' ? 'FoxyDog' : 'hot' + 'dog' | to_upper", "HOTDOG");
  900. result = TestExpression("3.62345 | round", "4");
  901. result = TestExpression("3.62345 | format(0)", "4");
  902. result = TestExpression("3.62345 | format(2)", "3.62");
  903. result = TestExpression("3.62345 | format(10)", "3.6234500000");
  904. result = TestExpression("3.62345 | format(10, true)", "3.62345");
  905. result = TestExpression("3.62345 | round | format(2)", "4.00");
  906. result = TestExpression("3.0001 | format(2, false)", "3.00");
  907. result = TestExpression("3.0001 | format(2, true)", "3");
  908. result = TestExpression("0.2 + 3.42345 | round", "4");
  909. result = TestExpression("(3.42345 | round) + 0.2", "3.2");
  910. result = TestExpression("(3.42345 | format(0)) + 0.2", "30.2"); // Here, format(0) returns a string, so the + means string concatenation.
  911. }
  912. String TestExpression(String expression, String expected = String())
  913. {
  914. String result;
  915. DataExpressionInterface interface(&model, nullptr);
  916. DataParser parser(expression, interface);
  917. if (parser.Parse(false))
  918. {
  919. Program program = parser.ReleaseProgram();
  920. AddressList addresses = parser.ReleaseAddresses();
  921. DataInterpreter interpreter(program, addresses, interface);
  922. if (interpreter.Run())
  923. result = interpreter.Result().Get<String>();
  924. if (!expected.empty() && result != expected)
  925. {
  926. String program_str = interpreter.DumpProgram();
  927. Log::Message(Log::LT_WARNING, "%s", program_str.c_str());
  928. RMLUI_ERRORMSG("Got unexpected data parser result.");
  929. }
  930. }
  931. else
  932. {
  933. RMLUI_ERRORMSG("Could not parse expression.");
  934. }
  935. return result;
  936. };
  937. bool TestAssignment(String expression)
  938. {
  939. bool result = false;
  940. DataExpressionInterface interface(&model, nullptr);
  941. DataParser parser(expression, interface);
  942. if (parser.Parse(true))
  943. {
  944. Program program = parser.ReleaseProgram();
  945. AddressList addresses = parser.ReleaseAddresses();
  946. DataInterpreter interpreter(program, addresses, interface);
  947. result = interpreter.Run();
  948. }
  949. RMLUI_ASSERT(result);
  950. return result;
  951. };
  952. DataTypeRegister type_register;
  953. DataModel model;
  954. float radius = 8.7f;
  955. String color_name = "color";
  956. Colourb color_value = Colourb(180, 100, 255);
  957. };
  958. static TestParser test_parser;
  959. #endif
  960. DataExpression::DataExpression(String expression) : expression(expression) {}
  961. DataExpression::~DataExpression()
  962. {
  963. }
  964. bool DataExpression::Parse(const DataExpressionInterface& expression_interface, bool is_assignment_expression)
  965. {
  966. DataParser parser(expression, expression_interface);
  967. if (!parser.Parse(is_assignment_expression))
  968. return false;
  969. program = parser.ReleaseProgram();
  970. addresses = parser.ReleaseAddresses();
  971. return true;
  972. }
  973. bool DataExpression::Run(const DataExpressionInterface& expression_interface, Variant& out_value)
  974. {
  975. DataInterpreter interpreter(program, addresses, expression_interface);
  976. if (!interpreter.Run())
  977. return false;
  978. out_value = interpreter.Result();
  979. return true;
  980. }
  981. StringList DataExpression::GetVariableNameList() const
  982. {
  983. StringList list;
  984. list.reserve(addresses.size());
  985. for (const DataAddress& address : addresses)
  986. {
  987. if (!address.empty())
  988. list.push_back(address[0].name);
  989. }
  990. return list;
  991. }
  992. DataExpressionInterface::DataExpressionInterface(DataModel* data_model, Element* element, Event* event) : data_model(data_model), element(element), event(event)
  993. {}
  994. DataAddress DataExpressionInterface::ParseAddress(const String& address_str) const
  995. {
  996. if (address_str.size() >= 4 && address_str[0] == 'e' && address_str[1] == 'v' && address_str[2] == '.')
  997. return DataAddress{ DataAddressEntry("ev"), DataAddressEntry(address_str.substr(3)) };
  998. return data_model ? data_model->ResolveAddress(address_str, element) : DataAddress();
  999. }
  1000. Variant DataExpressionInterface::GetValue(const DataAddress& address) const
  1001. {
  1002. Variant result;
  1003. if(event && address.size() == 2 && address.front().name == "ev")
  1004. {
  1005. auto& parameters = event->GetParameters();
  1006. auto it = parameters.find(address.back().name);
  1007. if (it != parameters.end())
  1008. result = it->second;
  1009. }
  1010. else if (data_model)
  1011. {
  1012. data_model->GetVariableInto(address, result);
  1013. }
  1014. return result;
  1015. }
  1016. bool DataExpressionInterface::SetValue(const DataAddress& address, const Variant& value) const
  1017. {
  1018. bool result = false;
  1019. if (data_model && !address.empty())
  1020. {
  1021. if (DataVariable variable = data_model->GetVariable(address))
  1022. result = variable.Set(value);
  1023. if (result)
  1024. data_model->DirtyVariable(address.front().name);
  1025. }
  1026. return result;
  1027. }
  1028. bool DataExpressionInterface::CallTransform(const String& name, Variant& inout_variant, const VariantList& arguments)
  1029. {
  1030. return data_model ? data_model->CallTransform(name, inout_variant, arguments) : false;
  1031. }
  1032. bool DataExpressionInterface::EventCallback(const String& name, const VariantList& arguments)
  1033. {
  1034. if (!data_model || !event)
  1035. return false;
  1036. const DataEventFunc* func = data_model->GetEventCallback(name);
  1037. if (!func || !*func)
  1038. return false;
  1039. DataModelHandle handle(data_model);
  1040. func->operator()(handle, *event, arguments);
  1041. return true;
  1042. }
  1043. } // namespace Rml