Add some void love. Reduce number of missing prototypes.

3 files changed, 94 insertions, 1 deletions

diff --git a/devel/ratfor/distinfo b/devel/ratfor/distinfo
index e4e494fb546..d7f33f2fd83 100644
--- a/devel/ratfor/distinfo
+++ b/devel/ratfor/distinfo
@@ -1,7 +1,9 @@
-$NetBSD: distinfo,v 1.3 2005/02/23 22:24:32 agc Exp $
+$NetBSD: distinfo,v 1.4 2012/11/01 19:49:32 joerg Exp $
 
 SHA1 (ratfor77.tar.gz) = 81a25d292c9c6daf5d244fce523fe97da6d068e5
 RMD160 (ratfor77.tar.gz) = ce4dfc948060ff2e61afb727e4ade967e81e29a4
 Size (ratfor77.tar.gz) = 17286 bytes
 SHA1 (patch-aa) = 00f40005d8291389a452d99e58647b00fdf742b7
 SHA1 (patch-ab) = 9f6d2d1a1a323cbc13865210893c00b295a5ab75
+SHA1 (patch-lookup.c) = 3a1ee2fc11b080f479ce2268516b33901ef9d436
+SHA1 (patch-rat4.c) = 5f0baa3e30fa84211506e4ccec5230cfb32f2a48
diff --git a/devel/ratfor/patches/patch-lookup.c b/devel/ratfor/patches/patch-lookup.c
new file mode 100644
index 00000000000..cebae80b5e1
--- /dev/null
+++ b/devel/ratfor/patches/patch-lookup.c
@@ -0,0 +1,10 @@
+$NetBSD: patch-lookup.c,v 1.1 2012/11/01 19:49:32 joerg Exp $
+
+--- lookup.c.orig	2012-10-30 19:09:40.000000000 +0000
++++ lookup.c
+@@ -1,4 +1,5 @@
+ #include <stdio.h>
++#include <string.h>
+ #include "lookup.h"
+ 
+ static
diff --git a/devel/ratfor/patches/patch-rat4.c b/devel/ratfor/patches/patch-rat4.c
new file mode 100644
index 00000000000..797624cfa8b
--- /dev/null
+++ b/devel/ratfor/patches/patch-rat4.c
@@ -0,0 +1,81 @@
+$NetBSD: patch-rat4.c,v 1.1 2012/11/01 19:49:32 joerg Exp $
+
+--- rat4.c.orig	2012-10-30 19:09:58.000000000 +0000
++++ rat4.c
+@@ -68,6 +68,13 @@ Compile Level
+ #include "ratdef.h"
+ #include "ratcom.h"
+ 
++void balpar(void);
++void brknxt(int sp, int lextyp[], int labval[], int token);
++void forcod(int *lab);
++void outcon(int n);
++void outgo(int n);
++void cascod (int lab, int token);
++
+ /* keywords: */
+ 
+ char sdo[3] = {
+@@ -363,7 +370,7 @@ S_CHAR str[];
+  * balpar - copy balanced paren string
+  *
+  */
+-balpar()
++void balpar(void)
+ {
+ 	S_CHAR token[MAXTOK];
+ 	int t,nlpar;
+@@ -1009,11 +1016,7 @@ S_CHAR c;
+ /*
+  * brknxt - generate code for break n and next n; n = 1 is default
+  */
+-brknxt(sp, lextyp, labval, token)
+-int sp;
+-int lextyp[];
+-int labval[];
+-int token;
++void brknxt(int sp, int lextyp[], int labval[], int token)
+ {
+ 	int i, n;
+ 	S_CHAR t, ptoken[MAXTOK];
+@@ -1099,8 +1102,7 @@ int lab;
+  * forcod - beginning of for statement
+  *
+  */
+-forcod(lab)
+-int *lab;
++void forcod(int *lab)
+ {
+ 	S_CHAR t, token[MAXTOK];
+ 	int i, j, nlpar,tlab;
+@@ -1331,8 +1333,7 @@ S_CHAR c;
+  * outcon - output "n   continue"
+  *
+  */
+-outcon(n)
+-int n;
++void outcon(int n)
+ {
+ 	xfer = NO;
+ 	if (n <= 0 && outp == 0)
+@@ -1404,8 +1405,7 @@ FILE * fd;
+  * outgo - output "goto  n"
+  *
+  */
+-outgo(n)
+-int n;
++void outgo(int n)
+ {
+ 	if (xfer == YES)
+ 		return;
+@@ -1864,9 +1864,7 @@ int size;
+  * cascod - generate code for case or default label
+  *
+  */
+-cascod (lab, token)
+-int lab;
+-int token;
++void cascod (int lab, int token)
+ {
+ 	int t, l, lb, ub, i, j, junk;
+ 	S_CHAR scrtok[MAXTOK];