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
6d2cd169
Commit
6d2cd169
authored
Jan 29, 2009
by
Jonathan Beck
Browse files
Options
Browse Files
Download
Email Patches
Plain Diff
Make pointer argument in API const when possible.
parent
ecfe5f4e
Show whitespace changes
Inline
Side-by-side
Showing
2 changed files
with
15 additions
and
15 deletions
+15
-15
plist.h
include/plist/plist.h
+7
-7
plist.c
src/plist.c
+8
-8
No files found.
include/plist/plist.h
View file @
6d2cd169
...
@@ -50,17 +50,17 @@ typedef enum {
...
@@ -50,17 +50,17 @@ typedef enum {
plist_t
plist_new_dict
();
plist_t
plist_new_dict
();
plist_t
plist_new_array
();
plist_t
plist_new_array
();
//Plist edition, create a new root if node is NULL
//Plist edition, create a new root if node is NULL
plist_t
plist_add_sub_element
(
plist_t
node
,
plist_type
type
,
void
*
value
,
uint64_t
length
);
plist_t
plist_add_sub_element
(
plist_t
node
,
plist_type
type
,
const
void
*
value
,
uint64_t
length
);
//Plist edition, only work for dict and array node
//Plist edition, only work for dict and array node
void
plist_add_sub_node
(
plist_t
node
,
plist_t
subnode
);
void
plist_add_sub_node
(
plist_t
node
,
plist_t
subnode
);
void
plist_add_sub_key_el
(
plist_t
node
,
char
*
val
);
void
plist_add_sub_key_el
(
plist_t
node
,
c
onst
c
har
*
val
);
void
plist_add_sub_string_el
(
plist_t
node
,
char
*
val
);
void
plist_add_sub_string_el
(
plist_t
node
,
c
onst
c
har
*
val
);
void
plist_add_sub_bool_el
(
plist_t
node
,
uint8_t
val
);
void
plist_add_sub_bool_el
(
plist_t
node
,
uint8_t
val
);
void
plist_add_sub_uint_el
(
plist_t
node
,
uint64_t
val
);
void
plist_add_sub_uint_el
(
plist_t
node
,
uint64_t
val
);
void
plist_add_sub_real_el
(
plist_t
node
,
double
val
);
void
plist_add_sub_real_el
(
plist_t
node
,
double
val
);
void
plist_add_sub_data_el
(
plist_t
node
,
char
*
val
,
uint64_t
length
);
void
plist_add_sub_data_el
(
plist_t
node
,
c
onst
c
har
*
val
,
uint64_t
length
);
//plist free
//plist free
...
@@ -72,9 +72,9 @@ plist_t plist_get_next_sibling(plist_t node);
...
@@ -72,9 +72,9 @@ plist_t plist_get_next_sibling(plist_t node);
plist_t
plist_get_prev_sibling
(
plist_t
node
);
plist_t
plist_get_prev_sibling
(
plist_t
node
);
//utili function to find first (and only the first encountred) corresponding node
//utili function to find first (and only the first encountred) corresponding node
plist_t
plist_find_node
(
plist_t
plist
,
plist_type
type
,
void
*
value
,
uint64_t
length
);
plist_t
plist_find_node
(
plist_t
plist
,
plist_type
type
,
const
void
*
value
,
uint64_t
length
);
plist_t
plist_find_node_by_key
(
plist_t
plist
,
char
*
value
);
plist_t
plist_find_node_by_key
(
plist_t
plist
,
c
onst
c
har
*
value
);
plist_t
plist_find_node_by_string
(
plist_t
plist
,
char
*
value
);
plist_t
plist_find_node_by_string
(
plist_t
plist
,
c
onst
c
har
*
value
);
void
plist_get_type_and_value
(
plist_t
node
,
plist_type
*
type
,
void
*
value
,
uint64_t
*
length
);
void
plist_get_type_and_value
(
plist_t
node
,
plist_type
*
type
,
void
*
value
,
uint64_t
*
length
);
...
...
src/plist.c
View file @
6d2cd169
...
@@ -71,7 +71,7 @@ plist_t plist_new_array()
...
@@ -71,7 +71,7 @@ plist_t plist_new_array()
return
plist_new_node
(
data
);
return
plist_new_node
(
data
);
}
}
plist_t
plist_add_sub_element
(
plist_t
node
,
plist_type
type
,
void
*
value
,
uint64_t
length
)
plist_t
plist_add_sub_element
(
plist_t
node
,
plist_type
type
,
const
void
*
value
,
uint64_t
length
)
{
{
//only structured types can have children
//only structured types can have children
plist_type
node_type
=
plist_get_node_type
(
node
);
plist_type
node_type
=
plist_get_node_type
(
node
);
...
@@ -140,7 +140,7 @@ plist_t plist_get_prev_sibling(plist_t node)
...
@@ -140,7 +140,7 @@ plist_t plist_get_prev_sibling(plist_t node)
return
(
plist_t
)
g_node_prev_sibling
((
GNode
*
)
node
);
return
(
plist_t
)
g_node_prev_sibling
((
GNode
*
)
node
);
}
}
static
char
compare_node_value
(
plist_type
type
,
plist_data_t
data
,
void
*
value
,
uint64_t
length
)
static
char
compare_node_value
(
plist_type
type
,
plist_data_t
data
,
const
void
*
value
,
uint64_t
length
)
{
{
char
res
=
FALSE
;
char
res
=
FALSE
;
switch
(
type
)
{
switch
(
type
)
{
...
@@ -172,7 +172,7 @@ static char compare_node_value(plist_type type, plist_data_t data, void *value,
...
@@ -172,7 +172,7 @@ static char compare_node_value(plist_type type, plist_data_t data, void *value,
return
res
;
return
res
;
}
}
plist_t
plist_find_node
(
plist_t
plist
,
plist_type
type
,
void
*
value
,
uint64_t
length
)
plist_t
plist_find_node
(
plist_t
plist
,
plist_type
type
,
const
void
*
value
,
uint64_t
length
)
{
{
if
(
!
plist
)
if
(
!
plist
)
return
NULL
;
return
NULL
;
...
@@ -194,12 +194,12 @@ plist_t plist_find_node(plist_t plist, plist_type type, void *value, uint64_t le
...
@@ -194,12 +194,12 @@ plist_t plist_find_node(plist_t plist, plist_type type, void *value, uint64_t le
return
NULL
;
return
NULL
;
}
}
plist_t
plist_find_node_by_key
(
plist_t
plist
,
char
*
value
)
plist_t
plist_find_node_by_key
(
plist_t
plist
,
c
onst
c
har
*
value
)
{
{
return
plist_find_node
(
plist
,
PLIST_KEY
,
value
,
strlen
(
value
));
return
plist_find_node
(
plist
,
PLIST_KEY
,
value
,
strlen
(
value
));
}
}
plist_t
plist_find_node_by_string
(
plist_t
plist
,
char
*
value
)
plist_t
plist_find_node_by_string
(
plist_t
plist
,
c
onst
c
har
*
value
)
{
{
return
plist_find_node
(
plist
,
PLIST_STRING
,
value
,
strlen
(
value
));
return
plist_find_node
(
plist
,
PLIST_STRING
,
value
,
strlen
(
value
));
}
}
...
@@ -268,12 +268,12 @@ void plist_add_sub_node(plist_t node, plist_t subnode)
...
@@ -268,12 +268,12 @@ void plist_add_sub_node(plist_t node, plist_t subnode)
}
}
}
}
void
plist_add_sub_key_el
(
plist_t
node
,
char
*
val
)
void
plist_add_sub_key_el
(
plist_t
node
,
c
onst
c
har
*
val
)
{
{
plist_add_sub_element
(
node
,
PLIST_KEY
,
val
,
strlen
(
val
));
plist_add_sub_element
(
node
,
PLIST_KEY
,
val
,
strlen
(
val
));
}
}
void
plist_add_sub_string_el
(
plist_t
node
,
char
*
val
)
void
plist_add_sub_string_el
(
plist_t
node
,
c
onst
c
har
*
val
)
{
{
plist_add_sub_element
(
node
,
PLIST_STRING
,
val
,
strlen
(
val
));
plist_add_sub_element
(
node
,
PLIST_STRING
,
val
,
strlen
(
val
));
}
}
...
@@ -293,7 +293,7 @@ void plist_add_sub_real_el(plist_t node, double val)
...
@@ -293,7 +293,7 @@ void plist_add_sub_real_el(plist_t node, double val)
plist_add_sub_element
(
node
,
PLIST_REAL
,
&
val
,
sizeof
(
double
));
plist_add_sub_element
(
node
,
PLIST_REAL
,
&
val
,
sizeof
(
double
));
}
}
void
plist_add_sub_data_el
(
plist_t
node
,
char
*
val
,
uint64_t
length
)
void
plist_add_sub_data_el
(
plist_t
node
,
c
onst
c
har
*
val
,
uint64_t
length
)
{
{
plist_add_sub_element
(
node
,
PLIST_DATA
,
val
,
length
);
plist_add_sub_element
(
node
,
PLIST_DATA
,
val
,
length
);
}
}
...
...
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