DataExpression.cpp 28 KB

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