2022-04-01 06:01:44 +00:00
|
|
|
/*
|
|
|
|
Simple DirectMedia Layer
|
2023-01-09 17:48:21 +00:00
|
|
|
Copyright (C) 1997-2023 Sam Lantinga <slouken@libsdl.org>
|
2022-04-01 06:01:44 +00:00
|
|
|
|
|
|
|
This software is provided 'as-is', without any express or implied
|
|
|
|
warranty. In no event will the authors be held liable for any damages
|
|
|
|
arising from the use of this software.
|
|
|
|
|
|
|
|
Permission is granted to anyone to use this software for any purpose,
|
|
|
|
including commercial applications, and to alter it and redistribute it
|
|
|
|
freely, subject to the following restrictions:
|
|
|
|
|
|
|
|
1. The origin of this software must not be misrepresented; you must not
|
|
|
|
claim that you wrote the original software. If you use this software
|
|
|
|
in a product, an acknowledgment in the product documentation would be
|
|
|
|
appreciated but is not required.
|
|
|
|
2. Altered source versions must be plainly marked as such, and must not be
|
|
|
|
misrepresented as being the original software.
|
|
|
|
3. This notice may not be removed or altered from any source distribution.
|
|
|
|
*/
|
|
|
|
#include "./SDL_internal.h"
|
|
|
|
|
|
|
|
#include "SDL.h"
|
|
|
|
#include "./SDL_list.h"
|
|
|
|
|
|
|
|
/* Push */
|
2022-11-30 20:51:59 +00:00
|
|
|
int SDL_ListAdd(SDL_ListNode **head, void *ent)
|
2022-04-01 06:01:44 +00:00
|
|
|
{
|
2022-11-30 20:51:59 +00:00
|
|
|
SDL_ListNode *node = SDL_malloc(sizeof(*node));
|
2022-04-01 06:01:44 +00:00
|
|
|
|
2023-11-10 14:30:56 +00:00
|
|
|
if (!node) {
|
2022-04-01 06:01:44 +00:00
|
|
|
return SDL_OutOfMemory();
|
|
|
|
}
|
|
|
|
|
|
|
|
node->entry = ent;
|
|
|
|
node->next = *head;
|
|
|
|
*head = node;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Pop from end as a FIFO (if add with SDL_ListAdd) */
|
2022-11-30 20:51:59 +00:00
|
|
|
void SDL_ListPop(SDL_ListNode **head, void **ent)
|
2022-04-01 06:01:44 +00:00
|
|
|
{
|
|
|
|
SDL_ListNode **ptr = head;
|
|
|
|
|
|
|
|
/* Invalid or empty */
|
2023-11-10 14:30:56 +00:00
|
|
|
if (!head || !*head) {
|
2022-04-01 06:01:44 +00:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
while ((*ptr)->next) {
|
|
|
|
ptr = &(*ptr)->next;
|
|
|
|
}
|
|
|
|
|
|
|
|
if (ent) {
|
2022-11-30 20:51:59 +00:00
|
|
|
*ent = (*ptr)->entry;
|
2022-04-01 06:01:44 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
SDL_free(*ptr);
|
|
|
|
*ptr = NULL;
|
|
|
|
}
|
|
|
|
|
2022-11-30 20:51:59 +00:00
|
|
|
void SDL_ListRemove(SDL_ListNode **head, void *ent)
|
2022-04-01 06:01:44 +00:00
|
|
|
{
|
|
|
|
SDL_ListNode **ptr = head;
|
|
|
|
|
|
|
|
while (*ptr) {
|
|
|
|
if ((*ptr)->entry == ent) {
|
|
|
|
SDL_ListNode *tmp = *ptr;
|
|
|
|
*ptr = (*ptr)->next;
|
|
|
|
SDL_free(tmp);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
ptr = &(*ptr)->next;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2022-11-30 20:51:59 +00:00
|
|
|
void SDL_ListClear(SDL_ListNode **head)
|
2022-04-01 06:01:44 +00:00
|
|
|
{
|
|
|
|
SDL_ListNode *l = *head;
|
|
|
|
*head = NULL;
|
|
|
|
while (l) {
|
|
|
|
SDL_ListNode *tmp = l;
|
|
|
|
l = l->next;
|
|
|
|
SDL_free(tmp);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* vi: set ts=4 sw=4 expandtab: */
|