proc_p.h

Go to the documentation of this file.

#ifndef KERN_PROC_P_H
#define KERN_PROC_P_H

#include "cfg/cfg_proc.h"
#include "cfg/cfg_monitor.h"

#include <cfg/compiler.h>

#include <cpu/types.h>        /* for cpu_stack_t */
#include <cpu/irq.h>          // IRQ_ASSERT_DISABLED()

#include <kern/proc.h>   // struct Process

EXTERN_C void asm_switch_context(cpu_stack_t **new_sp, cpu_stack_t **save_sp);

/*
 * Save context of old process and switch to new process.
  */
INLINE void proc_switchTo(Process *next, Process *prev)
{
    cpu_stack_t *dummy;

    if (UNLIKELY(next == prev))
        return;
    /*
     * If there is no old process, we save the old stack pointer into a
     * dummy variable that we ignore.  In fact, this happens only when the
     * old process has just exited.
     */
    asm_switch_context(&next->stack, prev ? &prev->stack : &dummy);
}

#define PF_FREESTACK  BV(0)  
/*\}*/


extern REGISTER Process *current_process;

extern REGISTER List     proc_ready_list;

#if CONFIG_KERN_PRI
    #define prio_next() (LIST_EMPTY(&proc_ready_list) ? INT_MIN : \
                    ((PriNode *)LIST_HEAD(&proc_ready_list))->pri)
    #define prio_proc(proc) (proc->link.pri)
    #define prio_curr() prio_proc(current_process)

    #define SCHED_ENQUEUE_INTERNAL(proc) \
            LIST_ENQUEUE(&proc_ready_list, &(proc)->link)
    #define SCHED_ENQUEUE_HEAD_INTERNAL(proc) \
            LIST_ENQUEUE_HEAD(&proc_ready_list, &(proc)->link)
#else
    #define prio_next() 0
    #define prio_proc(proc) 0
    #define prio_curr() 0

    #define SCHED_ENQUEUE_INTERNAL(proc) ADDTAIL(&proc_ready_list, &(proc)->link)
    #define SCHED_ENQUEUE_HEAD_INTERNAL(proc) ADDHEAD(&proc_ready_list, &(proc)->link)
#endif

#define SCHED_ENQUEUE(proc)  do { \
        IRQ_ASSERT_DISABLED(); \
        LIST_ASSERT_VALID(&proc_ready_list); \
        SCHED_ENQUEUE_INTERNAL(proc); \
    } while (0)

#define SCHED_ENQUEUE_HEAD(proc)  do { \
        IRQ_ASSERT_DISABLED(); \
        LIST_ASSERT_VALID(&proc_ready_list); \
        SCHED_ENQUEUE_HEAD_INTERNAL(proc); \
    } while (0)


#if CONFIG_KERN_PRI

INLINE void sched_reenqueue(struct Process *proc)
{
    IRQ_ASSERT_DISABLED();
    LIST_ASSERT_VALID(&proc_ready_list);
    Node *n;
    PriNode *pos = NULL;
    FOREACH_NODE(n, &proc_ready_list)
    {
        if (n == &proc->link.link)
        {
            pos = (PriNode *)n;
            break;
        }
    }

    // only remove and enqueue again if process is already in the ready list
    // otherwise leave it alone
    if (pos)
    {
        REMOVE(&proc->link.link);
        LIST_ENQUEUE(&proc_ready_list, &proc->link);
    }
}
#endif //CONFIG_KERN_PRI

/* Process trampoline */
void proc_entry(void);

/* Schedule another process *without* adding the current one to the ready list. */
void proc_switch(void);

/* Low level scheduling routine. */
void proc_schedule(void);

/* Low level context switch routine. */
void proc_switchTo(Process *next, Process *prev);

/* Initialize a scheduler class. */
void proc_schedInit(void);

#if CONFIG_KERN_MONITOR

    void monitor_init(void);

    void monitor_add(Process *proc, const char *name);

    void monitor_remove(Process *proc);

    void monitor_rename(Process *proc, const char *name);
#endif /* CONFIG_KERN_MONITOR */

#endif /* KERN_PROC_P_H */