summaryrefslogtreecommitdiff
AgeCommit message (Collapse)Author
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-27Update version number in README.mdArseny Kapoulkine
2014-11-25docs: Update changelog to mention MinGW load_file fixArseny 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-24tests: Add a test for load_file with wide Unicode nameArseny 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-19tests: Fix tests on various compilersArseny Kapoulkine
Some compilers don't handle NaNs properly. Some compilers don't implement fmod in a IEEE-compatible way. Some compilers have exception handling codegen bugs (DMC...).
2014-11-18docs: Regenerated documentationArseny Kapoulkine
Also fix documentation jam rules for Windows.
2014-11-17tests: Fix version testArseny Kapoulkine
2014-11-17docs: Add changelog for 1.5Arseny Kapoulkine
Release date is (tentatively) 11/27.
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-17tests: Don't use /dev/ttyArseny Kapoulkine
The behavior on OSX is different - we don't get a I/O error so the test is useless.
2014-11-16docs: Replace Subversion links with GitArseny 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-06Revert "Change Travis config to build on Linux/OSX"Arseny Kapoulkine
This reverts commit 98713bcba94b33b1b45a8891ac2e9e11305c7553. Travis multi-OS feature is invite-only for now...
2014-11-06Change Travis config to build on Linux/OSXArseny Kapoulkine
Hopefully OSX defaults to clang so we get as much coverage as before...
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-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-03tests: Add more XPath mod testsArseny Kapoulkine
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-01tests: Improve test coverageArseny Kapoulkine
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-11-01Fix first-time make config=coverage testArseny Kapoulkine
Not sure why xargs -r is not the default...
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 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.
2014-10-26XPath: Only recognize numeric constant expressionsArseny Kapoulkine
Numeric and boolean constant expressions in filters are different in that to evaluate numeric expressions we need a sorted order, but to evaluate boolean expressions we don't. The previously implemented optimization adds an extra sorting step for constant boolean filters that will be more expensive than redundant computations. Since constant booleans are sort of an edge case, don't do this optimization. This allows us to simplify apply_predicate_const to only handle numbers.
2014-10-26XPath: Unify ast_filter/ast_predicate structureArseny Kapoulkine
Now expression is always _right for filter/predicate nodes to make optimize() simpler. Additionally we now use predicate metadata to make is_posinv_step() faster. This introduces a weak ordering dependency in rewrite rules to optimize() - classification has to be performed before other optimizations.
2014-10-26XPath: Optimize constant filters/predicatesArseny Kapoulkine
If a filter/predicate expression is a constant, we don't need to evaluate it for every nodeset element - we can evaluate it once and pick the right element or keep/discard the entire collection. If the expression is 1, we can early out on first node when evaluating the node set - queries like following::item[1] are now significantly faster. Additionally this change refactors filters/predicates to have additional metadata describing the expression type in _test field that is filled during optimization. Note that predicate_constant selection right now is very simple (but captures most common use cases except for maybe [last()]).
2014-10-26tests: Remove git2svn helper script!Arseny Kapoulkine
2014-10-26Update README.md with new documentation URLs.Arseny Kapoulkine
2014-10-26tests: Add a way for tests to verify allocation failureArseny Kapoulkine
git-svn-id: https://pugixml.googlecode.com/svn/trunk@1081 99668b35-9821-0410-8761-19e4c4f06640
2014-10-25Fix node copying for some out of memory casesArseny Kapoulkine
A page can fail to allocate during attribute creation; this case was not previously handled. git-svn-id: https://pugixml.googlecode.com/svn/trunk@1080 99668b35-9821-0410-8761-19e4c4f06640
2014-10-25Add 'coverage' configuration to Makefile.Arseny Kapoulkine
git-svn-id: https://pugixml.googlecode.com/svn/trunk@1079 99668b35-9821-0410-8761-19e4c4f06640
2014-10-25Remove redundant null pointer checks.Arseny Kapoulkine
When removing a node or attribute, we know that the parent has at least one node/attribute so a null pointer check is redundant. git-svn-id: https://pugixml.googlecode.com/svn/trunk@1078 99668b35-9821-0410-8761-19e4c4f06640