summaryrefslogtreecommitdiff
path: root/src
AgeCommit message (Collapse)Author
2015-03-05Merge branch 'master' of https://github.com/mloy/pugixml into mloy-masterArseny Kapoulkine
2015-03-04Fix string length for translate and normalize-spaceArseny Kapoulkine
The implementations generated a string with an internal null terminator; this went unnoticed since unit test string verification did not perform string equality check properly (it compared XPath string result as a C-string, thus stopping at the first null terminator). Fixes #36.
2015-02-12DOCTYPE parsing is now stacklessArseny Kapoulkine
This prevents malformed input XML with very deeply recursive DOCTYPE sections from crashing the parser. Fixes #29.
2015-01-16Merge branch 'master' into compactArseny Kapoulkine
2015-01-16docs: Add missing float setters to referenceArseny Kapoulkine
Also fix the float/double member order in the header file.
2015-01-16Convert spaces to tabsArseny Kapoulkine
2015-01-16Merge pull request #27 from sdoiel61/masterArseny Kapoulkine
Make float/double round-trip This change also adds xml_text::set and xml_attribute::set_value overloads for float so that float is only printed using just enough digits to represent float, instead of enough digits to represent double.
2015-01-16Add a couple of more overloads for floatsSteve Doiel
2015-01-16Fix attribute round trip for float as wellSteve Doiel
2015-01-09Simplify header-only mode usageArseny Kapoulkine
It's sufficient to define PUGIXML_HEADER_ONLY anywhere now, source is included automatically. This is a second attempt; this time it includes a workaround for QMake bug that caused it to generate incorrect Makefile.
2015-01-06Add xml_text::set for floatSteve Doiel
Make float/double round-trip
2014-12-13Don't use off64_t/_wfopen on MinGW32 in C++11 modev1.5Arseny Kapoulkine
Unfortunately, standard headers on MinGW32 insist on undefining off64_t and _wfopen extensions if __STRICT_ANSI__ is true (e.g. C++11 mode). This leads to compilation errors since b7a1fec started to use _wfopen in strict mode. That change erroneously checked GCC version - however, the version itself is irrelevant; the actual criteria is whether mingw64 runtime is used. off64_t is not useful on MinGW32 since we only need it to open large files on 64-bit platforms; unfortunately, the lack of _wfopen means we won't be able to support wide-char paths on Windows for MinGW32. Fixes #24.
2014-11-27Merge branch 'master' into compactArseny Kapoulkine
2014-11-24Use _wfopen and fseeko64 on MinGW in C++11 modeArseny Kapoulkine
Since MinGW 4.5 does not define these functions if __STRICT_ANSI__ is defined (in case of _wfopen it defines it inconsistently between stdio.h and wchar.h) use the baseline functions for MinGW 4.5 and earlier. Fixes #23.
2014-11-20Add allocator reserve for copyingArseny Kapoulkine
Since copying no longer relies on child insertion we have to also reserve space in the hash table for the allocator so that pointer manipulations are guaranteed to succeed.
2014-11-20Merge branch 'master' into compactArseny Kapoulkine
2014-11-20Fix node_declaration copying with empty nameArseny Kapoulkine
node_copy_string relied on the fact that target node had an empty name and value. Normally this is a safe assumption (and a good one to make since it makes copying faster), however it was not checked and there was one case when it did not hold. Since we're reusing the logic for inserting nodes, newly inserted declaration nodes had the name set automatically to xml, which in our case violates the assumption and is counter-productive since we'll override the name right after setting it. For now the best solution is to do the same insertion manually - that results in some code duplication that we can refactor later (same logic is partially shared by _move variants anyway so on a level duplicating is not that bad).
2014-11-20Refactor node type checks for attribute insertionArseny Kapoulkine
Add allow_insert_attribute (similar to allow_insert_child).
2014-11-20Minor refactoring of tree modificationArseny Kapoulkine
Remove redundant this-> from type() call (argument used to be called type, but it's now type_). Use _root member directly when possible instead of calling internal_object.
2014-11-19XPath: Refactor eval_once to use set typeArseny Kapoulkine
This will allow us to implement nodeset_eval_last evaluation mode if necessary without relying on a fragile boolean argument.
2014-11-19XPath: Minor string operation refactoringArseny Kapoulkine
Extract end of string to rend and add comments to translate_table.
2014-11-19Make sure remove_node fully detaches the nodeArseny Kapoulkine
Right now remove_node is only used in contexts where parent is reset after removing but this might be important in the future.
2014-11-19Prevent depth underflow when printing documentsArseny Kapoulkine
Since depth is unsigned this is actually well-defined but it's better to not have the underflow anyway.
2014-11-19Add more assertions for page memory handling codeArseny Kapoulkine
2014-11-19Change has_declaration to work on node pointersArseny Kapoulkine
This is more for consistency with the surrounding code than for performance.
2014-11-17Update version to 1.5Arseny Kapoulkine
2014-11-17Rename xml_document::load to load_stringArseny Kapoulkine
This should completely eliminate the confusion between load and load_file. Of course, for compatibility reasons we have to preserve the old variant - it will be deprecated in a future version and subsequently removed.
2014-11-08Reduce required page alignment to 32Arseny Kapoulkine
Since we no longer have a name/value pair in nodes we need one less bit to represent allocated flags. This reduces the page overhead by 32 bytes.
2014-11-07Merge branch 'master' into compactArseny Kapoulkine
2014-11-07XPath: Partially inline xpath_node_set_raw::push_backArseny Kapoulkine
Previously push_back implementation was too big to inline; now the common case (no realloc) is small and realloc variant is explicitly marked as no-inline. This is similar to xml_allocator::allocate_memory/allocate_memory_oob and makes some XPath queries 5% faster.
2014-11-07XPath: Only call apply_predicates if necessaryArseny Kapoulkine
In some cases constant overhead on step evaluation is important - i.e. for queries that evaluate a simple step in a predicate expression. Eliminating a redundant function call thus can prove worthwhile. This change makes some queries (e.g. //*[not(*)]) 4% faster.
2014-11-06Fix compact mode compilationArseny Kapoulkine
Clang and gcc seem to treat string literals differently...
2014-11-06Verify that compact page encoding is safeArseny Kapoulkine
Since page size can be customized let's do a special validation check for compact encoding. Right now it's redundant since page size is limited by 64k in alloc_string, but that may change in the future.
2014-11-06Add a separate storage class for PI nodesArseny Kapoulkine
This allows us to add pi value to restore target support for PI nodes without increasing the memory usage for other nodes. Right now the PI node has a separate header that's used for allocated bit; this allows us to reduce header bitcount in the future.
2014-11-05Ensure selected page size works with allocate_stringArseny Kapoulkine
Previously setting a large page size (i.e. 1M) would cause dynamic string allocation to assert spuriously. A page size of 64K guarantees that all offsets fit into 16 bits.
2014-11-05Fix xml_node::offset_debug for corner casesArseny Kapoulkine
Computed offsets for documents with nodes that were added using append_buffer or newly appended nodes without name/value information were invalid.
2014-11-05Use impl::get_document instead of root() where possibleArseny Kapoulkine
This reduces the number of unsafe pointer manipulations.
2014-11-05Remove redundant branchesArseny Kapoulkine
These used to result in better codegen for unknown reasons, but this is no longer the case.
2014-11-04Fix gcc warnings in compact modeArseny Kapoulkine
2014-11-04Merge branch 'master' into compactArseny Kapoulkine
2014-11-03:Merge remote-tracking branch 'upstream/master'Matthias Loy
2014-11-03XPath: Refactor predicate applicationArseny Kapoulkine
Split number/boolean filtering logic into two functions. This creates an extra copy of a remove_if-like algorithm, but moves the type check out of the loop and results in better organized filtering code. Consolidate test-based dispatch into apply_predicate (which is now a member function).
2014-11-02Fix undefined behavior while calling memcpyArseny Kapoulkine
Calling memcpy(x, 0, 0) is technically undefined (although it should usually be a no-op).
2014-11-01XPath: Fix undefined behavior while calling memcpyArseny Kapoulkine
Calling memcpy(x, 0, 0) is technically undefined (although it should usually be a no-op). Fixes #20.
2014-10-30load_buffer_impl always checks if buffer is valid pointer and size > 0mloy
added some tests to force invalid buffer and size = 0
2014-10-28Fix compilation after merge.Arseny Kapoulkine
2014-10-28Merge branch 'master' into compactArseny Kapoulkine
2014-10-28Fix several cppcheck warnings.Arseny Kapoulkine
2014-10-27Optimize node printing by using raw pointersArseny Kapoulkine
This lets us do fewer null pointer checks (making printing 2% faster with -O3) and removes a lot of function calls (making printing 20% faster with -O0).
2014-10-27XPath: Optimize [position()=expr] and [last()]Arseny Kapoulkine
To get more benefits from constant predicate/filter optimization we rewrite [position()=expr] predicates into [expr] for numeric expressions. Right now the rewrite is only for entire expressions - it may be beneficial to split complex expressions like [position()=constant and expr] into [constant][expr] but that is more complicated. last() does not depend on the node set contents so is "constant" as far as our optimization is concerned so we can evaluate it once.