cppcheck/externals/tinyxml/tinyxml2.cpp at master · CoderGears/cppcheck · GitHub

History

2248 lines (1861 loc) · 54.7 KB

Raw

100

101

102

103

104

105

106

107

108

109

110

111

112

113

114

115

116

117

118

119

120

121

122

123

124

125

126

127

128

129

130

131

132

133

134

135

136

137

138

139

140

141

142

143

144

145

146

147

148

149

150

151

152

153

154

155

156

157

158

159

160

161

162

163

164

165

166

167

168

169

170

171

172

173

174

175

176

177

178

179

180

181

182

183

184

185

186

187

188

189

190

191

192

193

194

195

196

197

198

199

200

201

202

203

204

205

206

207

208

209

210

211

212

213

214

215

216

217

218

219

220

221

222

223

224

225

226

227

228

229

230

231

232

233

234

235

236

237

238

239

240

241

242

243

244

245

246

247

248

249

250

251

252

253

254

255

256

257

258

259

260

261

262

263

264

265

266

267

268

269

270

271

272

273

274

275

276

277

278

279

280

281

282

283

284

285

286

287

288

289

290

291

292

293

294

295

296

297

298

299

300

301

302

303

304

305

306

307

308

309

310

311

312

313

314

315

316

317

318

319

320

321

322

323

324

325

326

327

328

329

330

331

332

333

334

335

336

337

338

339

340

341

342

343

344

345

346

347

348

349

350

351

352

353

354

355

356

357

358

359

360

361

362

363

364

365

366

367

368

369

370

371

372

373

374

375

376

377

378

379

380

381

382

383

384

385

386

387

388

389

390

391

392

393

394

395

396

397

398

399

400

401

402

403

404

405

406

407

408

409

410

411

412

413

414

415

416

417

418

419

420

421

422

423

424

425

426

427

428

429

430

431

432

433

434

435

436

437

438

439

440

441

442

443

444

445

446

447

448

449

450

451

452

453

454

455

456

457

458

459

460

461

462

463

464

465

466

467

468

469

470

471

472

473

474

475

476

477

478

479

480

481

482

483

484

485

486

487

488

489

490

491

492

493

494

495

496

497

498

499

500

501

502

503

504

505

506

507

508

509

510

511

512

513

514

515

516

517

518

519

520

521

522

523

524

525

526

527

528

529

530

531

532

533

534

535

536

537

538

539

540

541

542

543

544

545

546

547

548

549

550

551

552

553

554

555

556

557

558

559

560

561

562

563

564

565

566

567

568

569

570

571

572

573

574

575

576

577

578

579

580

581

582

583

584

585

586

587

588

589

590

591

592

593

594

595

596

597

598

599

600

601

602

603

604

605

606

607

608

609

610

611

612

613

614

615

616

617

618

619

620

621

622

623

624

625

626

627

628

629

630

631

632

633

634

635

636

637

638

639

640

641

642

643

644

645

646

647

648

649

650

651

652

653

654

655

656

657

658

659

660

661

662

663

664

665

666

667

668

669

670

671

672

673

674

675

676

677

678

679

680

681

682

683

684

685

686

687

688

689

690

691

692

693

694

695

696

697

698

699

700

701

702

703

704

705

706

707

708

709

710

711

712

713

714

715

716

717

718

719

720

721

722

723

724

725

726

727

728

729

730

731

732

733

734

735

736

737

738

739

740

741

742

743

744

745

746

747

748

749

750

751

752

753

754

755

756

757

758

759

760

761

762

763

764

765

766

767

768

769

770

771

772

773

774

775

776

777

778

779

780

781

782

783

784

785

786

787

788

789

790

791

792

793

794

795

796

797

798

799

800

801

802

803

804

805

806

807

808

809

810

811

812

813

814

815

816

817

818

819

820

821

822

823

824

825

826

827

828

829

830

831

832

833

834

835

836

837

838

839

840

841

842

843

844

845

846

847

848

849

850

851

852

853

854

855

856

857

858

859

860

861

862

863

864

865

866

867

868

869

870

871

872

873

874

875

876

877

878

879

880

881

882

883

884

885

886

887

888

889

890

891

892

893

894

895

896

897

898

899

900

901

902

903

904

905

906

907

908

909

910

911

912

913

914

915

916

917

918

919

920

921

922

923

924

925

926

927

928

929

930

931

932

933

934

935

936

937

938

939

940

941

942

943

944

945

946

947

948

949

950

951

952

953

954

955

956

957

958

959

960

961

962

963

964

965

966

967

968

969

970

971

972

973

974

975

976

977

978

979

980

981

982

983

984

985

986

987

988

989

990

991

992

993

994

995

996

997

998

999

1000

Original code by Lee Thomason (www.grinninglizard.com)

This software is provided 'as-is', without any express or implied

warranty. In no event will the authors be held liable for any

damages arising from the use of this software.

Permission is granted to anyone to use this software for any

purpose, including commercial applications, and to alter it and

redistribute it freely, subject to the following restrictions:

1. The origin of this software must not be misrepresented; you must

not claim that you wrote the original software. If you use this

software in a product, an acknowledgment in the product documentation

would be appreciated but is not required.

2. Altered source versions must be plainly marked as such, and

must not be misrepresented as being the original software.

3. This notice may not be removed or altered from any source

distribution.

#include "tinyxml2.h"

#include <new> // yes, this one new style header, is in the Android SDK.

# ifdef ANDROID_NDK

# include <stddef.h>

#else

# include <cstddef>

#endif

static const char LINE_FEED = (char)0x0a; // all line endings are normalized to LF

static const char LF = LINE_FEED;

static const char CARRIAGE_RETURN = (char)0x0d; // CR gets filtered out

static const char CR = CARRIAGE_RETURN;

static const char SINGLE_QUOTE = '\'';

static const char DOUBLE_QUOTE = '\"';

// Bunch of unicode info at:

// http://www.unicode.org/faq/utf_bom.html

// ef bb bf (Microsoft "lead bytes") - designates UTF-8

static const unsigned char TIXML_UTF_LEAD_0 = 0xefU;

static const unsigned char TIXML_UTF_LEAD_1 = 0xbbU;

static const unsigned char TIXML_UTF_LEAD_2 = 0xbfU;

namespace tinyxml2

{

struct Entity {

const char* pattern;

int length;

char value;

};

static const int NUM_ENTITIES = 5;

static const Entity entities[NUM_ENTITIES] = {

{ "quot", 4, DOUBLE_QUOTE },

{ "amp", 3, '&' },

{ "apos", 4, SINGLE_QUOTE },

{ "lt", 2, '<' },

{ "gt", 2, '>' }

};

StrPair::~StrPair()

{

Reset();

}

void StrPair::Reset()

{

if ( _flags & NEEDS_DELETE ) {

delete [] _start;

}

_flags = 0;

_start = 0;

_end = 0;

}

void StrPair::SetStr( const char* str, int flags )

{

Reset();

size_t len = strlen( str );

_start = new char[ len+1 ];

memcpy( _start, str, len+1 );

_end = _start + len;

_flags = flags | NEEDS_DELETE;

}

char* StrPair::ParseText( char* p, const char* endTag, int strFlags )

{

TIXMLASSERT( endTag && *endTag );

char* start = p;

char endChar = *endTag;

size_t length = strlen( endTag );

// Inner loop of text parsing.

while ( *p ) {

if ( *p == endChar && strncmp( p, endTag, length ) == 0 ) {

Set( start, p, strFlags );

return p + length;

}

++p;

}

return 0;

}

char* StrPair::ParseName( char* p )

{

if ( !p || !(*p) ) {

return 0;

}

char* const start = p;

while( *p && ( p == start ? XMLUtil::IsNameStartChar( *p ) : XMLUtil::IsNameChar( *p ) )) {

++p;

}

if ( p > start ) {

Set( start, p, 0 );

return p;

}

return 0;

}

void StrPair::CollapseWhitespace()

{

// Adjusting _start would cause undefined behavior on delete[]

TIXMLASSERT( ( _flags & NEEDS_DELETE ) == 0 );

// Trim leading space.

_start = XMLUtil::SkipWhiteSpace( _start );

if ( _start && *_start ) {

char* p = _start; // the read pointer

char* q = _start; // the write pointer

while( *p ) {

if ( XMLUtil::IsWhiteSpace( *p )) {

p = XMLUtil::SkipWhiteSpace( p );

if ( *p == 0 ) {

break; // don't write to q; this trims the trailing space.

}

*q = ' ';

++q;

}

*q = *p;

++q;

++p;

}

*q = 0;

}

const char* StrPair::GetStr()

{

if ( _flags & NEEDS_FLUSH ) {

*_end = 0;

_flags ^= NEEDS_FLUSH;

if ( _flags ) {

char* p = _start; // the read pointer

char* q = _start; // the write pointer

while( p < _end ) {

if ( (_flags & NEEDS_NEWLINE_NORMALIZATION) && *p == CR ) {

// CR-LF pair becomes LF

// CR alone becomes LF

// LF-CR becomes LF

if ( *(p+1) == LF ) {

p += 2;

}

else {

++p;

}

*q++ = LF;

}

else if ( (_flags & NEEDS_NEWLINE_NORMALIZATION) && *p == LF ) {

if ( *(p+1) == CR ) {

p += 2;

}

else {

++p;

}

*q++ = LF;

}

else if ( (_flags & NEEDS_ENTITY_PROCESSING) && *p == '&' ) {

// Entities handled by tinyXML2:

// - special entities in the entity table [in/out]

// - numeric character reference [in]

// 中 or 中

if ( *(p+1) == '#' ) {

const int buflen = 10;

char buf[buflen] = { 0 };

int len = 0;

p = const_cast<char*>( XMLUtil::GetCharacterRef( p, buf, &len ) );

TIXMLASSERT( 0 <= len && len <= buflen );

TIXMLASSERT( q + len <= p );

memcpy( q, buf, len );

q += len;

}

else {

int i=0;

for(; i<NUM_ENTITIES; ++i ) {

const Entity& entity = entities[i];

if ( strncmp( p + 1, entity.pattern, entity.length ) == 0

&& *( p + entity.length + 1 ) == ';' ) {

// Found an entity - convert.

*q = entity.value;

++q;

p += entity.length + 2;

break;

}

if ( i == NUM_ENTITIES ) {

// fixme: treat as error?

++p;

++q;

}

else {

*q = *p;

++p;

++q;

}

*q = 0;

}

// The loop below has plenty going on, and this

// is a less useful mode. Break it out.

if ( _flags & COLLAPSE_WHITESPACE ) {

CollapseWhitespace();

}

_flags = (_flags & NEEDS_DELETE);

}

return _start;

}

// --------- XMLUtil ----------- //

const char* XMLUtil::ReadBOM( const char* p, bool* bom )

{

*bom = false;

const unsigned char* pu = reinterpret_cast<const unsigned char*>(p);

// Check for BOM:

if ( *(pu+0) == TIXML_UTF_LEAD_0

&& *(pu+1) == TIXML_UTF_LEAD_1

&& *(pu+2) == TIXML_UTF_LEAD_2 ) {

*bom = true;

p += 3;

}

return p;

}

void XMLUtil::ConvertUTF32ToUTF8( unsigned long input, char* output, int* length )

{

const unsigned long BYTE_MASK = 0xBF;

const unsigned long BYTE_MARK = 0x80;

const unsigned long FIRST_BYTE_MARK[7] = { 0x00, 0x00, 0xC0, 0xE0, 0xF0, 0xF8, 0xFC };

if (input < 0x80) {

*length = 1;

}

else if ( input < 0x800 ) {

*length = 2;

}

else if ( input < 0x10000 ) {

*length = 3;

}

else if ( input < 0x200000 ) {

*length = 4;

}

else {

*length = 0; // This code won't covert this correctly anyway.

return;

}

output += *length;

// Scary scary fall throughs.

switch (*length) {

case 4:

--output;

*output = (char)((input | BYTE_MARK) & BYTE_MASK);

input >>= 6;

case 3:

--output;

*output = (char)((input | BYTE_MARK) & BYTE_MASK);

input >>= 6;

case 2:

--output;

*output = (char)((input | BYTE_MARK) & BYTE_MASK);

input >>= 6;

case 1:

--output;

*output = (char)(input | FIRST_BYTE_MARK[*length]);

default:

break;

}

const char* XMLUtil::GetCharacterRef( const char* p, char* value, int* length )

{

// Presume an entity, and pull it out.

*length = 0;

if ( *(p+1) == '#' && *(p+2) ) {

unsigned long ucs = 0;

ptrdiff_t delta = 0;

unsigned mult = 1;

if ( *(p+2) == 'x' ) {

// Hexadecimal.

if ( !*(p+3) ) {

return 0;

}

const char* q = p+3;

q = strchr( q, ';' );

if ( !q || !*q ) {

return 0;

}

delta = q-p;

--q;

while ( *q != 'x' ) {

if ( *q >= '0' && *q <= '9' ) {

ucs += mult * (*q - '0');

}

else if ( *q >= 'a' && *q <= 'f' ) {

ucs += mult * (*q - 'a' + 10);

}

else if ( *q >= 'A' && *q <= 'F' ) {

ucs += mult * (*q - 'A' + 10 );

}

else {

return 0;

}

mult *= 16;

--q;

}

else {

// Decimal.

if ( !*(p+2) ) {

return 0;

}

const char* q = p+2;

q = strchr( q, ';' );

if ( !q || !*q ) {

return 0;

}

delta = q-p;

--q;

while ( *q != '#' ) {

if ( *q >= '0' && *q <= '9' ) {

ucs += mult * (*q - '0');

}

else {

return 0;

}

mult *= 10;

--q;

}

// convert the UCS to UTF-8

ConvertUTF32ToUTF8( ucs, value, length );

return p + delta + 1;

}

return p+1;

}

void XMLUtil::ToStr( int v, char* buffer, int bufferSize )

{

TIXML_SNPRINTF( buffer, bufferSize, "%d", v );

}

void XMLUtil::ToStr( unsigned v, char* buffer, int bufferSize )

{

TIXML_SNPRINTF( buffer, bufferSize, "%u", v );

}

void XMLUtil::ToStr( bool v, char* buffer, int bufferSize )

{

TIXML_SNPRINTF( buffer, bufferSize, "%d", v ? 1 : 0 );

}

ToStr() of a number is a very tricky topic.

https://github.com/leethomason/tinyxml2/issues/106

void XMLUtil::ToStr( float v, char* buffer, int bufferSize )

{

TIXML_SNPRINTF( buffer, bufferSize, "%.8g", v );

}

void XMLUtil::ToStr( double v, char* buffer, int bufferSize )

{

TIXML_SNPRINTF( buffer, bufferSize, "%.17g", v );

}

bool XMLUtil::ToInt( const char* str, int* value )

{

if ( TIXML_SSCANF( str, "%d", value ) == 1 ) {

return true;

}

return false;

}

bool XMLUtil::ToUnsigned( const char* str, unsigned *value )

{

if ( TIXML_SSCANF( str, "%u", value ) == 1 ) {

return true;

}

return false;

}

bool XMLUtil::ToBool( const char* str, bool* value )

{

int ival = 0;

if ( ToInt( str, &ival )) {

*value = (ival==0) ? false : true;

return true;

}

if ( StringEqual( str, "true" ) ) {

*value = true;

return true;

}

else if ( StringEqual( str, "false" ) ) {

*value = false;

return true;

}

return false;

}

bool XMLUtil::ToFloat( const char* str, float* value )

{

if ( TIXML_SSCANF( str, "%f", value ) == 1 ) {

return true;

}

return false;

}

bool XMLUtil::ToDouble( const char* str, double* value )

{

if ( TIXML_SSCANF( str, "%lf", value ) == 1 ) {

return true;

}

return false;

}

char* XMLDocument::Identify( char* p, XMLNode** node )

{

char* const start = p;

p = XMLUtil::SkipWhiteSpace( p );

if( !p || !*p ) {

return p;

}

// What is this thing?

// These strings define the matching patters:

static const char* xmlHeader = { "<?" };

static const char* commentHeader = { "<!--" };

static const char* dtdHeader = { "<!" };

static const char* cdataHeader = { "<![CDATA[" };

static const char* elementHeader = { "<" }; // and a header for everything else; check last.

static const int xmlHeaderLen = 2;

static const int commentHeaderLen = 4;

static const int dtdHeaderLen = 2;

static const int cdataHeaderLen = 9;

static const int elementHeaderLen = 1;

#if defined(_MSC_VER)

#pragma warning ( push )

#pragma warning ( disable : 4127 )

#endif

TIXMLASSERT( sizeof( XMLComment ) == sizeof( XMLUnknown ) ); // use same memory pool

TIXMLASSERT( sizeof( XMLComment ) == sizeof( XMLDeclaration ) ); // use same memory pool

#if defined(_MSC_VER)

#pragma warning (pop)

#endif

XMLNode* returnNode = 0;

if ( XMLUtil::StringEqual( p, xmlHeader, xmlHeaderLen ) ) {

returnNode = new (_commentPool.Alloc()) XMLDeclaration( this );

returnNode->_memPool = &_commentPool;

p += xmlHeaderLen;

}

else if ( XMLUtil::StringEqual( p, commentHeader, commentHeaderLen ) ) {

returnNode = new (_commentPool.Alloc()) XMLComment( this );

returnNode->_memPool = &_commentPool;

p += commentHeaderLen;

}

else if ( XMLUtil::StringEqual( p, cdataHeader, cdataHeaderLen ) ) {

XMLText* text = new (_textPool.Alloc()) XMLText( this );

returnNode = text;

returnNode->_memPool = &_textPool;

p += cdataHeaderLen;

text->SetCData( true );

}

else if ( XMLUtil::StringEqual( p, dtdHeader, dtdHeaderLen ) ) {

returnNode = new (_commentPool.Alloc()) XMLUnknown( this );

returnNode->_memPool = &_commentPool;

p += dtdHeaderLen;

}

else if ( XMLUtil::StringEqual( p, elementHeader, elementHeaderLen ) ) {

returnNode = new (_elementPool.Alloc()) XMLElement( this );

returnNode->_memPool = &_elementPool;

p += elementHeaderLen;

}

else {

returnNode = new (_textPool.Alloc()) XMLText( this );

returnNode->_memPool = &_textPool;

p = start; // Back it up, all the text counts.

}

*node = returnNode;

return p;

}

bool XMLDocument::Accept( XMLVisitor* visitor ) const

{

if ( visitor->VisitEnter( *this ) ) {

for ( const XMLNode* node=FirstChild(); node; node=node->NextSibling() ) {

if ( !node->Accept( visitor ) ) {

break;

}

return visitor->VisitExit( *this );

}

// --------- XMLNode ----------- //

XMLNode::XMLNode( XMLDocument* doc ) :

_document( doc ),

_parent( 0 ),

_firstChild( 0 ), _lastChild( 0 ),

_prev( 0 ), _next( 0 ),

_memPool( 0 )

{

}

XMLNode::~XMLNode()

{

DeleteChildren();

if ( _parent ) {

_parent->Unlink( this );

}

const char* XMLNode::Value() const

{

return _value.GetStr();

}

void XMLNode::SetValue( const char* str, bool staticMem )

{

if ( staticMem ) {

_value.SetInternedStr( str );

}

else {

_value.SetStr( str );

}

void XMLNode::DeleteChildren()

{

while( _firstChild ) {

XMLNode* node = _firstChild;

Unlink( node );

DeleteNode( node );

}

_firstChild = _lastChild = 0;

}

void XMLNode::Unlink( XMLNode* child )

{

if ( child == _firstChild ) {

_firstChild = _firstChild->_next;

}

if ( child == _lastChild ) {

_lastChild = _lastChild->_prev;

}

if ( child->_prev ) {

child->_prev->_next = child->_next;

}

if ( child->_next ) {

child->_next->_prev = child->_prev;

}

child->_parent = 0;

}

void XMLNode::DeleteChild( XMLNode* node )

{

TIXMLASSERT( node->_parent == this );

DeleteNode( node );

}

XMLNode* XMLNode::InsertEndChild( XMLNode* addThis )

{

if (addThis->_document != _document)

return 0;

if (addThis->_parent)

addThis->_parent->Unlink( addThis );

else

addThis->_memPool->SetTracked();

if ( _lastChild ) {

TIXMLASSERT( _firstChild );

TIXMLASSERT( _lastChild->_next == 0 );

_lastChild->_next = addThis;

addThis->_prev = _lastChild;

_lastChild = addThis;

addThis->_next = 0;

}

else {

TIXMLASSERT( _firstChild == 0 );

_firstChild = _lastChild = addThis;

addThis->_prev = 0;

addThis->_next = 0;

}

addThis->_parent = this;

return addThis;

}

XMLNode* XMLNode::InsertFirstChild( XMLNode* addThis )

{

if (addThis->_document != _document)

return 0;

if (addThis->_parent)

addThis->_parent->Unlink( addThis );

else

addThis->_memPool->SetTracked();

if ( _firstChild ) {

TIXMLASSERT( _lastChild );

TIXMLASSERT( _firstChild->_prev == 0 );

_firstChild->_prev = addThis;

addThis->_next = _firstChild;

_firstChild = addThis;

addThis->_prev = 0;

}

else {

TIXMLASSERT( _lastChild == 0 );

_firstChild = _lastChild = addThis;

addThis->_prev = 0;

addThis->_next = 0;

}

addThis->_parent = this;

return addThis;

}

XMLNode* XMLNode::InsertAfterChild( XMLNode* afterThis, XMLNode* addThis )

{

if (addThis->_document != _document)

return 0;

TIXMLASSERT( afterThis->_parent == this );

if ( afterThis->_parent != this ) {

return 0;

}

if ( afterThis->_next == 0 ) {

// The last node or the only node.

return InsertEndChild( addThis );

}

if (addThis->_parent)

addThis->_parent->Unlink( addThis );

else

addThis->_memPool->SetTracked();

addThis->_prev = afterThis;

addThis->_next = afterThis->_next;

afterThis->_next->_prev = addThis;

afterThis->_next = addThis;

addThis->_parent = this;

return addThis;

}

const XMLElement* XMLNode::FirstChildElement( const char* value ) const

{

for( XMLNode* node=_firstChild; node; node=node->_next ) {

XMLElement* element = node->ToElement();

if ( element ) {

if ( !value || XMLUtil::StringEqual( element->Name(), value ) ) {

return element;

}

return 0;

}

const XMLElement* XMLNode::LastChildElement( const char* value ) const

{

for( XMLNode* node=_lastChild; node; node=node->_prev ) {

XMLElement* element = node->ToElement();

if ( element ) {

if ( !value || XMLUtil::StringEqual( element->Name(), value ) ) {

return element;

}

return 0;

}

const XMLElement* XMLNode::NextSiblingElement( const char* value ) const

{

for( XMLNode* node=this->_next; node; node = node->_next ) {

const XMLElement* element = node->ToElement();

if ( element

&& (!value || XMLUtil::StringEqual( value, node->Value() ))) {

return element;

}

return 0;

}

const XMLElement* XMLNode::PreviousSiblingElement( const char* value ) const

{

for( XMLNode* node=_prev; node; node = node->_prev ) {

const XMLElement* element = node->ToElement();

if ( element

&& (!value || XMLUtil::StringEqual( value, node->Value() ))) {

return element;

}

return 0;

}

char* XMLNode::ParseDeep( char* p, StrPair* parentEnd )

{

// This is a recursive method, but thinking about it "at the current level"

// it is a pretty simple flat list:

// <foo/>

//

// With a special case:

// <foo>

// </foo>

//

// Where the closing element (/foo) *must* be the next thing after the opening

// element, and the names must match. BUT the tricky bit is that the closing

// element will be read by the child.

// 'endTag' is the end tag for this node, it is returned by a call to a child.

// 'parentEnd' is the end tag for the parent, which is filled in and returned.

while( p && *p ) {

XMLNode* node = 0;

p = _document->Identify( p, &node );

if ( p == 0 || node == 0 ) {

break;

}

StrPair endTag;

p = node->ParseDeep( p, &endTag );

if ( !p ) {

DeleteNode( node );

node = 0;

if ( !_document->Error() ) {

_document->SetError( XML_ERROR_PARSING, 0, 0 );

}

break;

}

XMLElement* ele = node->ToElement();

// We read the end tag. Return it to the parent.

if ( ele && ele->ClosingType() == XMLElement::CLOSING ) {

if ( parentEnd ) {

*parentEnd = ele->_value;

}

node->_memPool->SetTracked(); // created and then immediately deleted.

DeleteNode( node );

return p;

}

// Handle an end tag returned to this level.

// And handle a bunch of annoying errors.

if ( ele ) {

bool mismatch = false;

if ( endTag.Empty() && ele->ClosingType() == XMLElement::OPEN ) {

mismatch = true;

}

else if ( !endTag.Empty() && ele->ClosingType() != XMLElement::OPEN ) {

mismatch = true;

}

else if ( !endTag.Empty() ) {

if ( !XMLUtil::StringEqual( endTag.GetStr(), node->Value() )) {

mismatch = true;

}

if ( mismatch ) {

_document->SetError( XML_ERROR_MISMATCHED_ELEMENT, node->Value(), 0 );

p = 0;

}

if ( p == 0 ) {

DeleteNode( node );

node = 0;

}

if ( node ) {

this->InsertEndChild( node );

}

return 0;

}

void XMLNode::DeleteNode( XMLNode* node )

{

if ( node == 0 ) {

return;

}

MemPool* pool = node->_memPool;

node->~XMLNode();

pool->Free( node );

}

// --------- XMLText ---------- //

char* XMLText::ParseDeep( char* p, StrPair* )

{

const char* start = p;

if ( this->CData() ) {

p = _value.ParseText( p, "]]>", StrPair::NEEDS_NEWLINE_NORMALIZATION );

if ( !p ) {

_document->SetError( XML_ERROR_PARSING_CDATA, start, 0 );

}

return p;

}

else {

int flags = _document->ProcessEntities() ? StrPair::TEXT_ELEMENT : StrPair::TEXT_ELEMENT_LEAVE_ENTITIES;

if ( _document->WhitespaceMode() == COLLAPSE_WHITESPACE ) {

flags |= StrPair::COLLAPSE_WHITESPACE;

}

p = _value.ParseText( p, "<", flags );

if ( !p ) {

_document->SetError( XML_ERROR_PARSING_TEXT, start, 0 );

}

if ( p && *p ) {

return p-1;

}

return 0;

}

XMLNode* XMLText::ShallowClone( XMLDocument* doc ) const

{

if ( !doc ) {

doc = _document;

}

XMLText* text = doc->NewText( Value() ); // fixme: this will always allocate memory. Intern?

text->SetCData( this->CData() );

return text;

}

bool XMLText::ShallowEqual( const XMLNode* compare ) const

{

const XMLText* text = compare->ToText();

return ( text && XMLUtil::StringEqual( text->Value(), Value() ) );

}

bool XMLText::Accept( XMLVisitor* visitor ) const

{

return visitor->Visit( *this );

}

// --------- XMLComment ---------- //

XMLComment::XMLComment( XMLDocument* doc ) : XMLNode( doc )

{

}

XMLComment::~XMLComment()

{

}

char* XMLComment::ParseDeep( char* p, StrPair* )

{

// Comment parses as text.

const char* start = p;

p = _value.ParseText( p, "-->", StrPair::COMMENT );

if ( p == 0 ) {

_document->SetError( XML_ERROR_PARSING_COMMENT, start, 0 );

}

return p;

}

XMLNode* XMLComment::ShallowClone( XMLDocument* doc ) const

{

if ( !doc ) {

doc = _document;

}

XMLComment* comment = doc->NewComment( Value() ); // fixme: this will always allocate memory. Intern?

return comment;

}

bool XMLComment::ShallowEqual( const XMLNode* compare ) const

{

const XMLComment* comment = compare->ToComment();

return ( comment && XMLUtil::StringEqual( comment->Value(), Value() ));

}

bool XMLComment::Accept( XMLVisitor* visitor ) const

{

return visitor->Visit( *this );

}

// --------- XMLDeclaration ---------- //

XMLDeclaration::XMLDeclaration( XMLDocument* doc ) : XMLNode( doc )

{

}

XMLDeclaration::~XMLDeclaration()

{

//printf( "~XMLDeclaration\n" );

}

char* XMLDeclaration::ParseDeep( char* p, StrPair* )

{

// Declaration parses as text.

const char* start = p;

p = _value.ParseText( p, "?>", StrPair::NEEDS_NEWLINE_NORMALIZATION );

if ( p == 0 ) {

_document->SetError( XML_ERROR_PARSING_DECLARATION, start, 0 );

}

return p;

}

XMLNode* XMLDeclaration::ShallowClone( XMLDocument* doc ) const

View remainder of file in raw view

cppcheck/externals/tinyxml/tinyxml2.cpp at master · CoderGears/cppcheck · GitHub

Expand file tree

Breadcrumbs

tinyxml2.cpp

Latest commit

History

Breadcrumbs

tinyxml2.cpp

File metadata and controls