2002-04-25 04:41:45 +00:00
|
|
|
/***************************************************************************
|
|
|
|
* __________ __ ___.
|
|
|
|
* Open \______ \ ____ ____ | | _\_ |__ _______ ___
|
|
|
|
* Source | _// _ \_/ ___\| |/ /| __ \ / _ \ \/ /
|
|
|
|
* Jukebox | | ( <_> ) \___| < | \_\ ( <_> > < <
|
|
|
|
* Firmware |____|_ /\____/ \___ >__|_ \|___ /\____/__/\_ \
|
|
|
|
* \/ \/ \/ \/ \/
|
|
|
|
* $Id$
|
|
|
|
*
|
2002-04-27 15:20:53 +00:00
|
|
|
* Copyright (C) 2002 by Felix Arends
|
2002-04-25 04:41:45 +00:00
|
|
|
*
|
|
|
|
* All files in this archive are subject to the GNU General Public License.
|
|
|
|
* See the file COPYING in the source tree root for full license agreement.
|
|
|
|
*
|
|
|
|
* This software is distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY
|
|
|
|
* KIND, either express or implied.
|
|
|
|
*
|
|
|
|
****************************************************************************/
|
|
|
|
|
|
|
|
#include <windows.h>
|
2002-06-12 15:39:39 +00:00
|
|
|
#include "uisw32.h"
|
2002-04-25 04:41:45 +00:00
|
|
|
#include "kernel.h"
|
2002-06-12 15:39:39 +00:00
|
|
|
#include "thread-win32.h"
|
2002-06-25 21:01:08 +00:00
|
|
|
#include "thread.h"
|
2005-11-21 23:55:39 +00:00
|
|
|
#include "debug.h"
|
2002-04-25 04:41:45 +00:00
|
|
|
|
2002-10-31 08:05:47 +00:00
|
|
|
/* (Daniel 2002-10-31) Mingw32 requires this errno variable to be present.
|
|
|
|
I'm not quite sure why and I don't know if this breaks the MSVC compile.
|
|
|
|
If it does, we should put this within #ifdef __MINGW32__ */
|
|
|
|
int errno;
|
|
|
|
|
2005-11-21 23:55:39 +00:00
|
|
|
static void (*tick_funcs[MAX_NUM_TICK_TASKS])(void);
|
|
|
|
|
2004-02-25 13:26:49 +00:00
|
|
|
int set_irq_level (int level)
|
|
|
|
{
|
|
|
|
static int _lv = 0;
|
|
|
|
return (_lv = level);
|
|
|
|
}
|
|
|
|
|
2002-06-25 21:01:08 +00:00
|
|
|
void queue_init(struct event_queue *q)
|
|
|
|
{
|
|
|
|
q->read = 0;
|
|
|
|
q->write = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
void queue_wait(struct event_queue *q, struct event *ev)
|
|
|
|
{
|
|
|
|
while(q->read == q->write)
|
|
|
|
{
|
|
|
|
switch_thread();
|
|
|
|
}
|
|
|
|
|
|
|
|
*ev = q->events[(q->read++) & QUEUE_LENGTH_MASK];
|
|
|
|
}
|
|
|
|
|
2003-04-19 13:15:33 +00:00
|
|
|
void queue_wait_w_tmo(struct event_queue *q, struct event *ev, int ticks)
|
|
|
|
{
|
|
|
|
unsigned int timeout = current_tick + ticks;
|
|
|
|
|
|
|
|
while(q->read == q->write && TIME_BEFORE( current_tick, timeout ))
|
|
|
|
{
|
|
|
|
sleep(1);
|
|
|
|
}
|
|
|
|
|
|
|
|
if(q->read != q->write)
|
|
|
|
{
|
|
|
|
*ev = q->events[(q->read++) & QUEUE_LENGTH_MASK];
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
ev->id = SYS_TIMEOUT;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2005-01-24 14:52:42 +00:00
|
|
|
void queue_post(struct event_queue *q, long id, void *data)
|
2002-06-25 21:01:08 +00:00
|
|
|
{
|
|
|
|
int wr;
|
|
|
|
int oldlevel;
|
|
|
|
|
2004-03-13 16:59:14 +00:00
|
|
|
oldlevel = set_irq_level(15<<4);
|
2002-06-25 21:01:08 +00:00
|
|
|
wr = (q->write++) & QUEUE_LENGTH_MASK;
|
|
|
|
|
|
|
|
q->events[wr].id = id;
|
|
|
|
q->events[wr].data = data;
|
|
|
|
set_irq_level(oldlevel);
|
|
|
|
}
|
|
|
|
|
2004-08-16 23:37:23 +00:00
|
|
|
bool queue_empty(const struct event_queue* q)
|
2002-06-25 21:01:08 +00:00
|
|
|
{
|
|
|
|
return ( q->read == q->write );
|
|
|
|
}
|
|
|
|
|
2005-02-28 00:33:15 +00:00
|
|
|
void queue_clear(struct event_queue* q)
|
|
|
|
{
|
|
|
|
/* fixme: This is potentially unsafe in case we do interrupt-like processing */
|
|
|
|
q->read = 0;
|
|
|
|
q->write = 0;
|
|
|
|
}
|
|
|
|
|
2002-06-25 21:01:08 +00:00
|
|
|
void switch_thread (void)
|
|
|
|
{
|
|
|
|
yield ();
|
|
|
|
}
|
|
|
|
|
2005-11-21 23:55:39 +00:00
|
|
|
void sim_tick_tasks(void)
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Run through the list of tick tasks */
|
|
|
|
for(i = 0;i < MAX_NUM_TICK_TASKS;i++)
|
|
|
|
{
|
|
|
|
if(tick_funcs[i])
|
|
|
|
{
|
|
|
|
tick_funcs[i]();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
int tick_add_task(void (*f)(void))
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Add a task if there is room */
|
|
|
|
for(i = 0;i < MAX_NUM_TICK_TASKS;i++)
|
|
|
|
{
|
|
|
|
if(tick_funcs[i] == NULL)
|
|
|
|
{
|
|
|
|
tick_funcs[i] = f;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
DEBUGF("Error! tick_add_task(): out of tasks");
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
|
|
|
int tick_remove_task(void (*f)(void))
|
|
|
|
{
|
|
|
|
int i;
|
|
|
|
|
|
|
|
/* Remove a task if it is there */
|
|
|
|
for(i = 0;i < MAX_NUM_TICK_TASKS;i++)
|
|
|
|
{
|
|
|
|
if(tick_funcs[i] == f)
|
|
|
|
{
|
|
|
|
tick_funcs[i] = NULL;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
return -1;
|
|
|
|
}
|
|
|
|
|
2003-07-01 23:39:05 +00:00
|
|
|
/* TODO: Implement mutexes for win32 */
|
2003-07-01 21:05:43 +00:00
|
|
|
void mutex_init(struct mutex *m)
|
|
|
|
{
|
2003-07-01 23:39:05 +00:00
|
|
|
(void)m;
|
2003-07-01 21:05:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void mutex_lock(struct mutex *m)
|
|
|
|
{
|
2003-07-01 23:39:05 +00:00
|
|
|
(void)m;
|
2003-07-01 21:05:43 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void mutex_unlock(struct mutex *m)
|
|
|
|
{
|
2003-07-01 23:39:05 +00:00
|
|
|
(void)m;
|
2003-07-01 21:05:43 +00:00
|
|
|
}
|