texk/ps2pkm: Minor cleanup to avoid compiler warnings

git-svn-id: svn://tug.org/texlive/trunk@35323 c570f23f-e606-0410-a88d-b1316a301751

3 files changed, 10 insertions, 6 deletions

diff --git a/Build/source/texk/ps2pkm/ChangeLog b/Build/source/texk/ps2pkm/ChangeLog
index 5b56dd5dd35..755e30a4523 100644
--- a/Build/source/texk/ps2pkm/ChangeLog
+++ b/Build/source/texk/ps2pkm/ChangeLog
@@ -1,3 +1,7 @@
+2014-10-07  Akira Kakuto  <kakuto@fuk.kindai.ac.jp>
+
+	* paths.c, regions.c: Minor cleanup to avoid compiler warnings.
+
 2014-10-07  Peter Breitenlohner  <peb@mppmu.mpg.de>
 
 	* t1funcs.c: Bugfix (undefined operation due to a typo).
diff --git a/Build/source/texk/ps2pkm/paths.c b/Build/source/texk/ps2pkm/paths.c
index 78d8eab1919..f097983510c 100644
--- a/Build/source/texk/ps2pkm/paths.c
+++ b/Build/source/texk/ps2pkm/paths.c
@@ -52,7 +52,7 @@ The included files are:
 #include  "strokes.h"      /* understands how to coerce stroke paths       */
 #include  "trig.h"
 
-static int UnClose(struct segment *);
+static void UnClose(struct segment *);
 extern void DumpText(struct segment *);
 
 /*
@@ -919,7 +919,7 @@ struct segment *ReverseSubPaths(p)
        return(r);
 }
  
-static UnClose(p0)
+static void UnClose(p0)
        register struct segment *p0;
 {
        register struct segment *p;
diff --git a/Build/source/texk/ps2pkm/regions.c b/Build/source/texk/ps2pkm/regions.c
index c6cc21c73ed..4de905e12e9 100644
--- a/Build/source/texk/ps2pkm/regions.c
+++ b/Build/source/texk/ps2pkm/regions.c
@@ -51,7 +51,7 @@ The included files are:
 #include  "fonts.h"
 #include  "hints.h"
 #include  "strokes.h"      /* to pick up 'DoStroke'                        */
-static int Unwind();
+static void Unwind();
 static void newfilledge(register struct region *, fractpel, fractpel,
 			fractpel, fractpel, int);
 static void vertjoin(register struct edgelist *, register struct edgelist *);
@@ -63,7 +63,7 @@ static void edgemax(register int, register pel *, register pel *);
 static struct edgelist *splitedge();
 static int touches();
 static int crosses();
-static int edgecheck();
+static void edgecheck();
 static struct edgelist *NewEdge();
  
 /*
@@ -589,7 +589,7 @@ or two downward edges are nominally left/right pairs, Unwind() should
 discard the second one.  Everything should balance; we should discard
 an even number of edges; of course, we abort if we don't.
 */
-static int Unwind(area)
+static void Unwind(area)
        register struct edgelist *area;  /* input area modified in place      */
 {
        register struct edgelist *last,*next;  /* struct before and after current one */
@@ -1713,7 +1713,7 @@ void DumpEdges(edges)
 */
  
 /*ARGSUSED*/
-static int edgecheck(edge, oldmin, oldmax)
+static void edgecheck(edge, oldmin, oldmax)
        struct edgelist *edge;
        int oldmin,oldmax;
 {