DataExpression.cpp 32 KB

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