2012-04-21 21:13:50 +00:00
/* RetroArch - A frontend for libretro.
2013-01-01 00:37:37 +00:00
* Copyright ( C ) 2010 - 2013 - Hans - Kristian Arntzen
2011-01-23 00:59:49 +00:00
*
2012-04-21 21:13:50 +00:00
* RetroArch is free software : you can redistribute it and / or modify it under the terms
2011-01-23 00:59:49 +00:00
* of the GNU General Public License as published by the Free Software Found -
* ation , either version 3 of the License , or ( at your option ) any later version .
*
2012-04-21 21:13:50 +00:00
* RetroArch is distributed in the hope that it will be useful , but WITHOUT ANY WARRANTY ;
2011-01-23 00:59:49 +00:00
* without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR
* PURPOSE . See the GNU General Public License for more details .
*
2012-04-21 21:31:57 +00:00
* You should have received a copy of the GNU General Public License along with RetroArch .
2011-01-23 00:59:49 +00:00
* If not , see < http : //www.gnu.org/licenses/>.
*/
2012-04-21 21:25:32 +00:00
# ifndef __RARCH_MSG_QUEUE_H
# define __RARCH_MSG_QUEUE_H
2011-01-23 00:59:49 +00:00
# include <stddef.h>
typedef struct msg_queue msg_queue_t ;
// Creates a message queue with maximum size different messages. Returns NULL if allocation error.
msg_queue_t * msg_queue_new ( size_t size ) ;
// Higher prio is... higher prio :) Duration is how many times a message can be pulled from queue before it vanishes. (E.g. show a message for 3 seconds @ 60fps = 180 duration).
void msg_queue_push ( msg_queue_t * queue , const char * msg , unsigned prio , unsigned duration ) ;
// Pulls highest prio message in queue. Returns NULL if no message in queue.
const char * msg_queue_pull ( msg_queue_t * queue ) ;
2011-01-23 12:34:41 +00:00
// Clear out everything in queue.
void msg_queue_clear ( msg_queue_t * queue ) ;
2011-01-23 00:59:49 +00:00
void msg_queue_free ( msg_queue_t * queue ) ;
# endif