queue.h

基于ADI BLACKFIN的jbig压缩和解压缩程序

/*
 *  TOPPERS/JSP Kernel
 *      Toyohashi Open Platform for Embedded Real-Time Systems/
 *      Just Standard Profile Kernel
 * 
 *  Copyright (C) 2000 by Embedded and Real-Time Systems Laboratory
 *                              Toyohashi Univ. of Technology, JAPAN
 * 
 *  忋婰挊嶌尃幰偼丆埲壓偺 (1)乣(4) 偺忦審偐丆Free Software Foundation 
 *  偵傛偭偰岞昞偝傟偰偄傞 GNU General Public License 偺 Version 2 偵婰
 *  弎偝傟偰偄傞忦審傪枮偨偡応崌偵尷傝丆杮僜僼僩僂僃傾乮杮僜僼僩僂僃傾
 *  傪夵曄偟偨傕偺傪娷傓丏埲壓摨偠乯傪巊梡丒暋惢丒夵曄丒嵞攝晍乮埲壓丆
 *  棙梡偲屇傇乯偡傞偙偲傪柍彏偱嫋戻偡傞丏
 *  (1) 杮僜僼僩僂僃傾傪僜乕僗僐乕僪偺宍偱棙梡偡傞応崌偵偼丆忋婰偺挊嶌
 *      尃昞帵丆偙偺棙梡忦審偍傛傃壓婰偺柍曐徹婯掕偑丆偦偺傑傑偺宍偱僜乕
 *      僗僐乕僪拞偵娷傑傟偰偄傞偙偲丏
 *  (2) 杮僜僼僩僂僃傾傪丆儔僀僽儔儕宍幃側偳丆懠偺僜僼僩僂僃傾奐敪偵巊
 *      梡偱偒傞宍偱嵞攝晍偡傞応崌偵偼丆嵞攝晍偵敽偆僪僉儏儊儞僩乮棙梡
 *      幰儅僯儏傾儖側偳乯偵丆忋婰偺挊嶌尃昞帵丆偙偺棙梡忦審偍傛傃壓婰
 *      偺柍曐徹婯掕傪宖嵹偡傞偙偲丏
 *  (3) 杮僜僼僩僂僃傾傪丆婡婍偵慻傒崬傓側偳丆懠偺僜僼僩僂僃傾奐敪偵巊
 *      梡偱偒側偄宍偱嵞攝晍偡傞応崌偵偼丆師偺偄偢傟偐偺忦審傪枮偨偡偙
 *      偲丏
 *    (a) 嵞攝晍偵敽偆僪僉儏儊儞僩乮棙梡幰儅僯儏傾儖側偳乯偵丆忋婰偺挊
 *        嶌尃昞帵丆偙偺棙梡忦審偍傛傃壓婰偺柍曐徹婯掕傪宖嵹偡傞偙偲丏
 *    (b) 嵞攝晍偺宍懺傪丆暿偵掕傔傞曽朄偵傛偭偰丆TOPPERS僾儘僕僃僋僩偵
 *        曬崘偡傞偙偲丏
 *  (4) 杮僜僼僩僂僃傾偺棙梡偵傛傝捈愙揑傑偨偼娫愙揑偵惗偠傞偄偐側傞懝
 *      奞偐傜傕丆忋婰挊嶌尃幰偍傛傃TOPPERS僾儘僕僃僋僩傪柶愑偡傞偙偲丏
 * 
 *  杮僜僼僩僂僃傾偼丆柍曐徹偱採嫙偝傟偰偄傞傕偺偱偁傞丏忋婰挊嶌尃幰偍
 *  傛傃TOPPERS僾儘僕僃僋僩偼丆杮僜僼僩僂僃傾偵娭偟偰丆偦偺揔梡壜擻惈傕
 *  娷傔偰丆偄偐側傞曐徹傕峴傢側偄丏傑偨丆杮僜僼僩僂僃傾偺棙梡偵傛傝捈
 *  愙揑傑偨偼娫愙揑偵惗偠偨偄偐側傞懝奞偵娭偟偰傕丆偦偺愑擟傪晧傢側偄丏
 * 
 *  @(#) $Id: queue.h,v 1.5 2003/06/04 01:46:16 hiro Exp $
 */

/*
 *	僉儏乕憖嶌儔僀僽儔儕
 *
 *  偙偺僉儏乕憖嶌儔僀僽儔儕偱偼丆僉儏乕僿僢僟傪娷傓儕儞僌峔憿偺僟僽儖
 *  儕儞僋僉儏乕傪埖偆丏嬶懱揑偵偼丆僉儏乕僿僢僟偺師僄儞僩儕偼僉儏乕偺
 *  愭摢偺僄儞僩儕丆慜僄儞僩儕偼僉儏乕偺枛旜偺僄儞僩儕偲偡傞丏傑偨丆僉
 *  儏乕偺愭摢偺僄儞僩儕偺慜僄儞僩儕偲丆僉儏乕偺枛旜偺僄儞僩儕偺師僄儞
 *  僩儕偼丆僉儏乕僿僢僟偲偡傞丏嬻偺僉儏乕偼丆師僄儞僩儕丆慜僄儞僩儕偲
 *  傕帺暘帺恎傪巜偡僉儏乕僿僢僟偱偁傜傢偡丏
 */

#ifndef	_QUEUE_H_
#define	_QUEUE_H_

/*
 *  僉儏乕偺僨乕僞峔憿偺掕媊
 */
typedef struct queue {
	struct queue *next;		/* 師僄儞僩儕傊偺億僀儞僞 */
	struct queue *prev;		/* 慜僄儞僩儕傊偺億僀儞僞 */
} QUEUE;

/*
 *  僉儏乕偺弶婜壔
 *
 *  queue 偵偼僉儏乕僿僢僟傪巜掕偡傞丏
 */
Inline void
queue_initialize(QUEUE *queue)
{
	queue->prev = queue->next = queue;
}

/*
 *  僉儏乕偺慜僄儞僩儕傊偺憓擖
 *
 *  queue 偺慜偵 entry 傪憓擖偡傞丏queue 偵僉儏乕僿僢僟傪巜掕偟偨応崌
 *  偵偼丆僉儏乕偺枛旜偵 entry 傪憓擖偡傞偙偲偵側傞丏
 */
Inline void
queue_insert_prev(QUEUE *queue, QUEUE *entry)
{
	entry->prev = queue->prev;
	entry->next = queue;
	queue->prev->next = entry;
	queue->prev = entry;
}


// Insert a new node after the head of the queue.
// Added by Chen Yi @srf

Inline void queue_insert_next(QUEUE *queue, QUEUE *entry)
{
	QUEUE *p = queue->next;
	
	entry->prev = p;
	
	entry->next = p->next;
	
	p->next->prev = entry;
	
	p->next = entry;
}
	
	


/*
 *  僄儞僩儕偺嶍彍
 *
 *  entry 傪僉儏乕偐傜嶍彍偡傞丏
 */
Inline void
queue_delete(QUEUE *entry)
{
	entry->prev->next = entry->next;
	entry->next->prev = entry->prev;
}

/*
 *  僉儏乕偺師僄儞僩儕偺庢弌偟
 *
 *  queue 偺師僄儞僩儕傪僉儏乕偐傜嶍彍偟丆嶍彍偟偨僄儞僩儕傪曉偡丏queue
 *  偵僉儏乕僿僢僟傪巜掕偟偨応崌偵偼丆僉儏乕偺愭摢偺僄儞僩儕傪庢傝弌偡
 *  偙偲偵側傞丏queue 偵嬻偺僉儏乕傪巜掕偟偰屇傃弌偟偰偼側傜側偄丏
 */
Inline QUEUE *
queue_delete_next(QUEUE *queue)
{
	QUEUE	*entry;

	assert(queue->next != queue);
	entry = queue->next;
	queue->next = entry->next;
	entry->next->prev = queue;
	return(entry);
}

/*
 *  僉儏乕偑嬻偐偳偆偐偺僠僃僢僋
 *
 *  queue 偵偼僉儏乕僿僢僟傪巜掕偡傞丏
 */
Inline BOOL
queue_empty(QUEUE *queue)
{
	if (queue->next == queue) {
		assert(queue->prev == queue);
		return(TRUE);
	}
	return(FALSE);
}

#endif /* _QUEUE_H_ */