fix "function declaration isn't a prototype" warnings from -Wstrict-prototypes

    mostly by using (void) instead of () for functions with empty parameter lists.

diff --git a/tclpkg/tclpathplan/find_ints.c b/tclpkg/tclpathplan/find_ints.c
index caed5d4903eeee0a2925b866ca5a28024144886b..a1fea30c8340f34643009d8f4c5452aff71c9b18 100644 (file)
--- a/tclpkg/tclpathplan/find_ints.c
+++ b/tclpkg/tclpathplan/find_ints.c
@@ -22,11 +22,10 @@ void find_intersection(struct vertex *l, struct vertex *m,
                       struct intersection ilist[], struct data *input);
 static int gt(struct vertex **i, struct vertex **j);
 
-void find_ints(vertex_list, polygon_list, input, ilist)
-struct vertex vertex_list[];
-struct polygon polygon_list[];
-struct data *input;
-struct intersection ilist[];
+void find_ints(struct vertex vertex_list[],
+       struct polygon polygon_list[],
+       struct data *input,
+       struct intersection ilist[])
 {
     int i, j, k;
     struct active_edge_list all;

diff --git a/tclpkg/tclpathplan/intersect.c b/tclpkg/tclpathplan/intersect.c
index 9fa5de4a1f53a2ea2103973cc9e91848c03ea1c2..0557ecd6b3b300ad12ecbda5c556a3f72a5ea571 100644 (file)
--- a/tclpkg/tclpathplan/intersect.c
+++ b/tclpkg/tclpathplan/intersect.c
@@ -18,12 +18,10 @@
 #include "simple.h"
 #include <stdlib.h>
 
-static void sgnarea(l, m, i)
-struct vertex *l, *m;
-int i[];
-       /* find the sign of the area of each of the triangles
-          formed by adding a vertex of m to l  
-          also find the sign of their product  */
+/* find the sign of the area of each of the triangles
+  formed by adding a vertex of m to l 
+  also find the sign of their product  */
+static void sgnarea(struct vertex *l, struct vertex *m, int i[])
 {
     float a, b, c, d, e, f, g, h, t;
     a = l->pos.x;
@@ -41,17 +39,16 @@ int i[];
     i[2] = i[0] * i[1];
 }
 
-static int between(f, g, h)    /* determine if g lies between f and h      */
-float f, g, h;
+/* determine if g lies between f and h      */
+static int between(float f, float g, float h)
 {
     if ((f == g) || (g == h))
        return (0);
     return ((f < g) ? (g < h ? 1 : -1) : (h < g ? 1 : -1));
 }
 
-static int online(l, m, i)     /* determine if vertex i of line m is on line l     */
-struct vertex *l, *m;
-int i;
+/* determine if vertex i of line m is on line l     */
+static int online(struct vertex *l, struct vertex *m, int i)
 {
     struct position a, b, c;
     a = l->pos;
@@ -64,10 +61,8 @@ int i;
                                                                   b.x));
 }
 
-static int intpoint(l, m, x, y, cond)
-struct vertex *l, *m;
-float *x, *y;
-int cond;                      /* determine point of detected intersections  */
+/* determine point of detected intersections  */
+static int intpoint(struct vertex *l, struct vertex *m, float *x, float *y, int cond)
 {
     struct position ls, le, ms, me, pt1, pt2;
     float m1, m2, c1, c2;
@@ -133,9 +128,8 @@ int cond;                   /* determine point of detected intersections  */
     return (1);
 }
 
-  /*detect whether lines l and m intersect      */
-void
-find_intersection(struct vertex *l,
+/*detect whether lines l and m intersect      */
+void find_intersection(struct vertex *l,
                  struct vertex *m,
                  struct intersection ilist[], struct data *input)
 {