DataParser.cpp 28 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697989910010110210310410510610710810911011111211311411511611711811912012112212312412512612712812913013113213313413513613713813914014114214314414514614714814915015115215315415515615715815916016116216316416516616716816917017117217317417517617717817918018118218318418518618718818919019119219319419519619719819920020120220320420520620720820921021121221321421521621721821922022122222322422522622722822923023123223323423523623723823924024124224324424524624724824925025125225325425525625725825926026126226326426526626726826927027127227327427527627727827928028128228328428528628728828929029129229329429529629729829930030130230330430530630730830931031131231331431531631731831932032132232332432532632732832933033133233333433533633733833934034134234334434534634734834935035135235335435535635735835936036136236336436536636736836937037137237337437537637737837938038138238338438538638738838939039139239339439539639739839940040140240340440540640740840941041141241341441541641741841942042142242342442542642742842943043143243343443543643743843944044144244344444544644744844945045145245345445545645745845946046146246346446546646746846947047147247347447547647747847948048148248348448548648748848949049149249349449549649749849950050150250350450550650750850951051151251351451551651751851952052152252352452552652752852953053153253353453553653753853954054154254354454554654754854955055155255355455555655755855956056156256356456556656756856957057157257357457557657757857958058158258358458558658758858959059159259359459559659759859960060160260360460560660760860961061161261361461561661761861962062162262362462562662762862963063163263363463563663763863964064164264364464564664764864965065165265365465565665765865966066166266366466566666766866967067167267367467567667767867968068168268368468568668768868969069169269369469569669769869970070170270370470570670770870971071171271371471571671771871972072172272372472572672772872973073173273373473573673773873974074174274374474574674774874975075175275375475575675775875976076176276376476576676776876977077177277377477577677777877978078178278378478578678778878979079179279379479579679779879980080180280380480580680780880981081181281381481581681781881982082182282382482582682782882983083183283383483583683783883984084184284384484584684784884985085185285385485585685785885986086186286386486586686786886987087187287387487587687787887988088188288388488588688788888989089189289389489589689789889990090190290390490590690790890991091191291391491591691791891992092192292392492592692792892993093193293393493593693793893994094194294394494594694794894995095195295395495595695795895996096196296396496596696796896997097197297397497597697797897998098198298398498598698798898999099199299399499599699799899910001001100210031004100510061007100810091010101110121013101410151016101710181019102010211022102310241025102610271028102910301031103210331034103510361037103810391040104110421043104410451046104710481049105010511052105310541055105610571058105910601061106210631064106510661067106810691070107110721073107410751076107710781079108010811082108310841085108610871088108910901091109210931094109510961097109810991100110111021103110411051106
  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 "precompiled.h"
  29. #include "../../Include/RmlUi/Core/DataModel.h"
  30. #include "DataParser.h"
  31. #include <stack>
  32. #ifdef _MSC_VER
  33. #pragma warning(default : 4061)
  34. #pragma warning(default : 4062)
  35. #endif
  36. namespace Rml {
  37. namespace Core {
  38. class Interpreter;
  39. class DataParser;
  40. /*
  41. The abstract machine for RmlUi data scripts.
  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 two stacks:
  48. S The main program stack.
  49. A The arguments stack, only used to pass arguments to an external transform function.
  50. In addition, each instruction has an optional payload:
  51. D Instruction data (payload).
  52. Notation used in the instruction list below:
  53. S+ Push to stack S.
  54. S- Pop stack S (returns the popped value).
  55. */
  56. enum class Instruction { // 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. Arguments = 'a', // A+ = S- (Repeated D times, where D gives the num. arguments)
  76. TransformFnc = 'T', // R = DataModel.Execute( D, R, A ); A.Clear(); (D determines function name, R the input value, A the arguments)
  77. EventFnc = 'E', // DataModel.EventCallback(D, A); A.Clear();
  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 %d. %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, 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 &&
  176. instruction != Instruction::Arguments && instruction != Instruction::Variable && instruction != Instruction::Assign,
  177. "Use the Push(), Pop(), Arguments(), Variable(), and Assign() procedures for stack manipulation and variable instructions.");
  178. program.push_back(InstructionData{ instruction, std::move(data) });
  179. }
  180. void Push() {
  181. program_stack_size += 1;
  182. program.push_back(InstructionData{ Instruction::Push, Variant() });
  183. }
  184. void Pop(Register destination) {
  185. if (program_stack_size <= 0) {
  186. Error("Internal parser error: Tried to pop an empty stack.");
  187. return;
  188. }
  189. program_stack_size -= 1;
  190. program.push_back(InstructionData{ Instruction::Pop, Variant(int(destination)) });
  191. }
  192. void Arguments(int num_arguments) {
  193. if (program_stack_size < num_arguments) {
  194. Error(CreateString(128, "Internal parser error: Popping %d arguments, but the stack contains only %d elements.", num_arguments, program_stack_size));
  195. return;
  196. }
  197. program_stack_size -= num_arguments;
  198. program.push_back(InstructionData{ Instruction::Arguments, Variant(int(num_arguments)) });
  199. }
  200. void Variable(const String& name) {
  201. VariableGetSet(name, false);
  202. }
  203. void Assign(const String& name) {
  204. VariableGetSet(name, true);
  205. }
  206. private:
  207. void VariableGetSet(const String& name, bool is_assignment)
  208. {
  209. DataAddress address = expression_interface.ParseAddress(name);
  210. if (address.empty()) {
  211. Error(CreateString(name.size() + 50, "Could not find data variable with name '%s'.", name.c_str()));
  212. return;
  213. }
  214. int index = int(variable_addresses.size());
  215. variable_addresses.push_back(std::move(address));
  216. program.push_back(InstructionData{ is_assignment ? Instruction::Assign : Instruction::Variable, Variant(int(index)) });
  217. }
  218. const String expression;
  219. DataExpressionInterface expression_interface;
  220. size_t index = 0;
  221. bool reached_end = false;
  222. bool parse_error = true;
  223. int program_stack_size = 0;
  224. Program program;
  225. AddressList variable_addresses;
  226. };
  227. namespace Parse {
  228. // Forward declare all parse functions.
  229. static void Assignment(DataParser& parser);
  230. static void Expression(DataParser& parser);
  231. static void Factor(DataParser& parser);
  232. static void Term(DataParser& parser);
  233. static void NumberLiteral(DataParser& parser);
  234. static void StringLiteral(DataParser& parser);
  235. static void Variable(DataParser& parser);
  236. static void Add(DataParser& parser);
  237. static void Subtract(DataParser& parser);
  238. static void Multiply(DataParser& parser);
  239. static void Divide(DataParser& parser);
  240. static void Not(DataParser& parser);
  241. static void And(DataParser& parser);
  242. static void Or(DataParser& parser);
  243. static void Less(DataParser& parser);
  244. static void Greater(DataParser& parser);
  245. static void Equal(DataParser& parser);
  246. static void NotEqual(DataParser& parser);
  247. static void Ternary(DataParser& parser);
  248. static void Function(DataParser& parser, Instruction function_type, const String& name);
  249. // Helper functions
  250. static bool IsVariableCharacter(char c, bool is_first_character)
  251. {
  252. const bool is_alpha = (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z');
  253. if (is_first_character)
  254. return is_alpha;
  255. if (is_alpha || (c >= '0' && c <= '9'))
  256. return true;
  257. for (char valid_char : "_.[] ")
  258. {
  259. if (c == valid_char && valid_char != '\0')
  260. return true;
  261. }
  262. return false;
  263. }
  264. static String VariableName(DataParser& parser)
  265. {
  266. String name;
  267. bool is_first_character = true;
  268. char c = parser.Look();
  269. while (IsVariableCharacter(c, is_first_character))
  270. {
  271. name += c;
  272. c = parser.Next();
  273. is_first_character = false;
  274. }
  275. // Right trim spaces in name
  276. size_t new_size = String::npos;
  277. for (int i = int(name.size()) - 1; i >= 1; i--)
  278. {
  279. if (name[i] == ' ')
  280. new_size = size_t(i);
  281. else
  282. break;
  283. }
  284. if (new_size != String::npos)
  285. name.resize(new_size);
  286. return name;
  287. }
  288. // Parser functions
  289. static void Assignment(DataParser& parser)
  290. {
  291. bool looping = true;
  292. while (looping)
  293. {
  294. if (parser.Look() != '\0')
  295. {
  296. const String variable_name = VariableName(parser);
  297. if (variable_name.empty()) {
  298. parser.Error("Expected a variable for assignment but got an empty name.");
  299. return;
  300. }
  301. const char c = parser.Look();
  302. if (c == '=')
  303. {
  304. parser.Match('=');
  305. Expression(parser);
  306. parser.Assign(variable_name);
  307. }
  308. else if (c == '(' || c == ';' || c == '\0')
  309. {
  310. Function(parser, Instruction::EventFnc, variable_name);
  311. }
  312. else
  313. {
  314. parser.Expected("one of = ; ( or end of string");
  315. return;
  316. }
  317. }
  318. const char c = parser.Look();
  319. if (c == ';')
  320. parser.Match(';');
  321. else if (c == '\0')
  322. looping = false;
  323. else
  324. {
  325. parser.Expected("';' or end of string");
  326. looping = false;
  327. }
  328. }
  329. }
  330. static void Expression(DataParser& parser)
  331. {
  332. Term(parser);
  333. bool looping = true;
  334. while (looping)
  335. {
  336. switch (char c = parser.Look())
  337. {
  338. case '+': Add(parser); break;
  339. case '-': Subtract(parser); break;
  340. case '?': Ternary(parser); break;
  341. case '|':
  342. {
  343. parser.Match('|', false);
  344. if (parser.Look() == '|')
  345. Or(parser);
  346. else
  347. {
  348. parser.SkipWhitespace();
  349. const String fnc_name = VariableName(parser);
  350. if (fnc_name.empty()) {
  351. parser.Error("Expected a transform function name but got an empty name.");
  352. return;
  353. }
  354. Function(parser, Instruction::TransformFnc, fnc_name);
  355. }
  356. }
  357. break;
  358. case '&': And(parser); break;
  359. case '=': Equal(parser); break;
  360. case '!': NotEqual(parser); break;
  361. case '<': Less(parser); break;
  362. case '>': Greater(parser); break;
  363. case '\0':
  364. looping = false;
  365. break;
  366. default:
  367. looping = false;
  368. }
  369. }
  370. }
  371. static void Term(DataParser& parser)
  372. {
  373. Factor(parser);
  374. bool looping = true;
  375. while (looping)
  376. {
  377. switch (const char c = parser.Look())
  378. {
  379. case '*': Multiply(parser); break;
  380. case '/': Divide(parser); break;
  381. case '\0': looping = false; break;
  382. default:
  383. looping = false;
  384. }
  385. }
  386. }
  387. static void Factor(DataParser& parser)
  388. {
  389. const char c = parser.Look();
  390. if (c == '(')
  391. {
  392. parser.Match('(');
  393. Expression(parser);
  394. parser.Match(')');
  395. }
  396. else if (c == '\'')
  397. {
  398. parser.Match('\'', false);
  399. StringLiteral(parser);
  400. parser.Match('\'');
  401. }
  402. else if (c == '!')
  403. {
  404. Not(parser);
  405. parser.SkipWhitespace();
  406. }
  407. else if (c == '-' || (c >= '0' && c <= '9'))
  408. {
  409. NumberLiteral(parser);
  410. parser.SkipWhitespace();
  411. }
  412. else if ((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z'))
  413. {
  414. Variable(parser);
  415. parser.SkipWhitespace();
  416. }
  417. else
  418. parser.Expected("literal, variable name, parenthesis, or '!'");
  419. }
  420. static void NumberLiteral(DataParser& parser)
  421. {
  422. String str;
  423. bool first_match = false;
  424. bool has_dot = false;
  425. char c = parser.Look();
  426. if (c == '-')
  427. {
  428. str += c;
  429. c = parser.Next();
  430. }
  431. while ((c >= '0' && c <= '9') || (c == '.' && !has_dot))
  432. {
  433. first_match = true;
  434. str += c;
  435. if (c == '.')
  436. has_dot = true;
  437. c = parser.Next();
  438. }
  439. if (!first_match)
  440. {
  441. parser.Error(CreateString(100, "Invalid number literal. Expected '0-9' or '.' but found '%c'.", c));
  442. return;
  443. }
  444. const double number = FromString(str, 0.0);
  445. parser.Emit(Instruction::Literal, Variant(number));
  446. }
  447. static void StringLiteral(DataParser& parser)
  448. {
  449. String str;
  450. char c = parser.Look();
  451. char c_prev = '\0';
  452. while (c != '\0' && (c != '\'' || c_prev == '\\'))
  453. {
  454. if (c_prev == '\\' && (c == '\\' || c == '\'')) {
  455. str.pop_back();
  456. c_prev = '\0';
  457. }
  458. else {
  459. c_prev = c;
  460. }
  461. str += c;
  462. c = parser.Next();
  463. }
  464. parser.Emit(Instruction::Literal, Variant(str));
  465. }
  466. static void Variable(DataParser& parser)
  467. {
  468. String name = VariableName(parser);
  469. if (name.empty()) {
  470. parser.Error("Expected a variable but got an empty name.");
  471. return;
  472. }
  473. // Keywords are parsed like variables, but are really literals.
  474. // Check for them here.
  475. if (name == "true")
  476. parser.Emit(Instruction::Literal, Variant(true));
  477. else if (name == "false")
  478. parser.Emit(Instruction::Literal, Variant(false));
  479. else
  480. parser.Variable(name);
  481. }
  482. static void Add(DataParser& parser)
  483. {
  484. parser.Match('+');
  485. parser.Push();
  486. Term(parser);
  487. parser.Pop(Register::L);
  488. parser.Emit(Instruction::Add);
  489. }
  490. static void Subtract(DataParser& parser)
  491. {
  492. parser.Match('-');
  493. parser.Push();
  494. Term(parser);
  495. parser.Pop(Register::L);
  496. parser.Emit(Instruction::Subtract);
  497. }
  498. static void Multiply(DataParser& parser)
  499. {
  500. parser.Match('*');
  501. parser.Push();
  502. Factor(parser);
  503. parser.Pop(Register::L);
  504. parser.Emit(Instruction::Multiply);
  505. }
  506. static void Divide(DataParser& parser)
  507. {
  508. parser.Match('/');
  509. parser.Push();
  510. Factor(parser);
  511. parser.Pop(Register::L);
  512. parser.Emit(Instruction::Divide);
  513. }
  514. static void Not(DataParser& parser)
  515. {
  516. parser.Match('!');
  517. Factor(parser);
  518. parser.Emit(Instruction::Not);
  519. }
  520. static void Or(DataParser& parser)
  521. {
  522. // We already skipped the first '|' during expression
  523. parser.Match('|');
  524. parser.Push();
  525. Term(parser);
  526. parser.Pop(Register::L);
  527. parser.Emit(Instruction::Or);
  528. }
  529. static void And(DataParser& parser)
  530. {
  531. parser.Match('&', false);
  532. parser.Match('&');
  533. parser.Push();
  534. Term(parser);
  535. parser.Pop(Register::L);
  536. parser.Emit(Instruction::And);
  537. }
  538. static void Less(DataParser& parser)
  539. {
  540. Instruction instruction = Instruction::Less;
  541. parser.Match('<', false);
  542. if (parser.Look() == '=') {
  543. parser.Match('=');
  544. instruction = Instruction::LessEq;
  545. }
  546. else {
  547. parser.SkipWhitespace();
  548. }
  549. parser.Push();
  550. Term(parser);
  551. parser.Pop(Register::L);
  552. parser.Emit(instruction);
  553. }
  554. static void Greater(DataParser& parser)
  555. {
  556. Instruction instruction = Instruction::Greater;
  557. parser.Match('>', false);
  558. if (parser.Look() == '=') {
  559. parser.Match('=');
  560. instruction = Instruction::GreaterEq;
  561. }
  562. else {
  563. parser.SkipWhitespace();
  564. }
  565. parser.Push();
  566. Term(parser);
  567. parser.Pop(Register::L);
  568. parser.Emit(instruction);
  569. }
  570. static void Equal(DataParser& parser)
  571. {
  572. parser.Match('=', false);
  573. parser.Match('=');
  574. parser.Push();
  575. Term(parser);
  576. parser.Pop(Register::L);
  577. parser.Emit(Instruction::Equal);
  578. }
  579. static void NotEqual(DataParser& parser)
  580. {
  581. parser.Match('!', false);
  582. parser.Match('=');
  583. parser.Push();
  584. Term(parser);
  585. parser.Pop(Register::L);
  586. parser.Emit(Instruction::NotEqual);
  587. }
  588. static void Ternary(DataParser& parser)
  589. {
  590. parser.Match('?');
  591. parser.Push();
  592. Expression(parser);
  593. parser.Push();
  594. parser.Match(':');
  595. Expression(parser);
  596. parser.Pop(Register::C);
  597. parser.Pop(Register::L);
  598. parser.Emit(Instruction::Ternary);
  599. }
  600. static void Function(DataParser& parser, Instruction function_type, const String& func_name)
  601. {
  602. RMLUI_ASSERT(function_type == Instruction::TransformFnc || function_type == Instruction::EventFnc);
  603. // We already matched the variable name (and '|' for transform functions)
  604. if (parser.Look() == '(')
  605. {
  606. int num_arguments = 0;
  607. bool looping = true;
  608. parser.Match('(');
  609. if (parser.Look() == ')') {
  610. parser.Match(')');
  611. looping = false;
  612. }
  613. else
  614. parser.Push();
  615. while (looping)
  616. {
  617. num_arguments += 1;
  618. Expression(parser);
  619. parser.Push();
  620. switch (parser.Look()) {
  621. case ')': parser.Match(')'); looping = false; break;
  622. case ',': parser.Match(','); break;
  623. default:
  624. parser.Expected("one of ')' or ','");
  625. looping = false;
  626. }
  627. }
  628. if (num_arguments > 0) {
  629. parser.Arguments(num_arguments);
  630. parser.Pop(Register::R);
  631. }
  632. }
  633. else {
  634. parser.SkipWhitespace();
  635. }
  636. parser.Emit(function_type, Variant(func_name));
  637. }
  638. } // </namespace Parse>
  639. static String DumpProgram(const Program& program)
  640. {
  641. String str;
  642. for (size_t i = 0; i < program.size(); i++)
  643. {
  644. String instruction_str = program[i].data.Get<String>();
  645. str += CreateString(instruction_str.size(), " %4d '%c' %s\n", i, char(program[i].instruction), instruction_str.c_str());
  646. }
  647. return str;
  648. }
  649. class DataInterpreter {
  650. public:
  651. DataInterpreter(const Program& program, const AddressList& addresses, DataExpressionInterface expression_interface) : program(program), addresses(addresses), expression_interface(expression_interface) {}
  652. bool Error(String message) const
  653. {
  654. message = "Error during execution. " + message;
  655. Log::Message(Log::LT_WARNING, message.c_str());
  656. RMLUI_ERROR;
  657. return false;
  658. }
  659. bool Run()
  660. {
  661. bool success = true;
  662. for (size_t i = 0; i < program.size(); i++)
  663. {
  664. if (!Execute(program[i].instruction, program[i].data))
  665. {
  666. success = false;
  667. break;
  668. }
  669. }
  670. if(success && !stack.empty())
  671. Log::Message(Log::LT_WARNING, "Possible data interpreter stack corruption. Stack size is %d at end of execution (should be zero).", stack.size());
  672. if(!success)
  673. {
  674. String program_str = DumpProgram(program);
  675. Log::Message(Log::LT_WARNING, "Failed to execute program with %d instructions:", program.size());
  676. Log::Message(Log::LT_WARNING, program_str.c_str());
  677. }
  678. return success;
  679. }
  680. Variant Result() const {
  681. return R;
  682. }
  683. private:
  684. Variant R, L, C;
  685. std::stack<Variant> stack;
  686. std::vector<Variant> arguments;
  687. const Program& program;
  688. const AddressList& addresses;
  689. DataExpressionInterface expression_interface;
  690. bool Execute(const Instruction instruction, const Variant& data)
  691. {
  692. auto AnyString = [](const Variant& v1, const Variant& v2) {
  693. return v1.GetType() == Variant::STRING || v2.GetType() == Variant::STRING;
  694. };
  695. switch (instruction)
  696. {
  697. case Instruction::Push:
  698. {
  699. stack.push(std::move(R));
  700. R.Clear();
  701. }
  702. break;
  703. case Instruction::Pop:
  704. {
  705. if (stack.empty())
  706. return Error("Cannot pop stack, it is empty.");
  707. Register reg = Register(data.Get<int>(-1));
  708. switch (reg) {
  709. case Register::R: R = stack.top(); stack.pop(); break;
  710. case Register::L: L = stack.top(); stack.pop(); break;
  711. case Register::C: C = stack.top(); stack.pop(); break;
  712. default:
  713. return Error(CreateString(50, "Invalid register %d.", int(reg)));
  714. }
  715. }
  716. break;
  717. case Instruction::Literal:
  718. {
  719. R = data;
  720. }
  721. break;
  722. case Instruction::Variable:
  723. {
  724. size_t variable_index = size_t(data.Get<int>(-1));
  725. if (variable_index < addresses.size())
  726. R = expression_interface.GetValue(addresses[variable_index]);
  727. else
  728. return Error("Variable address not found.");
  729. }
  730. break;
  731. case Instruction::Add:
  732. {
  733. if (AnyString(L, R))
  734. R = Variant(L.Get<String>() + R.Get<String>());
  735. else
  736. R = Variant(L.Get<double>() + R.Get<double>());
  737. }
  738. break;
  739. case Instruction::Subtract: R = Variant(L.Get<double>() - R.Get<double>()); break;
  740. case Instruction::Multiply: R = Variant(L.Get<double>() * R.Get<double>()); break;
  741. case Instruction::Divide: R = Variant(L.Get<double>() / R.Get<double>()); break;
  742. case Instruction::Not: R = Variant(!R.Get<bool>()); break;
  743. case Instruction::And: R = Variant(L.Get<bool>() && R.Get<bool>()); break;
  744. case Instruction::Or: R = Variant(L.Get<bool>() || R.Get<bool>()); break;
  745. case Instruction::Less: R = Variant(L.Get<double>() < R.Get<double>()); break;
  746. case Instruction::LessEq: R = Variant(L.Get<double>() <= R.Get<double>()); break;
  747. case Instruction::Greater: R = Variant(L.Get<double>() > R.Get<double>()); break;
  748. case Instruction::GreaterEq: R = Variant(L.Get<double>() >= R.Get<double>()); break;
  749. case Instruction::Equal:
  750. {
  751. if (AnyString(L, R))
  752. R = Variant(L.Get<String>() == R.Get<String>());
  753. else
  754. R = Variant(L.Get<double>() == R.Get<double>());
  755. }
  756. break;
  757. case Instruction::NotEqual:
  758. {
  759. if (AnyString(L, R))
  760. R = Variant(L.Get<String>() != R.Get<String>());
  761. else
  762. R = Variant(L.Get<double>() != R.Get<double>());
  763. }
  764. break;
  765. case Instruction::Ternary:
  766. {
  767. if (L.Get<bool>())
  768. R = C;
  769. }
  770. break;
  771. case Instruction::Arguments:
  772. {
  773. if (!arguments.empty())
  774. return Error("Argument stack is not empty.");
  775. int num_arguments = data.Get<int>(-1);
  776. if (num_arguments < 0)
  777. return Error("Invalid number of arguments.");
  778. if (stack.size() < size_t(num_arguments))
  779. return Error(CreateString(100, "Cannot pop %d arguments, stack contains only %d elements.", num_arguments, stack.size()));
  780. arguments.resize(num_arguments);
  781. for (int i = num_arguments - 1; i >= 0; i--)
  782. {
  783. arguments[i] = std::move(stack.top());
  784. stack.pop();
  785. }
  786. }
  787. break;
  788. case Instruction::TransformFnc:
  789. {
  790. const String function_name = data.Get<String>();
  791. if (!expression_interface.CallTransform(function_name, R, arguments))
  792. {
  793. String arguments_str;
  794. for (size_t i = 0; i < arguments.size(); i++)
  795. {
  796. arguments_str += arguments[i].Get<String>();
  797. if (i < arguments.size() - 1)
  798. arguments_str += ", ";
  799. }
  800. Error(CreateString(50 + function_name.size() + arguments_str.size(), "Failed to execute data function: %s(%s)", function_name.c_str(), arguments_str.c_str()));
  801. }
  802. arguments.clear();
  803. }
  804. break;
  805. case Instruction::EventFnc:
  806. {
  807. const String function_name = data.Get<String>();
  808. if (!expression_interface.EventCallback(function_name, arguments))
  809. {
  810. String arguments_str;
  811. for (size_t i = 0; i < arguments.size(); i++)
  812. {
  813. arguments_str += arguments[i].Get<String>();
  814. if (i < arguments.size() - 1)
  815. arguments_str += ", ";
  816. }
  817. Error(CreateString(50 + function_name.size() + arguments_str.size(), "Failed to execute event callback: %s(%s)", function_name.c_str(), arguments_str.c_str()));
  818. }
  819. arguments.clear();
  820. }
  821. break;
  822. case Instruction::Assign:
  823. {
  824. size_t variable_index = size_t(data.Get<int>(-1));
  825. if (variable_index < addresses.size())
  826. {
  827. if (!expression_interface.SetValue(addresses[variable_index], R))
  828. return Error("Could not assign to variable.");
  829. }
  830. else
  831. return Error("Variable address not found.");
  832. }
  833. break;
  834. default:
  835. RMLUI_ERRORMSG("Instruction not implemented."); break;
  836. }
  837. return true;
  838. }
  839. };
  840. struct TestParser {
  841. TestParser() : model(type_register.GetTransformFuncRegister())
  842. {
  843. DataModelConstructor handle(&model, &type_register);
  844. handle.Bind("color_name", &color_name);
  845. handle.BindFunc("color_value", [this](Rml::Core::Variant& variant) {
  846. variant = ToString(color_value);
  847. });
  848. String result;
  849. result = TestExpression("!!10 - 1 ? 'hello' : 'world' | to_upper");
  850. result = TestExpression("(color_name) + (': rgba(' + color_value + ')')");
  851. result = TestExpression("'hello world' | to_upper(5 + 12 == 17 ? 'yes' : 'no', 9*2)");
  852. result = TestExpression("true == false");
  853. result = TestExpression("true != false");
  854. result = TestExpression("true");
  855. result = TestExpression(R"(true || false ? (true && true ? 'Absolutely!' : 'well..') : 'no')");
  856. result = TestExpression("2 * 2");
  857. result = TestExpression("50000 / 1500");
  858. result = TestExpression("5*1+2");
  859. result = TestExpression("5*(1+2)");
  860. result = TestExpression("5.2 + 19 + 'px'");
  861. }
  862. String TestExpression(String expression)
  863. {
  864. DataExpressionInterface interface(&model, nullptr);
  865. DataParser parser(expression, interface);
  866. if (parser.Parse(false))
  867. {
  868. Program program = parser.ReleaseProgram();
  869. AddressList addresses = parser.ReleaseAddresses();
  870. DataInterpreter interpreter(program, addresses, interface);
  871. if (interpreter.Run())
  872. return interpreter.Result().Get<String>();
  873. }
  874. return "<invalid expression>";
  875. };
  876. DataTypeRegister type_register;
  877. DataModel model;
  878. String color_name = "color";
  879. Colourb color_value = Colourb(180, 100, 255);
  880. };
  881. DataExpression::DataExpression(String expression) : expression(expression) {}
  882. DataExpression::~DataExpression()
  883. {
  884. }
  885. bool DataExpression::Parse(const DataExpressionInterface& expression_interface, bool is_assignment_expression)
  886. {
  887. // @todo: Remove, debugging only
  888. static TestParser test_parser;
  889. // TODO:
  890. // 3. Create a plug-in wrapper for use by scripting languages to replace this parser. Design wrapper as for events.
  891. // 5. Add tests
  892. DataParser parser(expression, expression_interface);
  893. if (!parser.Parse(is_assignment_expression))
  894. return false;
  895. program = parser.ReleaseProgram();
  896. addresses = parser.ReleaseAddresses();
  897. return true;
  898. }
  899. bool DataExpression::Run(const DataExpressionInterface& expression_interface, Variant& out_value)
  900. {
  901. DataInterpreter interpreter(program, addresses, expression_interface);
  902. if (!interpreter.Run())
  903. return false;
  904. out_value = interpreter.Result();
  905. return true;
  906. }
  907. StringList DataExpression::GetVariableNameList() const
  908. {
  909. StringList list;
  910. list.reserve(addresses.size());
  911. for (const DataAddress& address : addresses)
  912. {
  913. if (!address.empty())
  914. list.push_back(address[0].name);
  915. }
  916. return list;
  917. }
  918. DataExpressionInterface::DataExpressionInterface(DataModel* data_model, Element* element, Event* event) : data_model(data_model), element(element), event(event)
  919. {}
  920. DataAddress DataExpressionInterface::ParseAddress(const String& address_str) const
  921. {
  922. if (address_str.size() >= 4 && address_str[0] == 'e' && address_str[1] == 'v' && address_str[2] == '.')
  923. return DataAddress{ AddressEntry("ev"), AddressEntry(address_str.substr(3)) };
  924. return data_model ? data_model->ResolveAddress(address_str, element) : DataAddress();
  925. }
  926. Variant DataExpressionInterface::GetValue(const DataAddress& address) const
  927. {
  928. Variant result;
  929. if(event && address.size() == 2 && address.front().name == "ev")
  930. {
  931. auto& parameters = event->GetParameters();
  932. auto it = parameters.find(address.back().name);
  933. if (it != parameters.end())
  934. result = it->second;
  935. }
  936. else if (data_model)
  937. {
  938. data_model->GetValue(address, result);
  939. }
  940. return result;
  941. }
  942. bool DataExpressionInterface::SetValue(const DataAddress& address, const Variant& value) const
  943. {
  944. bool result = false;
  945. if (data_model && !address.empty())
  946. {
  947. if (Variable variable = data_model->GetVariable(address))
  948. result = variable.Set(value);
  949. if (result)
  950. data_model->DirtyVariable(address.front().name);
  951. }
  952. return result;
  953. }
  954. bool DataExpressionInterface::CallTransform(const String& name, Variant& inout_variant, const VariantList& arguments)
  955. {
  956. return data_model ? data_model->CallTransform(name, inout_variant, arguments) : false;
  957. }
  958. bool DataExpressionInterface::EventCallback(const String& name, const VariantList& arguments)
  959. {
  960. if (!data_model || !event)
  961. return false;
  962. const DataEventFunc* func = data_model->GetEventCallback(name);
  963. if (!func || !*func)
  964. return false;
  965. DataModelHandle handle(data_model);
  966. func->operator()(handle, *event, arguments);
  967. return true;
  968. }
  969. }
  970. }