mirror of
https://github.com/isledecomp/isle-portable.git
synced 2024-12-22 05:42:29 -05:00
ec19d5edb0
* Fix engineConfig declaration crossing jump This fixes the following error: ``` /src/isle-portable/LEGO1/omni/src/audio/mxsoundmanager.cpp: In member function 'virtual MxResult MxSoundManager::Create(MxU32, MxBool)': /src/isle-portable/LEGO1/omni/src/audio/mxsoundmanager.cpp:119:1: error: jump to label 'done' 119 | done: | ^~~~ /src/isle-portable/LEGO1/omni/src/audio/mxsoundmanager.cpp:78:22: note: from here 78 | goto done; | ^~~~ /src/isle-portable/LEGO1/omni/src/audio/mxsoundmanager.cpp:84:26: note: crosses initialization of 'ma_engine_config engineConfig' 84 | ma_engine_config engineConfig = ma_engine_config_init(); | ^~~~~~~~~~~~ ``` * Fix 'invalid conversion from 'SDL_FunctionPointer' {aka 'void (*)()'} to 'void*' * /SAFESEH:NO is a VC thing * SDL3 is still instable * Cannot forward declare and use enum * Remove MusicManager from public LEGO1.DLL interface * Copy d3d from wine git 6c5d17af07a318d754c0c21023b2d162a0d3725d * Build d3drm-wine with 32-bit mingw * cmake: move 3rd party targets to cmake script in 3rdparty directory * cmake: bump minimum required CMake version to 3.25 to allow adding a subproject with SYSTEM automatically applied An alternative would be to use SYSTEM in target_include_directories in the 3rd party cmake script. * Add a minimal Findiniparser.cmake (not all distributions carry the upstream iniparser-config.cmake files) * Add wine's d3drm headers * cmake: merge ISLE_USE_DX5_LIBS into ISLE_USE_DX5 * cmake: Build all shared libraries in the binary output directory (to avoid PATH issues) * ci: enable msys2 mingw32 build * Disable clang-tidy on d3drm wine * Thread functions must have SDLCALL call convention * cmake: disable clang-tidy for miniaudio and libsmacker as well * Hopefully fix c++ format and skip ncc naming violation * clang-format violations keep up popping out of nowhere * No need for lego/legoomni/include * ncc: define SDLCALL as empty instead
270 lines
8 KiB
C
270 lines
8 KiB
C
/*
|
|
* Linked lists support
|
|
*
|
|
* Copyright (C) 2002 Alexandre Julliard
|
|
*
|
|
* This library is free software; you can redistribute it and/or
|
|
* modify it under the terms of the GNU Lesser General Public
|
|
* License as published by the Free Software Foundation; either
|
|
* version 2.1 of the License, or (at your option) any later version.
|
|
*
|
|
* This library 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
|
|
* Lesser General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU Lesser General Public
|
|
* License along with this library; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
|
|
*/
|
|
|
|
#ifndef __WINE_SERVER_LIST_H
|
|
#define __WINE_SERVER_LIST_H
|
|
|
|
#include <stddef.h>
|
|
|
|
struct list
|
|
{
|
|
struct list *next;
|
|
struct list *prev;
|
|
};
|
|
|
|
/* Define a list like so:
|
|
*
|
|
* struct gadget
|
|
* {
|
|
* struct list entry; <-- doesn't have to be the first item in the struct
|
|
* int a, b;
|
|
* };
|
|
*
|
|
* static struct list global_gadgets = LIST_INIT( global_gadgets );
|
|
*
|
|
* or
|
|
*
|
|
* struct some_global_thing
|
|
* {
|
|
* struct list gadgets;
|
|
* };
|
|
*
|
|
* list_init( &some_global_thing->gadgets );
|
|
*
|
|
* Manipulate it like this:
|
|
*
|
|
* list_add_head( &global_gadgets, &new_gadget->entry );
|
|
* list_remove( &new_gadget->entry );
|
|
* list_add_after( &some_random_gadget->entry, &new_gadget->entry );
|
|
*
|
|
* And to iterate over it:
|
|
*
|
|
* struct gadget *gadget;
|
|
* LIST_FOR_EACH_ENTRY( gadget, &global_gadgets, struct gadget, entry )
|
|
* {
|
|
* ...
|
|
* }
|
|
*
|
|
*/
|
|
|
|
/* add an element after the specified one */
|
|
static inline void list_add_after( struct list *elem, struct list *to_add )
|
|
{
|
|
to_add->next = elem->next;
|
|
to_add->prev = elem;
|
|
elem->next->prev = to_add;
|
|
elem->next = to_add;
|
|
}
|
|
|
|
/* add an element before the specified one */
|
|
static inline void list_add_before( struct list *elem, struct list *to_add )
|
|
{
|
|
to_add->next = elem;
|
|
to_add->prev = elem->prev;
|
|
elem->prev->next = to_add;
|
|
elem->prev = to_add;
|
|
}
|
|
|
|
/* add element at the head of the list */
|
|
static inline void list_add_head( struct list *list, struct list *elem )
|
|
{
|
|
list_add_after( list, elem );
|
|
}
|
|
|
|
/* add element at the tail of the list */
|
|
static inline void list_add_tail( struct list *list, struct list *elem )
|
|
{
|
|
list_add_before( list, elem );
|
|
}
|
|
|
|
/* remove an element from its list */
|
|
static inline void list_remove( struct list *elem )
|
|
{
|
|
elem->next->prev = elem->prev;
|
|
elem->prev->next = elem->next;
|
|
}
|
|
|
|
/* get the next element */
|
|
static inline struct list *list_next( const struct list *list, const struct list *elem )
|
|
{
|
|
struct list *ret = elem->next;
|
|
if (elem->next == list) ret = NULL;
|
|
return ret;
|
|
}
|
|
|
|
/* get the previous element */
|
|
static inline struct list *list_prev( const struct list *list, const struct list *elem )
|
|
{
|
|
struct list *ret = elem->prev;
|
|
if (elem->prev == list) ret = NULL;
|
|
return ret;
|
|
}
|
|
|
|
/* get the first element */
|
|
static inline struct list *list_head( const struct list *list )
|
|
{
|
|
return list_next( list, list );
|
|
}
|
|
|
|
/* get the last element */
|
|
static inline struct list *list_tail( const struct list *list )
|
|
{
|
|
return list_prev( list, list );
|
|
}
|
|
|
|
/* check if a list is empty */
|
|
static inline int list_empty( const struct list *list )
|
|
{
|
|
return list->next == list;
|
|
}
|
|
|
|
/* initialize a list */
|
|
static inline void list_init( struct list *list )
|
|
{
|
|
list->next = list->prev = list;
|
|
}
|
|
|
|
/* count the elements of a list */
|
|
static inline unsigned int list_count( const struct list *list )
|
|
{
|
|
unsigned count = 0;
|
|
const struct list *ptr;
|
|
for (ptr = list->next; ptr != list; ptr = ptr->next) count++;
|
|
return count;
|
|
}
|
|
|
|
/* move all elements from src to before the specified element */
|
|
static inline void list_move_before( struct list *dst, struct list *src )
|
|
{
|
|
if (list_empty(src)) return;
|
|
|
|
dst->prev->next = src->next;
|
|
src->next->prev = dst->prev;
|
|
dst->prev = src->prev;
|
|
src->prev->next = dst;
|
|
list_init(src);
|
|
}
|
|
|
|
/* move all elements from src to after the specified element */
|
|
static inline void list_move_after( struct list *dst, struct list *src )
|
|
{
|
|
if (list_empty(src)) return;
|
|
|
|
dst->next->prev = src->prev;
|
|
src->prev->next = dst->next;
|
|
dst->next = src->next;
|
|
src->next->prev = dst;
|
|
list_init(src);
|
|
}
|
|
|
|
/* move all elements from src to the head of dst */
|
|
static inline void list_move_head( struct list *dst, struct list *src )
|
|
{
|
|
list_move_after( dst, src );
|
|
}
|
|
|
|
/* move all elements from src to the tail of dst */
|
|
static inline void list_move_tail( struct list *dst, struct list *src )
|
|
{
|
|
list_move_before( dst, src );
|
|
}
|
|
|
|
/* move the slice of elements from begin to end inclusive to the head of dst */
|
|
static inline void list_move_slice_head( struct list *dst, struct list *begin, struct list *end )
|
|
{
|
|
struct list *dst_next = dst->next;
|
|
begin->prev->next = end->next;
|
|
end->next->prev = begin->prev;
|
|
dst->next = begin;
|
|
dst_next->prev = end;
|
|
begin->prev = dst;
|
|
end->next = dst_next;
|
|
}
|
|
|
|
/* move the slice of elements from begin to end inclusive to the tail of dst */
|
|
static inline void list_move_slice_tail( struct list *dst, struct list *begin, struct list *end )
|
|
{
|
|
struct list *dst_prev = dst->prev;
|
|
begin->prev->next = end->next;
|
|
end->next->prev = begin->prev;
|
|
dst_prev->next = begin;
|
|
dst->prev = end;
|
|
begin->prev = dst_prev;
|
|
end->next = dst;
|
|
}
|
|
|
|
/* iterate through the list */
|
|
#define LIST_FOR_EACH(cursor,list) \
|
|
for ((cursor) = (list)->next; (cursor) != (list); (cursor) = (cursor)->next)
|
|
|
|
/* iterate through the list, with safety against removal */
|
|
#define LIST_FOR_EACH_SAFE(cursor, cursor2, list) \
|
|
for ((cursor) = (list)->next, (cursor2) = (cursor)->next; \
|
|
(cursor) != (list); \
|
|
(cursor) = (cursor2), (cursor2) = (cursor)->next)
|
|
|
|
/* iterate through the list using a list entry */
|
|
#define LIST_FOR_EACH_ENTRY(elem, list, type, field) \
|
|
for ((elem) = LIST_ENTRY((list)->next, type, field); \
|
|
&(elem)->field != (list); \
|
|
(elem) = LIST_ENTRY((elem)->field.next, type, field))
|
|
|
|
/* iterate through the list using a list entry, with safety against removal */
|
|
#define LIST_FOR_EACH_ENTRY_SAFE(cursor, cursor2, list, type, field) \
|
|
for ((cursor) = LIST_ENTRY((list)->next, type, field), \
|
|
(cursor2) = LIST_ENTRY((cursor)->field.next, type, field); \
|
|
&(cursor)->field != (list); \
|
|
(cursor) = (cursor2), \
|
|
(cursor2) = LIST_ENTRY((cursor)->field.next, type, field))
|
|
|
|
/* iterate through the list in reverse order */
|
|
#define LIST_FOR_EACH_REV(cursor,list) \
|
|
for ((cursor) = (list)->prev; (cursor) != (list); (cursor) = (cursor)->prev)
|
|
|
|
/* iterate through the list in reverse order, with safety against removal */
|
|
#define LIST_FOR_EACH_SAFE_REV(cursor, cursor2, list) \
|
|
for ((cursor) = (list)->prev, (cursor2) = (cursor)->prev; \
|
|
(cursor) != (list); \
|
|
(cursor) = (cursor2), (cursor2) = (cursor)->prev)
|
|
|
|
/* iterate through the list in reverse order using a list entry */
|
|
#define LIST_FOR_EACH_ENTRY_REV(elem, list, type, field) \
|
|
for ((elem) = LIST_ENTRY((list)->prev, type, field); \
|
|
&(elem)->field != (list); \
|
|
(elem) = LIST_ENTRY((elem)->field.prev, type, field))
|
|
|
|
/* iterate through the list in reverse order using a list entry, with safety against removal */
|
|
#define LIST_FOR_EACH_ENTRY_SAFE_REV(cursor, cursor2, list, type, field) \
|
|
for ((cursor) = LIST_ENTRY((list)->prev, type, field), \
|
|
(cursor2) = LIST_ENTRY((cursor)->field.prev, type, field); \
|
|
&(cursor)->field != (list); \
|
|
(cursor) = (cursor2), \
|
|
(cursor2) = LIST_ENTRY((cursor)->field.prev, type, field))
|
|
|
|
/* macros for statically initialized lists */
|
|
#undef LIST_INIT
|
|
#define LIST_INIT(list) { &(list), &(list) }
|
|
|
|
/* get pointer to object containing list element */
|
|
#undef LIST_ENTRY
|
|
#define LIST_ENTRY(elem, type, field) \
|
|
((type *)((char *)(elem) - offsetof(type, field)))
|
|
|
|
#endif /* __WINE_SERVER_LIST_H */
|