Skip to content
Projects
Groups
Snippets
Help
Loading...
Help
Contribute to GitLab
Sign in / Register
Toggle navigation
L
libplist
Project
Project
Details
Activity
Cycle Analytics
Repository
Repository
Files
Commits
Branches
Tags
Contributors
Graph
Compare
Charts
Issues
1
Issues
1
List
Board
Labels
Milestones
Merge Requests
0
Merge Requests
0
CI / CD
CI / CD
Pipelines
Jobs
Schedules
Charts
Wiki
Wiki
Snippets
Snippets
Members
Members
Collapse sidebar
Close sidebar
Activity
Graph
Charts
Create a new issue
Jobs
Commits
Issue Boards
Open sidebar
pwn
libplist
Commits
7ea2be32
Commit
7ea2be32
authored
Aug 14, 2008
by
Matt Colyer
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Minor documentation cleanup in plist.c.
parent
a641dd49
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
with
3 additions
and
3 deletions
+3
-3
plist.c
src/plist.c
+3
-3
No files found.
src/plist.c
View file @
7ea2be32
...
...
@@ -104,7 +104,7 @@ void free_plist(xmlDocPtr plist) {
* @param name The name of the new node.
* @param content The string containing the text node of the new node.
* @param to_node The node to attach the child node to. If none is given, the
*
root node of the given document is used.
* root node of the given document is used.
* @param depth The number of tabs to indent the new node.
*
* @return The newly created node.
...
...
@@ -186,9 +186,9 @@ xmlNode *add_key_data_dict_element(xmlDocPtr plist, xmlNode *dict, const char *k
/** Reads a set of keys and strings into an array from a plist XML document.
*
* @param dict The root XMLNode of a plist XML document to be read.
*
*
* @return An array where each even number is a key and the odd numbers are
* values. If the odd number is \0, that's the end of the list.
*
values. If the odd number is \0, that's the end of the list.
*/
char
**
read_dict_element_strings
(
xmlNode
*
dict
)
{
char
**
return_me
=
NULL
,
**
old
=
NULL
;
...
...
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