mirror of
https://github.com/samba-team/samba.git
synced 2025-02-09 09:57:48 +03:00
96bf4da3ed
Up to now the client code has had an async API, and operated asynchronously at the packet level, but was not truly async in that it assumed that it could always write to the socket and when a partial packet came in that it could block waiting for the rest of the packet. This change makes the SMB client library full async, by adding a separate outgoing packet queue, using non-blocking socket IO and having a input buffer that can fill asynchonously until the full packet has arrived. The main complexity was in dealing with the events structure when using the CIFS proxy backend. In that case the same events structure needs to be used in both the client library and the main smbd server, so that when the client library is waiting for a reply that the main server keeps processing packets. This required some changes in the events library code. Next step is to make the generated rpc client code use these new capabilities.
94 lines
2.6 KiB
C
94 lines
2.6 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)
|
|
|
|
/* concatenate two lists - putting all elements of the 2nd list at the
|
|
end of the first list */
|
|
#define DLIST_CONCATENATE(list1, list2, type) \
|
|
do { \
|
|
if (!(list1)) { \
|
|
(list1) = (list2); \
|
|
} else { \
|
|
type tmp; \
|
|
for (tmp = (list1); tmp->next; tmp = tmp->next) ; \
|
|
tmp->next = (list2); \
|
|
(list2)->prev = tmp; \
|
|
} \
|
|
} while (0)
|