From e88a664a8124749913b4b08459dc37a9d3ed5c0f Mon Sep 17 00:00:00 2001
From: joerg <joerg@pkgsrc.org>
Date: Mon, 25 Jun 2012 11:26:28 +0000
Subject: Fix build with a C99 compiler.

---
 devel/qof/distinfo                       |  3 +-
 devel/qof/patches/patch-qof_qofmath128.h | 61 ++++++++++++++++++++++++++++++++
 2 files changed, 63 insertions(+), 1 deletion(-)
 create mode 100644 devel/qof/patches/patch-qof_qofmath128.h

(limited to 'devel')

diff --git a/devel/qof/distinfo b/devel/qof/distinfo
index fa2a7d2160f..289ad1ca8b1 100644
--- a/devel/qof/distinfo
+++ b/devel/qof/distinfo
@@ -1,6 +1,7 @@
-$NetBSD: distinfo,v 1.1.1.1 2008/10/28 23:36:39 wiz Exp $
+$NetBSD: distinfo,v 1.2 2012/06/25 11:26:28 joerg Exp $
 
 SHA1 (qof-0.7.5.tar.gz) = 9d7453fca0910c401180b8c8eda7443442633803
 RMD160 (qof-0.7.5.tar.gz) = 3e0ab118c2c5c1d760f2a9445183e77659f692c7
 Size (qof-0.7.5.tar.gz) = 906010 bytes
 SHA1 (patch-aa) = 1e9abeff6dd6fdb50092c104219576fb8d080d1f
+SHA1 (patch-qof_qofmath128.h) = daaf1989791a7cc2743cfe655696246809dbd35f
diff --git a/devel/qof/patches/patch-qof_qofmath128.h b/devel/qof/patches/patch-qof_qofmath128.h
new file mode 100644
index 00000000000..7e11ff83c96
--- /dev/null
+++ b/devel/qof/patches/patch-qof_qofmath128.h
@@ -0,0 +1,61 @@
+$NetBSD: patch-qof_qofmath128.h,v 1.1 2012/06/25 11:26:28 joerg Exp $
+
+--- qof/qofmath128.h.orig	2012-06-18 15:51:31.000000000 +0000
++++ qof/qofmath128.h
+@@ -44,45 +44,45 @@ typedef struct
+ } QofInt128;
+ 
+ /** Return true of two numbers are equal */
+-inline gboolean equal128 (QofInt128 a, QofInt128 b);
++gboolean equal128 (QofInt128 a, QofInt128 b);
+ 
+ /** Return returns 1 if a>b, -1 if b>a, 0 if a == b */
+-inline gint cmp128 (QofInt128 a, QofInt128 b);
++gint cmp128 (QofInt128 a, QofInt128 b);
+ 
+ /** Shift right by one bit (i.e. divide by two) */
+-inline QofInt128 shift128 (QofInt128 x);
++QofInt128 shift128 (QofInt128 x);
+ 
+ /** Shift left by one bit (i.e. multiply by two) */
+-inline QofInt128 shiftleft128 (QofInt128 x);
++QofInt128 shiftleft128 (QofInt128 x);
+ 
+ /** Increment by one */
+-inline QofInt128 inc128 (QofInt128 a);
++QofInt128 inc128 (QofInt128 a);
+ 
+ /** Add a pair of 128-bit numbers, returning a 128-bit number */
+-inline QofInt128 add128 (QofInt128 a, QofInt128 b);
++QofInt128 add128 (QofInt128 a, QofInt128 b);
+ 
+ /** Multiply a pair of signed 64-bit numbers, 
+  *  returning a signed 128-bit number.
+  */
+-inline QofInt128 mult128 (gint64 a, gint64 b);
++QofInt128 mult128 (gint64 a, gint64 b);
+ 
+ /** Divide a signed 128-bit number by a signed 64-bit,
+  *  returning a signed 128-bit number.
+  */
+-inline QofInt128 div128 (QofInt128 n, gint64 d);
++QofInt128 div128 (QofInt128 n, gint64 d);
+ 
+ /** Return the remainder of a signed 128-bit number modulo 
+  *  a signed 64-bit.  That is, return n%d in 128-bit math.
+  *  I beleive that ths algo is overflow-free, but should be 
+  *  audited some more ... 
+  */
+-inline gint64 rem128 (QofInt128 n, gint64 d);
++gint64 rem128 (QofInt128 n, gint64 d);
+ 
+ /** Return the greatest common factor of two 64-bit numbers */
+-inline guint64 gcf64 (guint64 num, guint64 denom);
++guint64 gcf64 (guint64 num, guint64 denom);
+ 
+ /** Return the least common multiple of two 64-bit numbers. */
+-inline QofInt128 lcm128 (guint64 a, guint64 b);
++QofInt128 lcm128 (guint64 a, guint64 b);
+ 
+ /** @} */
+ /** @} */
-- 
cgit v1.2.3