DataExpression.cpp 28 KB

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