ilist.h File Reference

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures
struct	dlist_node
struct	dlist_head
struct	dlist_iter
struct	dlist_mutable_iter
struct	dclist_head
struct	slist_node
struct	slist_head
struct	slist_iter
struct	slist_mutable_iter

Macros
#define	DLIST_STATIC_INIT(name)   {{&(name).head, &(name).head}}
#define	DCLIST_STATIC_INIT(name)   {{{&(name).dlist.head, &(name).dlist.head}}, 0}
#define	SLIST_STATIC_INIT(name)   {{NULL}}
#define	dlist_member_check(head, node)   ((void) (head))
#define	dlist_check(head)   ((void) (head))
#define	slist_check(head)   ((void) (head))
#define	dlist_container(type, membername, ptr)
#define	dlist_head_element(type, membername, lhead)
#define	dlist_tail_element(type, membername, lhead)
#define	dlist_foreach(iter, lhead)
#define	dlist_foreach_modify(iter, lhead)
#define	dlist_reverse_foreach(iter, lhead)
#define	dclist_container(type, membername, ptr)    dlist_container(type, membername, ptr)
#define	dclist_head_element(type, membername, lhead)
#define	dclist_tail_element(type, membername, lhead)
#define	dclist_foreach(iter, lhead)    dlist_foreach(iter, &((lhead)->dlist))
#define	dclist_foreach_modify(iter, lhead)    dlist_foreach_modify(iter, &((lhead)->dlist))
#define	dclist_reverse_foreach(iter, lhead)    dlist_reverse_foreach(iter, &((lhead)->dlist))
#define	slist_container(type, membername, ptr)
#define	slist_head_element(type, membername, lhead)
#define	slist_foreach(iter, lhead)
#define	slist_foreach_modify(iter, lhead)

Typedefs
typedef struct dlist_node	dlist_node
typedef struct dlist_head	dlist_head
typedef struct dlist_iter	dlist_iter
typedef struct dlist_mutable_iter	dlist_mutable_iter
typedef struct dclist_head	dclist_head
typedef struct slist_node	slist_node
typedef struct slist_head	slist_head
typedef struct slist_iter	slist_iter
typedef struct slist_mutable_iter	slist_mutable_iter

Functions
void	slist_delete (slist_head *head, const slist_node *node)
static void	dlist_init (dlist_head *head)
static void	dlist_node_init (dlist_node *node)
static bool	dlist_is_empty (const dlist_head *head)
static void	dlist_push_head (dlist_head *head, dlist_node *node)
static void	dlist_push_tail (dlist_head *head, dlist_node *node)
static void	dlist_insert_after (dlist_node *after, dlist_node *node)
static void	dlist_insert_before (dlist_node *before, dlist_node *node)
static void	dlist_delete (dlist_node *node)
static void	dlist_delete_thoroughly (dlist_node *node)
static void	dlist_delete_from (dlist_head *head, dlist_node *node)
static void	dlist_delete_from_thoroughly (dlist_head *head, dlist_node *node)
static dlist_node *	dlist_pop_head_node (dlist_head *head)
static void	dlist_move_head (dlist_head *head, dlist_node *node)
static void	dlist_move_tail (dlist_head *head, dlist_node *node)
static bool	dlist_has_next (const dlist_head *head, const dlist_node *node)
static bool	dlist_has_prev (const dlist_head *head, const dlist_node *node)
static bool	dlist_node_is_detached (const dlist_node *node)
static dlist_node *	dlist_next_node (dlist_head *head, dlist_node *node)
static dlist_node *	dlist_prev_node (dlist_head *head, dlist_node *node)
static void *	dlist_head_element_off (dlist_head *head, size_t off)
static dlist_node *	dlist_head_node (dlist_head *head)
static void *	dlist_tail_element_off (dlist_head *head, size_t off)
static dlist_node *	dlist_tail_node (dlist_head *head)
static void	dclist_init (dclist_head *head)
static bool	dclist_is_empty (const dclist_head *head)
static void	dclist_push_head (dclist_head *head, dlist_node *node)
static void	dclist_push_tail (dclist_head *head, dlist_node *node)
static void	dclist_insert_after (dclist_head *head, dlist_node *after, dlist_node *node)
static void	dclist_insert_before (dclist_head *head, dlist_node *before, dlist_node *node)
static void	dclist_delete_from (dclist_head *head, dlist_node *node)
static void	dclist_delete_from_thoroughly (dclist_head *head, dlist_node *node)
static dlist_node *	dclist_pop_head_node (dclist_head *head)
static void	dclist_move_head (dclist_head *head, dlist_node *node)
static void	dclist_move_tail (dclist_head *head, dlist_node *node)
static bool	dclist_has_next (const dclist_head *head, const dlist_node *node)
static bool	dclist_has_prev (const dclist_head *head, const dlist_node *node)
static dlist_node *	dclist_next_node (dclist_head *head, dlist_node *node)
static dlist_node *	dclist_prev_node (dclist_head *head, dlist_node *node)
static void *	dclist_head_element_off (dclist_head *head, size_t off)
static dlist_node *	dclist_head_node (dclist_head *head)
static void *	dclist_tail_element_off (dclist_head *head, size_t off)
static dlist_node *	dclist_tail_node (dclist_head *head)
static uint32	dclist_count (const dclist_head *head)
static void	slist_init (slist_head *head)
static bool	slist_is_empty (const slist_head *head)
static void	slist_push_head (slist_head *head, slist_node *node)
static void	slist_insert_after (slist_node *after, slist_node *node)
static slist_node *	slist_pop_head_node (slist_head *head)
static bool	slist_has_next (const slist_head *head, const slist_node *node)
static slist_node *	slist_next_node (slist_head *head, slist_node *node)
static void *	slist_head_element_off (slist_head *head, size_t off)
static slist_node *	slist_head_node (slist_head *head)
static void	slist_delete_current (slist_mutable_iter *iter)

Macro Definition Documentation

dclist_container

#define dclist_container	(		type,
			membername,
			ptr
	)		dlist_container(type, membername, ptr)

Definition at line 947 of file ilist.h.

dclist_foreach

#define dclist_foreach	(		iter,
			lhead
	)		dlist_foreach(iter, &((lhead)->dlist))

Definition at line 970 of file ilist.h.

dclist_foreach_modify

#define dclist_foreach_modify	(		iter,
			lhead
	)		dlist_foreach_modify(iter, &((lhead)->dlist))

Definition at line 973 of file ilist.h.

dclist_head_element

#define dclist_head_element	(		type,
			membername,
			lhead
	)

Value:

    (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node),  \
     (type *) dclist_head_element_off(lhead, offsetof(type, membername)))

Definition at line 955 of file ilist.h.

dclist_reverse_foreach

#define dclist_reverse_foreach	(		iter,
			lhead
	)		dlist_reverse_foreach(iter, &((lhead)->dlist))

Definition at line 976 of file ilist.h.

DCLIST_STATIC_INIT

#define DCLIST_STATIC_INIT

(

name

)

{{{&(name).dlist.head, &(name).dlist.head}}, 0}

Definition at line 282 of file ilist.h.

dclist_tail_element

#define dclist_tail_element	(		type,
			membername,
			lhead
	)

Value:

    (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node),  \
     ((type *) dclist_tail_element_off(lhead, offsetof(type, membername))))

Definition at line 964 of file ilist.h.

dlist_check

#define dlist_check

(

head

)

((void) (head))

Definition at line 303 of file ilist.h.

dlist_container

#define dlist_container	(		type,
			membername,
			ptr
	)

Value:

    (AssertVariableIsOfTypeMacro(ptr, dlist_node *),                        \
     AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node),  \
     ((type *) ((char *) (ptr) - offsetof(type, membername))))

Definition at line 593 of file ilist.h.

dlist_foreach

#define dlist_foreach	(		iter,
			lhead
	)

Value:

    for (AssertVariableIsOfTypeMacro(iter, dlist_iter),                     \
         AssertVariableIsOfTypeMacro(lhead, dlist_head *),                  \
         (iter).end = &(lhead)->head,                                       \
         (iter).cur = (iter).end->next ? (iter).end->next : (iter).end;     \
         (iter).cur != (iter).end;                                          \
         (iter).cur = (iter).cur->next)

Definition at line 623 of file ilist.h.

dlist_foreach_modify

#define dlist_foreach_modify	(		iter,
			lhead
	)

Value:

    for (AssertVariableIsOfTypeMacro(iter, dlist_mutable_iter),             \
         AssertVariableIsOfTypeMacro(lhead, dlist_head *),                  \
         (iter).end = &(lhead)->head,                                       \
         (iter).cur = (iter).end->next ? (iter).end->next : (iter).end,     \
         (iter).next = (iter).cur->next;                                    \
         (iter).cur != (iter).end;                                          \
         (iter).cur = (iter).next, (iter).next = (iter).cur->next)

Definition at line 640 of file ilist.h.

dlist_head_element

#define dlist_head_element	(		type,
			membername,
			lhead
	)

Value:

    (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node),  \
     (type *) dlist_head_element_off(lhead, offsetof(type, membername)))

Definition at line 603 of file ilist.h.

dlist_member_check

#define dlist_member_check	(		head,
			node
	)		((void) (head))

Definition at line 302 of file ilist.h.

dlist_reverse_foreach

#define dlist_reverse_foreach	(		iter,
			lhead
	)

Value:

    for (AssertVariableIsOfTypeMacro(iter, dlist_iter),                     \
         AssertVariableIsOfTypeMacro(lhead, dlist_head *),                  \
         (iter).end = &(lhead)->head,                                       \
         (iter).cur = (iter).end->prev ? (iter).end->prev : (iter).end;     \
         (iter).cur != (iter).end;                                          \
         (iter).cur = (iter).cur->prev)

Definition at line 654 of file ilist.h.

DLIST_STATIC_INIT

#define DLIST_STATIC_INIT

(

name

)

{{&(name).head, &(name).head}}

Definition at line 281 of file ilist.h.

dlist_tail_element

#define dlist_tail_element	(		type,
			membername,
			lhead
	)

Value:

    (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node),  \
     ((type *) dlist_tail_element_off(lhead, offsetof(type, membername))))

Definition at line 612 of file ilist.h.

slist_check

#define slist_check

(

head

)

((void) (head))

Definition at line 304 of file ilist.h.

slist_container

#define slist_container	(		type,
			membername,
			ptr
	)

Value:

    (AssertVariableIsOfTypeMacro(ptr, slist_node *),                        \
     AssertVariableIsOfTypeMacro(((type *) NULL)->membername, slist_node),  \
     ((type *) ((char *) (ptr) - offsetof(type, membername))))

Definition at line 1106 of file ilist.h.

slist_foreach

#define slist_foreach	(		iter,
			lhead
	)

Value:

    for (AssertVariableIsOfTypeMacro(iter, slist_iter),                     \
         AssertVariableIsOfTypeMacro(lhead, slist_head *),                  \
         (iter).cur = (lhead)->head.next;                                   \
         (iter).cur != NULL;                                                \
         (iter).cur = (iter).cur->next)

Definition at line 1132 of file ilist.h.

slist_foreach_modify

#define slist_foreach_modify	(		iter,
			lhead
	)

Value:

    for (AssertVariableIsOfTypeMacro(iter, slist_mutable_iter),             \
         AssertVariableIsOfTypeMacro(lhead, slist_head *),                  \
         (iter).prev = &(lhead)->head,                                      \
         (iter).cur = (iter).prev->next,                                    \
         (iter).next = (iter).cur ? (iter).cur->next : NULL;                \
         (iter).cur != NULL;                                                \
         (iter).prev = (iter).cur,                                          \
         (iter).cur = (iter).next,                                          \
         (iter).next = (iter).next ? (iter).next->next : NULL)

Definition at line 1148 of file ilist.h.

slist_head_element

#define slist_head_element	(		type,
			membername,
			lhead
	)

Value:

    (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, slist_node),  \
     (type *) slist_head_element_off(lhead, offsetof(type, membername)))

Definition at line 1116 of file ilist.h.

SLIST_STATIC_INIT

#define SLIST_STATIC_INIT

(

name

)

{{NULL}}

Definition at line 283 of file ilist.h.

Typedef Documentation

dclist_head

typedef struct dclist_head dclist_head

dlist_head

typedef struct dlist_head dlist_head

dlist_iter

typedef struct dlist_iter dlist_iter

dlist_mutable_iter

typedef struct dlist_mutable_iter dlist_mutable_iter

dlist_node

typedef struct dlist_node dlist_node

Definition at line 1 of file ilist.h.

slist_head

typedef struct slist_head slist_head

slist_iter

typedef struct slist_iter slist_iter

slist_mutable_iter

typedef struct slist_mutable_iter slist_mutable_iter

slist_node

typedef struct slist_node slist_node

Definition at line 1 of file ilist.h.

Function Documentation

dclist_count()

static uint32 dclist_count ( const dclist_head *  head )

inlinestatic

Definition at line 932 of file ilist.h.

{
    Assert(dlist_is_empty(&head->dlist) == (head->count == 0));
 
    return head->count;
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_is_empty().

Referenced by AtEOSubXact_PgStat_DroppedStats(), AtEOXact_PgStat_DroppedStats(), DeadLockCheck(), ExpandConstraints(), GetSingleProcBlockerStatusData(), InvalidateConstraintCacheCallBack(), logical_heap_rewrite_flush_mappings(), mXactCachePut(), pgstat_get_transactional_drops(), ReorderBufferGetCatalogChangesXacts(), SlabAllocFromNewBlock(), SlabFree(), SlabStats(), SnapBuildSerialize(), and TopoSort().

dclist_delete_from()

static void dclist_delete_from ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 763 of file ilist.h.

{
    Assert(head->count > 0);
 
    dlist_delete_from(&head->dlist, node);
    head->count--;
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_delete_from().

Referenced by AtEOSubXact_PgStat_DroppedStats(), AtEOXact_PgStat_DroppedStats(), InvalidateConstraintCacheCallBack(), logical_heap_rewrite_flush_mappings(), mXactCachePut(), ReorderBufferCleanupTXN(), and SlabReset().

dclist_delete_from_thoroughly()

static void dclist_delete_from_thoroughly ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 776 of file ilist.h.

{
    Assert(head->count > 0);
 
    dlist_delete_from_thoroughly(&head->dlist, node);
    head->count--;
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_delete_from_thoroughly().

Referenced by ProcWakeup(), and RemoveFromWaitQueue().

dclist_has_next()

static bool dclist_has_next ( const dclist_head *  head, const dlist_node *  node  )

inlinestatic

Definition at line 839 of file ilist.h.

{
    dlist_member_check(&head->dlist, node);
    Assert(head->count > 0);
 
    return dlist_has_next(&head->dlist, node);
}

References Assert, dclist_head::count, dclist_head::dlist, dlist_has_next(), and dlist_member_check.

dclist_has_prev()

static bool dclist_has_prev ( const dclist_head *  head, const dlist_node *  node  )

inlinestatic

Definition at line 854 of file ilist.h.

{
    dlist_member_check(&head->dlist, node);
    Assert(head->count > 0);
 
    return dlist_has_prev(&head->dlist, node);
}

References Assert, dclist_head::count, dclist_head::dlist, dlist_has_prev(), and dlist_member_check.

dclist_head_element_off()

static void* dclist_head_element_off ( dclist_head *  head, size_t  off  )

inlinestatic

Definition at line 888 of file ilist.h.

{
    Assert(!dclist_is_empty(head));
 
    return (char *) head->dlist.head.next - off;
}

References Assert, dclist_is_empty(), dclist_head::dlist, dlist_head::head, and dlist_node::next.

dclist_head_node()

static dlist_node* dclist_head_node ( dclist_head *  head )

inlinestatic

Definition at line 900 of file ilist.h.

{
    Assert(head->count > 0);
 
    return (dlist_node *) dlist_head_element_off(&head->dlist, 0);
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_head_element_off().

dclist_init()

static void dclist_init ( dclist_head *  head )

inlinestatic

Definition at line 671 of file ilist.h.

{
    dlist_init(&head->dlist);
    head->count = 0;
}

References dclist_head::count, dclist_head::dlist, and dlist_init().

Referenced by AtEOXact_MultiXact(), dclist_push_head(), dclist_push_tail(), DeadLockCheck(), lock_twophase_recover(), logical_rewrite_log_mapping(), pgstat_get_xact_stack_level(), PostPrepare_MultiXact(), ReorderBufferAllocate(), SetupLockInTable(), and SlabContextCreate().

dclist_insert_after()

static void dclist_insert_after ( dclist_head *  head, dlist_node *  after, dlist_node *  node  )

inlinestatic

Definition at line 727 of file ilist.h.

{
    dlist_member_check(&head->dlist, after);
    Assert(head->count > 0);    /* must be at least 1 already */
 
    dlist_insert_after(after, node);
    head->count++;
 
    Assert(head->count > 0);    /* count overflow check */
}

References Assert, dclist_head::count, dclist_head::dlist, dlist_insert_after(), and dlist_member_check.

dclist_insert_before()

static void dclist_insert_before ( dclist_head *  head, dlist_node *  before, dlist_node *  node  )

inlinestatic

Definition at line 745 of file ilist.h.

{
    dlist_member_check(&head->dlist, before);
    Assert(head->count > 0);    /* must be at least 1 already */
 
    dlist_insert_before(before, node);
    head->count++;
 
    Assert(head->count > 0);    /* count overflow check */
}

References Assert, before(), dclist_head::count, dclist_head::dlist, dlist_insert_before(), and dlist_member_check.

Referenced by ProcSleep().

dclist_is_empty()

static bool dclist_is_empty ( const dclist_head *  head )

inlinestatic

Definition at line 682 of file ilist.h.

{
    Assert(dlist_is_empty(&head->dlist) == (head->count == 0));
    return (head->count == 0);
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_is_empty().

Referenced by dclist_head_element_off(), dclist_tail_element_off(), ProcLockWakeup(), ProcSleep(), and RemoveFromWaitQueue().

dclist_move_head()

static void dclist_move_head ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 808 of file ilist.h.

{
    dlist_member_check(&head->dlist, node);
    Assert(head->count > 0);
 
    dlist_move_head(&head->dlist, node);
}

References Assert, dclist_head::count, dclist_head::dlist, dlist_member_check, and dlist_move_head().

Referenced by mXactCacheGetById(), and mXactCacheGetBySet().

dclist_move_tail()

static void dclist_move_tail ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 824 of file ilist.h.

{
    dlist_member_check(&head->dlist, node);
    Assert(head->count > 0);
 
    dlist_move_tail(&head->dlist, node);
}

References Assert, dclist_head::count, dclist_head::dlist, dlist_member_check, and dlist_move_tail().

dclist_next_node()

static dlist_node* dclist_next_node ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 867 of file ilist.h.

{
    Assert(head->count > 0);
 
    return dlist_next_node(&head->dlist, node);
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_next_node().

dclist_pop_head_node()

static dlist_node* dclist_pop_head_node ( dclist_head *  head )

inlinestatic

Definition at line 789 of file ilist.h.

{
    dlist_node *node;
 
    Assert(head->count > 0);
 
    node = dlist_pop_head_node(&head->dlist);
    head->count--;
    return node;
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_pop_head_node().

Referenced by SlabAllocFromNewBlock().

dclist_prev_node()

static dlist_node* dclist_prev_node ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 879 of file ilist.h.

{
    Assert(head->count > 0);
 
    return dlist_prev_node(&head->dlist, node);
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_prev_node().

dclist_push_head()

static void dclist_push_head ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 693 of file ilist.h.

{
    if (head->dlist.head.next == NULL)  /* convert NULL header to circular */
        dclist_init(head);
 
    dlist_push_head(&head->dlist, node);
    head->count++;
 
    Assert(head->count > 0);    /* count overflow check */
}

References Assert, dclist_head::count, dclist_init(), dclist_head::dlist, dlist_push_head(), dlist_head::head, and dlist_node::next.

Referenced by mXactCachePut(), and SlabFree().

dclist_push_tail()

static void dclist_push_tail ( dclist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 709 of file ilist.h.

{
    if (head->dlist.head.next == NULL)  /* convert NULL header to circular */
        dclist_init(head);
 
    dlist_push_tail(&head->dlist, node);
    head->count++;
 
    Assert(head->count > 0);    /* count overflow check */
}

References Assert, dclist_head::count, dclist_init(), dclist_head::dlist, dlist_push_tail(), dlist_head::head, and dlist_node::next.

Referenced by AtEOSubXact_PgStat_DroppedStats(), create_drop_transactional_internal(), DeadLockCheck(), logical_rewrite_log_mapping(), ProcSleep(), ReorderBufferXidSetCatalogChanges(), and ri_LoadConstraintInfo().

dclist_tail_element_off()

static void* dclist_tail_element_off ( dclist_head *  head, size_t  off  )

inlinestatic

Definition at line 909 of file ilist.h.

{
    Assert(!dclist_is_empty(head));
 
    return (char *) head->dlist.head.prev - off;
}

References Assert, dclist_is_empty(), dclist_head::dlist, dlist_head::head, and dlist_node::prev.

dclist_tail_node()

static dlist_node* dclist_tail_node ( dclist_head *  head )

inlinestatic

Definition at line 920 of file ilist.h.

{
    Assert(head->count > 0);
 
    return (dlist_node *) dlist_tail_element_off(&head->dlist, 0);
}

References Assert, dclist_head::count, dclist_head::dlist, and dlist_tail_element_off().

Referenced by mXactCachePut().

dlist_delete()

static void dlist_delete ( dlist_node *  node )

inlinestatic

Definition at line 405 of file ilist.h.

{
    node->prev->next = node->next;
    node->next->prev = node->prev;
}

References dlist_node::next, and dlist_node::prev.

Referenced by BumpBlockFree(), CatCacheRemoveCList(), CatCacheRemoveCTup(), CheckTargetForConflictsIn(), CleanupBackend(), CleanupBackgroundWorker(), CleanUpLock(), ClearOldPredicateLocks(), DeleteChildTargetLocks(), DeleteLockTarget(), DestroyParallelContext(), dlist_delete_from(), dlist_move_head(), dlist_move_tail(), dlist_pop_head_node(), DropAllPredicateLocksFromTable(), DropCachedPlan(), dsm_create(), dsm_detach(), ForgetManyTestResources(), FreeCachedExpression(), FreeWorkerInfo(), GenerationBlockFree(), get_flush_position(), HandleChildCrash(), leafRepackItems(), LockAcquireExtended(), pgstat_delete_pending_entry(), PostPrepare_Locks(), ProcKill(), RehashCatCache(), RehashCatCacheLists(), ReleaseManyTestResource(), ReleaseOneSerializableXact(), ReleasePredXact(), ReleaseRWConflict(), remove_cache_entry(), RemoveGUCFromLists(), ReorderBufferAssignChild(), ReorderBufferCleanupTXN(), ReorderBufferIterTXNNext(), ReorderBufferProcessTXN(), ReorderBufferRestoreChanges(), ReorderBufferSerializeTXN(), ReorderBufferToastReset(), ReorderBufferTransferSnapToParent(), ReorderBufferTruncateTXN(), set_guc_source(), SetPossibleUnsafeConflict(), SetRWConflict(), SlabReset(), smgrdestroy(), smgrpin(), TransferPredicateLocksToNewTarget(), XLogPrefetcherAddFilter(), and XLogPrefetcherCompleteFilters().

dlist_delete_from()

static void dlist_delete_from ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 429 of file ilist.h.

{
    dlist_member_check(head, node);
    dlist_delete(node);
}

References dlist_delete(), and dlist_member_check.

Referenced by dclist_delete_from(), SlabAlloc(), and SlabFree().

dlist_delete_from_thoroughly()

static void dlist_delete_from_thoroughly ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 440 of file ilist.h.

{
    dlist_member_check(head, node);
    dlist_delete_thoroughly(node);
}

References dlist_delete_thoroughly(), and dlist_member_check.

Referenced by dclist_delete_from_thoroughly().

dlist_delete_thoroughly()

static void dlist_delete_thoroughly ( dlist_node *  node )

inlinestatic

Definition at line 416 of file ilist.h.

{
    node->prev->next = node->next;
    node->next->prev = node->prev;
    node->next = NULL;
    node->prev = NULL;
}

References dlist_node::next, and dlist_node::prev.

Referenced by ClearOldPredicateLocks(), dlist_delete_from_thoroughly(), SummarizeOldestCommittedSxact(), SyncRepCancelWait(), SyncRepCleanupAtProcExit(), and SyncRepWakeQueue().

dlist_has_next()

static bool dlist_has_next ( const dlist_head *  head, const dlist_node *  node  )

inlinestatic

Definition at line 503 of file ilist.h.

{
    return node->next != &head->head;
}

References dlist_head::head, and dlist_node::next.

Referenced by addItemsToLeaf(), BumpReset(), dataPlaceToPageLeafSplit(), dclist_has_next(), dlist_next_node(), GenerationReset(), leafRepackItems(), pgstat_flush_pending_entries(), and ReorderBufferIterTXNNext().

dlist_has_prev()

static bool dlist_has_prev ( const dlist_head *  head, const dlist_node *  node  )

inlinestatic

Definition at line 513 of file ilist.h.

{
    return node->prev != &head->head;
}

References dlist_head::head, and dlist_node::prev.

Referenced by dataBeginPlaceToPageLeaf(), dclist_has_prev(), and dlist_prev_node().

dlist_head_element_off()

static void* dlist_head_element_off ( dlist_head *  head, size_t  off  )

inlinestatic

Definition at line 555 of file ilist.h.

{
    Assert(!dlist_is_empty(head));
    return (char *) head->head.next - off;
}

References Assert, dlist_is_empty(), dlist_head::head, and dlist_node::next.

Referenced by dclist_head_node(), and dlist_head_node().

dlist_head_node()

static dlist_node* dlist_head_node ( dlist_head *  head )

inlinestatic

Definition at line 565 of file ilist.h.

{
    return (dlist_node *) dlist_head_element_off(head, 0);
}

References dlist_head_element_off().

Referenced by BumpAlloc(), BumpReset(), dataPlaceToPageLeafSplit(), GenerationReset(), leafRepackItems(), and pgstat_flush_pending_entries().

dlist_init()

static void dlist_init ( dlist_head *  head )

inlinestatic

Definition at line 314 of file ilist.h.

{
    head->head.next = head->head.prev = &head->head;
}

References dlist_head::head, dlist_node::next, and dlist_node::prev.

Referenced by AutoVacuumShmemInit(), BumpContextCreate(), cache_purge_all(), CreatePredicateLock(), dclist_init(), disassembleLeaf(), dlist_push_head(), dlist_push_tail(), DropAllPredicateLocksFromTable(), ExecInitMemoize(), GenerationContextCreate(), GetSerializableTransactionSnapshotInt(), InitManyTestResourceKind(), InitPredicateLocks(), InitProcGlobal(), lock_twophase_recover(), MarkAsPreparingGuts(), pgstat_shutdown_hook(), predicatelock_twophase_recover(), rebuild_database_list(), ReleaseOneSerializableXact(), ReorderBufferAllocate(), ReorderBufferGetTXN(), ReorderBufferIterTXNInit(), ReorderBufferToastAppendChunk(), SetupLockInTable(), SlabContextCreate(), smgropen(), TransferPredicateLocksToNewTarget(), WalSndShmemInit(), and XLogPrefetcherAllocate().

dlist_insert_after()

static void dlist_insert_after ( dlist_node *  after, dlist_node *  node  )

inlinestatic

Definition at line 381 of file ilist.h.

{
    node->prev = after;
    node->next = after->next;
    after->next = node;
    node->next->prev = node;
}

References dlist_node::next, and dlist_node::prev.

Referenced by dclist_insert_after(), leafRepackItems(), and SyncRepQueueInsert().

dlist_insert_before()

static void dlist_insert_before ( dlist_node *  before, dlist_node *  node  )

inlinestatic

Definition at line 393 of file ilist.h.

{
    node->prev = before->prev;
    node->next = before;
    before->prev = node;
    node->prev->next = node;
}

References before(), dlist_node::next, and dlist_node::prev.

Referenced by dclist_insert_before(), and ReorderBufferTransferSnapToParent().

dlist_is_empty()

static bool dlist_is_empty ( const dlist_head *  head )

inlinestatic

Definition at line 336 of file ilist.h.

{
    dlist_check(head);
 
    return head->head.next == NULL || head->head.next == &(head->head);
}

References dlist_check, dlist_head::head, and dlist_node::next.

Referenced by addItemsToLeaf(), AtEOSubXact_Parallel(), AtEOXact_Parallel(), BumpReset(), CheckForSerializableConflictOut(), CleanUpLock(), CreatePredXact(), dataBeginPlaceToPageLeaf(), dclist_count(), dclist_is_empty(), dlist_head_element_off(), dlist_pop_head_node(), dlist_tail_element_off(), do_start_worker(), dsm_backend_shutdown(), dsm_detach_all(), ForgetManyTestResources(), GenerationReset(), get_flush_position(), GetSafeSnapshot(), GetSerializableTransactionSnapshotInt(), InitAuxiliaryProcess(), InitProcess(), launcher_determine_sleep(), lock_twophase_recover(), LockReleaseAll(), LogicalRepApplyLoop(), ParallelContextActive(), pgstat_flush_pending_entries(), pgstat_report_stat(), pgstat_shutdown_hook(), PostmasterStateMachine(), PostPrepare_Locks(), ProcKill(), ReleasePredicateLocks(), RemoveTargetIfNoLongerUsed(), ReorderBufferBuildTupleCidHash(), ReorderBufferGetOldestTXN(), ReorderBufferGetOldestXmin(), ReorderBufferIterTXNFinish(), ReorderBufferIterTXNNext(), ReorderBufferRestoreChanges(), ReorderBufferSerializeTXN(), ReorderBufferStreamTXN(), RWConflictExists(), SetPossibleUnsafeConflict(), SetRWConflict(), SetupLockInTable(), SlabAlloc(), SlabAllocFromNewBlock(), SlabFindNextBlockListIndex(), SlabFree(), SummarizeOldestCommittedSxact(), TransferPredicateLocksToNewTarget(), XLogPrefetcherCompleteFilters(), and XLogPrefetcherIsFiltered().

dlist_move_head()

static void dlist_move_head ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 467 of file ilist.h.

{
    /* fast path if it's already at the head */
    if (head->head.next == node)
        return;
 
    dlist_delete(node);
    dlist_push_head(head, node);
 
    dlist_check(head);
}

References dlist_check, dlist_delete(), dlist_push_head(), dlist_head::head, and dlist_node::next.

Referenced by dclist_move_head(), launch_worker(), SearchCatCacheInternal(), and SearchCatCacheList().

dlist_move_tail()

static void dlist_move_tail ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 486 of file ilist.h.

{
    /* fast path if it's already at the tail */
    if (head->head.prev == node)
        return;
 
    dlist_delete(node);
    dlist_push_tail(head, node);
 
    dlist_check(head);
}

References dlist_check, dlist_delete(), dlist_push_tail(), dlist_head::head, and dlist_node::prev.

Referenced by cache_lookup(), and dclist_move_tail().

dlist_next_node()

static dlist_node* dlist_next_node ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 537 of file ilist.h.

{
    Assert(dlist_has_next(head, node));
    return node->next;
}

References Assert, dlist_has_next(), and dlist_node::next.

Referenced by addItemsToLeaf(), dataPlaceToPageLeafSplit(), dclist_next_node(), leafRepackItems(), pgstat_flush_pending_entries(), and ReorderBufferIterTXNNext().

dlist_node_init()

static void dlist_node_init ( dlist_node *  node )

inlinestatic

Definition at line 325 of file ilist.h.

{
    node->next = node->prev = NULL;
}

References dlist_node::next, and dlist_node::prev.

Referenced by GetSerializableTransactionSnapshotInt(), InitAuxiliaryProcess(), InitPredicateLocks(), InitProcess(), MarkAsPreparingGuts(), predicatelock_twophase_recover(), and RememberManyTestResources().

dlist_node_is_detached()

static bool dlist_node_is_detached ( const dlist_node *  node )

inlinestatic

Definition at line 525 of file ilist.h.

{
    Assert((node->next == NULL && node->prev == NULL) ||
           (node->next != NULL && node->prev != NULL));
 
    return node->next == NULL;
}

References Assert, dlist_node::next, and dlist_node::prev.

Referenced by LockErrorCleanup(), ProcWakeup(), SyncRepCancelWait(), SyncRepCleanupAtProcExit(), and SyncRepWaitForLSN().

dlist_pop_head_node()

static dlist_node* dlist_pop_head_node ( dlist_head *  head )

inlinestatic

Definition at line 450 of file ilist.h.

{
    dlist_node *node;
 
    Assert(!dlist_is_empty(head));
    node = head->head.next;
    dlist_delete(node);
    return node;
}

References Assert, dlist_delete(), dlist_is_empty(), dlist_head::head, and dlist_node::next.

Referenced by CreatePredXact(), dclist_pop_head_node(), do_start_worker(), InitProcess(), ReorderBufferIterTXNFinish(), and ReorderBufferIterTXNNext().

dlist_prev_node()

static dlist_node* dlist_prev_node ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 547 of file ilist.h.

{
    Assert(dlist_has_prev(head, node));
    return node->prev;
}

References Assert, dlist_has_prev(), and dlist_node::prev.

Referenced by dataBeginPlaceToPageLeaf(), dclist_prev_node(), and leafRepackItems().

dlist_push_head()

static void dlist_push_head ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 347 of file ilist.h.

{
    if (head->head.next == NULL)    /* convert NULL header to circular */
        dlist_init(head);
 
    node->next = head->head.next;
    node->prev = &head->head;
    node->next->prev = node;
    head->head.next = node;
 
    dlist_check(head);
}

References dlist_check, dlist_init(), dlist_head::head, dlist_node::next, and dlist_node::prev.

Referenced by AutoVacuumShmemInit(), AutoVacWorkerMain(), BackendStartup(), BecomeLockGroupLeader(), BumpAllocFromNewBlock(), BumpContextCreate(), CatalogCacheCreateEntry(), CreateParallelContext(), dclist_push_head(), dlist_move_head(), do_start_bgworker(), dsm_create_descriptor(), FreeWorkerInfo(), GenerationAllocFromNewBlock(), GenerationAllocLarge(), GenerationContextCreate(), ProcKill(), rebuild_database_list(), RehashCatCache(), RehashCatCacheLists(), SearchCatCacheList(), SlabAlloc(), SlabAllocFromNewBlock(), SlabFree(), StartAutovacuumWorker(), SyncRepQueueInsert(), and XLogPrefetcherAddFilter().

dlist_push_tail()

static void dlist_push_tail ( dlist_head *  head, dlist_node *  node  )

inlinestatic

Definition at line 364 of file ilist.h.

{
    if (head->head.next == NULL)    /* convert NULL header to circular */
        dlist_init(head);
 
    node->next = &head->head;
    node->prev = head->head.prev;
    node->prev->next = node;
    head->head.prev = node;
 
    dlist_check(head);
}

References dlist_check, dlist_init(), dlist_head::head, dlist_node::next, and dlist_node::prev.

Referenced by addItemsToLeaf(), BecomeLockGroupMember(), BumpAllocLarge(), cache_lookup(), CreatePredicateLock(), CreatePredXact(), dclist_push_tail(), disassembleLeaf(), dlist_move_tail(), DropAllPredicateLocksFromTable(), GetCachedExpression(), InitPredicateLocks(), InitProcGlobal(), lock_twophase_recover(), pgstat_prep_pending_entry(), PostPrepare_Locks(), ProcKill(), ReleaseOneSerializableXact(), ReleasePredicateLocks(), ReleasePredXact(), ReleaseRWConflict(), RememberManyTestResources(), ReorderBufferAddNewTupleCids(), ReorderBufferAssignChild(), ReorderBufferIterTXNNext(), ReorderBufferQueueChange(), ReorderBufferRestoreChange(), ReorderBufferSetBaseSnapshot(), ReorderBufferToastAppendChunk(), ReorderBufferTXNByXid(), SaveCachedPlan(), set_guc_source(), SetPossibleUnsafeConflict(), SetRWConflict(), SetupLockInTable(), smgropen(), smgrunpin(), store_flush_position(), and TransferPredicateLocksToNewTarget().

dlist_tail_element_off()

static void* dlist_tail_element_off ( dlist_head *  head, size_t  off  )

inlinestatic

Definition at line 572 of file ilist.h.

{
    Assert(!dlist_is_empty(head));
    return (char *) head->head.prev - off;
}

References Assert, dlist_is_empty(), dlist_head::head, and dlist_node::prev.

Referenced by dclist_tail_node(), and dlist_tail_node().

dlist_tail_node()

static dlist_node* dlist_tail_node ( dlist_head *  head )

inlinestatic

Definition at line 582 of file ilist.h.

{
    return (dlist_node *) dlist_tail_element_off(head, 0);
}

References dlist_tail_element_off().

Referenced by dataBeginPlaceToPageLeaf().

slist_delete()

void slist_delete	(	slist_head *	head,
		const slist_node *	node
	)

Definition at line 31 of file ilist.c.

{
    slist_node *last = &head->head;
    slist_node *cur;
    bool        found PG_USED_FOR_ASSERTS_ONLY = false;
 
    while ((cur = last->next) != NULL)
    {
        if (cur == node)
        {
            last->next = cur->next;
#ifdef USE_ASSERT_CHECKING
            found = true;
#endif
            break;
        }
        last = cur;
    }
    Assert(found);
 
    slist_check(head);
}

References Assert, cur, slist_head::head, slist_node::next, cursor::next, PG_USED_FOR_ASSERTS_ONLY, and slist_check.

Referenced by reapply_stacked_values(), and RemoveGUCFromLists().

slist_delete_current()

static void slist_delete_current ( slist_mutable_iter *  iter )

inlinestatic

Definition at line 1084 of file ilist.h.

{
    /*
     * Update previous element's forward link.  If the iteration is at the
     * first list element, iter->prev will point to the list header's "head"
     * field, so we don't need a special case for that.
     */
    iter->prev->next = iter->next;
 
    /*
     * Reset cur to prev, so that prev will continue to point to the prior
     * valid list element after slist_foreach_modify() advances to the next.
     */
    iter->cur = iter->prev;
}

References slist_mutable_iter::cur, slist_node::next, slist_mutable_iter::next, and slist_mutable_iter::prev.

Referenced by AtEOSubXact_SPI(), AtEOXact_GUC(), cancel_on_dsm_detach(), ForgetBackgroundWorker(), ReportChangedGUCOptions(), and SPI_freetuptable().

slist_has_next()

static bool slist_has_next ( const slist_head *  head, const slist_node *  node  )

inlinestatic

Definition at line 1043 of file ilist.h.

{
    slist_check(head);
 
    return node->next != NULL;
}

References slist_node::next, and slist_check.

Referenced by slist_next_node().

slist_head_element_off()

static void* slist_head_element_off ( slist_head *  head, size_t  off  )

inlinestatic

Definition at line 1062 of file ilist.h.

{
    Assert(!slist_is_empty(head));
    return (char *) head->head.next - off;
}

References Assert, slist_head::head, slist_node::next, and slist_is_empty().

Referenced by slist_head_node().

slist_head_node()

static slist_node* slist_head_node ( slist_head *  head )

inlinestatic

Definition at line 1072 of file ilist.h.

{
    return (slist_node *) slist_head_element_off(head, 0);
}

References slist_head_element_off().

slist_init()

static void slist_init ( slist_head *  head )

inlinestatic

Definition at line 986 of file ilist.h.

{
    head->head.next = NULL;
}

References slist_head::head, and slist_node::next.

Referenced by dsm_create_descriptor(), EventTriggerBeginCompleteQuery(), InitCatCache(), and SPI_connect_ext().

slist_insert_after()

static void slist_insert_after ( slist_node *  after, slist_node *  node  )

inlinestatic

Definition at line 1018 of file ilist.h.

{
    node->next = after->next;
    after->next = node;
}

References slist_node::next.

slist_is_empty()

static bool slist_is_empty ( const slist_head *  head )

inlinestatic

Definition at line 995 of file ilist.h.

{
    slist_check(head);
 
    return head->head.next == NULL;
}

References slist_head::head, slist_node::next, and slist_check.

Referenced by dsm_detach(), EventTriggerSQLDrop(), reset_on_dsm_detach(), slist_head_element_off(), and slist_pop_head_node().

slist_next_node()

static slist_node* slist_next_node ( slist_head *  head, slist_node *  node  )

inlinestatic

Definition at line 1054 of file ilist.h.

{
    Assert(slist_has_next(head, node));
    return node->next;
}

References Assert, slist_node::next, and slist_has_next().

slist_pop_head_node()

static slist_node* slist_pop_head_node ( slist_head *  head )

inlinestatic

Definition at line 1028 of file ilist.h.

{
    slist_node *node;
 
    Assert(!slist_is_empty(head));
    node = head->head.next;
    head->head.next = node->next;
    slist_check(head);
    return node;
}

References Assert, slist_head::head, slist_node::next, slist_check, and slist_is_empty().

Referenced by dsm_detach(), and reset_on_dsm_detach().

slist_push_head()

static void slist_push_head ( slist_head *  head, slist_node *  node  )

inlinestatic

Definition at line 1006 of file ilist.h.

{
    node->next = head->head.next;
    head->head.next = node;
 
    slist_check(head);
}

References slist_head::head, slist_node::next, and slist_check.

Referenced by AtEOXact_GUC(), BackgroundWorkerStateChange(), EventTriggerSQLDropAddObject(), InitCatCache(), on_dsm_detach(), push_old_value(), RegisterBackgroundWorker(), ResetAllOptions(), set_config_with_handle(), and spi_dest_startup().