commit a511a4bd9ba47ca5d427cde089ba7f0932eb136b
author Nikias Bassen <nikias@gmx.li> Mon Dec 09 01:22:26 2019 +0100
committer Nikias Bassen <nikias@gmx.li> Mon Dec 09 01:22:26 2019 +0100
tree 0d7a6ceeca1aa2e5f6899136842d92e73042125a
parent 3763b84509f0d3e80727f26d427c07341c295e03

bplist: Add cast to/from uint32_t when reading/storing indices for recursion check

src/bplist.c

diff --git a/src/bplist.c b/src/bplist.c
index 987dd93..ec4ebe2 100644
--- a/src/bplist.c
+++ b/src/bplist.c
@@ -742,17 +742,17 @@
     /* store node_index for current recursion level */
     if (ptr_array_size(bplist->used_indexes) < bplist->level+1) {
         while (ptr_array_size(bplist->used_indexes) < bplist->level+1) {
-            ptr_array_add(bplist->used_indexes, node_index);
+            ptr_array_add(bplist->used_indexes, (void*)(uintptr_t)node_index);
         }
     } else {
-	ptr_array_set(bplist->used_indexes, node_index, bplist->level);
+	ptr_array_set(bplist->used_indexes, (void*)(uintptr_t)node_index, bplist->level);
     }
 
     /* recursion check */
     if (bplist->level > 0) {
         for (i = bplist->level-1; i >= 0; i--) {
-            uint32_t node_i = ptr_array_index(bplist->used_indexes, i);
-            uint32_t node_level = ptr_array_index(bplist->used_indexes, bplist->level);
+            uint32_t node_i = (uint32_t)(uintptr_t)ptr_array_index(bplist->used_indexes, i);
+            uint32_t node_level = (uint32_t)(uintptr_t)ptr_array_index(bplist->used_indexes, bplist->level);
             if (node_i == node_level) {
                 PLIST_BIN_ERR("recursion detected in binary plist\n");
                 return NULL;