summaryrefslogtreecommitdiffstats
AgeCommit message (Collapse)AuthorFilesLines
2019-11-07Bump version to 2.1.0 for release2.1.0Gravatar Nikias Bassen1-1/+1
2019-11-07Bump soversion due to functions added to interfaceGravatar Nikias Bassen1-1/+1
2019-11-07Updated NEWS for releaseGravatar Nikias Bassen1-0/+23
2019-11-07xplist: Bail out when '.' is found while checking for ',' in double to ↵Gravatar Nikias Bassen1-0/+2
string conversion
2019-11-07Add plist_get_data_ptr() and plist_get_string_ptr() to the interfaceGravatar Nikias Bassen2-0/+51
2019-11-07Add plist_to_bin_free() and plist_to_xml_free() functions that free memory ↵Gravatar Nikias Bassen3-0/+24
allocated by plist_to_bin()/plist_to_xml()
2019-11-07xplist: Increase precision when converting PLIST_REAL nodes to XMLGravatar Nikias Bassen1-37/+16
2019-10-23Updated .gitignoreGravatar Nikias Bassen1-0/+2
2019-09-03libcnary: [BUGFIX] Set list->end to NULL when removing last and only element ↵Gravatar Nikias Bassen1-0/+2
from list This prevents a UaF in node_list_add. The issue became visible after removing the last (and only) item from a PLIST_DICT or PLIST_ARRAY node, and then adding a new item - the item will not make it into the actual dictionary or array because the list->end pointer points to invalid memory, effectively causing memory corruption.
2019-08-13plist: Remove unnecessary parameter from plist_copy_node()Gravatar Xiao Deng1-14/+6
2019-08-09Make sure to copy hash table entries properly when cloning array/dict nodesGravatar Nikias Bassen1-18/+22
As mentioned in #142, plist_copy_node() was not correctly handling the hash tables when cloning array or dict nodes; it incorrectly filled the hash table with the original child node info, which effectively would lead to a segmentation fault / UaF if the original array/dict would be freed followed by an attempt to access an element in the new hash table.
2019-08-08cython: Make sure plist.pxd is installed correctlyGravatar Nikias Bassen1-0/+3
2019-08-08cython: Remove unused variableGravatar Nikias Bassen1-1/+0
2019-08-08cython: Fix compilationGravatar Nikias Bassen1-0/+4
2019-07-11cython: Implement dump()/dumps() to match up with plistlib (Python 3.4)Gravatar Andrew Udvare2-0/+37
2019-07-11cython: Implement load()/loads() to match up with plistlib (Python 3.4)Gravatar Andrew Udvare2-0/+58
2019-07-07Add PList::Dictionary::const_iteratorGravatar Alexander Böhn2-0/+19
... and const versions of three member functions, each returning const_iterator: * Plist::Dictionary::Begin() * PList::Dictionary::End() * PList::Dictionary::Find()
2019-06-26Fixed bug in dictionary_fillGravatar tihmstar1-1/+1
Bug: when creating a new Dictionary object (for example through PList::Node::FromPlist(plist_t node) ), the dictionary_fill function is called from Dictionary() constructor in line 50. It seems that the intended way of calling dictionary_fill() is to pass the _map object by reference, however it is actually passed by value. Thus the changes to the map object made by dictionary_fill() are discarded when the function returns. Fix: pass _map by reference to keep the changes
2019-05-20plist_set_key_val(): prevent setting a key value that already exists in a ↵Gravatar Nikias Bassen1-0/+5
PLIST_DICT
2019-05-20Add plist_dict_item_get_key() to allow retrieving the key node for a given ↵Gravatar Nikias Bassen2-2/+21
item of a #PLIST_DICT
2019-05-19Add plist_array_item_remove() to allow removing an array's child node ↵Gravatar Nikias Bassen2-0/+23
without relying on the index
2019-05-19plist_array_get_item_index(): return UINT_MAX instead of 0 when node can't ↵Gravatar Nikias Bassen3-2/+6
be found
2019-05-19Add index lookup table for large PLIST_ARRAY nodesGravatar Nikias Bassen3-22/+113
2019-05-16Converted README to markdown and updated links to httpsGravatar Nikias Bassen2-68/+55
2019-05-16Ignore invalid input in plist_get_*_val() to prevent unnecessary assertionsGravatar Nikias Bassen1-19/+50
Also fixes #126 by skipping the strlen() in the assert() if for some reason NULL is returned as data
2019-05-16test: Merge *cmp.test into *.test to allow parallel testingGravatar Nikias Bassen13-48/+24
2019-05-11m4: update ax_pthread to latestGravatar Yves-Alexis Perez1-3/+3
Latest version (serial 24) only updates the URL
2019-05-11cython: use PYTHON_LIBS instead of PYTHON_LDFLAGSGravatar Yves-Alexis Perez1-1/+1
New version of AX_PYTHON_DEVEL macro defines PYTHON_LIBS and not PYTHON_LDFLAGS, so adjust where needed
2019-05-11Use Requires.private in *.pc files to not add unnecessary links.Gravatar Julien Lavergne1-1/+1
2019-04-04Updated ac_python_devel.m4 to newer ax_python_devel.m4Gravatar Nikias Bassen1-65/+123
2019-01-21libcnary: Remove list.c/list.h and just do everything in node_list.cGravatar Nikias Bassen4-94/+6
2019-01-21headers: Don't redefine uint*_t for newer versions of MSVCGravatar Nikias Bassen1-1/+1
2019-01-21cpp: Dictionary: Reduce code duplication with helper functionGravatar Nikias Bassen1-47/+16
2019-01-21plist: Add iterator for #PLIST_ARRAY nodesGravatar Nikias Bassen3-35/+87
Similar to #PLIST_DICT, an iterator can now be used for #PLIST_ARRAY nodes. Get an iterator with plist_array_new_iter() and use plist_array_next_item() to iterate over the elements.
2019-01-21xplist: Fix dtostr() inserting ':' to output string when fractional part ↵Gravatar Nikias Bassen1-2/+15
overflows
2019-01-18bplist: Silence compiler warning 'comparison is always true ...' (32 bit)Gravatar Nikias Bassen1-1/+1
2018-12-23plist: Improve plist_dict_next_item() drastically by iterating on node list ↵Gravatar Nikias Bassen1-10/+8
directly As Xiao Deng pointed out in #131, plist_dict_next_item() was very inefficient. For each iteration, node_nth_child() was called with the iterator value, which would walk through the child node list on EVERY iteration. If the dictionary is large this makes things very slow. More than that, after reaching the key node the code was calling node_nth_child() AGAIN (with iterator value + 1) to reach the value node, which would walk through the node list once more. This commit changes the iterator to be a node_t pointer so that the iteration is done on the node list directly.
2018-12-17xplist: Write base64 directly to output buffer to improve memory usageGravatar Nikias Bassen1-5/+2
Now that we grow the output buffer enough before writing XML output we can just write the base64 encoded data directly to the ouput buffer instead of using a heap buffer that will then be copied to the output buffer. This makes writing XML output more memory efficient (and slightly faster).
2018-12-17cython: Fix Node.to_bin() decodeGravatar Shane Garrett1-1/+1
Don't convert the string to UTF-8, just bytes. Fixes #109.
2018-12-14xplist: Improve memory usage by estimating output buffer sizeGravatar Nikias Bassen2-3/+128
2018-12-14xplist: Fix writing of empty dict and array nodes to XMLGravatar Nikias Bassen1-8/+6
2018-12-11xplist: Fix segfault caused by recent changes in libcnaryGravatar Nikias Bassen1-1/+1
2018-12-10ptrarray: Allow larger chunks for buffer reallocationGravatar Nikias Bassen1-1/+1
2018-12-10xplist: Prevent unnecessary reallocations when writing XML outputGravatar Nikias Bassen1-1/+4
2018-12-10Remove node_iterator and operate on node list directly to improve memory usageGravatar Nikias Bassen9-269/+7
2018-12-10bplist: Improve performance and memory usage when writing binary plistGravatar Nikias Bassen4-6/+88
2018-11-30bplist: Remove unnecessary allocations when parsing and writing unicode nodesGravatar Nikias Bassen1-88/+72
2018-11-29bplist: Remove redundant calls to strlen()Gravatar Nikias Bassen1-7/+4
2018-11-28libcnary: Remove redundant members from node_t structGravatar Nikias Bassen2-32/+17
2018-09-04xplist: Assert when number of child nodes of PLIST_DICT is not evenGravatar Nikias Bassen1-0/+3
This should only happen due to misuse of the library, e.g. when calling plist_free() on a node that is a value node in a PLIST_DICT without properly removing the dictionary entry (key/value pair) and then calling plist_to_xml() on that dictionary.
© 2009-2020 libimobiledevice.org - All rights reserved - Generated by cgit - Icons from Tango - Uses Google Analytics