schedqueue.h

/*
 * Copyright (C) 2008 Philippe Gerum <rpm@xenomai.org>.
 *
 * Xenomai 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.
 *
 * Xenomai 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 Xenomai; if not, write to the Free Software
 * Foundation, Inc., 59 Temple Place - Suite 330, Boston, MA
 * 02111-1307, USA.
 */
#ifndef _COBALT_KERNEL_SCHEDQUEUE_H
#define _COBALT_KERNEL_SCHEDQUEUE_H
 
#include <cobalt/kernel/list.h>
 
#define XNSCHED_CLASS_WEIGHT_FACTOR     1024
 
#ifdef CONFIG_XENO_OPT_SCALABLE_SCHED
 
#include <linux/bitmap.h>
 
/*
 * Multi-level priority queue, suitable for handling the runnable
 * thread queue of the core scheduling class with O(1) property. We
 * only manage a descending queuing order, i.e. highest numbered
 * priorities come first.
 */
#define XNSCHED_MLQ_LEVELS  260 /* i.e. XNSCHED_CORE_NR_PRIO */
 
struct xnsched_mlq {
        int elems;
        DECLARE_BITMAP(prio_map, XNSCHED_MLQ_LEVELS);
        struct list_head heads[XNSCHED_MLQ_LEVELS];
};
 
struct xnthread;
 
void xnsched_initq(struct xnsched_mlq *q);
 
void xnsched_addq(struct xnsched_mlq *q,
                  struct xnthread *thread);
 
void xnsched_addq_tail(struct xnsched_mlq *q, 
                       struct xnthread *thread);
 
void xnsched_delq(struct xnsched_mlq *q,
                  struct xnthread *thread);
 
struct xnthread *xnsched_getq(struct xnsched_mlq *q);
 
static inline int xnsched_emptyq_p(struct xnsched_mlq *q)
{
        return q->elems == 0;
}
 
static inline int xnsched_weightq(struct xnsched_mlq *q)
{
        return find_first_bit(q->prio_map, XNSCHED_MLQ_LEVELS);
}
 
typedef struct xnsched_mlq xnsched_queue_t;
 
#else /* ! CONFIG_XENO_OPT_SCALABLE_SCHED */
 
typedef struct list_head xnsched_queue_t;
 
#define xnsched_initq(__q)                      INIT_LIST_HEAD(__q)
#define xnsched_emptyq_p(__q)                   list_empty(__q)
#define xnsched_addq(__q, __t)                  list_add_prilf(__t, __q, cprio, rlink)
#define xnsched_addq_tail(__q, __t)             list_add_priff(__t, __q, cprio, rlink)
#define xnsched_delq(__q, __t)                  (void)(__q), list_del(&(__t)->rlink)
#define xnsched_getq(__q)                                                       \
        ({                                                                      \
                struct xnthread *__t = NULL;                                    \
                if (!list_empty(__q))                                           \
                        __t = list_get_entry(__q, struct xnthread, rlink);      \
                __t;                                                            \
        })
#define xnsched_weightq(__q)                                            \
        ({                                                              \
                struct xnthread *__t;                                   \
                __t = list_first_entry(__q, struct xnthread, rlink);    \
                __t->cprio;                                             \
        })
        
 
#endif /* !CONFIG_XENO_OPT_SCALABLE_SCHED */
 
struct xnthread *xnsched_findq(xnsched_queue_t *q, int prio);
 
#endif /* !_COBALT_KERNEL_SCHEDQUEUE_H */