mirror of
https://github.com/drasko/codezero.git
synced 2026-01-14 11:53:15 +01:00
f6d0a79298
A new scheduler replaces the old one. - There are no sched_xxx_notify() calls that ask scheduler to change task state. - Tasks now have priorities and different timeslices. - One second interval is distributed among processes. - There are just runnable and expired queues. - SCHED_GRANULARITY determines a maximum running boundary for tasks. - Scheduler can now detect a safe point and suspend a task. Interruptible blocking is implemented. - Mutexes, waitqueues and ipc are modified to have an interruptible nature. - Sleep information is stored on the ktcb. (which waitqueue? etc.)
46 lines
1.1 KiB
C
46 lines
1.1 KiB
C
/*
|
|
* Scheduler and runqueue API definitions.
|
|
*
|
|
* Copyright (C) 2007 Bahadir Balban
|
|
*/
|
|
#ifndef __SCHEDULER_H__
|
|
#define __SCHEDULER_H__
|
|
|
|
#include <l4/generic/tcb.h>
|
|
#include INC_SUBARCH(mm.h)
|
|
#include INC_GLUE(memory.h)
|
|
|
|
/* Task priorities */
|
|
#define TASK_PRIO_MAX 10
|
|
#define TASK_PRIO_REALTIME 10
|
|
#define TASK_PRIO_PAGER 8
|
|
#define TASK_PRIO_SERVER 6
|
|
#define TASK_PRIO_NORMAL 4
|
|
#define TASK_PRIO_LOW 2
|
|
|
|
/* Ticks per second, try ticks = 1000 + timeslice = 1 for regressed preemption test. */
|
|
#define SCHED_TICKS 100
|
|
|
|
/*
|
|
* A task can run continuously at this granularity,
|
|
* even if it has a greater total time slice.
|
|
*/
|
|
#define SCHED_GRANULARITY SCHED_TICKS/10
|
|
|
|
static inline struct ktcb *current_task(void)
|
|
{
|
|
register u32 stack asm("sp");
|
|
return (struct ktcb *)(stack & (~PAGE_MASK));
|
|
}
|
|
|
|
#define current current_task()
|
|
#define need_resched (current->ts_need_resched)
|
|
|
|
void sched_init_task(struct ktcb *task, int priority);
|
|
void sched_resume_sync(struct ktcb *task);
|
|
void sched_resume_async(struct ktcb *task);
|
|
void scheduler_start(void);
|
|
void schedule(void);
|
|
|
|
#endif /* __SCHEDULER_H__ */
|