PostgreSQL Source Code  git master
list.c File Reference
#include "postgres.h"
#include "nodes/pg_list.h"
#include "utils/memutils.h"
Include dependency graph for list.c:

Go to the source code of this file.

Macros

#define LIST_HEADER_OVERHEAD   ((int) ((offsetof(List, initial_elements) - 1) / sizeof(ListCell) + 1))
 
#define IsPointerList(l)   ((l) == NIL || IsA((l), List))
 
#define IsIntegerList(l)   ((l) == NIL || IsA((l), IntList))
 
#define IsOidList(l)   ((l) == NIL || IsA((l), OidList))
 
#define check_list_invariants(l)   ((void) 0)
 

Functions

static Listnew_list (NodeTag type, int min_size)
 
static void enlarge_list (List *list, int min_size)
 
Listlist_make1_impl (NodeTag t, ListCell datum1)
 
Listlist_make2_impl (NodeTag t, ListCell datum1, ListCell datum2)
 
Listlist_make3_impl (NodeTag t, ListCell datum1, ListCell datum2, ListCell datum3)
 
Listlist_make4_impl (NodeTag t, ListCell datum1, ListCell datum2, ListCell datum3, ListCell datum4)
 
static void new_head_cell (List *list)
 
static void new_tail_cell (List *list)
 
Listlappend (List *list, void *datum)
 
Listlappend_int (List *list, int datum)
 
Listlappend_oid (List *list, Oid datum)
 
static ListCellinsert_new_cell (List *list, int pos)
 
Listlist_insert_nth (List *list, int pos, void *datum)
 
Listlist_insert_nth_int (List *list, int pos, int datum)
 
Listlist_insert_nth_oid (List *list, int pos, Oid datum)
 
Listlcons (void *datum, List *list)
 
Listlcons_int (int datum, List *list)
 
Listlcons_oid (Oid datum, List *list)
 
Listlist_concat (List *list1, const List *list2)
 
Listlist_concat_copy (const List *list1, const List *list2)
 
Listlist_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)
 
Listlist_delete_nth_cell (List *list, int n)
 
Listlist_delete_cell (List *list, ListCell *cell)
 
Listlist_delete (List *list, void *datum)
 
Listlist_delete_ptr (List *list, void *datum)
 
Listlist_delete_int (List *list, int datum)
 
Listlist_delete_oid (List *list, Oid datum)
 
Listlist_delete_first (List *list)
 
Listlist_delete_last (List *list)
 
Listlist_union (const List *list1, const List *list2)
 
Listlist_union_ptr (const List *list1, const List *list2)
 
Listlist_union_int (const List *list1, const List *list2)
 
Listlist_union_oid (const List *list1, const List *list2)
 
Listlist_intersection (const List *list1, const List *list2)
 
Listlist_intersection_int (const List *list1, const List *list2)
 
Listlist_difference (const List *list1, const List *list2)
 
Listlist_difference_ptr (const List *list1, const List *list2)
 
Listlist_difference_int (const List *list1, const List *list2)
 
Listlist_difference_oid (const List *list1, const List *list2)
 
Listlist_append_unique (List *list, void *datum)
 
Listlist_append_unique_ptr (List *list, void *datum)
 
Listlist_append_unique_int (List *list, int datum)
 
Listlist_append_unique_oid (List *list, Oid datum)
 
Listlist_concat_unique (List *list1, const List *list2)
 
Listlist_concat_unique_ptr (List *list1, const List *list2)
 
Listlist_concat_unique_int (List *list1, const List *list2)
 
Listlist_concat_unique_oid (List *list1, const List *list2)
 
void list_deduplicate_oid (List *list)
 
static void list_free_private (List *list, bool deep)
 
void list_free (List *list)
 
void list_free_deep (List *list)
 
Listlist_copy (const List *oldlist)
 
Listlist_copy_tail (const List *oldlist, int nskip)
 
Listlist_copy_deep (const List *oldlist)
 
void list_sort (List *list, list_sort_comparator cmp)
 
int list_oid_cmp (const ListCell *p1, const ListCell *p2)
 

Macro Definition Documentation

◆ check_list_invariants

◆ IsIntegerList

#define IsIntegerList (   l)    ((l) == NIL || IsA((l), IntList))

◆ IsOidList

#define IsOidList (   l)    ((l) == NIL || IsA((l), OidList))

◆ IsPointerList

◆ LIST_HEADER_OVERHEAD

#define LIST_HEADER_OVERHEAD   ((int) ((offsetof(List, initial_elements) - 1) / sizeof(ListCell) + 1))

Definition at line 45 of file list.c.

Referenced by new_list().

Function Documentation

◆ enlarge_list()

static void enlarge_list ( List list,
int  min_size 
)
static

Definition at line 152 of file list.c.

References Assert, List::elements, GetMemoryChunkContext(), List::initial_elements, List::length, List::max_length, MemoryContextAlloc(), offsetof, pfree(), PG_USED_FOR_ASSERTS_ONLY, and repalloc().

Referenced by insert_new_cell(), list_concat(), new_head_cell(), and new_tail_cell().

153 {
154  int new_max_len;
155 
156  Assert(min_size > list->max_length); /* else we shouldn't be here */
157 
158 #ifndef DEBUG_LIST_MEMORY_USAGE
159 
160  /*
161  * As above, we prefer power-of-two total allocations; but here we need
162  * not account for list header overhead. The existing max length might
163  * not be a power of 2, so don't rely on that.
164  */
165  new_max_len = 16; /* semi-arbitrary small power of 2 */
166  while (new_max_len < min_size)
167  new_max_len *= 2;
168 #else
169  /* As above, don't allocate anything extra */
170  new_max_len = min_size;
171 #endif
172 
173  if (list->elements == list->initial_elements)
174  {
176 
177  /*
178  * Replace original in-line allocation with a separate palloc block.
179  * Ensure it is in the same memory context as the List header. (The
180  * previous List implementation did not offer any guarantees about
181  * keeping all list cells in the same context, but it seems reasonable
182  * to create such a guarantee now.)
183  */
184  list->elements = (ListCell *)
186  new_max_len * sizeof(ListCell));
187  memcpy(list->elements, list->initial_elements,
188  list->length * sizeof(ListCell));
189 
190  /*
191  * Currently, asking aset.c to reduce the allocated size of the List
192  * header is pointless in terms of reclaiming space, unless the list
193  * is very long. However, it seems worth doing anyway to cause the
194  * no-longer-needed initial_elements[] space to be cleared in
195  * debugging builds.
196  */
197  newlist = (List *) repalloc(list, offsetof(List, initial_elements));
198 
199  /* That better not have failed, nor moved the list header */
200  Assert(newlist == list);
201  }
202  else
203  {
204 #ifndef DEBUG_LIST_MEMORY_USAGE
205  /* Normally, let repalloc deal with enlargement */
206  list->elements = (ListCell *) repalloc(list->elements,
207  new_max_len * sizeof(ListCell));
208 #else
209  /*
210  * repalloc() might enlarge the space in-place, which we don't want
211  * for debugging purposes, so forcibly move the data somewhere else.
212  */
213  ListCell *newelements;
214 
215  newelements = (ListCell *)
217  new_max_len * sizeof(ListCell));
218  memcpy(newelements, list->elements,
219  list->length * sizeof(ListCell));
220  pfree(list->elements);
221  list->elements = newelements;
222 #endif
223  }
224 
225  list->max_length = new_max_len;
226 }
void pfree(void *pointer)
Definition: mcxt.c:1031
union ListCell ListCell
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1044
int length
Definition: pg_list.h:53
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:771
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57
#define PG_USED_FOR_ASSERTS_ONLY
Definition: c.h:123
Definition: pg_list.h:50
#define offsetof(type, field)
Definition: c.h:655
static MemoryContext GetMemoryChunkContext(void *pointer)
Definition: memutils.h:112

◆ insert_new_cell()

static ListCell* insert_new_cell ( List list,
int  pos 
)
static

Definition at line 379 of file list.c.

References Assert, List::elements, enlarge_list(), List::length, List::max_length, and memmove.

Referenced by list_insert_nth(), list_insert_nth_int(), and list_insert_nth_oid().

380 {
381  Assert(pos >= 0 && pos <= list->length);
382 
383  /* Enlarge array if necessary */
384  if (list->length >= list->max_length)
385  enlarge_list(list, list->length + 1);
386  /* Now shove the existing data over */
387  if (pos < list->length)
388  memmove(&list->elements[pos + 1], &list->elements[pos],
389  (list->length - pos) * sizeof(ListCell));
390  list->length++;
391 
392  return &list->elements[pos];
393 }
static void enlarge_list(List *list, int min_size)
Definition: list.c:152
#define memmove(d, s, c)
Definition: c.h:1238
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
int length
Definition: pg_list.h:53

◆ lappend()

List* lappend ( List list,
void *  datum 
)

Definition at line 321 of file list.c.

References Assert, check_list_invariants, IsPointerList, lfirst, sort-test::list, list_tail(), new_list(), new_tail_cell(), NIL, and T_List.

Referenced by _SPI_make_plan_non_temp(), _SPI_prepare_oneshot_plan(), _SPI_prepare_plan(), _SPI_save_plan(), accumulate_append_subpath(), AcquireRewriteLocks(), add_column_to_pathtarget(), add_dummy_return(), add_eq_member(), add_join_clause_to_rels(), add_join_rel(), add_paths_to_append_rel(), add_placeholders_to_base_rels(), add_placeholders_to_joinrel(), add_rte_to_flat_rtable(), add_security_quals(), add_to_flat_tlist(), add_unique_group_var(), add_vars_to_targetlist(), add_with_check_options(), addArc(), AddEventToPendingNotifies(), addFamilyMember(), addFkRecurseReferencing(), addKey(), addKeyToQueue(), addRangeTableEntry(), addRangeTableEntryForCTE(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), addRangeTableEntryForJoin(), addRangeTableEntryForRelation(), addRangeTableEntryForSubquery(), addRangeTableEntryForTableFunc(), addRangeTableEntryForValues(), AddRelationNewConstraints(), addRTEtoQuery(), addTargetToGroupList(), addTargetToSortList(), adjust_inherited_tlist(), adjust_partition_tlist(), AlterPublicationTables(), AlterTableMoveAll(), AlterTSDictionary(), analyzeCTETargetList(), apply_child_basequals(), apply_handle_truncate(), apply_scanjoin_target_to_paths(), applyLockingClause(), ApplyRetrieveRule(), assign_param_for_placeholdervar(), assign_param_for_var(), ATAddCheckConstraint(), ATExecAddColumn(), ATGetQueueEntry(), ATPostAlterTypeParse(), ATPrepAlterColumnType(), ATPrepCmd(), btcostestimate(), build_aggregate_finalfn_expr(), build_aggregate_transfn_expr(), build_coercion_expression(), build_index_pathkeys(), build_index_paths(), build_index_tlist(), build_join_rel(), build_joinrel_tlist(), build_partition_pathkeys(), build_path_tlist(), build_physical_tlist(), build_remote_returning(), build_subplan(), BuildEventTriggerCache(), BuildOnConflictExcludedTargetlist(), buildRelationAliases(), cached_scansel(), calc_joinrel_size_estimate(), check_index_predicates(), check_selective_binary_conversion(), check_sql_fn_retval(), checkInsertTargets(), checkSharedDependencies(), checkWellFormedRecursionWalker(), choose_bitmap_and(), ChooseIndexColumnNames(), classifyConditions(), CloneFkReferenced(), CloneFkReferencing(), CloneRowTriggersToPartition(), coerce_record_to_complex(), compute_common_attribute(), compute_semi_anti_join_factors(), compute_semijoin_info(), ComputeIndexAttrs(), ComputePartitionAttrs(), consider_groupingsets_paths(), consider_new_or_clause(), convert_ANY_sublink_to_join(), convert_EXISTS_to_ANY(), convert_subquery_pathkeys(), ConvertTriggerToFK(), CopyMultiInsertInfoFlush(), CopyMultiInsertInfoSetupBuffer(), create_append_plan(), create_bitmap_scan_plan(), create_bitmap_subplan(), create_ctas_nodata(), create_customscan_plan(), create_degenerate_grouping_paths(), create_groupingsets_plan(), create_hashjoin_plan(), create_index_paths(), create_indexscan_plan(), create_join_clause(), create_list_bounds(), create_merge_append_plan(), create_modifytable_plan(), create_nestloop_path(), create_partitionwise_grouping_paths(), create_tidscan_plan(), create_unique_plan(), database_to_xmlschema_internal(), deconstruct_recurse(), DefineRelation(), DefineSequence(), DefineTSDictionary(), DefineView(), DefineVirtualRelation(), deparseParam(), deparseVar(), deserialize_deflist(), determineRecursiveColTypes(), distribute_qual_to_rels(), distribute_restrictinfo_to_rels(), do_pg_start_backup(), DoCopy(), estimate_multivariate_ndistinct(), estimate_num_groups(), eval_const_expressions_mutator(), EvalPlanQualStart(), EventTriggerAlterTableEnd(), EventTriggerCollectAlterDefPrivs(), EventTriggerCollectAlterOpFam(), EventTriggerCollectAlterTableSubcmd(), EventTriggerCollectAlterTSConfig(), EventTriggerCollectCreateOpClass(), EventTriggerCollectGrant(), EventTriggerCollectSimpleCommand(), Exec_ListenCommit(), ExecAllocTableSlot(), ExecEvalXmlExpr(), ExecGetTriggerResultRel(), ExecInitAlternativeSubPlan(), ExecInitExprList(), ExecInitExprRec(), ExecInitLockRows(), ExecInitModifyTable(), ExecInitNode(), ExecInitPartitionInfo(), ExecInitSubPlan(), ExecPrepareExprList(), ExecSerializePlan(), ExecuteGrantStmt(), ExecuteTruncate(), ExecuteTruncateGuts(), expand_grouping_sets(), expand_groupingset_node(), expand_inherited_rtentry(), expand_single_inheritance_child(), expand_targetlist(), expand_vacuum_rel(), expandRelAttrs(), ExpandRowReference(), expandRTE(), expandTupleDesc(), ExplainNode(), ExportSnapshot(), expression_tree_mutator(), extract_actual_clauses(), extract_actual_join_clauses(), extract_jsp_path_expr_nodes(), extract_lateral_references(), extract_nonindex_conditions(), extract_or_clause(), extract_rollup_sets(), extractRemainingColumns(), fetch_statentries_for_relation(), fetch_table_list(), fetch_upper_rel(), file_fdw_validator(), fill_hba_line(), find_duplicate_ors(), find_hash_columns(), find_indexpath_quals(), find_list_position(), find_mergeclauses_for_outer_pathkeys(), find_minmax_aggs_walker(), find_partition_scheme(), find_placeholder_info(), find_window_functions_walker(), findTargetlistEntrySQL99(), fireRIRrules(), fireRules(), fix_indexorderby_references(), fix_indexqual_references(), flatten_grouping_sets(), flatten_join_alias_vars_mutator(), flatten_join_using_qual(), flatten_simple_union_all(), foreign_grouping_ok(), foreign_join_ok(), format_operator_parts(), format_procedure_parts(), func_get_detail(), gen_partprune_steps_internal(), gen_prune_step_combine(), gen_prune_step_op(), gen_prune_steps_from_opexps(), generate_append_tlist(), generate_bitmap_or_paths(), generate_implied_equalities_for_column(), generate_join_implied_equalities_broken(), generate_join_implied_equalities_normal(), generate_orderedappend_paths(), generate_partitionwise_join_paths(), generate_setop_tlist(), generate_subquery_params(), generate_subquery_vars(), generate_union_paths(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), generateSerialExtraStmts(), get_actual_clauses(), get_all_vacuum_rels(), get_appendrel_parampathinfo(), get_baserel_parampathinfo(), get_database_list(), get_eclass_for_sort_expr(), get_ext_ver_info(), get_ext_ver_list(), get_file_fdw_attribute_options(), get_foreign_key_join_selectivity(), get_func_expr(), get_index_clause_from_support(), get_index_paths(), get_insert_query_def(), get_join_index_paths(), get_joinrel_parampathinfo(), get_op_btree_interpretation(), get_policies_for_relation(), get_qual_for_hash(), get_qual_for_list(), get_qual_for_range(), get_quals_from_indexclauses(), get_range_nulltest(), get_relation_constraints(), get_relation_foreign_keys(), get_relation_statistics(), get_rels_with_domain(), get_required_extension(), get_sortgrouplist_exprs(), get_steps_using_prefix_recurse(), get_subscription_list(), get_switched_clauses(), get_tables_to_cluster(), get_tlist_exprs(), get_update_query_targetlist_def(), get_useful_ecs_for_relation(), get_useful_pathkeys_for_relation(), get_windowfunc_expr(), GetAfterTriggersTableData(), getObjectIdentityParts(), getState(), GetSubscriptionNotReadyRelations(), GetSubscriptionRelations(), gistFindPath(), gistfixsplit(), gistplacetopage(), hash_inner_and_outer(), heap_truncate(), identify_current_nestloop_params(), identify_opfamily_groups(), index_concurrently_create_copy(), infer_arbiter_indexes(), inheritance_planner(), init_execution_state(), init_sql_fcache(), InitPlan(), innerrel_is_unique(), interpret_function_parameter_list(), intorel_startup(), is_innerrel_unique_for(), join_is_removable(), jsonb_ops__extract_nodes(), jsonb_path_ops__extract_nodes(), JsonValueListAppend(), list_append_unique(), list_append_unique_ptr(), list_concat_unique(), list_concat_unique_ptr(), list_difference(), list_difference_ptr(), list_intersection(), list_union(), list_union_ptr(), llvm_compile_module(), load_hba(), load_ident(), LoadPublications(), logicalrep_worker_stop_at_commit(), logicalrep_workers_find(), make_canonical_pathkey(), make_copy_attnamelist(), make_group_input_target(), make_inh_translation_list(), make_inner_pathkeys_for_merge(), make_modifytable(), make_partial_grouping_target(), make_partition_op_expr(), make_partition_pruneinfo(), make_partitionedrel_pruneinfo(), make_pathkeys_for_sortclauses(), make_pathtarget_from_tlist(), make_rel_from_joinlist(), make_row_comparison_op(), make_setop_translation_list(), make_sort_input_target(), make_sub_restrictinfos(), make_tlist_from_pathtarget(), make_window_input_target(), makeDependencyGraphWalker(), match_clause_to_index(), match_clause_to_partition_key(), match_foreign_keys_to_quals(), match_join_clauses_to_index(), match_network_subset(), match_pathkeys_to_index(), match_pattern_prefix(), matchLocks(), merge_clump(), MergeAttributes(), negate_clause(), next_field_expand(), nodeRead(), OpenTableList(), order_qual_clauses(), parse_hba_line(), parseCheckAggregates(), ParseFuncOrColumn(), PartConstraintImpliedByRelConstraint(), perform_base_backup(), pg_get_object_address(), pg_logical_slot_get_changes_guts(), pg_plan_queries(), pg_rewrite_query(), plan_union_children(), postgresAddForeignUpdateTargets(), postgresGetForeignPaths(), postgresGetForeignPlan(), postgresImportForeignSchema(), prep_domain_constraints(), prepare_sort_from_pathkeys(), preprocess_groupclause(), preprocess_grouping_sets(), preprocess_rowmarks(), preprocess_targetlist(), process_duplicate_ors(), process_equivalence(), process_pipe_input(), process_sublinks_mutator(), process_subquery_nestloop_params(), process_syncing_tables_for_apply(), ProcessStartupPacket(), pull_ands(), pull_ors(), pull_up_simple_values(), pull_up_sublinks_jointree_recurse(), pull_up_sublinks_qual_recurse(), pull_up_union_leaf_queries(), pull_var_clause_walker(), pull_vars_walker(), QueryRewrite(), queue_listen(), range_table_mutator(), read_tablespace_map(), rebuild_fdw_scan_tlist(), RebuildConstraintComment(), record_plan_function_dependency(), record_plan_type_dependency(), reduce_outer_joins_pass1(), register_ENR(), register_label_provider(), ReindexRelationConcurrently(), relation_excluded_by_constraints(), relation_has_unique_index_for(), RelationCacheInvalidate(), RelationGetFKeyList(), remap_to_groupclause_idx(), RememberConstraintForRebuilding(), RememberIndexForRebuilding(), RememberSyncRequest(), remove_rel_from_joinlist(), remove_useless_groupby_columns(), RemoveInheritance(), reorder_function_arguments(), reparameterize_path(), reparameterize_path_by_child(), reparameterize_pathlist_by_child(), replace_empty_jointree(), replace_nestloop_param_placeholdervar(), replace_nestloop_param_var(), replace_outer_agg(), replace_outer_grouping(), resolve_unique_index_expr(), RewriteQuery(), rewriteTargetListIU(), rewriteTargetListUD(), rewriteTargetView(), rewriteValuesRTE(), schema_to_xmlschema_internal(), SearchCatCacheList(), select_active_windows(), select_mergejoin_clauses(), select_outer_pathkeys_for_merge(), sepgsql_set_client_label(), sequence_options(), set_append_rel_pathlist(), set_cheapest(), set_deparse_for_query(), set_dummy_tlist_references(), set_plan_references(), set_plan_refs(), set_rtable_names(), set_simple_column_names(), set_subquery_pathlist(), set_upper_references(), set_using_names(), show_eval_params(), show_grouping_set_keys(), show_modifytable_info(), show_plan_tlist(), show_sort_group_keys(), show_tablesample(), simplify_and_arguments(), simplify_or_arguments(), split_pathtarget_at_srfs(), split_pathtarget_walker(), SplitDirectoriesString(), SplitGUCList(), SplitIdentifierString(), SS_make_initplan_from_plan(), SS_process_ctes(), StandbyAcquireAccessExclusiveLock(), statext_mcv_clauselist_selectivity(), StreamServerPort(), stringToQualifiedNameList(), subquery_planner(), table_slot_create(), textarray_to_stringlist(), textarray_to_strvaluelist(), textToQualifiedNameList(), TidExprListCreate(), tokenize_file(), tokenize_inc_file(), transformAExprIn(), transformAggregateCall(), transformAlterTableStmt(), transformArrayExpr(), transformAssignmentIndirection(), transformBoolExpr(), transformCallStmt(), transformCaseExpr(), transformCoalesceExpr(), transformColumnDefinition(), transformContainerSubscripts(), transformCreateSchemaStmt(), transformCreateStmt(), transformDistinctClause(), transformDistinctOnClause(), transformExpressionList(), transformFKConstraints(), transformFkeyGetPrimaryKey(), transformFromClause(), transformFromClauseItem(), transformFuncCall(), transformGenericOptions(), transformGroupClause(), transformGroupClauseExpr(), transformGroupingFunc(), transformGroupingSet(), transformIndexConstraint(), transformIndexConstraints(), transformIndirection(), transformInsertRow(), transformInsertStmt(), transformJoinUsingClause(), transformMinMaxExpr(), transformMultiAssignRef(), transformOfType(), transformPartitionBound(), transformPartitionRangeBounds(), transformPartitionSpec(), transformRangeFunction(), transformRangeTableFunc(), transformRangeTableSample(), transformRowExpr(), transformRuleStmt(), transformSetOperationStmt(), transformSetOperationTree(), transformSubLink(), transformTableConstraint(), transformTableLikeClause(), transformTargetList(), transformValuesClause(), transformWindowDefinitions(), transformWindowFuncCall(), transformWithClause(), transformXmlExpr(), trim_mergeclauses_for_inner_pathkeys(), untransformRelOptions(), UpdateLogicalMappings(), WaitForLockersMultiple(), and xmlelement().

322 {
323  Assert(IsPointerList(list));
324 
325  if (list == NIL)
326  list = new_list(T_List, 1);
327  else
328  new_tail_cell(list);
329 
330  lfirst(list_tail(list)) = datum;
331  check_list_invariants(list);
332  return list;
333 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
static void new_tail_cell(List *list)
Definition: list.c:305
#define IsPointerList(l)
Definition: list.c:52
Definition: nodes.h:297
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
static ListCell * list_tail(const List *l)
Definition: pg_list.h:132
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ lappend_int()

List* lappend_int ( List list,
int  datum 
)

Definition at line 339 of file list.c.

References Assert, check_list_invariants, IsIntegerList, lfirst_int, sort-test::list, list_tail(), new_list(), new_tail_cell(), NIL, and T_IntList.

Referenced by addRangeTableEntryForENR(), addRangeTableEntryForFunction(), analyzeCTETargetList(), ATRewriteTable(), build_subplan(), check_ungrouped_columns_walker(), checkInsertTargets(), convert_EXISTS_to_ANY(), CopyGetAttnums(), deparseAnalyzeSql(), deparseExplicitTargetList(), deparseTargetList(), ExecBuildAggTrans(), ExecBuildGroupingEqual(), ExecInitExprRec(), ExecInitQual(), ExecInitSubscriptingRef(), expand_indexqual_rowcompare(), fetch_statentries_for_relation(), finalize_grouping_exprs_walker(), find_all_inheritors(), find_compatible_peragg(), fix_expr_common(), gen_partprune_steps_internal(), gen_prune_steps_from_opexps(), generate_subquery_params(), inheritance_planner(), list_append_unique_int(), list_concat_unique_int(), list_difference_int(), list_intersection_int(), list_union_int(), match_pathkeys_to_index(), nodeRead(), postgresBeginForeignInsert(), postgresPlanDirectModify(), postgresPlanForeignModify(), rel_is_distinct_for(), remap_to_groupclause_idx(), reorder_grouping_sets(), set_plan_refs(), split_pathtarget_at_srfs(), SS_process_ctes(), SyncRepGetSyncStandbysPriority(), SyncRepGetSyncStandbysQuorum(), transformDistinctOnClause(), transformGroupClauseList(), transformInsertStmt(), transformRangeTableFunc(), transformSetOperationTree(), transformValuesClause(), and translate_sub_tlist().

340 {
341  Assert(IsIntegerList(list));
342 
343  if (list == NIL)
344  list = new_list(T_IntList, 1);
345  else
346  new_tail_cell(list);
347 
348  lfirst_int(list_tail(list)) = datum;
349  check_list_invariants(list);
350  return list;
351 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
static void new_tail_cell(List *list)
Definition: list.c:305
#define Assert(condition)
Definition: c.h:732
static ListCell * list_tail(const List *l)
Definition: pg_list.h:132
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ lappend_oid()

List* lappend_oid ( List list,
Oid  datum 
)

Definition at line 357 of file list.c.

References Assert, check_list_invariants, IsOidList, lfirst_oid, sort-test::list, list_tail(), new_list(), new_tail_cell(), NIL, and T_OidList.

Referenced by add_rte_to_flat_rtable(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), AfterTriggerSetState(), AlterTableMoveAll(), analyzeCTETargetList(), apply_handle_truncate(), ApplyExtensionUpdates(), assign_collations_walker(), assign_param_for_placeholdervar(), assign_param_for_var(), assign_special_exec_param(), 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(), CreateTrigger(), DefineRelation(), do_autovacuum(), EventTriggerCommonSetup(), ExecAlterDefaultPrivilegesStmt(), ExecInitPartitionInfo(), ExecInsertIndexTuples(), ExecuteGrantStmt(), ExecuteTruncate(), ExecuteTruncateGuts(), expand_indexqual_rowcompare(), extract_query_dependencies_walker(), ExtractExtensionList(), find_all_inheritors(), find_inheritance_children(), 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(), GetAllTablesPublicationRelations(), GetAllTablesPublications(), getOwnedSequences_internal(), GetParentedForeignKeyRefs(), GetPublicationRelations(), GetRelationPublications(), getRelationsInNamespace(), heap_truncate_check_FKs(), heap_truncate_find_FKs(), index_concurrently_swap(), infer_arbiter_indexes(), inline_function(), 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(), pgstat_recv_inquiry(), PreCommit_on_commit_actions(), query_to_oid_list(), recomputeNamespacePath(), ReindexMultipleTables(), ReindexRelationConcurrently(), rel_is_distinct_for(), RelationGetIndexList(), RelationGetStatExtList(), RememberConstraintForRebuilding(), RememberIndexForRebuilding(), remove_useless_groupby_columns(), replace_outer_agg(), replace_outer_grouping(), RestoreReindexState(), roleSpecsToIds(), transformAggregateCall(), transformInsertStmt(), transformRangeTableFunc(), transformSetOperationTree(), transformValuesClause(), TryReuseForeignKey(), and typeInheritsFrom().

358 {
359  Assert(IsOidList(list));
360 
361  if (list == NIL)
362  list = new_list(T_OidList, 1);
363  else
364  new_tail_cell(list);
365 
366  lfirst_oid(list_tail(list)) = datum;
367  check_list_invariants(list);
368  return list;
369 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
static void new_tail_cell(List *list)
Definition: list.c:305
#define IsOidList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:732
static ListCell * list_tail(const List *l)
Definition: pg_list.h:132
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ lcons()

List* lcons ( void *  datum,
List list 
)

Definition at line 453 of file list.c.

References Assert, check_list_invariants, IsPointerList, lfirst, sort-test::list, list_head(), new_head_cell(), new_list(), NIL, and T_List.

Referenced by AtSubStart_Notify(), build_minmax_path(), checkWellFormedRecursionWalker(), consider_groupingsets_paths(), CreateExprContext(), CreateLockFile(), ExecInitModifyTable(), ExplainNode(), extract_rollup_sets(), find_expr_references_walker(), find_update_path(), generate_orderedappend_paths(), generateSerialExtraStmts(), get_name_for_var_field(), get_object_address_rv(), get_query_def(), get_relation_info(), gistEmptyAllBuffers(), gistFindPath(), gistGetNodeBuffer(), gistPushItupToNodeBuffer(), load_domaintype_info(), makeDependencyGraphWalker(), pg_get_object_address(), plan_union_children(), PLy_subtransaction_enter(), PrepareClientEncoding(), push_child_plan(), pushOperator(), PushOverrideSearchPath(), pushStop(), pushValue_internal(), readTimeLineHistory(), register_on_commit_action(), RelationBuildRowSecurity(), RelationCacheInvalidate(), reorder_grouping_sets(), RewriteQuery(), rewriteTargetView(), sepgsql_avc_compute(), set_cheapest(), show_agg_keys(), show_group_keys(), sort_inner_and_outer(), transformCaseExpr(), and UpdateRangeTableOfViewParse().

454 {
455  Assert(IsPointerList(list));
456 
457  if (list == NIL)
458  list = new_list(T_List, 1);
459  else
460  new_head_cell(list);
461 
462  lfirst(list_head(list)) = datum;
463  check_list_invariants(list);
464  return list;
465 }
#define NIL
Definition: pg_list.h:65
static void new_head_cell(List *list)
Definition: list.c:287
#define check_list_invariants(l)
Definition: list.c:75
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
#define IsPointerList(l)
Definition: list.c:52
Definition: nodes.h:297
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ lcons_int()

List* lcons_int ( int  datum,
List list 
)

Definition at line 471 of file list.c.

References Assert, check_list_invariants, IsIntegerList, lfirst_int, sort-test::list, list_head(), new_head_cell(), new_list(), NIL, and T_IntList.

Referenced by ExecInitAgg(), ExplainBeginOutput(), and ExplainOpenGroup().

472 {
473  Assert(IsIntegerList(list));
474 
475  if (list == NIL)
476  list = new_list(T_IntList, 1);
477  else
478  new_head_cell(list);
479 
480  lfirst_int(list_head(list)) = datum;
481  check_list_invariants(list);
482  return list;
483 }
#define NIL
Definition: pg_list.h:65
static void new_head_cell(List *list)
Definition: list.c:287
#define check_list_invariants(l)
Definition: list.c:75
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
#define Assert(condition)
Definition: c.h:732
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ lcons_oid()

List* lcons_oid ( Oid  datum,
List list 
)

Definition at line 489 of file list.c.

References Assert, check_list_invariants, IsOidList, lfirst_oid, sort-test::list, list_head(), new_head_cell(), new_list(), NIL, and T_OidList.

Referenced by CreateSchemaCommand(), pg_partition_ancestors(), PushOverrideSearchPath(), recomputeNamespacePath(), and ReindexMultipleTables().

490 {
491  Assert(IsOidList(list));
492 
493  if (list == NIL)
494  list = new_list(T_OidList, 1);
495  else
496  new_head_cell(list);
497 
498  lfirst_oid(list_head(list)) = datum;
499  check_list_invariants(list);
500  return list;
501 }
#define NIL
Definition: pg_list.h:65
static void new_head_cell(List *list)
Definition: list.c:287
#define check_list_invariants(l)
Definition: list.c:75
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
#define IsOidList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:732
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_append_unique()

List* list_append_unique ( List list,
void *  datum 
)

Definition at line 1177 of file list.c.

References lappend(), sort-test::list, and list_member().

Referenced by add_security_quals(), and add_with_check_options().

1178 {
1179  if (list_member(list, datum))
1180  return list;
1181  else
1182  return lappend(list, datum);
1183 }
bool list_member(const List *list, const void *datum)
Definition: list.c:613
List * lappend(List *list, void *datum)
Definition: list.c:321

◆ list_append_unique_int()

List* list_append_unique_int ( List list,
int  datum 
)

Definition at line 1202 of file list.c.

References lappend_int(), sort-test::list, and list_member_int().

1203 {
1204  if (list_member_int(list, datum))
1205  return list;
1206  else
1207  return lappend_int(list, datum);
1208 }
bool list_member_int(const List *list, int datum)
Definition: list.c:654
List * lappend_int(List *list, int datum)
Definition: list.c:339

◆ list_append_unique_oid()

List* list_append_unique_oid ( List list,
Oid  datum 
)

Definition at line 1214 of file list.c.

References lappend_oid(), sort-test::list, and list_member_oid().

Referenced by ATExecAlterConstraint(), btvalidate(), hashvalidate(), is_admin_of_role(), map_sql_typecoll_to_xmlschema_types(), roles_has_privs_of(), and roles_is_member_of().

1215 {
1216  if (list_member_oid(list, datum))
1217  return list;
1218  else
1219  return lappend_oid(list, datum);
1220 }
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674

◆ list_append_unique_ptr()

List* list_append_unique_ptr ( List list,
void *  datum 
)

Definition at line 1190 of file list.c.

References lappend(), sort-test::list, and list_member_ptr().

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

1191 {
1192  if (list_member_ptr(list, datum))
1193  return list;
1194  else
1195  return lappend(list, datum);
1196 }
List * lappend(List *list, void *datum)
Definition: list.c:321
bool list_member_ptr(const List *list, const void *datum)
Definition: list.c:634

◆ list_concat()

List* list_concat ( List list1,
const List list2 
)

Definition at line 515 of file list.c.

References Assert, check_list_invariants, List::elements, enlarge_list(), List::length, list_copy(), List::max_length, NIL, and List::type.

Referenced by accumulate_append_subpath(), add_paths_to_append_rel(), add_predicate_to_index_quals(), addRangeTableEntryForJoin(), addRangeTableEntryForTableFunc(), AtEOSubXact_ApplyLauncher(), ATExecAttachPartition(), ATPostAlterTypeParse(), AtSubCommit_Notify(), build_joinrel_partition_info(), build_joinrel_restrictlist(), build_paths_for_OR(), check_index_predicates(), check_sql_fn_retval(), choose_bitmap_and(), clean_up_removed_plan_level(), consider_groupingsets_paths(), ConstraintImpliedByRelConstraint(), convert_EXISTS_sublink_to_join(), cost_index(), create_append_path(), create_append_plan(), create_bitmap_subplan(), create_index_paths(), create_join_plan(), create_merge_append_plan(), deconstruct_recurse(), DefineRelation(), deparseDirectDeleteSql(), deparseDirectUpdateSql(), deparseFromExprForRel(), estimate_path_cost_size(), expand_groupingset_node(), ExpandAllTables(), expandRTE(), extract_or_clause(), extract_rollup_sets(), fileBeginForeignScan(), fileGetOptions(), find_forced_null_vars(), find_indexpath_quals(), find_mergeclauses_for_outer_pathkeys(), find_nonnullable_vars_walker(), fireRIRrules(), flatten_grouping_sets(), fmgr_sql_validator(), 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_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(), init_sql_fcache(), is_parallel_safe(), objectsInSchemaToOids(), process_equivalence(), process_sublinks_mutator(), pull_ands(), pull_ors(), pull_up_simple_subquery(), pull_up_simple_union_all(), reduce_outer_joins_pass2(), reduce_unique_semijoins(), reorder_grouping_sets(), RewriteQuery(), rewriteRuleAction(), rewriteTargetListIU(), selectColorTrigrams(), set_append_rel_pathlist(), set_plan_refs(), split_pathtarget_at_srfs(), split_pathtarget_walker(), SyncRepGetSyncStandbysPriority(), TidQualFromRestrictInfoList(), transformAExprIn(), transformAlterTableStmt(), transformCreateSchemaStmt(), transformCreateStmt(), transformExpressionList(), transformExtendedStatistics(), transformFromClause(), transformFromClauseItem(), transformIndexConstraints(), transformTargetList(), and vacuum().

516 {
517  int new_len;
518 
519  if (list1 == NIL)
520  return list_copy(list2);
521  if (list2 == NIL)
522  return list1;
523 
524  Assert(list1->type == list2->type);
525 
526  new_len = list1->length + list2->length;
527  /* Enlarge array if necessary */
528  if (new_len > list1->max_length)
529  enlarge_list(list1, new_len);
530 
531  /* Even if list1 == list2, using memcpy should be safe here */
532  memcpy(&list1->elements[list1->length], &list2->elements[0],
533  list2->length * sizeof(ListCell));
534  list1->length = new_len;
535 
536  check_list_invariants(list1);
537  return list1;
538 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
static void enlarge_list(List *list, int min_size)
Definition: list.c:152
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52

◆ list_concat_copy()

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

Definition at line 552 of file list.c.

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

Referenced by add_function_defaults(), build_joinrel_partition_info(), build_paths_for_OR(), choose_bitmap_and(), create_scan_plan(), DefineIndex(), gen_partprune_steps(), generate_bitmap_or_paths(), get_parameterized_baserel_size(), make_pathkeys_for_window(), max_parallel_hazard_walker(), process_matched_tle(), simplify_and_arguments(), and simplify_or_arguments().

553 {
554  List *result;
555  int new_len;
556 
557  if (list1 == NIL)
558  return list_copy(list2);
559  if (list2 == NIL)
560  return list_copy(list1);
561 
562  Assert(list1->type == list2->type);
563 
564  new_len = list1->length + list2->length;
565  result = new_list(list1->type, new_len);
566  memcpy(result->elements, list1->elements,
567  list1->length * sizeof(ListCell));
568  memcpy(result->elements + list1->length, list2->elements,
569  list2->length * sizeof(ListCell));
570 
571  check_list_invariants(result);
572  return result;
573 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_concat_unique()

List* list_concat_unique ( List list1,
const List list2 
)

Definition at line 1234 of file list.c.

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

Referenced by create_bitmap_subplan(), and select_active_windows().

1235 {
1236  ListCell *cell;
1237 
1238  Assert(IsPointerList(list1));
1239  Assert(IsPointerList(list2));
1240 
1241  foreach(cell, list2)
1242  {
1243  if (!list_member(list1, lfirst(cell)))
1244  list1 = lappend(list1, lfirst(cell));
1245  }
1246 
1247  check_list_invariants(list1);
1248  return list1;
1249 }
#define check_list_invariants(l)
Definition: list.c:75
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_concat_unique_int()

List* list_concat_unique_int ( List list1,
const List list2 
)

Definition at line 1277 of file list.c.

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

1278 {
1279  ListCell *cell;
1280 
1281  Assert(IsIntegerList(list1));
1282  Assert(IsIntegerList(list2));
1283 
1284  foreach(cell, list2)
1285  {
1286  if (!list_member_int(list1, lfirst_int(cell)))
1287  list1 = lappend_int(list1, lfirst_int(cell));
1288  }
1289 
1290  check_list_invariants(list1);
1291  return list1;
1292 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
bool list_member_int(const List *list, int datum)
Definition: list.c:654
List * lappend_int(List *list, int datum)
Definition: list.c:339
#define Assert(condition)
Definition: c.h:732

◆ list_concat_unique_oid()

List* list_concat_unique_oid ( List list1,
const List list2 
)

Definition at line 1298 of file list.c.

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

Referenced by GetRelationPublicationActions().

1299 {
1300  ListCell *cell;
1301 
1302  Assert(IsOidList(list1));
1303  Assert(IsOidList(list2));
1304 
1305  foreach(cell, list2)
1306  {
1307  if (!list_member_oid(list1, lfirst_oid(cell)))
1308  list1 = lappend_oid(list1, lfirst_oid(cell));
1309  }
1310 
1311  check_list_invariants(list1);
1312  return list1;
1313 }
#define check_list_invariants(l)
Definition: list.c:75
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
#define IsOidList(l)
Definition: list.c:54
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:732
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_concat_unique_ptr()

List* list_concat_unique_ptr ( List list1,
const List list2 
)

Definition at line 1256 of file list.c.

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

1257 {
1258  ListCell *cell;
1259 
1260  Assert(IsPointerList(list1));
1261  Assert(IsPointerList(list2));
1262 
1263  foreach(cell, list2)
1264  {
1265  if (!list_member_ptr(list1, lfirst(cell)))
1266  list1 = lappend(list1, lfirst(cell));
1267  }
1268 
1269  check_list_invariants(list1);
1270  return list1;
1271 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
bool list_member_ptr(const List *list, const void *datum)
Definition: list.c:634
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_copy()

List* list_copy ( const List oldlist)

Definition at line 1400 of file list.c.

References check_list_invariants, List::elements, List::length, new_list(), NIL, and List::type.

Referenced by accumulate_append_subpath(), arrayconst_startup_fn(), arrayexpr_startup_fn(), build_joinrel_partition_info(), build_subplan(), check_index_predicates(), consider_groupingsets_paths(), ConstraintImpliedByRelConstraint(), copy_pathtarget(), copyObjectImpl(), CopyOverrideSearchPath(), create_append_path(), create_append_plan(), create_merge_append_path(), create_merge_append_plan(), does_not_exist_skipping(), EventTriggerCollectGrant(), ExecuteTruncateGuts(), expand_indexqual_rowcompare(), expression_tree_mutator(), fetch_search_path(), generate_mergejoin_paths(), get_eclass_for_sort_expr(), get_foreign_key_join_selectivity(), get_object_address_attrdef(), get_object_address_attribute(), get_object_address_opf_member(), get_object_address_relobject(), get_query_def(), get_required_extension(), get_steps_using_prefix_recurse(), get_switched_clauses(), get_useful_pathkeys_for_relation(), GetOverrideSearchPath(), 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(), owningrel_does_not_exist_skipping(), process_owned_by(), PushOverrideSearchPath(), recomputeNamespacePath(), RelationGetIndexList(), RelationGetStatExtList(), remove_rel_from_query(), reorder_grouping_sets(), roles_has_privs_of(), roles_is_member_of(), select_active_windows(), select_outer_pathkeys_for_merge(), set_using_names(), SetReindexPending(), simplify_and_arguments(), simplify_or_arguments(), sort_inner_and_outer(), transformWithClause(), and truncate_useless_pathkeys().

1401 {
1402  List *newlist;
1403 
1404  if (oldlist == NIL)
1405  return NIL;
1406 
1407  newlist = new_list(oldlist->type, oldlist->length);
1408  memcpy(newlist->elements, oldlist->elements,
1409  newlist->length * sizeof(ListCell));
1410 
1411  check_list_invariants(newlist);
1412  return newlist;
1413 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_copy_deep()

List* list_copy_deep ( const List oldlist)

Definition at line 1445 of file list.c.

References Assert, check_list_invariants, copyObjectImpl(), List::elements, i, IsA, List::length, lfirst, new_list(), NIL, and List::type.

Referenced by copyObjectImpl().

1446 {
1447  List *newlist;
1448 
1449  if (oldlist == NIL)
1450  return NIL;
1451 
1452  /* This is only sensible for pointer Lists */
1453  Assert(IsA(oldlist, List));
1454 
1455  newlist = new_list(oldlist->type, oldlist->length);
1456  for (int i = 0; i < newlist->length; i++)
1457  lfirst(&newlist->elements[i]) =
1458  copyObjectImpl(lfirst(&oldlist->elements[i]));
1459 
1460  check_list_invariants(newlist);
1461  return newlist;
1462 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52
int i
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86
void * copyObjectImpl(const void *from)
Definition: copyfuncs.c:4757

◆ list_copy_tail()

List* list_copy_tail ( const List oldlist,
int  nskip 
)

Definition at line 1419 of file list.c.

References check_list_invariants, List::elements, List::length, new_list(), NIL, and List::type.

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

1420 {
1421  List *newlist;
1422 
1423  if (nskip < 0)
1424  nskip = 0; /* would it be better to elog? */
1425 
1426  if (oldlist == NIL || nskip >= oldlist->length)
1427  return NIL;
1428 
1429  newlist = new_list(oldlist->type, oldlist->length - nskip);
1430  memcpy(newlist->elements, &oldlist->elements[nskip],
1431  newlist->length * sizeof(ListCell));
1432 
1433  check_list_invariants(newlist);
1434  return newlist;
1435 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_deduplicate_oid()

void list_deduplicate_oid ( List list)

Definition at line 1322 of file list.c.

References Assert, check_list_invariants, List::elements, i, IsOidList, List::length, list_length(), and ListCell::oid_value.

Referenced by heap_truncate_find_FKs().

1323 {
1324  int len;
1325 
1326  Assert(IsOidList(list));
1327  len = list_length(list);
1328  if (len > 1)
1329  {
1330  ListCell *elements = list->elements;
1331  int i = 0;
1332 
1333  for (int j = 1; j < len; j++)
1334  {
1335  if (elements[i].oid_value != elements[j].oid_value)
1336  elements[++i].oid_value = elements[j].oid_value;
1337  }
1338  list->length = i + 1;
1339  }
1340  check_list_invariants(list);
1341 }
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
#define IsOidList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:732
static int list_length(const List *l)
Definition: pg_list.h:169
int length
Definition: pg_list.h:53
Oid oid_value
Definition: pg_list.h:47
int i

◆ list_delete()

List* list_delete ( List list,
void *  datum 
)

Definition at line 774 of file list.c.

References Assert, check_list_invariants, equal(), IsPointerList, lfirst, sort-test::list, and list_delete_cell().

Referenced by postgresGetForeignPlan(), and unregister_ENR().

775 {
776  ListCell *cell;
777 
778  Assert(IsPointerList(list));
779  check_list_invariants(list);
780 
781  foreach(cell, list)
782  {
783  if (equal(lfirst(cell), datum))
784  return list_delete_cell(list, cell);
785  }
786 
787  /* Didn't find a match: return the list unmodified */
788  return list;
789 }
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3008
#define check_list_invariants(l)
Definition: list.c:75
#define IsPointerList(l)
Definition: list.c:52
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:764
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_delete_cell()

List* list_delete_cell ( List list,
ListCell cell 
)

Definition at line 764 of file list.c.

References List::elements, and list_delete_nth_cell().

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

765 {
766  return list_delete_nth_cell(list, cell - list->elements);
767 }
ListCell * elements
Definition: pg_list.h:55
List * list_delete_nth_cell(List *list, int n)
Definition: list.c:696

◆ list_delete_first()

◆ list_delete_int()

List* list_delete_int ( List list,
int  datum 
)

Definition at line 812 of file list.c.

References Assert, check_list_invariants, IsIntegerList, lfirst_int, sort-test::list, and list_delete_cell().

Referenced by reorder_grouping_sets().

813 {
814  ListCell *cell;
815 
816  Assert(IsIntegerList(list));
817  check_list_invariants(list);
818 
819  foreach(cell, list)
820  {
821  if (lfirst_int(cell) == datum)
822  return list_delete_cell(list, cell);
823  }
824 
825  /* Didn't find a match: return the list unmodified */
826  return list;
827 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:764
#define Assert(condition)
Definition: c.h:732

◆ list_delete_last()

List* list_delete_last ( List list)

Definition at line 874 of file list.c.

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

Referenced by CheckAttributeType(), fireRIRrules(), inline_function(), LockViewRecurse(), and RewriteQuery().

875 {
876  check_list_invariants(list);
877 
878  if (list == NIL)
879  return NIL; /* would an error be better? */
880 
881  /* list_truncate won't free list if it goes to empty, but this should */
882  if (list_length(list) <= 1)
883  {
884  list_free(list);
885  return NIL;
886  }
887 
888  return list_truncate(list, list_length(list) - 1);
889 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_truncate(List *list, int new_size)
Definition: list.c:585
static int list_length(const List *l)
Definition: pg_list.h:169
void list_free(List *list)
Definition: list.c:1373

◆ list_delete_nth_cell()

List* list_delete_nth_cell ( List list,
int  n 
)

Definition at line 696 of file list.c.

References Assert, check_list_invariants, List::elements, GetMemoryChunkContext(), List::initial_elements, List::length, sort-test::list, list_free(), List::max_length, memmove, MemoryContextAlloc(), NIL, offsetof, pfree(), PG_USED_FOR_ASSERTS_ONLY, and repalloc().

Referenced by list_delete_cell(), list_delete_first(), and MergeAttributes().

697 {
698  check_list_invariants(list);
699 
700  Assert(n >= 0 && n < list->length);
701 
702  /*
703  * If we're about to delete the last node from the list, free the whole
704  * list instead and return NIL, which is the only valid representation of
705  * a zero-length list.
706  */
707  if (list->length == 1)
708  {
709  list_free(list);
710  return NIL;
711  }
712 
713  /*
714  * Otherwise, we normally just collapse out the removed element. But for
715  * debugging purposes, move the whole list contents someplace else.
716  *
717  * (Note that we *must* keep the contents in the same memory context.)
718  */
719 #ifndef DEBUG_LIST_MEMORY_USAGE
720  memmove(&list->elements[n], &list->elements[n + 1],
721  (list->length - 1 - n) * sizeof(ListCell));
722  list->length--;
723 #else
724  {
725  ListCell *newelems;
726  int newmaxlen = list->length - 1;
727 
728  newelems = (ListCell *)
730  newmaxlen * sizeof(ListCell));
731  memcpy(newelems, list->elements, n * sizeof(ListCell));
732  memcpy(&newelems[n], &list->elements[n + 1],
733  (list->length - 1 - n) * sizeof(ListCell));
734  if (list->elements != list->initial_elements)
735  pfree(list->elements);
736  else
737  {
738  /*
739  * As in enlarge_list(), tell palloc code we're not using the
740  * initial_elements space anymore.
741  */
743 
744  newlist = (List *) repalloc(list, offsetof(List, initial_elements));
745  Assert(newlist == list);
746  }
747  list->elements = newelems;
748  list->max_length = newmaxlen;
749  list->length--;
750  check_list_invariants(list);
751  }
752 #endif
753 
754  return list;
755 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
void pfree(void *pointer)
Definition: mcxt.c:1031
#define memmove(d, s, c)
Definition: c.h:1238
union ListCell ListCell
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1044
int length
Definition: pg_list.h:53
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:771
void list_free(List *list)
Definition: list.c:1373
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57
#define PG_USED_FOR_ASSERTS_ONLY
Definition: c.h:123
Definition: pg_list.h:50
#define offsetof(type, field)
Definition: c.h:655
static MemoryContext GetMemoryChunkContext(void *pointer)
Definition: memutils.h:112

◆ list_delete_oid()

List* list_delete_oid ( List list,
Oid  datum 
)

Definition at line 831 of file list.c.

References Assert, check_list_invariants, IsOidList, lfirst_oid, sort-test::list, and list_delete_cell().

Referenced by RemoveReindexPending().

832 {
833  ListCell *cell;
834 
835  Assert(IsOidList(list));
836  check_list_invariants(list);
837 
838  foreach(cell, list)
839  {
840  if (lfirst_oid(cell) == datum)
841  return list_delete_cell(list, cell);
842  }
843 
844  /* Didn't find a match: return the list unmodified */
845  return list;
846 }
#define check_list_invariants(l)
Definition: list.c:75
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:764
#define IsOidList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:732
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_delete_ptr()

List* list_delete_ptr ( List list,
void *  datum 
)

Definition at line 793 of file list.c.

References Assert, check_list_invariants, IsPointerList, lfirst, sort-test::list, and list_delete_cell().

Referenced by adjustJoinTreeList(), ConvertTriggerToFK(), FreeExprContext(), generateSerialExtraStmts(), process_equivalence(), reconsider_full_join_clause(), remove_join_clause_from_rels(), sort_inner_and_outer(), and transformMultiAssignRef().

794 {
795  ListCell *cell;
796 
797  Assert(IsPointerList(list));
798  check_list_invariants(list);
799 
800  foreach(cell, list)
801  {
802  if (lfirst(cell) == datum)
803  return list_delete_cell(list, cell);
804  }
805 
806  /* Didn't find a match: return the list unmodified */
807  return list;
808 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsPointerList(l)
Definition: list.c:52
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:764
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_difference()

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

Definition at line 1073 of file list.c.

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

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

1074 {
1075  const ListCell *cell;
1076  List *result = NIL;
1077 
1078  Assert(IsPointerList(list1));
1079  Assert(IsPointerList(list2));
1080 
1081  if (list2 == NIL)
1082  return list_copy(list1);
1083 
1084  foreach(cell, list1)
1085  {
1086  if (!list_member(list2, lfirst(cell)))
1087  result = lappend(result, lfirst(cell));
1088  }
1089 
1090  check_list_invariants(result);
1091  return result;
1092 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Definition: pg_list.h:50

◆ list_difference_int()

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

Definition at line 1124 of file list.c.

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

Referenced by reorder_grouping_sets().

1125 {
1126  const ListCell *cell;
1127  List *result = NIL;
1128 
1129  Assert(IsIntegerList(list1));
1130  Assert(IsIntegerList(list2));
1131 
1132  if (list2 == NIL)
1133  return list_copy(list1);
1134 
1135  foreach(cell, list1)
1136  {
1137  if (!list_member_int(list2, lfirst_int(cell)))
1138  result = lappend_int(result, lfirst_int(cell));
1139  }
1140 
1141  check_list_invariants(result);
1142  return result;
1143 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
bool list_member_int(const List *list, int datum)
Definition: list.c:654
List * lappend_int(List *list, int datum)
Definition: list.c:339
#define Assert(condition)
Definition: c.h:732
Definition: pg_list.h:50

◆ list_difference_oid()

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

Definition at line 1149 of file list.c.

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

1150 {
1151  const ListCell *cell;
1152  List *result = NIL;
1153 
1154  Assert(IsOidList(list1));
1155  Assert(IsOidList(list2));
1156 
1157  if (list2 == NIL)
1158  return list_copy(list1);
1159 
1160  foreach(cell, list1)
1161  {
1162  if (!list_member_oid(list2, lfirst_oid(cell)))
1163  result = lappend_oid(result, lfirst_oid(cell));
1164  }
1165 
1166  check_list_invariants(result);
1167  return result;
1168 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
#define IsOidList(l)
Definition: list.c:54
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:732
Definition: pg_list.h:50
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_difference_ptr()

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

Definition at line 1099 of file list.c.

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

Referenced by create_bitmap_scan_plan(), and ExecuteTruncateGuts().

1100 {
1101  const ListCell *cell;
1102  List *result = NIL;
1103 
1104  Assert(IsPointerList(list1));
1105  Assert(IsPointerList(list2));
1106 
1107  if (list2 == NIL)
1108  return list_copy(list1);
1109 
1110  foreach(cell, list1)
1111  {
1112  if (!list_member_ptr(list2, lfirst(cell)))
1113  result = lappend(result, lfirst(cell));
1114  }
1115 
1116  check_list_invariants(result);
1117  return result;
1118 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
bool list_member_ptr(const List *list, const void *datum)
Definition: list.c:634
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Definition: pg_list.h:50

◆ list_free()

void list_free ( List list)

Definition at line 1373 of file list.c.

References list_free_private().

Referenced by AfterTriggerSetState(), AlterIndexNamespaces(), arrayconst_cleanup_fn(), arrayexpr_cleanup_fn(), ATCheckPartitionsNotInUse(), AtEOSubXact_Namespace(), AtEOXact_Namespace(), ATExecChangeOwner(), ATExecDropNotNull(), ATExecSetTableSpace(), build_base_rel_tlists(), build_remote_returning(), calc_joinrel_size_estimate(), calculate_indexes_size(), calculate_toast_table_size(), check_datestyle(), check_log_destination(), check_search_path(), check_temp_tablespaces(), check_wal_consistency_checking(), choose_bitmap_and(), compute_semi_anti_join_factors(), CopyFrom(), CopyMultiInsertBufferFlush(), CopyMultiInsertInfoCleanup(), CreateExtensionInternal(), CreateTrigger(), current_schema(), current_schemas(), DefineIndex(), DefineRelation(), distribute_qual_to_rels(), DropSubscription(), EventTriggerDDLCommandEnd(), EventTriggerDDLCommandStart(), EventTriggerSQLDrop(), EventTriggerTableRewrite(), ExecInitPartitionInfo(), ExecInsert(), ExecOpenIndices(), ExecRefreshMatView(), ExecResetTupleTable(), ExecSimpleRelationInsert(), ExecSimpleRelationUpdate(), ExecUpdate(), extract_lateral_references(), ExtractExtensionList(), find_all_inheritors(), find_compatible_peragg(), find_expr_references_walker(), find_hash_columns(), find_placeholders_in_expr(), fix_placeholder_input_needed_levels(), generate_base_implied_equalities_no_const(), generate_partitionwise_join_paths(), get_rel_sync_entry(), get_relation_info(), get_relation_statistics(), get_steps_using_prefix_recurse(), index_concurrently_swap(), index_get_partition(), infer_arbiter_indexes(), is_admin_of_role(), list_delete_last(), list_delete_nth_cell(), make_group_input_target(), make_partial_grouping_target(), make_pathkeys_for_window(), make_sort_input_target(), make_window_input_target(), max_parallel_hazard_walker(), OpenTableList(), parse_hba_auth_opt(), pg_partition_root(), pgstat_write_statsfiles(), plpgsql_extra_checks_check_hook(), pop_ancestor_plan(), PopOverrideSearchPath(), PostmasterMain(), prepare_sort_from_pathkeys(), PrepareTempTablespaces(), preprocess_targetlist(), ProcessUtilitySlow(), qual_is_pushdown_safe(), recomputeNamespacePath(), refresh_by_match_merge(), RelationCacheInvalidate(), RelationDestroyRelation(), RelationGetIndexAttrBitmap(), RelationGetIndexList(), RelationGetPrimaryKeyIndex(), RelationGetReplicaIndex(), RelationGetStatExtList(), relationHasPrimaryKey(), reorder_grouping_sets(), reparameterize_pathlist_by_child(), roles_has_privs_of(), roles_is_member_of(), sepgsql_dml_privileges(), simplify_and_arguments(), simplify_or_arguments(), stringToQualifiedNameList(), SyncRepGetSyncRecPtr(), SyncRepGetSyncStandbysPriority(), textToQualifiedNameList(), toast_open_indexes(), transformFkeyCheckAttrs(), transformFkeyGetPrimaryKey(), transformTableLikeClause(), transformValuesClause(), triggered_change_notification(), typeInheritsFrom(), vac_open_indexes(), and WaitForLockers().

1374 {
1375  list_free_private(list, false);
1376 }
static void list_free_private(List *list, bool deep)
Definition: list.c:1347

◆ list_free_deep()

void list_free_deep ( List list)

Definition at line 1387 of file list.c.

References Assert, IsPointerList, and list_free_private().

Referenced by AfterTriggerFreeQuery(), AtEOSubXact_ApplyLauncher(), ATExecDetachPartition(), checkSharedDependencies(), Exec_UnlistenAllCommit(), FreeSubscription(), get_rel_sync_entry(), gistbufferinginserttuples(), load_libraries(), lookup_proof_cache(), PostmasterMain(), process_syncing_tables_for_apply(), RelationDestroyRelation(), RelationGetFKeyList(), rescanLatestTimeLine(), StartReplication(), WaitForLockersMultiple(), XLogReadDetermineTimeline(), and XLogSendPhysical().

1388 {
1389  /*
1390  * A "deep" free operation only makes sense on a list of pointers.
1391  */
1392  Assert(IsPointerList(list));
1393  list_free_private(list, true);
1394 }
#define IsPointerList(l)
Definition: list.c:52
#define Assert(condition)
Definition: c.h:732
static void list_free_private(List *list, bool deep)
Definition: list.c:1347

◆ list_free_private()

static void list_free_private ( List list,
bool  deep 
)
static

Definition at line 1347 of file list.c.

References check_list_invariants, List::elements, i, List::initial_elements, List::length, lfirst, NIL, and pfree().

Referenced by list_free(), and list_free_deep().

1348 {
1349  if (list == NIL)
1350  return; /* nothing to do */
1351 
1352  check_list_invariants(list);
1353 
1354  if (deep)
1355  {
1356  for (int i = 0; i < list->length; i++)
1357  pfree(lfirst(&list->elements[i]));
1358  }
1359  if (list->elements != list->initial_elements)
1360  pfree(list->elements);
1361  pfree(list);
1362 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
void pfree(void *pointer)
Definition: mcxt.c:1031
ListCell * elements
Definition: pg_list.h:55
#define lfirst(lc)
Definition: pg_list.h:190
int length
Definition: pg_list.h:53
int i
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57

◆ list_insert_nth()

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

Definition at line 400 of file list.c.

References Assert, check_list_invariants, insert_new_cell(), IsPointerList, lfirst, sort-test::list, list_make1, and NIL.

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

401 {
402  if (list == NIL)
403  {
404  Assert(pos == 0);
405  return list_make1(datum);
406  }
407  Assert(IsPointerList(list));
408  lfirst(insert_new_cell(list, pos)) = datum;
409  check_list_invariants(list);
410  return list;
411 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
static ListCell * insert_new_cell(List *list, int pos)
Definition: list.c:379
#define list_make1(x1)
Definition: pg_list.h:227
#define IsPointerList(l)
Definition: list.c:52
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_insert_nth_int()

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

Definition at line 414 of file list.c.

References Assert, check_list_invariants, insert_new_cell(), IsIntegerList, lfirst_int, sort-test::list, list_make1_int, and NIL.

415 {
416  if (list == NIL)
417  {
418  Assert(pos == 0);
419  return list_make1_int(datum);
420  }
421  Assert(IsIntegerList(list));
422  lfirst_int(insert_new_cell(list, pos)) = datum;
423  check_list_invariants(list);
424  return list;
425 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
static ListCell * insert_new_cell(List *list, int pos)
Definition: list.c:379
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
#define list_make1_int(x1)
Definition: pg_list.h:238
#define Assert(condition)
Definition: c.h:732

◆ list_insert_nth_oid()

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

Definition at line 428 of file list.c.

References Assert, check_list_invariants, insert_new_cell(), IsOidList, lfirst_oid, sort-test::list, list_make1_oid, and NIL.

429 {
430  if (list == NIL)
431  {
432  Assert(pos == 0);
433  return list_make1_oid(datum);
434  }
435  Assert(IsOidList(list));
436  lfirst_oid(insert_new_cell(list, pos)) = datum;
437  check_list_invariants(list);
438  return list;
439 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
static ListCell * insert_new_cell(List *list, int pos)
Definition: list.c:379
#define list_make1_oid(x1)
Definition: pg_list.h:249
#define IsOidList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:732
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_intersection()

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

Definition at line 1015 of file list.c.

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

Referenced by find_nonnullable_vars_walker(), and reduce_outer_joins_pass2().

1016 {
1017  List *result;
1018  const ListCell *cell;
1019 
1020  if (list1 == NIL || list2 == NIL)
1021  return NIL;
1022 
1023  Assert(IsPointerList(list1));
1024  Assert(IsPointerList(list2));
1025 
1026  result = NIL;
1027  foreach(cell, list1)
1028  {
1029  if (list_member(list2, lfirst(cell)))
1030  result = lappend(result, lfirst(cell));
1031  }
1032 
1033  check_list_invariants(result);
1034  return result;
1035 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Definition: pg_list.h:50

◆ list_intersection_int()

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

Definition at line 1041 of file list.c.

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

Referenced by parseCheckAggregates().

1042 {
1043  List *result;
1044  const ListCell *cell;
1045 
1046  if (list1 == NIL || list2 == NIL)
1047  return NIL;
1048 
1049  Assert(IsIntegerList(list1));
1050  Assert(IsIntegerList(list2));
1051 
1052  result = NIL;
1053  foreach(cell, list1)
1054  {
1055  if (list_member_int(list2, lfirst_int(cell)))
1056  result = lappend_int(result, lfirst_int(cell));
1057  }
1058 
1059  check_list_invariants(result);
1060  return result;
1061 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:75
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
bool list_member_int(const List *list, int datum)
Definition: list.c:654
List * lappend_int(List *list, int datum)
Definition: list.c:339
#define Assert(condition)
Definition: c.h:732
Definition: pg_list.h:50

◆ list_make1_impl()

List* list_make1_impl ( NodeTag  t,
ListCell  datum1 
)

Definition at line 233 of file list.c.

References check_list_invariants, List::elements, sort-test::list, and new_list().

234 {
235  List *list = new_list(t, 1);
236 
237  list->elements[0] = datum1;
238  check_list_invariants(list);
239  return list;
240 }
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_make2_impl()

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

Definition at line 243 of file list.c.

References check_list_invariants, List::elements, sort-test::list, and new_list().

244 {
245  List *list = new_list(t, 2);
246 
247  list->elements[0] = datum1;
248  list->elements[1] = datum2;
249  check_list_invariants(list);
250  return list;
251 }
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_make3_impl()

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

Definition at line 254 of file list.c.

References check_list_invariants, List::elements, sort-test::list, and new_list().

256 {
257  List *list = new_list(t, 3);
258 
259  list->elements[0] = datum1;
260  list->elements[1] = datum2;
261  list->elements[2] = datum3;
262  check_list_invariants(list);
263  return list;
264 }
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_make4_impl()

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

Definition at line 267 of file list.c.

References check_list_invariants, List::elements, sort-test::list, and new_list().

269 {
270  List *list = new_list(t, 4);
271 
272  list->elements[0] = datum1;
273  list->elements[1] = datum2;
274  list->elements[2] = datum3;
275  list->elements[3] = datum4;
276  check_list_invariants(list);
277  return list;
278 }
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:86

◆ list_member()

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

Definition at line 613 of file list.c.

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

Referenced by add_new_column_to_pathtarget(), build_minmax_path(), create_bitmap_scan_plan(), ec_member_matches_foreign(), find_window_functions_walker(), group_by_has_partkey(), infer_arbiter_indexes(), list_append_unique(), list_concat_unique(), list_difference(), list_intersection(), list_union(), process_duplicate_ors(), split_pathtarget_at_srfs(), and split_pathtarget_walker().

614 {
615  const ListCell *cell;
616 
617  Assert(IsPointerList(list));
618  check_list_invariants(list);
619 
620  foreach(cell, list)
621  {
622  if (equal(lfirst(cell), datum))
623  return true;
624  }
625 
626  return false;
627 }
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3008
#define check_list_invariants(l)
Definition: list.c:75
#define IsPointerList(l)
Definition: list.c:52
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_member_int()

bool list_member_int ( const List list,
int  datum 
)

Definition at line 654 of file list.c.

References Assert, check_list_invariants, IsIntegerList, and lfirst_int.

Referenced by BeginCopy(), BeginCopyFrom(), check_ungrouped_columns_walker(), CopyGetAttnums(), estimate_num_groups(), 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(), pg_stat_get_wal_senders(), reorder_grouping_sets(), and transformDistinctOnClause().

655 {
656  const ListCell *cell;
657 
658  Assert(IsIntegerList(list));
659  check_list_invariants(list);
660 
661  foreach(cell, list)
662  {
663  if (lfirst_int(cell) == datum)
664  return true;
665  }
666 
667  return false;
668 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
#define Assert(condition)
Definition: c.h:732

◆ list_member_oid()

bool list_member_oid ( const List list,
Oid  datum 
)

Definition at line 674 of file list.c.

References Assert, check_list_invariants, IsOidList, and lfirst_oid.

Referenced by AfterTriggerSaveEvent(), AlterTableMoveAll(), ATExecAddInherit(), ATExecAttachPartition(), BeginCopy(), CheckAttributeType(), CloneFkReferencing(), CollationIsVisible(), ConversionIsVisible(), DefineRelation(), ec_member_matches_indexcol(), ExecCheckIndexConstraints(), ExecInitPartitionInfo(), ExecInsertIndexTuples(), ExecuteTruncate(), fireRIRrules(), FunctionIsVisible(), get_rel_sync_entry(), get_transform_fromsql(), get_transform_tosql(), 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(), OpclassIsVisible(), OpenTableList(), OperatorIsVisible(), OpfamilyIsVisible(), pgstat_db_requested(), pgstat_recv_inquiry(), PlanCacheRelCallback(), recomputeNamespacePath(), ReindexIsProcessingIndex(), relation_has_unique_index_for(), RelationIsVisible(), RememberConstraintForRebuilding(), RememberIndexForRebuilding(), StatisticsObjIsVisible(), TSConfigIsVisible(), TSDictionaryIsVisible(), TSParserIsVisible(), TSTemplateIsVisible(), typeInheritsFrom(), and TypeIsVisible().

675 {
676  const ListCell *cell;
677 
678  Assert(IsOidList(list));
679  check_list_invariants(list);
680 
681  foreach(cell, list)
682  {
683  if (lfirst_oid(cell) == datum)
684  return true;
685  }
686 
687  return false;
688 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsOidList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:732
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_member_ptr()

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

Definition at line 634 of file list.c.

References Assert, check_list_invariants, IsPointerList, and lfirst.

Referenced by create_bitmap_scan_plan(), create_tidscan_plan(), get_foreign_key_join_selectivity(), list_append_unique_ptr(), list_concat_unique_ptr(), list_difference_ptr(), list_union_ptr(), postgresGetForeignPlan(), preprocess_groupclause(), and remove_join_clause_from_rels().

635 {
636  const ListCell *cell;
637 
638  Assert(IsPointerList(list));
639  check_list_invariants(list);
640 
641  foreach(cell, list)
642  {
643  if (lfirst(cell) == datum)
644  return true;
645  }
646 
647  return false;
648 }
#define check_list_invariants(l)
Definition: list.c:75
#define IsPointerList(l)
Definition: list.c:52
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190

◆ list_oid_cmp()

int list_oid_cmp ( const ListCell p1,
const ListCell p2 
)

Definition at line 1495 of file list.c.

References lfirst_oid.

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

1496 {
1497  Oid v1 = lfirst_oid(p1);
1498  Oid v2 = lfirst_oid(p2);
1499 
1500  if (v1 < v2)
1501  return -1;
1502  if (v1 > v2)
1503  return 1;
1504  return 0;
1505 }
unsigned int Oid
Definition: postgres_ext.h:31
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_sort()

void list_sort ( List list,
list_sort_comparator  cmp 
)

Definition at line 1478 of file list.c.

References check_list_invariants, List::elements, list_length(), and qsort.

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

1479 {
1480  typedef int (*qsort_comparator) (const void *a, const void *b);
1481  int len;
1482 
1483  check_list_invariants(list);
1484 
1485  /* Nothing to do if there's less than two elements */
1486  len = list_length(list);
1487  if (len > 1)
1488  qsort(list->elements, len, sizeof(ListCell), (qsort_comparator) cmp);
1489 }
#define check_list_invariants(l)
Definition: list.c:75
ListCell * elements
Definition: pg_list.h:55
static int list_length(const List *l)
Definition: pg_list.h:169
#define qsort(a, b, c, d)
Definition: port.h:492
static int cmp(const chr *x, const chr *y, size_t len)
Definition: regc_locale.c:742

◆ list_truncate()

List* list_truncate ( List list,
int  new_size 
)

Definition at line 585 of file list.c.

References List::length, sort-test::list, list_length(), and NIL.

Referenced by accumulate_append_subpath(), choose_bitmap_and(), create_append_plan(), create_merge_append_plan(), does_not_exist_skipping(), expand_indexqual_rowcompare(), ExpandIndirectionStar(), expandRTE(), generate_mergejoin_paths(), geqo_eval(), get_object_address_attrdef(), get_object_address_attribute(), get_object_address_opf_member(), get_object_address_relobject(), list_delete_last(), owningrel_does_not_exist_skipping(), ParseFuncOrColumn(), process_owned_by(), transformAggregateCall(), transformFromClauseItem(), transformSetOperationStmt(), and truncate_useless_pathkeys().

586 {
587  if (new_size <= 0)
588  return NIL; /* truncate to zero length */
589 
590  /* If asked to effectively extend the list, do nothing */
591  if (new_size < list_length(list))
592  list->length = new_size;
593 
594  /*
595  * Note: unlike the individual-list-cell deletion functions, we don't move
596  * the list cells to new storage, even in DEBUG_LIST_MEMORY_USAGE mode.
597  * This is because none of them can move in this operation, so just like
598  * in the old cons-cell-based implementation, this function doesn't
599  * invalidate any pointers to cells of the list. This is also the reason
600  * for not wiping the memory of the deleted cells: the old code didn't
601  * free them either. Perhaps later we'll tighten this up.
602  */
603 
604  return list;
605 }
#define NIL
Definition: pg_list.h:65
static int list_length(const List *l)
Definition: pg_list.h:169
int length
Definition: pg_list.h:53

◆ list_union()

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

Definition at line 912 of file list.c.

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

Referenced by AddRelationNewConstraints(), and process_duplicate_ors().

913 {
914  List *result;
915  const ListCell *cell;
916 
917  Assert(IsPointerList(list1));
918  Assert(IsPointerList(list2));
919 
920  result = list_copy(list1);
921  foreach(cell, list2)
922  {
923  if (!list_member(result, lfirst(cell)))
924  result = lappend(result, lfirst(cell));
925  }
926 
927  check_list_invariants(result);
928  return result;
929 }
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Definition: pg_list.h:50

◆ list_union_int()

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

Definition at line 959 of file list.c.

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

Referenced by expand_grouping_sets().

960 {
961  List *result;
962  const ListCell *cell;
963 
964  Assert(IsIntegerList(list1));
965  Assert(IsIntegerList(list2));
966 
967  result = list_copy(list1);
968  foreach(cell, list2)
969  {
970  if (!list_member_int(result, lfirst_int(cell)))
971  result = lappend_int(result, lfirst_int(cell));
972  }
973 
974  check_list_invariants(result);
975  return result;
976 }
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
#define IsIntegerList(l)
Definition: list.c:53
#define lfirst_int(lc)
Definition: pg_list.h:191
bool list_member_int(const List *list, int datum)
Definition: list.c:654
List * lappend_int(List *list, int datum)
Definition: list.c:339
#define Assert(condition)
Definition: c.h:732
Definition: pg_list.h:50

◆ list_union_oid()

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

Definition at line 982 of file list.c.

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

983 {
984  List *result;
985  const ListCell *cell;
986 
987  Assert(IsOidList(list1));
988  Assert(IsOidList(list2));
989 
990  result = list_copy(list1);
991  foreach(cell, list2)
992  {
993  if (!list_member_oid(result, lfirst_oid(cell)))
994  result = lappend_oid(result, lfirst_oid(cell));
995  }
996 
997  check_list_invariants(result);
998  return result;
999 }
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
#define IsOidList(l)
Definition: list.c:54
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:732
Definition: pg_list.h:50
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ list_union_ptr()

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

Definition at line 936 of file list.c.

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

937 {
938  List *result;
939  const ListCell *cell;
940 
941  Assert(IsPointerList(list1));
942  Assert(IsPointerList(list2));
943 
944  result = list_copy(list1);
945  foreach(cell, list2)
946  {
947  if (!list_member_ptr(result, lfirst(cell)))
948  result = lappend(result, lfirst(cell));
949  }
950 
951  check_list_invariants(result);
952  return result;
953 }
#define check_list_invariants(l)
Definition: list.c:75
List * list_copy(const List *oldlist)
Definition: list.c:1400
#define IsPointerList(l)
Definition: list.c:52
List * lappend(List *list, void *datum)
Definition: list.c:321
bool list_member_ptr(const List *list, const void *datum)
Definition: list.c:634
#define Assert(condition)
Definition: c.h:732
#define lfirst(lc)
Definition: pg_list.h:190
Definition: pg_list.h:50

◆ new_head_cell()

static void new_head_cell ( List list)
static

Definition at line 287 of file list.c.

References List::elements, enlarge_list(), List::length, List::max_length, and memmove.

Referenced by lcons(), lcons_int(), and lcons_oid().

288 {
289  /* Enlarge array if necessary */
290  if (list->length >= list->max_length)
291  enlarge_list(list, list->length + 1);
292  /* Now shove the existing data over */
293  memmove(&list->elements[1], &list->elements[0],
294  list->length * sizeof(ListCell));
295  list->length++;
296 }
static void enlarge_list(List *list, int min_size)
Definition: list.c:152
#define memmove(d, s, c)
Definition: c.h:1238
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
int length
Definition: pg_list.h:53

◆ new_list()

static List* new_list ( NodeTag  type,
int  min_size 
)
static

Definition at line 86 of file list.c.

References Assert, List::elements, List::initial_elements, List::length, LIST_HEADER_OVERHEAD, List::max_length, offsetof, palloc(), List::type, and generate_unaccent_rules::type.

Referenced by lappend(), lappend_int(), lappend_oid(), lcons(), lcons_int(), lcons_oid(), list_concat_copy(), list_copy(), list_copy_deep(), list_copy_tail(), list_make1_impl(), list_make2_impl(), list_make3_impl(), list_make4_impl(), pg_parse_query(), and pg_rewrite_query().

87 {
88  List *newlist;
89  int max_size;
90 
91  Assert(min_size > 0);
92 
93  /*
94  * We allocate all the requested cells, and possibly some more, as part of
95  * the same palloc request as the List header. This is a big win for the
96  * typical case of short fixed-length lists. It can lose if we allocate a
97  * moderately long list and then it gets extended; we'll be wasting more
98  * initial_elements[] space than if we'd made the header small. However,
99  * rounding up the request as we do in the normal code path provides some
100  * defense against small extensions.
101  */
102 
103 #ifndef DEBUG_LIST_MEMORY_USAGE
104 
105  /*
106  * Normally, we set up a list with some extra cells, to allow it to grow
107  * without a repalloc. Prefer cell counts chosen to make the total
108  * allocation a power-of-2, since palloc would round it up to that anyway.
109  * (That stops being true for very large allocations, but very long lists
110  * are infrequent, so it doesn't seem worth special logic for such cases.)
111  *
112  * The minimum allocation is 8 ListCell units, providing either 4 or 5
113  * available ListCells depending on the machine's word width. Counting
114  * palloc's overhead, this uses the same amount of space as a one-cell
115  * list did in the old implementation, and less space for any longer list.
116  *
117  * We needn't worry about integer overflow; no caller passes min_size
118  * that's more than twice the size of an existing list, so the size limits
119  * within palloc will ensure that we don't overflow here.
120  */
121  max_size = 8; /* semi-arbitrary small power of 2 */
122  while (max_size < min_size + LIST_HEADER_OVERHEAD)
123  max_size *= 2;
124  max_size -= LIST_HEADER_OVERHEAD;
125 #else
126 
127  /*
128  * For debugging, don't allow any extra space. This forces any cell
129  * addition to go through enlarge_list() and thus move the existing data.
130  */
131  max_size = min_size;
132 #endif
133 
134  newlist = (List *) palloc(offsetof(List, initial_elements) +
135  max_size * sizeof(ListCell));
136  newlist->type = type;
137  newlist->length = min_size;
138  newlist->max_length = max_size;
139  newlist->elements = newlist->initial_elements;
140 
141  return newlist;
142 }
#define LIST_HEADER_OVERHEAD
Definition: list.c:45
union ListCell ListCell
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:732
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52
void * palloc(Size size)
Definition: mcxt.c:924
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57
Definition: pg_list.h:50
#define offsetof(type, field)
Definition: c.h:655

◆ new_tail_cell()

static void new_tail_cell ( List list)
static

Definition at line 305 of file list.c.

References enlarge_list(), List::length, and List::max_length.

Referenced by lappend(), lappend_int(), and lappend_oid().

306 {
307  /* Enlarge array if necessary */
308  if (list->length >= list->max_length)
309  enlarge_list(list, list->length + 1);
310  list->length++;
311 }
static void enlarge_list(List *list, int min_size)
Definition: list.c:152
int max_length
Definition: pg_list.h:54
int length
Definition: pg_list.h:53