mirror of
https://github.com/ApacheThunder/GBA-Exploader.git
synced 2025-06-18 19:45:39 -04:00
540515c7fc
* Can now use gbaframes specific to a gba rom being loaded to ram/flash. Have a bmp file with filename matching the game rom being flashed in GBA_SIGN path. If it finds a matching BMP it will use that before falling back to the default gbaframe.bmp paths. * nds-bootstrap now used for booting retail NDS roms from file browser. Note that currently GBA-Exploader does not create new save files so only games with existing save files (currently hardcoded to GBA_SAV path like with GBA games) can be booted with this.
69 lines
2.2 KiB
C
69 lines
2.2 KiB
C
/*---------------------------------------------------------------------------------
|
|
|
|
A simple linked list data structure
|
|
|
|
Copyright (C) 2008
|
|
Jason Rogers (dovoto)
|
|
|
|
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.
|
|
|
|
|
|
---------------------------------------------------------------------------------*/
|
|
/*! \file
|
|
\brief A simple doubly linked, unsorted list implementation.
|
|
*/
|
|
|
|
|
|
#ifndef __LINKEDLIST_H__
|
|
#define __LINKEDLIST_H__
|
|
|
|
#include <malloc.h>
|
|
|
|
|
|
//! A node for the linked list.
|
|
typedef struct LinkedList{
|
|
struct LinkedList *next; //!< A pointer to the next node.
|
|
struct LinkedList *prev; //!< A pointer to the previous node.
|
|
void *data; //!< A pointer to some data.
|
|
}LinkedList;
|
|
|
|
|
|
/*!
|
|
\brief Adds data to a linked list.
|
|
|
|
This will only store the pointer to the data, so you have to make sure that the pointer stays valid.
|
|
|
|
\param front A pointer to a pointer to the front of the linked list (or a pointer to NULL if you don't have a linked list yet).
|
|
\param data A pointer to the data you want to store.
|
|
|
|
\return A pointer to the new node, which is also the new front, or NULL if there is not enough memory.
|
|
*/
|
|
LinkedList* linkedlistAdd(LinkedList **front, void* data);
|
|
|
|
/*!
|
|
\brief Removes a node from a linked list.
|
|
|
|
The data pointer of the node will be lost after this, so make sure you don't need it anymore.
|
|
|
|
\param node The node you want to remove.
|
|
*/
|
|
void linkedlistRemove(LinkedList *node);
|
|
|
|
|
|
#endif
|