forked from python/cpython
-
Notifications
You must be signed in to change notification settings - Fork 5
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
pythongh-97005: Update libexpat from 2.4.7 to 2.4.9 (pythongh-97006)
Co-authored-by: Gregory P. Smith [Google] <[email protected]> (cherry picked from commit 10e3d39) Co-authored-by: Dong-hee Na <[email protected]>
- Loading branch information
1 parent
246a044
commit b6a9c32
Showing
8 changed files
with
28 additions
and
17 deletions.
There are no files selected for viewing
1 change: 1 addition & 0 deletions
1
Misc/NEWS.d/next/Library/2022-09-22-14-35-02.gh-issue-97005.yf21Q7.rst
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1 @@ | ||
Update bundled libexpat to 2.4.9 |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -28,7 +28,7 @@ | |
Copyright (c) 2002-2003 Fred L. Drake, Jr. <[email protected]> | ||
Copyright (c) 2002-2006 Karl Waclawek <[email protected]> | ||
Copyright (c) 2003 Greg Stein <[email protected]> | ||
Copyright (c) 2016-2021 Sebastian Pipping <[email protected]> | ||
Copyright (c) 2016-2022 Sebastian Pipping <[email protected]> | ||
Copyright (c) 2018 Yury Gribov <[email protected]> | ||
Copyright (c) 2019 David Loffredo <[email protected]> | ||
Licensed under the MIT license: | ||
|
@@ -107,7 +107,9 @@ | |
|
||
#include <limits.h> // ULONG_MAX | ||
|
||
#if defined(_WIN32) && ! defined(__USE_MINGW_ANSI_STDIO) | ||
#if defined(_WIN32) \ | ||
&& (! defined(__USE_MINGW_ANSI_STDIO) \ | ||
|| (1 - __USE_MINGW_ANSI_STDIO - 1 == 0)) | ||
# define EXPAT_FMT_ULL(midpart) "%" midpart "I64u" | ||
# if defined(_WIN64) // Note: modifiers "td" and "zu" do not work for MinGW | ||
# define EXPAT_FMT_PTRDIFF_T(midpart) "%" midpart "I64d" | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,4 +1,4 @@ | ||
/* fcb1a62fefa945567301146eb98e3ad3413e823a41c4378e84e8b6b6f308d824 (2.4.7+) | ||
/* 90815a2b2c80c03b2b889fe1d427bb2b9e3282aa065e42784e001db4f23de324 (2.4.9+) | ||
__ __ _ | ||
___\ \/ /_ __ __ _| |_ | ||
/ _ \\ /| '_ \ / _` | __| | ||
|
@@ -19,7 +19,7 @@ | |
Copyright (c) 2016 Gustavo Grieco <[email protected]> | ||
Copyright (c) 2016 Pascal Cuoq <[email protected]> | ||
Copyright (c) 2016 Ed Schouten <[email protected]> | ||
Copyright (c) 2017-2018 Rhodri James <[email protected]> | ||
Copyright (c) 2017-2022 Rhodri James <[email protected]> | ||
Copyright (c) 2017 Václav Slavík <[email protected]> | ||
Copyright (c) 2017 Viktor Szakats <[email protected]> | ||
Copyright (c) 2017 Chanho Park <[email protected]> | ||
|
@@ -4271,7 +4271,7 @@ processXmlDecl(XML_Parser parser, int isGeneralTextEntity, const char *s, | |
const XML_Char *storedEncName = NULL; | ||
const ENCODING *newEncoding = NULL; | ||
const char *version = NULL; | ||
const char *versionend; | ||
const char *versionend = NULL; | ||
const XML_Char *storedversion = NULL; | ||
int standalone = -1; | ||
|
||
|
@@ -5826,10 +5826,15 @@ internalEntityProcessor(XML_Parser parser, const char *s, const char *end, | |
{ | ||
parser->m_processor = contentProcessor; | ||
/* see externalEntityContentProcessor vs contentProcessor */ | ||
return doContent(parser, parser->m_parentParser ? 1 : 0, parser->m_encoding, | ||
s, end, nextPtr, | ||
(XML_Bool)! parser->m_parsingStatus.finalBuffer, | ||
XML_ACCOUNT_DIRECT); | ||
result = doContent(parser, parser->m_parentParser ? 1 : 0, | ||
parser->m_encoding, s, end, nextPtr, | ||
(XML_Bool)! parser->m_parsingStatus.finalBuffer, | ||
XML_ACCOUNT_DIRECT); | ||
if (result == XML_ERROR_NONE) { | ||
if (! storeRawNames(parser)) | ||
return XML_ERROR_NO_MEMORY; | ||
} | ||
return result; | ||
} | ||
} | ||
|
||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -21,6 +21,7 @@ | |
Copyright (c) 2017 José Gutiérrez de la Concha <[email protected]> | ||
Copyright (c) 2019 David Loffredo <[email protected]> | ||
Copyright (c) 2021 Dong-hee Na <[email protected]> | ||
Copyright (c) 2022 Martin Ettl <[email protected]> | ||
Licensed under the MIT license: | ||
Permission is hereby granted, free of charge, to any person obtaining | ||
|
@@ -296,7 +297,7 @@ sb_charMatches(const ENCODING *enc, const char *p, int c) { | |
} | ||
#else | ||
/* c is an ASCII character */ | ||
# define CHAR_MATCHES(enc, p, c) (*(p) == c) | ||
# define CHAR_MATCHES(enc, p, c) (*(p) == (c)) | ||
#endif | ||
|
||
#define PREFIX(ident) normal_##ident | ||
|
@@ -740,7 +741,7 @@ DEFINE_UTF16_TO_UTF16(big2_) | |
((p)[1] == 0 ? ((struct normal_encoding *)(enc))->type[(unsigned char)*(p)] \ | ||
: unicode_byte_type((p)[1], (p)[0])) | ||
#define LITTLE2_BYTE_TO_ASCII(p) ((p)[1] == 0 ? (p)[0] : -1) | ||
#define LITTLE2_CHAR_MATCHES(p, c) ((p)[1] == 0 && (p)[0] == c) | ||
#define LITTLE2_CHAR_MATCHES(p, c) ((p)[1] == 0 && (p)[0] == (c)) | ||
#define LITTLE2_IS_NAME_CHAR_MINBPC(p) \ | ||
UCS2_GET_NAMING(namePages, (unsigned char)p[1], (unsigned char)p[0]) | ||
#define LITTLE2_IS_NMSTRT_CHAR_MINBPC(p) \ | ||
|
@@ -875,7 +876,7 @@ static const struct normal_encoding internal_little2_encoding | |
? ((struct normal_encoding *)(enc))->type[(unsigned char)(p)[1]] \ | ||
: unicode_byte_type((p)[0], (p)[1])) | ||
#define BIG2_BYTE_TO_ASCII(p) ((p)[0] == 0 ? (p)[1] : -1) | ||
#define BIG2_CHAR_MATCHES(p, c) ((p)[0] == 0 && (p)[1] == c) | ||
#define BIG2_CHAR_MATCHES(p, c) ((p)[0] == 0 && (p)[1] == (c)) | ||
#define BIG2_IS_NAME_CHAR_MINBPC(p) \ | ||
UCS2_GET_NAMING(namePages, (unsigned char)p[0], (unsigned char)p[1]) | ||
#define BIG2_IS_NMSTRT_CHAR_MINBPC(p) \ | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
|
@@ -16,6 +16,7 @@ | |
Copyright (c) 2018 Anton Maklakov <[email protected]> | ||
Copyright (c) 2019 David Loffredo <[email protected]> | ||
Copyright (c) 2020 Boris Kolpackov <[email protected]> | ||
Copyright (c) 2022 Martin Ettl <[email protected]> | ||
Licensed under the MIT license: | ||
Permission is hereby granted, free of charge, to any person obtaining | ||
|
@@ -96,7 +97,7 @@ | |
|
||
# define CHECK_NMSTRT_CASE(n, enc, ptr, end, nextTokPtr) \ | ||
case BT_LEAD##n: \ | ||
if (end - ptr < n) \ | ||
if ((end) - (ptr) < (n)) \ | ||
return XML_TOK_PARTIAL_CHAR; \ | ||
if (IS_INVALID_CHAR(enc, ptr, n) || ! IS_NMSTRT_CHAR(enc, ptr, n)) { \ | ||
*nextTokPtr = ptr; \ | ||
|
@@ -124,7 +125,8 @@ | |
# define PREFIX(ident) ident | ||
# endif | ||
|
||
# define HAS_CHARS(enc, ptr, end, count) (end - ptr >= count * MINBPC(enc)) | ||
# define HAS_CHARS(enc, ptr, end, count) \ | ||
((end) - (ptr) >= ((count)*MINBPC(enc))) | ||
|
||
# define HAS_CHAR(enc, ptr, end) HAS_CHARS(enc, ptr, end, 1) | ||
|
||
|