OpenDDLParser.cpp 28 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598599600601602603604605606607608609610611612613614615616617618619620621622623624625626627628629630631632633634635636637638639640641642643644645646647648649650651652653654655656657658659660661662663664665666667668669670671672673674675676677678679680681682683684685686687688689690691692693694695696697698699700701702703704705706707708709710711712713714715716717718719720721722723724725726727728729730731732733734735736737738739740741742743744745746747748749750751752753754755756757758759760761762763764765766767768769770771772773774775776777778779780781782783784785786787788789790791792793794795796797798799800801802803804805806807808809810811812813814815816817818819820821822823824825826827828829830831832833834835836837838839840841842843844845846847848849850851852853854855856857858859860861862863864865866867868869870871872873874875876877878879880881882883884885886887888889890891892893894895896897898899900901902903904905906907908909910911912913914915916917918919920921922923924925926927928929930931932933934935936937938939940941942943944945946947948949950951952953954955956957958959960961962963964965966967968969970971972973974975976977978979980981982983984985986987988989990991992993994995996997998999100010011002100310041005100610071008100910101011101210131014101510161017101810191020102110221023102410251026102710281029103010311032103310341035103610371038
  1. /*-----------------------------------------------------------------------------------------------
  2. The MIT License (MIT)
  3. Copyright (c) 2014-2020 Kim Kulling
  4. Permission is hereby granted, free of charge, to any person obtaining a copy of
  5. this software and associated documentation files (the "Software"), to deal in
  6. the Software without restriction, including without limitation the rights to
  7. use, copy, modify, merge, publish, distribute, sublicense, and/or sell copies of
  8. the Software, and to permit persons to whom the Software is furnished to do so,
  9. subject to the following conditions:
  10. The above copyright notice and this permission notice shall be included in all
  11. copies or substantial portions of the Software.
  12. THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
  13. IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS
  14. FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR
  15. COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER
  16. IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
  17. CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
  18. -----------------------------------------------------------------------------------------------*/
  19. #include <openddlparser/OpenDDLExport.h>
  20. #include <openddlparser/OpenDDLParser.h>
  21. #include <math.h>
  22. #include <algorithm>
  23. #include <cassert>
  24. #include <iostream>
  25. #include <sstream>
  26. #ifdef _WIN32
  27. #include <windows.h>
  28. #endif // _WIN32
  29. BEGIN_ODDLPARSER_NS
  30. static const char *Version = "0.4.0";
  31. namespace Grammar {
  32. static const char *OpenBracketToken = "{";
  33. static const char *CloseBracketToken = "}";
  34. static const char *OpenPropertyToken = "(";
  35. static const char *ClosePropertyToken = ")";
  36. static const char *OpenArrayToken = "[";
  37. static const char *CloseArrayToken = "]";
  38. static const char *BoolTrue = "true";
  39. static const char *BoolFalse = "false";
  40. static const char *CommaSeparator = ",";
  41. static const char *PrimitiveTypeToken[(size_t)Value::ValueType::ddl_types_max] = {
  42. "bool",
  43. "int8",
  44. "int16",
  45. "int32",
  46. "int64",
  47. "unsigned_int8",
  48. "unsigned_int16",
  49. "unsigned_int32",
  50. "unsigned_int64",
  51. "half",
  52. "float",
  53. "double",
  54. "string",
  55. "ref"
  56. };
  57. } // Namespace Grammar
  58. const char *getTypeToken(Value::ValueType type) {
  59. return Grammar::PrimitiveTypeToken[(size_t)type];
  60. }
  61. static void logInvalidTokenError(char *in, const std::string &exp, OpenDDLParser::logCallback callback) {
  62. std::stringstream stream;
  63. stream << "Invalid token \"" << *in << "\""
  64. << " expected \"" << exp << "\"" << std::endl;
  65. std::string full(in);
  66. std::string part(full.substr(0, 50));
  67. stream << part;
  68. callback(ddl_error_msg, stream.str());
  69. }
  70. static bool isIntegerType(Value::ValueType integerType) {
  71. if (integerType != Value::ValueType::ddl_int8 && integerType != Value::ValueType::ddl_int16 &&
  72. integerType != Value::ValueType::ddl_int32 && integerType != Value::ValueType::ddl_int64) {
  73. return false;
  74. }
  75. return true;
  76. }
  77. static bool isUnsignedIntegerType(Value::ValueType integerType) {
  78. if (integerType != Value::ValueType::ddl_unsigned_int8 && integerType != Value::ValueType::ddl_unsigned_int16 &&
  79. integerType != Value::ValueType::ddl_unsigned_int32 && integerType != Value::ValueType::ddl_unsigned_int64) {
  80. return false;
  81. }
  82. return true;
  83. }
  84. static DDLNode *createDDLNode(Text *id, OpenDDLParser *parser) {
  85. if (nullptr == id || nullptr == parser || id->m_buffer == nullptr) {
  86. return nullptr;
  87. }
  88. const std::string type(id->m_buffer);
  89. DDLNode *parent(parser->top());
  90. DDLNode *node = DDLNode::create(type, "", parent);
  91. return node;
  92. }
  93. static void logMessage(LogSeverity severity, const std::string &msg) {
  94. std::string log;
  95. if (ddl_debug_msg == severity) {
  96. log += "Debug:";
  97. } else if (ddl_info_msg == severity) {
  98. log += "Info :";
  99. } else if (ddl_warn_msg == severity) {
  100. log += "Warn :";
  101. } else if (ddl_error_msg == severity) {
  102. log += "Error:";
  103. } else {
  104. log += "None :";
  105. }
  106. log += msg;
  107. std::cout << log;
  108. }
  109. OpenDDLParser::OpenDDLParser() :
  110. m_logCallback(logMessage),
  111. m_buffer(),
  112. m_stack(),
  113. m_context(nullptr) {
  114. // empty
  115. }
  116. OpenDDLParser::OpenDDLParser(const char *buffer, size_t len) :
  117. m_logCallback(&logMessage), m_buffer(), m_context(nullptr) {
  118. if (0 != len) {
  119. setBuffer(buffer, len);
  120. }
  121. }
  122. OpenDDLParser::~OpenDDLParser() {
  123. clear();
  124. }
  125. void OpenDDLParser::setLogCallback(logCallback callback) {
  126. if (nullptr != callback) {
  127. // install user-specific log callback
  128. m_logCallback = callback;
  129. } else {
  130. // install default log callback
  131. m_logCallback = &logMessage;
  132. }
  133. }
  134. OpenDDLParser::logCallback OpenDDLParser::getLogCallback() const {
  135. return m_logCallback;
  136. }
  137. void OpenDDLParser::setBuffer(const char *buffer, size_t len) {
  138. clear();
  139. if (0 == len) {
  140. return;
  141. }
  142. m_buffer.resize(len);
  143. ::memcpy(&m_buffer[0], buffer, len);
  144. }
  145. void OpenDDLParser::setBuffer(const std::vector<char> &buffer) {
  146. clear();
  147. m_buffer.resize(buffer.size());
  148. std::copy(buffer.begin(), buffer.end(), m_buffer.begin());
  149. }
  150. const char *OpenDDLParser::getBuffer() const {
  151. if (m_buffer.empty()) {
  152. return nullptr;
  153. }
  154. return &m_buffer[0];
  155. }
  156. size_t OpenDDLParser::getBufferSize() const {
  157. return m_buffer.size();
  158. }
  159. void OpenDDLParser::clear() {
  160. m_buffer.resize(0);
  161. if (nullptr != m_context) {
  162. delete m_context;
  163. m_context = nullptr;
  164. }
  165. // DDLNode::releaseNodes();
  166. }
  167. bool OpenDDLParser::validate() {
  168. if (m_buffer.empty()) {
  169. return true;
  170. }
  171. if (!isCharacter(m_buffer[0]) && !isNumeric(m_buffer[0])) {
  172. return false;
  173. }
  174. return true;
  175. }
  176. bool OpenDDLParser::parse() {
  177. if (m_buffer.empty()) {
  178. return false;
  179. }
  180. normalizeBuffer(m_buffer);
  181. if (!validate()) {
  182. return false;
  183. }
  184. m_context = new Context;
  185. m_context->m_root = DDLNode::create("root", "", nullptr);
  186. pushNode(m_context->m_root);
  187. // do the main parsing
  188. char *current(&m_buffer[0]);
  189. char *end(&m_buffer[m_buffer.size() - 1] + 1);
  190. size_t pos(current - &m_buffer[0]);
  191. while (pos < m_buffer.size()) {
  192. current = parseNextNode(current, end);
  193. if (current == nullptr) {
  194. return false;
  195. }
  196. pos = current - &m_buffer[0];
  197. }
  198. return true;
  199. }
  200. bool OpenDDLParser::exportContext(Context *ctx, const std::string &filename) {
  201. if (nullptr == ctx) {
  202. return false;
  203. }
  204. OpenDDLExport myExporter;
  205. return myExporter.exportContext(ctx, filename);
  206. }
  207. char *OpenDDLParser::parseNextNode(char *in, char *end) {
  208. in = parseHeader(in, end);
  209. in = parseStructure(in, end);
  210. return in;
  211. }
  212. #ifdef DEBUG_HEADER_NAME
  213. static void dumpId(Identifier *id) {
  214. if (nullptr != id) {
  215. if (nullptr != id->m_text.m_buffer) {
  216. std::cout << id->m_text.m_buffer << std::endl;
  217. }
  218. }
  219. }
  220. #endif
  221. char *OpenDDLParser::parseHeader(char *in, char *end) {
  222. if (nullptr == in || in == end) {
  223. return in;
  224. }
  225. Text *id(nullptr);
  226. in = OpenDDLParser::parseIdentifier(in, end, &id);
  227. #ifdef DEBUG_HEADER_NAME
  228. dumpId(id);
  229. #endif // DEBUG_HEADER_NAME
  230. in = lookForNextToken(in, end);
  231. if (nullptr != id) {
  232. // store the node
  233. DDLNode *node(createDDLNode(id, this));
  234. if (nullptr != node) {
  235. pushNode(node);
  236. } else {
  237. std::cerr << "nullptr returned by creating DDLNode." << std::endl;
  238. }
  239. delete id;
  240. Name *name(nullptr);
  241. in = OpenDDLParser::parseName(in, end, &name);
  242. if (nullptr != name && nullptr != node && nullptr != name->m_id->m_buffer) {
  243. const std::string nodeName(name->m_id->m_buffer);
  244. node->setName(nodeName);
  245. delete name;
  246. }
  247. Property *first(nullptr);
  248. in = lookForNextToken(in, end);
  249. if (*in == Grammar::OpenPropertyToken[0]) {
  250. in++;
  251. Property *prop(nullptr), *prev(nullptr);
  252. while (*in != Grammar::ClosePropertyToken[0] && in != end) {
  253. in = OpenDDLParser::parseProperty(in, end, &prop);
  254. in = lookForNextToken(in, end);
  255. if (*in != Grammar::CommaSeparator[0] && *in != Grammar::ClosePropertyToken[0]) {
  256. logInvalidTokenError(in, Grammar::ClosePropertyToken, m_logCallback);
  257. return nullptr;
  258. }
  259. if (nullptr != prop && *in != Grammar::CommaSeparator[0]) {
  260. if (nullptr == first) {
  261. first = prop;
  262. }
  263. if (nullptr != prev) {
  264. prev->m_next = prop;
  265. }
  266. prev = prop;
  267. }
  268. }
  269. ++in;
  270. }
  271. // set the properties
  272. if (nullptr != first && nullptr != node) {
  273. node->setProperties(first);
  274. }
  275. }
  276. return in;
  277. }
  278. char *OpenDDLParser::parseStructure(char *in, char *end) {
  279. if (nullptr == in || in == end) {
  280. return in;
  281. }
  282. bool error(false);
  283. in = lookForNextToken(in, end);
  284. if (*in == *Grammar::OpenBracketToken) {
  285. // loop over all children ( data and nodes )
  286. do {
  287. in = parseStructureBody(in, end, error);
  288. if (in == nullptr) {
  289. return nullptr;
  290. }
  291. } while (*in != *Grammar::CloseBracketToken);
  292. ++in;
  293. } else {
  294. ++in;
  295. logInvalidTokenError(in, std::string(Grammar::OpenBracketToken), m_logCallback);
  296. error = true;
  297. return nullptr;
  298. }
  299. in = lookForNextToken(in, end);
  300. // pop node from stack after successful parsing
  301. if (!error) {
  302. popNode();
  303. }
  304. return in;
  305. }
  306. static void setNodeValues(DDLNode *currentNode, Value *values) {
  307. if (nullptr != values) {
  308. if (nullptr != currentNode) {
  309. currentNode->setValue(values);
  310. }
  311. }
  312. }
  313. static void setNodeReferences(DDLNode *currentNode, Reference *refs) {
  314. if (nullptr != refs) {
  315. if (nullptr != currentNode) {
  316. currentNode->setReferences(refs);
  317. }
  318. }
  319. }
  320. static void setNodeDataArrayList(DDLNode *currentNode, DataArrayList *dtArrayList) {
  321. if (nullptr != dtArrayList) {
  322. if (nullptr != currentNode) {
  323. currentNode->setDataArrayList(dtArrayList);
  324. }
  325. }
  326. }
  327. char *OpenDDLParser::parseStructureBody(char *in, char *end, bool &error) {
  328. if (!isNumeric(*in) && !isCharacter(*in)) {
  329. ++in;
  330. }
  331. in = lookForNextToken(in, end);
  332. Value::ValueType type(Value::ValueType::ddl_none);
  333. size_t arrayLen(0);
  334. in = OpenDDLParser::parsePrimitiveDataType(in, end, type, arrayLen);
  335. if (Value::ValueType::ddl_none != type) {
  336. // parse a primitive data type
  337. in = lookForNextToken(in, end);
  338. if (*in == Grammar::OpenBracketToken[0]) {
  339. Reference *refs(nullptr);
  340. DataArrayList *dtArrayList(nullptr);
  341. Value *values(nullptr);
  342. if (1 == arrayLen) {
  343. size_t numRefs(0), numValues(0);
  344. in = parseDataList(in, end, type, &values, numValues, &refs, numRefs);
  345. setNodeValues(top(), values);
  346. setNodeReferences(top(), refs);
  347. } else if (arrayLen > 1) {
  348. in = parseDataArrayList(in, end, type, &dtArrayList);
  349. setNodeDataArrayList(top(), dtArrayList);
  350. } else {
  351. std::cerr << "0 for array is invalid." << std::endl;
  352. error = true;
  353. }
  354. }
  355. in = lookForNextToken(in, end);
  356. if (*in != '}') {
  357. logInvalidTokenError(in, std::string(Grammar::CloseBracketToken), m_logCallback);
  358. return nullptr;
  359. } else {
  360. //in++;
  361. }
  362. } else {
  363. // parse a complex data type
  364. in = parseNextNode(in, end);
  365. }
  366. return in;
  367. }
  368. void OpenDDLParser::pushNode(DDLNode *node) {
  369. if (nullptr == node) {
  370. return;
  371. }
  372. m_stack.push_back(node);
  373. }
  374. DDLNode *OpenDDLParser::popNode() {
  375. if (m_stack.empty()) {
  376. return nullptr;
  377. }
  378. DDLNode *topNode(top());
  379. m_stack.pop_back();
  380. return topNode;
  381. }
  382. DDLNode *OpenDDLParser::top() {
  383. if (m_stack.empty()) {
  384. return nullptr;
  385. }
  386. DDLNode *top(m_stack.back());
  387. return top;
  388. }
  389. DDLNode *OpenDDLParser::getRoot() const {
  390. if (nullptr == m_context) {
  391. return nullptr;
  392. }
  393. return m_context->m_root;
  394. }
  395. Context *OpenDDLParser::getContext() const {
  396. return m_context;
  397. }
  398. void OpenDDLParser::normalizeBuffer(std::vector<char> &buffer) {
  399. if (buffer.empty()) {
  400. return;
  401. }
  402. std::vector<char> newBuffer;
  403. const size_t len(buffer.size());
  404. char *end(&buffer[len - 1] + 1);
  405. for (size_t readIdx = 0; readIdx < len; ++readIdx) {
  406. char *c(&buffer[readIdx]);
  407. // check for a comment
  408. if (isCommentOpenTag(c, end)) {
  409. ++readIdx;
  410. while (!isCommentCloseTag(&buffer[readIdx], end)) {
  411. ++readIdx;
  412. }
  413. ++readIdx;
  414. } else if (!isComment<char>(c, end) && !isNewLine(*c)) {
  415. newBuffer.push_back(buffer[readIdx]);
  416. } else {
  417. if (isComment<char>(c, end)) {
  418. ++readIdx;
  419. // skip the comment and the rest of the line
  420. while (!isEndofLine(buffer[readIdx])) {
  421. ++readIdx;
  422. }
  423. }
  424. }
  425. }
  426. buffer = newBuffer;
  427. }
  428. char *OpenDDLParser::parseName(char *in, char *end, Name **name) {
  429. *name = nullptr;
  430. if (nullptr == in || in == end) {
  431. return in;
  432. }
  433. // ignore blanks
  434. in = lookForNextToken(in, end);
  435. if (*in != '$' && *in != '%') {
  436. return in;
  437. }
  438. NameType ntype(GlobalName);
  439. if (*in == '%') {
  440. ntype = LocalName;
  441. }
  442. in++;
  443. Name *currentName(nullptr);
  444. Text *id(nullptr);
  445. in = parseIdentifier(in, end, &id);
  446. if (id) {
  447. currentName = new Name(ntype, id);
  448. if (currentName) {
  449. *name = currentName;
  450. }
  451. }
  452. return in;
  453. }
  454. char *OpenDDLParser::parseIdentifier(char *in, char *end, Text **id) {
  455. *id = nullptr;
  456. if (nullptr == in || in == end) {
  457. return in;
  458. }
  459. // ignore blanks
  460. in = lookForNextToken(in, end);
  461. if (in == end) {
  462. return in;
  463. }
  464. // staring with a number is forbidden
  465. if (isNumeric<const char>(*in)) {
  466. return in;
  467. }
  468. // get size of id
  469. size_t idLen(0);
  470. char *start(in);
  471. while (!isSeparator(*in) &&
  472. !isNewLine(*in) && (in != end) &&
  473. *in != Grammar::OpenPropertyToken[0] &&
  474. *in != Grammar::ClosePropertyToken[0] &&
  475. *in != '$') {
  476. ++in;
  477. ++idLen;
  478. }
  479. const size_t len(idLen);
  480. *id = new Text(start, len);
  481. return in;
  482. }
  483. char *OpenDDLParser::parsePrimitiveDataType(char *in, char *end, Value::ValueType &type, size_t &len) {
  484. type = Value::ValueType::ddl_none;
  485. len = 0;
  486. if (nullptr == in || in == end) {
  487. return in;
  488. }
  489. size_t prim_len(0);
  490. for (size_t i = 0; i < (size_t) Value::ValueType::ddl_types_max; i++) {
  491. prim_len = strlen(Grammar::PrimitiveTypeToken[i]);
  492. if (0 == strncmp(in, Grammar::PrimitiveTypeToken[i], prim_len)) {
  493. type = static_cast<Value::ValueType>(i);
  494. break;
  495. }
  496. }
  497. if (Value::ValueType::ddl_none == type) {
  498. in = lookForNextToken(in, end);
  499. return in;
  500. } else {
  501. in += prim_len;
  502. }
  503. bool ok(true);
  504. if (*in == Grammar::OpenArrayToken[0]) {
  505. ok = false;
  506. ++in;
  507. char *start(in);
  508. while (in != end) {
  509. ++in;
  510. if (*in == Grammar::CloseArrayToken[0]) {
  511. len = ::atoi(start);
  512. ok = true;
  513. ++in;
  514. break;
  515. }
  516. }
  517. } else {
  518. len = 1;
  519. }
  520. if (!ok) {
  521. type = Value::ValueType::ddl_none;
  522. }
  523. return in;
  524. }
  525. char *OpenDDLParser::parseReference(char *in, char *end, std::vector<Name *> &names) {
  526. if (nullptr == in || in == end) {
  527. return in;
  528. }
  529. Name *nextName(nullptr);
  530. in = parseName(in, end, &nextName);
  531. if (nextName) {
  532. names.push_back(nextName);
  533. }
  534. while (Grammar::CommaSeparator[0] == *in) {
  535. in = getNextSeparator(in, end);
  536. if (Grammar::CommaSeparator[0] == *in) {
  537. in = parseName(in, end, &nextName);
  538. if (nextName) {
  539. names.push_back(nextName);
  540. }
  541. } else {
  542. break;
  543. }
  544. }
  545. return in;
  546. }
  547. char *OpenDDLParser::parseBooleanLiteral(char *in, char *end, Value **boolean) {
  548. *boolean = nullptr;
  549. if (nullptr == in || in == end) {
  550. return in;
  551. }
  552. in = lookForNextToken(in, end);
  553. char *start(in);
  554. size_t len(0);
  555. while (!isSeparator(*in) && in != end) {
  556. ++in;
  557. ++len;
  558. }
  559. ++len;
  560. int res = ::strncmp(Grammar::BoolTrue, start, strlen(Grammar::BoolTrue));
  561. if (0 != res) {
  562. res = ::strncmp(Grammar::BoolFalse, start, strlen(Grammar::BoolFalse));
  563. if (0 != res) {
  564. *boolean = nullptr;
  565. return in;
  566. }
  567. *boolean = ValueAllocator::allocPrimData(Value::ValueType::ddl_bool);
  568. (*boolean)->setBool(false);
  569. } else {
  570. *boolean = ValueAllocator::allocPrimData(Value::ValueType::ddl_bool);
  571. (*boolean)->setBool(true);
  572. }
  573. return in;
  574. }
  575. char *OpenDDLParser::parseIntegerLiteral(char *in, char *end, Value **integer, Value::ValueType integerType) {
  576. *integer = nullptr;
  577. if (nullptr == in || in == end) {
  578. return in;
  579. }
  580. if (!(isIntegerType(integerType) || isUnsignedIntegerType(integerType))) {
  581. return in;
  582. }
  583. in = lookForNextToken(in, end);
  584. char *start(in);
  585. while (!isSeparator(*in) && in != end) {
  586. ++in;
  587. }
  588. if (isNumeric(*start)) {
  589. #ifdef OPENDDL_NO_USE_CPP11
  590. const int64 value(atol(start)); // maybe not really 64bit as atoll is but exists without c++11
  591. const uint64 uvalue(strtoul(start, nullptr, 10));
  592. #else
  593. const int64 value(atoll(start));
  594. const uint64 uvalue(strtoull(start, nullptr, 10));
  595. #endif
  596. *integer = ValueAllocator::allocPrimData(integerType);
  597. switch (integerType) {
  598. case Value::ValueType::ddl_int8:
  599. (*integer)->setInt8((int8)value);
  600. break;
  601. case Value::ValueType::ddl_int16:
  602. (*integer)->setInt16((int16)value);
  603. break;
  604. case Value::ValueType::ddl_int32:
  605. (*integer)->setInt32((int32)value);
  606. break;
  607. case Value::ValueType::ddl_int64:
  608. (*integer)->setInt64((int64)value);
  609. break;
  610. case Value::ValueType::ddl_unsigned_int8:
  611. (*integer)->setUnsignedInt8((uint8)uvalue);
  612. break;
  613. case Value::ValueType::ddl_unsigned_int16:
  614. (*integer)->setUnsignedInt16((uint16)uvalue);
  615. break;
  616. case Value::ValueType::ddl_unsigned_int32:
  617. (*integer)->setUnsignedInt32((uint32)uvalue);
  618. break;
  619. case Value::ValueType::ddl_unsigned_int64:
  620. (*integer)->setUnsignedInt64((uint64)uvalue);
  621. break;
  622. default:
  623. break;
  624. }
  625. }
  626. return in;
  627. }
  628. char *OpenDDLParser::parseFloatingLiteral(char *in, char *end, Value **floating, Value::ValueType floatType) {
  629. *floating = nullptr;
  630. if (nullptr == in || in == end) {
  631. return in;
  632. }
  633. in = lookForNextToken(in, end);
  634. char *start(in);
  635. while (!isSeparator(*in) && in != end) {
  636. ++in;
  637. }
  638. // parse the float value
  639. bool ok(false);
  640. if (isHexLiteral(start, end)) {
  641. parseHexaLiteral(start, end, floating);
  642. return in;
  643. }
  644. if (isNumeric(*start)) {
  645. ok = true;
  646. } else {
  647. if (*start == '-') {
  648. if (isNumeric(*(start + 1))) {
  649. ok = true;
  650. }
  651. }
  652. }
  653. if (ok) {
  654. if (floatType == Value::ValueType::ddl_double) {
  655. const double value(atof(start));
  656. *floating = ValueAllocator::allocPrimData(Value::ValueType::ddl_double);
  657. (*floating)->setDouble(value);
  658. } else {
  659. const float value((float)atof(start));
  660. *floating = ValueAllocator::allocPrimData(Value::ValueType::ddl_float);
  661. (*floating)->setFloat(value);
  662. }
  663. }
  664. return in;
  665. }
  666. char *OpenDDLParser::parseStringLiteral(char *in, char *end, Value **stringData) {
  667. *stringData = nullptr;
  668. if (nullptr == in || in == end) {
  669. return in;
  670. }
  671. in = lookForNextToken(in, end);
  672. size_t len(0);
  673. char *start(in);
  674. if (*start == '\"') {
  675. ++start;
  676. ++in;
  677. while (*in != '\"' && in != end) {
  678. ++in;
  679. ++len;
  680. }
  681. *stringData = ValueAllocator::allocPrimData(Value::ValueType::ddl_string, len);
  682. ::strncpy((char *)(*stringData)->m_data, start, len);
  683. (*stringData)->m_data[len] = '\0';
  684. ++in;
  685. }
  686. return in;
  687. }
  688. static void createPropertyWithData(Text *id, Value *primData, Property **prop) {
  689. if (nullptr != primData) {
  690. (*prop) = new Property(id);
  691. (*prop)->m_value = primData;
  692. }
  693. }
  694. char *OpenDDLParser::parseHexaLiteral(char *in, char *end, Value **data) {
  695. *data = nullptr;
  696. if (nullptr == in || in == end) {
  697. return in;
  698. }
  699. in = lookForNextToken(in, end);
  700. if (*in != '0') {
  701. return in;
  702. }
  703. ++in;
  704. if (*in != 'x' && *in != 'X') {
  705. return in;
  706. }
  707. ++in;
  708. bool ok(true);
  709. char *start(in);
  710. int pos(0);
  711. while (!isSeparator(*in) && in != end) {
  712. if ((*in < '0' && *in > '9') || (*in < 'a' && *in > 'f') || (*in < 'A' && *in > 'F')) {
  713. ok = false;
  714. break;
  715. }
  716. ++pos;
  717. ++in;
  718. }
  719. if (!ok) {
  720. return in;
  721. }
  722. int value(0);
  723. while (pos > 0) {
  724. int v = hex2Decimal(*start);
  725. --pos;
  726. value = (value << 4) | v;
  727. ++start;
  728. }
  729. *data = ValueAllocator::allocPrimData(Value::ValueType::ddl_unsigned_int64);
  730. if (nullptr != *data) {
  731. (*data)->setUnsignedInt64(value);
  732. }
  733. return in;
  734. }
  735. char *OpenDDLParser::parseProperty(char *in, char *end, Property **prop) {
  736. *prop = nullptr;
  737. if (nullptr == in || in == end) {
  738. return in;
  739. }
  740. in = lookForNextToken(in, end);
  741. Text *id = nullptr;
  742. in = parseIdentifier(in, end, &id);
  743. if (nullptr != id) {
  744. in = lookForNextToken(in, end);
  745. if (*in == '=') {
  746. ++in;
  747. in = getNextToken(in, end);
  748. Value *primData(nullptr);
  749. if (isInteger(in, end)) {
  750. in = parseIntegerLiteral(in, end, &primData);
  751. createPropertyWithData(id, primData, prop);
  752. } else if (isFloat(in, end)) {
  753. in = parseFloatingLiteral(in, end, &primData);
  754. createPropertyWithData(id, primData, prop);
  755. } else if (isStringLiteral(*in)) { // string data
  756. in = parseStringLiteral(in, end, &primData);
  757. createPropertyWithData(id, primData, prop);
  758. } else { // reference data
  759. std::vector<Name *> names;
  760. in = parseReference(in, end, names);
  761. if (!names.empty()) {
  762. Reference *ref = new Reference(names.size(), &names[0]);
  763. (*prop) = new Property(id);
  764. (*prop)->m_ref = ref;
  765. }
  766. }
  767. } else {
  768. delete id;
  769. }
  770. }
  771. return in;
  772. }
  773. char *OpenDDLParser::parseDataList(char *in, char *end, Value::ValueType type, Value **data,
  774. size_t &numValues, Reference **refs, size_t &numRefs) {
  775. *data = nullptr;
  776. numValues = numRefs = 0;
  777. if (nullptr == in || in == end) {
  778. return in;
  779. }
  780. in = lookForNextToken(in, end);
  781. if (*in == '{') {
  782. ++in;
  783. Value *current(nullptr), *prev(nullptr);
  784. while ('}' != *in) {
  785. current = nullptr;
  786. in = lookForNextToken(in, end);
  787. if (Value::ValueType::ddl_ref == type) {
  788. std::vector<Name *> names;
  789. in = parseReference(in, end, names);
  790. if (!names.empty()) {
  791. Reference *ref = new Reference(names.size(), &names[0]);
  792. *refs = ref;
  793. numRefs = names.size();
  794. }
  795. } else if (Value::ValueType::ddl_none == type) {
  796. if (isInteger(in, end)) {
  797. in = parseIntegerLiteral(in, end, &current);
  798. } else if (isFloat(in, end)) {
  799. in = parseFloatingLiteral(in, end, &current);
  800. } else if (isStringLiteral(*in)) {
  801. in = parseStringLiteral(in, end, &current);
  802. } else if (isHexLiteral(in, end)) {
  803. in = parseHexaLiteral(in, end, &current);
  804. }
  805. } else {
  806. switch (type) {
  807. case Value::ValueType::ddl_int8:
  808. case Value::ValueType::ddl_int16:
  809. case Value::ValueType::ddl_int32:
  810. case Value::ValueType::ddl_int64:
  811. case Value::ValueType::ddl_unsigned_int8:
  812. case Value::ValueType::ddl_unsigned_int16:
  813. case Value::ValueType::ddl_unsigned_int32:
  814. case Value::ValueType::ddl_unsigned_int64:
  815. in = parseIntegerLiteral(in, end, &current, type);
  816. break;
  817. case Value::ValueType::ddl_half:
  818. case Value::ValueType::ddl_float:
  819. case Value::ValueType::ddl_double:
  820. in = parseFloatingLiteral(in, end, &current, type);
  821. break;
  822. case Value::ValueType::ddl_string:
  823. in = parseStringLiteral(in, end, &current);
  824. break;
  825. default:
  826. break;
  827. }
  828. }
  829. if (nullptr != current) {
  830. if (nullptr == *data) {
  831. *data = current;
  832. prev = current;
  833. } else {
  834. prev->setNext(current);
  835. prev = current;
  836. }
  837. ++numValues;
  838. }
  839. in = getNextSeparator(in, end);
  840. if (',' != *in && Grammar::CloseBracketToken[0] != *in && !isSpace(*in)) {
  841. break;
  842. }
  843. }
  844. ++in;
  845. }
  846. return in;
  847. }
  848. static DataArrayList *createDataArrayList(Value *currentValue, size_t numValues,
  849. Reference *refs, size_t numRefs) {
  850. DataArrayList *dataList(new DataArrayList);
  851. dataList->m_dataList = currentValue;
  852. dataList->m_numItems = numValues;
  853. dataList->m_refs = refs;
  854. dataList->m_numRefs = numRefs;
  855. return dataList;
  856. }
  857. char *OpenDDLParser::parseDataArrayList(char *in, char *end, Value::ValueType type,
  858. DataArrayList **dataArrayList) {
  859. if (nullptr == dataArrayList) {
  860. return in;
  861. }
  862. *dataArrayList = nullptr;
  863. if (nullptr == in || in == end) {
  864. return in;
  865. }
  866. in = lookForNextToken(in, end);
  867. if (*in == Grammar::OpenBracketToken[0]) {
  868. ++in;
  869. Value *currentValue(nullptr);
  870. Reference *refs(nullptr);
  871. DataArrayList *prev(nullptr), *currentDataList(nullptr);
  872. do {
  873. size_t numRefs(0), numValues(0);
  874. currentValue = nullptr;
  875. in = parseDataList(in, end, type, &currentValue, numValues, &refs, numRefs);
  876. if (nullptr != currentValue || 0 != numRefs) {
  877. if (nullptr == prev) {
  878. *dataArrayList = createDataArrayList(currentValue, numValues, refs, numRefs);
  879. prev = *dataArrayList;
  880. } else {
  881. currentDataList = createDataArrayList(currentValue, numValues, refs, numRefs);
  882. if (nullptr != prev) {
  883. prev->m_next = currentDataList;
  884. prev = currentDataList;
  885. }
  886. }
  887. }
  888. } while (Grammar::CommaSeparator[0] == *in && in != end);
  889. in = lookForNextToken(in, end);
  890. ++in;
  891. }
  892. return in;
  893. }
  894. const char *OpenDDLParser::getVersion() {
  895. return Version;
  896. }
  897. END_ODDLPARSER_NS