mupen64plus-oldsvn/main/util.h

87 lines
3.5 KiB
C

/* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * *
* Mupen64plus - util.h *
* Mupen64Plus homepage: http://code.google.com/p/mupen64plus/ *
* Copyright (C) 2002 Hacktarux *
* *
* 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., *
* 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. *
* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * */
#ifndef __UTIL_H__
#define __UTIL_H__
#include <SDL.h>
#ifdef __cplusplus
extern "C" {
#endif
/** string utilities **/
char *trim(char *str);
char *strnstrip(char* string, int size);
char *event_to_str(const SDL_Event *event);
int event_active(const char *event_str);
int key_pressed(SDLKey k);
/** file utilities **/
int isfile(char *path);
int isdir(char *path);
int copyfile(char *src, char *dest);
/** linked list utilities **/
typedef struct _list_node {
void *data;
struct _list_node *prev;
struct _list_node *next;
} list_node_t;
typedef list_node_t * list_t;
list_node_t *list_prepend(list_t *list, void *data);
list_node_t *list_append(list_t *list, void *data);
void countrycodestring(unsigned short int countrycode, char *string);
void list_node_delete(list_t *list, list_node_t *node);
void list_delete(list_t *list);
void list_node_move_front(list_t *list, list_node_t *node);
void list_node_move_back(list_t *list, list_node_t *node);
void *list_nth_node_data(list_t list, int n);
list_node_t *list_first_node(list_t list);
void *list_first_data(list_t list);
list_node_t *list_last_node(list_t list);
void *list_last_data(list_t list);
int inline list_empty(list_t list);
int list_length(list_t list);
list_node_t *list_find_node(list_t list, void *data);
char* dirfrompath(const char* string);
/* GUI utilities */
void countrycodestring(unsigned short countrycode, char *string);
void compressionstring(unsigned char compressiontype, char *string);
void imagestring(unsigned char imagetype, char *string);
void cicstring(unsigned char cic, char *string);
void rumblestring(unsigned char rumble, char *string);
void savestring(unsigned char savetype, char *string);
void playersstring(unsigned char players, char *string);
// cycles through each listnode in list setting curr_node to current node.
#define list_foreach(list, curr_node) \
for((curr_node) = (list); (curr_node) != NULL; (curr_node) = (curr_node)->next)
#ifdef __cplusplus
}
#endif
#endif // __UTIL_H__