зеркало из https://github.com/mozilla/pjs.git
138 строки
3.6 KiB
C
138 строки
3.6 KiB
C
/* -*- Mode: C++; tab-width: 4; indent-tabs-mode: nil; c-basic-offset: 2 -*- */
|
|
/*
|
|
* The contents of this file are subject to the Mozilla Public
|
|
* License Version 1.1 (the "License"); you may not use this file
|
|
* except in compliance with the License. You may obtain a copy of
|
|
* the License at http://www.mozilla.org/MPL/
|
|
*
|
|
* Software distributed under the License is distributed on an "AS
|
|
* IS" basis, WITHOUT WARRANTY OF ANY KIND, either express or
|
|
* implied. See the License for the specific language governing
|
|
* rights and limitations under the License.
|
|
*
|
|
* The Original Code is the Netscape Portable Runtime (NSPR).
|
|
*
|
|
* The Initial Developer of the Original Code is Netscape
|
|
* Communications Corporation. Portions created by Netscape are
|
|
* Copyright (C) 1998-2000 Netscape Communications Corporation. All
|
|
* Rights Reserved.
|
|
*
|
|
* Contributor(s):
|
|
*
|
|
* Alternatively, the contents of this file may be used under the
|
|
* terms of the GNU General Public License Version 2 or later (the
|
|
* "GPL"), in which case the provisions of the GPL are applicable
|
|
* instead of those above. If you wish to allow use of your
|
|
* version of this file only under the terms of the GPL and not to
|
|
* allow others to use your version of this file under the MPL,
|
|
* indicate your decision by deleting the provisions above and
|
|
* replace them with the notice and other provisions required by
|
|
* the GPL. If you do not delete the provisions above, a recipient
|
|
* may use your version of this file under either the MPL or the
|
|
* GPL.
|
|
*/
|
|
|
|
#ifndef prclist_h___
|
|
#define prclist_h___
|
|
|
|
#include "prtypes.h"
|
|
|
|
typedef struct PRCListStr PRCList;
|
|
|
|
/*
|
|
** Circular linked list
|
|
*/
|
|
struct PRCListStr {
|
|
PRCList *next;
|
|
PRCList *prev;
|
|
};
|
|
|
|
/*
|
|
** Insert element "_e" into the list, before "_l".
|
|
*/
|
|
#define PR_INSERT_BEFORE(_e,_l) \
|
|
PR_BEGIN_MACRO \
|
|
(_e)->next = (_l); \
|
|
(_e)->prev = (_l)->prev; \
|
|
(_l)->prev->next = (_e); \
|
|
(_l)->prev = (_e); \
|
|
PR_END_MACRO
|
|
|
|
/*
|
|
** Insert element "_e" into the list, after "_l".
|
|
*/
|
|
#define PR_INSERT_AFTER(_e,_l) \
|
|
PR_BEGIN_MACRO \
|
|
(_e)->next = (_l)->next; \
|
|
(_e)->prev = (_l); \
|
|
(_l)->next->prev = (_e); \
|
|
(_l)->next = (_e); \
|
|
PR_END_MACRO
|
|
|
|
/*
|
|
** Return the element following element "_e"
|
|
*/
|
|
#define PR_NEXT_LINK(_e) \
|
|
((_e)->next)
|
|
/*
|
|
** Return the element preceding element "_e"
|
|
*/
|
|
#define PR_PREV_LINK(_e) \
|
|
((_e)->prev)
|
|
|
|
/*
|
|
** Append an element "_e" to the end of the list "_l"
|
|
*/
|
|
#define PR_APPEND_LINK(_e,_l) PR_INSERT_BEFORE(_e,_l)
|
|
|
|
/*
|
|
** Insert an element "_e" at the head of the list "_l"
|
|
*/
|
|
#define PR_INSERT_LINK(_e,_l) PR_INSERT_AFTER(_e,_l)
|
|
|
|
/* Return the head/tail of the list */
|
|
#define PR_LIST_HEAD(_l) (_l)->next
|
|
#define PR_LIST_TAIL(_l) (_l)->prev
|
|
|
|
/*
|
|
** Remove the element "_e" from it's circular list.
|
|
*/
|
|
#define PR_REMOVE_LINK(_e) \
|
|
PR_BEGIN_MACRO \
|
|
(_e)->prev->next = (_e)->next; \
|
|
(_e)->next->prev = (_e)->prev; \
|
|
PR_END_MACRO
|
|
|
|
/*
|
|
** Remove the element "_e" from it's circular list. Also initializes the
|
|
** linkage.
|
|
*/
|
|
#define PR_REMOVE_AND_INIT_LINK(_e) \
|
|
PR_BEGIN_MACRO \
|
|
(_e)->prev->next = (_e)->next; \
|
|
(_e)->next->prev = (_e)->prev; \
|
|
(_e)->next = (_e); \
|
|
(_e)->prev = (_e); \
|
|
PR_END_MACRO
|
|
|
|
/*
|
|
** Return non-zero if the given circular list "_l" is empty, zero if the
|
|
** circular list is not empty
|
|
*/
|
|
#define PR_CLIST_IS_EMPTY(_l) \
|
|
((_l)->next == (_l))
|
|
|
|
/*
|
|
** Initialize a circular list
|
|
*/
|
|
#define PR_INIT_CLIST(_l) \
|
|
PR_BEGIN_MACRO \
|
|
(_l)->next = (_l); \
|
|
(_l)->prev = (_l); \
|
|
PR_END_MACRO
|
|
|
|
#define PR_INIT_STATIC_CLIST(_l) \
|
|
{(_l), (_l)}
|
|
|
|
#endif /* prclist_h___ */
|