diff options
author | Nikias Bassen | 2018-12-10 02:20:24 +0100 |
---|---|---|
committer | Nikias Bassen | 2018-12-10 02:22:15 +0100 |
commit | 4de329327ce4aa175e8496d1bff8604bffb6c574 (patch) | |
tree | 0c5fce7e138756a2479acab5a3098fa12ea6971b /src/bplist.c | |
parent | 71dd25e14616bd261c3b6c80ff990cd1078266f6 (diff) | |
download | libplist-4de329327ce4aa175e8496d1bff8604bffb6c574.tar.gz libplist-4de329327ce4aa175e8496d1bff8604bffb6c574.tar.bz2 |
Remove node_iterator and operate on node list directly to improve memory usage
Diffstat (limited to 'src/bplist.c')
-rw-r--r-- | src/bplist.c | 5 |
1 files changed, 1 insertions, 4 deletions
diff --git a/src/bplist.c b/src/bplist.c index 69f3dca..679a5e5 100644 --- a/src/bplist.c +++ b/src/bplist.c @@ -39,7 +39,6 @@ #include "ptrarray.h" #include <node.h> -#include <node_iterator.h> /* Magic marker and size. */ #define BPLIST_MAGIC ((uint8_t*)"bplist") @@ -938,12 +937,10 @@ static void serialize_plist(node_t* node, void* data) ptr_array_add(ser->objects, node); //now recurse on children - node_iterator_t *ni = node_iterator_create(node->children); node_t *ch; - while ((ch = node_iterator_next(ni))) { + for (ch = node_first_child(node); ch; ch = node_next_sibling(ch)) { serialize_plist(ch, data); } - node_iterator_destroy(ni); return; } |