label: remove unused 'rtp' parameter to 'RTreeNewIndex'

diff --git a/lib/label/index.c b/lib/label/index.c
index bc3869cbebb4f800f62582b486da04102780b621..7643235164a2d070ccaecc9ad8dcb4561b10c57f 100644 (file)
--- a/lib/label/index.c
+++ b/lib/label/index.c
@@ -54,13 +54,12 @@ RTree_t *RTreeOpen()
     RTree_t *rtp;
 
     if ((rtp = calloc(1, sizeof(RTree_t))))
-       rtp->root = RTreeNewIndex(rtp);
+       rtp->root = RTreeNewIndex();
     return rtp;
 }
 
 /* Make a new index, empty.  Consists of a single node. */
-Node_t *RTreeNewIndex(RTree_t * rtp)
-{
+Node_t *RTreeNewIndex(void ) {
     Node_t *x = RTreeNewNode();
     x->level = 0;              /* leaf */
     return x;

diff --git a/lib/label/index.h b/lib/label/index.h
index fb51d6107fd8733b2f806d8002ac096a8fe3e33b..db4d047d2575919e98847dee86861e3a1d35e864 100644 (file)
--- a/lib/label/index.h
+++ b/lib/label/index.h
@@ -85,7 +85,7 @@ typedef struct ListNode {
 
 RTree_t *RTreeOpen(void);
 int RTreeClose(RTree_t * rtp);
-Node_t *RTreeNewIndex(RTree_t * rtp);
+Node_t *RTreeNewIndex(void);
 LeafList_t *RTreeSearch(RTree_t *, Node_t *, Rect_t *);
 int RTreeInsert(RTree_t *, Rect_t *, void *, Node_t **, int);