source: include/queue.h @ 7

/*
 *  TOPPERS Software
 *      Toyohashi Open Platform for Embedded Real-Time Systems
 * 
 *  Copyright (C) 2000 by Embedded and Real-Time Systems Laboratory
 *                              Toyohashi Univ. of Technology, JAPAN
 *  Copyright (C) 2006-2011 by Embedded and Real-Time Systems Laboratory
 *              Graduate School of Information Science, Nagoya Univ., JAPAN
 * 
 *  Ÿåµ­Ãøºîž¢ŒÔ€Ï¡€°Ê²Œ€Î(1)¡Á(4)€ÎŸò·ï€òËþ€¿€¹Ÿì¹ç€ËžÂ€ê¡€ËÜ¥œ¥Õ¥È¥Š¥§
 *  ¥¢¡ÊËÜ¥œ¥Õ¥È¥Š¥§¥¢€ò²þÊÑ€·€¿€â€Î€òŽÞ€à¡¥°Ê²ŒÆ±€ž¡Ë€ò»ÈÍÑ¡ŠÊ£Àœ¡Š²þ
 *  ÊÑ¡ŠºÆÇÛÉۡʰʲŒ¡€ÍøÍрȞƀ֡ˀ¹€ë€³€È€ò̵œþ€ÇµöÂú€¹€ë¡¥
 *  (1) ËÜ¥œ¥Õ¥È¥Š¥§¥¢€ò¥œ¡Œ¥¹¥³¡Œ¥É€Î·Á€ÇÍøÍÑ€¹€ëŸì¹ç€Ë€Ï¡€Ÿåµ­€ÎÃøºî
 *      ž¢ÉœŒš¡€€³€ÎÍøÍÑŸò·ï€ª€è€Ó²Œµ­€Î̵ÊÝŸÚµ¬Äꀬ¡€€œ€Î€Þ€Þ€Î·Á€Ç¥œ¡Œ
 *      ¥¹¥³¡Œ¥ÉÃæ€ËŽÞ€Þ€ì€Æ€€€ë€³€È¡¥
 *  (2) ËÜ¥œ¥Õ¥È¥Š¥§¥¢€ò¡€¥é¥€¥Ö¥é¥ê·ÁŒ°€Ê€É¡€ÂŸ€Î¥œ¥Õ¥È¥Š¥§¥¢³«È¯€Ë»È
 *      Íрǀ­€ë·Á€ÇºÆÇÛÉÛ€¹€ëŸì¹ç€Ë€Ï¡€ºÆÇÛÉÛ€ËÈŒ€Š¥É¥­¥å¥á¥ó¥È¡ÊÍøÍÑ
 *      ŒÔ¥Þ¥Ë¥å¥¢¥ë€Ê€É¡Ë€Ë¡€Ÿåµ­€ÎÃøºîž¢ÉœŒš¡€€³€ÎÍøÍÑŸò·ï€ª€è€Ó²Œµ­
 *      €Î̵ÊÝŸÚµ¬Äê€ò·ÇºÜ€¹€ë€³€È¡¥
 *  (3) ËÜ¥œ¥Õ¥È¥Š¥§¥¢€ò¡€µ¡Žï€ËÁȀ߹þ€à€Ê€É¡€ÂŸ€Î¥œ¥Õ¥È¥Š¥§¥¢³«È¯€Ë»È
 *      Íрǀ­€Ê€€·Á€ÇºÆÇÛÉÛ€¹€ëŸì¹ç€Ë€Ï¡€Œ¡€Î€€€º€ì€«€ÎŸò·ï€òËþ€¿€¹€³
 *      €È¡¥
 *    (a) ºÆÇÛÉÛ€ËÈŒ€Š¥É¥­¥å¥á¥ó¥È¡ÊÍøÍьԥޥ˥奢¥ë€Ê€É¡Ë€Ë¡€Ÿåµ­€ÎÃø
 *        ºîž¢ÉœŒš¡€€³€ÎÍøÍÑŸò·ï€ª€è€Ó²Œµ­€Î̵ÊÝŸÚµ¬Äê€ò·ÇºÜ€¹€ë€³€È¡¥
 *    (b) ºÆÇÛÉۀηÁÂÖ€ò¡€ÊÌ€ËÄê€á€ëÊýË¡€Ë€è€Ã€Æ¡€TOPPERS¥×¥í¥ž¥§¥¯¥È€Ë
 *        Êó¹ð€¹€ë€³€È¡¥
 *  (4) ËÜ¥œ¥Õ¥È¥Š¥§¥¢€ÎÍøÍрˀè€êÄŸÀÜŪ€Þ€¿€ÏŽÖÀÜŪ€ËÀž€ž€ë€€€«€Ê€ë»
 *      ³²€«€é€â¡€Ÿåµ­Ãøºîž¢ŒÔ€ª€è€ÓTOPPERS¥×¥í¥ž¥§¥¯¥È€òÌÈÀÕ€¹€ë€³€È¡¥
 *      €Þ€¿¡€ËÜ¥œ¥Õ¥È¥Š¥§¥¢€Î¥æ¡Œ¥¶€Þ€¿€Ï¥š¥ó¥É¥æ¡Œ¥¶€«€é€Î€€€«€Ê€ëÍý
 *      ͳ€ËŽð€Å€¯ÀÁµá€«€é€â¡€Ÿåµ­Ãøºîž¢ŒÔ€ª€è€ÓTOPPERS¥×¥í¥ž¥§¥¯¥È€ò
 *      ÌÈÀÕ€¹€ë€³€È¡¥
 * 
 *  ËÜ¥œ¥Õ¥È¥Š¥§¥¢€Ï¡€ÌµÊÝŸÚ€ÇÄ󶡀µ€ì€Æ€€€ë€â€Î€Ç€¢€ë¡¥Ÿåµ­Ãøºîž¢ŒÔ€ª
 *  €è€ÓTOPPERS¥×¥í¥ž¥§¥¯¥È€Ï¡€ËÜ¥œ¥Õ¥È¥Š¥§¥¢€ËŽØ€·€Æ¡€ÆÃÄê€Î»ÈÍÑÌÜŪ
 *  €ËÂЀ¹€ëŬ¹çÀ­€âŽÞ€á€Æ¡€€€€«€Ê€ëÊÝŸÚ€â¹Ô€ï€Ê€€¡¥€Þ€¿¡€ËÜ¥œ¥Õ¥È¥Š¥§
 *  ¥¢€ÎÍøÍрˀè€êÄŸÀÜŪ€Þ€¿€ÏŽÖÀÜŪ€ËÀž€ž€¿€€€«€Ê€ë»³²€ËŽØ€·€Æ€â¡€€œ
 *  €ÎÀÕÇ€€òÉé€ï€Ê€€¡¥
 * 
 *  @(#) $Id$
 */

/*
 *              ¥­¥å¡ŒÁàºî¥é¥€¥Ö¥é¥ê
 *
 *  €³€Î¥­¥å¡ŒÁàºî¥é¥€¥Ö¥é¥ê€Ç€Ï¡€¥­¥å¡Œ¥Ø¥Ã¥À€òŽÞ€à¥ê¥ó¥°¹œÂ€€Î¥À¥Ö¥ë
 *  ¥ê¥ó¥¯¥­¥å¡Œ€ò°·€Š¡¥¶ñÂÎŪ€Ë€Ï¡€¥­¥å¡Œ¥Ø¥Ã¥À€ÎŒ¡¥š¥ó¥È¥ê€Ï¥­¥å¡Œ€Î
 *  ÀèƬ€Î¥š¥ó¥È¥ê¡€Á°¥š¥ó¥È¥ê€Ï¥­¥å¡Œ€ÎËöÈø€Î¥š¥ó¥È¥ê€È€¹€ë¡¥€Þ€¿¡€¥­
 *  ¥å¡Œ€ÎÀèƬ€Î¥š¥ó¥È¥ê€ÎÁ°¥š¥ó¥È¥ê€È¡€¥­¥å¡Œ€ÎËöÈø€Î¥š¥ó¥È¥ê€ÎŒ¡¥š¥ó
 *  ¥È¥ê€Ï¡€¥­¥å¡Œ¥Ø¥Ã¥À€È€¹€ë¡¥¶õ€Î¥­¥å¡Œ€Ï¡€Œ¡¥š¥ó¥È¥ê¡€Á°¥š¥ó¥È¥ê€È
 *  €âŒ«Ê¬Œ«¿È€ò»Ø€¹¥­¥å¡Œ¥Ø¥Ã¥À€Ç€¢€é€ï€¹¡¥
 */

#ifndef TOPPERS_QUEUE_H
#define TOPPERS_QUEUE_H

#ifdef __cplusplus
extern "C" {
#endif

/*
 *  ¥­¥å¡Œ€Î¥Ç¡Œ¥¿¹œÂ€€ÎÄêµÁ
 */
typedef struct queue {
        struct queue *p_next;           /* Œ¡¥š¥ó¥È¥ê€Ø€Î¥Ý¥€¥ó¥¿ */
        struct queue *p_prev;           /* Á°¥š¥ó¥È¥ê€Ø€Î¥Ý¥€¥ó¥¿ */
} QUEUE;

/*
 *  ¥­¥å¡Œ€ÎœéŽü²œ
 *
 *  p_queue€Ë€Ï¥­¥å¡Œ¥Ø¥Ã¥À€ò»ØÄꀹ€ë¡¥
 */
Inline void
queue_initialize(QUEUE *p_queue)
{
        p_queue->p_prev = p_queue;
        p_queue->p_next = p_queue;
}

/*
 *  ¥­¥å¡Œ€ÎÁ°¥š¥ó¥È¥ê€Ø€ÎÁÞÆþ
 *
 *  p_queue€ÎÁ°€Ëp_entry€òÁÞÆþ€¹€ë¡¥p_queue€Ë¥­¥å¡Œ¥Ø¥Ã¥À€ò»ØÄꀷ€¿Ÿì
 *  ¹ç€Ë€Ï¡€¥­¥å¡Œ€ÎËöÈø€Ëp_entry€òÁÞÆþ€¹€ë€³€È€Ë€Ê€ë¡¥
 */
Inline void
queue_insert_prev(QUEUE *p_queue, QUEUE *p_entry)
{
        p_entry->p_prev = p_queue->p_prev;
        p_entry->p_next = p_queue;
        p_queue->p_prev->p_next = p_entry;
        p_queue->p_prev = p_entry;
}

/*
 *  ¥­¥å¡Œ€ÎŒ¡¥š¥ó¥È¥ê€Ø€ÎÁÞÆþ
 *
 *  p_queue€ÎŒ¡€Ëp_entry€òÁÞÆþ€¹€ë¡¥p_queue€Ë¥­¥å¡Œ¥Ø¥Ã¥À€ò»ØÄꀷ€¿Ÿì
 *  ¹ç€Ë€Ï¡€¥­¥å¡Œ€ÎÀèƬ€Ëp_entry€òÁÞÆþ€¹€ë€³€È€Ë€Ê€ë¡¥
 */
Inline void
queue_insert_next(QUEUE *p_queue, QUEUE *p_entry)
{
        p_entry->p_prev = p_queue;
        p_entry->p_next = p_queue->p_next;
        p_queue->p_next->p_prev = p_entry;
        p_queue->p_next = p_entry;
}

/*
 *  ¥š¥ó¥È¥ê€Îºïœü
 *
 *  p_entry€ò¥­¥å¡Œ€«€éºïœü€¹€ë¡¥
 */
Inline void
queue_delete(QUEUE *p_entry)
{
        p_entry->p_prev->p_next = p_entry->p_next;
        p_entry->p_next->p_prev = p_entry->p_prev;
}

/*
 *  ¥­¥å¡Œ€ÎŒ¡¥š¥ó¥È¥ê€ÎŒèœÐ€·
 *
 *  p_queue€ÎŒ¡¥š¥ó¥È¥ê€ò¥­¥å¡Œ€«€éºïœü€·¡€ºïœü€·€¿¥š¥ó¥È¥ê€òÊÖ€¹¡¥
 *  p_queue€Ë¥­¥å¡Œ¥Ø¥Ã¥À€ò»ØÄꀷ€¿Ÿì¹ç€Ë€Ï¡€¥­¥å¡Œ€ÎÀèƬ€Î¥š¥ó¥È¥ê€ò
 *  Œè€êœÐ€¹€³€È€Ë€Ê€ë¡¥p_queue€Ë¶õ€Î¥­¥å¡Œ€ò»ØÄꀷ€ÆžÆ€ÓœÐ€·€Æ€Ï€Ê€é
 *  €Ê€€¡¥
 */
Inline QUEUE *
queue_delete_next(QUEUE *p_queue)
{
        QUEUE   *p_entry;

        assert(p_queue->p_next != p_queue);
        p_entry = p_queue->p_next;
        p_queue->p_next = p_entry->p_next;
        p_entry->p_next->p_prev = p_queue;
        return(p_entry);
}

/*
 *  ¥­¥å¡Œ€¬¶õ€«€É€Š€«€Î¥Á¥§¥Ã¥¯
 *
 *  p_queue€Ë€Ï¥­¥å¡Œ¥Ø¥Ã¥À€ò»ØÄꀹ€ë¡¥
 */
Inline bool_t
queue_empty(QUEUE *p_queue)
{
        if (p_queue->p_next == p_queue) {
                assert(p_queue->p_prev == p_queue);
                return(true);
        }
        return(false);
}

#ifdef __cplusplus
}
#endif

#endif /* TOPPERS_QUEUE_H */