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	slist_node
struct	slist_head
struct	slist_iter
struct	slist_mutable_iter

Macros
#define	DLIST_STATIC_INIT(name)   {{&(name).head, &(name).head}}
#define	SLIST_STATIC_INIT(name)   {{NULL}}
#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	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 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, slist_node *node)
static void	dlist_init (dlist_head *head)
static bool	dlist_is_empty (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 dlist_node *	dlist_pop_head_node (dlist_head *head)
static void	dlist_move_head (dlist_head *head, dlist_node *node)
static bool	dlist_has_next (dlist_head *head, dlist_node *node)
static bool	dlist_has_prev (dlist_head *head, 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	slist_init (slist_head *head)
static bool	slist_is_empty (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 (slist_head *head, 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

#define dlist_check

(

head

)

((void) (head))

Definition at line 267 of file ilist.h.

Referenced by dlist_is_empty(), dlist_move_head(), dlist_push_head(), and dlist_push_tail().

#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 477 of file ilist.h.

Referenced by addItemsToLeaf(), AssertTXNLsnOrder(), autovac_balance_cost(), CatCacheInvalidate(), CleanupBackend(), computeLeafRecompressWALData(), CountChildren(), dataBeginPlaceToPageLeaf(), dataPlaceToPageLeafRecompress(), dataPlaceToPageLeafSplit(), do_autovacuum(), do_start_worker(), dsm_attach(), dsm_find_mapping(), FindLockCycleRecurse(), get_flush_position(), GetBlockerStatusData(), ginVacuumPostingTreeLeaf(), HandleChildCrash(), HandleParallelMessages(), InvalidateConstraintCacheCallBack(), launch_worker(), leafRepackItems(), logical_heap_rewrite_flush_mappings(), mXactCacheGetById(), mXactCacheGetBySet(), mXactCachePut(), PostmasterMarkPIDForWorkerNotify(), processCancelRequest(), rebuild_database_list(), RehashCatCache(), ReorderBufferAbortOld(), ReorderBufferBuildTupleCidHash(), ReorderBufferCleanupTXN(), ReorderBufferCopySnap(), ReorderBufferIterTXNFinish(), ReorderBufferIterTXNInit(), ReorderBufferIterTXNNext(), ReorderBufferRestoreChanges(), ReorderBufferSerializeTXN(), ReorderBufferToastReplace(), ReorderBufferToastReset(), reset_on_dsm_detach(), ResetCatalogCache(), SearchCatCache(), SearchCatCacheList(), SignalSomeChildren(), SlabReset(), SlabStats(), and SnapBuildDistributeNewCatalogSnapshot().

#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 507 of file ilist.h.

Referenced by addItemsToLeaf(), AssertTXNLsnOrder(), autovac_balance_cost(), computeLeafRecompressWALData(), CountChildren(), dataPlaceToPageLeafRecompress(), do_autovacuum(), dsm_attach(), dsm_find_mapping(), FindLockCycleRecurse(), GetBlockerStatusData(), ginVacuumPostingTreeLeaf(), HandleParallelMessages(), launch_worker(), leafRepackItems(), mXactCacheGetById(), mXactCacheGetBySet(), PostmasterMarkPIDForWorkerNotify(), processCancelRequest(), rebuild_database_list(), ReorderBufferBuildTupleCidHash(), ReorderBufferCopySnap(), ReorderBufferIterTXNInit(), ReorderBufferSerializeTXN(), ReorderBufferToastReplace(), reset_on_dsm_detach(), SearchCatCache(), SearchCatCacheList(), SignalSomeChildren(), SlabStats(), and SnapBuildDistributeNewCatalogSnapshot().

#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 524 of file ilist.h.

Referenced by CatCacheInvalidate(), CleanupBackend(), get_flush_position(), HandleChildCrash(), InvalidateConstraintCacheCallBack(), logical_heap_rewrite_flush_mappings(), RehashCatCache(), ReorderBufferAbortOld(), ReorderBufferCleanupTXN(), ReorderBufferRestoreChanges(), ReorderBufferSerializeTXN(), ReorderBufferToastReset(), ResetCatalogCache(), and SlabReset().

#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 487 of file ilist.h.

Referenced by AtEOSubXact_Parallel(), AtEOXact_Parallel(), dsm_backend_shutdown(), dsm_detach_all(), ReorderBufferGetOldestTXN(), ReorderBufferIterTXNInit(), ReorderBufferIterTXNNext(), and SlabAlloc().

#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 538 of file ilist.h.

Referenced by do_start_worker().

#define DLIST_STATIC_INIT

(

name

)

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

Definition at line 248 of file ilist.h.

#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 496 of file ilist.h.

Referenced by AutoVacLauncherMain(), get_flush_position(), and launcher_determine_sleep().

#define slist_check

(

head

)

((void) (head))

Definition at line 268 of file ilist.h.

Referenced by slist_delete(), slist_has_next(), slist_is_empty(), slist_pop_head_node(), and slist_push_head().

#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 674 of file ilist.h.

Referenced by AtEOSubXact_SPI(), BackgroundWorkerShmemInit(), BackgroundWorkerStopNotifications(), cancel_on_dsm_detach(), CatalogCacheFlushCatalog(), CleanupBackgroundWorker(), DetermineSleepTime(), dsm_detach(), FindRegisteredWorkerBySlotNumber(), ForgetBackgroundWorker(), HandleChildCrash(), maybe_start_bgworkers(), pg_event_trigger_dropped_objects(), PrepareToInvalidateCacheTuple(), ReorderBufferGetTupleBuf(), ReportBackgroundWorkerExit(), reset_on_dsm_detach(), ResetBackgroundWorkerCrashTimes(), ResetCatalogCaches(), and SPI_freetuptable().

#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 700 of file ilist.h.

Referenced by BackgroundWorkerShmemInit(), BackgroundWorkerStopNotifications(), CatalogCacheFlushCatalog(), FindRegisteredWorkerBySlotNumber(), HandleChildCrash(), pg_event_trigger_dropped_objects(), PrepareToInvalidateCacheTuple(), and ResetCatalogCaches().

#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 716 of file ilist.h.

Referenced by AtEOSubXact_SPI(), cancel_on_dsm_detach(), CleanupBackgroundWorker(), DetermineSleepTime(), maybe_start_bgworkers(), ResetBackgroundWorkerCrashTimes(), and SPI_freetuptable().

#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 684 of file ilist.h.

#define SLIST_STATIC_INIT

(

name

)

{{NULL}}

Definition at line 249 of file ilist.h.

Typedef Documentation

typedef struct dlist_head dlist_head

typedef struct dlist_iter dlist_iter

typedef struct dlist_mutable_iter dlist_mutable_iter

typedef struct dlist_node dlist_node

Definition at line 120 of file ilist.h.

typedef struct slist_head slist_head

typedef struct slist_iter slist_iter

typedef struct slist_mutable_iter slist_mutable_iter

typedef struct slist_node slist_node

Definition at line 190 of file ilist.h.

Function Documentation

static void dlist_delete ( dlist_node *  node )

inlinestatic

Definition at line 358 of file ilist.h.

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

Referenced by CatCacheRemoveCList(), CatCacheRemoveCTup(), CleanupBackend(), CleanupBackgroundWorker(), DestroyParallelContext(), dlist_move_head(), dlist_pop_head_node(), dsm_create(), dsm_detach(), FreeWorkerInfo(), get_flush_position(), HandleChildCrash(), InvalidateConstraintCacheCallBack(), leafRepackItems(), logical_heap_rewrite_flush_mappings(), mXactCachePut(), ProcKill(), RehashCatCache(), ReorderBufferAssignChild(), ReorderBufferCleanupTXN(), ReorderBufferCommit(), ReorderBufferCommitChild(), ReorderBufferIterTXNNext(), ReorderBufferRestoreChanges(), ReorderBufferSerializeTXN(), ReorderBufferToastReset(), SlabAlloc(), SlabFree(), and SlabReset().

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

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

inlinestatic

Definition at line 402 of file ilist.h.

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

Referenced by addItemsToLeaf(), dataPlaceToPageLeafSplit(), dlist_next_node(), leafRepackItems(), and ReorderBufferIterTXNNext().

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

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

inlinestatic

Definition at line 412 of file ilist.h.

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

Referenced by dataBeginPlaceToPageLeaf(), and dlist_prev_node().

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

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

inlinestatic

Definition at line 439 of file ilist.h.

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

Referenced by dlist_head_node().

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

static dlist_node* dlist_head_node ( dlist_head *  head )

inlinestatic

Definition at line 449 of file ilist.h.

References dlist_head_element_off().

Referenced by dataPlaceToPageLeafSplit(), and leafRepackItems().

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

static void dlist_init ( dlist_head *  head )

inlinestatic

Definition at line 278 of file ilist.h.

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

Referenced by AtEOXact_MultiXact(), AutoVacLauncherMain(), AutoVacuumShmemInit(), disassembleLeaf(), dlist_push_head(), dlist_push_tail(), InitProcGlobal(), logical_rewrite_log_mapping(), PostPrepare_MultiXact(), rebuild_database_list(), ReorderBufferAllocate(), ReorderBufferGetTXN(), ReorderBufferIterTXNInit(), ReorderBufferToastAppendChunk(), and SlabInit().

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

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

inlinestatic

Definition at line 334 of file ilist.h.

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

Referenced by leafRepackItems().

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

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

inlinestatic

Definition at line 346 of file ilist.h.

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

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

static bool dlist_is_empty ( dlist_head *  head )

inlinestatic

Definition at line 289 of file ilist.h.

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

Referenced by addItemsToLeaf(), AtEOSubXact_Parallel(), AtEOXact_Parallel(), AutoVacLauncherMain(), dataBeginPlaceToPageLeaf(), dlist_head_element_off(), dlist_pop_head_node(), dlist_tail_element_off(), do_start_worker(), dsm_backend_shutdown(), dsm_detach_all(), get_flush_position(), InitAuxiliaryProcess(), InitProcess(), launcher_determine_sleep(), LogicalRepApplyLoop(), ParallelContextActive(), PostmasterStateMachine(), ProcKill(), ReorderBufferBuildTupleCidHash(), ReorderBufferGetOldestTXN(), ReorderBufferIterTXNFinish(), ReorderBufferIterTXNNext(), ReorderBufferRestoreChanges(), ReorderBufferSerializeTXN(), SlabAlloc(), and SlabFree().

{
    dlist_check(head);

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

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

inlinestatic

Definition at line 385 of file ilist.h.

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

Referenced by launch_worker(), mXactCacheGetById(), mXactCacheGetBySet(), SearchCatCache(), and SearchCatCacheList().

{
    /* 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);
}

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

inlinestatic

Definition at line 421 of file ilist.h.

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

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

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

static dlist_node* dlist_pop_head_node ( dlist_head *  head )

inlinestatic

Definition at line 368 of file ilist.h.

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

Referenced by do_start_worker(), ReorderBufferIterTXNFinish(), and ReorderBufferIterTXNNext().

{
    dlist_node *node;

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

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

inlinestatic

Definition at line 431 of file ilist.h.

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

Referenced by dataBeginPlaceToPageLeaf(), and leafRepackItems().

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

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

inlinestatic

Definition at line 300 of file ilist.h.

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

Referenced by AutoVacLauncherMain(), AutoVacuumShmemInit(), AutoVacWorkerMain(), BackendStartup(), BecomeLockGroupLeader(), CatalogCacheCreateEntry(), CreateParallelContext(), dlist_move_head(), do_start_bgworker(), dsm_create_descriptor(), FreeWorkerInfo(), mXactCachePut(), rebuild_database_list(), RehashCatCache(), SearchCatCacheList(), SlabAlloc(), SlabFree(), and StartAutovacuumWorker().

{
    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);
}

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

inlinestatic

Definition at line 317 of file ilist.h.

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

Referenced by addItemsToLeaf(), BecomeLockGroupMember(), disassembleLeaf(), logical_rewrite_log_mapping(), ReorderBufferAddNewTupleCids(), ReorderBufferAssignChild(), ReorderBufferCommitChild(), ReorderBufferIterTXNNext(), ReorderBufferQueueChange(), ReorderBufferRestoreChange(), ReorderBufferToastAppendChunk(), ReorderBufferTXNByXid(), ri_LoadConstraintInfo(), and store_flush_position().

{
    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);
}

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

inlinestatic

Definition at line 456 of file ilist.h.

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

Referenced by dlist_tail_node().

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

static dlist_node* dlist_tail_node ( dlist_head *  head )

inlinestatic

Definition at line 466 of file ilist.h.

References dlist_tail_element_off().

Referenced by dataBeginPlaceToPageLeaf(), and mXactCachePut().

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

void slist_delete	(	slist_head *	head,
		slist_node *	node
	)

Definition at line 31 of file ilist.c.

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

{
    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);
}

static void slist_delete_current ( slist_mutable_iter *  iter )

inlinestatic

Definition at line 652 of file ilist.h.

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

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

{
    /*
     * 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;
}

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

inlinestatic

Definition at line 611 of file ilist.h.

References slist_node::next, and slist_check.

Referenced by slist_next_node().

{
    slist_check(head);

    return node->next != NULL;
}

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

inlinestatic

Definition at line 630 of file ilist.h.

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

Referenced by slist_head_node().

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

static slist_node* slist_head_node ( slist_head *  head )

inlinestatic

Definition at line 640 of file ilist.h.

References slist_head_element_off().

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

static void slist_init ( slist_head *  head )

inlinestatic

Definition at line 554 of file ilist.h.

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

Referenced by dsm_create_descriptor(), EventTriggerBeginCompleteQuery(), InitCatCache(), ReorderBufferAllocate(), and SPI_connect().

{
    head->head.next = NULL;
}

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

inlinestatic

Definition at line 586 of file ilist.h.

References slist_node::next.

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

static bool slist_is_empty ( slist_head *  head )

inlinestatic

Definition at line 563 of file ilist.h.

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_check(head);

    return head->head.next == NULL;
}

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

inlinestatic

Definition at line 622 of file ilist.h.

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

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

static slist_node* slist_pop_head_node ( slist_head *  head )

inlinestatic

Definition at line 596 of file ilist.h.

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

Referenced by dsm_detach(), ReorderBufferGetTupleBuf(), and reset_on_dsm_detach().

{
    slist_node *node;

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

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

inlinestatic

Definition at line 574 of file ilist.h.

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

Referenced by BackgroundWorkerStateChange(), EventTriggerSQLDropAddObject(), InitCatCache(), on_dsm_detach(), RegisterBackgroundWorker(), ReorderBufferReturnTupleBuf(), and spi_dest_startup().

{
    node->next = head->head.next;
    head->head.next = node;

    slist_check(head);
}