OpenDDLParser.cpp 26 KB

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