Update NEWS

[netatalk.git] / etc / atalkd / rtmp.h

diff --git a/etc/atalkd/rtmp.h b/etc/atalkd/rtmp.h
index bf2be9a58b6e2e1fe83f3fd08bdba04ad4c10608..99e15db31bed804558e62d47382772512fba0c40 100644 (file)
--- a/etc/atalkd/rtmp.h
+++ b/etc/atalkd/rtmp.h
@@ -1,9 +1,8 @@
 /*
+ * $Id: rtmp.h,v 1.5 2009-10-13 22:55:37 didg Exp $
  * Copyright (c) 1990,1993 Regents of The University of Michigan.
  * All Rights Reserved. See COPYRIGHT.
- */
-
-/*
+ *
  * We have an rtmptab circular linked list for each gateway.  Entries
  * are inserted in the order we get them.  The expectation is that
  * we will get a complexity of N for the stable case.  If we have N
@@ -70,22 +69,26 @@ struct rtmp_tuple {
 #ifndef BSD4_4
 #define RTMP_ADD       SIOCADDRT
 #define RTMP_DEL       SIOCDELRT
-#else BSD4_4
+#else /* BSD4_4 */
 #define RTMP_ADD       RTM_ADD
 #define RTMP_DEL       RTM_DELETE
-#endif BSD4_4
+#endif /* BSD4_4 */
 
 #define STARTUP_FIRSTNET       0xff00
 #define STARTUP_LASTNET                0xfffe
 
 extern int     rtfd;
-struct rtmptab *newrt __P((const struct interface *));
-void rtmp_delzonemap  __P((struct rtmptab *));
+struct rtmptab *newrt (const struct interface *);
+void rtmp_delzonemap  (struct rtmptab *);
+
+int rtmp_request ( struct interface * );
+void rtmp_free ( struct rtmptab * );
+int rtmp_replace ( struct rtmptab * );
+int looproute ( struct interface *, unsigned int );
+int gateroute ( unsigned int, struct rtmptab * );
+
+struct atport;
 
-int rtmp_request __P(( struct interface * ));
-void rtmp_free __P(( struct rtmptab * ));
-int rtmp_replace __P(( struct rtmptab * ));
-int looproute __P(( struct interface *, int ));
-int gateroute __P(( int, struct rtmptab * ));
+int rtmp_packet(struct atport *ap, struct sockaddr_at *from, char *data, int len);
 
 #endif /* atalkd/rtmp.h */