#include "nodes/nodes.h"

Include dependency graph for pg_list.h:

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

Data Structures
union	ListCell

struct	List

struct	ForEachState

struct	ForBothState

struct	ForBothCellState

struct	ForThreeState

struct	ForFourState

struct	ForFiveState

Macros
#define	NIL ((List *) NULL)

#define	lfirst(lc) ((lc)->ptr_value)

#define	lfirst_int(lc) ((lc)->int_value)

#define	lfirst_oid(lc) ((lc)->oid_value)

#define	lfirst_xid(lc) ((lc)->xid_value)

#define	lfirst_node(type, lc) castNode(type, lfirst(lc))

#define	linitial(l) lfirst(list_nth_cell(l, 0))

#define	linitial_int(l) lfirst_int(list_nth_cell(l, 0))

#define	linitial_oid(l) lfirst_oid(list_nth_cell(l, 0))

#define	linitial_node(type, l) castNode(type, linitial(l))

#define	lsecond(l) lfirst(list_nth_cell(l, 1))

#define	lsecond_int(l) lfirst_int(list_nth_cell(l, 1))

#define	lsecond_oid(l) lfirst_oid(list_nth_cell(l, 1))

#define	lsecond_node(type, l) castNode(type, lsecond(l))

#define	lthird(l) lfirst(list_nth_cell(l, 2))

#define	lthird_int(l) lfirst_int(list_nth_cell(l, 2))

#define	lthird_oid(l) lfirst_oid(list_nth_cell(l, 2))

#define	lthird_node(type, l) castNode(type, lthird(l))

#define	lfourth(l) lfirst(list_nth_cell(l, 3))

#define	lfourth_int(l) lfirst_int(list_nth_cell(l, 3))

#define	lfourth_oid(l) lfirst_oid(list_nth_cell(l, 3))

#define	lfourth_node(type, l) castNode(type, lfourth(l))

#define	llast(l) lfirst(list_last_cell(l))

#define	llast_int(l) lfirst_int(list_last_cell(l))

#define	llast_oid(l) lfirst_oid(list_last_cell(l))

#define	llast_xid(l) lfirst_xid(list_last_cell(l))

#define	llast_node(type, l) castNode(type, llast(l))

#define	list_make_ptr_cell(v) ((ListCell) {.ptr_value = (v)})

#define	list_make_int_cell(v) ((ListCell) {.int_value = (v)})

#define	list_make_oid_cell(v) ((ListCell) {.oid_value = (v)})

#define	list_make_xid_cell(v) ((ListCell) {.xid_value = (v)})

#define	list_make1(x1) list_make1_impl(T_List, list_make_ptr_cell(x1))

#define	list_make2(x1, x2) list_make2_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2))

#define	list_make3(x1, x2, x3)

#define	list_make4(x1, x2, x3, x4)

#define	list_make5(x1, x2, x3, x4, x5)

#define	list_make1_int(x1) list_make1_impl(T_IntList, list_make_int_cell(x1))

#define	list_make2_int(x1, x2) list_make2_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2))

#define	list_make3_int(x1, x2, x3)

#define	list_make4_int(x1, x2, x3, x4)

#define	list_make5_int(x1, x2, x3, x4, x5)

#define	list_make1_oid(x1) list_make1_impl(T_OidList, list_make_oid_cell(x1))

#define	list_make2_oid(x1, x2) list_make2_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2))

#define	list_make3_oid(x1, x2, x3)

#define	list_make4_oid(x1, x2, x3, x4)

#define	list_make5_oid(x1, x2, x3, x4, x5)

#define	list_make1_xid(x1) list_make1_impl(T_XidList, list_make_xid_cell(x1))

#define	list_make2_xid(x1, x2) list_make2_impl(T_XidList, list_make_xid_cell(x1), list_make_xid_cell(x2))

#define	list_make3_xid(x1, x2, x3)

#define	list_make4_xid(x1, x2, x3, x4)

#define	list_make5_xid(x1, x2, x3, x4, x5)

#define	list_nth_node(type, list, n) castNode(type, list_nth(list, n))

#define	foreach(cell, lst)

#define	foreach_delete_current(lst, var_or_cell) ((List *) (var_or_cell##__state.l = list_delete_nth_cell(lst, var_or_cell##__state.i--)))

#define	foreach_current_index(var_or_cell) (var_or_cell##__state.i)

#define	for_each_from(cell, lst, N)

#define	for_each_cell(cell, lst, initcell)

#define	foreach_ptr(type, var, lst) foreach_internal(type, *, var, lst, lfirst)

#define	foreach_int(var, lst) foreach_internal(int, , var, lst, lfirst_int)

#define	foreach_oid(var, lst) foreach_internal(Oid, , var, lst, lfirst_oid)

#define	foreach_xid(var, lst) foreach_internal(TransactionId, , var, lst, lfirst_xid)

#define	foreach_internal(type, pointer, var, lst, func)

#define	foreach_node(type, var, lst)

#define	forboth(cell1, list1, cell2, list2)

#define	multi_for_advance_cell(cell, state, l, i)

#define	for_both_cell(cell1, list1, initcell1, cell2, list2, initcell2)

#define	forthree(cell1, list1, cell2, list2, cell3, list3)

#define	forfour(cell1, list1, cell2, list2, cell3, list3, cell4, list4)

#define	forfive(cell1, list1, cell2, list2, cell3, list3, cell4, list4, cell5, list5)

Functions
static ListCell *	list_head (const List *l)

static ListCell *	list_tail (const List *l)

static ListCell *	list_second_cell (const List *l)

static int	list_length (const List *l)

static ListCell *	list_nth_cell (const List *list, int n)

static ListCell *	list_last_cell (const List *list)

static void *	list_nth (const List *list, int n)

static int	list_nth_int (const List *list, int n)

static Oid	list_nth_oid (const List *list, int n)

static int	list_cell_number (const List l, const ListCell c)

static ListCell *	lnext (const List l, const ListCell c)

static ForEachState	for_each_from_setup (const List *lst, int N)

static ForEachState	for_each_cell_setup (const List lst, const ListCell initcell)

static ForBothCellState	for_both_cell_setup (const List list1, const ListCell initcell1, const List list2, const ListCell initcell2)

List *	list_make1_impl (NodeTag t, ListCell datum1)

List *	list_make2_impl (NodeTag t, ListCell datum1, ListCell datum2)

List *	list_make3_impl (NodeTag t, ListCell datum1, ListCell datum2, ListCell datum3)

List *	list_make4_impl (NodeTag t, ListCell datum1, ListCell datum2, ListCell datum3, ListCell datum4)

List *	list_make5_impl (NodeTag t, ListCell datum1, ListCell datum2, ListCell datum3, ListCell datum4, ListCell datum5)

pg_nodiscard List *	lappend (List list, void datum)

pg_nodiscard List *	lappend_int (List *list, int datum)

pg_nodiscard List *	lappend_oid (List *list, Oid datum)

pg_nodiscard List *	lappend_xid (List *list, TransactionId datum)

pg_nodiscard List *	list_insert_nth (List list, int pos, void datum)

pg_nodiscard List *	list_insert_nth_int (List *list, int pos, int datum)

pg_nodiscard List *	list_insert_nth_oid (List *list, int pos, Oid datum)

pg_nodiscard List *	lcons (void datum, List list)

pg_nodiscard List *	lcons_int (int datum, List *list)

pg_nodiscard List *	lcons_oid (Oid datum, List *list)

pg_nodiscard List *	list_concat (List list1, const List list2)

pg_nodiscard List *	list_concat_copy (const List list1, const List list2)

pg_nodiscard List *	list_truncate (List *list, int new_size)

bool	list_member (const List list, const void datum)

bool	list_member_ptr (const List list, const void datum)

bool	list_member_int (const List *list, int datum)

bool	list_member_oid (const List *list, Oid datum)

bool	list_member_xid (const List *list, TransactionId datum)

pg_nodiscard List *	list_delete (List list, void datum)

pg_nodiscard List *	list_delete_ptr (List list, void datum)

pg_nodiscard List *	list_delete_int (List *list, int datum)

pg_nodiscard List *	list_delete_oid (List *list, Oid datum)

pg_nodiscard List *	list_delete_first (List *list)

pg_nodiscard List *	list_delete_last (List *list)

pg_nodiscard List *	list_delete_first_n (List *list, int n)

pg_nodiscard List *	list_delete_nth_cell (List *list, int n)

pg_nodiscard List *	list_delete_cell (List list, ListCell cell)

List *	list_union (const List list1, const List list2)

List *	list_union_ptr (const List list1, const List list2)

List *	list_union_int (const List list1, const List list2)

List *	list_union_oid (const List list1, const List list2)

List *	list_intersection (const List list1, const List list2)

List *	list_intersection_int (const List list1, const List list2)

List *	list_difference (const List list1, const List list2)

List *	list_difference_ptr (const List list1, const List list2)

List *	list_difference_int (const List list1, const List list2)

List *	list_difference_oid (const List list1, const List list2)

pg_nodiscard List *	list_append_unique (List list, void datum)

pg_nodiscard List *	list_append_unique_ptr (List list, void datum)

pg_nodiscard List *	list_append_unique_int (List *list, int datum)

pg_nodiscard List *	list_append_unique_oid (List *list, Oid datum)

pg_nodiscard List *	list_concat_unique (List list1, const List list2)

pg_nodiscard List *	list_concat_unique_ptr (List list1, const List list2)

pg_nodiscard List *	list_concat_unique_int (List list1, const List list2)

pg_nodiscard List *	list_concat_unique_oid (List list1, const List list2)

void	list_deduplicate_oid (List *list)

void	list_free (List *list)

void	list_free_deep (List *list)

pg_nodiscard List *	list_copy (const List *oldlist)

pg_nodiscard List *	list_copy_head (const List *oldlist, int len)

pg_nodiscard List *	list_copy_tail (const List *oldlist, int nskip)

pg_nodiscard List *	list_copy_deep (const List *oldlist)

void	list_sort (List *list, list_sort_comparator cmp)

int	list_int_cmp (const ListCell p1, const ListCell p2)

int	list_oid_cmp (const ListCell p1, const ListCell p2)

Macro Definition Documentation

◆ for_both_cell

#define for_both_cell	(	cell1,
		list1,
		initcell1,
		cell2,
		list2,
		initcell2
	)

Value:

    for (ForBothCellState cell1##__state = \
             for_both_cell_setup(list1, initcell1, list2, initcell2); \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i1), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i2), \
         (cell1 != NULL && cell2 != NULL); \
         cell1##__state.i1++, cell1##__state.i2++)

Definition at line 540 of file pg_list.h.

{
    ForBothCellState r = {list1, list2,
        initcell1 ? list_cell_number(list1, initcell1) : list_length(list1),
    initcell2 ? list_cell_number(list2, initcell2) : list_length(list2)};
 
    return r;
}
 
/*
 * forthree -
 *    the same for three lists
 */
#define forthree(cell1, list1, cell2, list2, cell3, list3) \
    for (ForThreeState cell1##__state = {(list1), (list2), (list3), 0}; \
         multi_for_advance_cell(cell1, cell1##__state, l1, i), \
         multi_for_advance_cell(cell2, cell1##__state, l2, i), \
         multi_for_advance_cell(cell3, cell1##__state, l3, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL); \
         cell1##__state.i++)
 
/*
 * forfour -
 *    the same for four lists
 */
#define forfour(cell1, list1, cell2, list2, cell3, list3, cell4, list4) \
    for (ForFourState cell1##__state = {(list1), (list2), (list3), (list4), 0}; \
         multi_for_advance_cell(cell1, cell1##__state, l1, i), \
         multi_for_advance_cell(cell2, cell1##__state, l2, i), \
         multi_for_advance_cell(cell3, cell1##__state, l3, i), \
         multi_for_advance_cell(cell4, cell1##__state, l4, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL && cell4 != NULL); \
         cell1##__state.i++)
 
/*
 * forfive -
 *    the same for five lists
 */
#define forfive(cell1, list1, cell2, list2, cell3, list3, cell4, list4, cell5, list5) \
    for (ForFiveState cell1##__state = {(list1), (list2), (list3), (list4), (list5), 0}; \
         multi_for_advance_cell(cell1, cell1##__state, l1, i), \
         multi_for_advance_cell(cell2, cell1##__state, l2, i), \
         multi_for_advance_cell(cell3, cell1##__state, l3, i), \
         multi_for_advance_cell(cell4, cell1##__state, l4, i), \
         multi_for_advance_cell(cell5, cell1##__state, l5, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL && \
          cell4 != NULL && cell5 != NULL); \
         cell1##__state.i++)
 
/* Functions in src/backend/nodes/list.c */
 
extern List *list_make1_impl(NodeTag t, ListCell datum1);
extern List *list_make2_impl(NodeTag t, ListCell datum1, ListCell datum2);
extern List *list_make3_impl(NodeTag t, ListCell datum1, ListCell datum2,
                             ListCell datum3);
extern List *list_make4_impl(NodeTag t, ListCell datum1, ListCell datum2,
                             ListCell datum3, ListCell datum4);
extern List *list_make5_impl(NodeTag t, ListCell datum1, ListCell datum2,
                             ListCell datum3, ListCell datum4,
                             ListCell datum5);
 
pg_nodiscard extern List *lappend(List *list, void *datum);
pg_nodiscard extern List *lappend_int(List *list, int datum);
pg_nodiscard extern List *lappend_oid(List *list, Oid datum);
pg_nodiscard extern List *lappend_xid(List *list, TransactionId datum);
 
pg_nodiscard extern List *list_insert_nth(List *list, int pos, void *datum);
pg_nodiscard extern List *list_insert_nth_int(List *list, int pos, int datum);
pg_nodiscard extern List *list_insert_nth_oid(List *list, int pos, Oid datum);
 
pg_nodiscard extern List *lcons(void *datum, List *list);
pg_nodiscard extern List *lcons_int(int datum, List *list);
pg_nodiscard extern List *lcons_oid(Oid datum, List *list);
 
pg_nodiscard extern List *list_concat(List *list1, const List *list2);
pg_nodiscard extern List *list_concat_copy(const List *list1, const List *list2);
 
pg_nodiscard extern List *list_truncate(List *list, int new_size);
 
extern bool list_member(const List *list, const void *datum);
extern bool list_member_ptr(const List *list, const void *datum);
extern bool list_member_int(const List *list, int datum);
extern bool list_member_oid(const List *list, Oid datum);
extern bool list_member_xid(const List *list, TransactionId datum);
 
pg_nodiscard extern List *list_delete(List *list, void *datum);
pg_nodiscard extern List *list_delete_ptr(List *list, void *datum);
pg_nodiscard extern List *list_delete_int(List *list, int datum);
pg_nodiscard extern List *list_delete_oid(List *list, Oid datum);
pg_nodiscard extern List *list_delete_first(List *list);
pg_nodiscard extern List *list_delete_last(List *list);
pg_nodiscard extern List *list_delete_first_n(List *list, int n);
pg_nodiscard extern List *list_delete_nth_cell(List *list, int n);
pg_nodiscard extern List *list_delete_cell(List *list, ListCell *cell);
 
extern List *list_union(const List *list1, const List *list2);
extern List *list_union_ptr(const List *list1, const List *list2);
extern List *list_union_int(const List *list1, const List *list2);
extern List *list_union_oid(const List *list1, const List *list2);
 
extern List *list_intersection(const List *list1, const List *list2);
extern List *list_intersection_int(const List *list1, const List *list2);
 
/* currently, there's no need for list_intersection_ptr etc */
 
extern List *list_difference(const List *list1, const List *list2);
extern List *list_difference_ptr(const List *list1, const List *list2);
extern List *list_difference_int(const List *list1, const List *list2);
extern List *list_difference_oid(const List *list1, const List *list2);
 
pg_nodiscard extern List *list_append_unique(List *list, void *datum);
pg_nodiscard extern List *list_append_unique_ptr(List *list, void *datum);
pg_nodiscard extern List *list_append_unique_int(List *list, int datum);
pg_nodiscard extern List *list_append_unique_oid(List *list, Oid datum);
 
pg_nodiscard extern List *list_concat_unique(List *list1, const List *list2);
pg_nodiscard extern List *list_concat_unique_ptr(List *list1, const List *list2);
pg_nodiscard extern List *list_concat_unique_int(List *list1, const List *list2);
pg_nodiscard extern List *list_concat_unique_oid(List *list1, const List *list2);
 
extern void list_deduplicate_oid(List *list);
 
extern void list_free(List *list);
extern void list_free_deep(List *list);
 
pg_nodiscard extern List *list_copy(const List *oldlist);
pg_nodiscard extern List *list_copy_head(const List *oldlist, int len);
pg_nodiscard extern List *list_copy_tail(const List *oldlist, int nskip);
pg_nodiscard extern List *list_copy_deep(const List *oldlist);
 
typedef int (*list_sort_comparator) (const ListCell *a, const ListCell *b);
extern void list_sort(List *list, list_sort_comparator cmp);
 
extern int  list_int_cmp(const ListCell *p1, const ListCell *p2);
extern int  list_oid_cmp(const ListCell *p1, const ListCell *p2);
 
#endif                          /* PG_LIST_H */

◆ for_each_cell

#define for_each_cell	(	cell,
		lst,
		initcell
	)

Value:

    for (ForEachState cell##__state = for_each_cell_setup(lst, initcell); \
         (cell##__state.l != NIL && \
          cell##__state.i < cell##__state.l->length) ? \
         (cell = &cell##__state.l->elements[cell##__state.i], true) : \
         (cell = NULL, false); \
         cell##__state.i++)

Definition at line 438 of file pg_list.h.

                                                                    : \
         (cell = NULL, false); \
         cell##__state.i++)

◆ for_each_from

#define for_each_from	(	cell,
		lst,
		N
	)

Value:

    for (ForEachState cell##__state = for_each_from_setup(lst, N); \
         (cell##__state.l != NIL && \
          cell##__state.i < cell##__state.l->length) ? \
         (cell = &cell##__state.l->elements[cell##__state.i], true) : \
         (cell = NULL, false); \
         cell##__state.i++)

Definition at line 414 of file pg_list.h.

                                                                    : \
         (cell = NULL, false); \
         cell##__state.i++)

◆ forboth

#define forboth	(	cell1,
		list1,
		cell2,
		list2
	)

Value:

    for (ForBothState cell1##__state = {(list1), (list2), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
         (cell1 != NULL && cell2 != NULL); \
         cell1##__state.i++)

Definition at line 518 of file pg_list.h.

                                       {(list1), (list2), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
         (cell1 != NULL && cell2 != NULL); \
         cell1##__state.i++)

◆ foreach

#define foreach	(	cell,
		lst
	)

Value:

    for (ForEachState cell##__state = {(lst), 0}; \
         (cell##__state.l != NIL && \
          cell##__state.i < cell##__state.l->length) ? \
         (cell = &cell##__state.l->elements[cell##__state.i], true) : \
         (cell = NULL, false); \
         cell##__state.i++)

Definition at line 373 of file pg_list.h.

                                      {(lst), 0}; \
         (cell##__state.l != NIL && \
          cell##__state.i < cell##__state.l->length) ? \
         (cell = &cell##__state.l->elements[cell##__state.i], true) : \
         (cell = NULL, false); \
         cell##__state.i++)

◆ foreach_current_index

#define foreach_current_index ( var_or_cell ) (var_or_cell##__state.i)

Definition at line 403 of file pg_list.h.

◆ foreach_delete_current

#define foreach_delete_current	(	lst,
		var_or_cell
	)	((List *) (var_or_cell##__state.l = list_delete_nth_cell(lst, var_or_cell##__state.i--)))

Definition at line 391 of file pg_list.h.

◆ foreach_int

#define foreach_int	(	var,
		lst
	)	foreach_internal(int, , var, lst, lfirst_int)

Definition at line 470 of file pg_list.h.

◆ foreach_internal

#define foreach_internal	(	type,
		pointer,
		var,
		lst,
		func
	)

Value:

    for (type pointer var = 0, pointer var##__outerloop = (type pointer) 1; \
         var##__outerloop; \
         var##__outerloop = 0) \
        for (ForEachState var##__state = {(lst), 0}; \
             (var##__state.l != NIL && \
              var##__state.i < var##__state.l->length && \
             (var = (type pointer) func(&var##__state.l->elements[var##__state.i]), true)); \
             var##__state.i++)

Definition at line 481 of file pg_list.h.

                                         {(lst), 0}; \
             (var##__state.l != NIL && \
              var##__state.i < var##__state.l->length && \
             (var = (type pointer) func(&var##__state.l->elements[var##__state.i]), true)); \
             var##__state.i++)

◆ foreach_node

#define foreach_node	(	type,
		var,
		lst
	)

Value:

    for (type * var = 0, *var##__outerloop = (type *) 1; \
         var##__outerloop; \
         var##__outerloop = 0) \
        for (ForEachState var##__state = {(lst), 0}; \
             (var##__state.l != NIL && \
              var##__state.i < var##__state.l->length && \
             (var = lfirst_node(type, &var##__state.l->elements[var##__state.i]), true)); \
             var##__state.i++)

Definition at line 496 of file pg_list.h.

                                         {(lst), 0}; \
             (var##__state.l != NIL && \
              var##__state.i < var##__state.l->length && \
             (var = lfirst_node(type, &var##__state.l->elements[var##__state.i]), true)); \
             var##__state.i++)

◆ foreach_oid

#define foreach_oid	(	var,
		lst
	)	foreach_internal(Oid, , var, lst, lfirst_oid)

Definition at line 471 of file pg_list.h.

◆ foreach_ptr

#define foreach_ptr	(	type,
		var,
		lst
	)	foreach_internal(type, *, var, lst, lfirst)

Definition at line 469 of file pg_list.h.

◆ foreach_xid

#define foreach_xid	(	var,
		lst
	)	foreach_internal(TransactionId, , var, lst, lfirst_xid)

Definition at line 472 of file pg_list.h.

◆ forfive

#define forfive	(	cell1,
		list1,
		cell2,
		list2,
		cell3,
		list3,
		cell4,
		list4,
		cell5,
		list5
	)

Value:

    for (ForFiveState cell1##__state = {(list1), (list2), (list3), (list4), (list5), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
		 multi_for_advance_cell(cell3, cell1##__state, l3, i), \
		 multi_for_advance_cell(cell4, cell1##__state, l4, i), \
		 multi_for_advance_cell(cell5, cell1##__state, l5, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL && \
          cell4 != NULL && cell5 != NULL); \
         cell1##__state.i++)

Definition at line 588 of file pg_list.h.

                                       {(list1), (list2), (list3), (list4), (list5), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
		 multi_for_advance_cell(cell3, cell1##__state, l3, i), \
		 multi_for_advance_cell(cell4, cell1##__state, l4, i), \
		 multi_for_advance_cell(cell5, cell1##__state, l5, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL && \
          cell4 != NULL && cell5 != NULL); \
         cell1##__state.i++)

◆ forfour

#define forfour	(	cell1,
		list1,
		cell2,
		list2,
		cell3,
		list3,
		cell4,
		list4
	)

Value:

    for (ForFourState cell1##__state = {(list1), (list2), (list3), (list4), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
		 multi_for_advance_cell(cell3, cell1##__state, l3, i), \
		 multi_for_advance_cell(cell4, cell1##__state, l4, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL && cell4 != NULL); \
         cell1##__state.i++)

Definition at line 575 of file pg_list.h.

                                       {(list1), (list2), (list3), (list4), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
		 multi_for_advance_cell(cell3, cell1##__state, l3, i), \
		 multi_for_advance_cell(cell4, cell1##__state, l4, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL && cell4 != NULL); \
         cell1##__state.i++)

◆ forthree

#define forthree	(	cell1,
		list1,
		cell2,
		list2,
		cell3,
		list3
	)

Value:

    for (ForThreeState cell1##__state = {(list1), (list2), (list3), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
		 multi_for_advance_cell(cell3, cell1##__state, l3, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL); \
         cell1##__state.i++)

Definition at line 563 of file pg_list.h.

                                        {(list1), (list2), (list3), 0}; \
		 multi_for_advance_cell(cell1, cell1##__state, l1, i), \
		 multi_for_advance_cell(cell2, cell1##__state, l2, i), \
		 multi_for_advance_cell(cell3, cell1##__state, l3, i), \
         (cell1 != NULL && cell2 != NULL && cell3 != NULL); \
         cell1##__state.i++)

◆ lfirst

#define lfirst ( lc ) ((lc)->ptr_value)

Definition at line 172 of file pg_list.h.

◆ lfirst_int

#define lfirst_int ( lc ) ((lc)->int_value)

Definition at line 173 of file pg_list.h.

◆ lfirst_node

#define lfirst_node	(	type,
		lc
	)	castNode(type, lfirst(lc))

Definition at line 176 of file pg_list.h.

◆ lfirst_oid

#define lfirst_oid ( lc ) ((lc)->oid_value)

Definition at line 174 of file pg_list.h.

◆ lfirst_xid

#define lfirst_xid ( lc ) ((lc)->xid_value)

Definition at line 175 of file pg_list.h.

◆ lfourth

#define lfourth ( l ) lfirst(list_nth_cell(l, 3))

Definition at line 193 of file pg_list.h.

◆ lfourth_int

#define lfourth_int ( l ) lfirst_int(list_nth_cell(l, 3))

Definition at line 194 of file pg_list.h.

◆ lfourth_node

#define lfourth_node	(	type,
		l
	)	castNode(type, lfourth(l))

Definition at line 196 of file pg_list.h.

◆ lfourth_oid

#define lfourth_oid ( l ) lfirst_oid(list_nth_cell(l, 3))

Definition at line 195 of file pg_list.h.

◆ linitial

#define linitial ( l ) lfirst(list_nth_cell(l, 0))

Definition at line 178 of file pg_list.h.

◆ linitial_int

#define linitial_int ( l ) lfirst_int(list_nth_cell(l, 0))

Definition at line 179 of file pg_list.h.

◆ linitial_node

#define linitial_node	(	type,
		l
	)	castNode(type, linitial(l))

Definition at line 181 of file pg_list.h.

◆ linitial_oid

#define linitial_oid ( l ) lfirst_oid(list_nth_cell(l, 0))

Definition at line 180 of file pg_list.h.

◆ list_make1

#define list_make1 ( x1 ) list_make1_impl(T_List, list_make_ptr_cell(x1))

Definition at line 212 of file pg_list.h.

◆ list_make1_int

#define list_make1_int ( x1 ) list_make1_impl(T_IntList, list_make_int_cell(x1))

Definition at line 227 of file pg_list.h.

◆ list_make1_oid

#define list_make1_oid ( x1 ) list_make1_impl(T_OidList, list_make_oid_cell(x1))

Definition at line 242 of file pg_list.h.

◆ list_make1_xid

#define list_make1_xid ( x1 ) list_make1_impl(T_XidList, list_make_xid_cell(x1))

Definition at line 257 of file pg_list.h.

◆ list_make2

#define list_make2	(	x1,
		x2
	)	list_make2_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2))

Definition at line 214 of file pg_list.h.

◆ list_make2_int

#define list_make2_int	(	x1,
		x2
	)	list_make2_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2))

Definition at line 229 of file pg_list.h.

◆ list_make2_oid

#define list_make2_oid	(	x1,
		x2
	)	list_make2_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2))

Definition at line 244 of file pg_list.h.

◆ list_make2_xid

#define list_make2_xid	(	x1,
		x2
	)	list_make2_impl(T_XidList, list_make_xid_cell(x1), list_make_xid_cell(x2))

Definition at line 259 of file pg_list.h.

◆ list_make3

#define list_make3	(	x1,
		x2,
		x3
	)

Value:

list_make3_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2), \

list_make_ptr_cell(x3))

list_make_ptr_cell

#define list_make_ptr_cell(v)

Definition pg_list.h:207

Definition at line 216 of file pg_list.h.

◆ list_make3_int

#define list_make3_int	(	x1,
		x2,
		x3
	)

Value:

list_make3_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2), \

list_make_int_cell(x3))

list_make_int_cell

#define list_make_int_cell(v)

Definition pg_list.h:208

Definition at line 231 of file pg_list.h.

◆ list_make3_oid

#define list_make3_oid	(	x1,
		x2,
		x3
	)

Value:

list_make3_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2), \

list_make_oid_cell(x3))

list_make_oid_cell

#define list_make_oid_cell(v)

Definition pg_list.h:209

Definition at line 246 of file pg_list.h.

◆ list_make3_xid

#define list_make3_xid	(	x1,
		x2,
		x3
	)

Value:

list_make3_impl(T_XidList, list_make_xid_cell(x1), list_make_xid_cell(x2), \

list_make_xid_cell(x3))

list_make_xid_cell

#define list_make_xid_cell(v)

Definition pg_list.h:210

Definition at line 261 of file pg_list.h.

◆ list_make4

#define list_make4	(	x1,
		x2,
		x3,
		x4
	)

Value:

list_make4_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2), \

list_make_ptr_cell(x3), list_make_ptr_cell(x4))

Definition at line 219 of file pg_list.h.

◆ list_make4_int

#define list_make4_int	(	x1,
		x2,
		x3,
		x4
	)

Value:

list_make4_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2), \

list_make_int_cell(x3), list_make_int_cell(x4))

Definition at line 234 of file pg_list.h.

◆ list_make4_oid

#define list_make4_oid	(	x1,
		x2,
		x3,
		x4
	)

Value:

list_make4_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2), \

list_make_oid_cell(x3), list_make_oid_cell(x4))

Definition at line 249 of file pg_list.h.

◆ list_make4_xid

#define list_make4_xid	(	x1,
		x2,
		x3,
		x4
	)

Value:

list_make4_impl(T_XidList, list_make_xid_cell(x1), list_make_xid_cell(x2), \

list_make_xid_cell(x3), list_make_xid_cell(x4))

Definition at line 264 of file pg_list.h.

◆ list_make5

#define list_make5	(	x1,
		x2,
		x3,
		x4,
		x5
	)

Value:

    list_make5_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2), \
                    list_make_ptr_cell(x3), list_make_ptr_cell(x4), \
                    list_make_ptr_cell(x5))

Definition at line 222 of file pg_list.h.

◆ list_make5_int

#define list_make5_int	(	x1,
		x2,
		x3,
		x4,
		x5
	)

Value:

    list_make5_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2), \
                    list_make_int_cell(x3), list_make_int_cell(x4), \
                    list_make_int_cell(x5))

Definition at line 237 of file pg_list.h.

◆ list_make5_oid

#define list_make5_oid	(	x1,
		x2,
		x3,
		x4,
		x5
	)

Value:

    list_make5_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2), \
                    list_make_oid_cell(x3), list_make_oid_cell(x4), \
                    list_make_oid_cell(x5))

Definition at line 252 of file pg_list.h.

◆ list_make5_xid

#define list_make5_xid	(	x1,
		x2,
		x3,
		x4,
		x5
	)

Value:

    list_make5_impl(T_XidList, list_make_xid_cell(x1), list_make_xid_cell(x2), \
                    list_make_xid_cell(x3), list_make_xid_cell(x4), \
                    list_make_xid_cell(x5))

Definition at line 267 of file pg_list.h.

◆ list_make_int_cell

#define list_make_int_cell ( v ) ((ListCell) {.int_value = (v)})

Definition at line 208 of file pg_list.h.

◆ list_make_oid_cell

#define list_make_oid_cell ( v ) ((ListCell) {.oid_value = (v)})

Definition at line 209 of file pg_list.h.

◆ list_make_ptr_cell

#define list_make_ptr_cell ( v ) ((ListCell) {.ptr_value = (v)})

Definition at line 207 of file pg_list.h.

◆ list_make_xid_cell

#define list_make_xid_cell ( v ) ((ListCell) {.xid_value = (v)})

Definition at line 210 of file pg_list.h.

◆ list_nth_node

#define list_nth_node	(	type,
		list,
		n
	)	castNode(type, list_nth(list, n))

Definition at line 327 of file pg_list.h.

◆ llast

#define llast ( l ) lfirst(list_last_cell(l))

Definition at line 198 of file pg_list.h.

◆ llast_int

#define llast_int ( l ) lfirst_int(list_last_cell(l))

Definition at line 199 of file pg_list.h.

◆ llast_node

#define llast_node	(	type,
		l
	)	castNode(type, llast(l))

Definition at line 202 of file pg_list.h.

◆ llast_oid

#define llast_oid ( l ) lfirst_oid(list_last_cell(l))

Definition at line 200 of file pg_list.h.

◆ llast_xid

#define llast_xid ( l ) lfirst_xid(list_last_cell(l))

Definition at line 201 of file pg_list.h.

◆ lsecond

#define lsecond ( l ) lfirst(list_nth_cell(l, 1))

Definition at line 183 of file pg_list.h.

◆ lsecond_int

#define lsecond_int ( l ) lfirst_int(list_nth_cell(l, 1))

Definition at line 184 of file pg_list.h.

◆ lsecond_node

#define lsecond_node	(	type,
		l
	)	castNode(type, lsecond(l))

Definition at line 186 of file pg_list.h.

◆ lsecond_oid

#define lsecond_oid ( l ) lfirst_oid(list_nth_cell(l, 1))

Definition at line 185 of file pg_list.h.

◆ lthird

#define lthird ( l ) lfirst(list_nth_cell(l, 2))

Definition at line 188 of file pg_list.h.

◆ lthird_int

#define lthird_int ( l ) lfirst_int(list_nth_cell(l, 2))

Definition at line 189 of file pg_list.h.

◆ lthird_node

#define lthird_node	(	type,
		l
	)	castNode(type, lthird(l))

Definition at line 191 of file pg_list.h.

◆ lthird_oid

#define lthird_oid ( l ) lfirst_oid(list_nth_cell(l, 2))

Definition at line 190 of file pg_list.h.

◆ multi_for_advance_cell

#define multi_for_advance_cell	(	cell,
		state,
		l,
		i
	)

Value:

(cell = (state.l != NIL && state.i < state.l->length) ? \

&state.l->elements[state.i] : NULL)

state

Definition regguts.h:323

Definition at line 525 of file pg_list.h.

527 : NULL)

◆ NIL

#define NIL ((List *) NULL)

Definition at line 68 of file pg_list.h.

Typedef Documentation

◆ ForBothCellState

typedef struct ForBothCellState ForBothCellState

◆ ForBothState

typedef struct ForBothState ForBothState

◆ ForEachState

typedef struct ForEachState ForEachState

◆ ForFiveState

typedef struct ForFiveState ForFiveState

◆ ForFourState

typedef struct ForFourState ForFourState

◆ ForThreeState

typedef struct ForThreeState ForThreeState

◆ List

typedef struct List List

◆ list_sort_comparator

typedef int(* list_sort_comparator) (const ListCell *a, const ListCell *b)

Definition at line 680 of file pg_list.h.

◆ ListCell

typedef union ListCell ListCell

Function Documentation

◆ for_both_cell_setup()

static ForBothCellState for_both_cell_setup	(	const List *	list1,
		const ListCell *	initcell1,
		const List *	list2,
		const ListCell *	initcell2
	)

inlinestatic

Definition at line 549 of file pg_list.h.

{
    ForBothCellState r = {list1, list2,
        initcell1 ? list_cell_number(list1, initcell1) : list_length(list1),
    initcell2 ? list_cell_number(list2, initcell2) : list_length(list2)};
 
    return r;
}

References fb(), list_cell_number(), and list_length().

◆ for_each_cell_setup()

static ForEachState for_each_cell_setup	(	const List *	lst,
		const ListCell *	initcell
	)

inlinestatic

Definition at line 447 of file pg_list.h.

{
    ForEachState r = {lst,
    initcell ? list_cell_number(lst, initcell) : list_length(lst)};
 
    return r;
}

References fb(), list_cell_number(), and list_length().

◆ for_each_from_setup()

static ForEachState for_each_from_setup	(	const List *	lst,
		int	N
	)

inlinestatic

Definition at line 423 of file pg_list.h.

{
    ForEachState r = {lst, N};
 
    Assert(N >= 0);
    return r;
}

References Assert, and fb().

◆ lappend()

pg_nodiscard List * lappend	(	List *	list,
		void *	datum
	)

extern

Definition at line 339 of file list.c.

{
    Assert(IsPointerList(list));
 
    if (list == NIL)
        list = new_list(T_List, 1);
    else
        new_tail_cell(list);
 
    llast(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsPointerList, llast, new_list(), new_tail_cell(), and NIL.

◆ lappend_int()

pg_nodiscard List * lappend_int	(	List *	list,
		int	datum
	)

extern

Definition at line 357 of file list.c.

{
    Assert(IsIntegerList(list));
 
    if (list == NIL)
        list = new_list(T_IntList, 1);
    else
        new_tail_cell(list);
 
    llast_int(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsIntegerList, llast_int, new_list(), new_tail_cell(), and NIL.

Referenced by add_merged_range_bounds(), addRangeTableEntryForCTE(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), addRangeTableEntryForGroup(), addRangeTableEntryForSubquery(), AddRelationNotNullConstraints(), adjust_inherited_attnums(), adjust_partition_colnos_using_map(), analyzeCTETargetList(), ATRewriteTable(), build_merged_partition_bounds(), build_subplan(), checkInsertTargets(), convert_EXISTS_to_ANY(), copy_sequences(), CopyGetAttnums(), create_grouping_expr_infos(), deparseAnalyzeSql(), deparseExplicitTargetList(), deparseTargetList(), dependencies_scalar(), ExecBuildAggTrans(), ExecBuildGroupingEqual(), ExecBuildHash32Expr(), ExecBuildParamSetEqual(), ExecConstraints(), ExecInitExprRec(), ExecInitJsonExpr(), ExecInitModifyTable(), ExecInitPartitionInfo(), ExecInitQual(), ExecInitSubscriptingRef(), expand_indexqual_rowcompare(), extract_update_targetlist_colnos(), extractRemainingColumns(), fetch_statentries_for_relation(), finalize_grouping_exprs_walker(), find_all_inheritors(), find_compatible_agg(), fix_expr_common(), gen_partprune_steps_internal(), generate_subquery_params(), grouping_planner(), list_append_unique_int(), list_concat_unique_int(), list_difference_int(), list_intersection_int(), list_union_int(), match_pathkeys_to_index(), merge_list_bounds(), ndistinct_scalar(), nodeRead(), plan_union_children(), postgresBeginForeignInsert(), postgresPlanForeignModify(), rel_is_distinct_for(), remap_to_groupclause_idx(), RemoveInheritance(), reorder_grouping_sets(), rewriteSearchAndCycle(), set_plan_refs(), split_pathtarget_at_srfs_extended(), SS_process_ctes(), substitute_grouped_columns_mutator(), TerminateOtherDBBackends(), test_bms_overlap_list(), transformDistinctOnClause(), transformFromClauseItem(), transformGroupClauseList(), transformInsertStmt(), transformJsonTableColumns(), transformRangeTableFunc(), transformSetOperationTree(), and transformValuesClause().

◆ lappend_oid()

pg_nodiscard List * lappend_oid	(	List *	list,
		Oid	datum
	)

extern

Definition at line 375 of file list.c.

{
    Assert(IsOidList(list));
 
    if (list == NIL)
        list = new_list(T_OidList, 1);
    else
        new_tail_cell(list);
 
    llast_oid(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsOidList, llast_oid, new_list(), new_tail_cell(), and NIL.

Referenced by add_rte_to_flat_rtable(), addRangeTableEntryForCTE(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), addRangeTableEntryForGroup(), addRangeTableEntryForSubquery(), AfterTriggerSetState(), AlterTableMoveAll(), analyzeCTETargetList(), apply_handle_truncate(), ApplyExtensionUpdates(), assign_collations_walker(), assign_param_for_placeholdervar(), assign_param_for_var(), assign_special_exec_param(), ATExecMergePartitions(), binary_upgrade_create_empty_extension(), check_functional_grouping(), CheckAttributeType(), CloneFkReferenced(), CloneFkReferencing(), compute_semijoin_info(), convert_EXISTS_to_ANY(), create_hashjoin_plan(), create_indexscan_plan(), CreateExtensionInternal(), CreateFunction(), DefineRelation(), DetachPartitionFinalize(), do_autovacuum(), EventTriggerCommonSetup(), ExecAlterDefaultPrivilegesStmt(), ExecInitPartitionInfo(), ExecInsertIndexTuples(), ExecuteGrantStmt(), ExecuteTruncate(), ExecuteTruncateGuts(), expand_indexqual_rowcompare(), extract_query_dependencies_walker(), ExtractExtensionList(), finalNamespacePath(), find_all_inheritors(), find_inheritance_children_extended(), find_typed_table_dependencies(), fireRIRrules(), fix_expr_common(), generate_new_exec_param(), get_index_ref_constraints(), get_mergejoin_opfamilies(), get_partition_ancestors_worker(), get_steps_using_prefix_recurse(), GetAllPublicationRelations(), GetAllTablesPublications(), getAutoExtensionsOfObject(), getOwnedSequences_internal(), GetParentedForeignKeyRefs(), GetPublicationSchemas(), GetPubPartitionOptionRelations(), GetRelationPublications(), getRelationsInNamespace(), GetSchemaPublicationRelations(), GetSchemaPublications(), heap_truncate_check_FKs(), heap_truncate_find_FKs(), index_concurrently_swap(), infer_arbiter_indexes(), InitConflictIndexes(), inline_function(), interpret_function_parameter_list(), list_append_unique_oid(), list_concat_unique_oid(), list_difference_oid(), list_union_oid(), LockViewRecurse(), logicalrep_read_truncate(), make_row_comparison_op(), nodeRead(), objectNamesToOids(), objectsInSchemaToOids(), oid_array_to_list(), OpenTableList(), paraminfo_get_equal_hashops(), PreCommit_on_commit_actions(), preprocessNamespacePath(), query_to_oid_list(), ReindexMultipleTables(), ReindexPartitions(), ReindexRelationConcurrently(), rel_is_distinct_for(), relation_is_updatable(), RelationGetIndexList(), RelationGetStatExtList(), RememberConstraintForRebuilding(), RememberIndexForRebuilding(), RememberStatisticsForRebuilding(), remove_dbtablespaces(), replace_outer_agg(), replace_outer_grouping(), replace_outer_merge_support(), replace_outer_returning(), RestoreReindexState(), rewriteSearchAndCycle(), roles_list_append(), roleSpecsToIds(), transformAggregateCall(), transformInsertStmt(), transformJsonTableColumns(), transformPartitionCmdForMerge(), transformRangeTableFunc(), transformSetOperationTree(), transformValuesClause(), TryReuseForeignKey(), and typeInheritsFrom().

◆ lappend_xid()

pg_nodiscard List * lappend_xid	(	List *	list,
		TransactionId	datum
	)

extern

Definition at line 393 of file list.c.

{
    Assert(IsXidList(list));
 
    if (list == NIL)
        list = new_list(T_XidList, 1);
    else
        new_tail_cell(list);
 
    llast_xid(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsXidList, llast_xid, new_list(), new_tail_cell(), and NIL.

Referenced by nodeRead(), pa_start_subtrans(), and set_schema_sent_in_streamed_txn().

◆ lcons()

pg_nodiscard List * lcons	(	void *	datum,
		List *	list
	)

extern

Definition at line 495 of file list.c.

{
    Assert(IsPointerList(list));
 
    if (list == NIL)
        list = new_list(T_List, 1);
    else
        new_head_cell(list);
 
    linitial(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsPointerList, linitial, new_head_cell(), new_list(), and NIL.

Referenced by build_minmax_path(), checkWellFormedRecursionWalker(), consider_groupingsets_paths(), CreateExprContextInternal(), CreateLockFile(), ExecInitModifyTable(), expandTableLikeClause(), ExplainNode(), ExplainSubPlans(), extract_rollup_sets(), find_expr_references_walker(), find_update_path(), generateSerialExtraStmts(), get_name_for_var_field(), get_object_address_rv(), get_query_def(), get_relation_info(), get_rule_expr(), gistEmptyAllBuffers(), gistFindPath(), gistGetNodeBuffer(), gistPushItupToNodeBuffer(), load_domaintype_info(), pg_get_object_address(), plan_union_children(), PLy_subtransaction_enter(), PrepareClientEncoding(), push_child_plan(), pushOperator(), pushStop(), pushValue_internal(), readTimeLineHistory(), register_on_commit_action(), RelationBuildRowSecurity(), RelationCacheInvalidate(), RememberConstraintForRebuilding(), reorder_grouping_sets(), RewriteQuery(), rewriteSearchAndCycle(), rewriteTargetView(), sepgsql_avc_compute(), set_cheapest(), show_agg_keys(), show_group_keys(), show_window_def(), sort_inner_and_outer(), transformCaseExpr(), and WalkInnerWith().

◆ lcons_int()

pg_nodiscard List * lcons_int	(	int	datum,
		List *	list
	)

extern

Definition at line 513 of file list.c.

{
    Assert(IsIntegerList(list));
 
    if (list == NIL)
        list = new_list(T_IntList, 1);
    else
        new_head_cell(list);
 
    linitial_int(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsIntegerList, linitial_int, new_head_cell(), new_list(), and NIL.

Referenced by ExecInitAgg(), ExplainBeginOutput(), ExplainOpenGroup(), ExplainOpenSetAsideGroup(), ExplainRestoreGroup(), and PutMemoryContextsStatsTupleStore().

◆ lcons_oid()

pg_nodiscard List * lcons_oid	(	Oid	datum,
		List *	list
	)

extern

Definition at line 531 of file list.c.

{
    Assert(IsOidList(list));
 
    if (list == NIL)
        list = new_list(T_OidList, 1);
    else
        new_head_cell(list);
 
    linitial_oid(list) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, fb(), IsOidList, linitial_oid, new_head_cell(), new_list(), and NIL.

Referenced by finalNamespacePath(), pg_partition_ancestors(), ReindexMultipleTables(), and RememberConstraintForRebuilding().

◆ list_append_unique()

pg_nodiscard List * list_append_unique	(	List *	list,
		void *	datum
	)

extern

Definition at line 1343 of file list.c.

{
    if (list_member(list, datum))
        return list;
    else
        return lappend(list, datum);
}

References lappend(), and list_member().

Referenced by add_security_quals(), add_with_check_options(), check_publications_origin_sequences(), check_publications_origin_tables(), create_agg_clause_infos(), and create_index_paths().

◆ list_append_unique_int()

pg_nodiscard List * list_append_unique_int	(	List *	list,
		int	datum
	)

extern

Definition at line 1368 of file list.c.

{
    if (list_member_int(list, datum))
        return list;
    else
        return lappend_int(list, datum);
}

References lappend_int(), and list_member_int().

◆ list_append_unique_oid()

pg_nodiscard List * list_append_unique_oid	(	List *	list,
		Oid	datum
	)

extern

Definition at line 1380 of file list.c.

{
    if (list_member_oid(list, datum))
        return list;
    else
        return lappend_oid(list, datum);
}

References lappend_oid(), and list_member_oid().

Referenced by AlterConstrTriggerDeferrability(), btvalidate(), DropRole(), hashvalidate(), heap_truncate_find_FKs(), LogicalRepWorkersWakeupAtCommit(), map_sql_typecoll_to_xmlschema_types(), and ObjectsInPublicationToOids().

◆ list_append_unique_ptr()

pg_nodiscard List * list_append_unique_ptr	(	List *	list,
		void *	datum
	)

extern

Definition at line 1356 of file list.c.

{
    if (list_member_ptr(list, datum))
        return list;
    else
        return lappend(list, datum);
}

References lappend(), and list_member_ptr().

Referenced by get_useful_ecs_for_relation(), match_join_clauses_to_index(), postgresGetForeignPaths(), subbuild_joinrel_joinlist(), and subbuild_joinrel_restrictlist().

◆ list_cell_number()

static int list_cell_number	(	const List *	l,
		const ListCell *	c
	)

inlinestatic

Definition at line 333 of file pg_list.h.

{
    Assert(c >= &l->elements[0] && c < &l->elements[l->length]);
    return c - l->elements;
}

References Assert, List::elements, fb(), and List::length.

Referenced by for_both_cell_setup(), for_each_cell_setup(), push_ancestor_plan(), subquery_planner(), and SyncPostCheckpoint().

◆ list_concat()

pg_nodiscard List * list_concat	(	List *	list1,
		const List *	list2
	)

extern

Definition at line 561 of file list.c.

{
    int         new_len;
 
    if (list1 == NIL)
        return list_copy(list2);
    if (list2 == NIL)
        return list1;
 
    Assert(list1->type == list2->type);
 
    new_len = list1->length + list2->length;
    /* Enlarge array if necessary */
    if (new_len > list1->max_length)
        enlarge_list(list1, new_len);
 
    /* Even if list1 == list2, using memcpy should be safe here */
    memcpy(&list1->elements[list1->length], &list2->elements[0],
           list2->length * sizeof(ListCell));
    list1->length = new_len;
 
    check_list_invariants(list1);
    return list1;
}

References Assert, check_list_invariants, enlarge_list(), fb(), list_copy(), and NIL.

Referenced by accumulate_append_subpath(), add_predicate_to_index_quals(), addRangeTableEntryForJoin(), addRangeTableEntryForTableFunc(), ATParseTransformCmd(), ATPostAlterTypeParse(), AtSubCommit_Notify(), build_joinrel_restrictlist(), build_paths_for_OR(), calculate_partition_bound_for_merge(), check_index_predicates(), choose_bitmap_and(), clean_up_removed_plan_level(), CombineRangeTables(), consider_groupingsets_paths(), ConstraintImpliedByRelConstraint(), cost_index(), create_agg_clause_infos(), create_append_path(), create_append_plan(), create_bitmap_subplan(), create_index_paths(), create_join_plan(), deconstruct_distribute(), deconstruct_recurse(), DefineRelation(), deparseDirectDeleteSql(), deparseDirectUpdateSql(), deparseFromExprForRel(), ec_add_derived_clauses(), estimate_multivariate_bucketsize(), estimate_path_cost_size(), expand_groupingset_node(), ExpandAllTables(), expandRTE(), extract_or_clause(), extract_rollup_sets(), fileBeginForeignScan(), fileGetOptions(), find_indexpath_quals(), find_mergeclauses_for_outer_pathkeys(), fireRIRrules(), flatten_grouping_sets(), foreign_grouping_ok(), foreign_join_ok(), gen_partprune_steps_internal(), gen_prune_steps_from_opexps(), generate_bitmap_or_paths(), generate_join_implied_equalities(), generate_join_implied_equalities_for_ecs(), generate_join_implied_equalities_normal(), generate_partition_qual(), get_baserel_parampathinfo(), get_batch_size_option(), get_foreign_key_join_selectivity(), get_from_clause_item(), get_index_paths(), get_join_index_paths(), get_joinrel_parampathinfo(), get_relation_constraints(), get_rels_with_domain(), get_steps_using_prefix_recurse(), GetAllSchemaPublicationRelations(), GetPubPartitionOptionRelations(), is_parallel_safe(), objectsInSchemaToOids(), optimize_window_clauses(), paraminfo_get_equal_hashops(), PrepareForIncrementalBackup(), process_equivalence(), process_sublinks_mutator(), ProcessUtilitySlow(), pull_ands(), pull_ors(), pull_up_simple_subquery(), reduce_unique_semijoins(), remove_self_join_rel(), remove_self_joins_one_group(), remove_useless_results_recurse(), reorder_grouping_sets(), RewriteQuery(), rewriteRuleAction(), rewriteTargetListIU(), selectColorTrigrams(), set_joinrel_partition_key_exprs(), set_plan_refs(), split_pathtarget_at_srfs_extended(), split_pathtarget_walker(), subquery_planner(), TidQualFromRestrictInfoList(), transformAExprIn(), transformAlterTableStmt(), transformCreateSchemaStmtElements(), transformCreateStmt(), transformExpressionList(), transformFromClause(), transformFromClauseItem(), transformIndexConstraints(), transformTableLikeClause(), transformTargetList(), TS_execute_locations_recurse(), and vacuum().

◆ list_concat_copy()

pg_nodiscard List * list_concat_copy	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 598 of file list.c.

{
    List       *result;
    int         new_len;
 
    if (list1 == NIL)
        return list_copy(list2);
    if (list2 == NIL)
        return list_copy(list1);
 
    Assert(list1->type == list2->type);
 
    new_len = list1->length + list2->length;
    result = new_list(list1->type, new_len);
    memcpy(result->elements, list1->elements,
           list1->length * sizeof(ListCell));
    memcpy(result->elements + list1->length, list2->elements,
           list2->length * sizeof(ListCell));
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, List::elements, fb(), list_copy(), new_list(), and NIL.

Referenced by add_function_defaults(), ATExecAttachPartition(), btadjustmembers(), build_paths_for_OR(), choose_bitmap_and(), cost_subqueryscan(), create_scan_plan(), DefineIndex(), gen_partprune_steps(), generate_bitmap_or_paths(), get_parameterized_baserel_size(), hashadjustmembers(), max_parallel_hazard_walker(), preprocess_targetlist(), process_matched_tle(), set_joinrel_partition_key_exprs(), simplify_and_arguments(), and simplify_or_arguments().

◆ list_concat_unique()

pg_nodiscard List * list_concat_unique	(	List *	list1,
		const List *	list2
	)

extern

Definition at line 1405 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    foreach(cell, list2)
    {
        if (!list_member(list1, lfirst(cell)))
            list1 = lappend(list1, lfirst(cell));
    }
 
    check_list_invariants(list1);
    return list1;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, and list_member().

Referenced by create_bitmap_subplan(), and select_active_windows().

◆ list_concat_unique_int()

pg_nodiscard List * list_concat_unique_int	(	List *	list1,
		const List *	list2
	)

extern

Definition at line 1448 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsIntegerList(list1));
    Assert(IsIntegerList(list2));
 
    foreach(cell, list2)
    {
        if (!list_member_int(list1, lfirst_int(cell)))
            list1 = lappend_int(list1, lfirst_int(cell));
    }
 
    check_list_invariants(list1);
    return list1;
}

References Assert, check_list_invariants, fb(), IsIntegerList, lappend_int(), lfirst_int, and list_member_int().

◆ list_concat_unique_oid()

pg_nodiscard List * list_concat_unique_oid	(	List *	list1,
		const List *	list2
	)

extern

Definition at line 1469 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsOidList(list1));
    Assert(IsOidList(list2));
 
    foreach(cell, list2)
    {
        if (!list_member_oid(list1, lfirst_oid(cell)))
            list1 = lappend_oid(list1, lfirst_oid(cell));
    }
 
    check_list_invariants(list1);
    return list1;
}

References Assert, check_list_invariants, fb(), IsOidList, lappend_oid(), lfirst_oid, and list_member_oid().

Referenced by AlterPublicationOptions(), GetSchemaPublicationRelations(), InvalidatePubRelSyncCache(), pg_get_publication_tables(), and RelationBuildPublicationDesc().

◆ list_concat_unique_ptr()

pg_nodiscard List * list_concat_unique_ptr	(	List *	list1,
		const List *	list2
	)

extern

Definition at line 1427 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    foreach(cell, list2)
    {
        if (!list_member_ptr(list1, lfirst(cell)))
            list1 = lappend(list1, lfirst(cell));
    }
 
    check_list_invariants(list1);
    return list1;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, and list_member_ptr().

Referenced by get_useful_pathkeys_for_distinct(), and group_keys_reorder_by_pathkeys().

◆ list_copy()

pg_nodiscard List * list_copy ( const List * oldlist )

extern

Definition at line 1573 of file list.c.

{
    List       *newlist;
 
    if (oldlist == NIL)
        return NIL;
 
    newlist = new_list(oldlist->type, oldlist->length);
    memcpy(newlist->elements, oldlist->elements,
           newlist->length * sizeof(ListCell));
 
    check_list_invariants(newlist);
    return newlist;
}

References check_list_invariants, fb(), new_list(), and NIL.

Referenced by addRangeTableEntryForCTE(), adjust_group_pathkeys_for_groupagg(), arrayconst_startup_fn(), arrayexpr_startup_fn(), build_subplan(), check_index_predicates(), check_publications(), consider_groupingsets_paths(), ConstraintImpliedByRelConstraint(), copy_pathtarget(), copyObjectImpl(), CopySearchPathMatcher(), create_nestloop_plan(), estimate_multivariate_bucketsize(), EventTriggerCollectGrant(), ExecuteTruncateGuts(), expression_tree_mutator_impl(), fetch_search_path(), foreign_join_ok(), generate_bitmap_or_paths(), generate_mergejoin_paths(), generateSerialExtraStmts(), get_eclass_for_sort_expr(), get_foreign_key_join_selectivity(), get_query_def(), get_required_extension(), get_steps_using_prefix_recurse(), get_switched_clauses(), get_useful_pathkeys_for_relation(), GetSearchPathMatcher(), heap_truncate_find_FKs(), list_concat(), list_concat_copy(), list_difference(), list_difference_int(), list_difference_oid(), list_difference_ptr(), list_union(), list_union_int(), list_union_oid(), list_union_ptr(), merge_publications(), plpgsql_parse_cwordtype(), preprocess_groupclause(), recomputeNamespacePath(), RelationGetIndexList(), RelationGetStatExtList(), remove_leftjoinrel_from_query(), remove_self_join_rel(), reorder_grouping_sets(), roles_is_member_of(), select_active_windows(), select_outer_pathkeys_for_merge(), set_joinrel_partition_key_exprs(), set_using_names(), SetReindexPending(), simplify_and_arguments(), simplify_or_arguments(), sort_inner_and_outer(), standard_qp_callback(), transformPLAssignStmt(), transformWithClause(), and WalSummariesAreComplete().

◆ list_copy_deep()

pg_nodiscard List * list_copy_deep ( const List * oldlist )

extern

Definition at line 1639 of file list.c.

{
    List       *newlist;
 
    if (oldlist == NIL)
        return NIL;
 
    /* This is only sensible for pointer Lists */
    Assert(IsA(oldlist, List));
 
    newlist = new_list(oldlist->type, oldlist->length);
    for (int i = 0; i < newlist->length; i++)
        lfirst(&newlist->elements[i]) =
            copyObjectImpl(lfirst(&oldlist->elements[i]));
 
    check_list_invariants(newlist);
    return newlist;
}

References Assert, check_list_invariants, copyObjectImpl(), fb(), i, IsA, lfirst, new_list(), and NIL.

Referenced by copyObjectImpl().

◆ list_copy_head()

pg_nodiscard List * list_copy_head	(	const List *	oldlist,
		int	len
	)

extern

Definition at line 1593 of file list.c.

{
    List       *newlist;
 
    if (oldlist == NIL || len <= 0)
        return NIL;
 
    len = Min(oldlist->length, len);
 
    newlist = new_list(oldlist->type, len);
    memcpy(newlist->elements, oldlist->elements, len * sizeof(ListCell));
 
    check_list_invariants(newlist);
    return newlist;
}

References check_list_invariants, fb(), len, Min, new_list(), and NIL.

Referenced by accumulate_append_subpath(), build_index_paths(), create_agg_path(), create_append_plan(), create_merge_append_plan(), does_not_exist_skipping(), expand_indexqual_rowcompare(), gather_grouping_paths(), get_object_address_attrdef(), get_object_address_attribute(), get_object_address_opf_member(), get_object_address_relobject(), get_useful_pathkeys_for_relation(), group_keys_reorder_by_pathkeys(), owningrel_does_not_exist_skipping(), process_owned_by(), select_outer_pathkeys_for_merge(), and truncate_useless_pathkeys().

◆ list_copy_tail()

pg_nodiscard List * list_copy_tail	(	const List *	oldlist,
		int	nskip
	)

extern

Definition at line 1613 of file list.c.

{
    List       *newlist;
 
    if (nskip < 0)
        nskip = 0;              /* would it be better to elog? */
 
    if (oldlist == NIL || nskip >= oldlist->length)
        return NIL;
 
    newlist = new_list(oldlist->type, oldlist->length - nskip);
    memcpy(newlist->elements, &oldlist->elements[nskip],
           newlist->length * sizeof(ListCell));
 
    check_list_invariants(newlist);
    return newlist;
}

References check_list_invariants, fb(), new_list(), and NIL.

Referenced by accumulate_append_subpath(), addRangeTableEntryForJoin(), addRangeTableEntryForTableFunc(), does_not_exist_skipping(), expandRTE(), get_name_for_var_field(), get_object_address_opcf(), ParseFuncOrColumn(), push_ancestor_plan(), and transformAggregateCall().

◆ list_deduplicate_oid()

void list_deduplicate_oid ( List * list )

extern

Definition at line 1495 of file list.c.

{
    int         len;
 
    Assert(IsOidList(list));
    len = list_length(list);
    if (len > 1)
    {
        ListCell   *elements = list->elements;
        int         i = 0;
 
        for (int j = 1; j < len; j++)
        {
            if (elements[i].oid_value != elements[j].oid_value)
                elements[++i].oid_value = elements[j].oid_value;
        }
        list->length = i + 1;
    }
    check_list_invariants(list);
}

References Assert, check_list_invariants, i, IsOidList, j, len, list_length(), and ListCell::oid_value.

Referenced by GetPublicationRelations(), and heap_truncate_find_FKs().

◆ list_delete()

pg_nodiscard List * list_delete	(	List *	list,
		void *	datum
	)

extern

Definition at line 853 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsPointerList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (equal(lfirst(cell), datum))
            return list_delete_cell(list, cell);
    }
 
    /* Didn't find a match: return the list unmodified */
    return list;
}

References Assert, check_list_invariants, equal(), IsPointerList, lfirst, and list_delete_cell().

Referenced by check_publications(), generate_bitmap_or_paths(), injection_points_detach(), postgresGetForeignPlan(), and unregister_ENR().

◆ list_delete_cell()

pg_nodiscard List * list_delete_cell	(	List *	list,
		ListCell *	cell
	)

extern

Definition at line 841 of file list.c.

{
    return list_delete_nth_cell(list, cell - list->elements);
}

References list_delete_nth_cell().

Referenced by deleteSplitPartitionContext(), list_delete(), list_delete_int(), list_delete_oid(), list_delete_ptr(), MergePartitionsMoveRows(), remove_useless_joins(), simplify_EXISTS_query(), and transformGenericOptions().

◆ list_delete_first()

pg_nodiscard List * list_delete_first ( List * list )

extern

Definition at line 943 of file list.c.

{
    check_list_invariants(list);
 
    if (list == NIL)
        return NIL;             /* would an error be better? */
 
    return list_delete_nth_cell(list, 0);
}

References check_list_invariants, list_delete_nth_cell(), and NIL.

Referenced by checkWellFormedRecursionWalker(), CopyMultiInsertInfoFlush(), ExplainCloseGroup(), ExplainEndOutput(), ExplainNode(), ExplainSaveGroup(), ExplainSubPlans(), fetch_search_path(), find_expr_references_walker(), get_rule_expr(), GetSearchPathMatcher(), gistEmptyAllBuffers(), gistFindPath(), gistProcessEmptyingQueue(), jsonb_path_query_internal(), plan_union_children(), PLy_abort_open_subtransactions(), PLy_subtransaction_exit(), pop_child_plan(), ProcessUtilitySlow(), show_agg_keys(), show_group_keys(), show_window_def(), simplify_and_arguments(), simplify_or_arguments(), transformPLAssignStmt(), transformWithClause(), and WalkInnerWith().

◆ list_delete_first_n()

pg_nodiscard List * list_delete_first_n	(	List *	list,
		int	n
	)

extern

Definition at line 983 of file list.c.

{
    check_list_invariants(list);
 
    /* No-op request? */
    if (n <= 0)
        return list;
 
    /* Delete whole list? */
    if (n >= list_length(list))
    {
        list_free(list);
        return NIL;
    }
 
    /*
     * Otherwise, we normally just collapse out the removed elements.  But for
     * debugging purposes, move the whole list contents someplace else.
     *
     * (Note that we *must* keep the contents in the same memory context.)
     */
#ifndef DEBUG_LIST_MEMORY_USAGE
    memmove(&list->elements[0], &list->elements[n],
            (list->length - n) * sizeof(ListCell));
    list->length -= n;
#else
    {
        ListCell   *newelems;
        int         newmaxlen = list->length - n;
 
        newelems = (ListCell *)
            MemoryContextAlloc(GetMemoryChunkContext(list),
                               newmaxlen * sizeof(ListCell));
        memcpy(newelems, &list->elements[n], newmaxlen * sizeof(ListCell));
        if (list->elements != list->initial_elements)
            pfree(list->elements);
        else
        {
            /*
             * As in enlarge_list(), clear the initial_elements[] space and/or
             * mark it inaccessible.
             */
#ifdef CLOBBER_FREED_MEMORY
            wipe_mem(list->initial_elements,
                     list->max_length * sizeof(ListCell));
#else
            VALGRIND_MAKE_MEM_NOACCESS(list->initial_elements,
                                       list->max_length * sizeof(ListCell));
#endif
        }
        list->elements = newelems;
        list->max_length = newmaxlen;
        list->length = newmaxlen;
        check_list_invariants(list);
    }
#endif
 
    return list;
}

References check_list_invariants, fb(), GetMemoryChunkContext(), list_free(), list_length(), MemoryContextAlloc(), NIL, pfree(), and VALGRIND_MAKE_MEM_NOACCESS.

Referenced by add_function_defaults(), func_get_detail(), and SyncPostCheckpoint().

◆ list_delete_int()

pg_nodiscard List * list_delete_int	(	List *	list,
		int	datum
	)

extern

Definition at line 891 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsIntegerList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst_int(cell) == datum)
            return list_delete_cell(list, cell);
    }
 
    /* Didn't find a match: return the list unmodified */
    return list;
}

References Assert, check_list_invariants, IsIntegerList, lfirst_int, and list_delete_cell().

Referenced by reorder_grouping_sets().

◆ list_delete_last()

pg_nodiscard List * list_delete_last ( List * list )

extern

Definition at line 957 of file list.c.

{
    check_list_invariants(list);
 
    if (list == NIL)
        return NIL;             /* would an error be better? */
 
    /* list_truncate won't free list if it goes to empty, but this should */
    if (list_length(list) <= 1)
    {
        list_free(list);
        return NIL;
    }
 
    return list_truncate(list, list_length(list) - 1);
}

References check_list_invariants, list_free(), list_length(), list_truncate(), and NIL.

Referenced by agg_refill_hash_table(), CheckAttributeType(), create_unique_paths(), fireRIRrules(), inline_function(), LockViewRecurse(), plpgsql_parse_cwordtype(), relation_is_updatable(), RewriteQuery(), transformMultiAssignRef(), and transformOnConflictClause().

◆ list_delete_nth_cell()

pg_nodiscard List * list_delete_nth_cell	(	List *	list,
		int	n
	)

extern

Definition at line 767 of file list.c.

{
    check_list_invariants(list);
 
    Assert(n >= 0 && n < list->length);
 
    /*
     * If we're about to delete the last node from the list, free the whole
     * list instead and return NIL, which is the only valid representation of
     * a zero-length list.
     */
    if (list->length == 1)
    {
        list_free(list);
        return NIL;
    }
 
    /*
     * Otherwise, we normally just collapse out the removed element.  But for
     * debugging purposes, move the whole list contents someplace else.
     *
     * (Note that we *must* keep the contents in the same memory context.)
     */
#ifndef DEBUG_LIST_MEMORY_USAGE
    memmove(&list->elements[n], &list->elements[n + 1],
            (list->length - 1 - n) * sizeof(ListCell));
    list->length--;
#else
    {
        ListCell   *newelems;
        int         newmaxlen = list->length - 1;
 
        newelems = (ListCell *)
            MemoryContextAlloc(GetMemoryChunkContext(list),
                               newmaxlen * sizeof(ListCell));
        memcpy(newelems, list->elements, n * sizeof(ListCell));
        memcpy(&newelems[n], &list->elements[n + 1],
               (list->length - 1 - n) * sizeof(ListCell));
        if (list->elements != list->initial_elements)
            pfree(list->elements);
        else
        {
            /*
             * As in enlarge_list(), clear the initial_elements[] space and/or
             * mark it inaccessible.
             */
#ifdef CLOBBER_FREED_MEMORY
            wipe_mem(list->initial_elements,
                     list->max_length * sizeof(ListCell));
#else
            VALGRIND_MAKE_MEM_NOACCESS(list->initial_elements,
                                       list->max_length * sizeof(ListCell));
#endif
        }
        list->elements = newelems;
        list->max_length = newmaxlen;
        list->length--;
        check_list_invariants(list);
    }
#endif
 
    return list;
}

References Assert, check_list_invariants, fb(), GetMemoryChunkContext(), list_free(), MemoryContextAlloc(), NIL, pfree(), and VALGRIND_MAKE_MEM_NOACCESS.

Referenced by AddRelationNotNullConstraints(), list_delete_cell(), list_delete_first(), MergeAttributes(), process_equivalence(), reconsider_full_join_clause(), and sort_inner_and_outer().

◆ list_delete_oid()

pg_nodiscard List * list_delete_oid	(	List *	list,
		Oid	datum
	)

extern

Definition at line 910 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsOidList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst_oid(cell) == datum)
            return list_delete_cell(list, cell);
    }
 
    /* Didn't find a match: return the list unmodified */
    return list;
}

References Assert, check_list_invariants, IsOidList, lfirst_oid, and list_delete_cell().

Referenced by RemoveReindexPending().

◆ list_delete_ptr()

pg_nodiscard List * list_delete_ptr	(	List *	list,
		void *	datum
	)

extern

Definition at line 872 of file list.c.

{
    ListCell   *cell;
 
    Assert(IsPointerList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst(cell) == datum)
            return list_delete_cell(list, cell);
    }
 
    /* Didn't find a match: return the list unmodified */
    return list;
}

References Assert, check_list_invariants, IsPointerList, lfirst, and list_delete_cell().

Referenced by FreeExprContext(), pa_free_worker_info(), remove_join_clause_from_rels(), and remove_self_join_rel().

◆ list_difference()

List * list_difference	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1237 of file list.c.

{
    const ListCell *cell;
    List       *result = NIL;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    if (list2 == NIL)
        return list_copy(list1);
 
    foreach(cell, list1)
    {
        if (!list_member(list2, lfirst(cell)))
            result = lappend(result, lfirst(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, list_copy(), list_member(), and NIL.

Referenced by create_hashjoin_plan(), create_mergejoin_plan(), create_tidscan_plan(), get_useful_group_keys_orderings(), infer_arbiter_indexes(), IsIndexCompatibleAsArbiter(), and process_duplicate_ors().

◆ list_difference_int()

List * list_difference_int	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1288 of file list.c.

{
    const ListCell *cell;
    List       *result = NIL;
 
    Assert(IsIntegerList(list1));
    Assert(IsIntegerList(list2));
 
    if (list2 == NIL)
        return list_copy(list1);
 
    foreach(cell, list1)
    {
        if (!list_member_int(list2, lfirst_int(cell)))
            result = lappend_int(result, lfirst_int(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsIntegerList, lappend_int(), lfirst_int, list_copy(), list_member_int(), and NIL.

Referenced by reorder_grouping_sets().

◆ list_difference_oid()

List * list_difference_oid	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1313 of file list.c.

{
    const ListCell *cell;
    List       *result = NIL;
 
    Assert(IsOidList(list1));
    Assert(IsOidList(list2));
 
    if (list2 == NIL)
        return list_copy(list1);
 
    foreach(cell, list1)
    {
        if (!list_member_oid(list2, lfirst_oid(cell)))
            result = lappend_oid(result, lfirst_oid(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsOidList, lappend_oid(), lfirst_oid, list_copy(), list_member_oid(), and NIL.

Referenced by AlterPublicationSchemas().

◆ list_difference_ptr()

List * list_difference_ptr	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1263 of file list.c.

{
    const ListCell *cell;
    List       *result = NIL;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    if (list2 == NIL)
        return list_copy(list1);
 
    foreach(cell, list1)
    {
        if (!list_member_ptr(list2, lfirst(cell)))
            result = lappend(result, lfirst(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, list_copy(), list_member_ptr(), and NIL.

Referenced by create_bitmap_scan_plan(), ExecuteTruncateGuts(), and get_useful_group_keys_orderings().

◆ list_free()

void list_free ( List * list )

extern

Definition at line 1546 of file list.c.

{
    list_free_private(list, false);
}

References list_free_private().

Referenced by AfterTriggerSetState(), AlterIndexNamespaces(), arrayconst_cleanup_fn(), arrayexpr_cleanup_fn(), ATCheckPartitionsNotInUse(), ATExecChangeOwner(), ATExecMergePartitions(), ATExecSetTableSpace(), build_base_rel_tlists(), build_remote_returning(), BuildRelationExtStatistics(), cachedNamespacePath(), calc_joinrel_size_estimate(), calculate_indexes_size(), calculate_partition_bound_for_merge(), calculate_toast_table_size(), check_createrole_self_grant(), check_datestyle(), check_debug_io_direct(), check_log_connections(), check_log_destination(), check_restrict_nonsystem_relation_kind(), check_search_path(), check_synchronized_standby_slots(), check_temp_tablespaces(), check_wal_consistency_checking(), choose_bitmap_and(), compute_semi_anti_join_factors(), CopyFrom(), CopyMultiInsertBufferFlush(), CopyMultiInsertInfoCleanup(), create_agg_clause_infos(), CreateExtensionInternal(), CreateTriggerFiringOn(), current_schema(), current_schemas(), DefineIndex(), DefineRelation(), deparseFromExprForRel(), dependencies_object_end(), distribute_qual_to_rels(), do_analyze_rel(), do_autovacuum(), DropSubscription(), ec_clear_derived_clauses(), EndCopy(), estimate_multivariate_bucketsize(), EventTriggerDDLCommandEnd(), EventTriggerDDLCommandStart(), EventTriggerOnLogin(), EventTriggerSQLDrop(), EventTriggerTableRewrite(), ExecInitPartitionInfo(), ExecInsert(), ExecOpenIndices(), ExecPendingInserts(), ExecResetTupleTable(), ExecSimpleRelationInsert(), ExecSimpleRelationUpdate(), ExecUpdateEpilogue(), expandTableLikeClause(), extract_lateral_references(), extract_lateral_vars_from_PHVs(), ExtractExtensionList(), find_all_inheritors(), find_compatible_agg(), find_computable_ec_member(), find_hash_columns(), find_placeholders_in_expr(), fix_placeholder_input_needed_levels(), generate_base_implied_equalities_no_const(), generate_bitmap_or_paths(), generate_partitionwise_join_paths(), get_rel_sync_entry(), get_relation_info(), get_relation_statistics(), get_steps_using_prefix_recurse(), get_windowclause_startup_tuples(), getIdentitySequence(), GetTopMostAncestorInPublication(), group_keys_reorder_by_pathkeys(), heap_truncate_find_FKs(), index_concurrently_swap(), index_get_partition(), index_unchanged_by_update(), infer_arbiter_indexes(), is_var_in_aggref_only(), list_delete_first_n(), list_delete_last(), list_delete_nth_cell(), llvm_release_context(), logicalrep_worker_detach(), make_group_input_target(), make_partial_grouping_target(), make_SAOP_expr(), make_sort_input_target(), make_window_input_target(), match_orclause_to_indexcol(), max_parallel_hazard_walker(), merge_list_bounds(), merge_range_bounds(), ndistinct_object_end(), ObjectsInPublicationToOids(), OpenTableList(), paraminfo_get_equal_hashops(), parse_hba_auth_opt(), pg_dependencies_in(), pg_ndistinct_in(), pg_partition_root(), plpgsql_extra_checks_check_hook(), pop_ancestor_plan(), PostmasterMain(), PrepareTempTablespaces(), preprocess_targetlist(), preprocessNamespacePath(), process_implied_equality(), ProcessGUCArray(), processState(), ProcessUtilitySlow(), PutMemoryContextsStatsTupleStore(), qual_is_pushdown_safe(), rebuild_eclass_attr_needed(), rebuild_joinclause_attr_needed(), rebuild_placeholder_attr_needed(), recomputeNamespacePath(), refresh_by_match_merge(), RefreshMatViewByOid(), RelationCacheInvalidate(), RelationDestroyRelation(), RelationGetIndexAttrBitmap(), RelationGetIndexList(), RelationGetPrimaryKeyIndex(), RelationGetReplicaIndex(), RelationGetStatExtList(), relationHasPrimaryKey(), remove_dbtablespaces(), remove_self_join_rel(), reorder_grouping_sets(), reparameterize_pathlist_by_child(), roles_is_member_of(), sepgsql_dml_privileges(), simplify_and_arguments(), simplify_or_arguments(), statext_mcv_clauselist_selectivity(), stringToQualifiedNameList(), test_bms_overlap_list(), textToQualifiedNameList(), toast_open_indexes(), transformFkeyCheckAttrs(), transformFkeyGetPrimaryKey(), transformValuesClause(), triggered_change_notification(), typeInheritsFrom(), update_eclasses(), vac_open_indexes(), and WaitForLockers().

◆ list_free_deep()

void list_free_deep ( List * list )

extern

Definition at line 1560 of file list.c.

{
    /*
     * A "deep" free operation only makes sense on a list of pointers.
     */
    Assert(IsPointerList(list));
    list_free_private(list, true);
}

References Assert, IsPointerList, and list_free_private().

Referenced by AfterTriggerFreeQuery(), check_oauth_validator(), checkSharedDependencies(), CloseTableList(), copy_table(), create_agg_clause_infos(), CreateDatabaseUsingWalLog(), createTableConstraints(), deconstruct_jointree(), deparseDirectDeleteSql(), deparseDirectUpdateSql(), deparseFromExpr(), deparseFromExprForRel(), DetachPartitionFinalize(), estimate_multivariate_bucketsize(), fetch_remote_table_info(), FetchRelationStates(), FreeSubscription(), gettype(), gistbufferinginserttuples(), hashagg_reset_spill_state(), load_libraries(), lookup_proof_cache(), pg_dependencies_in(), pg_ndistinct_in(), pgoutput_row_filter_init(), PostmasterMain(), RelationDestroyRelation(), RelationGetFKeyList(), ReplSlotSyncWorkerMain(), rescanLatestTimeLine(), StartReplication(), SyncPostCheckpoint(), SyncReplicationSlots(), verify_heapam(), WaitForLockersMultiple(), XLogReadDetermineTimeline(), and XLogSendPhysical().

◆ list_head()

static ListCell * list_head ( const List * l )

inlinestatic

Definition at line 128 of file pg_list.h.

{
    return l ? &l->elements[0] : NULL;
}

References List::elements, and fb().

Referenced by add_setop_child_rel_equivalences(), analyzeCTE(), appendTypeNameToBuffer(), arrayexpr_startup_fn(), assign_hypothetical_collations(), ATAddForeignKeyConstraint(), boolexpr_startup_fn(), build_index_tlist(), buildRelationAliases(), CheckRADIUSAuth(), checkWellFormedRecursionWalker(), coerce_record_to_complex(), compare_tlist_datatypes(), ComputeIndexAttrs(), consider_groupingsets_paths(), ConstructTupleDescriptor(), cost_bitmap_and_node(), cost_bitmap_or_node(), create_ctas_nodata(), create_mergejoin_plan(), DefineView(), deparseSubscriptingRef(), deparseTruncateSql(), do_analyze_rel(), dump_getdiag(), eclass_member_iterator_next(), examine_variable(), exec_stmt_raise(), ExecInitJunkFilterConversion(), expand_insert_targetlist(), expandRTE(), extract_rollup_sets(), fix_indexqual_operand(), flatten_set_variable_args(), FormIndexDatum(), FormPartitionKeyDatum(), funcname_signature_string(), gen_prune_steps_from_opexps(), generate_append_tlist(), generate_setop_child_grouplist(), generate_setop_grouplist(), generateClonedIndexStmt(), get_param_path_clause_serials(), get_qual_for_hash(), get_qual_for_range(), get_range_nulltest(), get_steps_using_prefix(), get_update_query_targetlist_def(), GetIndexInputType(), has_partition_attrs(), InitPartitionPruneContext(), intorel_startup(), jsonb_path_query_internal(), list_startup_fn(), make_inner_pathkeys_for_merge(), match_index_to_operand(), NameListToQuotedString(), NameListToString(), parse_hba_line(), parse_ident_line(), perform_pruning_base_step(), pg_get_indexdef_worker(), pg_get_partkeydef_worker(), postprocess_setop_tlist(), PreCommit_Notify(), print_function_arguments(), printSubscripts(), process_startup_options(), query_is_distinct_for(), RelationBuildPartitionKey(), SearchPathMatchesCurrentEnvironment(), SendRowDescriptionMessage(), set_baserel_partition_key_exprs(), setup_eclass_member_iterator(), sort_inner_and_outer(), SplitPartitionMoveRows(), statatt_get_index_expr(), tfuncLoadRows(), tlist_matches_tupdesc(), tlist_same_collations(), tlist_same_datatypes(), transformAssignedExpr(), transformPLAssignStmtTarget(), transformUpdateTargetList(), trim_mergeclauses_for_inner_pathkeys(), try_partitionwise_join(), TypeNameListToString(), and WalkInnerWith().

◆ list_insert_nth()

pg_nodiscard List * list_insert_nth	(	List *	list,
		int	pos,
		void *	datum
	)

extern

Definition at line 439 of file list.c.

{
    if (list == NIL)
    {
        Assert(pos == 0);
        return list_make1(datum);
    }
    Assert(IsPointerList(list));
    lfirst(insert_new_cell(list, pos)) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, insert_new_cell(), IsPointerList, lfirst, list_make1, and NIL.

Referenced by add_partial_path(), add_path(), and merge_clump().

◆ list_insert_nth_int()

pg_nodiscard List * list_insert_nth_int	(	List *	list,
		int	pos,
		int	datum
	)

extern

Definition at line 453 of file list.c.

{
    if (list == NIL)
    {
        Assert(pos == 0);
        return list_make1_int(datum);
    }
    Assert(IsIntegerList(list));
    lfirst_int(insert_new_cell(list, pos)) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, insert_new_cell(), IsIntegerList, lfirst_int, list_make1_int, and NIL.

◆ list_insert_nth_oid()

pg_nodiscard List * list_insert_nth_oid	(	List *	list,
		int	pos,
		Oid	datum
	)

extern

Definition at line 467 of file list.c.

{
    if (list == NIL)
    {
        Assert(pos == 0);
        return list_make1_oid(datum);
    }
    Assert(IsOidList(list));
    lfirst_oid(insert_new_cell(list, pos)) = datum;
    check_list_invariants(list);
    return list;
}

References Assert, check_list_invariants, insert_new_cell(), IsOidList, lfirst_oid, list_make1_oid, and NIL.

◆ list_int_cmp()

int list_int_cmp	(	const ListCell *	p1,
		const ListCell *	p2
	)

extern

Definition at line 1691 of file list.c.

{
    int         v1 = lfirst_int(p1);
    int         v2 = lfirst_int(p2);
 
    return pg_cmp_s32(v1, v2);
}

References fb(), lfirst_int, and pg_cmp_s32().

Referenced by expand_grouping_sets().

◆ list_intersection()

List * list_intersection	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1174 of file list.c.

{
    List       *result;
    const ListCell *cell;
 
    if (list1 == NIL || list2 == NIL)
        return NIL;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    result = NIL;
    foreach(cell, list1)
    {
        if (list_member(list2, lfirst(cell)))
            result = lappend(result, lfirst(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, list_member(), and NIL.

◆ list_intersection_int()

List * list_intersection_int	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1200 of file list.c.

{
    List       *result;
    const ListCell *cell;
 
    if (list1 == NIL || list2 == NIL)
        return NIL;
 
    Assert(IsIntegerList(list1));
    Assert(IsIntegerList(list2));
 
    result = NIL;
    foreach(cell, list1)
    {
        if (list_member_int(list2, lfirst_int(cell)))
            result = lappend_int(result, lfirst_int(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsIntegerList, lappend_int(), lfirst_int, list_member_int(), and NIL.

Referenced by parseCheckAggregates().

◆ list_last_cell()

static ListCell * list_last_cell ( const List * list )

inlinestatic

Definition at line 288 of file pg_list.h.

{
    Assert(list != NIL);
    return &list->elements[list->length - 1];
}

References Assert, and NIL.

Referenced by transformIndexConstraint().

◆ list_length()

static int list_length ( const List * l )

inlinestatic

Definition at line 152 of file pg_list.h.

{
    return l ? l->length : 0;
}

References List::length.

◆ list_make1_impl()

List * list_make1_impl	(	NodeTag	t,
		ListCell	datum1
	)

extern

Definition at line 236 of file list.c.

{
    List       *list = new_list(t, 1);
 
    list->elements[0] = datum1;
    check_list_invariants(list);
    return list;
}

References check_list_invariants, and new_list().

◆ list_make2_impl()

List * list_make2_impl	(	NodeTag	t,
		ListCell	datum1,
		ListCell	datum2
	)

extern

Definition at line 246 of file list.c.

{
    List       *list = new_list(t, 2);
 
    list->elements[0] = datum1;
    list->elements[1] = datum2;
    check_list_invariants(list);
    return list;
}

References check_list_invariants, fb(), and new_list().

◆ list_make3_impl()

List * list_make3_impl	(	NodeTag	t,
		ListCell	datum1,
		ListCell	datum2,
		ListCell	datum3
	)

extern

Definition at line 257 of file list.c.

{
    List       *list = new_list(t, 3);
 
    list->elements[0] = datum1;
    list->elements[1] = datum2;
    list->elements[2] = datum3;
    check_list_invariants(list);
    return list;
}

References check_list_invariants, fb(), and new_list().

◆ list_make4_impl()

List * list_make4_impl	(	NodeTag	t,
		ListCell	datum1,
		ListCell	datum2,
		ListCell	datum3,
		ListCell	datum4
	)

extern

Definition at line 270 of file list.c.

{
    List       *list = new_list(t, 4);
 
    list->elements[0] = datum1;
    list->elements[1] = datum2;
    list->elements[2] = datum3;
    list->elements[3] = datum4;
    check_list_invariants(list);
    return list;
}

References check_list_invariants, fb(), and new_list().

◆ list_make5_impl()

List * list_make5_impl	(	NodeTag	t,
		ListCell	datum1,
		ListCell	datum2,
		ListCell	datum3,
		ListCell	datum4,
		ListCell	datum5
	)

extern

Definition at line 284 of file list.c.

{
    List       *list = new_list(t, 5);
 
    list->elements[0] = datum1;
    list->elements[1] = datum2;
    list->elements[2] = datum3;
    list->elements[3] = datum4;
    list->elements[4] = datum5;
    check_list_invariants(list);
    return list;
}

References check_list_invariants, fb(), and new_list().

◆ list_member()

bool list_member	(	const List *	list,
		const void *	datum
	)

extern

Definition at line 661 of file list.c.

{
    const ListCell *cell;
 
    Assert(IsPointerList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (equal(lfirst(cell), datum))
            return true;
    }
 
    return false;
}

References Assert, check_list_invariants, equal(), IsPointerList, and lfirst.

Referenced by add_new_column_to_pathtarget(), analyzeCTE(), build_minmax_path(), consider_index_join_outer_rels(), create_bitmap_scan_plan(), ec_member_matches_foreign(), find_computable_ec_member(), get_join_index_paths(), infer_arbiter_indexes(), init_grouping_targets(), is_var_in_aggref_only(), list_append_unique(), list_concat_unique(), list_difference(), list_intersection(), list_union(), paraminfo_get_equal_hashops(), pg_available_extension_versions(), pg_available_extensions(), process_duplicate_ors(), remove_self_join_rel(), split_pathtarget_at_srfs_extended(), and split_pathtarget_walker().

◆ list_member_int()

bool list_member_int	(	const List *	list,
		int	datum
	)

extern

Definition at line 702 of file list.c.

{
    const ListCell *cell;
 
    Assert(IsIntegerList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst_int(cell) == datum)
            return true;
    }
 
    return false;
}

References Assert, check_list_invariants, IsIntegerList, and lfirst_int.

Referenced by BeginCopyFrom(), BeginCopyTo(), buildGroupedVar(), contain_exec_param_walker(), CopyGetAttnums(), estimate_num_groups(), ExecRelationIsTargetRelation(), init_returning_filter(), list_append_unique_int(), list_concat_unique_int(), list_difference_int(), list_intersection_int(), list_union_int(), max_parallel_hazard_walker(), parseCheckAggregates(), reorder_grouping_sets(), substitute_grouped_columns_mutator(), and transformDistinctOnClause().

◆ list_member_oid()

bool list_member_oid	(	const List *	list,
		Oid	datum
	)

extern

Definition at line 722 of file list.c.

{
    const ListCell *cell;
 
    Assert(IsOidList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst_oid(cell) == datum)
            return true;
    }
 
    return false;
}

References Assert, check_list_invariants, IsOidList, and lfirst_oid.

Referenced by AfterTriggerSaveEvent(), AlterTableMoveAll(), apply_handle_truncate(), ATExecAddInherit(), ATExecAttachPartition(), ATExecMergePartitions(), BeginCopyTo(), CheckAndReportConflict(), CheckAttributeType(), CloneFkReferenced(), CloneFkReferencing(), CollationIsVisibleExt(), ConversionIsVisibleExt(), DefineRelation(), DetachPartitionFinalize(), ec_member_matches_indexcol(), ExecAlterObjectDependsStmt(), ExecCheckIndexConstraints(), ExecInitPartitionInfo(), ExecInsertIndexTuples(), ExecuteTruncate(), exprs_known_equal(), finalNamespacePath(), fireRIRrules(), FunctionIsVisibleExt(), get_rel_sync_entry(), get_transform_fromsql(), get_transform_tosql(), GetTopMostAncestorInPublication(), has_privs_of_role(), hashvalidate(), have_partkey_equi_join(), heap_truncate_check_FKs(), heap_truncate_find_FKs(), inline_function(), is_member_of_role(), is_member_of_role_nosuper(), list_append_unique_oid(), list_concat_unique_oid(), list_difference_oid(), list_union_oid(), LockViewRecurse_walker(), lookup_shippable(), member_can_set_role(), OpclassIsVisibleExt(), OpenTableList(), OperatorIsVisibleExt(), OpfamilyIsVisibleExt(), PlanCacheRelCallback(), ReindexIsProcessingIndex(), relation_has_unique_index_for(), relation_is_updatable(), RelationIsVisibleExt(), RememberConstraintForRebuilding(), RememberIndexForRebuilding(), RememberStatisticsForRebuilding(), roles_list_append(), StatisticsObjIsVisibleExt(), TSConfigIsVisibleExt(), TSDictionaryIsVisibleExt(), TSParserIsVisibleExt(), TSTemplateIsVisibleExt(), typeInheritsFrom(), and TypeIsVisibleExt().

◆ list_member_ptr()

bool list_member_ptr	(	const List *	list,
		const void *	datum
	)

extern

Definition at line 682 of file list.c.

{
    const ListCell *cell;
 
    Assert(IsPointerList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst(cell) == datum)
            return true;
    }
 
    return false;
}

References Assert, check_list_invariants, IsPointerList, and lfirst.

Referenced by count_common_leading_pathkeys_unordered(), create_bitmap_scan_plan(), create_tidrangescan_plan(), create_tidscan_plan(), estimate_multivariate_bucketsize(), ExecInsert(), get_foreign_key_join_selectivity(), get_useful_pathkeys_for_distinct(), group_keys_reorder_by_pathkeys(), list_append_unique_ptr(), list_concat_unique_ptr(), list_difference_ptr(), list_union_ptr(), postgresGetForeignPlan(), preprocess_groupclause(), and remove_join_clause_from_rels().

◆ list_member_xid()

bool list_member_xid	(	const List *	list,
		TransactionId	datum
	)

extern

Definition at line 742 of file list.c.

{
    const ListCell *cell;
 
    Assert(IsXidList(list));
    check_list_invariants(list);
 
    foreach(cell, list)
    {
        if (lfirst_xid(cell) == datum)
            return true;
    }
 
    return false;
}

References Assert, check_list_invariants, IsXidList, and lfirst_xid.

Referenced by get_schema_sent_in_streamed_txn(), and pa_start_subtrans().

◆ list_nth()

static void * list_nth	(	const List *	list,
		int	n
	)

inlinestatic

Definition at line 299 of file pg_list.h.

{
    Assert(IsA(list, List));
    return lfirst(list_nth_cell(list, n));
}

References Assert, IsA, lfirst, and list_nth_cell().

Referenced by add_child_join_rel_equivalences(), add_child_rel_equivalences(), AddRelationNotNullConstraints(), adjust_appendrel_attrs_mutator(), adjust_inherited_attnums(), apply_handle_update(), ATAddForeignKeyConstraint(), bbsink_copystream_begin_archive(), build_joinrel_tlist(), build_mvdependencies(), build_mvndistinct(), calculate_partition_bound_for_merge(), CallStmtResultDesc(), check_and_push_window_quals(), check_new_partition_bound(), check_partition_bounds_for_split_range(), consider_index_join_outer_rels(), conversion_error_callback(), convert_subquery_pathkeys(), convert_testexpr_mutator(), copy_sequences(), dependencies_clauselist_selectivity(), errorMissingColumn(), eval_const_expressions_mutator(), examine_simple_variable(), exec_rt_fetch(), ExecInitAppend(), ExecInitCteScan(), ExecInitMemoize(), ExecInitMerge(), ExecInitMergeAppend(), ExecInitModifyTable(), ExecInitPartitionExecPruning(), ExecInitSubPlan(), ExecInitUpdateProjection(), expand_indexqual_rowcompare(), expand_single_inheritance_child(), expandRecordVariable(), expandRTE(), ExplainTargetRel(), extended_statistics_update(), finalize_plan(), find_expr_references_walker(), find_hash_columns(), find_modifytable_subplan(), find_window_run_conditions(), fix_param_node(), flatten_group_exprs_mutator(), flatten_join_alias_vars_mutator(), generate_implied_equalities_for_column(), generate_join_implied_equalities(), get_and_validate_seq_info(), get_call_expr_arg_stable(), get_call_expr_argtype(), get_name_for_var_field(), get_rtable_name(), get_rte_attribute_is_dropped(), get_rte_attribute_name(), get_sequences_string(), get_tupdesc_for_join_scan_tuples(), get_variable(), GetOldestUnsummarizedLSN(), gettuple_eval_partition(), gimme_tree(), gistfinishsplit(), group_similar_or_args(), has_dangerous_join_using(), has_relevant_eclass_joinclause(), have_relevant_eclass_joinclause(), ignorenulls_getfuncarginframe(), infer_collation_opclass_match(), init_execution_state(), interpret_AS_clause(), JsonTableGetValue(), make_callstmt_target(), make_path_rowexpr(), markNullableIfNeeded(), match_eclasses_to_foreign_key_col(), merge_clump(), pg_get_function_arg_default(), pg_get_publication_tables(), postgresBeginDirectModify(), postgresBeginForeignModify(), postgresBeginForeignScan(), postgresExplainDirectModify(), postgresExplainForeignModify(), postgresExplainForeignScan(), postgresGetForeignPlan(), postgresPlanDirectModify(), postgresPlanForeignModify(), PrepareForIncrementalBackup(), remove_self_join_rel(), reorder_grouping_sets(), resolve_special_varno(), rewriteSearchAndCycle(), set_cte_pathlist(), set_deparse_plan(), set_join_column_names(), set_relation_column_names(), set_using_names(), show_modifytable_info(), show_result_replacement_info(), substitute_actual_parameters_in_from_mutator(), substitute_actual_parameters_mutator(), SyncPostCheckpoint(), transformInsertRow(), transformMultiAssignRef(), transformPartitionCmdForSplit(), transformPartitionRangeBounds(), transformSetOperationStmt(), TypeGetTupleDesc(), validateFkOnDeleteSetColumns(), WinGetFuncArgCurrent(), and WinGetFuncArgInFrame().

◆ list_nth_cell()

static ListCell * list_nth_cell	(	const List *	list,
		int	n
	)

inlinestatic

Definition at line 277 of file pg_list.h.

{
    Assert(list != NIL);
    Assert(n >= 0 && n < list->length);
    return &list->elements[n];
}

References Assert, fb(), and NIL.

Referenced by build_subplan(), expandTupleDesc(), find_all_inheritors(), list_nth(), list_nth_int(), list_nth_oid(), markRelsAsNulledBy(), mbms_add_member(), pa_stream_abort(), ProcedureCreate(), split_pathtarget_at_srfs_extended(), split_pathtarget_walker(), and unify_hypothetical_args().

◆ list_nth_int()

static int list_nth_int	(	const List *	list,
		int	n
	)

inlinestatic

Definition at line 310 of file pg_list.h.

{
    Assert(IsA(list, IntList));
    return lfirst_int(list_nth_cell(list, n));
}

References Assert, fb(), IsA, lfirst_int, and list_nth_cell().

Referenced by CopyReadAttributesCSV(), CopyReadAttributesText(), create_ctescan_plan(), dependencies_object_end(), examine_simple_variable(), make_path_rowexpr(), ndistinct_object_end(), rewriteSearchAndCycle(), and set_cte_pathlist().

◆ list_nth_oid()

static Oid list_nth_oid	(	const List *	list,
		int	n
	)

inlinestatic

Definition at line 321 of file pg_list.h.

{
    Assert(IsA(list, OidList));
    return lfirst_oid(list_nth_cell(list, n));
}

References Assert, fb(), IsA, lfirst_oid, and list_nth_cell().

Referenced by EstimateParamExecSpace(), expand_indexqual_rowcompare(), get_rte_attribute_is_dropped(), interpret_AS_clause(), make_path_rowexpr(), pg_get_publication_sequences(), pg_partition_ancestors(), pg_partition_tree(), rewriteSearchAndCycle(), and SerializeParamExecParams().

◆ list_oid_cmp()

int list_oid_cmp	(	const ListCell *	p1,
		const ListCell *	p2
	)

extern

Definition at line 1703 of file list.c.

{
    Oid         v1 = lfirst_oid(p1);
    Oid         v2 = lfirst_oid(p2);
 
    return pg_cmp_u32(v1, v2);
}

References fb(), lfirst_oid, and pg_cmp_u32().

Referenced by GetPublicationRelations(), heap_truncate_find_FKs(), RelationGetIndexList(), and RelationGetStatExtList().

◆ list_second_cell()

static ListCell * list_second_cell ( const List * l )

inlinestatic

Definition at line 142 of file pg_list.h.

{
    if (l && l->length >= 2)
        return &l->elements[1];
    else
        return NULL;
}

References List::elements, fb(), and List::length.

Referenced by JsonValueListInitIterator(), and select_common_type().

◆ list_sort()

void list_sort	(	List *	list,
		list_sort_comparator	cmp
	)

extern

Definition at line 1674 of file list.c.

{
    typedef int (*qsort_comparator) (const void *a, const void *b);
    int         len;
 
    check_list_invariants(list);
 
    /* Nothing to do if there's less than two elements */
    len = list_length(list);
    if (len > 1)
        qsort(list->elements, len, sizeof(ListCell), (qsort_comparator) cmp);
}

References a, b, check_list_invariants, cmp(), fb(), len, list_length(), and qsort.

Referenced by create_append_path(), expand_grouping_sets(), GetPublicationRelations(), heap_truncate_find_FKs(), perform_base_backup(), RelationGetIndexList(), RelationGetStatExtList(), sort_policies_by_name(), UpdateLogicalMappings(), and WalSummariesAreComplete().

◆ list_tail()

static ListCell * list_tail ( const List * l )

inlinestatic

Definition at line 135 of file pg_list.h.

{
    return l ? &l->elements[l->length - 1] : NULL;
}

References List::elements, fb(), and List::length.

◆ list_truncate()

pg_nodiscard List * list_truncate	(	List *	list,
		int	new_size
	)

extern

Definition at line 631 of file list.c.

{
    if (new_size <= 0)
        return NIL;             /* truncate to zero length */
 
    /* If asked to effectively extend the list, do nothing */
    if (new_size < list_length(list))
        list->length = new_size;
 
    /*
     * Note: unlike the individual-list-cell deletion functions, we don't move
     * the list cells to new storage, even in DEBUG_LIST_MEMORY_USAGE mode.
     * This is because none of them can move in this operation, so just like
     * in the old cons-cell-based implementation, this function doesn't
     * invalidate any pointers to cells of the list.  This is also the reason
     * for not wiping the memory of the deleted cells: the old code didn't
     * free them either.  Perhaps later we'll tighten this up.
     */
 
    return list;
}

References fb(), list_length(), and NIL.

Referenced by choose_bitmap_and(), expand_indexqual_rowcompare(), ExpandIndirectionStar(), expandRTE(), generate_mergejoin_paths(), geqo_eval(), list_delete_last(), mbms_int_members(), pa_stream_abort(), ParseFuncOrColumn(), transformAggregateCall(), transformFromClauseItem(), transformReturningClause(), transformSetOperationStmt(), and transformWholeRowRef().

◆ list_union()

List * list_union	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1066 of file list.c.

{
    List       *result;
    const ListCell *cell;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    result = list_copy(list1);
    foreach(cell, list2)
    {
        if (!list_member(result, lfirst(cell)))
            result = lappend(result, lfirst(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, list_copy(), and list_member().

Referenced by AddRelationNewConstraints(), and process_duplicate_ors().

◆ list_union_int()

List * list_union_int	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1113 of file list.c.

{
    List       *result;
    const ListCell *cell;
 
    Assert(IsIntegerList(list1));
    Assert(IsIntegerList(list2));
 
    result = list_copy(list1);
    foreach(cell, list2)
    {
        if (!list_member_int(result, lfirst_int(cell)))
            result = lappend_int(result, lfirst_int(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsIntegerList, lappend_int(), lfirst_int, list_copy(), and list_member_int().

Referenced by expand_grouping_sets().

◆ list_union_oid()

List * list_union_oid	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1136 of file list.c.

{
    List       *result;
    const ListCell *cell;
 
    Assert(IsOidList(list1));
    Assert(IsOidList(list2));
 
    result = list_copy(list1);
    foreach(cell, list2)
    {
        if (!list_member_oid(result, lfirst_oid(cell)))
            result = lappend_oid(result, lfirst_oid(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsOidList, lappend_oid(), lfirst_oid, list_copy(), and list_member_oid().

◆ list_union_ptr()

List * list_union_ptr	(	const List *	list1,
		const List *	list2
	)

extern

Definition at line 1090 of file list.c.

{
    List       *result;
    const ListCell *cell;
 
    Assert(IsPointerList(list1));
    Assert(IsPointerList(list2));
 
    result = list_copy(list1);
    foreach(cell, list2)
    {
        if (!list_member_ptr(result, lfirst(cell)))
            result = lappend(result, lfirst(cell));
    }
 
    check_list_invariants(result);
    return result;
}

References Assert, check_list_invariants, fb(), IsPointerList, lappend(), lfirst, list_copy(), and list_member_ptr().

◆ lnext()

static ListCell * lnext	(	const List *	l,
		const ListCell *	c
	)

inlinestatic

Definition at line 343 of file pg_list.h.

{
    Assert(c >= &l->elements[0] && c < &l->elements[l->length]);
    c++;
    if (c < &l->elements[l->length])
        return (ListCell *) c;
    else
        return NULL;
}

References Assert, List::elements, fb(), and List::length.

Referenced by _outList(), add_setop_child_rel_equivalences(), analyzeCTE(), arrayexpr_next_fn(), assign_hypothetical_collations(), asyncQueueAddEntries(), ATAddForeignKeyConstraint(), build_index_tlist(), buildRelationAliases(), CheckRADIUSAuth(), coerce_record_to_complex(), compare_tlist_datatypes(), ComputeIndexAttrs(), consider_groupingsets_paths(), ConstructTupleDescriptor(), create_ctas_nodata(), create_mergejoin_plan(), create_one_window_path(), DefineView(), deparseAggref(), deparseFuncExpr(), deparseSubscriptingRef(), do_analyze_rel(), eclass_member_iterator_next(), examine_variable(), exec_simple_query(), exec_stmt_raise(), ExecInitJunkFilterConversion(), ExecLockRows(), expand_insert_targetlist(), expandRTE(), expandTupleDesc(), ExplainExecuteQuery(), ExplainQuery(), extract_rollup_sets(), find_param_referent(), fix_indexqual_operand(), FormIndexDatum(), FormPartitionKeyDatum(), funcname_signature_string(), generate_append_tlist(), generate_setop_child_grouplist(), generate_setop_grouplist(), generateClonedIndexStmt(), get_func_expr(), get_qual_for_hash(), get_qual_for_range(), get_range_key_properties(), get_range_nulltest(), get_rule_expr(), get_update_query_targetlist_def(), GetIndexInputType(), has_partition_attrs(), InitPartitionPruneContext(), intorel_startup(), JsonValueListNext(), list_next_fn(), make_inner_pathkeys_for_merge(), match_index_to_operand(), parse_hba_line(), parse_ident_line(), perform_base_backup(), perform_pruning_base_step(), pg_get_functiondef(), pg_get_indexdef_worker(), pg_get_partkeydef_worker(), PortalRunMulti(), postprocess_setop_tlist(), print_expr(), print_function_arguments(), print_pathkeys(), printSubscripts(), ProcedureCreate(), process_startup_options(), query_is_distinct_for(), RelationBuildPartitionKey(), SearchPathMatchesCurrentEnvironment(), SendRowDescriptionMessage(), serialize_deflist(), set_baserel_partition_key_exprs(), split_pathtarget_at_srfs_extended(), statatt_get_index_expr(), tfuncLoadRows(), tlist_matches_tupdesc(), tlist_same_collations(), tlist_same_datatypes(), transformAssignmentIndirection(), transformPartitionCmdForMerge(), transformPartitionCmdForSplit(), transformUpdateTargetList(), transformWithClause(), trim_mergeclauses_for_inner_pathkeys(), and try_partitionwise_join().

Typedefs
typedef union ListCell	ListCell

typedef struct List	List

typedef struct ForEachState	ForEachState

typedef struct ForBothState	ForBothState

typedef struct ForBothCellState	ForBothCellState

typedef struct ForThreeState	ForThreeState

typedef struct ForFourState	ForFourState

typedef struct ForFiveState	ForFiveState

typedef int(*	list_sort_comparator) (const ListCell a, const ListCell b)

Data Structures

Macros

Typedefs

Functions

Macro Definition Documentation

◆ for_both_cell

◆ for_each_cell

◆ for_each_from

◆ forboth

◆ foreach

◆ foreach_current_index

◆ foreach_delete_current

◆ foreach_int

◆ foreach_internal

◆ foreach_node

◆ foreach_oid

◆ foreach_ptr

◆ foreach_xid

◆ forfive

◆ forfour

◆ forthree

◆ lfirst

◆ lfirst_int

◆ lfirst_node

◆ lfirst_oid

◆ lfirst_xid

◆ lfourth

◆ lfourth_int

◆ lfourth_node

◆ lfourth_oid

◆ linitial

◆ linitial_int

◆ linitial_node

◆ linitial_oid

◆ list_make1

◆ list_make1_int

◆ list_make1_oid

◆ list_make1_xid

◆ list_make2

◆ list_make2_int

◆ list_make2_oid

◆ list_make2_xid

◆ list_make3

◆ list_make3_int

◆ list_make3_oid

◆ list_make3_xid

◆ list_make4

◆ list_make4_int

◆ list_make4_oid

◆ list_make4_xid

◆ list_make5

◆ list_make5_int

◆ list_make5_oid

◆ list_make5_xid

◆ list_make_int_cell

◆ list_make_oid_cell

◆ list_make_ptr_cell

◆ list_make_xid_cell

◆ list_nth_node

◆ llast

◆ llast_int

◆ llast_node

◆ llast_oid

◆ llast_xid

◆ lsecond

◆ lsecond_int

◆ lsecond_node

◆ lsecond_oid

◆ lthird

◆ lthird_int

◆ lthird_node

◆ lthird_oid

◆ multi_for_advance_cell

◆ NIL

Typedef Documentation

◆ ForBothCellState

◆ ForBothState

◆ ForEachState

◆ ForFiveState

◆ ForFourState