/* 628e24d4966bedbd4800f6ed128d06d29703765b4bce12d3b7f099f90f842fc9 (2.6.0+)

/* 2a14271ad4d35e82bde8ba210b4edb7998794bcbae54deab114046a300f9639a (2.6.2+)

__ __ _

___\ \/ /_ __ __ _| |_

/ _ \\ /| '_ \ / _` | __|

Copyright (c) 2022 Jann Horn <jannh@google.com>

Copyright (c) 2022 Sean McBride <sean@rogue-research.com>

Copyright (c) 2023 Owain Davies <owaind@bath.edu>

Copyright (c) 2023 Sony Corporation / Snild Dolkow <snild@sony.com>

Copyright (c) 2023-2024 Sony Corporation / Snild Dolkow <snild@sony.com>

Licensed under the MIT license:

Permission is hereby granted, free of charge, to any person obtaining

#endif

/* Round up n to be a multiple of sz, where sz is a power of 2. */

#define ROUND_UP(n, sz) (((n) + ((sz)-1)) & ~((sz)-1))

#define ROUND_UP(n, sz) (((n) + ((sz) - 1)) & ~((sz) - 1))

/* Do safe (NULL-aware) pointer arithmetic */

#define EXPAT_SAFE_PTR_DIFF(p, q) (((p) && (q)) ? ((p) - (q)) : 0)

it odd, since odd numbers are always relative prime to a power of 2.

*/

#define SECOND_HASH(hash, mask, power) \

((((hash) & ~(mask)) >> ((power)-1)) & ((mask) >> 2))

((((hash) & ~(mask)) >> ((power) - 1)) & ((mask) >> 2))

#define PROBE_STEP(hash, mask, power) \

((unsigned char)((SECOND_HASH(hash, mask, power)) | 1))

? 0 \

: ((*((pool)->ptr)++ = c), 1))

XML_Bool g_reparseDeferralEnabledDefault = XML_TRUE; // write ONLY in runtests.c

unsigned int g_parseAttempts = 0; // used for testing only

#if ! defined(XML_TESTING)

const

#endif

XML_Bool g_reparseDeferralEnabledDefault

= XML_TRUE; // write ONLY in runtests.c

#if defined(XML_TESTING)

unsigned int g_bytesScanned = 0; // used for testing only

#endif

struct XML_ParserStruct {

/* The first member must be m_userData so that the XML_GetUserData

return XML_ERROR_NONE;

}

}

g_parseAttempts += 1;

#if defined(XML_TESTING)

g_bytesScanned += (unsigned)have_now;

#endif

const enum XML_Error ret = parser->m_processor(parser, start, end, endPtr);

if (ret == XML_ERROR_NONE) {

// if we consumed nothing, remember what we had on this parse attempt.

dtd->keepProcessing = dtd->standalone;

goto endEntityValue;

}

if (entity->open) {

if (entity->open || (entity == parser->m_declEntity)) {

if (enc == parser->m_encoding)

parser->m_eventPtr = entityTextPtr;

result = XML_ERROR_RECURSIVE_ENTITY_REF;

static float

accountingGetCurrentAmplification(XML_Parser rootParser) {

// 1.........1.........12 => 22

const size_t lenOfShortestInclude = sizeof("<!ENTITY a SYSTEM 'b'>") - 1;

const XmlBigCount countBytesOutput

= rootParser->m_accounting.countBytesDirect

+ rootParser->m_accounting.countBytesIndirect;

const float amplificationFactor

= rootParser->m_accounting.countBytesDirect

? (countBytesOutput

/ (float)(rootParser->m_accounting.countBytesDirect))

: 1.0f;

: ((lenOfShortestInclude

+ rootParser->m_accounting.countBytesIndirect)

/ (float)lenOfShortestInclude);

assert(! rootParser->m_parentParser);

return amplificationFactor;

}