-MD5 426b891816ad0c5e7485306796b22bd8 ChangeLog 10134
+MD5 560a63c280242340f5eedc59fa2ab667 ChangeLog 10268
MD5 b3d1c41a74dbe1041b4082288cacd3ca linux26-headers-2.6.7-r4.ebuild 4031
MD5 21dcb669b4e8535f0a04f40ad2c4c9ff metadata.xml 224
MD5 91179c84e3dc8dadcfdad16cabede343 linux26-headers-2.6.5.ebuild 4188
MD5 9101139b0720280f338a1823c281ee84 files/linux26-headers-2.6.8.1-parisc-syscall.patch 413
MD5 8fbc202526e4c1b1672c5274bbff4e5f files/linux26-headers-2.6.6-appCompat.patch 26689
MD5 ec3d195f7d40d599802d5c0c5ad8f502 files/linux26-headers-2.6.4-appCompat.patch 17240
-MD5 6394b51aaf6800dce1dd7a710776dc9e files/linux26-headers-2.6.8.1-appCompat.patch 58549
+MD5 7ba4b1fac2a6131679648126a9f55d48 files/linux26-headers-2.6.8.1-appCompat.patch 58990
MD5 b405a908c2cc1e6ed3e25f030c41f4c4 files/digest-linux26-headers-2.6.7-r4 66
MD5 830c6d1dcb1b22b9095e6f16f3ebdf85 files/linux26-headers-2.6.6-tcp_info-DRS-backport.patch 288
MD5 a8c4e44a323fbde21b9de3940e2ca5ef files/digest-linux26-headers-2.6.5 66
-#endif /* __KERNEL__ */
-
#endif
-diff -ur linux-2.6.7/include/linux/fd.h linux-2.6.7-gentoo/include/linux/fd.h
---- linux-2.6.7/include/linux/fd.h 2004-06-12 12:11:54.000000000 +0100
-+++ linux-2.6.7-gentoo/include/linux/fd.h 2004-06-18 20:53:39.000000000 +0100
-@@ -1,6 +1,7 @@
- #ifndef _LINUX_FD_H
- #define _LINUX_FD_H
+diff -ur linux-2.6.8.1/include/linux/fd.h linux-2.6.8.1-gentoo/include/linux/fd.h
+--- linux-2.6.8.1/include/linux/fd.h 2004-06-12 12:11:54.000000000 +0100
++++ linux-2.6.8.1-gentoo/include/linux/fd.h 2004-06-18 20:53:39.000000000 +0100
+@@ -3,6 +3,7 @@
-+#include <linux/compiler.h>
#include <linux/ioctl.h>
+ #include <linux/compiler.h>
++#include <linux/types.h>
/* New file layout: Now the ioctl definitions immediately follow the
+ * definitions of the structures that they use */
diff -ur linux-2.6.8.1/include/linux/compiler.h linux-2.6.8.1-gentoo/include/linux/compiler.h
--- linux-2.6.8.1/include/linux/compiler.h 2004-06-12 12:11:54.000000000 +0100
+++ linux-2.6.8.1-gentoo/include/linux/compiler.h 2004-06-24 09:48:32.478502752 +0100
/* Optimization barrier */
#ifndef barrier
-# define barrier() __memory_barrier()
-+# define __ffs /* Prevent ffs(...) getting declared when we don't need it */
++# define __ffs_X /* Prevent ffs(...) getting declared when we don't need it */
+# include <asm/system.h>
-+# undef __ffs
++# undef __ffs_X
+# ifdef mb
+# define barrier() mb()
+# else
/**
* __ffs - find first bit in word. returns 0 to "BITS_PER_LONG-1".
* @word: The word to search
-@@ -345,8 +343,6 @@ static inline int sched_find_first_bit(u
+@@ -224,6 +222,7 @@ static __inline__ int test_bit(int nr, c
+ * cycles for each mispredicted branch.
+ */
+
++#ifndef __ffs_X
+ static __inline__ unsigned long __ffs(unsigned long x)
+ {
+ unsigned long ret;
+@@ -254,6 +253,7 @@ static __inline__ unsigned long __ffs(un
+ : "+r" (x), "=r" (ret) );
+ return ret;
+ }
++#endif
+
+ /* Undefined if no bit is zero. */
+ #define ffz(x) __ffs(~x)
+@@ -345,8 +345,6 @@ static inline int sched_find_first_bit(c
#endif
}
/*
* This implementation of find_{first,next}_zero_bit was stolen from
* Linus' asm-alpha/bitops.h.
-@@ -486,7 +482,7 @@ extern __inline__ unsigned long ext2_fin
+@@ -486,7 +484,7 @@ extern __inline__ unsigned long ext2_fin
size -= result;
offset &= 31UL;
if (offset) {
tmp |= ~0UL >> (32-offset);
if (size < 32)
goto found_first;
-@@ -496,14 +492,14 @@ extern __inline__ unsigned long ext2_fin
+@@ -496,14 +494,14 @@ extern __inline__ unsigned long ext2_fin
result += 32;
}
while (size >= 32) {
/*
* __ffs = Find First set bit in word. Undefined if no set bit exists.
*/
-+#ifndef __ffs
++#ifndef __ffs_X
static inline unsigned long __ffs(unsigned long word)
{
#if defined(__alpha_cix__) && defined(__alpha_fix__)
*
* Undefined if no bit exists, so code should check against 0 first.
*/
-+#ifndef __ffs
++#ifndef __ffs_X
static inline unsigned long __ffs(unsigned long word)
{
__asm__("bsfl %1,%0"
*
* Undefined if no bit exists, so code should check against 0 first.
*/
-+#ifndef __ffs
++#ifndef __ffs_X
static __inline__ unsigned long
__ffs (unsigned long x)
{
*
* Undefined if no bit exists, so code should check against 0 first.
*/
-+#ifndef __ffs
++#ifndef __ffs_X
static __inline__ unsigned long __ffs(unsigned long word)
{
unsigned long result = 0;