mirror of
https://github.com/samba-team/samba.git
synced 2024-12-28 07:21:54 +03:00
366bf693d2
statement after an 'if'. Tracking this down took 4 hours from my life and ANDREW I WANT
THEM BACK !!!!! :-).
include/smb.h smbd/password.c: Fixed the bug veritas reported with realloc of the validated_users
array growing without bounds. This is now a linked list as god (Andrew) intended :-).
Jeremy.
(This used to be commit 346f2f9206)
59 lines
1.6 KiB
C
59 lines
1.6 KiB
C
/*
|
|
Unix SMB/Netbios implementation.
|
|
Version 1.9.
|
|
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 02139, 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) \
|
|
{ \
|
|
if (!(list)) { \
|
|
(list) = (p); \
|
|
(p)->next = (p)->prev = NULL; \
|
|
} else { \
|
|
(list)->prev = (p); \
|
|
(p)->next = (list); \
|
|
(p)->prev = NULL; \
|
|
(list) = (p); \
|
|
}\
|
|
}
|
|
|
|
|
|
/* remove an element from a list */
|
|
#define DLIST_REMOVE(list, p) \
|
|
{ \
|
|
if ((p) == (list)) { \
|
|
(list) = (p)->next; \
|
|
if (list) (list)->prev = NULL; \
|
|
} else { \
|
|
(p)->prev->next = (p)->next; \
|
|
if ((p)->next) (p)->next->prev = (p)->prev; \
|
|
} \
|
|
}
|
|
|
|
/* promote an element to the top of the list */
|
|
#define DLIST_PROMOTE(list, p) \
|
|
{ \
|
|
DLIST_REMOVE(list, p) \
|
|
DLIST_ADD(list, p) \
|
|
}
|