mirror of
https://github.com/samba-team/samba.git
synced 2024-12-28 07:21:54 +03:00
16309de71d
don't cause fragmented pdus (I'll add fragments shortly)
* change data_blob_talloc() to not zero memory when the 2nd argument
is NULL. The zeroing just masks bugs, and can't even allow a DOS
attack
* modified pidl to ensure that [ref] arguments to the out side of
functions are allocated when parsing the in side. This allows rpc
backends to assume that [ref] variables are all setup. Doesn't work
correctly for [ref] arrays yet
* changed DLIST_ADD_END() to take the type instead of a tmp
variable. This means you don't need to declare a silly tmp variable in
the caller
(This used to be commit 46e0a35819)
80 lines
2.2 KiB
C
80 lines
2.2 KiB
C
/*
|
|
Unix SMB/CIFS implementation.
|
|
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) \
|
|
do { \
|
|
if (!(list)) { \
|
|
(list) = (p); \
|
|
(p)->next = (p)->prev = NULL; \
|
|
} else { \
|
|
(list)->prev = (p); \
|
|
(p)->next = (list); \
|
|
(p)->prev = NULL; \
|
|
(list) = (p); \
|
|
}\
|
|
} while (0)
|
|
|
|
/* remove an element from a list - element doesn't have to be in list. */
|
|
#define DLIST_REMOVE(list, p) \
|
|
do { \
|
|
if ((p) == (list)) { \
|
|
(list) = (p)->next; \
|
|
if (list) (list)->prev = NULL; \
|
|
} else { \
|
|
if ((p)->prev) (p)->prev->next = (p)->next; \
|
|
if ((p)->next) (p)->next->prev = (p)->prev; \
|
|
} \
|
|
if ((p) && ((p) != (list))) (p)->next = (p)->prev = NULL; \
|
|
} while (0)
|
|
|
|
/* promote an element to the top of the list */
|
|
#define DLIST_PROMOTE(list, p) \
|
|
do { \
|
|
DLIST_REMOVE(list, p); \
|
|
DLIST_ADD(list, p); \
|
|
} while (0)
|
|
|
|
/* hook into the end of the list - needs a tmp pointer */
|
|
#define DLIST_ADD_END(list, p, type) \
|
|
do { \
|
|
if (!(list)) { \
|
|
(list) = (p); \
|
|
(p)->next = (p)->prev = NULL; \
|
|
} else { \
|
|
type tmp; \
|
|
for (tmp = (list); tmp->next; tmp = tmp->next) ; \
|
|
tmp->next = (p); \
|
|
(p)->next = NULL; \
|
|
(p)->prev = tmp; \
|
|
} \
|
|
} while (0)
|
|
|
|
/* demote an element to the end of the list, needs a tmp pointer */
|
|
#define DLIST_DEMOTE(list, p, tmp) \
|
|
do { \
|
|
DLIST_REMOVE(list, p); \
|
|
DLIST_ADD_END(list, p, tmp); \
|
|
} while (0)
|