PostgreSQL Source Code  git master
list.c File Reference
#include "postgres.h"
#include "nodes/pg_list.h"
#include "port/pg_bitutils.h"
#include "utils/memdebug.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 47 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, Max, List::max_length, MemoryContextAlloc(), pfree(), pg_nextpower2_32(), repalloc(), and VALGRIND_MAKE_MEM_NOACCESS.

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.
163  */
164 
165  /* clamp the minimum value to 16, a semi-arbitrary small power of 2 */
166  new_max_len = pg_nextpower2_32(Max(16, min_size));
167 
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  {
175  /*
176  * Replace original in-line allocation with a separate palloc block.
177  * Ensure it is in the same memory context as the List header. (The
178  * previous List implementation did not offer any guarantees about
179  * keeping all list cells in the same context, but it seems reasonable
180  * to create such a guarantee now.)
181  */
182  list->elements = (ListCell *)
184  new_max_len * sizeof(ListCell));
185  memcpy(list->elements, list->initial_elements,
186  list->length * sizeof(ListCell));
187 
188  /*
189  * We must not move the list header, so it's unsafe to try to reclaim
190  * the initial_elements[] space via repalloc. In debugging builds,
191  * however, we can clear that space and/or mark it inaccessible.
192  * (wipe_mem includes VALGRIND_MAKE_MEM_NOACCESS.)
193  */
194 #ifdef CLOBBER_FREED_MEMORY
195  wipe_mem(list->initial_elements,
196  list->max_length * sizeof(ListCell));
197 #else
199  list->max_length * sizeof(ListCell));
200 #endif
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 }
#define VALGRIND_MAKE_MEM_NOACCESS(addr, size)
Definition: memdebug.h:27
void pfree(void *pointer)
Definition: mcxt.c:1057
static uint32 pg_nextpower2_32(uint32 num)
Definition: pg_bitutils.h:146
union ListCell ListCell
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Max(x, y)
Definition: c.h:921
#define Assert(condition)
Definition: c.h:745
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1070
int length
Definition: pg_list.h:53
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:797
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57
static MemoryContext GetMemoryChunkContext(void *pointer)
Definition: memutils.h:113

◆ 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, and List::max_length.

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
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:745
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, sort-test::list, llast, 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_local_reloption(), add_merged_range_bounds(), 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(), addNSItemToQuery(), addRangeTableEntry(), addRangeTableEntryForCTE(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), addRangeTableEntryForJoin(), addRangeTableEntryForRelation(), addRangeTableEntryForSubquery(), addRangeTableEntryForTableFunc(), addRangeTableEntryForValues(), AddRelationNewConstraints(), 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(), ATExecValidateConstraint(), ATGetQueueEntry(), ATParseTransformCmd(), ATPostAlterTypeCleanup(), 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(), clauselist_apply_dependencies(), CloneFkReferenced(), CloneFkReferencing(), CloneRowTriggersToPartition(), coerce_fn_result_column(), 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(), CopyMultiInsertInfoFlush(), CopyMultiInsertInfoSetupBuffer(), cost_incremental_sort(), 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(), 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(), expandNSItemAttrs(), expandNSItemVars(), ExpandRowReference(), expandRTE(), expandTableLikeClause(), 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_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_matching_part_pairs(), 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_matching_part_pairs(), 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(), merge_list_bounds(), 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(), query_tree_mutator(), 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(), register_reloptions_validator(), ReindexRelationConcurrently(), relation_excluded_by_constraints(), relation_has_unique_index_for(), RelationCacheInvalidate(), RelationGetDummyIndexExpressions(), 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_joinrel_partition_key_exprs(), 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_incremental_sort_group_info(), 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  llast(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:77
#define llast(l)
Definition: pg_list.h:214
static void new_tail_cell(List *list)
Definition: list.c:305
#define IsPointerList(l)
Definition: list.c:54
Definition: nodes.h:299
#define Assert(condition)
Definition: c.h:745
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ lappend_int()

List* lappend_int ( List list,
int  datum 
)

Definition at line 339 of file list.c.

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

Referenced by add_merged_range_bounds(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), addRangeTableEntryForSubquery(), analyzeCTETargetList(), ATRewriteTable(), build_merged_partition_bounds(), build_subplan(), check_ungrouped_columns_walker(), checkInsertTargets(), convert_EXISTS_to_ANY(), CopyGetAttnums(), deparseAnalyzeSql(), deparseExplicitTargetList(), deparseTargetList(), ExecBuildAggTrans(), ExecBuildGroupingEqual(), ExecInitExprRec(), ExecInitQual(), ExecInitSubscriptingRef(), expand_indexqual_rowcompare(), extractRemainingColumns(), 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(), merge_list_bounds(), nodeRead(), postgresBeginForeignInsert(), postgresPlanDirectModify(), postgresPlanForeignModify(), rel_is_distinct_for(), remap_to_groupclause_idx(), reorder_grouping_sets(), set_plan_refs(), set_schema_sent_in_streamed_txn(), split_pathtarget_at_srfs(), SS_process_ctes(), TerminateOtherDBBackends(), transformDistinctOnClause(), transformFromClauseItem(), 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  llast_int(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:77
#define IsIntegerList(l)
Definition: list.c:55
static void new_tail_cell(List *list)
Definition: list.c:305
#define Assert(condition)
Definition: c.h:745
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88
#define llast_int(l)
Definition: pg_list.h:215

◆ lappend_oid()

List* lappend_oid ( List list,
Oid  datum 
)

Definition at line 357 of file list.c.

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

Referenced by add_rte_to_flat_rtable(), addRangeTableEntryForENR(), addRangeTableEntryForFunction(), addRangeTableEntryForSubquery(), 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(), getAutoExtensionsOfObject(), 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(), ReindexPartitions(), ReindexRelationConcurrently(), rel_is_distinct_for(), relation_is_updatable(), RelationGetIndexList(), RelationGetStatExtList(), RememberConstraintForRebuilding(), RememberIndexForRebuilding(), remove_dbtablespaces(), 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  llast_oid(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:77
#define llast_oid(l)
Definition: pg_list.h:216
static void new_tail_cell(List *list)
Definition: list.c:305
#define IsOidList(l)
Definition: list.c:56
#define Assert(condition)
Definition: c.h:745
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ lcons()

List* lcons ( void *  datum,
List list 
)

Definition at line 453 of file list.c.

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

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(), generate_orderedappend_paths(), generateSerialExtraStmts(), get_name_for_var_field(), get_object_address_rv(), get_query_def(), get_relation_info(), gistEmptyAllBuffers(), gistFindPath(), gistGetNodeBuffer(), gistPushItupToNodeBuffer(), hashagg_spill_finish(), 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(), SharedFileSetInit(), 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  linitial(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:77
#define linitial(l)
Definition: pg_list.h:194
#define IsPointerList(l)
Definition: list.c:54
Definition: nodes.h:299
#define Assert(condition)
Definition: c.h:745
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ lcons_int()

List* lcons_int ( int  datum,
List list 
)

Definition at line 471 of file list.c.

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

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

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  linitial_int(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:77
#define IsIntegerList(l)
Definition: list.c:55
#define linitial_int(l)
Definition: pg_list.h:195
#define Assert(condition)
Definition: c.h:745
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ lcons_oid()

List* lcons_oid ( Oid  datum,
List list 
)

Definition at line 489 of file list.c.

References Assert, check_list_invariants, IsOidList, linitial_oid, sort-test::list, 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  linitial_oid(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:77
#define IsOidList(l)
Definition: list.c:56
#define Assert(condition)
Definition: c.h:745
#define linitial_oid(l)
Definition: pg_list.h:196
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ list_append_unique()

List* list_append_unique ( List list,
void *  datum 
)

Definition at line 1180 of file list.c.

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

Referenced by add_security_quals(), and add_with_check_options().

1181 {
1182  if (list_member(list, datum))
1183  return list;
1184  else
1185  return lappend(list, datum);
1186 }
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 1205 of file list.c.

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

1206 {
1207  if (list_member_int(list, datum))
1208  return list;
1209  else
1210  return lappend_int(list, datum);
1211 }
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 1217 of file list.c.

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

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

1218 {
1219  if (list_member_oid(list, datum))
1220  return list;
1221  else
1222  return lappend_oid(list, datum);
1223 }
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 1193 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().

1194 {
1195  if (list_member_ptr(list, datum))
1196  return list;
1197  else
1198  return lappend(list, datum);
1199 }
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(), ATParseTransformCmd(), ATPostAlterTypeParse(), AtSubCommit_Notify(), build_joinrel_restrictlist(), build_paths_for_OR(), check_index_predicates(), 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(), GetPublicationRelations(), init_sql_fcache(), is_parallel_safe(), objectsInSchemaToOids(), process_equivalence(), process_sublinks_mutator(), ProcessUtilitySlow(), 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_joinrel_partition_key_exprs(), set_plan_refs(), split_pathtarget_at_srfs(), split_pathtarget_walker(), 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:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
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:745
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(), btadjustmembers(), build_paths_for_OR(), choose_bitmap_and(), create_scan_plan(), DefineIndex(), gen_partprune_steps(), generate_bitmap_or_paths(), get_parameterized_baserel_size(), hashadjustmembers(), make_pathkeys_for_window(), max_parallel_hazard_walker(), process_matched_tle(), set_joinrel_partition_key_exprs(), 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:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:745
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:88

◆ list_concat_unique()

List* list_concat_unique ( List list1,
const List list2 
)

Definition at line 1237 of file list.c.

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

Referenced by create_bitmap_subplan(), and select_active_windows().

1238 {
1239  ListCell *cell;
1240 
1241  Assert(IsPointerList(list1));
1242  Assert(IsPointerList(list2));
1243 
1244  foreach(cell, list2)
1245  {
1246  if (!list_member(list1, lfirst(cell)))
1247  list1 = lappend(list1, lfirst(cell));
1248  }
1249 
1250  check_list_invariants(list1);
1251  return list1;
1252 }
#define check_list_invariants(l)
Definition: list.c:77
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:54
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ list_concat_unique_int()

List* list_concat_unique_int ( List list1,
const List list2 
)

Definition at line 1280 of file list.c.

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

1281 {
1282  ListCell *cell;
1283 
1284  Assert(IsIntegerList(list1));
1285  Assert(IsIntegerList(list2));
1286 
1287  foreach(cell, list2)
1288  {
1289  if (!list_member_int(list1, lfirst_int(cell)))
1290  list1 = lappend_int(list1, lfirst_int(cell));
1291  }
1292 
1293  check_list_invariants(list1);
1294  return list1;
1295 }
#define check_list_invariants(l)
Definition: list.c:77
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
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:745

◆ list_concat_unique_oid()

List* list_concat_unique_oid ( List list1,
const List list2 
)

Definition at line 1301 of file list.c.

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

Referenced by GetRelationPublicationActions().

1302 {
1303  ListCell *cell;
1304 
1305  Assert(IsOidList(list1));
1306  Assert(IsOidList(list2));
1307 
1308  foreach(cell, list2)
1309  {
1310  if (!list_member_oid(list1, lfirst_oid(cell)))
1311  list1 = lappend_oid(list1, lfirst_oid(cell));
1312  }
1313 
1314  check_list_invariants(list1);
1315  return list1;
1316 }
#define check_list_invariants(l)
Definition: list.c:77
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
#define IsOidList(l)
Definition: list.c:56
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:745
#define lfirst_oid(lc)
Definition: pg_list.h:191

◆ list_concat_unique_ptr()

List* list_concat_unique_ptr ( List list1,
const List list2 
)

Definition at line 1259 of file list.c.

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

1260 {
1261  ListCell *cell;
1262 
1263  Assert(IsPointerList(list1));
1264  Assert(IsPointerList(list2));
1265 
1266  foreach(cell, list2)
1267  {
1268  if (!list_member_ptr(list1, lfirst(cell)))
1269  list1 = lappend(list1, lfirst(cell));
1270  }
1271 
1272  check_list_invariants(list1);
1273  return list1;
1274 }
#define check_list_invariants(l)
Definition: list.c:77
#define IsPointerList(l)
Definition: list.c:54
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:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ list_copy()

List* list_copy ( const List oldlist)

Definition at line 1403 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_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(), 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(), 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_joinrel_partition_key_exprs(), set_using_names(), SetReindexPending(), simplify_and_arguments(), simplify_or_arguments(), sort_inner_and_outer(), transformWithClause(), and truncate_useless_pathkeys().

1404 {
1405  List *newlist;
1406 
1407  if (oldlist == NIL)
1408  return NIL;
1409 
1410  newlist = new_list(oldlist->type, oldlist->length);
1411  memcpy(newlist->elements, oldlist->elements,
1412  newlist->length * sizeof(ListCell));
1413 
1414  check_list_invariants(newlist);
1415  return newlist;
1416 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
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:88

◆ list_copy_deep()

List* list_copy_deep ( const List oldlist)

Definition at line 1448 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().

1449 {
1450  List *newlist;
1451 
1452  if (oldlist == NIL)
1453  return NIL;
1454 
1455  /* This is only sensible for pointer Lists */
1456  Assert(IsA(oldlist, List));
1457 
1458  newlist = new_list(oldlist->type, oldlist->length);
1459  for (int i = 0; i < newlist->length; i++)
1460  lfirst(&newlist->elements[i]) =
1461  copyObjectImpl(lfirst(&oldlist->elements[i]));
1462 
1463  check_list_invariants(newlist);
1464  return newlist;
1465 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:579
#define check_list_invariants(l)
Definition: list.c:77
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189
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:88
void * copyObjectImpl(const void *from)
Definition: copyfuncs.c:4822

◆ list_copy_tail()

List* list_copy_tail ( const List oldlist,
int  nskip 
)

Definition at line 1422 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(), func_get_detail(), get_name_for_var_field(), get_object_address_opcf(), ParseFuncOrColumn(), push_ancestor_plan(), and transformAggregateCall().

1423 {
1424  List *newlist;
1425 
1426  if (nskip < 0)
1427  nskip = 0; /* would it be better to elog? */
1428 
1429  if (oldlist == NIL || nskip >= oldlist->length)
1430  return NIL;
1431 
1432  newlist = new_list(oldlist->type, oldlist->length - nskip);
1433  memcpy(newlist->elements, &oldlist->elements[nskip],
1434  newlist->length * sizeof(ListCell));
1435 
1436  check_list_invariants(newlist);
1437  return newlist;
1438 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
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:88

◆ list_deduplicate_oid()

void list_deduplicate_oid ( List list)

Definition at line 1325 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().

1326 {
1327  int len;
1328 
1329  Assert(IsOidList(list));
1330  len = list_length(list);
1331  if (len > 1)
1332  {
1333  ListCell *elements = list->elements;
1334  int i = 0;
1335 
1336  for (int j = 1; j < len; j++)
1337  {
1338  if (elements[i].oid_value != elements[j].oid_value)
1339  elements[++i].oid_value = elements[j].oid_value;
1340  }
1341  list->length = i + 1;
1342  }
1343  check_list_invariants(list);
1344 }
#define check_list_invariants(l)
Definition: list.c:77
ListCell * elements
Definition: pg_list.h:55
#define IsOidList(l)
Definition: list.c:56
#define Assert(condition)
Definition: c.h:745
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 777 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().

778 {
779  ListCell *cell;
780 
781  Assert(IsPointerList(list));
782  check_list_invariants(list);
783 
784  foreach(cell, list)
785  {
786  if (equal(lfirst(cell), datum))
787  return list_delete_cell(list, cell);
788  }
789 
790  /* Didn't find a match: return the list unmodified */
791  return list;
792 }
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3032
#define check_list_invariants(l)
Definition: list.c:77
#define IsPointerList(l)
Definition: list.c:54
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:767
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ list_delete_cell()

List* list_delete_cell ( List list,
ListCell cell 
)

Definition at line 767 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().

768 {
769  return list_delete_nth_cell(list, cell - list->elements);
770 }
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 815 of file list.c.

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

Referenced by reorder_grouping_sets().

816 {
817  ListCell *cell;
818 
819  Assert(IsIntegerList(list));
820  check_list_invariants(list);
821 
822  foreach(cell, list)
823  {
824  if (lfirst_int(cell) == datum)
825  return list_delete_cell(list, cell);
826  }
827 
828  /* Didn't find a match: return the list unmodified */
829  return list;
830 }
#define check_list_invariants(l)
Definition: list.c:77
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:767
#define Assert(condition)
Definition: c.h:745

◆ list_delete_last()

List* list_delete_last ( List list)

Definition at line 877 of file list.c.

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

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

878 {
879  check_list_invariants(list);
880 
881  if (list == NIL)
882  return NIL; /* would an error be better? */
883 
884  /* list_truncate won't free list if it goes to empty, but this should */
885  if (list_length(list) <= 1)
886  {
887  list_free(list);
888  return NIL;
889  }
890 
891  return list_truncate(list, list_length(list) - 1);
892 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
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:1376

◆ 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, MemoryContextAlloc(), NIL, pfree(), and VALGRIND_MAKE_MEM_NOACCESS.

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(), clear the initial_elements[] space and/or
740  * mark it inaccessible.
741  */
742 #ifdef CLOBBER_FREED_MEMORY
743  wipe_mem(list->initial_elements,
744  list->max_length * sizeof(ListCell));
745 #else
747  list->max_length * sizeof(ListCell));
748 #endif
749  }
750  list->elements = newelems;
751  list->max_length = newmaxlen;
752  list->length--;
753  check_list_invariants(list);
754  }
755 #endif
756 
757  return list;
758 }
#define NIL
Definition: pg_list.h:65
#define VALGRIND_MAKE_MEM_NOACCESS(addr, size)
Definition: memdebug.h:27
#define check_list_invariants(l)
Definition: list.c:77
void pfree(void *pointer)
Definition: mcxt.c:1057
union ListCell ListCell
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Assert(condition)
Definition: c.h:745
int length
Definition: pg_list.h:53
void * MemoryContextAlloc(MemoryContext context, Size size)
Definition: mcxt.c:797
void list_free(List *list)
Definition: list.c:1376
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57
static MemoryContext GetMemoryChunkContext(void *pointer)
Definition: memutils.h:113

◆ list_delete_oid()

List* list_delete_oid ( List list,
Oid  datum 
)

Definition at line 834 of file list.c.

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

Referenced by RemoveReindexPending().

835 {
836  ListCell *cell;
837 
838  Assert(IsOidList(list));
839  check_list_invariants(list);
840 
841  foreach(cell, list)
842  {
843  if (lfirst_oid(cell) == datum)
844  return list_delete_cell(list, cell);
845  }
846 
847  /* Didn't find a match: return the list unmodified */
848  return list;
849 }
#define check_list_invariants(l)
Definition: list.c:77
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:767
#define IsOidList(l)
Definition: list.c:56
#define Assert(condition)
Definition: c.h:745
#define lfirst_oid(lc)
Definition: pg_list.h:191

◆ list_delete_ptr()

List* list_delete_ptr ( List list,
void *  datum 
)

Definition at line 796 of file list.c.

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

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

797 {
798  ListCell *cell;
799 
800  Assert(IsPointerList(list));
801  check_list_invariants(list);
802 
803  foreach(cell, list)
804  {
805  if (lfirst(cell) == datum)
806  return list_delete_cell(list, cell);
807  }
808 
809  /* Didn't find a match: return the list unmodified */
810  return list;
811 }
#define check_list_invariants(l)
Definition: list.c:77
#define IsPointerList(l)
Definition: list.c:54
List * list_delete_cell(List *list, ListCell *cell)
Definition: list.c:767
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ list_difference()

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

Definition at line 1076 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().

1077 {
1078  const ListCell *cell;
1079  List *result = NIL;
1080 
1081  Assert(IsPointerList(list1));
1082  Assert(IsPointerList(list2));
1083 
1084  if (list2 == NIL)
1085  return list_copy(list1);
1086 
1087  foreach(cell, list1)
1088  {
1089  if (!list_member(list2, lfirst(cell)))
1090  result = lappend(result, lfirst(cell));
1091  }
1092 
1093  check_list_invariants(result);
1094  return result;
1095 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:54
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189
Definition: pg_list.h:50

◆ list_difference_int()

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

Definition at line 1127 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().

1128 {
1129  const ListCell *cell;
1130  List *result = NIL;
1131 
1132  Assert(IsIntegerList(list1));
1133  Assert(IsIntegerList(list2));
1134 
1135  if (list2 == NIL)
1136  return list_copy(list1);
1137 
1138  foreach(cell, list1)
1139  {
1140  if (!list_member_int(list2, lfirst_int(cell)))
1141  result = lappend_int(result, lfirst_int(cell));
1142  }
1143 
1144  check_list_invariants(result);
1145  return result;
1146 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
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:745
Definition: pg_list.h:50

◆ list_difference_oid()

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

Definition at line 1152 of file list.c.

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

1153 {
1154  const ListCell *cell;
1155  List *result = NIL;
1156 
1157  Assert(IsOidList(list1));
1158  Assert(IsOidList(list2));
1159 
1160  if (list2 == NIL)
1161  return list_copy(list1);
1162 
1163  foreach(cell, list1)
1164  {
1165  if (!list_member_oid(list2, lfirst_oid(cell)))
1166  result = lappend_oid(result, lfirst_oid(cell));
1167  }
1168 
1169  check_list_invariants(result);
1170  return result;
1171 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
#define IsOidList(l)
Definition: list.c:56
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:745
Definition: pg_list.h:50
#define lfirst_oid(lc)
Definition: pg_list.h:191

◆ list_difference_ptr()

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

Definition at line 1102 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().

1103 {
1104  const ListCell *cell;
1105  List *result = NIL;
1106 
1107  Assert(IsPointerList(list1));
1108  Assert(IsPointerList(list2));
1109 
1110  if (list2 == NIL)
1111  return list_copy(list1);
1112 
1113  foreach(cell, list1)
1114  {
1115  if (!list_member_ptr(list2, lfirst(cell)))
1116  result = lappend(result, lfirst(cell));
1117  }
1118 
1119  check_list_invariants(result);
1120  return result;
1121 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
#define IsPointerList(l)
Definition: list.c:54
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:745
#define lfirst(lc)
Definition: pg_list.h:189
Definition: pg_list.h:50

◆ list_free()

void list_free ( List list)

Definition at line 1376 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_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(), hashagg_reset_spill_state(), heap_truncate_find_FKs(), 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(), merge_list_bounds(), merge_range_bounds(), 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(), rel_sync_cache_relation_cb(), RelationCacheInvalidate(), RelationDestroyRelation(), RelationGetIndexAttrBitmap(), RelationGetIndexList(), RelationGetPrimaryKeyIndex(), RelationGetReplicaIndex(), RelationGetStatExtList(), relationHasPrimaryKey(), remove_dbtablespaces(), 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(), textToQualifiedNameList(), toast_open_indexes(), transformFkeyCheckAttrs(), transformFkeyGetPrimaryKey(), transformTableLikeClause(), transformValuesClause(), triggered_change_notification(), typeInheritsFrom(), vac_open_indexes(), and WaitForLockers().

1377 {
1378  list_free_private(list, false);
1379 }
static void list_free_private(List *list, bool deep)
Definition: list.c:1350

◆ list_free_deep()

void list_free_deep ( List list)

Definition at line 1390 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().

1391 {
1392  /*
1393  * A "deep" free operation only makes sense on a list of pointers.
1394  */
1395  Assert(IsPointerList(list));
1396  list_free_private(list, true);
1397 }
#define IsPointerList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:745
static void list_free_private(List *list, bool deep)
Definition: list.c:1350

◆ list_free_private()

static void list_free_private ( List list,
bool  deep 
)
static

Definition at line 1350 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().

1351 {
1352  if (list == NIL)
1353  return; /* nothing to do */
1354 
1355  check_list_invariants(list);
1356 
1357  if (deep)
1358  {
1359  for (int i = 0; i < list->length; i++)
1360  pfree(lfirst(&list->elements[i]));
1361  }
1362  if (list->elements != list->initial_elements)
1363  pfree(list->elements);
1364  pfree(list);
1365 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
void pfree(void *pointer)
Definition: mcxt.c:1057
ListCell * elements
Definition: pg_list.h:55
#define lfirst(lc)
Definition: pg_list.h:189
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:77
static ListCell * insert_new_cell(List *list, int pos)
Definition: list.c:379
#define list_make1(x1)
Definition: pg_list.h:226
#define IsPointerList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ 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:77
static ListCell * insert_new_cell(List *list, int pos)
Definition: list.c:379
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
#define list_make1_int(x1)
Definition: pg_list.h:237
#define Assert(condition)
Definition: c.h:745

◆ 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:77
static ListCell * insert_new_cell(List *list, int pos)
Definition: list.c:379
#define list_make1_oid(x1)
Definition: pg_list.h:248
#define IsOidList(l)
Definition: list.c:56
#define Assert(condition)
Definition: c.h:745
#define lfirst_oid(lc)
Definition: pg_list.h:191

◆ list_intersection()

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

Definition at line 1018 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().

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

◆ list_intersection_int()

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

Definition at line 1044 of file list.c.

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

Referenced by parseCheckAggregates().

1045 {
1046  List *result;
1047  const ListCell *cell;
1048 
1049  if (list1 == NIL || list2 == NIL)
1050  return NIL;
1051 
1052  Assert(IsIntegerList(list1));
1053  Assert(IsIntegerList(list2));
1054 
1055  result = NIL;
1056  foreach(cell, list1)
1057  {
1058  if (list_member_int(list2, lfirst_int(cell)))
1059  result = lappend_int(result, lfirst_int(cell));
1060  }
1061 
1062  check_list_invariants(result);
1063  return result;
1064 }
#define NIL
Definition: pg_list.h:65
#define check_list_invariants(l)
Definition: list.c:77
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
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:745
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:77
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ 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:77
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ 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:77
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ 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:77
ListCell * elements
Definition: pg_list.h:55
Definition: pg_list.h:50
static List * new_list(NodeTag type, int min_size)
Definition: list.c:88

◆ 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:3032
#define check_list_invariants(l)
Definition: list.c:77
#define IsPointerList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ 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(), contain_exec_param_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(), 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:77
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
#define Assert(condition)
Definition: c.h:745

◆ 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(), apply_handle_truncate(), ATExecAddInherit(), ATExecAttachPartition(), BeginCopy(), CheckAttributeType(), CloneFkReferenced(), CloneFkReferencing(), CollationIsVisible(), ConversionIsVisible(), DefineRelation(), ec_member_matches_indexcol(), ExecAlterObjectDependsStmt(), 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(), relation_is_updatable(), 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:77
#define IsOidList(l)
Definition: list.c:56
#define Assert(condition)
Definition: c.h:745
#define lfirst_oid(lc)
Definition: pg_list.h:191

◆ 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:77
#define IsPointerList(l)
Definition: list.c:54
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189

◆ list_oid_cmp()

int list_oid_cmp ( const ListCell p1,
const ListCell p2 
)

Definition at line 1498 of file list.c.

References lfirst_oid.

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

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

◆ list_sort()

void list_sort ( List list,
list_sort_comparator  cmp 
)

Definition at line 1481 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().

1482 {
1483  typedef int (*qsort_comparator) (const void *a, const void *b);
1484  int len;
1485 
1486  check_list_invariants(list);
1487 
1488  /* Nothing to do if there's less than two elements */
1489  len = list_length(list);
1490  if (len > 1)
1491  qsort(list->elements, len, sizeof(ListCell), (qsort_comparator) cmp);
1492 }
#define check_list_invariants(l)
Definition: list.c:77
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:475
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(), get_useful_pathkeys_for_relation(), 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 915 of file list.c.

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

Referenced by AddRelationNewConstraints(), and process_duplicate_ors().

916 {
917  List *result;
918  const ListCell *cell;
919 
920  Assert(IsPointerList(list1));
921  Assert(IsPointerList(list2));
922 
923  result = list_copy(list1);
924  foreach(cell, list2)
925  {
926  if (!list_member(result, lfirst(cell)))
927  result = lappend(result, lfirst(cell));
928  }
929 
930  check_list_invariants(result);
931  return result;
932 }
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
bool list_member(const List *list, const void *datum)
Definition: list.c:613
#define IsPointerList(l)
Definition: list.c:54
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:189
Definition: pg_list.h:50

◆ list_union_int()

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

Definition at line 962 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().

963 {
964  List *result;
965  const ListCell *cell;
966 
967  Assert(IsIntegerList(list1));
968  Assert(IsIntegerList(list2));
969 
970  result = list_copy(list1);
971  foreach(cell, list2)
972  {
973  if (!list_member_int(result, lfirst_int(cell)))
974  result = lappend_int(result, lfirst_int(cell));
975  }
976 
977  check_list_invariants(result);
978  return result;
979 }
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
#define IsIntegerList(l)
Definition: list.c:55
#define lfirst_int(lc)
Definition: pg_list.h:190
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:745
Definition: pg_list.h:50

◆ list_union_oid()

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

Definition at line 985 of file list.c.

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

986 {
987  List *result;
988  const ListCell *cell;
989 
990  Assert(IsOidList(list1));
991  Assert(IsOidList(list2));
992 
993  result = list_copy(list1);
994  foreach(cell, list2)
995  {
996  if (!list_member_oid(result, lfirst_oid(cell)))
997  result = lappend_oid(result, lfirst_oid(cell));
998  }
999 
1000  check_list_invariants(result);
1001  return result;
1002 }
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
List * lappend_oid(List *list, Oid datum)
Definition: list.c:357
#define IsOidList(l)
Definition: list.c:56
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:745
Definition: pg_list.h:50
#define lfirst_oid(lc)
Definition: pg_list.h:191

◆ list_union_ptr()

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

Definition at line 939 of file list.c.

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

940 {
941  List *result;
942  const ListCell *cell;
943 
944  Assert(IsPointerList(list1));
945  Assert(IsPointerList(list2));
946 
947  result = list_copy(list1);
948  foreach(cell, list2)
949  {
950  if (!list_member_ptr(result, lfirst(cell)))
951  result = lappend(result, lfirst(cell));
952  }
953 
954  check_list_invariants(result);
955  return result;
956 }
#define check_list_invariants(l)
Definition: list.c:77
List * list_copy(const List *oldlist)
Definition: list.c:1403
#define IsPointerList(l)
Definition: list.c:54
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:745
#define lfirst(lc)
Definition: pg_list.h:189
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, and List::max_length.

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
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 88 of file list.c.

References Assert, List::elements, List::initial_elements, List::length, LIST_HEADER_OVERHEAD, Max, List::max_length, offsetof, palloc(), pg_nextpower2_32(), 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().

89 {
90  List *newlist;
91  int max_size;
92 
93  Assert(min_size > 0);
94 
95  /*
96  * We allocate all the requested cells, and possibly some more, as part of
97  * the same palloc request as the List header. This is a big win for the
98  * typical case of short fixed-length lists. It can lose if we allocate a
99  * moderately long list and then it gets extended; we'll be wasting more
100  * initial_elements[] space than if we'd made the header small. However,
101  * rounding up the request as we do in the normal code path provides some
102  * defense against small extensions.
103  */
104 
105 #ifndef DEBUG_LIST_MEMORY_USAGE
106 
107  /*
108  * Normally, we set up a list with some extra cells, to allow it to grow
109  * without a repalloc. Prefer cell counts chosen to make the total
110  * allocation a power-of-2, since palloc would round it up to that anyway.
111  * (That stops being true for very large allocations, but very long lists
112  * are infrequent, so it doesn't seem worth special logic for such cases.)
113  *
114  * The minimum allocation is 8 ListCell units, providing either 4 or 5
115  * available ListCells depending on the machine's word width. Counting
116  * palloc's overhead, this uses the same amount of space as a one-cell
117  * list did in the old implementation, and less space for any longer list.
118  *
119  * We needn't worry about integer overflow; no caller passes min_size
120  * that's more than twice the size of an existing list, so the size limits
121  * within palloc will ensure that we don't overflow here.
122  */
123  max_size = pg_nextpower2_32(Max(8, min_size + LIST_HEADER_OVERHEAD));
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:47
static uint32 pg_nextpower2_32(uint32 num)
Definition: pg_bitutils.h:146
union ListCell ListCell
int max_length
Definition: pg_list.h:54
ListCell * elements
Definition: pg_list.h:55
#define Max(x, y)
Definition: c.h:921
#define Assert(condition)
Definition: c.h:745
int length
Definition: pg_list.h:53
NodeTag type
Definition: pg_list.h:52
void * palloc(Size size)
Definition: mcxt.c:950
ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER]
Definition: pg_list.h:57
Definition: pg_list.h:50
#define offsetof(type, field)
Definition: c.h:668

◆ 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