From: ellson Date: Thu, 24 Feb 2005 00:57:33 +0000 (+0000) Subject: fix "function declaration isn't a prototype" warnings from -Wstrict-prototypes X-Git-Tag: LAST_LIBGRAPH~32^2~7891 X-Git-Url: https://granicus.if.org/sourcecode?a=commitdiff_plain;h=f30b9eca9d721f4ab08e344f16b7eb454bb2c3ac;p=graphviz 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/lib/neatogen/adjust.c b/lib/neatogen/adjust.c index 39a1f0477..2bad6216c 100644 --- a/lib/neatogen/adjust.c +++ b/lib/neatogen/adjust.c @@ -61,7 +61,7 @@ static void setBoundBox(Point * ll, Point * ur) /* freeNodes: * Free node resources. */ -static void freeNodes() +static void freeNodes(void) { int i; Info_t *ip = nodeInfo; @@ -191,7 +191,7 @@ static int scomp(const void *S1, const void *S2) /* sortSites: * Fill array of pointer to sites and sort the sites using scomp */ -static void sortSites() +static void sortSites(void) { int i; Site **sp; @@ -242,8 +242,7 @@ static void geomUpdate(int doSort) deltax = xmax - xmin; } -static -Site *nextOne() +static Site *nextOne(void) { Site *s; @@ -258,7 +257,7 @@ Site *nextOne() * Check for nodes with identical positions and tweak * the positions. */ -static void rmEquality() +static void rmEquality(void) { int i, cnt; Site **ip; @@ -343,7 +342,7 @@ static int countOverlap(int iter) return count; } -static void increaseBoundBox() +static void increaseBoundBox(void) { double ydelta, xdelta; Point ll, ur; @@ -425,7 +424,7 @@ static void newpos(Info_t * ip) * Add corners of clipping window to appropriate sites. * A site gets a corner if it is the closest site to that corner. */ -static void addCorners() +static void addCorners(void) { Info_t *ip = nodeInfo; Info_t *sws = ip; @@ -478,7 +477,7 @@ static void addCorners() * We first add the corner of the clipping windows to the * vertex lists of the appropriate sites. */ -static void newPos() +static void newPos(void) { int i; Info_t *ip = nodeInfo; @@ -499,7 +498,7 @@ static void newPos() * This could be optimized, over multiple components or * even multiple graphs, but probably not worth it. */ -static void cleanup() +static void cleanup(void) { PQcleanup(); ELcleanup(); @@ -507,7 +506,7 @@ static void cleanup() edgeinit(); /* free memory */ } -static int vAdjust() +static int vAdjust(void) { int iterCnt = 0; int overlapCnt = 0; @@ -584,7 +583,7 @@ static double rePos(Point c) return f; } -static int sAdjust() +static int sAdjust(void) { int iterCnt = 0; int overlapCnt = 0; diff --git a/lib/neatogen/geometry.h b/lib/neatogen/geometry.h index 60711a49b..19778b337 100644 --- a/lib/neatogen/geometry.h +++ b/lib/neatogen/geometry.h @@ -35,7 +35,7 @@ extern "C" { extern int nsites; /* Number of sites */ extern int sqrt_nsites; - extern void geominit(); + extern void geominit(void); extern double dist_2(Point *, Point *); /* Distance squared between two points */ extern void subPt(Point * a, Point b, Point c); extern void addPt(Point * a, Point b, Point c); diff --git a/lib/neatogen/heap.c b/lib/neatogen/heap.c index 2a88989e6..f1ecbc0ea 100644 --- a/lib/neatogen/heap.c +++ b/lib/neatogen/heap.c @@ -77,13 +77,13 @@ void PQdelete(Halfedge * he) } -int PQempty() +int PQempty(void) { return (PQcount == 0); } -Point PQ_min() +Point PQ_min(void) { Point answer; @@ -95,7 +95,7 @@ Point PQ_min() return (answer); } -Halfedge *PQextractmin() +Halfedge *PQextractmin(void) { Halfedge *curr; @@ -105,13 +105,13 @@ Halfedge *PQextractmin() return (curr); } -void PQcleanup() +void PQcleanup(void) { free(PQhash); PQhash = NULL; } -void PQinitialize() +void PQinitialize(void) { int i; @@ -132,7 +132,7 @@ static void PQdumphe(Halfedge * p) p->ystar); } -void PQdump() +void PQdump(void) { int i; Halfedge *p;