DataExpression.cpp 31 KB

1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071727374757677787980818283848586878889909192939495969798991001011021031041051061071081091101111121131141151161171181191201211221231241251261271281291301311321331341351361371381391401411421431441451461471481491501511521531541551561571581591601611621631641651661671681691701711721731741751761771781791801811821831841851861871881891901911921931941951961971981992002012022032042052062072082092102112122132142152162172182192202212222232242252262272282292302312322332342352362372382392402412422432442452462472482492502512522532542552562572582592602612622632642652662672682692702712722732742752762772782792802812822832842852862872882892902912922932942952962972982993003013023033043053063073083093103113123133143153163173183193203213223233243253263273283293303313323333343353363373383393403413423433443453463473483493503513523533543553563573583593603613623633643653663673683693703713723733743753763773783793803813823833843853863873883893903913923933943953963973983994004014024034044054064074084094104114124134144154164174184194204214224234244254264274284294304314324334344354364374384394404414424434444454464474484494504514524534544554564574584594604614624634644654664674684694704714724734744754764774784794804814824834844854864874884894904914924934944954964974984995005015025035045055065075085095105115125135145155165175185195205215225235245255265275285295305315325335345355365375385395405415425435445455465475485495505515525535545555565575585595605615625635645655665675685695705715725735745755765775785795805815825835845855865875885895905915925935945955965975985996006016026036046056066076086096106116126136146156166176186196206216226236246256266276286296306316326336346356366376386396406416426436446456466476486496506516526536546556566576586596606616626636646656666676686696706716726736746756766776786796806816826836846856866876886896906916926936946956966976986997007017027037047057067077087097107117127137147157167177187197207217227237247257267277287297307317327337347357367377387397407417427437447457467477487497507517527537547557567577587597607617627637647657667677687697707717727737747757767777787797807817827837847857867877887897907917927937947957967977987998008018028038048058068078088098108118128138148158168178188198208218228238248258268278288298308318328338348358368378388398408418428438448458468478488498508518528538548558568578588598608618628638648658668678688698708718728738748758768778788798808818828838848858868878888898908918928938948958968978988999009019029039049059069079089099109119129139149159169179189199209219229239249259269279289299309319329339349359369379389399409419429439449459469479489499509519529539549559569579589599609619629639649659669679689699709719729739749759769779789799809819829839849859869879889899909919929939949959969979989991000100110021003100410051006100710081009101010111012101310141015101610171018101910201021102210231024102510261027102810291030103110321033103410351036103710381039104010411042104310441045104610471048104910501051105210531054105510561057105810591060106110621063106410651066106710681069107010711072107310741075107610771078107910801081108210831084108510861087108810891090109110921093109410951096109710981099110011011102110311041105110611071108110911101111111211131114111511161117111811191120112111221123112411251126112711281129113011311132113311341135113611371138113911401141114211431144114511461147114811491150115111521153115411551156115711581159116011611162116311641165116611671168116911701171117211731174117511761177117811791180118111821183118411851186118711881189119011911192119311941195119611971198119912001201120212031204120512061207120812091210121112121213121412151216121712181219122012211222122312241225122612271228122912301231
  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-2023 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/DataModelHandle.h"
  30. #include "../../Include/RmlUi/Core/Event.h"
  31. #include "../../Include/RmlUi/Core/Variant.h"
  32. #include "DataModel.h"
  33. #include <stack>
  34. #ifdef _MSC_VER
  35. #pragma warning(default : 4061)
  36. #pragma warning(default : 4062)
  37. #endif
  38. namespace Rml {
  39. class DataParser;
  40. /*
  41. The abstract machine for RmlUi data expressions.
  42. The machine can execute a program which contains a list of instructions listed below.
  43. The abstract machine has three registers:
  44. R Typically results and right-hand side arguments.
  45. L Typically left-hand side arguments.
  46. C Typically center arguments (eg. in ternary operator).
  47. And a stack:
  48. S The program stack.
  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 {
  56. // clang-format off
  57. // Assignment (register/stack) = Read (register R/L/C, instruction data D, or stack)
  58. Push = 'P', // S+ = R
  59. Pop = 'o', // <R/L/C> = S- (D determines R/L/C)
  60. Literal = 'D', // R = D
  61. Variable = 'V', // R = DataModel.GetVariable(D) (D is an index into the variable address list)
  62. Add = '+', // R = L + R
  63. Subtract = '-', // R = L - R
  64. Multiply = '*', // R = L * R
  65. Divide = '/', // R = L / R
  66. Not = '!', // R = !R
  67. And = '&', // R = L && R
  68. Or = '|', // R = L || R
  69. Less = '<', // R = L < R
  70. LessEq = 'L', // R = L <= R
  71. Greater = '>', // R = L > R
  72. GreaterEq = 'G', // R = L >= R
  73. Equal = '=', // R = L == R
  74. NotEqual = 'N', // R = L != R
  75. Ternary = '?', // R = L ? C : R
  76. NumArguments = '#', // R = D (Contains the num. arguments currently on the stack, immediately followed by a 'T' or 'E' instruction)
  77. TransformFnc = 'T', // R = DataModel.Execute(D, A) where A = S[TOP - R, TOP]; S -= R; (D determines function name, input R the num. arguments, A the arguments)
  78. EventFnc = 'E', // DataModel.EventCallback(D, A); S -= R;
  79. Assign = 'A', // DataModel.SetVariable(D, R)
  80. DynamicVariable = 'Y', // DataModel.GetVariable(DataModel.ParseAddress(R)) (Looks up a variable by path in R)
  81. CastToInt = 'I' // R = (int)R
  82. // clang-format on
  83. };
  84. enum class Register {
  85. R,
  86. L,
  87. C,
  88. };
  89. struct InstructionData {
  90. Instruction instruction;
  91. Variant data;
  92. };
  93. struct ProgramState {
  94. size_t program_length;
  95. int stack_size;
  96. };
  97. namespace Parse {
  98. static void Assignment(DataParser& parser);
  99. static void Expression(DataParser& parser);
  100. } // namespace Parse
  101. class DataParser {
  102. public:
  103. DataParser(String expression, DataExpressionInterface expression_interface) :
  104. expression(std::move(expression)), expression_interface(expression_interface)
  105. {}
  106. char Look()
  107. {
  108. if (reached_end)
  109. return '\0';
  110. return expression[index];
  111. }
  112. bool Match(char c, bool skip_whitespace = true)
  113. {
  114. if (c == Look())
  115. {
  116. Next();
  117. if (skip_whitespace)
  118. SkipWhitespace();
  119. return true;
  120. }
  121. Expected(c);
  122. return false;
  123. }
  124. char Next()
  125. {
  126. ++index;
  127. if (index >= expression.size())
  128. reached_end = true;
  129. return Look();
  130. }
  131. void SkipWhitespace()
  132. {
  133. char c = Look();
  134. while (StringUtilities::IsWhitespace(c))
  135. c = Next();
  136. }
  137. void Error(const String& message)
  138. {
  139. parse_error = true;
  140. Log::Message(Log::LT_WARNING, "Error in data expression at %zu. %s", index, message.c_str());
  141. Log::Message(Log::LT_WARNING, " \"%s\"", expression.c_str());
  142. const size_t cursor_offset = size_t(index) + 3;
  143. const String cursor_string = String(cursor_offset, ' ') + '^';
  144. Log::Message(Log::LT_WARNING, "%s", cursor_string.c_str());
  145. }
  146. void Expected(const String& expected_symbols)
  147. {
  148. const char c = Look();
  149. if (c == '\0')
  150. Error(CreateString("Expected %s but found end of string.", expected_symbols.c_str()));
  151. else
  152. Error(CreateString("Expected %s but found character '%c'.", expected_symbols.c_str(), c));
  153. }
  154. void Expected(char expected) { Expected(String(1, '\'') + expected + '\''); }
  155. bool Parse(bool is_assignment_expression)
  156. {
  157. program.clear();
  158. variable_addresses.clear();
  159. index = 0;
  160. reached_end = false;
  161. parse_error = false;
  162. if (expression.empty())
  163. reached_end = true;
  164. SkipWhitespace();
  165. if (is_assignment_expression)
  166. Parse::Assignment(*this);
  167. else
  168. Parse::Expression(*this);
  169. if (!reached_end)
  170. {
  171. parse_error = true;
  172. Error(CreateString("Unexpected character '%c' encountered.", Look()));
  173. }
  174. if (!parse_error && program_stack_size != 0)
  175. {
  176. parse_error = true;
  177. Error(CreateString("Internal parser error, inconsistent stack operations. Stack size is %d at parse end.", program_stack_size));
  178. }
  179. return !parse_error;
  180. }
  181. Program ReleaseProgram()
  182. {
  183. RMLUI_ASSERT(!parse_error);
  184. return std::move(program);
  185. }
  186. AddressList ReleaseAddresses()
  187. {
  188. RMLUI_ASSERT(!parse_error);
  189. return std::move(variable_addresses);
  190. }
  191. void Emit(Instruction instruction, Variant data = Variant())
  192. {
  193. RMLUI_ASSERTMSG(instruction != Instruction::Push && instruction != Instruction::Pop && instruction != Instruction::NumArguments &&
  194. instruction != Instruction::TransformFnc && instruction != Instruction::EventFnc && instruction != Instruction::Variable &&
  195. instruction != Instruction::Assign,
  196. "Use Push(), Pop(), Function(), Variable(), and Assign() procedures for stack manipulation and variable instructions.");
  197. program.push_back(InstructionData{instruction, std::move(data)});
  198. }
  199. void Push()
  200. {
  201. program_stack_size += 1;
  202. program.push_back(InstructionData{Instruction::Push, Variant()});
  203. }
  204. void Pop(Register destination)
  205. {
  206. if (program_stack_size <= 0)
  207. {
  208. Error("Internal parser error: Tried to pop an empty stack.");
  209. return;
  210. }
  211. program_stack_size -= 1;
  212. program.push_back(InstructionData{Instruction::Pop, Variant(int(destination))});
  213. }
  214. void Function(Instruction instruction, int num_arguments, String&& name)
  215. {
  216. RMLUI_ASSERT(instruction == Instruction::TransformFnc || instruction == Instruction::EventFnc);
  217. RMLUI_ASSERT(num_arguments >= 0);
  218. if (program_stack_size < num_arguments)
  219. {
  220. Error(CreateString("Internal parser error: Popping %d arguments, but the stack contains only %d elements.", num_arguments,
  221. program_stack_size));
  222. return;
  223. }
  224. program_stack_size -= num_arguments;
  225. program.push_back(InstructionData{Instruction::NumArguments, Variant(int(num_arguments))});
  226. program.push_back(InstructionData{instruction, Variant(std::move(name))});
  227. }
  228. void Variable(const String& data_address) { VariableGetSet(data_address, false); }
  229. void Assign(const String& data_address) { VariableGetSet(data_address, true); }
  230. ProgramState GetProgramState() { return ProgramState{program.size(), program_stack_size}; }
  231. void SetProgramState(const ProgramState& state)
  232. {
  233. RMLUI_ASSERT(state.program_length <= program.size());
  234. program.resize(state.program_length);
  235. program_stack_size = state.stack_size;
  236. }
  237. bool AddVariableAddress(const String& name)
  238. {
  239. DataAddress address = expression_interface.ParseAddress(name);
  240. if (address.empty())
  241. {
  242. return false;
  243. }
  244. variable_addresses.push_back(std::move(address));
  245. return true;
  246. }
  247. private:
  248. void VariableGetSet(const String& name, bool is_assignment)
  249. {
  250. DataAddress address = expression_interface.ParseAddress(name);
  251. if (address.empty())
  252. {
  253. Error(CreateString("Could not find data variable with name '%s'.", name.c_str()));
  254. return;
  255. }
  256. int index = int(variable_addresses.size());
  257. variable_addresses.push_back(std::move(address));
  258. program.push_back(InstructionData{is_assignment ? Instruction::Assign : Instruction::Variable, Variant(int(index))});
  259. }
  260. const String expression;
  261. DataExpressionInterface expression_interface;
  262. size_t index = 0;
  263. bool reached_end = false;
  264. bool parse_error = true;
  265. int program_stack_size = 0;
  266. Program program;
  267. AddressList variable_addresses;
  268. };
  269. namespace Parse {
  270. // Forward declare all parse functions.
  271. static void Assignment(DataParser& parser);
  272. // The following in order of precedence.
  273. static void Expression(DataParser& parser);
  274. static void Relational(DataParser& parser);
  275. static void Additive(DataParser& parser);
  276. static void Term(DataParser& parser);
  277. static void Factor(DataParser& parser);
  278. static void NumberLiteral(DataParser& parser);
  279. static void StringLiteral(DataParser& parser);
  280. static String VariableExpression(DataParser& parser, const String& address_prefix);
  281. static void VariableOrFunction(DataParser& parser);
  282. static void Add(DataParser& parser);
  283. static void Subtract(DataParser& parser);
  284. static void Multiply(DataParser& parser);
  285. static void Divide(DataParser& parser);
  286. static void Not(DataParser& parser);
  287. static void And(DataParser& parser);
  288. static void Or(DataParser& parser);
  289. static void Less(DataParser& parser);
  290. static void Greater(DataParser& parser);
  291. static void Equal(DataParser& parser);
  292. static void NotEqual(DataParser& parser);
  293. static void Ternary(DataParser& parser);
  294. static void Function(DataParser& parser, Instruction function_type, String&& name, bool first_argument_piped);
  295. // Helper functions
  296. static bool IsVariableCharacter(char c, bool is_first_character)
  297. {
  298. const bool is_alpha = (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
  299. if (is_first_character)
  300. return is_alpha;
  301. if (is_alpha || (c >= '0' && c <= '9'))
  302. return true;
  303. for (char valid_char : "_.")
  304. {
  305. if (c == valid_char && valid_char != '\0')
  306. return true;
  307. }
  308. return false;
  309. }
  310. static String VariableOrFunctionName(DataParser& parser, bool* out_valid_function_name)
  311. {
  312. String name;
  313. bool is_first_character = true;
  314. char c = parser.Look();
  315. while (IsVariableCharacter(c, is_first_character))
  316. {
  317. name += c;
  318. c = parser.Next();
  319. is_first_character = false;
  320. }
  321. if (out_valid_function_name)
  322. *out_valid_function_name = (name.find_first_of(". ") == String::npos);
  323. return name;
  324. }
  325. static String FindNumberLiteral(DataParser& parser, bool silent)
  326. {
  327. String str;
  328. bool first_match = false;
  329. bool has_dot = false;
  330. char c = parser.Look();
  331. if (c == '-')
  332. {
  333. str += c;
  334. c = parser.Next();
  335. }
  336. while ((c >= '0' && c <= '9') || (c == '.' && !has_dot))
  337. {
  338. first_match = true;
  339. str += c;
  340. if (c == '.')
  341. has_dot = true;
  342. c = parser.Next();
  343. }
  344. if (!first_match)
  345. {
  346. if (!silent)
  347. parser.Error(CreateString("Invalid number literal. Expected '0-9' or '.' but found '%c'.", c));
  348. return String();
  349. }
  350. return str;
  351. }
  352. // Parser functions
  353. static void Assignment(DataParser& parser)
  354. {
  355. bool looping = true;
  356. while (looping)
  357. {
  358. if (parser.Look() != '\0')
  359. {
  360. String variable_name = VariableOrFunctionName(parser, nullptr);
  361. if (variable_name.empty())
  362. {
  363. parser.Error("Expected a variable for assignment but got an empty name.");
  364. return;
  365. }
  366. parser.SkipWhitespace();
  367. const char c = parser.Look();
  368. if (c == '=')
  369. {
  370. parser.Match('=');
  371. Expression(parser);
  372. parser.Assign(variable_name);
  373. }
  374. else if (c == '(' || c == ';' || c == '\0')
  375. {
  376. Function(parser, Instruction::EventFnc, std::move(variable_name), false);
  377. }
  378. else
  379. {
  380. parser.Expected("one of = ; ( or end of string");
  381. return;
  382. }
  383. }
  384. const char c = parser.Look();
  385. if (c == ';')
  386. parser.Match(';');
  387. else if (c == '\0')
  388. looping = false;
  389. else
  390. {
  391. parser.Expected("';' or end of string");
  392. looping = false;
  393. }
  394. }
  395. }
  396. static void Expression(DataParser& parser)
  397. {
  398. Relational(parser);
  399. bool looping = true;
  400. while (looping)
  401. {
  402. switch (parser.Look())
  403. {
  404. case '&': And(parser); break;
  405. case '|':
  406. {
  407. parser.Match('|', false);
  408. if (parser.Look() == '|')
  409. Or(parser);
  410. else
  411. {
  412. parser.Push();
  413. parser.SkipWhitespace();
  414. bool valid_function_name = true;
  415. String name = VariableOrFunctionName(parser, &valid_function_name);
  416. if (name.empty())
  417. {
  418. parser.Error("Expected a transform function name but got an empty name.");
  419. return;
  420. }
  421. if (!valid_function_name)
  422. {
  423. parser.Error("Expected a transform function name but got an invalid name '" + name + "'.");
  424. return;
  425. }
  426. Function(parser, Instruction::TransformFnc, std::move(name), true);
  427. }
  428. }
  429. break;
  430. case '?': Ternary(parser); break;
  431. default: looping = false;
  432. }
  433. }
  434. }
  435. static void Relational(DataParser& parser)
  436. {
  437. Additive(parser);
  438. bool looping = true;
  439. while (looping)
  440. {
  441. switch (parser.Look())
  442. {
  443. case '=': Equal(parser); break;
  444. case '!': NotEqual(parser); break;
  445. case '<': Less(parser); break;
  446. case '>': Greater(parser); break;
  447. default: looping = false;
  448. }
  449. }
  450. }
  451. static void Additive(DataParser& parser)
  452. {
  453. Term(parser);
  454. bool looping = true;
  455. while (looping)
  456. {
  457. switch (parser.Look())
  458. {
  459. case '+': Add(parser); break;
  460. case '-': Subtract(parser); break;
  461. default: looping = false;
  462. }
  463. }
  464. }
  465. static void Term(DataParser& parser)
  466. {
  467. Factor(parser);
  468. bool looping = true;
  469. while (looping)
  470. {
  471. switch (parser.Look())
  472. {
  473. case '*': Multiply(parser); break;
  474. case '/': Divide(parser); break;
  475. default: looping = false;
  476. }
  477. }
  478. }
  479. static void Factor(DataParser& parser)
  480. {
  481. const char c = parser.Look();
  482. if (c == '(')
  483. {
  484. parser.Match('(');
  485. Expression(parser);
  486. parser.Match(')');
  487. }
  488. else if (c == '\'')
  489. {
  490. parser.Match('\'', false);
  491. StringLiteral(parser);
  492. parser.Match('\'');
  493. }
  494. else if (c == '!')
  495. {
  496. Not(parser);
  497. parser.SkipWhitespace();
  498. }
  499. else if (c == '-' || (c >= '0' && c <= '9'))
  500. {
  501. NumberLiteral(parser);
  502. parser.SkipWhitespace();
  503. }
  504. else if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
  505. {
  506. VariableOrFunction(parser);
  507. parser.SkipWhitespace();
  508. }
  509. else
  510. parser.Expected("literal, variable name, function name, parenthesis, or '!'");
  511. }
  512. static void NumberLiteral(DataParser& parser)
  513. {
  514. String str = FindNumberLiteral(parser, false);
  515. if (str.empty())
  516. return;
  517. const double number = FromString(str, 0.0);
  518. parser.Emit(Instruction::Literal, Variant(number));
  519. }
  520. static void StringLiteral(DataParser& parser)
  521. {
  522. String str;
  523. char c = parser.Look();
  524. char c_prev = '\0';
  525. while (c != '\0' && (c != '\'' || c_prev == '\\'))
  526. {
  527. if (c_prev == '\\' && (c == '\\' || c == '\''))
  528. {
  529. str.pop_back();
  530. c_prev = '\0';
  531. }
  532. else
  533. {
  534. c_prev = c;
  535. }
  536. str += c;
  537. c = parser.Next();
  538. }
  539. parser.Emit(Instruction::Literal, Variant(str));
  540. }
  541. static String VariableExpression(DataParser& parser, const String& address_prefix)
  542. {
  543. if (parser.Look() == '[')
  544. {
  545. parser.Next();
  546. String prefix = address_prefix;
  547. prefix.push_back('[');
  548. // Backup program state before trying to parse number inside brackets.
  549. // Could turn out to be expression and needs reparsing
  550. auto backup_state = parser.GetProgramState();
  551. String index = FindNumberLiteral(parser, true);
  552. if (!index.empty() && parser.Look() == ']')
  553. {
  554. parser.Next();
  555. prefix.append(index);
  556. prefix.push_back(']');
  557. return VariableExpression(parser, prefix);
  558. }
  559. else
  560. {
  561. parser.SetProgramState(backup_state);
  562. parser.Emit(Instruction::Literal, Variant(prefix));
  563. parser.Push();
  564. Expression(parser);
  565. parser.Emit(Instruction::CastToInt);
  566. parser.Push();
  567. parser.Match(']');
  568. VariableExpression(parser, "]");
  569. parser.Pop(Register::L);
  570. parser.Emit(Instruction::Add, Variant());
  571. parser.Pop(Register::L);
  572. parser.Emit(Instruction::Add, Variant());
  573. return "";
  574. }
  575. }
  576. else if (parser.Look() == '.')
  577. {
  578. parser.Next();
  579. return VariableExpression(parser, address_prefix + ".");
  580. }
  581. else
  582. {
  583. String next = VariableOrFunctionName(parser, nullptr);
  584. if (next.empty())
  585. {
  586. if (!address_prefix.empty())
  587. parser.Emit(Instruction::Literal, Variant(address_prefix));
  588. return address_prefix;
  589. }
  590. return VariableExpression(parser, address_prefix + next);
  591. }
  592. }
  593. static void VariableOrFunction(DataParser& parser)
  594. {
  595. bool valid_function_name = true;
  596. String name = VariableOrFunctionName(parser, &valid_function_name);
  597. if (name.empty())
  598. {
  599. parser.Error("Expected a variable or function name but got an empty name.");
  600. return;
  601. }
  602. // Keywords are parsed like variables, but are really literals. Check for them here.
  603. if (name == "true")
  604. parser.Emit(Instruction::Literal, Variant(true));
  605. else if (name == "false")
  606. parser.Emit(Instruction::Literal, Variant(false));
  607. else if (parser.Look() == '(')
  608. {
  609. if (!valid_function_name)
  610. {
  611. parser.Error("Invalid function name '" + name + "'.");
  612. return;
  613. }
  614. Function(parser, Instruction::TransformFnc, std::move(name), false);
  615. }
  616. else if (parser.Look() == '[')
  617. {
  618. // Backup program state before trying to parse part inside brackets.
  619. // Could turn out to be expression and needs reparsing
  620. auto backup_state = parser.GetProgramState();
  621. String full_address = VariableExpression(parser, name);
  622. if (!full_address.empty())
  623. {
  624. parser.SetProgramState(backup_state);
  625. parser.Variable(full_address);
  626. }
  627. else
  628. {
  629. // add the root of a variable expression as dependency into the address list
  630. parser.AddVariableAddress(name);
  631. parser.Emit(Instruction::DynamicVariable, Variant());
  632. }
  633. }
  634. else
  635. parser.Variable(name);
  636. }
  637. static void Add(DataParser& parser)
  638. {
  639. parser.Match('+');
  640. parser.Push();
  641. Term(parser);
  642. parser.Pop(Register::L);
  643. parser.Emit(Instruction::Add);
  644. }
  645. static void Subtract(DataParser& parser)
  646. {
  647. parser.Match('-');
  648. parser.Push();
  649. Term(parser);
  650. parser.Pop(Register::L);
  651. parser.Emit(Instruction::Subtract);
  652. }
  653. static void Multiply(DataParser& parser)
  654. {
  655. parser.Match('*');
  656. parser.Push();
  657. Factor(parser);
  658. parser.Pop(Register::L);
  659. parser.Emit(Instruction::Multiply);
  660. }
  661. static void Divide(DataParser& parser)
  662. {
  663. parser.Match('/');
  664. parser.Push();
  665. Factor(parser);
  666. parser.Pop(Register::L);
  667. parser.Emit(Instruction::Divide);
  668. }
  669. static void Not(DataParser& parser)
  670. {
  671. parser.Match('!');
  672. Factor(parser);
  673. parser.Emit(Instruction::Not);
  674. }
  675. static void Or(DataParser& parser)
  676. {
  677. // We already skipped the first '|' during expression
  678. parser.Match('|');
  679. parser.Push();
  680. Relational(parser);
  681. parser.Pop(Register::L);
  682. parser.Emit(Instruction::Or);
  683. }
  684. static void And(DataParser& parser)
  685. {
  686. parser.Match('&', false);
  687. parser.Match('&');
  688. parser.Push();
  689. Relational(parser);
  690. parser.Pop(Register::L);
  691. parser.Emit(Instruction::And);
  692. }
  693. static void Less(DataParser& parser)
  694. {
  695. Instruction instruction = Instruction::Less;
  696. parser.Match('<', false);
  697. if (parser.Look() == '=')
  698. {
  699. parser.Match('=');
  700. instruction = Instruction::LessEq;
  701. }
  702. else
  703. {
  704. parser.SkipWhitespace();
  705. }
  706. parser.Push();
  707. Additive(parser);
  708. parser.Pop(Register::L);
  709. parser.Emit(instruction);
  710. }
  711. static void Greater(DataParser& parser)
  712. {
  713. Instruction instruction = Instruction::Greater;
  714. parser.Match('>', false);
  715. if (parser.Look() == '=')
  716. {
  717. parser.Match('=');
  718. instruction = Instruction::GreaterEq;
  719. }
  720. else
  721. {
  722. parser.SkipWhitespace();
  723. }
  724. parser.Push();
  725. Additive(parser);
  726. parser.Pop(Register::L);
  727. parser.Emit(instruction);
  728. }
  729. static void Equal(DataParser& parser)
  730. {
  731. parser.Match('=', false);
  732. parser.Match('=');
  733. parser.Push();
  734. Additive(parser);
  735. parser.Pop(Register::L);
  736. parser.Emit(Instruction::Equal);
  737. }
  738. static void NotEqual(DataParser& parser)
  739. {
  740. parser.Match('!', false);
  741. parser.Match('=');
  742. parser.Push();
  743. Additive(parser);
  744. parser.Pop(Register::L);
  745. parser.Emit(Instruction::NotEqual);
  746. }
  747. static void Ternary(DataParser& parser)
  748. {
  749. parser.Match('?');
  750. parser.Push();
  751. Expression(parser);
  752. parser.Push();
  753. parser.Match(':');
  754. Expression(parser);
  755. parser.Pop(Register::C);
  756. parser.Pop(Register::L);
  757. parser.Emit(Instruction::Ternary);
  758. }
  759. static void Function(DataParser& parser, Instruction function_type, String&& func_name, bool first_argument_piped)
  760. {
  761. RMLUI_ASSERT(function_type == Instruction::TransformFnc || function_type == Instruction::EventFnc);
  762. // We already matched the variable name, and also pushed the first argument to the stack if it was piped using '|'.
  763. int num_arguments = first_argument_piped ? 1 : 0;
  764. if (parser.Look() == '(')
  765. {
  766. bool looping = true;
  767. parser.Match('(');
  768. if (parser.Look() == ')')
  769. {
  770. parser.Match(')');
  771. looping = false;
  772. }
  773. while (looping)
  774. {
  775. num_arguments += 1;
  776. Expression(parser);
  777. parser.Push();
  778. switch (parser.Look())
  779. {
  780. case ')':
  781. parser.Match(')');
  782. looping = false;
  783. break;
  784. case ',': parser.Match(','); break;
  785. default:
  786. parser.Expected("one of ')' or ','");
  787. looping = false;
  788. break;
  789. }
  790. }
  791. }
  792. else
  793. {
  794. parser.SkipWhitespace();
  795. }
  796. parser.Function(function_type, num_arguments, std::move(func_name));
  797. }
  798. } // namespace Parse
  799. static String DumpProgram(const Program& program)
  800. {
  801. String str;
  802. for (size_t i = 0; i < program.size(); i++)
  803. {
  804. String instruction_str = program[i].data.Get<String>();
  805. str += CreateString(" %4zu '%c' %s\n", i, char(program[i].instruction), instruction_str.c_str());
  806. }
  807. return str;
  808. }
  809. class DataInterpreter {
  810. public:
  811. DataInterpreter(const Program& program, const AddressList& addresses, DataExpressionInterface expression_interface) :
  812. program(program), addresses(addresses), expression_interface(expression_interface)
  813. {}
  814. bool Error(const String& message) const
  815. {
  816. Log::Message(Log::LT_WARNING, "Error during execution. %s", message.c_str());
  817. RMLUI_ERROR;
  818. return false;
  819. }
  820. bool Run()
  821. {
  822. bool success = true;
  823. for (size_t i = 0; i < program.size(); i++)
  824. {
  825. if (!Execute(program[i].instruction, program[i].data))
  826. {
  827. success = false;
  828. break;
  829. }
  830. }
  831. if (success && !stack.empty())
  832. Log::Message(Log::LT_WARNING, "Possible data interpreter stack corruption. Stack size is %zu at end of execution (should be zero).",
  833. stack.size());
  834. if (!success)
  835. {
  836. String program_str = DumpProgram(program);
  837. Log::Message(Log::LT_WARNING, "Failed to execute program with %zu instructions:", program.size());
  838. Log::Message(Log::LT_WARNING, "%s", program_str.c_str());
  839. }
  840. return success;
  841. }
  842. Variant Result() const { return R; }
  843. private:
  844. Variant R, L, C;
  845. Vector<Variant> stack;
  846. const Program& program;
  847. const AddressList& addresses;
  848. DataExpressionInterface expression_interface;
  849. bool Execute(const Instruction instruction, const Variant& data)
  850. {
  851. auto AnyString = [](const Variant& v1, const Variant& v2) { return v1.GetType() == Variant::STRING || v2.GetType() == Variant::STRING; };
  852. switch (instruction)
  853. {
  854. case Instruction::Push:
  855. {
  856. stack.push_back(std::move(R));
  857. R.Clear();
  858. }
  859. break;
  860. case Instruction::Pop:
  861. {
  862. if (stack.empty())
  863. return Error("Cannot pop stack, it is empty.");
  864. Register reg = Register(data.Get<int>(-1));
  865. switch (reg)
  866. {
  867. // clang-format off
  868. case Register::R: R = stack.back(); stack.pop_back(); break;
  869. case Register::L: L = stack.back(); stack.pop_back(); break;
  870. case Register::C: C = stack.back(); stack.pop_back(); break;
  871. // clang-format on
  872. default: return Error(CreateString("Invalid register %d.", int(reg)));
  873. }
  874. }
  875. break;
  876. case Instruction::Literal:
  877. {
  878. R = data;
  879. }
  880. break;
  881. case Instruction::DynamicVariable:
  882. {
  883. auto str = R.Get<String>();
  884. auto address = expression_interface.ParseAddress(str);
  885. if (address.empty())
  886. return Error("Variable address not found.");
  887. R = expression_interface.GetValue(address);
  888. }
  889. break;
  890. case Instruction::Variable:
  891. {
  892. size_t variable_index = size_t(data.Get<int>(-1));
  893. if (variable_index < addresses.size())
  894. R = expression_interface.GetValue(addresses[variable_index]);
  895. else
  896. return Error("Variable address not found.");
  897. }
  898. break;
  899. case Instruction::Add:
  900. {
  901. if (AnyString(L, R))
  902. R = Variant(L.Get<String>() + R.Get<String>());
  903. else
  904. R = Variant(L.Get<double>() + R.Get<double>());
  905. }
  906. break;
  907. // clang-format off
  908. case Instruction::Subtract: R = Variant(L.Get<double>() - R.Get<double>()); break;
  909. case Instruction::Multiply: R = Variant(L.Get<double>() * R.Get<double>()); break;
  910. case Instruction::Divide: R = Variant(L.Get<double>() / R.Get<double>()); break;
  911. case Instruction::Not: R = Variant(!R.Get<bool>()); break;
  912. case Instruction::And: R = Variant(L.Get<bool>() && R.Get<bool>()); break;
  913. case Instruction::Or: R = Variant(L.Get<bool>() || R.Get<bool>()); break;
  914. case Instruction::Less: R = Variant(L.Get<double>() < R.Get<double>()); break;
  915. case Instruction::LessEq: R = Variant(L.Get<double>() <= R.Get<double>()); break;
  916. case Instruction::Greater: R = Variant(L.Get<double>() > R.Get<double>()); break;
  917. case Instruction::GreaterEq: R = Variant(L.Get<double>() >= R.Get<double>()); break;
  918. // clang-format on
  919. case Instruction::Equal:
  920. {
  921. if (AnyString(L, R))
  922. R = Variant(L.Get<String>() == R.Get<String>());
  923. else
  924. R = Variant(L.Get<double>() == R.Get<double>());
  925. }
  926. break;
  927. case Instruction::NotEqual:
  928. {
  929. if (AnyString(L, R))
  930. R = Variant(L.Get<String>() != R.Get<String>());
  931. else
  932. R = Variant(L.Get<double>() != R.Get<double>());
  933. }
  934. break;
  935. case Instruction::Ternary:
  936. {
  937. if (L.Get<bool>())
  938. R = C;
  939. }
  940. break;
  941. case Instruction::NumArguments:
  942. {
  943. const int num_arguments = data.Get<int>(-1);
  944. R = num_arguments;
  945. }
  946. break;
  947. case Instruction::TransformFnc:
  948. case Instruction::EventFnc:
  949. {
  950. Vector<Variant> arguments;
  951. if (!ExtractArgumentsFromStack(arguments))
  952. return false;
  953. const String function_name = data.Get<String>();
  954. const bool result = (instruction == Instruction::TransformFnc ? expression_interface.CallTransform(function_name, arguments, R)
  955. : expression_interface.EventCallback(function_name, arguments));
  956. if (!result)
  957. {
  958. String arguments_str;
  959. for (size_t i = 0; i < arguments.size(); i++)
  960. {
  961. arguments_str += arguments[i].Get<String>();
  962. if (i < arguments.size() - 1)
  963. arguments_str += ", ";
  964. }
  965. return Error(
  966. CreateString("Failed to execute %s: %s(%s)", instruction == Instruction::TransformFnc ? "transform function" : "event callback",
  967. function_name.c_str(), arguments_str.c_str()));
  968. }
  969. }
  970. break;
  971. case Instruction::Assign:
  972. {
  973. size_t variable_index = size_t(data.Get<int>(-1));
  974. if (variable_index < addresses.size())
  975. {
  976. if (!expression_interface.SetValue(addresses[variable_index], R))
  977. return Error("Could not assign to variable.");
  978. }
  979. else
  980. return Error("Variable address not found.");
  981. }
  982. break;
  983. case Instruction::CastToInt:
  984. {
  985. int tmp;
  986. if (!R.GetInto(tmp))
  987. return Error("Could not cast value to int.");
  988. else
  989. R = tmp;
  990. }
  991. break;
  992. default: RMLUI_ERRORMSG("Instruction not implemented."); break;
  993. }
  994. return true;
  995. }
  996. bool ExtractArgumentsFromStack(Vector<Variant>& out_arguments)
  997. {
  998. int num_arguments = R.Get<int>(-1);
  999. if (num_arguments < 0)
  1000. return Error("Invalid number of arguments.");
  1001. if (stack.size() < size_t(num_arguments))
  1002. return Error(CreateString("Cannot pop %d arguments, stack contains only %zu elements.", num_arguments, stack.size()));
  1003. const auto it_stack_begin_arguments = stack.end() - num_arguments;
  1004. out_arguments.insert(out_arguments.end(), std::make_move_iterator(it_stack_begin_arguments), std::make_move_iterator(stack.end()));
  1005. stack.erase(it_stack_begin_arguments, stack.end());
  1006. return true;
  1007. }
  1008. };
  1009. DataExpression::DataExpression(String expression) : expression(std::move(expression)) {}
  1010. DataExpression::~DataExpression() {}
  1011. bool DataExpression::Parse(const DataExpressionInterface& expression_interface, bool is_assignment_expression)
  1012. {
  1013. DataParser parser(expression, expression_interface);
  1014. if (!parser.Parse(is_assignment_expression))
  1015. return false;
  1016. program = parser.ReleaseProgram();
  1017. addresses = parser.ReleaseAddresses();
  1018. return true;
  1019. }
  1020. bool DataExpression::Run(const DataExpressionInterface& expression_interface, Variant& out_value)
  1021. {
  1022. DataInterpreter interpreter(program, addresses, expression_interface);
  1023. if (!interpreter.Run())
  1024. return false;
  1025. out_value = interpreter.Result();
  1026. return true;
  1027. }
  1028. StringList DataExpression::GetVariableNameList() const
  1029. {
  1030. StringList list;
  1031. list.reserve(addresses.size());
  1032. for (const DataAddress& address : addresses)
  1033. {
  1034. if (!address.empty())
  1035. list.push_back(address[0].name);
  1036. }
  1037. return list;
  1038. }
  1039. DataExpressionInterface::DataExpressionInterface(DataModel* data_model, Element* element, Event* event) :
  1040. data_model(data_model), element(element), event(event)
  1041. {}
  1042. DataAddress DataExpressionInterface::ParseAddress(const String& address_str) const
  1043. {
  1044. if (address_str.size() >= 4 && address_str[0] == 'e' && address_str[1] == 'v' && address_str[2] == '.')
  1045. return DataAddress{DataAddressEntry("ev"), DataAddressEntry(address_str.substr(3))};
  1046. return data_model ? data_model->ResolveAddress(address_str, element) : DataAddress();
  1047. }
  1048. Variant DataExpressionInterface::GetValue(const DataAddress& address) const
  1049. {
  1050. Variant result;
  1051. if (event && address.size() == 2 && address.front().name == "ev")
  1052. {
  1053. auto& parameters = event->GetParameters();
  1054. auto it = parameters.find(address.back().name);
  1055. if (it != parameters.end())
  1056. result = it->second;
  1057. }
  1058. else if (data_model)
  1059. {
  1060. data_model->GetVariableInto(address, result);
  1061. }
  1062. return result;
  1063. }
  1064. bool DataExpressionInterface::SetValue(const DataAddress& address, const Variant& value) const
  1065. {
  1066. bool result = false;
  1067. if (data_model && !address.empty())
  1068. {
  1069. if (DataVariable variable = data_model->GetVariable(address))
  1070. result = variable.Set(value);
  1071. if (result)
  1072. data_model->DirtyVariable(address.front().name);
  1073. }
  1074. return result;
  1075. }
  1076. bool DataExpressionInterface::CallTransform(const String& name, const VariantList& arguments, Variant& out_result)
  1077. {
  1078. return data_model ? data_model->CallTransform(name, arguments, out_result) : false;
  1079. }
  1080. bool DataExpressionInterface::EventCallback(const String& name, const VariantList& arguments)
  1081. {
  1082. if (!data_model || !event)
  1083. return false;
  1084. const DataEventFunc* func = data_model->GetEventCallback(name);
  1085. if (!func || !*func)
  1086. return false;
  1087. DataModelHandle handle(data_model);
  1088. func->operator()(handle, *event, arguments);
  1089. return true;
  1090. }
  1091. } // namespace Rml