it a/devel/fam/files/patch-fam__Makefile.am b/devel/fam/files/patch-fam__Makefile.am deleted file mode 100644 index 60acadef5cbc..000000000000 --- a/devel/fam/files/patch-fam__Makefile.am +++ /dev/null @@ -1,10 +0,0 @@ ---- ./fam/Makefile.am.orig 2003-04-15 06:21:26.000000000 +0200 -+++ ./fam/Makefile.am 2014-01-03 02:35:10.000000000 +0100 -@@ -72,6 +72,7 @@ - main.c++ \ - timeval.c++ \ - timeval.h \ -+ mntent_compat.c++ \ - @IMON_FUNCS@.c++ - - EXTRA_fam_SOURCES = IMonIrix.c++ IMonLinux.c++ IMonNone.c++ diff --git a/devel/fam/files/patch-fam__SmallTable.h b/devel/fam/files/patch-fam__SmallTable.h deleted file mode 100644 index 0849943c442a..000000000000 --- a/devel/fam/files/patch-fam__SmallTable.h +++ /dev/null @@ -1,11 +0,0 @@ ---- ./fam/SmallTable.h.orig 2003-04-15 06:21:43.000000000 +0200 -+++ ./fam/SmallTable.h 2014-01-03 02:35:10.000000000 +0100 -@@ -98,7 +98,7 @@ - } - - template --SmallTable::Closure -+typename SmallTable::Closure - SmallTable::position(const Tkey& key) const - { - unsigned l = 0, r = n; diff --git a/devel/fam/files/patch-fam__StringTable.h b/devel/fam/files/patch-fam__StringTable.h deleted file mode 100644 index 5b88fc7edb76..000000000000 --- a/devel/fam/files/patch-fam__StringTable.h +++ /dev/null @@ -1,10 +0,0 @@ ---- ./fam/StringTable.h.orig 2003-04-15 06:21:43.000000000 +0200 -+++ ./fam/StringTable.h 2014-01-03 02:35:10.000000000 +0100 -@@ -25,6 +25,7 @@ - - #include - #include -+#include "mntent.h" - - // A StringTable maps C strings onto values. It is a cheap O(n) - // implementation, suitable only for small tables that are diff --git a/devel/fam/files/patch-include__BTree.h b/devel/fam/files/patch-include__BTree.h deleted file mode 100644 index 628b52a463ac..000000000000 --- a/devel/fam/files/patch-include__BTree.h +++ /dev/null @@ -1,65 +0,0 @@ ---- ./include/BTree.h.orig 2003-04-15 06:21:19.000000000 +0200 -+++ ./include/BTree.h 2014-01-03 02:35:37.000000000 +0100 -@@ -236,7 +236,7 @@ - // to the right and returns them. - - template --BTree::Closure -+typename BTree::Closure - BTree::Node::remove(unsigned j) - { - Key k = key[j]; -@@ -318,7 +318,7 @@ - assert(root->n); - - Node *p, *q; -- for (p = root; q = p->link[0]; p = q) -+ for (p = root; (q = p->link[0]); p = q) - continue; - return p->key[0]; - } -@@ -348,7 +348,7 @@ - } - - template --BTree::Closure -+typename BTree::Closure - BTree::Node::next(const Key& pred) const - { - if (!this) -@@ -404,7 +404,7 @@ - // nodes as necessary on the way back. - - template --BTree::Closure -+typename BTree::Closure - BTree::insert(Node *p, const Key& key, const Value& value) - { - if (!p) return Closure(key, value, NULL); -@@ -499,7 +499,7 @@ - // Returns UNDER if node p is too small afterward, OK otherwise. - - template --BTree::Status -+typename BTree::Status - BTree::underflow(Node *p, unsigned i) - { - assert(p); -@@ -557,7 +557,7 @@ - - - template --BTree::Closure -+typename BTree::Closure - BTree::remove_rightmost(Node *p) - { - int i = p->n; -@@ -587,7 +587,7 @@ - // back up. - - template --BTree::Status -+typename BTree::Status - BTree::remove(Node *p, const Key& key) - { - if (!p) diff --git a/devel/fam/files/patch-libfam__Client.c++ b/devel/fam/files/patch-libfam__Client.c++ deleted file mode 100644 index 701037e9f85c..000000000000 --- a/devel/fam/files/patch-libfam__Client.c++ +++ /dev/null @@ -1,19 +0,0 @@ ---- ./libfam/Client.c++.orig 2003-04-15 06:21:25.000000000 +0200 -+++ ./libfam/Client.c++ 2014-01-03 02:35:10.000000000 +0100 -@@ -34,7 +34,6 @@ - #include - #include - --#include - - #include "fam.h" - #include "Client.h" -@@ -264,7 +263,7 @@ - { - char msg[100]; - snprintf(msg, sizeof(msg), -- "change info too long! (%d max)", sizeof(changeInfo)); -+ "change info too long! (%lu max)", (unsigned long)sizeof(changeInfo)); - croakConnection(msg); - return -1; - } diff --git a/devel/fam/files/pkg-message.in b/devel/fam/files/pkg-message.in deleted file mode 100644 index 6932f510e4af..000000000000 --- a/devel/fam/files/pkg-message.in +++ /dev/null @@ -1,29 +0,0 @@ -[ -{ type: install - message: <