commit ca75d9fffd633e42b2fe8b12031a25867108856f
author Nikias Bassen <nikias@gmx.li> Sun Feb 05 15:57:45 2017 +0100
committer Nikias Bassen <nikias@gmx.li> Sun Feb 05 15:57:45 2017 +0100
tree 5c8886be6dff26d747f6530123ec2db7f118f5a6
parent 31d7cc5370f37cc6b9ecc4e26256e74634554343

bplist: Suppress compiler warnings about format specifiers in error messages

src/bplist.c

diff --git a/src/bplist.c b/src/bplist.c
index 73202ff..cc0b928 100644
--- a/src/bplist.c
+++ b/src/bplist.c
@@ -29,6 +29,7 @@
 #include <string.h>
 
 #include <ctype.h>
+#include <inttypes.h>
 
 #include <plist/plist.h>
 #include "plist.h"
@@ -416,7 +417,7 @@
         if ((index1_ptr < bplist->data || index1_ptr + bplist->ref_size > bplist->offset_table) ||
             (index2_ptr < bplist->data || index2_ptr + bplist->ref_size > bplist->offset_table)) {
             plist_free(node);
-            PLIST_BIN_ERR("%s: dict entry %llu is outside of valid range\n", __func__, j);
+            PLIST_BIN_ERR("%s: dict entry %" PRIu64 " is outside of valid range\n", __func__, j);
             return NULL;
         }
 
@@ -425,12 +426,12 @@
 
         if (index1 >= bplist->num_objects) {
             plist_free(node);
-            PLIST_BIN_ERR("%s: dict entry %llu key index (%llu) must be smaller than the number of objects (%llu)\n", __func__, j, index1, bplist->num_objects);
+            PLIST_BIN_ERR("%s: dict entry %" PRIu64 " key index (%" PRIu64 ") must be smaller than the number of objects (%" PRIu64 ")\n", __func__, j, index1, bplist->num_objects);
             return NULL;
         }
         if (index2 >= bplist->num_objects) {
             plist_free(node);
-            PLIST_BIN_ERR("%s: dict entry %llu value index (%llu) must be smaller than the number of objects (%llu)\n", __func__, j, index1, bplist->num_objects);
+            PLIST_BIN_ERR("%s: dict entry %" PRIu64 " value index (%" PRIu64 ") must be smaller than the number of objects (%" PRIu64 ")\n", __func__, j, index1, bplist->num_objects);
             return NULL;
         }
 
@@ -490,7 +491,7 @@
 
         if (index1_ptr < bplist->data || index1_ptr + bplist->ref_size > bplist->offset_table) {
             plist_free(node);
-            PLIST_BIN_ERR("%s: array item %llu is outside of valid range\n", __func__, j);
+            PLIST_BIN_ERR("%s: array item %" PRIu64 " is outside of valid range\n", __func__, j);
             return NULL;
         }
 
@@ -498,7 +499,7 @@
 
         if (index1 >= bplist->num_objects) {
             plist_free(node);
-            PLIST_BIN_ERR("%s: array item %llu object index (%llu) must be smaller than the number of objects (%llu)\n", __func__, j, index1, bplist->num_objects);
+            PLIST_BIN_ERR("%s: array item %" PRIu64 " object index (%" PRIu64 ") must be smaller than the number of objects (%" PRIu64 ")\n", __func__, j, index1, bplist->num_objects);
             return NULL;
         }
 
@@ -521,7 +522,7 @@
     size = size + 1;
     data->intval = UINT_TO_HOST(*bnode, size);
     if (data->intval > UINT32_MAX) {
-        PLIST_BIN_ERR("%s: value %llu too large for UID node (must be <= %u)\n", __func__, (uint64_t)data->intval, UINT32_MAX);
+        PLIST_BIN_ERR("%s: value %" PRIu64 " too large for UID node (must be <= %u)\n", __func__, (uint64_t)data->intval, UINT32_MAX);
         free(data);
         return NULL;
     }
@@ -687,7 +688,7 @@
     const char* idx_ptr = NULL;
 
     if (node_index >= bplist->num_objects) {
-        PLIST_BIN_ERR("node index (%u) must be smaller than the number of objects (%llu)\n", node_index, bplist->num_objects);
+        PLIST_BIN_ERR("node index (%u) must be smaller than the number of objects (%" PRIu64 ")\n", node_index, bplist->num_objects);
         return NULL;
     }
 
@@ -788,7 +789,7 @@
     }
 
     if (root_object >= num_objects) {
-        PLIST_BIN_ERR("root object index (%llu) must be smaller than number of objects (%llu)\n", root_object, num_objects);
+        PLIST_BIN_ERR("root object index (%" PRIu64 ") must be smaller than number of objects (%" PRIu64 ")\n", root_object, num_objects);
         return;
     }