patches/glibc/2_9/190-queue-header-updates.patch
author "Yann E. MORIN" <yann.morin.1998@anciens.enib.fr>
Mon Feb 02 22:00:18 2009 +0000 (2009-02-02)
changeset 1201 c9967a6e3b25
permissions -rw-r--r--
Add a patchset for glibc 2_9. Vampirised from the gentoo repository.

/trunk/patches/glibc/2_9/500-ppc-glibc-2.9-atomic.patch | 414 414 0 0 ++++++++++
/trunk/patches/glibc/2_9/140-regex-BZ9697.patch | 111 111 0 0 +++
/trunk/patches/glibc/2_9/190-queue-header-updates.patch | 89 89 0 0 ++
/trunk/patches/glibc/2_9/370-hppa_glibc-2.7-hppa-nptl-carlos.patch | 249 249 0 0 ++++++
/trunk/patches/glibc/2_9/450-alpha-glibc-2.5-no-page-header.patch | 32 32 0 0 +
/trunk/patches/glibc/2_9/270-ldbl-nexttowardf.patch | 68 68 0 0 ++
/trunk/patches/glibc/2_9/330-2.3.3-china.patch | 35 35 0 0 +
/trunk/patches/glibc/2_9/340-new-valencian-locale.patch | 120 120 0 0 +++
/trunk/patches/glibc/2_9/410-2.9-fnmatch.patch | 64 64 0 0 ++
/trunk/patches/glibc/2_9/350-2.4-undefine-__i686.patch | 47 47 0 0 +
/trunk/patches/glibc/2_9/160-i386-x86_64-revert-clone-cfi.patch | 53 53 0 0 +
/trunk/patches/glibc/2_9/420-dont-build-timezone.patch | 19 19 0 0 +
/trunk/patches/glibc/2_9/150-regex-BZ697.patch | 28 28 0 0 +
/trunk/patches/glibc/2_9/290-no-inline-gmon.patch | 38 38 0 0 +
/trunk/patches/glibc/2_9/280-section-comments.patch | 29 29 0 0 +
/trunk/patches/glibc/2_9/180-math-tests.patch | 72 72 0 0 ++
/trunk/patches/glibc/2_9/120-_nss_dns_gethostbyaddr2_r-check-and-adjust-the-buffer-alignment.patch | 35 35 0 0 +
/trunk/patches/glibc/2_9/250-resolv-dynamic.patch | 44 44 0 0 +
/trunk/patches/glibc/2_9/300-2.9-check_native-headers.patch | 22 22 0 0 +
/trunk/patches/glibc/2_9/310-2.3.6-fix-pr631.patch | 50 50 0 0 +
/trunk/patches/glibc/2_9/130-add_prio-macros.patch | 26 26 0 0 +
/trunk/patches/glibc/2_9/260-fadvise64_64.patch | 30 30 0 0 +
/trunk/patches/glibc/2_9/440-alpha-glibc-2.4-xstat.patch | 249 249 0 0 ++++++
/trunk/patches/glibc/2_9/170-2.10-dns-no-gethostbyname4.patch | 35 35 0 0 +
/trunk/patches/glibc/2_9/230-2.3.3-localedef-fix-trampoline.patch | 74 74 0 0 ++
/trunk/patches/glibc/2_9/360-2.8-nscd-one-fork.patch | 45 45 0 0 +
/trunk/patches/glibc/2_9/480-alpha-glibc-2.8-cache-shape.patch | 18 18 0 0 +
/trunk/patches/glibc/2_9/210-2.9-strlen-hack.patch | 109 109 0 0 +++
/trunk/patches/glibc/2_9/320-2.9-assume-pipe2.patch | 59 59 0 0 +
/trunk/patches/glibc/2_9/100-ssp-compat.patch | 193 193 0 0 +++++
/trunk/patches/glibc/2_9/110-respect-env-CPPFLAGS.patch | 30 30 0 0 +
/trunk/patches/glibc/2_9/220-manual-no-perl.patch | 29 29 0 0 +
/trunk/patches/glibc/2_9/390-2.3.3_pre20040117-pt_pax.patch | 35 35 0 0 +
/trunk/patches/glibc/2_9/460-alpha-glibc-2.5-no-asm-elf-header.patch | 38 38 0 0 +
/trunk/patches/glibc/2_9/400-tests-sandbox-libdl-paths.patch | 198 198 0 0 +++++
/trunk/patches/glibc/2_9/240-i386-LOAD_PIC_REG.patch | 23 23 0 0 +
/trunk/patches/glibc/2_9/200-awk-in-C-locale.patch | 23 23 0 0 +
/trunk/patches/glibc/2_9/430-2.7-cross-compile-nptl.patch | 57 57 0 0 +
/trunk/patches/glibc/2_9/380-2.3.6-dl_execstack-PaX-support.patch | 71 71 0 0 ++
/trunk/patches/glibc/2_9/490-ptr-mangling.patch | 114 114 0 0 +++
/trunk/patches/glibc/2_9/470-alpha-glibc-2.8-creat.patch | 19 19 0 0 +
41 files changed, 3094 insertions(+)
     1 Original patch from: gentoo/src/patchsets/glibc/2.9/1010_all_glibc-queue-header-updates.patch
     2 
     3 -= BEGIN original header =-
     4 grab some updates from FreeBSD
     5 
     6 http://bugs.gentoo.org/201979
     7 
     8 -= END original header =-
     9 
    10 diff -durN glibc-2_9.orig/misc/sys/queue.h glibc-2_9/misc/sys/queue.h
    11 --- glibc-2_9.orig/misc/sys/queue.h	2008-03-05 06:50:30.000000000 +0100
    12 +++ glibc-2_9/misc/sys/queue.h	2009-02-02 22:00:48.000000000 +0100
    13 @@ -136,6 +136,11 @@
    14  		(var);							\
    15  		(var) = ((var)->field.le_next))
    16  
    17 +#define	LIST_FOREACH_SAFE(var, head, field, tvar)			\
    18 +	for ((var) = LIST_FIRST((head));				\
    19 +	    (var) && ((tvar) = LIST_NEXT((var), field), 1);		\
    20 +	    (var) = (tvar))
    21 +
    22  /*
    23   * List access methods.
    24   */
    25 @@ -197,6 +202,16 @@
    26  #define	SLIST_FOREACH(var, head, field)					\
    27  	for((var) = (head)->slh_first; (var); (var) = (var)->field.sle_next)
    28  
    29 +#define	SLIST_FOREACH_SAFE(var, head, field, tvar)			\
    30 +	for ((var) = SLIST_FIRST((head));				\
    31 +	    (var) && ((tvar) = SLIST_NEXT((var), field), 1);		\
    32 +	    (var) = (tvar))
    33 +
    34 +#define	SLIST_FOREACH_PREVPTR(var, varp, head, field)			\
    35 +	for ((varp) = &SLIST_FIRST((head));				\
    36 +	    ((var) = *(varp)) != NULL;					\
    37 +	    (varp) = &SLIST_NEXT((var), field))
    38 +
    39  /*
    40   * Singly-linked List access methods.
    41   */
    42 @@ -242,6 +257,12 @@
    43  	(head)->stqh_last = &(elm)->field.stqe_next;			\
    44  } while (/*CONSTCOND*/0)
    45  
    46 +#define	STAILQ_LAST(head, type, field)					\
    47 +	(STAILQ_EMPTY((head)) ?						\
    48 +		NULL :							\
    49 +	        ((struct type *)(void *)				\
    50 +		((char *)((head)->stqh_last) - __offsetof(struct type, field))))
    51 +
    52  #define	STAILQ_INSERT_AFTER(head, listelm, elm, field) do {		\
    53  	if (((elm)->field.stqe_next = (listelm)->field.stqe_next) == NULL)\
    54  		(head)->stqh_last = &(elm)->field.stqe_next;		\
    55 @@ -286,6 +307,11 @@
    56  #define	STAILQ_FIRST(head)	((head)->stqh_first)
    57  #define	STAILQ_NEXT(elm, field)	((elm)->field.stqe_next)
    58  
    59 +#define	STAILQ_FOREACH_SAFE(var, head, field, tvar)			\
    60 +	for ((var) = STAILQ_FIRST((head));				\
    61 +	    (var) && ((tvar) = STAILQ_NEXT((var), field), 1);		\
    62 +	    (var) = (tvar))
    63 +
    64  
    65  /*
    66   * Simple queue definitions.
    67 @@ -437,11 +463,22 @@
    68  		(var);							\
    69  		(var) = ((var)->field.tqe_next))
    70  
    71 +#define	TAILQ_FOREACH_SAFE(var, head, field, tvar)			\
    72 +	for ((var) = TAILQ_FIRST((head));				\
    73 +	    (var) && ((tvar) = TAILQ_NEXT((var), field), 1);		\
    74 +	    (var) = (tvar))
    75 +
    76  #define	TAILQ_FOREACH_REVERSE(var, head, headname, field)		\
    77  	for ((var) = (*(((struct headname *)((head)->tqh_last))->tqh_last));	\
    78  		(var);							\
    79  		(var) = (*(((struct headname *)((var)->field.tqe_prev))->tqh_last)))
    80  
    81 +#define	TAILQ_FOREACH_REVERSE_SAFE(var, head, headname, field, tvar)	\
    82 +	for ((var) = TAILQ_LAST((head), headname);			\
    83 +	    (var) && ((tvar) = TAILQ_PREV((var), headname, field), 1);	\
    84 +	    (var) = (tvar))
    85 +
    86 +
    87  #define	TAILQ_CONCAT(head1, head2, field) do {				\
    88  	if (!TAILQ_EMPTY(head2)) {					\
    89  		*(head1)->tqh_last = (head2)->tqh_first;		\