⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 oset.c

📁 关系型数据库 Postgresql 6.5.2
💻 C
字号:
/*------------------------------------------------------------------------- * * oset.c *	  Fixed format ordered set definitions. * * Copyright (c) 1994, Regents of the University of California * * * IDENTIFICATION *	  $Header: /usr/local/cvsroot/pgsql/src/backend/utils/mmgr/oset.c,v 1.13.2.1 1999/08/02 05:25:16 scrappy Exp $ * * NOTE *	  XXX This is a preliminary implementation which lacks fail-fast *	  XXX validity checking of arguments. * *------------------------------------------------------------------------- */#include "postgres.h"#include "utils/memutils.h"static Pointer OrderedElemGetBase(OrderedElem elem);static void OrderedElemPush(OrderedElem elem);static void OrderedElemPushHead(OrderedElem elem);/* * OrderedElemGetBase *		Returns base of enclosing structure. */static PointerOrderedElemGetBase(OrderedElem elem){	if (elem == (OrderedElem) NULL)		return (Pointer) NULL;	return (Pointer) ((char *) (elem) - (elem)->set->offset);}/* * OrderedSetInit */voidOrderedSetInit(OrderedSet set, Offset offset){	set->head = (OrderedElem) &set->dummy;	set->dummy = NULL;	set->tail = (OrderedElem) &set->head;	set->offset = offset;}/* * OrderedSetContains *		True iff ordered set contains given element. */#ifdef NOT_USEDboolOrderedSetContains(OrderedSet set, OrderedElem elem){	return (bool) (elem->set == set && (elem->next || elem->prev));}#endif/* * OrderedSetGetHead */PointerOrderedSetGetHead(OrderedSet set){	OrderedElem elem;	elem = set->head;	if (elem->next)		return OrderedElemGetBase(elem);	return NULL;}/* * OrderedSetGetTail */#ifdef NOT_USEDPointerOrderedSetGetTail(OrderedSet set){	OrderedElem elem;	elem = set->tail;	if (elem->prev)		return OrderedElemGetBase(elem);	return NULL;}#endif/* * OrderedElemGetPredecessor */PointerOrderedElemGetPredecessor(OrderedElem elem){	elem = elem->prev;	if (elem->prev)		return OrderedElemGetBase(elem);	return NULL;}/* * OrderedElemGetSuccessor */PointerOrderedElemGetSuccessor(OrderedElem elem){	elem = elem->next;	if (elem->next)		return OrderedElemGetBase(elem);	return NULL;}/* * OrderedElemPop */voidOrderedElemPop(OrderedElem elem){	elem->next->prev = elem->prev;	elem->prev->next = elem->next;	/* assignments used only for error detection */	elem->next = NULL;	elem->prev = NULL;}/* * OrderedElemPushInto */voidOrderedElemPushInto(OrderedElem elem, OrderedSet set){	elem->set = set;	/* mark as unattached */	elem->next = NULL;	elem->prev = NULL;	OrderedElemPush(elem);}/* * OrderedElemPush */static voidOrderedElemPush(OrderedElem elem){	OrderedElemPushHead(elem);}/* * OrderedElemPushHead */static voidOrderedElemPushHead(OrderedElem elem){	elem->next = elem->set->head;	elem->prev = (OrderedElem) &elem->set->head;	elem->next->prev = elem;	elem->prev->next = elem;}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -