0001-01-01 02:30:17 +02:30
/*
0001-01-01 02:30:17 +02:30
Unix SMB / CIFS implementation .
0001-01-01 02:30:17 +02:30
some simple double linked list macros
Copyright ( C ) Andrew Tridgell 1998
This program is free software ; you can redistribute it and / or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation ; either version 2 of the License , or
( at your option ) any later version .
This program is distributed in the hope that it will be useful ,
but WITHOUT ANY WARRANTY ; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE . See the
GNU General Public License for more details .
You should have received a copy of the GNU General Public License
along with this program ; if not , write to the Free Software
Foundation , Inc . , 675 Mass Ave , Cambridge , MA 0213 9 , USA .
*/
/* To use these macros you must have a structure containing a next and
prev pointer */
/* hook into the front of the list */
# define DLIST_ADD(list, p) \
0001-01-01 02:30:17 +02:30
{ \
0001-01-01 02:30:17 +02:30
if ( ! ( list ) ) { \
( list ) = ( p ) ; \
( p ) - > next = ( p ) - > prev = NULL ; \
} else { \
( list ) - > prev = ( p ) ; \
( p ) - > next = ( list ) ; \
( p ) - > prev = NULL ; \
( list ) = ( p ) ; \
0001-01-01 02:30:17 +02:30
} \
}
0001-01-01 02:30:17 +02:30
0001-01-01 02:30:17 +02:30
/* remove an element from a list - element doesn't have to be in list. */
0001-01-01 02:30:17 +02:30
# define DLIST_REMOVE(list, p) \
0001-01-01 02:30:17 +02:30
{ \
0001-01-01 02:30:17 +02:30
if ( ( p ) = = ( list ) ) { \
( list ) = ( p ) - > next ; \
if ( list ) ( list ) - > prev = NULL ; \
} else { \
0001-01-01 02:30:17 +02:30
if ( ( p ) - > prev ) ( p ) - > prev - > next = ( p ) - > next ; \
0001-01-01 02:30:17 +02:30
if ( ( p ) - > next ) ( p ) - > next - > prev = ( p ) - > prev ; \
0001-01-01 02:30:17 +02:30
} \
0001-01-01 02:30:17 +02:30
if ( ( p ) & & ( ( p ) ! = ( list ) ) ) ( p ) - > next = ( p ) - > prev = NULL ; \
0001-01-01 02:30:17 +02:30
}
0001-01-01 02:30:17 +02:30
/* promote an element to the top of the list */
# define DLIST_PROMOTE(list, p) \
0001-01-01 02:30:17 +02:30
{ \
0001-01-01 02:30:17 +02:30
DLIST_REMOVE ( list , p ) \
0001-01-01 02:30:17 +02:30
DLIST_ADD ( list , p ) \
}
0001-01-01 02:30:17 +02:30
0001-01-01 02:30:17 +02:30
/* hook into the end of the list - needs a tmp pointer */
# define DLIST_ADD_END(list, p, tmp) \
0001-01-01 02:30:17 +02:30
{ \
if ( ! ( list ) ) { \
( list ) = ( p ) ; \
( p ) - > next = ( p ) - > prev = NULL ; \
} else { \
for ( ( tmp ) = ( list ) ; ( tmp ) - > next ; ( tmp ) = ( tmp ) - > next ) ; \
( tmp ) - > next = ( p ) ; \
( p ) - > next = NULL ; \
( p ) - > prev = ( tmp ) ; \
} \
}
0001-01-01 02:30:17 +02:30
/* demote an element to the top of the list, needs a tmp pointer */
# define DLIST_DEMOTE(list, p, tmp) \
{ \
DLIST_REMOVE ( list , p ) \
DLIST_ADD_END ( list , p , tmp ) \
}