PostgreSQL Source Code  git master
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
partition.h File Reference
Include dependency graph for partition.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Macros

#define HASH_PARTITION_SEED   UINT64CONST(0x7A5B22367996DCFD)
 

Functions

Oid get_partition_parent (Oid relid, bool even_if_detached)
 
Listget_partition_ancestors (Oid relid)
 
Oid index_get_partition (Relation partition, Oid indexId)
 
Listmap_partition_varattnos (List *expr, int fromrel_varno, Relation to_rel, Relation from_rel)
 
bool has_partition_attrs (Relation rel, Bitmapset *attnums, bool *used_in_expr)
 
Oid get_default_partition_oid (Oid parentId)
 
void update_default_partition_oid (Oid parentId, Oid defaultPartId)
 
Listget_proposed_default_constraint (List *new_part_constraints)
 

Macro Definition Documentation

◆ HASH_PARTITION_SEED

#define HASH_PARTITION_SEED   UINT64CONST(0x7A5B22367996DCFD)

Definition at line 20 of file partition.h.

Function Documentation

◆ get_default_partition_oid()

Oid get_default_partition_oid ( Oid  parentId)

Definition at line 315 of file partition.c.

316 {
317  HeapTuple tuple;
318  Oid defaultPartId = InvalidOid;
319 
320  tuple = SearchSysCache1(PARTRELID, ObjectIdGetDatum(parentId));
321 
322  if (HeapTupleIsValid(tuple))
323  {
324  Form_pg_partitioned_table part_table_form;
325 
326  part_table_form = (Form_pg_partitioned_table) GETSTRUCT(tuple);
327  defaultPartId = part_table_form->partdefid;
328  ReleaseSysCache(tuple);
329  }
330 
331  return defaultPartId;
332 }
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
FormData_pg_partitioned_table * Form_pg_partitioned_table
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:269
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:221

References GETSTRUCT, HeapTupleIsValid, InvalidOid, ObjectIdGetDatum(), ReleaseSysCache(), and SearchSysCache1().

Referenced by heap_drop_with_catalog(), and RelationBuildPartitionDesc().

◆ get_partition_ancestors()

List* get_partition_ancestors ( Oid  relid)

Definition at line 134 of file partition.c.

135 {
136  List *result = NIL;
137  Relation inhRel;
138 
139  inhRel = table_open(InheritsRelationId, AccessShareLock);
140 
141  get_partition_ancestors_worker(inhRel, relid, &result);
142 
143  table_close(inhRel, AccessShareLock);
144 
145  return result;
146 }
#define AccessShareLock
Definition: lockdefs.h:36
static void get_partition_ancestors_worker(Relation inhRel, Oid relid, List **ancestors)
Definition: partition.c:153
#define NIL
Definition: pg_list.h:68
Definition: pg_list.h:54
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40

References AccessShareLock, get_partition_ancestors_worker(), NIL, table_close(), and table_open().

Referenced by ExecGetAncestorResultRels(), ExecInitPartitionInfo(), filter_partitions(), get_rel_sync_entry(), getIdentitySequence(), index_concurrently_swap(), pg_partition_ancestors(), pg_partition_root(), pg_partition_tree(), and RelationBuildPublicationDesc().

◆ get_partition_parent()

Oid get_partition_parent ( Oid  relid,
bool  even_if_detached 
)

Definition at line 53 of file partition.c.

54 {
55  Relation catalogRelation;
56  Oid result;
57  bool detach_pending;
58 
59  catalogRelation = table_open(InheritsRelationId, AccessShareLock);
60 
61  result = get_partition_parent_worker(catalogRelation, relid,
62  &detach_pending);
63 
64  if (!OidIsValid(result))
65  elog(ERROR, "could not find tuple for parent of relation %u", relid);
66 
67  if (detach_pending && !even_if_detached)
68  elog(ERROR, "relation %u has no parent because it's being detached",
69  relid);
70 
71  table_close(catalogRelation, AccessShareLock);
72 
73  return result;
74 }
#define OidIsValid(objectId)
Definition: c.h:780
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:225
static Oid get_partition_parent_worker(Relation inhRel, Oid relid, bool *detach_pending)
Definition: partition.c:85

References AccessShareLock, elog, ERROR, get_partition_parent_worker(), OidIsValid, table_close(), and table_open().

Referenced by ATExecAttachPartitionIdx(), ATExecDropNotNull(), DetachPartitionFinalize(), generate_partition_qual(), heap_drop_with_catalog(), index_get_partition(), RangeVarCallbackForDropRelation(), renametrig(), and validatePartitionedIndex().

◆ get_proposed_default_constraint()

List* get_proposed_default_constraint ( List new_part_constraints)

Definition at line 370 of file partition.c.

371 {
372  Expr *defPartConstraint;
373 
374  defPartConstraint = make_ands_explicit(new_part_constraints);
375 
376  /*
377  * Derive the partition constraints of default partition by negating the
378  * given partition constraints. The partition constraint never evaluates
379  * to NULL, so negating it like this is safe.
380  */
381  defPartConstraint = makeBoolExpr(NOT_EXPR,
382  list_make1(defPartConstraint),
383  -1);
384 
385  /* Simplify, to put the negated expression into canonical form */
386  defPartConstraint =
387  (Expr *) eval_const_expressions(NULL,
388  (Node *) defPartConstraint);
389  defPartConstraint = canonicalize_qual(defPartConstraint, true);
390 
391  return make_ands_implicit(defPartConstraint);
392 }
Node * eval_const_expressions(PlannerInfo *root, Node *node)
Definition: clauses.c:2254
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:760
Expr * make_ands_explicit(List *andclauses)
Definition: makefuncs.c:749
Expr * makeBoolExpr(BoolExprType boolop, List *args, int location)
Definition: makefuncs.c:371
#define list_make1(x1)
Definition: pg_list.h:212
Expr * canonicalize_qual(Expr *qual, bool is_check)
Definition: prepqual.c:293
@ NOT_EXPR
Definition: primnodes.h:931
Definition: nodes.h:129

References canonicalize_qual(), eval_const_expressions(), list_make1, make_ands_explicit(), make_ands_implicit(), makeBoolExpr(), and NOT_EXPR.

Referenced by ATExecAttachPartition(), and check_default_partition_contents().

◆ has_partition_attrs()

bool has_partition_attrs ( Relation  rel,
Bitmapset attnums,
bool used_in_expr 
)

Definition at line 255 of file partition.c.

256 {
258  int partnatts;
259  List *partexprs;
260  ListCell *partexprs_item;
261  int i;
262 
263  if (attnums == NULL || rel->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
264  return false;
265 
267  partnatts = get_partition_natts(key);
268  partexprs = get_partition_exprs(key);
269 
270  partexprs_item = list_head(partexprs);
271  for (i = 0; i < partnatts; i++)
272  {
274 
275  if (partattno != 0)
276  {
278  attnums))
279  {
280  if (used_in_expr)
281  *used_in_expr = false;
282  return true;
283  }
284  }
285  else
286  {
287  /* Arbitrary expression */
288  Node *expr = (Node *) lfirst(partexprs_item);
289  Bitmapset *expr_attrs = NULL;
290 
291  /* Find all attributes referenced */
292  pull_varattnos(expr, 1, &expr_attrs);
293  partexprs_item = lnext(partexprs, partexprs_item);
294 
295  if (bms_overlap(attnums, expr_attrs))
296  {
297  if (used_in_expr)
298  *used_in_expr = true;
299  return true;
300  }
301  }
302  }
303 
304  return false;
305 }
int16 AttrNumber
Definition: attnum.h:21
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:510
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:582
int i
Definition: isn.c:72
PartitionKey RelationGetPartitionKey(Relation rel)
Definition: partcache.c:51
static int16 get_partition_col_attnum(PartitionKey key, int col)
Definition: partcache.h:80
static int get_partition_natts(PartitionKey key)
Definition: partcache.h:65
static List * get_partition_exprs(PartitionKey key)
Definition: partcache.h:71
#define lfirst(lc)
Definition: pg_list.h:172
static ListCell * list_head(const List *l)
Definition: pg_list.h:128
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:343
Form_pg_class rd_rel
Definition: rel.h:111
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
void pull_varattnos(Node *node, Index varno, Bitmapset **varattnos)
Definition: var.c:296

References bms_is_member(), bms_overlap(), FirstLowInvalidHeapAttributeNumber, get_partition_col_attnum(), get_partition_exprs(), get_partition_natts(), i, sort-test::key, lfirst, list_head(), lnext(), pull_varattnos(), RelationData::rd_rel, and RelationGetPartitionKey().

Referenced by ATExecDropColumn(), ATPrepAlterColumnType(), and expand_partitioned_rtentry().

◆ index_get_partition()

Oid index_get_partition ( Relation  partition,
Oid  indexId 
)

Definition at line 176 of file partition.c.

177 {
178  List *idxlist = RelationGetIndexList(partition);
179  ListCell *l;
180 
181  foreach(l, idxlist)
182  {
183  Oid partIdx = lfirst_oid(l);
184  HeapTuple tup;
185  Form_pg_class classForm;
186  bool ispartition;
187 
188  tup = SearchSysCache1(RELOID, ObjectIdGetDatum(partIdx));
189  if (!HeapTupleIsValid(tup))
190  elog(ERROR, "cache lookup failed for relation %u", partIdx);
191  classForm = (Form_pg_class) GETSTRUCT(tup);
192  ispartition = classForm->relispartition;
193  ReleaseSysCache(tup);
194  if (!ispartition)
195  continue;
196  if (get_partition_parent(partIdx, false) == indexId)
197  {
198  list_free(idxlist);
199  return partIdx;
200  }
201  }
202 
203  list_free(idxlist);
204  return InvalidOid;
205 }
void list_free(List *list)
Definition: list.c:1546
Oid get_partition_parent(Oid relid, bool even_if_detached)
Definition: partition.c:53
FormData_pg_class * Form_pg_class
Definition: pg_class.h:153
#define lfirst_oid(lc)
Definition: pg_list.h:174
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4767

References elog, ERROR, get_partition_parent(), GETSTRUCT, HeapTupleIsValid, InvalidOid, lfirst_oid, list_free(), ObjectIdGetDatum(), RelationGetIndexList(), ReleaseSysCache(), and SearchSysCache1().

Referenced by addFkRecurseReferenced(), CloneFkReferenced(), and refuseDupeIndexAttach().

◆ map_partition_varattnos()

List* map_partition_varattnos ( List expr,
int  fromrel_varno,
Relation  to_rel,
Relation  from_rel 
)

Definition at line 222 of file partition.c.

224 {
225  if (expr != NIL)
226  {
227  AttrMap *part_attmap;
228  bool found_whole_row;
229 
230  part_attmap = build_attrmap_by_name(RelationGetDescr(to_rel),
231  RelationGetDescr(from_rel),
232  false);
233  expr = (List *) map_variable_attnos((Node *) expr,
234  fromrel_varno, 0,
235  part_attmap,
236  RelationGetForm(to_rel)->reltype,
237  &found_whole_row);
238  /* Since we provided a to_rowtype, we may ignore found_whole_row. */
239  }
240 
241  return expr;
242 }
AttrMap * build_attrmap_by_name(TupleDesc indesc, TupleDesc outdesc, bool missing_ok)
Definition: attmap.c:177
#define RelationGetForm(relation)
Definition: rel.h:499
#define RelationGetDescr(relation)
Definition: rel.h:531
Node * map_variable_attnos(Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
Definition: attmap.h:35

References build_attrmap_by_name(), map_variable_attnos(), NIL, RelationGetDescr, and RelationGetForm.

Referenced by ATExecAttachPartition(), check_default_partition_contents(), CloneRowTriggersToPartition(), CreateTriggerFiringOn(), generate_partition_qual(), and QueuePartitionConstraintValidation().

◆ update_default_partition_oid()

void update_default_partition_oid ( Oid  parentId,
Oid  defaultPartId 
)

Definition at line 340 of file partition.c.

341 {
342  HeapTuple tuple;
343  Relation pg_partitioned_table;
344  Form_pg_partitioned_table part_table_form;
345 
346  pg_partitioned_table = table_open(PartitionedRelationId, RowExclusiveLock);
347 
348  tuple = SearchSysCacheCopy1(PARTRELID, ObjectIdGetDatum(parentId));
349 
350  if (!HeapTupleIsValid(tuple))
351  elog(ERROR, "cache lookup failed for partition key of relation %u",
352  parentId);
353 
354  part_table_form = (Form_pg_partitioned_table) GETSTRUCT(tuple);
355  part_table_form->partdefid = defaultPartId;
356  CatalogTupleUpdate(pg_partitioned_table, &tuple->t_self, tuple);
357 
358  heap_freetuple(tuple);
359  table_close(pg_partitioned_table, RowExclusiveLock);
360 }
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1434
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:313
#define RowExclusiveLock
Definition: lockdefs.h:38
ItemPointerData t_self
Definition: htup.h:65
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:91

References CatalogTupleUpdate(), elog, ERROR, GETSTRUCT, heap_freetuple(), HeapTupleIsValid, ObjectIdGetDatum(), RowExclusiveLock, SearchSysCacheCopy1, HeapTupleData::t_self, table_close(), and table_open().

Referenced by DetachPartitionFinalize(), heap_drop_with_catalog(), and StorePartitionBound().