Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Submit feedback
Contribute to GitLab
Sign in
Toggle navigation
L
libxml2
Project
Project
Details
Activity
Releases
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
0
Issues
0
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Registry
Registry
Wiki
Wiki
External Wiki
External Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
BC
public
external
libxml2
Commits
bb654feb
Commit
bb654feb
authored
Apr 13, 2016
by
Jan Pokorný
Committed by
Daniel Veillard
Apr 15, 2016
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Fix typos: dictio{ nn -> n }ar{y,ies}
Signed-off-by:
Jan Pokorný
<
jpokorny@redhat.com
>
parent
9811ce78
Changes
20
Hide whitespace changes
Inline
Side-by-side
Showing
20 changed files
with
93 additions
and
93 deletions
+93
-93
ChangeLog
ChangeLog
+12
-12
HTMLparser.c
HTMLparser.c
+1
-1
NEWS
NEWS
+11
-11
debugXML.c
debugXML.c
+5
-5
dict.c
dict.c
+25
-25
index.py
doc/index.py
+3
-3
dict.h
include/libxml/dict.h
+3
-3
parser.h
include/libxml/parser.h
+2
-2
hash_dict.txt
optim/hash_dict.txt
+1
-1
parser.c
parser.c
+3
-3
libxml.c
python/libxml.c
+1
-1
rngparser.c
rngparser.c
+1
-1
schematron.c
schematron.c
+2
-2
testapi.c
testapi.c
+7
-7
tree.c
tree.c
+7
-7
valid.c
valid.c
+1
-1
xmlreader.c
xmlreader.c
+4
-4
xmlregexp.c
xmlregexp.c
+2
-2
xmlschemas.c
xmlschemas.c
+1
-1
xpath.c
xpath.c
+1
-1
No files found.
ChangeLog
View file @
bb654feb
...
...
@@ -593,7 +593,7 @@ Thu Apr 24 13:56:53 CEST 2008 Daniel Veillard <daniel@veillard.com>
Tue Apr 22 10:27:17 CEST 2008 Daniel Veillard <daniel@veillard.com>
* dict.c: improvement on the hashing of the diction
n
ary, with visible
* dict.c: improvement on the hashing of the dictionary, with visible
speed up as the number of strings in the hash increases, work from
Stefan Behnel
...
...
@@ -5017,7 +5017,7 @@ Mon Jan 24 00:47:41 CET 2005 Daniel Veillard <daniel@veillard.com>
Sun
Jan
23
23
:
54
:
39
CET
2005
Daniel
Veillard
<
daniel
@
veillard
.
com
>
*
hash
.
c
include
/
libxml
/
hash
.
h
:
added
xmlHashCreateDict
where
the
hash
reuses
the
diction
n
ary
for
internal
strings
the
hash
reuses
the
dictionary
for
internal
strings
*
entities
.
c
valid
.
c
parser
.
c
:
reuse
that
new
API
,
leads
to
a
decent
speedup
when
parsing
for
example
DocBook
documents
.
...
...
@@ -5371,7 +5371,7 @@ Fri Nov 26 11:44:36 CET 2004 Daniel Veillard <daniel@veillard.com>
Wed Nov 24 13:41:52 CET 2004 Daniel Veillard <daniel@veillard.com>
* dict.c include/libxml/dict.h: added xmlDictExists() to the
diction
n
ary interface.
dictionary interface.
* xmlreader.c: applying xmlTextReaderHasAttributes fix for namespaces
from Rob Richards
...
...
@@ -5697,7 +5697,7 @@ Tue Oct 26 23:57:02 CEST 2004 Daniel Veillard <daniel@veillard.com>
Tue Oct 26 18:09:59 CEST 2004 Daniel Veillard <daniel@veillard.com>
* debugXML.c include/libxml/xmlerror.h: added checking for names
values and diction
n
aries generates a tons of errors
values and dictionaries generates a tons of errors
* SAX2.ccatalog.c parser.c relaxng.c tree.c xinclude.c xmlwriter.c
include/libxml/tree.h: fixing the errors in the regression tests
...
...
@@ -7746,14 +7746,14 @@ Fri Jan 23 14:03:21 CET 2004 Daniel Veillard <daniel@veillard.com>
make tests
* xpath.c include/libxml/xpath.h: added xmlXPathCtxtCompile() to
compile an XPath expression within a context, currently the goal
is to be able to reuse the XSLT stylesheet diction
n
ary, but this
is to be able to reuse the XSLT stylesheet dictionary, but this
opens the door to others possible optimizations.
* dict.c include/libxml/dict.h: added xmlDictCreateSub() which allows
to build a new diction
nary based on another read-only diction
nary.
This is needed for XSLT to keep the stylesheet diction
n
ary read-only
to build a new diction
ary based on another read-only dictio
nary.
This is needed for XSLT to keep the stylesheet dictionary read-only
while being able to reuse the strings for the transformation
diction
n
ary.
* xinclude.c: fixed a diction
nar
reference counting problem occuring
dictionary.
* xinclude.c: fixed a diction
ary
reference counting problem occuring
when document parsing failed.
* testSAX.c: adding option --repeat for timing 100times the parsing
* doc/* : rebuilt all the docs
...
...
@@ -7806,7 +7806,7 @@ Mon Jan 12 17:22:57 CET 2004 Daniel Veillard <daniel@veillard.com>
Thu Jan 8 17:57:50 CET 2004 Daniel Veillard <daniel@veillard.com>
* xmlschemas.c: removed a memory leak remaining from the switch
to a diction
n
ary for string allocations c.f. #130891
to a dictionary for string allocations c.f. #130891
Thu Jan 8 17:48:46 CET 2004 Daniel Veillard <daniel@veillard.com>
...
...
@@ -7928,7 +7928,7 @@ Fri Jan 2 22:58:29 HKT 2004 William Brack <wbrack@mmm.com.hk>
Fri Jan 2 11:40:06 CET 2004 Daniel Veillard <daniel@veillard.com>
* SAX2.c: found and fixed a bug misallocating some non
blank text node strings from the diction
n
ary.
blank text node strings from the dictionary.
* xmlmemory.c: fixed a problem with the memory debug mutex
release.
...
...
@@ -9386,7 +9386,7 @@ Sat Sep 27 01:25:39 CEST 2003 Daniel Veillard <daniel@veillard.com>
* parser.c: William's change allowed to spot a nasty bug in xmlDoRead
if the result is not well formed that ctxt->myDoc is not NULL
and uses the context diction
n
ary.
and uses the context dictionary.
Fri Sep 26 21:09:34 CEST 2003 Daniel Veillard <daniel@veillard.com>
...
...
HTMLparser.c
View file @
bb654feb
...
...
@@ -6537,7 +6537,7 @@ htmlNodeStatus(const htmlNodePtr node, int legacy) {
* DICT_FREE:
* @str: a string
*
* Free a string if it is not owned by the "dict" diction
n
ary in the
* Free a string if it is not owned by the "dict" dictionary in the
* current scope
*/
#define DICT_FREE(str) \
...
...
NEWS
View file @
bb654feb
...
...
@@ -845,7 +845,7 @@ Gansterer),
- Improvement: switch parser to XML-1.0 5th edition, add parsing flags
for old versions, switch URI parsing to RFC 3986,
add xmlSchemaValidCtxtGetParserCtxt (Holger Kaelberer),
new hashing functions for diction
n
aries (based on Stefan Behnel work),
new hashing functions for dictionaries (based on Stefan Behnel work),
improve handling of misplaced html/head/body in HTML parser, better
regression test tools and code coverage display, better algorithms
to detect various versions of the billion laughts attacks, make
...
...
@@ -1231,7 +1231,7 @@ Do not use or package 2.6.25
Bakefile support (Francesco Montorsi), Windows compilation (Joel Reed),
some gcc4 fixes, HP-UX portability fixes (Rick Jones).
- bug fixes: xmlSchemaElementDump namespace (Kasimier Buchcik), push and
xmlreader stopping on non-fatal errors, thread support for diction
n
aries
xmlreader stopping on non-fatal errors, thread support for dictionaries
reference counting (Gary Coady), internal subset and push problem, URL
saved in xmlCopyDoc, various schemas bug fixes (Kasimier), Python paths
fixup (Stephane Bidoul), xmlGetNodePath and namespaces, xmlSetNsProp fix
...
...
@@ -1244,7 +1244,7 @@ Do not use or package 2.6.25
Hendricks), aliasing bug exposed by gcc4 on s390, xmlTextReaderNext bug
(Rob Richards), Schemas decimal type fixes (William Brack),
xmlByteConsumed static buffer (Ben Maurer).
- improvement: speedup parsing comments and DTDs, diction
n
ary support for
- improvement: speedup parsing comments and DTDs, dictionary support for
hash tables, Schemas Identity constraints (Kasimier), streaming XPath
subset, xmlTextReaderReadString added (Bjorn Reese), Schemas canonical
values handling (Kasimier), add xmlTextReaderByteConsumed (Aron
...
...
@@ -1454,7 +1454,7 @@ Do not use or package 2.6.25
URI on SYSTEM lookup failure, XInclude parse flags inheritance (William),
XInclude and XPointer fixes for entities (William), XML parser bug
reported by Holger Rauch, nanohttp fd leak (William), regexps char
groups '
-
' handling (William), diction
n
ary reference counting problems,
groups '
-
' handling (William), dictionary reference counting problems,
do not close stderr.
- performance patches from Petr Pajas
- Documentation fixes: XML_CATALOG_FILES in man pages (Mike Hommey)
...
...
@@ -1482,7 +1482,7 @@ Do not use or package 2.6.25
William) reported by Yuuichi Teranishi
- bugfixes: make test and path issues, xmlWriter attribute serialization
(William Brack), xmlWriter indentation (William), schemas validation
(Eric Haszlakiewicz), XInclude diction
n
aries issues (William and Oleg
(Eric Haszlakiewicz), XInclude dictionaries issues (William and Oleg
Paraschenko), XInclude empty fallback (William), HTML warnings (William),
XPointer in XInclude (William), Python namespace serialization,
isolat1ToUTF8 bound error (Alfred Mickautsch), output of parameter
...
...
@@ -1503,7 +1503,7 @@ Do not use or package 2.6.25
2.6.5: Jan 25 2004:
- Bugfixes: diction
n
aries for schemas (William Brack), regexp segfault
- Bugfixes: dictionaries for schemas (William Brack), regexp segfault
(William), xs:all problem (William), a number of XPointer bugfixes
(William), xmllint error go to stderr, DTD validation problem with
namespace, memory leak (William), SAX1 cleanup and minimal options fixes
...
...
@@ -1515,14 +1515,14 @@ Do not use or package 2.6.25
Fleck), doc (Sven Zimmerman), I/O example.
- Python bindings: fixes (William), enum support (Stéphane Bidoul),
structured error reporting (Stéphane Bidoul)
- XInclude: various fixes for conformance, problem related to diction
n
ary
- XInclude: various fixes for conformance, problem related to dictionary
references (William & me), recursion (William)
- xmlWriter: indentation (Lucas Brasilino), memory leaks (Alfred
Mickautsch),
- xmlSchemas: normalizedString datatype (John Belmonte)
- code cleanup for strings functions (William)
- Windows: compiler patches (Mark Vakoc)
- Parser optimizations, a few new XPath and diction
n
ary APIs for future
- Parser optimizations, a few new XPath and dictionary APIs for future
XSLT optimizations.
...
...
@@ -1617,8 +1617,8 @@ Do not use or package 2.6.25
of change
- Increased the library modularity, far more options can be stripped out,
a --with-minimum configuration will weight around 160KBytes
- Use per parser and per document diction
n
ary, allocate names and small
text nodes from the diction
n
ary
- Use per parser and per document dictionary, allocate names and small
text nodes from the dictionary
- Switch to a SAX2 like parser rewrote most of the XML parser core,
provides namespace resolution and defaulted attributes, minimize memory
allocations and copies, namespace checking and specific error handling,
...
...
@@ -1665,7 +1665,7 @@ Do not use or package 2.6.25
(William), xmlCleanupParser (Marc Liyanage), CDATA output (William), HTTP
error handling.
- xmllint options: --dtdvalidfpi for Tobias Reif, --sax1 for compat
testing, --nodict for building without tree diction
n
ary, --nocdata to
testing, --nodict for building without tree dictionary, --nocdata to
replace CDATA by text, --nsclean to remove surperfluous namespace
declarations
- added xml2-config --libtool-libs option from Kevin P. Fleming
...
...
debugXML.c
View file @
bb654feb
...
...
@@ -44,10 +44,10 @@ struct _xmlDebugCtxt {
int
depth
;
/* current depth */
xmlDocPtr
doc
;
/* current document */
xmlNodePtr
node
;
/* current node */
xmlDictPtr
dict
;
/* the doc diction
n
ary */
xmlDictPtr
dict
;
/* the doc dictionary */
int
check
;
/* do just checkings */
int
errors
;
/* number of errors found */
int
nodict
;
/* if the document has no diction
n
ary */
int
nodict
;
/* if the document has no dictionary */
int
options
;
/* options */
};
...
...
@@ -243,7 +243,7 @@ xmlCtxtCheckString(xmlDebugCtxtPtr ctxt, const xmlChar * str)
* @ctxt: the debug context
* @name: the name
*
* Do debugging on the name, for example the diction
n
ary status and
* Do debugging on the name, for example the dictionary status and
* conformance to the Name production.
*/
static
void
...
...
@@ -265,7 +265,7 @@ xmlCtxtCheckName(xmlDebugCtxtPtr ctxt, const xmlChar * name)
((
ctxt
->
doc
==
NULL
)
||
((
ctxt
->
doc
->
parseFlags
&
(
XML_PARSE_SAX1
|
XML_PARSE_NODICT
))
==
0
)))
{
xmlDebugErr3
(
ctxt
,
XML_CHECK_OUTSIDE_DICT
,
"Name is not from the document diction
n
ary '%s'"
,
"Name is not from the document dictionary '%s'"
,
(
const
char
*
)
name
);
}
}
...
...
@@ -292,7 +292,7 @@ xmlCtxtGenericNodeCheck(xmlDebugCtxtPtr ctxt, xmlNodePtr node) {
/* desactivated right now as it raises too many errors */
if (doc->type == XML_DOCUMENT_NODE)
xmlDebugErr(ctxt, XML_CHECK_NO_DICT,
"Document has no diction
n
ary\n");
"Document has no dictionary\n");
#endif
ctxt
->
nodict
=
1
;
}
...
...
dict.c
View file @
bb654feb
...
...
@@ -87,7 +87,7 @@ typedef unsigned __int32 uint32_t;
#endif
/* WITH_BIG_KEY */
/*
* An entry in the diction
n
ary
* An entry in the dictionary
*/
typedef
struct
_xmlDictEntry
xmlDictEntry
;
typedef
xmlDictEntry
*
xmlDictEntryPtr
;
...
...
@@ -110,7 +110,7 @@ struct _xmlDictStrings {
xmlChar
array
[
1
];
};
/*
* The entire diction
n
ary
* The entire dictionary
*/
struct
_xmlDict
{
int
ref_counter
;
...
...
@@ -229,7 +229,7 @@ xmlDictCleanup(void) {
/*
* xmlDictAddString:
* @dict: the diction
n
ary
* @dict: the dictionary
* @name: the name of the userdata
* @len: the length of the name
*
...
...
@@ -291,7 +291,7 @@ found_pool:
/*
* xmlDictAddQString:
* @dict: the diction
n
ary
* @dict: the dictionary
* @prefix: the prefix of the userdata
* @plen: the prefix length
* @name: the name of the userdata
...
...
@@ -533,7 +533,7 @@ xmlDictComputeFastQKey(const xmlChar *prefix, int plen,
*
* Create a new dictionary
*
* Returns the newly created diction
n
ary, or NULL if an error occured.
* Returns the newly created dictionary, or NULL if an error occured.
*/
xmlDictPtr
xmlDictCreate
(
void
)
{
...
...
@@ -573,14 +573,14 @@ xmlDictCreate(void) {
/**
* xmlDictCreateSub:
* @sub: an existing diction
n
ary
* @sub: an existing dictionary
*
* Create a new dictionary, inheriting strings from the read-only
* diction
n
ary @sub. On lookup, strings are first searched in the
* new diction
n
ary, then in @sub, and if not found are created in the
* new diction
n
ary.
* dictionary @sub. On lookup, strings are first searched in the
* new dictionary, then in @sub, and if not found are created in the
* new dictionary.
*
* Returns the newly created diction
n
ary, or NULL if an error occured.
* Returns the newly created dictionary, or NULL if an error occured.
*/
xmlDictPtr
xmlDictCreateSub
(
xmlDictPtr
sub
)
{
...
...
@@ -599,7 +599,7 @@ xmlDictCreateSub(xmlDictPtr sub) {
/**
* xmlDictReference:
* @dict: the diction
n
ary
* @dict: the dictionary
*
* Increment the reference counter of a dictionary
*
...
...
@@ -620,10 +620,10 @@ xmlDictReference(xmlDictPtr dict) {
/**
* xmlDictGrow:
* @dict: the diction
n
ary
* @size: the new size of the diction
n
ary
* @dict: the dictionary
* @size: the new size of the dictionary
*
* resize the diction
n
ary
* resize the dictionary
*
* Returns 0 in case of success, -1 in case of failure
*/
...
...
@@ -755,7 +755,7 @@ xmlDictGrow(xmlDictPtr dict, size_t size) {
/**
* xmlDictFree:
* @dict: the diction
n
ary
* @dict: the dictionary
*
* Free the hash @dict and its contents. The userdata is
* deallocated with @f if provided.
...
...
@@ -817,11 +817,11 @@ xmlDictFree(xmlDictPtr dict) {
/**
* xmlDictLookup:
* @dict: the diction
n
ary
* @dict: the dictionary
* @name: the name of the userdata
* @len: the length of the name, if -1 it is recomputed
*
* Add the @name to the diction
n
ary @dict if not present.
* Add the @name to the dictionary @dict if not present.
*
* Returns the internal copy of the name or NULL in case of internal error
*/
...
...
@@ -957,11 +957,11 @@ xmlDictLookup(xmlDictPtr dict, const xmlChar *name, int len) {
/**
* xmlDictExists:
* @dict: the diction
n
ary
* @dict: the dictionary
* @name: the name of the userdata
* @len: the length of the name, if -1 it is recomputed
*
* Check if the @name exists in the diction
n
ary @dict.
* Check if the @name exists in the dictionary @dict.
*
* Returns the internal copy of the name or NULL if not found.
*/
...
...
@@ -1065,7 +1065,7 @@ xmlDictExists(xmlDictPtr dict, const xmlChar *name, int len) {
/**
* xmlDictQLookup:
* @dict: the diction
n
ary
* @dict: the dictionary
* @prefix: the prefix
* @name: the name
*
...
...
@@ -1170,7 +1170,7 @@ xmlDictQLookup(xmlDictPtr dict, const xmlChar *prefix, const xmlChar *name) {
/**
* xmlDictOwns:
* @dict: the diction
n
ary
* @dict: the dictionary
* @str: the string
*
* check if a string is owned by the disctionary
...
...
@@ -1197,11 +1197,11 @@ xmlDictOwns(xmlDictPtr dict, const xmlChar *str) {
/**
* xmlDictSize:
* @dict: the diction
n
ary
* @dict: the dictionary
*
* Query the number of elements installed in the hash @dict.
*
* Returns the number of elements in the diction
n
ary or
* Returns the number of elements in the dictionary or
* -1 in case of error
*/
int
...
...
@@ -1215,7 +1215,7 @@ xmlDictSize(xmlDictPtr dict) {
/**
* xmlDictSetLimit:
* @dict: the diction
n
ary
* @dict: the dictionary
* @limit: the limit in bytes
*
* Set a size limit for the dictionary
...
...
@@ -1236,7 +1236,7 @@ xmlDictSetLimit(xmlDictPtr dict, size_t limit) {
/**
* xmlDictGetUsage:
* @dict: the diction
n
ary
* @dict: the dictionary
*
* Get how much memory is used by a dictionary for strings
* Added in 2.9.0
...
...
doc/index.py
View file @
bb654feb
...
...
@@ -49,7 +49,7 @@ def callback(ctx, str):
libxml2
.
registerErrorHandler
(
callback
,
None
)
#
# The diction
n
ary of tables required and the SQL command needed
# The dictionary of tables required and the SQL command needed
# to create them
#
TABLES
=
{
...
...
@@ -438,12 +438,12 @@ def updateWordArchive(name, id, relevance):
print
"""UPDATE wordsArchive SET relevance='
%
d' where name='
%
s' and ID='
%
d'"""
%
(
relevance
,
name
,
id
)
print
sys
.
exc_type
,
sys
.
exc_value
return
-
1
return
ret
#########################################################################
# #
# Word diction
n
ary and analysis routines #
# Word dictionary and analysis routines #
# #
#########################################################################
...
...
include/libxml/dict.h
View file @
bb654feb
/*
* Summary: string diction
n
ary
* Summary: string dictionary
* Description: dictionary of reusable strings, just used to avoid allocation
* and freeing operations.
*
...
...
@@ -20,7 +20,7 @@ extern "C" {
#endif
/*
* The diction
n
ary.
* The dictionary.
*/
typedef
struct
_xmlDict
xmlDict
;
typedef
xmlDict
*
xmlDictPtr
;
...
...
@@ -48,7 +48,7 @@ XMLPUBFUN void XMLCALL
xmlDictFree
(
xmlDictPtr
dict
);
/*
* Lookup of entry in the diction
n
ary.
* Lookup of entry in the dictionary.
*/
XMLPUBFUN
const
xmlChar
*
XMLCALL
xmlDictLookup
(
xmlDictPtr
dict
,
...
...
include/libxml/parser.h
View file @
bb654feb
...
...
@@ -260,7 +260,7 @@ struct _xmlParserCtxt {
void
*
catalogs
;
/* document's own catalog */
int
recovery
;
/* run in recovery mode */
int
progressive
;
/* is this a progressive parsing */
xmlDictPtr
dict
;
/* diction
n
ary for the parser */
xmlDictPtr
dict
;
/* dictionary for the parser */
const
xmlChar
*
*
atts
;
/* array for the attributes callbacks */
int
maxatts
;
/* the size of the array */
int
docdict
;
/* use strings from dict to build tree */
...
...
@@ -1099,7 +1099,7 @@ typedef enum {
XML_PARSE_SAX1
=
1
<<
9
,
/* use the SAX1 interface internally */
XML_PARSE_XINCLUDE
=
1
<<
10
,
/* Implement XInclude substitition */
XML_PARSE_NONET
=
1
<<
11
,
/* Forbid network access */
XML_PARSE_NODICT
=
1
<<
12
,
/* Do not reuse the context diction
n
ary */
XML_PARSE_NODICT
=
1
<<
12
,
/* Do not reuse the context dictionary */
XML_PARSE_NSCLEAN
=
1
<<
13
,
/* remove redundant namespaces declarations */
XML_PARSE_NOCDATA
=
1
<<
14
,
/* merge CDATA as text nodes */
XML_PARSE_NOXINCNODE
=
1
<<
15
,
/* do not generate XINCLUDE START/END nodes */
...
...
optim/hash_dict.txt
View file @
bb654feb
Reuses a diction
n
ary for the hash table to reduce the string compare
Reuses a dictionary for the hash table to reduce the string compare
costs. Not worth it unless validating big DTDs
without with
...
...
parser.c
View file @
bb654feb
...
...
@@ -3625,7 +3625,7 @@ xmlParseNameAndCompare(xmlParserCtxtPtr ctxt, xmlChar const *other) {
}
/* failure (or end of input buffer), check with full function */
ret
=
xmlParseName
(
ctxt
);
/* strings coming from the diction
n
ary direct compare possible */
/* strings coming from the dictionary direct compare possible */
if
(
ret
==
other
)
{
return
(
const
xmlChar
*
)
1
;
}
...
...
@@ -8819,7 +8819,7 @@ xmlParseEndTag(xmlParserCtxtPtr ctxt) {
* @prefix: the prefix to lookup
*
* Lookup the namespace name for the @prefix (which ca be NULL)
* The prefix must come from the @ctxt->dict diction
n
ary
* The prefix must come from the @ctxt->dict dictionary
*
* Returns the namespace name or NULL if not bound
*/
...
...
@@ -14991,7 +14991,7 @@ xmlCleanupParser(void) {
* DICT_FREE:
* @str: a string
*
* Free a string if it is not owned by the "dict" diction
n
ary in the
* Free a string if it is not owned by the "dict" dictionary in the
* current scope
*/
#define DICT_FREE(str) \
...
...
python/libxml.c
View file @
bb654feb
...
...
@@ -906,7 +906,7 @@ pythonStartElement(void *user_data, const xmlChar * name,
type
=
2
;
if
(
type
!=
0
)
{
/*
* the xmllib interface always generate
a diction
nary,
* the xmllib interface always generate
s a dictio
nary,
* possibly empty
*/
if
((
attrs
==
NULL
)
&&
(
type
==
1
))
{
...
...
rngparser.c
View file @
bb654feb
...
...
@@ -95,7 +95,7 @@ struct _xmlCRelaxNGParserCtxt {
xmlHashTablePtr
datatypes
;
/*
* diction
n
ary and keywords
* dictionary and keywords
*/
xmlDictPtr
dict
;
const
xmlChar
*
key_attribute
;
...
...
schematron.c
View file @
bb654feb
...
...
@@ -133,7 +133,7 @@ struct _xmlSchematron {
int
flags
;
/* specific to this schematron */
void
*
_private
;
/* unused by the library */
xmlDictPtr
dict
;
/* the diction
n
ary used internally */
xmlDictPtr
dict
;
/* the dictionary used internally */
const
xmlChar
*
title
;
/* the title if any */
...
...
@@ -186,7 +186,7 @@ struct _xmlSchematronParserCtxt {
const
char
*
buffer
;
int
size
;
xmlDictPtr
dict
;
/* diction
n
ary for interned string names */
xmlDictPtr
dict
;
/* dictionary for interned string names */
int
nberrors
;
int
err
;
...
...
testapi.c
View file @
bb654feb
...
...
@@ -8175,7 +8175,7 @@ test_xmlDictCreateSub(void) {
int mem_base;
xmlDictPtr ret_val;
xmlDictPtr sub; /* an existing diction
n
ary */
xmlDictPtr sub; /* an existing dictionary */
int n_sub;
for (n_sub = 0;n_sub < gen_nb_xmlDictPtr;n_sub++) {
...
...
@@ -8207,7 +8207,7 @@ test_xmlDictExists(void) {
int mem_base;
const xmlChar * ret_val;
xmlDictPtr dict; /* the diction
n
ary */
xmlDictPtr dict; /* the dictionary */
int n_dict;
xmlChar * name; /* the name of the userdata */
int n_name;
...
...
@@ -8263,7 +8263,7 @@ test_xmlDictLookup(void) {
int mem_base;
const xmlChar * ret_val;
xmlDictPtr dict; /* the diction
n
ary */
xmlDictPtr dict; /* the dictionary */
int n_dict;
xmlChar * name; /* the name of the userdata */
int n_name;
...
...
@@ -8309,7 +8309,7 @@ test_xmlDictOwns(void) {
int mem_base;
int ret_val;
xmlDictPtr dict; /* the diction
n
ary */
xmlDictPtr dict; /* the dictionary */
int n_dict;
xmlChar * str; /* the string */
int n_str;
...
...
@@ -8348,7 +8348,7 @@ test_xmlDictQLookup(void) {
int mem_base;
const xmlChar * ret_val;
xmlDictPtr dict; /* the diction
n
ary */
xmlDictPtr dict; /* the dictionary */
int n_dict;
xmlChar * prefix; /* the prefix */
int n_prefix;
...
...
@@ -8394,7 +8394,7 @@ test_xmlDictReference(void) {
int mem_base;
int ret_val;
xmlDictPtr dict; /* the diction
n
ary */
xmlDictPtr dict; /* the dictionary */
int n_dict;
for (n_dict = 0;n_dict < gen_nb_xmlDictPtr;n_dict++) {
...
...
@@ -8437,7 +8437,7 @@ test_xmlDictSize(void) {
int mem_base;
int ret_val;
xmlDictPtr dict; /* the diction
n
ary */
xmlDictPtr dict; /* the dictionary */
int n_dict;
for (n_dict = 0;n_dict < gen_nb_xmlDictPtr;n_dict++) {
tree.c
View file @
bb654feb
...
...
@@ -1044,7 +1044,7 @@ xmlCreateIntSubset(xmlDocPtr doc, const xmlChar *name,
* DICT_FREE:
* @str: a string
*
* Free a string if it is not owned by the "dict" diction
n
ary in the
* Free a string if it is not owned by the "dict" dictionary in the
* current scope
*/
#define DICT_FREE(str) \
...
...
@@ -1057,7 +1057,7 @@ xmlCreateIntSubset(xmlDocPtr doc, const xmlChar *name,
* DICT_COPY:
* @str: a string
*
* Copy a string using a "dict" diction
n
ary in the current scope,
* Copy a string using a "dict" dictionary in the current scope,
* if availabe.
*/
#define DICT_COPY(str, cpy) \
...
...
@@ -1074,7 +1074,7 @@ xmlCreateIntSubset(xmlDocPtr doc, const xmlChar *name,
* DICT_CONST_COPY:
* @str: a string
*
* Copy a string using a "dict" diction
n
ary in the current scope,
* Copy a string using a "dict" dictionary in the current scope,
* if availabe.
*/
#define DICT_CONST_COPY(str, cpy) \
...
...
@@ -2270,7 +2270,7 @@ xmlNewNodeEatName(xmlNsPtr ns, xmlChar *name) {
cur
=
(
xmlNodePtr
)
xmlMalloc
(
sizeof
(
xmlNode
));
if
(
cur
==
NULL
)
{
xmlTreeErrMemory
(
"building node"
);
/* we can't check here that name comes from the doc diction
n
ary */
/* we can't check here that name comes from the doc dictionary */
return
(
NULL
);
}
memset
(
cur
,
0
,
sizeof
(
xmlNode
));
...
...
@@ -2350,7 +2350,7 @@ xmlNewDocNodeEatName(xmlDocPtr doc, xmlNsPtr ns,
UPDATE_LAST_CHILD_AND_PARENT
(
cur
)
}
}
else
{
/* if name don't come from the doc diction
n
ary free it here */
/* if name don't come from the doc dictionary free it here */
if
((
name
!=
NULL
)
&&
(
doc
!=
NULL
)
&&
(
!
(
xmlDictOwns
(
doc
->
dict
,
name
))))
xmlFree
(
name
);
...
...
@@ -3701,7 +3701,7 @@ xmlFreeNodeList(xmlNodePtr cur) {
* When a node is a text node or a comment, it uses a global static
* variable for the name of the node.
* Otherwise the node name might come from the document's
* diction
n
ary
* dictionary
*/
if
((
cur
->
name
!=
NULL
)
&&
(
cur
->
type
!=
XML_TEXT_NODE
)
&&
...
...
@@ -3770,7 +3770,7 @@ xmlFreeNode(xmlNodePtr cur) {
/*
* When a node is a text node or a comment, it uses a global static
* variable for the name of the node.
* Otherwise the node name might come from the document's diction
n
ary
* Otherwise the node name might come from the document's dictionary
*/
if
((
cur
->
name
!=
NULL
)
&&
(
cur
->
type
!=
XML_TEXT_NODE
)
&&
...
...
valid.c
View file @
bb654feb
...
...
@@ -2532,7 +2532,7 @@ xmlDumpNotationTable(xmlBufferPtr buf, xmlNotationTablePtr table) {
* DICT_FREE:
* @str: a string
*
* Free a string if it is not owned by the "dict" diction
n
ary in the
* Free a string if it is not owned by the "dict" dictionary in the
* current scope
*/
#define DICT_FREE(str) \
...
...
xmlreader.c
View file @
bb654feb
...
...
@@ -142,7 +142,7 @@ struct _xmlTextReader {
xmlNodePtr
faketext
;
/* fake xmlNs chld */
int
preserve
;
/* preserve the resulting document */
xmlBufPtr
buffer
;
/* used to return const xmlChar * */
xmlDictPtr
dict
;
/* the context diction
n
ary */
xmlDictPtr
dict
;
/* the context dictionary */
/* entity stack when traversing entities content */
xmlNodePtr
ent
;
/* Current Entity Ref Node */
...
...
@@ -210,7 +210,7 @@ static int xmlTextReaderNextTree(xmlTextReaderPtr reader);
* DICT_FREE:
* @str: a string
*
* Free a string if it is not owned by the "dict" diction
n
ary in the
* Free a string if it is not owned by the "dict" dictionary in the
* current scope
*/
#define DICT_FREE(str) \
...
...
@@ -2158,7 +2158,7 @@ xmlNewTextReader(xmlParserInputBufferPtr input, const char *URI) {
ret
->
ctxt
->
dictNames
=
1
;
ret
->
allocs
=
XML_TEXTREADER_CTXT
;
/*
* use the parser diction
n
ary to allocate all elements and attributes names
* use the parser dictionary to allocate all elements and attributes names
*/
ret
->
ctxt
->
docdict
=
1
;
ret
->
dict
=
ret
->
ctxt
->
dict
;
...
...
@@ -5249,7 +5249,7 @@ xmlTextReaderSetup(xmlTextReaderPtr reader,
reader
->
ctxt
->
linenumbers
=
1
;
reader
->
ctxt
->
dictNames
=
1
;
/*
* use the parser diction
n
ary to allocate all elements and attributes names
* use the parser dictionary to allocate all elements and attributes names
*/
reader
->
ctxt
->
docdict
=
1
;
reader
->
ctxt
->
parseMode
=
XML_PARSE_READER
;
...
...
xmlregexp.c
View file @
bb654feb
...
...
@@ -6345,7 +6345,7 @@ struct _xmlExpCtxt {
/**
* xmlExpNewCtxt:
* @maxNodes: the maximum number of nodes
* @dict: optional diction
n
ary to use internally
* @dict: optional dictionary to use internally
*
* Creates a new context for manipulating expressions
*
...
...
@@ -7204,7 +7204,7 @@ xmlExpStringDerive(xmlExpCtxtPtr ctxt, xmlExpNodePtr exp,
return
(
NULL
);
}
/*
* check the string is in the diction
n
ary, if yes use an interned
* check the string is in the dictionary, if yes use an interned
* copy, otherwise we know it's not an acceptable input
*/
input
=
xmlDictExists
(
ctxt
->
dict
,
str
,
len
);
...
...
xmlschemas.c
View file @
bb654feb
...
...
@@ -617,7 +617,7 @@ struct _xmlSchemaParserCtxt {
xmlAutomataStatePtr
end
;
xmlAutomataStatePtr
state
;
xmlDictPtr
dict
;
/* diction
n
ary for interned string names */
xmlDictPtr
dict
;
/* dictionary for interned string names */
xmlSchemaTypePtr
ctxtType
;
/* The current context simple/complex type */
int
options
;
xmlSchemaValidCtxtPtr
vctxt
;
...
...
xpath.c
View file @
bb654feb
...
...
@@ -945,7 +945,7 @@ struct _xmlXPathCompExpr {
xmlXPathStepOp
*
steps
;
/* ops for computation of this expression */
int
last
;
/* index of last step in expression */
xmlChar
*
expr
;
/* the expression being computed */
xmlDictPtr
dict
;
/* the diction
n
ary to use if any */
xmlDictPtr
dict
;
/* the dictionary to use if any */
#ifdef DEBUG_EVAL_COUNTS
int
nb
;
xmlChar
*
string
;
...
...
Write
Preview
Markdown
is supported
0%
Try again
or
attach a new file
Attach a file
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Cancel
Please
register
or
sign in
to comment