proclist.h File Reference

#include "storage/proc.h"
#include "storage/proclist_types.h"

Include dependency graph for proclist.h:

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

Go to the source code of this file.

Macros
#define	proclist_delete(list, procno, link_member)    proclist_delete_offset((list), (procno), offsetof(PGPROC, link_member))
#define	proclist_push_head(list, procno, link_member)    proclist_push_head_offset((list), (procno), offsetof(PGPROC, link_member))
#define	proclist_push_tail(list, procno, link_member)    proclist_push_tail_offset((list), (procno), offsetof(PGPROC, link_member))
#define	proclist_pop_head_node(list, link_member)    proclist_pop_head_node_offset((list), offsetof(PGPROC, link_member))
#define	proclist_contains(list, procno, link_member)    proclist_contains_offset((list), (procno), offsetof(PGPROC, link_member))
#define	proclist_foreach_modify(iter, lhead, link_member)

Functions
static void	proclist_init (proclist_head *list)
static bool	proclist_is_empty (const proclist_head *list)
static proclist_node *	proclist_node_get (int procno, size_t node_offset)
static void	proclist_push_head_offset (proclist_head *list, int procno, size_t node_offset)
static void	proclist_push_tail_offset (proclist_head *list, int procno, size_t node_offset)
static void	proclist_delete_offset (proclist_head *list, int procno, size_t node_offset)
static bool	proclist_contains_offset (const proclist_head *list, int procno, size_t node_offset)
static PGPROC *	proclist_pop_head_node_offset (proclist_head *list, size_t node_offset)

Macro Definition Documentation

proclist_contains

#define proclist_contains	(		list,
			procno,
			link_member
	)		proclist_contains_offset((list), (procno), offsetof(PGPROC, link_member))

Definition at line 195 of file proclist.h.

proclist_delete

#define proclist_delete	(		list,
			procno,
			link_member
	)		proclist_delete_offset((list), (procno), offsetof(PGPROC, link_member))

Definition at line 187 of file proclist.h.

proclist_foreach_modify

#define proclist_foreach_modify	(		iter,
			lhead,
			link_member
	)

Value:

    for (AssertVariableIsOfTypeMacro(iter, proclist_mutable_iter),          \
         AssertVariableIsOfTypeMacro(lhead, proclist_head *),               \
         (iter).cur = (lhead)->head,                                        \
         (iter).next = (iter).cur == INVALID_PROC_NUMBER ? INVALID_PROC_NUMBER :    \
             proclist_node_get((iter).cur,                                  \
                               offsetof(PGPROC, link_member))->next;        \
         (iter).cur != INVALID_PROC_NUMBER;                                 \
         (iter).cur = (iter).next,                                          \
         (iter).next = (iter).cur == INVALID_PROC_NUMBER ? INVALID_PROC_NUMBER :    \
             proclist_node_get((iter).cur,                                  \
                               offsetof(PGPROC, link_member))->next)

Definition at line 206 of file proclist.h.

proclist_pop_head_node

#define proclist_pop_head_node	(		list,
			link_member
	)		proclist_pop_head_node_offset((list), offsetof(PGPROC, link_member))

Definition at line 193 of file proclist.h.

proclist_push_head

#define proclist_push_head	(		list,
			procno,
			link_member
	)		proclist_push_head_offset((list), (procno), offsetof(PGPROC, link_member))

Definition at line 189 of file proclist.h.

proclist_push_tail

#define proclist_push_tail	(		list,
			procno,
			link_member
	)		proclist_push_tail_offset((list), (procno), offsetof(PGPROC, link_member))

Definition at line 191 of file proclist.h.

Function Documentation

proclist_contains_offset()

static bool proclist_contains_offset ( const proclist_head *  list, int  procno, size_t  node_offset  )

inlinestatic

Definition at line 146 of file proclist.h.

{
    const proclist_node *node = proclist_node_get(procno, node_offset);
 
    /* If it's not in any list, it's definitely not in this one. */
    if (node->prev == 0 && node->next == 0)
        return false;
 
    /*
     * It must, in fact, be in this list.  Ideally, in assert-enabled builds,
     * we'd verify that.  But since this function is typically used while
     * holding a spinlock, crawling the whole list is unacceptable.  However,
     * we can verify matters in O(1) time when the node is a list head or
     * tail, and that seems worth doing, since in practice that should often
     * be enough to catch mistakes.
     */
    Assert(node->prev != INVALID_PROC_NUMBER || list->head == procno);
    Assert(node->next != INVALID_PROC_NUMBER || list->tail == procno);
 
    return true;
}

References Assert, INVALID_PROC_NUMBER, sort-test::list, proclist_node::next, proclist_node::prev, and proclist_node_get().

proclist_delete_offset()

static void proclist_delete_offset ( proclist_head *  list, int  procno, size_t  node_offset  )

inlinestatic

Definition at line 115 of file proclist.h.

{
    proclist_node *node = proclist_node_get(procno, node_offset);
 
    Assert(node->next != 0 || node->prev != 0);
 
    if (node->prev == INVALID_PROC_NUMBER)
    {
        Assert(list->head == procno);
        list->head = node->next;
    }
    else
        proclist_node_get(node->prev, node_offset)->next = node->next;
 
    if (node->next == INVALID_PROC_NUMBER)
    {
        Assert(list->tail == procno);
        list->tail = node->prev;
    }
    else
        proclist_node_get(node->next, node_offset)->prev = node->prev;
 
    node->next = node->prev = 0;
}

References Assert, INVALID_PROC_NUMBER, sort-test::list, proclist_node::next, proclist_node::prev, and proclist_node_get().

Referenced by proclist_pop_head_node_offset().

proclist_init()

static void proclist_init ( proclist_head *  list )

inlinestatic

Definition at line 29 of file proclist.h.

{
    list->head = list->tail = INVALID_PROC_NUMBER;
}

References INVALID_PROC_NUMBER, and sort-test::list.

Referenced by ConditionVariableInit(), LWLockInitialize(), LWLockUpdateVar(), and LWLockWakeup().

proclist_is_empty()

static bool proclist_is_empty ( const proclist_head *  list )

inlinestatic

Definition at line 38 of file proclist.h.

{
    return list->head == INVALID_PROC_NUMBER;
}

References INVALID_PROC_NUMBER, and sort-test::list.

Referenced by ConditionVariableBroadcast(), ConditionVariableSignal(), LWLockDequeueSelf(), LWLockWakeup(), and proclist_pop_head_node_offset().

proclist_node_get()

static proclist_node* proclist_node_get ( int  procno, size_t  node_offset  )

inlinestatic

Definition at line 48 of file proclist.h.

{
    char       *entry = (char *) GetPGProcByNumber(procno);
 
    return (proclist_node *) (entry + node_offset);
}

References GetPGProcByNumber.

Referenced by proclist_contains_offset(), proclist_delete_offset(), proclist_push_head_offset(), and proclist_push_tail_offset().

proclist_pop_head_node_offset()

static PGPROC* proclist_pop_head_node_offset ( proclist_head *  list, size_t  node_offset  )

inlinestatic

Definition at line 173 of file proclist.h.

{
    PGPROC     *proc;
 
    Assert(!proclist_is_empty(list));
    proc = GetPGProcByNumber(list->head);
    proclist_delete_offset(list, list->head, node_offset);
    return proc;
}

References Assert, GetPGProcByNumber, sort-test::list, proclist_delete_offset(), and proclist_is_empty().

proclist_push_head_offset()

static void proclist_push_head_offset ( proclist_head *  list, int  procno, size_t  node_offset  )

inlinestatic

Definition at line 59 of file proclist.h.

{
    proclist_node *node = proclist_node_get(procno, node_offset);
 
    Assert(node->next == 0 && node->prev == 0);
 
    if (list->head == INVALID_PROC_NUMBER)
    {
        Assert(list->tail == INVALID_PROC_NUMBER);
        node->next = node->prev = INVALID_PROC_NUMBER;
        list->head = list->tail = procno;
    }
    else
    {
        Assert(list->tail != INVALID_PROC_NUMBER);
        Assert(list->head != procno);
        Assert(list->tail != procno);
        node->next = list->head;
        proclist_node_get(node->next, node_offset)->prev = procno;
        node->prev = INVALID_PROC_NUMBER;
        list->head = procno;
    }
}

References Assert, INVALID_PROC_NUMBER, sort-test::list, proclist_node::next, proclist_node::prev, and proclist_node_get().

proclist_push_tail_offset()

static void proclist_push_tail_offset ( proclist_head *  list, int  procno, size_t  node_offset  )

inlinestatic

Definition at line 87 of file proclist.h.

{
    proclist_node *node = proclist_node_get(procno, node_offset);
 
    Assert(node->next == 0 && node->prev == 0);
 
    if (list->tail == INVALID_PROC_NUMBER)
    {
        Assert(list->head == INVALID_PROC_NUMBER);
        node->next = node->prev = INVALID_PROC_NUMBER;
        list->head = list->tail = procno;
    }
    else
    {
        Assert(list->head != INVALID_PROC_NUMBER);
        Assert(list->head != procno);
        Assert(list->tail != procno);
        node->prev = list->tail;
        proclist_node_get(node->prev, node_offset)->next = procno;
        node->next = INVALID_PROC_NUMBER;
        list->tail = procno;
    }
}

References Assert, INVALID_PROC_NUMBER, sort-test::list, proclist_node::next, proclist_node::prev, and proclist_node_get().