80 lines
1.1 KiB
C
80 lines
1.1 KiB
C
|
/*++
|
||
|
|
|
||
|
|
Copyright (c) 1993 Microsoft Corporation
|
||
|
|
|
||
|
|
Module Name:
|
||
|
|
|
||
|
|
BILINK.H
|
||
|
|
|
||
|
|
Abstract:
|
||
|
|
|
||
|
|
Management for doubly linked lists
|
||
|
|
|
||
|
|
Author:
|
||
|
|
|
||
|
|
George Joy
|
||
|
|
|
||
|
|
Environment:
|
||
|
|
|
||
|
|
32-bit 'C'
|
||
|
|
|
||
|
|
Revision History:
|
||
|
|
|
||
|
|
--*/// BILINK.H
|
||
|
|
|
||
|
|
#ifndef _BILINK_
|
||
|
|
|
||
|
|
#define _BILINK_
|
||
|
|
|
||
|
|
#if !defined(offsetof)
|
||
|
|
#define offsetof(type, field) ((int)(&((type *)0)->field))
|
||
|
|
#endif
|
||
|
|
|
||
|
|
typedef struct BILINK {
|
||
|
|
struct BILINK *next;
|
||
|
|
struct BILINK *prev;
|
||
|
|
} BILINK;
|
||
|
|
|
||
|
|
/* XLATOFF */
|
||
|
|
|
||
|
|
#define EMPTY_BILINK(_pBilink) ((_pBilink)->next==(_pBilink))
|
||
|
|
|
||
|
|
#ifdef DEBUG
|
||
|
|
#define ASSERT_EMPTY_BILINK(_b) ASSERT((_b)->next==(_b))
|
||
|
|
#else
|
||
|
|
#define ASSERT_EMPTY_BILINK(_b)
|
||
|
|
#endif
|
||
|
|
|
||
|
|
// This only works for BILINKS that are the first item in a structure.
|
||
|
|
#define BilinkToList( _pBilink ) \
|
||
|
|
(_pBilink)->prev->next=NULL;
|
||
|
|
|
||
|
|
#define InitBilink( _pBilink ) \
|
||
|
|
(_pBilink)->prev=(_pBilink)->next=(_pBilink);
|
||
|
|
|
||
|
|
#ifdef DEBUG
|
||
|
|
|
||
|
|
int FindObject(
|
||
|
|
BILINK *link,
|
||
|
|
BILINK *list
|
||
|
|
);
|
||
|
|
#endif
|
||
|
|
|
||
|
|
void InsertAfter(
|
||
|
|
BILINK *in,
|
||
|
|
BILINK *after
|
||
|
|
);
|
||
|
|
|
||
|
|
void InsertBefore(
|
||
|
|
BILINK *in,
|
||
|
|
BILINK *before
|
||
|
|
);
|
||
|
|
|
||
|
|
void Delete(
|
||
|
|
BILINK *p
|
||
|
|
);
|
||
|
|
|
||
|
|
/* XLATON */
|
||
|
|
|
||
|
|
#endif
|