169 bool is_borrowed_rel);
197 int n_total_subplans);
295 while (dispatch != NULL)
320 if (partdesc->
nparts == 0 ||
329 (
errcode(ERRCODE_CHECK_VIOLATION),
330 errmsg(
"no partition of relation \"%s\" found for row",
333 errdetail(
"Partition key of the failing row contains %s.",
338 is_leaf = partdesc->
is_leaf[partidx];
359 partdesc->
oids[partidx],
378 rootResultRelInfo, partidx);
402 dispatch = pd[dispatch->
indexes[partidx]];
415 partdesc->
oids[partidx],
422 dispatch = subdispatch;
437 if (tempslot != NULL)
512 bool found_whole_row;
538 if (partrel->rd_rel->relhasindex &&
539 leaf_part_rri->ri_IndexRelationDescs == NULL)
600 wcoExprs =
lappend(wcoExprs, wcoExpr);
603 leaf_part_rri->ri_WithCheckOptions = wcoList;
604 leaf_part_rri->ri_WithCheckOptionExprs = wcoExprs;
639 if (part_attmap == NULL)
643 returningList = (
List *)
651 leaf_part_rri->ri_returningList = returningList;
663 leaf_part_rri->ri_projectReturning =
670 leaf_part_rri, partidx,
false);
694 foreach(lc, childIdxs)
704 arbiterIndexes =
lappend_oid(arbiterIndexes, childIdx);
717 elog(
ERROR,
"invalid arbiter index list");
718 leaf_part_rri->ri_onConflictArbiterIndexes = arbiterIndexes;
728 map = leaf_part_rri->ri_RootToPartitionMap;
733 leaf_part_rri->ri_onConflict = onconfl;
771 bool found_whole_row;
781 if (part_attmap == NULL)
785 onconflset = (
List *)
792 onconflset = (
List *)
879 if (part_attmap == NULL)
884 if (
unlikely(!leaf_part_rri->ri_projectNewInfoValid))
887 foreach(lc, firstMergeActionList)
900 list = &leaf_part_rri->ri_matchedMergeAction;
902 list = &leaf_part_rri->ri_notMatchedMergeAction;
905 switch (
action->commandType)
916 leaf_part_rri->ri_newTupleSlot,
936 leaf_part_rri->ri_newTupleSlot,
943 elog(
ERROR,
"unknown action in MERGE WHEN clause");
959 return leaf_part_rri;
975 bool is_borrowed_rel)
1072 dispatch->
indexes[partidx] = rri_index;
1125 partdesc->
nparts *
sizeof(int));
1130 if (parent_pd != NULL)
1210 parent_pd->
indexes[partidx] = dispatchidx;
1320 if (partexpr_item == NULL)
1321 elog(
ERROR,
"wrong number of partition key expressions");
1331 if (partexpr_item != NULL)
1332 elog(
ERROR,
"wrong number of partition key expressions");
1347 int part_index = -1;
1353 switch (
key->strategy)
1382 if (bound_offset >= 0 &&
equal)
1383 part_index = boundinfo->
indexes[bound_offset];
1390 range_partkey_has_null =
false;
1397 for (
i = 0;
i <
key->partnatts;
i++)
1401 range_partkey_has_null =
true;
1406 if (!range_partkey_has_null)
1421 part_index = boundinfo->
indexes[bound_offset + 1];
1427 elog(
ERROR,
"unexpected partition strategy: %d",
1428 (
int)
key->strategy);
1472 for (
i = 0;
i < partnatts;
i++)
1492 for (
i = 0;
i < partnatts;
i++)
1505 &foutoid, &typisvarlena);
1513 vallen = strlen(
val);
1514 if (vallen <= maxfieldlen)
1565 if (parentattrno <= 0 ||
1566 parentattrno > attrMap->
maplen ||
1567 attrMap->
attnums[parentattrno - 1] == 0)
1568 elog(
ERROR,
"unexpected attno %d in target column list",
1571 attrMap->
attnums[parentattrno - 1]);
1640 int n_total_subplans,
1661 Assert(n_total_subplans > 0);
1663 n_total_subplans - 1);
1680 *initially_valid_subplans,
1709 int n_part_hierarchies;
1720 Assert(n_part_hierarchies > 0);
1751 int npartrelpruneinfos =
list_length(partrelpruneinfos);
1763 foreach(lc2, partrelpruneinfos)
1803 sizeof(
int) * pinfo->
nparts);
1809 #ifdef USE_ASSERT_CHECKING
1810 for (
int k = 0; k < pinfo->
nparts; k++)
1839 for (pp_idx = 0; pp_idx < partdesc->
nparts; pp_idx++)
1842 while (pd_idx < pinfo->nparts &&
1846 if (pd_idx < pinfo->nparts &&
1871 if (pd_idx != pinfo->
nparts)
1872 elog(
ERROR,
"could not match partition child tables to plan elements");
1886 partdesc, partkey, planstate,
1896 partdesc, partkey, planstate,
1922 List *pruning_steps,
1952 foreach(lc, pruning_steps)
1965 foreach(lc2, step->
exprs)
1983 if (planstate == NULL)
2013 int n_total_subplans)
2015 int *new_subplan_indexes;
2025 new_subplan_indexes = (
int *)
palloc0(
sizeof(
int) * n_total_subplans);
2031 new_subplan_indexes[
i] = newidx++;
2053 int nparts = pprune->
nparts;
2060 for (k = 0; k < nparts; k++)
2075 Assert(oldidx < n_total_subplans);
2076 pprune->
subplan_map[k] = new_subplan_indexes[oldidx] - 1;
2078 if (new_subplan_indexes[oldidx] > 0)
2100 new_other_subplans = NULL;
2104 new_subplan_indexes[
i] - 1);
2109 pfree(new_subplan_indexes);
2224 initial_prune, validsubplans);
AclResult pg_attribute_aclcheck(Oid table_oid, AttrNumber attnum, Oid roleid, AclMode mode)
AclResult pg_class_aclcheck(Oid table_oid, Oid roleid, AclMode mode)
AttrMap * build_attrmap_by_name_if_req(TupleDesc indesc, TupleDesc outdesc)
AttrMap * build_attrmap_by_name(TupleDesc indesc, TupleDesc outdesc)
#define InvalidAttrNumber
int bms_next_member(const Bitmapset *a, int prevbit)
void bms_free(Bitmapset *a)
int bms_num_members(const Bitmapset *a)
Bitmapset * bms_add_member(Bitmapset *a, int x)
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
bool bms_is_empty(const Bitmapset *a)
Bitmapset * bms_copy(const Bitmapset *a)
Bitmapset * bms_add_range(Bitmapset *a, int lower, int upper)
static Datum values[MAXATTR]
#define offsetof(type, field)
#define FLEXIBLE_ARRAY_MEMBER
#define OidIsValid(objectId)
int errdetail(const char *fmt,...)
int errcode(int sqlerrcode)
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
bool equal(const void *a, const void *b)
ExprState * ExecInitExprWithParams(Expr *node, ParamListInfo ext_params)
ProjectionInfo * ExecBuildUpdateProjection(List *targetList, bool evalTargetList, List *targetColnos, TupleDesc relDesc, ExprContext *econtext, TupleTableSlot *slot, PlanState *parent)
ExprState * ExecInitQual(List *qual, PlanState *parent)
ExprState * ExecInitExpr(Expr *node, PlanState *parent)
ProjectionInfo * ExecBuildProjectionInfo(List *targetList, ExprContext *econtext, TupleTableSlot *slot, PlanState *parent, TupleDesc inputDesc)
List * ExecPrepareExprList(List *nodes, EState *estate)
void ExecCloseIndices(ResultRelInfo *resultRelInfo)
void ExecOpenIndices(ResultRelInfo *resultRelInfo, bool speculative)
bool ExecPartitionCheck(ResultRelInfo *resultRelInfo, TupleTableSlot *slot, EState *estate, bool emitError)
void InitResultRelInfo(ResultRelInfo *resultRelInfo, Relation resultRelationDesc, Index resultRelationIndex, ResultRelInfo *partition_root_rri, int instrument_options)
void CheckValidResultRel(ResultRelInfo *resultRelInfo, CmdType operation)
static PartitionDispatch ExecInitPartitionDispatchInfo(EState *estate, PartitionTupleRouting *proute, Oid partoid, PartitionDispatch parent_pd, int partidx, ResultRelInfo *rootResultRelInfo)
static PartitionPruneState * CreatePartitionPruneState(PlanState *planstate, PartitionPruneInfo *pruneinfo)
static ResultRelInfo * ExecInitPartitionInfo(ModifyTableState *mtstate, EState *estate, PartitionTupleRouting *proute, PartitionDispatch dispatch, ResultRelInfo *rootResultRelInfo, int partidx)
static void ExecInitRoutingInfo(ModifyTableState *mtstate, EState *estate, PartitionTupleRouting *proute, PartitionDispatch dispatch, ResultRelInfo *partRelInfo, int partidx, bool is_borrowed_rel)
static char * ExecBuildSlotPartitionKeyDescription(Relation rel, Datum *values, bool *isnull, int maxfieldlen)
Bitmapset * ExecFindMatchingSubPlans(PartitionPruneState *prunestate, bool initial_prune)
static void FormPartitionKeyDatum(PartitionDispatch pd, TupleTableSlot *slot, EState *estate, Datum *values, bool *isnull)
static void PartitionPruneFixSubPlanMap(PartitionPruneState *prunestate, Bitmapset *initially_valid_subplans, int n_total_subplans)
static List * adjust_partition_colnos(List *colnos, ResultRelInfo *leaf_part_rri)
static List * adjust_partition_colnos_using_map(List *colnos, AttrMap *attrMap)
ResultRelInfo * ExecFindPartition(ModifyTableState *mtstate, ResultRelInfo *rootResultRelInfo, PartitionTupleRouting *proute, TupleTableSlot *slot, EState *estate)
static void InitPartitionPruneContext(PartitionPruneContext *context, List *pruning_steps, PartitionDesc partdesc, PartitionKey partkey, PlanState *planstate, ExprContext *econtext)
struct PartitionDispatchData PartitionDispatchData
static void find_matching_subplans_recurse(PartitionPruningData *prunedata, PartitionedRelPruningData *pprune, bool initial_prune, Bitmapset **validsubplans)
static int get_partition_for_tuple(PartitionDispatch pd, Datum *values, bool *isnull)
PartitionTupleRouting * ExecSetupPartitionTupleRouting(EState *estate, Relation rel)
PartitionPruneState * ExecInitPartitionPruning(PlanState *planstate, int n_total_subplans, PartitionPruneInfo *pruneinfo, Bitmapset **initially_valid_subplans)
void ExecCleanupTupleRouting(ModifyTableState *mtstate, PartitionTupleRouting *proute)
struct PartitionDispatchData * PartitionDispatch
struct PartitionedRelPruningData PartitionedRelPruningData
const TupleTableSlotOps TTSOpsVirtual
void ExecDropSingleTupleTableSlot(TupleTableSlot *slot)
TupleTableSlot * MakeSingleTupleTableSlot(TupleDesc tupdesc, const TupleTableSlotOps *tts_ops)
void ExecAssignExprContext(EState *estate, PlanState *planstate)
Relation ExecGetRangeTableRelation(EState *estate, Index rti)
TupleConversionMap * ExecGetChildToRootMap(ResultRelInfo *resultRelInfo)
#define GetPerTupleExprContext(estate)
#define ResetExprContext(econtext)
#define GetPerTupleMemoryContext(estate)
static Datum ExecEvalExprSwitchContext(ExprState *state, ExprContext *econtext, bool *isNull)
char * OidOutputFunctionCall(Oid functionId, Datum val)
Assert(fmt[strlen(fmt) - 1] !='\n')
List * lappend(List *list, void *datum)
List * lappend_int(List *list, int datum)
List * lappend_oid(List *list, Oid datum)
void list_free(List *list)
bool list_member_oid(const List *list, Oid datum)
void getTypeOutputInfo(Oid type, Oid *typOutput, bool *typIsVarlena)
int pg_mbcliplen(const char *mbstr, int len, int limit)
void MemoryContextReset(MemoryContext context)
void pfree(void *pointer)
void * palloc0(Size size)
MemoryContext CurrentMemoryContext
void * repalloc(void *pointer, Size size)
#define AllocSetContextCreate
#define ALLOCSET_DEFAULT_SIZES
#define CHECK_FOR_INTERRUPTS()
void ExecInitMergeTupleSlots(ModifyTableState *mtstate, ResultRelInfo *resultRelInfo)
ResultRelInfo * ExecLookupResultRelByOid(ModifyTableState *node, Oid resultoid, bool missing_ok, bool update_cache)
#define IsA(nodeptr, _type_)
#define castNode(_type_, nodeptr)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
#define PARTITION_STRATEGY_LIST
#define PARTITION_STRATEGY_RANGE
#define PARTITION_STRATEGY_HASH
uint64 compute_partition_hash_value(int partnatts, FmgrInfo *partsupfunc, Oid *partcollation, Datum *values, bool *isnull)
int partition_range_datum_bsearch(FmgrInfo *partsupfunc, Oid *partcollation, PartitionBoundInfo boundinfo, int nvalues, Datum *values, bool *is_equal)
int partition_list_bsearch(FmgrInfo *partsupfunc, Oid *partcollation, PartitionBoundInfo boundinfo, Datum value, bool *is_equal)
#define partition_bound_accepts_nulls(bi)
PartitionKey RelationGetPartitionKey(Relation rel)
static int16 get_partition_col_attnum(PartitionKey key, int col)
static int get_partition_natts(PartitionKey key)
static Oid get_partition_col_typid(PartitionKey key, int col)
PartitionDirectory CreatePartitionDirectory(MemoryContext mcxt, bool omit_detached)
PartitionDesc PartitionDirectoryLookup(PartitionDirectory pdir, Relation rel)
List * get_partition_ancestors(Oid relid)
Bitmapset * get_matching_partitions(PartitionPruneContext *context, List *pruning_steps)
#define PruneCxtStateIdx(partnatts, step_id, keyno)
#define PARTITION_MAX_KEYS
#define lfirst_node(type, lc)
static int list_length(const List *l)
static ListCell * list_head(const List *l)
static ListCell * lnext(const List *l, const ListCell *c)
void check_stack_depth(void)
#define RelationGetForm(relation)
#define RelationGetRelid(relation)
#define RelationGetDescr(relation)
#define RelationGetRelationName(relation)
List * RelationGetIndexList(Relation relation)
int errtable(Relation rel)
Node * map_variable_attnos(Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
int check_enable_rls(Oid relid, Oid checkAsUser, bool noError)
char * pg_get_partkeydef_columns(Oid relid, bool pretty)
void appendStringInfo(StringInfo str, const char *fmt,...)
void appendBinaryStringInfo(StringInfo str, const char *data, int datalen)
void appendStringInfoString(StringInfo str, const char *s)
void appendStringInfoChar(StringInfo str, char ch)
void initStringInfo(StringInfo str)
List * es_tuple_routing_result_relations
MemoryContext es_query_cxt
PartitionDirectory es_partition_directory
ParamListInfo ecxt_param_list_info
TupleTableSlot * ecxt_scantuple
EndForeignInsert_function EndForeignInsert
BeginForeignInsert_function BeginForeignInsert
ExecForeignBatchInsert_function ExecForeignBatchInsert
GetForeignModifyBatchSize_function GetForeignModifyBatchSize
ProjectionInfo * mas_proj
ResultRelInfo * resultRelInfo
ResultRelInfo * rootResultRelInfo
List * withCheckOptionLists
OnConflictAction onConflictAction
TupleTableSlot * oc_ProjSlot
TupleTableSlot * oc_Existing
ExprState * oc_WhereClause
ProjectionInfo * oc_ProjInfo
PartitionBoundInfo boundinfo
int indexes[FLEXIBLE_ARRAY_MEMBER]
ExprContext * exprcontext
PartitionBoundInfo boundinfo
Bitmapset * other_subplans
PartitionPruningData * partprunedata[FLEXIBLE_ARRAY_MEMBER]
Bitmapset * other_subplans
MemoryContext prune_context
PartitionedRelPruningData partrelprunedata[FLEXIBLE_ARRAY_MEMBER]
PartitionDispatch * partition_dispatch_info
ResultRelInfo ** partitions
ResultRelInfo ** nonleaf_partitions
Bitmapset * present_parts
List * initial_pruning_steps
List * exec_pruning_steps
List * exec_pruning_steps
PartitionPruneContext exec_context
PartitionPruneContext initial_context
Bitmapset * present_parts
List * initial_pruning_steps
ExprContext * ps_ExprContext
TupleTableSlot * ps_ResultTupleSlot
TupleTableSlot * ri_PartitionTupleSlot
OnConflictSetState * ri_onConflict
List * ri_onConflictArbiterIndexes
struct ResultRelInfo * ri_RootResultRelInfo
struct CopyMultiInsertBuffer * ri_CopyMultiInsertBuffer
struct FdwRoutine * ri_FdwRoutine
TupleConversionMap * ri_RootToPartitionMap
void table_close(Relation relation, LOCKMODE lockmode)
Relation table_open(Oid relationId, LOCKMODE lockmode)
TupleTableSlot * table_slot_create(Relation relation, List **reglist)
TupleTableSlot * execute_attr_map_slot(AttrMap *attrMap, TupleTableSlot *in_slot, TupleTableSlot *out_slot)
TupleConversionMap * convert_tuples_by_name(TupleDesc indesc, TupleDesc outdesc)
static TupleTableSlot * ExecClearTuple(TupleTableSlot *slot)
static Datum slot_getattr(TupleTableSlot *slot, int attnum, bool *isnull)
#define IsolationUsesXactSnapshot()