PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
sequence.c
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * sequence.c
4  * PostgreSQL sequences support code.
5  *
6  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
7  * Portions Copyright (c) 1994, Regents of the University of California
8  *
9  *
10  * IDENTIFICATION
11  * src/backend/commands/sequence.c
12  *
13  *-------------------------------------------------------------------------
14  */
15 #include "postgres.h"
16 
17 #include "access/bufmask.h"
18 #include "access/htup_details.h"
19 #include "access/multixact.h"
20 #include "access/transam.h"
21 #include "access/xact.h"
22 #include "access/xlog.h"
23 #include "access/xloginsert.h"
24 #include "access/xlogutils.h"
25 #include "catalog/dependency.h"
26 #include "catalog/indexing.h"
27 #include "catalog/namespace.h"
28 #include "catalog/objectaccess.h"
29 #include "catalog/pg_sequence.h"
30 #include "catalog/pg_type.h"
31 #include "commands/defrem.h"
32 #include "commands/sequence.h"
33 #include "commands/tablecmds.h"
34 #include "funcapi.h"
35 #include "miscadmin.h"
36 #include "nodes/makefuncs.h"
37 #include "parser/parse_type.h"
38 #include "storage/lmgr.h"
39 #include "storage/proc.h"
40 #include "storage/smgr.h"
41 #include "utils/acl.h"
42 #include "utils/builtins.h"
43 #include "utils/lsyscache.h"
44 #include "utils/resowner.h"
45 #include "utils/syscache.h"
46 #include "utils/varlena.h"
47 
48 
49 /*
50  * We don't want to log each fetching of a value from a sequence,
51  * so we pre-log a few fetches in advance. In the event of
52  * crash we can lose (skip over) as many values as we pre-logged.
53  */
54 #define SEQ_LOG_VALS 32
55 
56 /*
57  * The "special area" of a sequence's buffer page looks like this.
58  */
59 #define SEQ_MAGIC 0x1717
60 
61 typedef struct sequence_magic
62 {
65 
66 /*
67  * We store a SeqTable item for every sequence we have touched in the current
68  * session. This is needed to hold onto nextval/currval state. (We can't
69  * rely on the relcache, since it's only, well, a cache, and may decide to
70  * discard entries.)
71  */
72 typedef struct SeqTableData
73 {
74  Oid relid; /* pg_class OID of this sequence (hash key) */
75  Oid filenode; /* last seen relfilenode of this sequence */
76  LocalTransactionId lxid; /* xact in which we last did a seq op */
77  bool last_valid; /* do we have a valid "last" value? */
78  int64 last; /* value last returned by nextval */
79  int64 cached; /* last value already cached for nextval */
80  /* if last != cached, we have not used up all the cached values */
81  int64 increment; /* copy of sequence's increment field */
82  /* note that increment is zero until we first do nextval_internal() */
83 } SeqTableData;
84 
86 
87 static HTAB *seqhashtab = NULL; /* hash table for SeqTable items */
88 
89 /*
90  * last_used_seq is updated by nextval() to point to the last used
91  * sequence.
92  */
94 
95 static void fill_seq_with_data(Relation rel, HeapTuple tuple);
97 static void create_seq_hashtable(void);
98 static void init_sequence(Oid relid, SeqTable *p_elm, Relation *p_rel);
100  Buffer *buf, HeapTuple seqdatatuple);
101 static void init_params(ParseState *pstate, List *options, bool for_identity,
102  bool isInit,
103  Form_pg_sequence seqform,
104  Form_pg_sequence_data seqdataform,
105  bool *need_seq_rewrite,
106  List **owned_by);
107 static void do_setval(Oid relid, int64 next, bool iscalled);
108 static void process_owned_by(Relation seqrel, List *owned_by, bool for_identity);
109 
110 
111 /*
112  * DefineSequence
113  * Creates a new sequence relation
114  */
117 {
118  FormData_pg_sequence seqform;
119  FormData_pg_sequence_data seqdataform;
120  bool need_seq_rewrite;
121  List *owned_by;
122  CreateStmt *stmt = makeNode(CreateStmt);
123  Oid seqoid;
124  ObjectAddress address;
125  Relation rel;
126  HeapTuple tuple;
127  TupleDesc tupDesc;
129  bool null[SEQ_COL_LASTCOL];
130  Datum pgs_values[Natts_pg_sequence];
131  bool pgs_nulls[Natts_pg_sequence];
132  int i;
133 
134  /* Unlogged sequences are not implemented -- not clear if useful. */
136  ereport(ERROR,
137  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
138  errmsg("unlogged sequences are not supported")));
139 
140  /*
141  * If if_not_exists was given and a relation with the same name already
142  * exists, bail out. (Note: we needn't check this when not if_not_exists,
143  * because DefineRelation will complain anyway.)
144  */
145  if (seq->if_not_exists)
146  {
148  if (OidIsValid(seqoid))
149  {
150  ereport(NOTICE,
151  (errcode(ERRCODE_DUPLICATE_TABLE),
152  errmsg("relation \"%s\" already exists, skipping",
153  seq->sequence->relname)));
154  return InvalidObjectAddress;
155  }
156  }
157 
158  /* Check and set all option values */
159  init_params(pstate, seq->options, seq->for_identity, true,
160  &seqform, &seqdataform,
161  &need_seq_rewrite, &owned_by);
162 
163  /*
164  * Create relation (and fill value[] and null[] for the tuple)
165  */
166  stmt->tableElts = NIL;
167  for (i = SEQ_COL_FIRSTCOL; i <= SEQ_COL_LASTCOL; i++)
168  {
169  ColumnDef *coldef = makeNode(ColumnDef);
170 
171  coldef->inhcount = 0;
172  coldef->is_local = true;
173  coldef->is_not_null = true;
174  coldef->is_from_type = false;
175  coldef->is_from_parent = false;
176  coldef->storage = 0;
177  coldef->raw_default = NULL;
178  coldef->cooked_default = NULL;
179  coldef->collClause = NULL;
180  coldef->collOid = InvalidOid;
181  coldef->constraints = NIL;
182  coldef->location = -1;
183 
184  null[i - 1] = false;
185 
186  switch (i)
187  {
188  case SEQ_COL_LASTVAL:
189  coldef->typeName = makeTypeNameFromOid(INT8OID, -1);
190  coldef->colname = "last_value";
191  value[i - 1] = Int64GetDatumFast(seqdataform.last_value);
192  break;
193  case SEQ_COL_LOG:
194  coldef->typeName = makeTypeNameFromOid(INT8OID, -1);
195  coldef->colname = "log_cnt";
196  value[i - 1] = Int64GetDatum((int64) 0);
197  break;
198  case SEQ_COL_CALLED:
199  coldef->typeName = makeTypeNameFromOid(BOOLOID, -1);
200  coldef->colname = "is_called";
201  value[i - 1] = BoolGetDatum(false);
202  break;
203  }
204  stmt->tableElts = lappend(stmt->tableElts, coldef);
205  }
206 
207  stmt->relation = seq->sequence;
208  stmt->inhRelations = NIL;
209  stmt->constraints = NIL;
210  stmt->options = NIL;
211  stmt->oncommit = ONCOMMIT_NOOP;
212  stmt->tablespacename = NULL;
213  stmt->if_not_exists = seq->if_not_exists;
214 
215  address = DefineRelation(stmt, RELKIND_SEQUENCE, seq->ownerId, NULL, NULL);
216  seqoid = address.objectId;
217  Assert(seqoid != InvalidOid);
218 
219  rel = heap_open(seqoid, AccessExclusiveLock);
220  tupDesc = RelationGetDescr(rel);
221 
222  /* now initialize the sequence's data */
223  tuple = heap_form_tuple(tupDesc, value, null);
224  fill_seq_with_data(rel, tuple);
225 
226  /* process OWNED BY if given */
227  if (owned_by)
228  process_owned_by(rel, owned_by, seq->for_identity);
229 
230  heap_close(rel, NoLock);
231 
232  /* fill in pg_sequence */
234  tupDesc = RelationGetDescr(rel);
235 
236  memset(pgs_nulls, 0, sizeof(pgs_nulls));
237 
238  pgs_values[Anum_pg_sequence_seqrelid - 1] = ObjectIdGetDatum(seqoid);
239  pgs_values[Anum_pg_sequence_seqtypid - 1] = ObjectIdGetDatum(seqform.seqtypid);
240  pgs_values[Anum_pg_sequence_seqstart - 1] = Int64GetDatumFast(seqform.seqstart);
241  pgs_values[Anum_pg_sequence_seqincrement - 1] = Int64GetDatumFast(seqform.seqincrement);
242  pgs_values[Anum_pg_sequence_seqmax - 1] = Int64GetDatumFast(seqform.seqmax);
243  pgs_values[Anum_pg_sequence_seqmin - 1] = Int64GetDatumFast(seqform.seqmin);
244  pgs_values[Anum_pg_sequence_seqcache - 1] = Int64GetDatumFast(seqform.seqcache);
245  pgs_values[Anum_pg_sequence_seqcycle - 1] = BoolGetDatum(seqform.seqcycle);
246 
247  tuple = heap_form_tuple(tupDesc, pgs_values, pgs_nulls);
248  CatalogTupleInsert(rel, tuple);
249 
250  heap_freetuple(tuple);
252 
253  return address;
254 }
255 
256 /*
257  * Reset a sequence to its initial value.
258  *
259  * The change is made transactionally, so that on failure of the current
260  * transaction, the sequence will be restored to its previous state.
261  * We do that by creating a whole new relfilenode for the sequence; so this
262  * works much like the rewriting forms of ALTER TABLE.
263  *
264  * Caller is assumed to have acquired AccessExclusiveLock on the sequence,
265  * which must not be released until end of transaction. Caller is also
266  * responsible for permissions checking.
267  */
268 void
269 ResetSequence(Oid seq_relid)
270 {
271  Relation seq_rel;
272  SeqTable elm;
274  Buffer buf;
275  HeapTupleData seqdatatuple;
276  HeapTuple tuple;
277  HeapTuple pgstuple;
278  Form_pg_sequence pgsform;
279  int64 startv;
280 
281  /*
282  * Read the old sequence. This does a bit more work than really
283  * necessary, but it's simple, and we do want to double-check that it's
284  * indeed a sequence.
285  */
286  init_sequence(seq_relid, &elm, &seq_rel);
287  (void) read_seq_tuple(seq_rel, &buf, &seqdatatuple);
288 
289  pgstuple = SearchSysCache1(SEQRELID, ObjectIdGetDatum(seq_relid));
290  if (!HeapTupleIsValid(pgstuple))
291  elog(ERROR, "cache lookup failed for sequence %u", seq_relid);
292  pgsform = (Form_pg_sequence) GETSTRUCT(pgstuple);
293  startv = pgsform->seqstart;
294  ReleaseSysCache(pgstuple);
295 
296  /*
297  * Copy the existing sequence tuple.
298  */
299  tuple = heap_copytuple(&seqdatatuple);
300 
301  /* Now we're done with the old page */
302  UnlockReleaseBuffer(buf);
303 
304  /*
305  * Modify the copied tuple to execute the restart (compare the RESTART
306  * action in AlterSequence)
307  */
308  seq = (Form_pg_sequence_data) GETSTRUCT(tuple);
309  seq->last_value = startv;
310  seq->is_called = false;
311  seq->log_cnt = 0;
312 
313  /*
314  * Create a new storage file for the sequence. We want to keep the
315  * sequence's relfrozenxid at 0, since it won't contain any unfrozen XIDs.
316  * Same with relminmxid, since a sequence will never contain multixacts.
317  */
318  RelationSetNewRelfilenode(seq_rel, seq_rel->rd_rel->relpersistence,
320 
321  /*
322  * Insert the modified tuple into the new storage file.
323  */
324  fill_seq_with_data(seq_rel, tuple);
325 
326  /* Clear local cache so that we don't think we have cached numbers */
327  /* Note that we do not change the currval() state */
328  elm->cached = elm->last;
329 
330  relation_close(seq_rel, NoLock);
331 }
332 
333 /*
334  * Initialize a sequence's relation with the specified tuple as content
335  */
336 static void
338 {
339  Buffer buf;
340  Page page;
341  sequence_magic *sm;
342  OffsetNumber offnum;
343 
344  /* Initialize first page of relation with special magic number */
345 
346  buf = ReadBuffer(rel, P_NEW);
347  Assert(BufferGetBlockNumber(buf) == 0);
348 
349  page = BufferGetPage(buf);
350 
351  PageInit(page, BufferGetPageSize(buf), sizeof(sequence_magic));
352  sm = (sequence_magic *) PageGetSpecialPointer(page);
353  sm->magic = SEQ_MAGIC;
354 
355  /* Now insert sequence tuple */
356 
358 
359  /*
360  * Since VACUUM does not process sequences, we have to force the tuple to
361  * have xmin = FrozenTransactionId now. Otherwise it would become
362  * invisible to SELECTs after 2G transactions. It is okay to do this
363  * because if the current transaction aborts, no other xact will ever
364  * examine the sequence tuple anyway.
365  */
372 
373  /* check the comment above nextval_internal()'s equivalent call. */
374  if (RelationNeedsWAL(rel))
376 
378 
379  MarkBufferDirty(buf);
380 
381  offnum = PageAddItem(page, (Item) tuple->t_data, tuple->t_len,
382  InvalidOffsetNumber, false, false);
383  if (offnum != FirstOffsetNumber)
384  elog(ERROR, "failed to add sequence tuple to page");
385 
386  /* XLOG stuff */
387  if (RelationNeedsWAL(rel))
388  {
389  xl_seq_rec xlrec;
390  XLogRecPtr recptr;
391 
392  XLogBeginInsert();
394 
395  xlrec.node = rel->rd_node;
396 
397  XLogRegisterData((char *) &xlrec, sizeof(xl_seq_rec));
398  XLogRegisterData((char *) tuple->t_data, tuple->t_len);
399 
400  recptr = XLogInsert(RM_SEQ_ID, XLOG_SEQ_LOG);
401 
402  PageSetLSN(page, recptr);
403  }
404 
406 
407  UnlockReleaseBuffer(buf);
408 }
409 
410 /*
411  * AlterSequence
412  *
413  * Modify the definition of a sequence relation
414  */
417 {
418  Oid relid;
419  SeqTable elm;
420  Relation seqrel;
421  Buffer buf;
422  HeapTupleData datatuple;
423  Form_pg_sequence seqform;
424  Form_pg_sequence_data newdataform;
425  bool need_seq_rewrite;
426  List *owned_by;
427  ObjectAddress address;
428  Relation rel;
429  HeapTuple seqtuple;
430  HeapTuple newdatatuple;
431 
432  /* Open and lock sequence, and check for ownership along the way. */
433  relid = RangeVarGetRelidExtended(stmt->sequence,
435  stmt->missing_ok,
436  false,
438  NULL);
439  if (relid == InvalidOid)
440  {
441  ereport(NOTICE,
442  (errmsg("relation \"%s\" does not exist, skipping",
443  stmt->sequence->relname)));
444  return InvalidObjectAddress;
445  }
446 
447  init_sequence(relid, &elm, &seqrel);
448 
450  seqtuple = SearchSysCacheCopy1(SEQRELID,
451  ObjectIdGetDatum(relid));
452  if (!HeapTupleIsValid(seqtuple))
453  elog(ERROR, "cache lookup failed for sequence %u",
454  relid);
455 
456  seqform = (Form_pg_sequence) GETSTRUCT(seqtuple);
457 
458  /* lock page's buffer and read tuple into new sequence structure */
459  (void) read_seq_tuple(seqrel, &buf, &datatuple);
460 
461  /* copy the existing sequence data tuple, so it can be modified localy */
462  newdatatuple = heap_copytuple(&datatuple);
463  newdataform = (Form_pg_sequence_data) GETSTRUCT(newdatatuple);
464 
465  UnlockReleaseBuffer(buf);
466 
467  /* Check and set new values */
468  init_params(pstate, stmt->options, stmt->for_identity, false,
469  seqform, newdataform,
470  &need_seq_rewrite, &owned_by);
471 
472  /* Clear local cache so that we don't think we have cached numbers */
473  /* Note that we do not change the currval() state */
474  elm->cached = elm->last;
475 
476  /* If needed, rewrite the sequence relation itself */
477  if (need_seq_rewrite)
478  {
479  /* check the comment above nextval_internal()'s equivalent call. */
480  if (RelationNeedsWAL(seqrel))
482 
483  /*
484  * Create a new storage file for the sequence, making the state
485  * changes transactional. We want to keep the sequence's relfrozenxid
486  * at 0, since it won't contain any unfrozen XIDs. Same with
487  * relminmxid, since a sequence will never contain multixacts.
488  */
489  RelationSetNewRelfilenode(seqrel, seqrel->rd_rel->relpersistence,
491 
492  /*
493  * Insert the modified tuple into the new storage file.
494  */
495  fill_seq_with_data(seqrel, newdatatuple);
496  }
497 
498  /* process OWNED BY if given */
499  if (owned_by)
500  process_owned_by(seqrel, owned_by, stmt->for_identity);
501 
502  /* update the pg_sequence tuple (we could skip this in some cases...) */
503  CatalogTupleUpdate(rel, &seqtuple->t_self, seqtuple);
504 
506 
507  ObjectAddressSet(address, RelationRelationId, relid);
508 
510  relation_close(seqrel, NoLock);
511 
512  return address;
513 }
514 
515 void
517 {
518  Relation rel;
519  HeapTuple tuple;
520 
522 
523  tuple = SearchSysCache1(SEQRELID, ObjectIdGetDatum(relid));
524  if (!HeapTupleIsValid(tuple))
525  elog(ERROR, "cache lookup failed for sequence %u", relid);
526 
527  CatalogTupleDelete(rel, &tuple->t_self);
528 
529  ReleaseSysCache(tuple);
531 }
532 
533 /*
534  * Note: nextval with a text argument is no longer exported as a pg_proc
535  * entry, but we keep it around to ease porting of C code that may have
536  * called the function directly.
537  */
538 Datum
540 {
541  text *seqin = PG_GETARG_TEXT_PP(0);
542  RangeVar *sequence;
543  Oid relid;
544 
546 
547  /*
548  * XXX: This is not safe in the presence of concurrent DDL, but acquiring
549  * a lock here is more expensive than letting nextval_internal do it,
550  * since the latter maintains a cache that keeps us from hitting the lock
551  * manager more than once per transaction. It's not clear whether the
552  * performance penalty is material in practice, but for now, we do it this
553  * way.
554  */
555  relid = RangeVarGetRelid(sequence, NoLock, false);
556 
557  PG_RETURN_INT64(nextval_internal(relid, true));
558 }
559 
560 Datum
562 {
563  Oid relid = PG_GETARG_OID(0);
564 
565  PG_RETURN_INT64(nextval_internal(relid, true));
566 }
567 
568 int64
570 {
571  SeqTable elm;
572  Relation seqrel;
573  Buffer buf;
574  Page page;
575  HeapTuple pgstuple;
576  Form_pg_sequence pgsform;
577  HeapTupleData seqdatatuple;
579  int64 incby,
580  maxv,
581  minv,
582  cache,
583  log,
584  fetch,
585  last;
586  int64 result,
587  next,
588  rescnt = 0;
589  bool cycle;
590  bool logit = false;
591 
592  /* open and lock sequence */
593  init_sequence(relid, &elm, &seqrel);
594 
595  if (check_permissions &&
598  ereport(ERROR,
599  (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
600  errmsg("permission denied for sequence %s",
601  RelationGetRelationName(seqrel))));
602 
603  /* read-only transactions may only modify temp sequences */
604  if (!seqrel->rd_islocaltemp)
605  PreventCommandIfReadOnly("nextval()");
606 
607  /*
608  * Forbid this during parallel operation because, to make it work, the
609  * cooperating backends would need to share the backend-local cached
610  * sequence information. Currently, we don't support that.
611  */
612  PreventCommandIfParallelMode("nextval()");
613 
614  if (elm->last != elm->cached) /* some numbers were cached */
615  {
616  Assert(elm->last_valid);
617  Assert(elm->increment != 0);
618  elm->last += elm->increment;
619  relation_close(seqrel, NoLock);
620  last_used_seq = elm;
621  return elm->last;
622  }
623 
624  pgstuple = SearchSysCache1(SEQRELID, ObjectIdGetDatum(relid));
625  if (!HeapTupleIsValid(pgstuple))
626  elog(ERROR, "cache lookup failed for sequence %u", relid);
627  pgsform = (Form_pg_sequence) GETSTRUCT(pgstuple);
628  incby = pgsform->seqincrement;
629  maxv = pgsform->seqmax;
630  minv = pgsform->seqmin;
631  cache = pgsform->seqcache;
632  cycle = pgsform->seqcycle;
633  ReleaseSysCache(pgstuple);
634 
635  /* lock page' buffer and read tuple */
636  seq = read_seq_tuple(seqrel, &buf, &seqdatatuple);
637  page = BufferGetPage(buf);
638 
639  elm->increment = incby;
640  last = next = result = seq->last_value;
641  fetch = cache;
642  log = seq->log_cnt;
643 
644  if (!seq->is_called)
645  {
646  rescnt++; /* return last_value if not is_called */
647  fetch--;
648  }
649 
650  /*
651  * Decide whether we should emit a WAL log record. If so, force up the
652  * fetch count to grab SEQ_LOG_VALS more values than we actually need to
653  * cache. (These will then be usable without logging.)
654  *
655  * If this is the first nextval after a checkpoint, we must force a new
656  * WAL record to be written anyway, else replay starting from the
657  * checkpoint would fail to advance the sequence past the logged values.
658  * In this case we may as well fetch extra values.
659  */
660  if (log < fetch || !seq->is_called)
661  {
662  /* forced log to satisfy local demand for values */
663  fetch = log = fetch + SEQ_LOG_VALS;
664  logit = true;
665  }
666  else
667  {
668  XLogRecPtr redoptr = GetRedoRecPtr();
669 
670  if (PageGetLSN(page) <= redoptr)
671  {
672  /* last update of seq was before checkpoint */
673  fetch = log = fetch + SEQ_LOG_VALS;
674  logit = true;
675  }
676  }
677 
678  while (fetch) /* try to fetch cache [+ log ] numbers */
679  {
680  /*
681  * Check MAXVALUE for ascending sequences and MINVALUE for descending
682  * sequences
683  */
684  if (incby > 0)
685  {
686  /* ascending sequence */
687  if ((maxv >= 0 && next > maxv - incby) ||
688  (maxv < 0 && next + incby > maxv))
689  {
690  if (rescnt > 0)
691  break; /* stop fetching */
692  if (!cycle)
693  {
694  char buf[100];
695 
696  snprintf(buf, sizeof(buf), INT64_FORMAT, maxv);
697  ereport(ERROR,
698  (errcode(ERRCODE_SEQUENCE_GENERATOR_LIMIT_EXCEEDED),
699  errmsg("nextval: reached maximum value of sequence \"%s\" (%s)",
700  RelationGetRelationName(seqrel), buf)));
701  }
702  next = minv;
703  }
704  else
705  next += incby;
706  }
707  else
708  {
709  /* descending sequence */
710  if ((minv < 0 && next < minv - incby) ||
711  (minv >= 0 && next + incby < minv))
712  {
713  if (rescnt > 0)
714  break; /* stop fetching */
715  if (!cycle)
716  {
717  char buf[100];
718 
719  snprintf(buf, sizeof(buf), INT64_FORMAT, minv);
720  ereport(ERROR,
721  (errcode(ERRCODE_SEQUENCE_GENERATOR_LIMIT_EXCEEDED),
722  errmsg("nextval: reached minimum value of sequence \"%s\" (%s)",
723  RelationGetRelationName(seqrel), buf)));
724  }
725  next = maxv;
726  }
727  else
728  next += incby;
729  }
730  fetch--;
731  if (rescnt < cache)
732  {
733  log--;
734  rescnt++;
735  last = next;
736  if (rescnt == 1) /* if it's first result - */
737  result = next; /* it's what to return */
738  }
739  }
740 
741  log -= fetch; /* adjust for any unfetched numbers */
742  Assert(log >= 0);
743 
744  /* save info in local cache */
745  elm->last = result; /* last returned number */
746  elm->cached = last; /* last fetched number */
747  elm->last_valid = true;
748 
749  last_used_seq = elm;
750 
751  /*
752  * If something needs to be WAL logged, acquire an xid, so this
753  * transaction's commit will trigger a WAL flush and wait for syncrep.
754  * It's sufficient to ensure the toplevel transaction has an xid, no need
755  * to assign xids subxacts, that'll already trigger an appropriate wait.
756  * (Have to do that here, so we're outside the critical section)
757  */
758  if (logit && RelationNeedsWAL(seqrel))
760 
761  /* ready to change the on-disk (or really, in-buffer) tuple */
763 
764  /*
765  * We must mark the buffer dirty before doing XLogInsert(); see notes in
766  * SyncOneBuffer(). However, we don't apply the desired changes just yet.
767  * This looks like a violation of the buffer update protocol, but it is in
768  * fact safe because we hold exclusive lock on the buffer. Any other
769  * process, including a checkpoint, that tries to examine the buffer
770  * contents will block until we release the lock, and then will see the
771  * final state that we install below.
772  */
773  MarkBufferDirty(buf);
774 
775  /* XLOG stuff */
776  if (logit && RelationNeedsWAL(seqrel))
777  {
778  xl_seq_rec xlrec;
779  XLogRecPtr recptr;
780 
781  /*
782  * We don't log the current state of the tuple, but rather the state
783  * as it would appear after "log" more fetches. This lets us skip
784  * that many future WAL records, at the cost that we lose those
785  * sequence values if we crash.
786  */
787  XLogBeginInsert();
789 
790  /* set values that will be saved in xlog */
791  seq->last_value = next;
792  seq->is_called = true;
793  seq->log_cnt = 0;
794 
795  xlrec.node = seqrel->rd_node;
796 
797  XLogRegisterData((char *) &xlrec, sizeof(xl_seq_rec));
798  XLogRegisterData((char *) seqdatatuple.t_data, seqdatatuple.t_len);
799 
800  recptr = XLogInsert(RM_SEQ_ID, XLOG_SEQ_LOG);
801 
802  PageSetLSN(page, recptr);
803  }
804 
805  /* Now update sequence tuple to the intended final state */
806  seq->last_value = last; /* last fetched number */
807  seq->is_called = true;
808  seq->log_cnt = log; /* how much is logged */
809 
811 
812  UnlockReleaseBuffer(buf);
813 
814  relation_close(seqrel, NoLock);
815 
816  return result;
817 }
818 
819 Datum
821 {
822  Oid relid = PG_GETARG_OID(0);
823  int64 result;
824  SeqTable elm;
825  Relation seqrel;
826 
827  /* open and lock sequence */
828  init_sequence(relid, &elm, &seqrel);
829 
830  if (pg_class_aclcheck(elm->relid, GetUserId(),
832  ereport(ERROR,
833  (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
834  errmsg("permission denied for sequence %s",
835  RelationGetRelationName(seqrel))));
836 
837  if (!elm->last_valid)
838  ereport(ERROR,
839  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
840  errmsg("currval of sequence \"%s\" is not yet defined in this session",
841  RelationGetRelationName(seqrel))));
842 
843  result = elm->last;
844 
845  relation_close(seqrel, NoLock);
846 
847  PG_RETURN_INT64(result);
848 }
849 
850 Datum
852 {
853  Relation seqrel;
854  int64 result;
855 
856  if (last_used_seq == NULL)
857  ereport(ERROR,
858  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
859  errmsg("lastval is not yet defined in this session")));
860 
861  /* Someone may have dropped the sequence since the last nextval() */
862  if (!SearchSysCacheExists1(RELOID, ObjectIdGetDatum(last_used_seq->relid)))
863  ereport(ERROR,
864  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
865  errmsg("lastval is not yet defined in this session")));
866 
867  seqrel = lock_and_open_sequence(last_used_seq);
868 
869  /* nextval() must have already been called for this sequence */
870  Assert(last_used_seq->last_valid);
871 
872  if (pg_class_aclcheck(last_used_seq->relid, GetUserId(),
874  ereport(ERROR,
875  (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
876  errmsg("permission denied for sequence %s",
877  RelationGetRelationName(seqrel))));
878 
879  result = last_used_seq->last;
880  relation_close(seqrel, NoLock);
881 
882  PG_RETURN_INT64(result);
883 }
884 
885 /*
886  * Main internal procedure that handles 2 & 3 arg forms of SETVAL.
887  *
888  * Note that the 3 arg version (which sets the is_called flag) is
889  * only for use in pg_dump, and setting the is_called flag may not
890  * work if multiple users are attached to the database and referencing
891  * the sequence (unlikely if pg_dump is restoring it).
892  *
893  * It is necessary to have the 3 arg version so that pg_dump can
894  * restore the state of a sequence exactly during data-only restores -
895  * it is the only way to clear the is_called flag in an existing
896  * sequence.
897  */
898 static void
899 do_setval(Oid relid, int64 next, bool iscalled)
900 {
901  SeqTable elm;
902  Relation seqrel;
903  Buffer buf;
904  HeapTupleData seqdatatuple;
906  HeapTuple pgstuple;
907  Form_pg_sequence pgsform;
908  int64 maxv,
909  minv;
910 
911  /* open and lock sequence */
912  init_sequence(relid, &elm, &seqrel);
913 
915  ereport(ERROR,
916  (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
917  errmsg("permission denied for sequence %s",
918  RelationGetRelationName(seqrel))));
919 
920  pgstuple = SearchSysCache1(SEQRELID, ObjectIdGetDatum(relid));
921  if (!HeapTupleIsValid(pgstuple))
922  elog(ERROR, "cache lookup failed for sequence %u", relid);
923  pgsform = (Form_pg_sequence) GETSTRUCT(pgstuple);
924  maxv = pgsform->seqmax;
925  minv = pgsform->seqmin;
926  ReleaseSysCache(pgstuple);
927 
928  /* read-only transactions may only modify temp sequences */
929  if (!seqrel->rd_islocaltemp)
930  PreventCommandIfReadOnly("setval()");
931 
932  /*
933  * Forbid this during parallel operation because, to make it work, the
934  * cooperating backends would need to share the backend-local cached
935  * sequence information. Currently, we don't support that.
936  */
937  PreventCommandIfParallelMode("setval()");
938 
939  /* lock page' buffer and read tuple */
940  seq = read_seq_tuple(seqrel, &buf, &seqdatatuple);
941 
942  if ((next < minv) || (next > maxv))
943  {
944  char bufv[100],
945  bufm[100],
946  bufx[100];
947 
948  snprintf(bufv, sizeof(bufv), INT64_FORMAT, next);
949  snprintf(bufm, sizeof(bufm), INT64_FORMAT, minv);
950  snprintf(bufx, sizeof(bufx), INT64_FORMAT, maxv);
951  ereport(ERROR,
952  (errcode(ERRCODE_NUMERIC_VALUE_OUT_OF_RANGE),
953  errmsg("setval: value %s is out of bounds for sequence \"%s\" (%s..%s)",
954  bufv, RelationGetRelationName(seqrel),
955  bufm, bufx)));
956  }
957 
958  /* Set the currval() state only if iscalled = true */
959  if (iscalled)
960  {
961  elm->last = next; /* last returned number */
962  elm->last_valid = true;
963  }
964 
965  /* In any case, forget any future cached numbers */
966  elm->cached = elm->last;
967 
968  /* check the comment above nextval_internal()'s equivalent call. */
969  if (RelationNeedsWAL(seqrel))
971 
972  /* ready to change the on-disk (or really, in-buffer) tuple */
974 
975  seq->last_value = next; /* last fetched number */
976  seq->is_called = iscalled;
977  seq->log_cnt = 0;
978 
979  MarkBufferDirty(buf);
980 
981  /* XLOG stuff */
982  if (RelationNeedsWAL(seqrel))
983  {
984  xl_seq_rec xlrec;
985  XLogRecPtr recptr;
986  Page page = BufferGetPage(buf);
987 
988  XLogBeginInsert();
990 
991  xlrec.node = seqrel->rd_node;
992  XLogRegisterData((char *) &xlrec, sizeof(xl_seq_rec));
993  XLogRegisterData((char *) seqdatatuple.t_data, seqdatatuple.t_len);
994 
995  recptr = XLogInsert(RM_SEQ_ID, XLOG_SEQ_LOG);
996 
997  PageSetLSN(page, recptr);
998  }
999 
1000  END_CRIT_SECTION();
1001 
1002  UnlockReleaseBuffer(buf);
1003 
1004  relation_close(seqrel, NoLock);
1005 }
1006 
1007 /*
1008  * Implement the 2 arg setval procedure.
1009  * See do_setval for discussion.
1010  */
1011 Datum
1013 {
1014  Oid relid = PG_GETARG_OID(0);
1015  int64 next = PG_GETARG_INT64(1);
1016 
1017  do_setval(relid, next, true);
1018 
1019  PG_RETURN_INT64(next);
1020 }
1021 
1022 /*
1023  * Implement the 3 arg setval procedure.
1024  * See do_setval for discussion.
1025  */
1026 Datum
1028 {
1029  Oid relid = PG_GETARG_OID(0);
1030  int64 next = PG_GETARG_INT64(1);
1031  bool iscalled = PG_GETARG_BOOL(2);
1032 
1033  do_setval(relid, next, iscalled);
1034 
1035  PG_RETURN_INT64(next);
1036 }
1037 
1038 
1039 /*
1040  * Open the sequence and acquire lock if needed
1041  *
1042  * If we haven't touched the sequence already in this transaction,
1043  * we need to acquire a lock. We arrange for the lock to
1044  * be owned by the top transaction, so that we don't need to do it
1045  * more than once per xact.
1046  */
1047 static Relation
1049 {
1050  LocalTransactionId thislxid = MyProc->lxid;
1051 
1052  /* Get the lock if not already held in this xact */
1053  if (seq->lxid != thislxid)
1054  {
1055  ResourceOwner currentOwner;
1056 
1057  currentOwner = CurrentResourceOwner;
1058  PG_TRY();
1059  {
1062  }
1063  PG_CATCH();
1064  {
1065  /* Ensure CurrentResourceOwner is restored on error */
1066  CurrentResourceOwner = currentOwner;
1067  PG_RE_THROW();
1068  }
1069  PG_END_TRY();
1070  CurrentResourceOwner = currentOwner;
1071 
1072  /* Flag that we have a lock in the current xact */
1073  seq->lxid = thislxid;
1074  }
1075 
1076  /* We now know we have the lock, and can safely open the rel */
1077  return relation_open(seq->relid, NoLock);
1078 }
1079 
1080 /*
1081  * Creates the hash table for storing sequence data
1082  */
1083 static void
1085 {
1086  HASHCTL ctl;
1087 
1088  memset(&ctl, 0, sizeof(ctl));
1089  ctl.keysize = sizeof(Oid);
1090  ctl.entrysize = sizeof(SeqTableData);
1091 
1092  seqhashtab = hash_create("Sequence values", 16, &ctl,
1093  HASH_ELEM | HASH_BLOBS);
1094 }
1095 
1096 /*
1097  * Given a relation OID, open and lock the sequence. p_elm and p_rel are
1098  * output parameters.
1099  */
1100 static void
1101 init_sequence(Oid relid, SeqTable *p_elm, Relation *p_rel)
1102 {
1103  SeqTable elm;
1104  Relation seqrel;
1105  bool found;
1106 
1107  /* Find or create a hash table entry for this sequence */
1108  if (seqhashtab == NULL)
1110 
1111  elm = (SeqTable) hash_search(seqhashtab, &relid, HASH_ENTER, &found);
1112 
1113  /*
1114  * Initialize the new hash table entry if it did not exist already.
1115  *
1116  * NOTE: seqtable entries are stored for the life of a backend (unless
1117  * explicitly discarded with DISCARD). If the sequence itself is deleted
1118  * then the entry becomes wasted memory, but it's small enough that this
1119  * should not matter.
1120  */
1121  if (!found)
1122  {
1123  /* relid already filled in */
1124  elm->filenode = InvalidOid;
1126  elm->last_valid = false;
1127  elm->last = elm->cached = 0;
1128  }
1129 
1130  /*
1131  * Open the sequence relation.
1132  */
1133  seqrel = lock_and_open_sequence(elm);
1134 
1135  if (seqrel->rd_rel->relkind != RELKIND_SEQUENCE)
1136  ereport(ERROR,
1137  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1138  errmsg("\"%s\" is not a sequence",
1139  RelationGetRelationName(seqrel))));
1140 
1141  /*
1142  * If the sequence has been transactionally replaced since we last saw it,
1143  * discard any cached-but-unissued values. We do not touch the currval()
1144  * state, however.
1145  */
1146  if (seqrel->rd_rel->relfilenode != elm->filenode)
1147  {
1148  elm->filenode = seqrel->rd_rel->relfilenode;
1149  elm->cached = elm->last;
1150  }
1151 
1152  /* Return results */
1153  *p_elm = elm;
1154  *p_rel = seqrel;
1155 }
1156 
1157 
1158 /*
1159  * Given an opened sequence relation, lock the page buffer and find the tuple
1160  *
1161  * *buf receives the reference to the pinned-and-ex-locked buffer
1162  * *seqdatatuple receives the reference to the sequence tuple proper
1163  * (this arg should point to a local variable of type HeapTupleData)
1164  *
1165  * Function's return value points to the data payload of the tuple
1166  */
1167 static Form_pg_sequence_data
1169 {
1170  Page page;
1171  ItemId lp;
1172  sequence_magic *sm;
1174 
1175  *buf = ReadBuffer(rel, 0);
1177 
1178  page = BufferGetPage(*buf);
1179  sm = (sequence_magic *) PageGetSpecialPointer(page);
1180 
1181  if (sm->magic != SEQ_MAGIC)
1182  elog(ERROR, "bad magic number in sequence \"%s\": %08X",
1183  RelationGetRelationName(rel), sm->magic);
1184 
1185  lp = PageGetItemId(page, FirstOffsetNumber);
1186  Assert(ItemIdIsNormal(lp));
1187 
1188  /* Note we currently only bother to set these two fields of *seqdatatuple */
1189  seqdatatuple->t_data = (HeapTupleHeader) PageGetItem(page, lp);
1190  seqdatatuple->t_len = ItemIdGetLength(lp);
1191 
1192  /*
1193  * Previous releases of Postgres neglected to prevent SELECT FOR UPDATE on
1194  * a sequence, which would leave a non-frozen XID in the sequence tuple's
1195  * xmax, which eventually leads to clog access failures or worse. If we
1196  * see this has happened, clean up after it. We treat this like a hint
1197  * bit update, ie, don't bother to WAL-log it, since we can certainly do
1198  * this again if the update gets lost.
1199  */
1200  Assert(!(seqdatatuple->t_data->t_infomask & HEAP_XMAX_IS_MULTI));
1202  {
1204  seqdatatuple->t_data->t_infomask &= ~HEAP_XMAX_COMMITTED;
1205  seqdatatuple->t_data->t_infomask |= HEAP_XMAX_INVALID;
1206  MarkBufferDirtyHint(*buf, true);
1207  }
1208 
1209  seq = (Form_pg_sequence_data) GETSTRUCT(seqdatatuple);
1210 
1211  return seq;
1212 }
1213 
1214 /*
1215  * init_params: process the options list of CREATE or ALTER SEQUENCE, and
1216  * store the values into appropriate fields of seqform, for changes that go
1217  * into the pg_sequence catalog, and fields of seqdataform for changes to the
1218  * sequence relation itself. Set *need_seq_rewrite to true if we changed any
1219  * parameters that require rewriting the sequence's relation (interesting for
1220  * ALTER SEQUENCE). Also set *owned_by to any OWNED BY option, or to NIL if
1221  * there is none.
1222  *
1223  * If isInit is true, fill any unspecified options with default values;
1224  * otherwise, do not change existing options that aren't explicitly overridden.
1225  *
1226  * Note: we force a sequence rewrite whenever we change parameters that affect
1227  * generation of future sequence values, even if the seqdataform per se is not
1228  * changed. This allows ALTER SEQUENCE to behave transactionally. Currently,
1229  * the only option that doesn't cause that is OWNED BY. It's *necessary* for
1230  * ALTER SEQUENCE OWNED BY to not rewrite the sequence, because that would
1231  * break pg_upgrade by causing unwanted changes in the sequence's relfilenode.
1232  */
1233 static void
1234 init_params(ParseState *pstate, List *options, bool for_identity,
1235  bool isInit,
1236  Form_pg_sequence seqform,
1237  Form_pg_sequence_data seqdataform,
1238  bool *need_seq_rewrite,
1239  List **owned_by)
1240 {
1241  DefElem *as_type = NULL;
1242  DefElem *start_value = NULL;
1243  DefElem *restart_value = NULL;
1244  DefElem *increment_by = NULL;
1245  DefElem *max_value = NULL;
1246  DefElem *min_value = NULL;
1247  DefElem *cache_value = NULL;
1248  DefElem *is_cycled = NULL;
1249  ListCell *option;
1250  bool reset_max_value = false;
1251  bool reset_min_value = false;
1252 
1253  *need_seq_rewrite = false;
1254  *owned_by = NIL;
1255 
1256  foreach(option, options)
1257  {
1258  DefElem *defel = (DefElem *) lfirst(option);
1259 
1260  if (strcmp(defel->defname, "as") == 0)
1261  {
1262  if (as_type)
1263  ereport(ERROR,
1264  (errcode(ERRCODE_SYNTAX_ERROR),
1265  errmsg("conflicting or redundant options"),
1266  parser_errposition(pstate, defel->location)));
1267  as_type = defel;
1268  *need_seq_rewrite = true;
1269  }
1270  else if (strcmp(defel->defname, "increment") == 0)
1271  {
1272  if (increment_by)
1273  ereport(ERROR,
1274  (errcode(ERRCODE_SYNTAX_ERROR),
1275  errmsg("conflicting or redundant options"),
1276  parser_errposition(pstate, defel->location)));
1277  increment_by = defel;
1278  *need_seq_rewrite = true;
1279  }
1280  else if (strcmp(defel->defname, "start") == 0)
1281  {
1282  if (start_value)
1283  ereport(ERROR,
1284  (errcode(ERRCODE_SYNTAX_ERROR),
1285  errmsg("conflicting or redundant options"),
1286  parser_errposition(pstate, defel->location)));
1287  start_value = defel;
1288  *need_seq_rewrite = true;
1289  }
1290  else if (strcmp(defel->defname, "restart") == 0)
1291  {
1292  if (restart_value)
1293  ereport(ERROR,
1294  (errcode(ERRCODE_SYNTAX_ERROR),
1295  errmsg("conflicting or redundant options"),
1296  parser_errposition(pstate, defel->location)));
1297  restart_value = defel;
1298  *need_seq_rewrite = true;
1299  }
1300  else if (strcmp(defel->defname, "maxvalue") == 0)
1301  {
1302  if (max_value)
1303  ereport(ERROR,
1304  (errcode(ERRCODE_SYNTAX_ERROR),
1305  errmsg("conflicting or redundant options"),
1306  parser_errposition(pstate, defel->location)));
1307  max_value = defel;
1308  *need_seq_rewrite = true;
1309  }
1310  else if (strcmp(defel->defname, "minvalue") == 0)
1311  {
1312  if (min_value)
1313  ereport(ERROR,
1314  (errcode(ERRCODE_SYNTAX_ERROR),
1315  errmsg("conflicting or redundant options"),
1316  parser_errposition(pstate, defel->location)));
1317  min_value = defel;
1318  *need_seq_rewrite = true;
1319  }
1320  else if (strcmp(defel->defname, "cache") == 0)
1321  {
1322  if (cache_value)
1323  ereport(ERROR,
1324  (errcode(ERRCODE_SYNTAX_ERROR),
1325  errmsg("conflicting or redundant options"),
1326  parser_errposition(pstate, defel->location)));
1327  cache_value = defel;
1328  *need_seq_rewrite = true;
1329  }
1330  else if (strcmp(defel->defname, "cycle") == 0)
1331  {
1332  if (is_cycled)
1333  ereport(ERROR,
1334  (errcode(ERRCODE_SYNTAX_ERROR),
1335  errmsg("conflicting or redundant options"),
1336  parser_errposition(pstate, defel->location)));
1337  is_cycled = defel;
1338  *need_seq_rewrite = true;
1339  }
1340  else if (strcmp(defel->defname, "owned_by") == 0)
1341  {
1342  if (*owned_by)
1343  ereport(ERROR,
1344  (errcode(ERRCODE_SYNTAX_ERROR),
1345  errmsg("conflicting or redundant options"),
1346  parser_errposition(pstate, defel->location)));
1347  *owned_by = defGetQualifiedName(defel);
1348  }
1349  else if (strcmp(defel->defname, "sequence_name") == 0)
1350  {
1351  /*
1352  * The parser allows this, but it is only for identity columns, in
1353  * which case it is filtered out in parse_utilcmd.c. We only get
1354  * here if someone puts it into a CREATE SEQUENCE.
1355  */
1356  ereport(ERROR,
1357  (errcode(ERRCODE_SYNTAX_ERROR),
1358  errmsg("invalid sequence option SEQUENCE NAME"),
1359  parser_errposition(pstate, defel->location)));
1360  }
1361  else
1362  elog(ERROR, "option \"%s\" not recognized",
1363  defel->defname);
1364  }
1365 
1366  /*
1367  * We must reset log_cnt when isInit or when changing any parameters that
1368  * would affect future nextval allocations.
1369  */
1370  if (isInit)
1371  seqdataform->log_cnt = 0;
1372 
1373  /* AS type */
1374  if (as_type != NULL)
1375  {
1376  Oid newtypid = typenameTypeId(pstate, defGetTypeName(as_type));
1377 
1378  if (newtypid != INT2OID &&
1379  newtypid != INT4OID &&
1380  newtypid != INT8OID)
1381  ereport(ERROR,
1382  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1383  for_identity
1384  ? errmsg("identity column type must be smallint, integer, or bigint")
1385  : errmsg("sequence type must be smallint, integer, or bigint")));
1386 
1387  if (!isInit)
1388  {
1389  /*
1390  * When changing type and the old sequence min/max values were the
1391  * min/max of the old type, adjust sequence min/max values to
1392  * min/max of new type. (Otherwise, the user chose explicit
1393  * min/max values, which we'll leave alone.)
1394  */
1395  if ((seqform->seqtypid == INT2OID && seqform->seqmax == PG_INT16_MAX) ||
1396  (seqform->seqtypid == INT4OID && seqform->seqmax == PG_INT32_MAX) ||
1397  (seqform->seqtypid == INT8OID && seqform->seqmax == PG_INT64_MAX))
1398  reset_max_value = true;
1399  if ((seqform->seqtypid == INT2OID && seqform->seqmin == PG_INT16_MIN) ||
1400  (seqform->seqtypid == INT4OID && seqform->seqmin == PG_INT32_MIN) ||
1401  (seqform->seqtypid == INT8OID && seqform->seqmin == PG_INT64_MIN))
1402  reset_min_value = true;
1403  }
1404 
1405  seqform->seqtypid = newtypid;
1406  }
1407  else if (isInit)
1408  {
1409  seqform->seqtypid = INT8OID;
1410  }
1411 
1412  /* INCREMENT BY */
1413  if (increment_by != NULL)
1414  {
1415  seqform->seqincrement = defGetInt64(increment_by);
1416  if (seqform->seqincrement == 0)
1417  ereport(ERROR,
1418  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1419  errmsg("INCREMENT must not be zero")));
1420  seqdataform->log_cnt = 0;
1421  }
1422  else if (isInit)
1423  {
1424  seqform->seqincrement = 1;
1425  }
1426 
1427  /* CYCLE */
1428  if (is_cycled != NULL)
1429  {
1430  seqform->seqcycle = intVal(is_cycled->arg);
1431  Assert(BoolIsValid(seqform->seqcycle));
1432  seqdataform->log_cnt = 0;
1433  }
1434  else if (isInit)
1435  {
1436  seqform->seqcycle = false;
1437  }
1438 
1439  /* MAXVALUE (null arg means NO MAXVALUE) */
1440  if (max_value != NULL && max_value->arg)
1441  {
1442  seqform->seqmax = defGetInt64(max_value);
1443  seqdataform->log_cnt = 0;
1444  }
1445  else if (isInit || max_value != NULL || reset_max_value)
1446  {
1447  if (seqform->seqincrement > 0 || reset_max_value)
1448  {
1449  /* ascending seq */
1450  if (seqform->seqtypid == INT2OID)
1451  seqform->seqmax = PG_INT16_MAX;
1452  else if (seqform->seqtypid == INT4OID)
1453  seqform->seqmax = PG_INT32_MAX;
1454  else
1455  seqform->seqmax = PG_INT64_MAX;
1456  }
1457  else
1458  seqform->seqmax = -1; /* descending seq */
1459  seqdataform->log_cnt = 0;
1460  }
1461 
1462  if ((seqform->seqtypid == INT2OID && (seqform->seqmax < PG_INT16_MIN || seqform->seqmax > PG_INT16_MAX))
1463  || (seqform->seqtypid == INT4OID && (seqform->seqmax < PG_INT32_MIN || seqform->seqmax > PG_INT32_MAX))
1464  || (seqform->seqtypid == INT8OID && (seqform->seqmax < PG_INT64_MIN || seqform->seqmax > PG_INT64_MAX)))
1465  {
1466  char bufx[100];
1467 
1468  snprintf(bufx, sizeof(bufx), INT64_FORMAT, seqform->seqmax);
1469 
1470  ereport(ERROR,
1471  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1472  errmsg("MAXVALUE (%s) is out of range for sequence data type %s",
1473  bufx, format_type_be(seqform->seqtypid))));
1474  }
1475 
1476  /* MINVALUE (null arg means NO MINVALUE) */
1477  if (min_value != NULL && min_value->arg)
1478  {
1479  seqform->seqmin = defGetInt64(min_value);
1480  seqdataform->log_cnt = 0;
1481  }
1482  else if (isInit || min_value != NULL || reset_min_value)
1483  {
1484  if (seqform->seqincrement < 0 || reset_min_value)
1485  {
1486  /* descending seq */
1487  if (seqform->seqtypid == INT2OID)
1488  seqform->seqmin = PG_INT16_MIN;
1489  else if (seqform->seqtypid == INT4OID)
1490  seqform->seqmin = PG_INT32_MIN;
1491  else
1492  seqform->seqmin = PG_INT64_MIN;
1493  }
1494  else
1495  seqform->seqmin = 1; /* ascending seq */
1496  seqdataform->log_cnt = 0;
1497  }
1498 
1499  if ((seqform->seqtypid == INT2OID && (seqform->seqmin < PG_INT16_MIN || seqform->seqmin > PG_INT16_MAX))
1500  || (seqform->seqtypid == INT4OID && (seqform->seqmin < PG_INT32_MIN || seqform->seqmin > PG_INT32_MAX))
1501  || (seqform->seqtypid == INT8OID && (seqform->seqmin < PG_INT64_MIN || seqform->seqmin > PG_INT64_MAX)))
1502  {
1503  char bufm[100];
1504 
1505  snprintf(bufm, sizeof(bufm), INT64_FORMAT, seqform->seqmin);
1506 
1507  ereport(ERROR,
1508  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1509  errmsg("MINVALUE (%s) is out of range for sequence data type %s",
1510  bufm, format_type_be(seqform->seqtypid))));
1511  }
1512 
1513  /* crosscheck min/max */
1514  if (seqform->seqmin >= seqform->seqmax)
1515  {
1516  char bufm[100],
1517  bufx[100];
1518 
1519  snprintf(bufm, sizeof(bufm), INT64_FORMAT, seqform->seqmin);
1520  snprintf(bufx, sizeof(bufx), INT64_FORMAT, seqform->seqmax);
1521  ereport(ERROR,
1522  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1523  errmsg("MINVALUE (%s) must be less than MAXVALUE (%s)",
1524  bufm, bufx)));
1525  }
1526 
1527  /* START WITH */
1528  if (start_value != NULL)
1529  {
1530  seqform->seqstart = defGetInt64(start_value);
1531  }
1532  else if (isInit)
1533  {
1534  if (seqform->seqincrement > 0)
1535  seqform->seqstart = seqform->seqmin; /* ascending seq */
1536  else
1537  seqform->seqstart = seqform->seqmax; /* descending seq */
1538  }
1539 
1540  /* crosscheck START */
1541  if (seqform->seqstart < seqform->seqmin)
1542  {
1543  char bufs[100],
1544  bufm[100];
1545 
1546  snprintf(bufs, sizeof(bufs), INT64_FORMAT, seqform->seqstart);
1547  snprintf(bufm, sizeof(bufm), INT64_FORMAT, seqform->seqmin);
1548  ereport(ERROR,
1549  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1550  errmsg("START value (%s) cannot be less than MINVALUE (%s)",
1551  bufs, bufm)));
1552  }
1553  if (seqform->seqstart > seqform->seqmax)
1554  {
1555  char bufs[100],
1556  bufm[100];
1557 
1558  snprintf(bufs, sizeof(bufs), INT64_FORMAT, seqform->seqstart);
1559  snprintf(bufm, sizeof(bufm), INT64_FORMAT, seqform->seqmax);
1560  ereport(ERROR,
1561  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1562  errmsg("START value (%s) cannot be greater than MAXVALUE (%s)",
1563  bufs, bufm)));
1564  }
1565 
1566  /* RESTART [WITH] */
1567  if (restart_value != NULL)
1568  {
1569  if (restart_value->arg != NULL)
1570  seqdataform->last_value = defGetInt64(restart_value);
1571  else
1572  seqdataform->last_value = seqform->seqstart;
1573  seqdataform->is_called = false;
1574  seqdataform->log_cnt = 0;
1575  }
1576  else if (isInit)
1577  {
1578  seqdataform->last_value = seqform->seqstart;
1579  seqdataform->is_called = false;
1580  }
1581 
1582  /* crosscheck RESTART (or current value, if changing MIN/MAX) */
1583  if (seqdataform->last_value < seqform->seqmin)
1584  {
1585  char bufs[100],
1586  bufm[100];
1587 
1588  snprintf(bufs, sizeof(bufs), INT64_FORMAT, seqdataform->last_value);
1589  snprintf(bufm, sizeof(bufm), INT64_FORMAT, seqform->seqmin);
1590  ereport(ERROR,
1591  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1592  errmsg("RESTART value (%s) cannot be less than MINVALUE (%s)",
1593  bufs, bufm)));
1594  }
1595  if (seqdataform->last_value > seqform->seqmax)
1596  {
1597  char bufs[100],
1598  bufm[100];
1599 
1600  snprintf(bufs, sizeof(bufs), INT64_FORMAT, seqdataform->last_value);
1601  snprintf(bufm, sizeof(bufm), INT64_FORMAT, seqform->seqmax);
1602  ereport(ERROR,
1603  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1604  errmsg("RESTART value (%s) cannot be greater than MAXVALUE (%s)",
1605  bufs, bufm)));
1606  }
1607 
1608  /* CACHE */
1609  if (cache_value != NULL)
1610  {
1611  seqform->seqcache = defGetInt64(cache_value);
1612  if (seqform->seqcache <= 0)
1613  {
1614  char buf[100];
1615 
1616  snprintf(buf, sizeof(buf), INT64_FORMAT, seqform->seqcache);
1617  ereport(ERROR,
1618  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
1619  errmsg("CACHE (%s) must be greater than zero",
1620  buf)));
1621  }
1622  seqdataform->log_cnt = 0;
1623  }
1624  else if (isInit)
1625  {
1626  seqform->seqcache = 1;
1627  }
1628 }
1629 
1630 /*
1631  * Process an OWNED BY option for CREATE/ALTER SEQUENCE
1632  *
1633  * Ownership permissions on the sequence are already checked,
1634  * but if we are establishing a new owned-by dependency, we must
1635  * enforce that the referenced table has the same owner and namespace
1636  * as the sequence.
1637  */
1638 static void
1639 process_owned_by(Relation seqrel, List *owned_by, bool for_identity)
1640 {
1641  DependencyType deptype;
1642  int nnames;
1643  Relation tablerel;
1644  AttrNumber attnum;
1645 
1646  deptype = for_identity ? DEPENDENCY_INTERNAL : DEPENDENCY_AUTO;
1647 
1648  nnames = list_length(owned_by);
1649  Assert(nnames > 0);
1650  if (nnames == 1)
1651  {
1652  /* Must be OWNED BY NONE */
1653  if (strcmp(strVal(linitial(owned_by)), "none") != 0)
1654  ereport(ERROR,
1655  (errcode(ERRCODE_SYNTAX_ERROR),
1656  errmsg("invalid OWNED BY option"),
1657  errhint("Specify OWNED BY table.column or OWNED BY NONE.")));
1658  tablerel = NULL;
1659  attnum = 0;
1660  }
1661  else
1662  {
1663  List *relname;
1664  char *attrname;
1665  RangeVar *rel;
1666 
1667  /* Separate relname and attr name */
1668  relname = list_truncate(list_copy(owned_by), nnames - 1);
1669  attrname = strVal(lfirst(list_tail(owned_by)));
1670 
1671  /* Open and lock rel to ensure it won't go away meanwhile */
1672  rel = makeRangeVarFromNameList(relname);
1673  tablerel = relation_openrv(rel, AccessShareLock);
1674 
1675  /* Must be a regular or foreign table */
1676  if (!(tablerel->rd_rel->relkind == RELKIND_RELATION ||
1677  tablerel->rd_rel->relkind == RELKIND_FOREIGN_TABLE ||
1678  tablerel->rd_rel->relkind == RELKIND_VIEW ||
1679  tablerel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE))
1680  ereport(ERROR,
1681  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
1682  errmsg("referenced relation \"%s\" is not a table or foreign table",
1683  RelationGetRelationName(tablerel))));
1684 
1685  /* We insist on same owner and schema */
1686  if (seqrel->rd_rel->relowner != tablerel->rd_rel->relowner)
1687  ereport(ERROR,
1688  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1689  errmsg("sequence must have same owner as table it is linked to")));
1690  if (RelationGetNamespace(seqrel) != RelationGetNamespace(tablerel))
1691  ereport(ERROR,
1692  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
1693  errmsg("sequence must be in same schema as table it is linked to")));
1694 
1695  /* Now, fetch the attribute number from the system cache */
1696  attnum = get_attnum(RelationGetRelid(tablerel), attrname);
1697  if (attnum == InvalidAttrNumber)
1698  ereport(ERROR,
1699  (errcode(ERRCODE_UNDEFINED_COLUMN),
1700  errmsg("column \"%s\" of relation \"%s\" does not exist",
1701  attrname, RelationGetRelationName(tablerel))));
1702  }
1703 
1704  /*
1705  * Catch user explicitly running OWNED BY on identity sequence.
1706  */
1707  if (deptype == DEPENDENCY_AUTO)
1708  {
1709  Oid tableId;
1710  int32 colId;
1711 
1712  if (sequenceIsOwned(RelationGetRelid(seqrel), DEPENDENCY_INTERNAL, &tableId, &colId))
1713  ereport(ERROR,
1714  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1715  errmsg("cannot change ownership of identity sequence"),
1716  errdetail("Sequence \"%s\" is linked to table \"%s\".",
1717  RelationGetRelationName(seqrel),
1718  get_rel_name(tableId))));
1719  }
1720 
1721  /*
1722  * OK, we are ready to update pg_depend. First remove any existing
1723  * dependencies for the sequence, then optionally add a new one.
1724  */
1726  RelationRelationId, deptype);
1727 
1728  if (tablerel)
1729  {
1730  ObjectAddress refobject,
1731  depobject;
1732 
1733  refobject.classId = RelationRelationId;
1734  refobject.objectId = RelationGetRelid(tablerel);
1735  refobject.objectSubId = attnum;
1736  depobject.classId = RelationRelationId;
1737  depobject.objectId = RelationGetRelid(seqrel);
1738  depobject.objectSubId = 0;
1739  recordDependencyOn(&depobject, &refobject, deptype);
1740  }
1741 
1742  /* Done, but hold lock until commit */
1743  if (tablerel)
1744  relation_close(tablerel, NoLock);
1745 }
1746 
1747 
1748 /*
1749  * Return sequence parameters in a list of the form created by the parser.
1750  */
1751 List *
1753 {
1754  HeapTuple pgstuple;
1755  Form_pg_sequence pgsform;
1756  List *options = NIL;
1757 
1758  pgstuple = SearchSysCache1(SEQRELID, relid);
1759  if (!HeapTupleIsValid(pgstuple))
1760  elog(ERROR, "cache lookup failed for sequence %u", relid);
1761  pgsform = (Form_pg_sequence) GETSTRUCT(pgstuple);
1762 
1763  options = lappend(options, makeDefElem("cache", (Node *) makeInteger(pgsform->seqcache), -1));
1764  options = lappend(options, makeDefElem("cycle", (Node *) makeInteger(pgsform->seqcycle), -1));
1765  options = lappend(options, makeDefElem("increment", (Node *) makeInteger(pgsform->seqincrement), -1));
1766  options = lappend(options, makeDefElem("maxvalue", (Node *) makeInteger(pgsform->seqmax), -1));
1767  options = lappend(options, makeDefElem("minvalue", (Node *) makeInteger(pgsform->seqmin), -1));
1768  options = lappend(options, makeDefElem("start", (Node *) makeInteger(pgsform->seqstart), -1));
1769 
1770  ReleaseSysCache(pgstuple);
1771 
1772  return options;
1773 }
1774 
1775 /*
1776  * Return sequence parameters (formerly for use by information schema)
1777  */
1778 Datum
1780 {
1781  Oid relid = PG_GETARG_OID(0);
1782  TupleDesc tupdesc;
1783  Datum values[7];
1784  bool isnull[7];
1785  HeapTuple pgstuple;
1786  Form_pg_sequence pgsform;
1787 
1789  ereport(ERROR,
1790  (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
1791  errmsg("permission denied for sequence %s",
1792  get_rel_name(relid))));
1793 
1794  tupdesc = CreateTemplateTupleDesc(7, false);
1795  TupleDescInitEntry(tupdesc, (AttrNumber) 1, "start_value",
1796  INT8OID, -1, 0);
1797  TupleDescInitEntry(tupdesc, (AttrNumber) 2, "minimum_value",
1798  INT8OID, -1, 0);
1799  TupleDescInitEntry(tupdesc, (AttrNumber) 3, "maximum_value",
1800  INT8OID, -1, 0);
1801  TupleDescInitEntry(tupdesc, (AttrNumber) 4, "increment",
1802  INT8OID, -1, 0);
1803  TupleDescInitEntry(tupdesc, (AttrNumber) 5, "cycle_option",
1804  BOOLOID, -1, 0);
1805  TupleDescInitEntry(tupdesc, (AttrNumber) 6, "cache_size",
1806  INT8OID, -1, 0);
1807  TupleDescInitEntry(tupdesc, (AttrNumber) 7, "data_type",
1808  OIDOID, -1, 0);
1809 
1810  BlessTupleDesc(tupdesc);
1811 
1812  memset(isnull, 0, sizeof(isnull));
1813 
1814  pgstuple = SearchSysCache1(SEQRELID, relid);
1815  if (!HeapTupleIsValid(pgstuple))
1816  elog(ERROR, "cache lookup failed for sequence %u", relid);
1817  pgsform = (Form_pg_sequence) GETSTRUCT(pgstuple);
1818 
1819  values[0] = Int64GetDatum(pgsform->seqstart);
1820  values[1] = Int64GetDatum(pgsform->seqmin);
1821  values[2] = Int64GetDatum(pgsform->seqmax);
1822  values[3] = Int64GetDatum(pgsform->seqincrement);
1823  values[4] = BoolGetDatum(pgsform->seqcycle);
1824  values[5] = Int64GetDatum(pgsform->seqcache);
1825  values[6] = ObjectIdGetDatum(pgsform->seqtypid);
1826 
1827  ReleaseSysCache(pgstuple);
1828 
1829  return HeapTupleGetDatum(heap_form_tuple(tupdesc, values, isnull));
1830 }
1831 
1832 /*
1833  * Return the last value from the sequence
1834  *
1835  * Note: This has a completely different meaning than lastval().
1836  */
1837 Datum
1839 {
1840  Oid relid = PG_GETARG_OID(0);
1841  SeqTable elm;
1842  Relation seqrel;
1843  Buffer buf;
1844  HeapTupleData seqtuple;
1846  bool is_called;
1847  int64 result;
1848 
1849  /* open and lock sequence */
1850  init_sequence(relid, &elm, &seqrel);
1851 
1853  ereport(ERROR,
1854  (errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
1855  errmsg("permission denied for sequence %s",
1856  RelationGetRelationName(seqrel))));
1857 
1858  seq = read_seq_tuple(seqrel, &buf, &seqtuple);
1859 
1860  is_called = seq->is_called;
1861  result = seq->last_value;
1862 
1863  UnlockReleaseBuffer(buf);
1864  relation_close(seqrel, NoLock);
1865 
1866  if (is_called)
1867  PG_RETURN_INT64(result);
1868  else
1869  PG_RETURN_NULL();
1870 }
1871 
1872 
1873 void
1875 {
1876  XLogRecPtr lsn = record->EndRecPtr;
1877  uint8 info = XLogRecGetInfo(record) & ~XLR_INFO_MASK;
1878  Buffer buffer;
1879  Page page;
1880  Page localpage;
1881  char *item;
1882  Size itemsz;
1883  xl_seq_rec *xlrec = (xl_seq_rec *) XLogRecGetData(record);
1884  sequence_magic *sm;
1885 
1886  if (info != XLOG_SEQ_LOG)
1887  elog(PANIC, "seq_redo: unknown op code %u", info);
1888 
1889  buffer = XLogInitBufferForRedo(record, 0);
1890  page = (Page) BufferGetPage(buffer);
1891 
1892  /*
1893  * We always reinit the page. However, since this WAL record type is also
1894  * used for updating sequences, it's possible that a hot-standby backend
1895  * is examining the page concurrently; so we mustn't transiently trash the
1896  * buffer. The solution is to build the correct new page contents in
1897  * local workspace and then memcpy into the buffer. Then only bytes that
1898  * are supposed to change will change, even transiently. We must palloc
1899  * the local page for alignment reasons.
1900  */
1901  localpage = (Page) palloc(BufferGetPageSize(buffer));
1902 
1903  PageInit(localpage, BufferGetPageSize(buffer), sizeof(sequence_magic));
1904  sm = (sequence_magic *) PageGetSpecialPointer(localpage);
1905  sm->magic = SEQ_MAGIC;
1906 
1907  item = (char *) xlrec + sizeof(xl_seq_rec);
1908  itemsz = XLogRecGetDataLen(record) - sizeof(xl_seq_rec);
1909 
1910  if (PageAddItem(localpage, (Item) item, itemsz,
1911  FirstOffsetNumber, false, false) == InvalidOffsetNumber)
1912  elog(PANIC, "seq_redo: failed to add item to page");
1913 
1914  PageSetLSN(localpage, lsn);
1915 
1916  memcpy(page, localpage, BufferGetPageSize(buffer));
1917  MarkBufferDirty(buffer);
1918  UnlockReleaseBuffer(buffer);
1919 
1920  pfree(localpage);
1921 }
1922 
1923 /*
1924  * Flush cached sequence information.
1925  */
1926 void
1928 {
1929  if (seqhashtab)
1930  {
1931  hash_destroy(seqhashtab);
1932  seqhashtab = NULL;
1933  }
1934 
1935  last_used_seq = NULL;
1936 }
1937 
1938 /*
1939  * Mask a Sequence page before performing consistency checks on it.
1940  */
1941 void
1942 seq_mask(char *page, BlockNumber blkno)
1943 {
1944  mask_page_lsn(page);
1945 
1946  mask_unused_space(page);
1947 }
RangeVar * relation
Definition: parsenodes.h:1987
ObjectAddress AlterSequence(ParseState *pstate, AlterSeqStmt *stmt)
Definition: sequence.c:416
HeapTuple heap_copytuple(HeapTuple tuple)
Definition: heaptuple.c:608
#define NIL
Definition: pg_list.h:69
DependencyType
Definition: dependency.h:73
OnCommitAction oncommit
Definition: parsenodes.h:1996
int64 cached
Definition: sequence.c:79
Relation relation_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition: heapam.c:1192
List * inhRelations
Definition: parsenodes.h:1989
void hash_destroy(HTAB *hashp)
Definition: dynahash.c:793
void RelationSetNewRelfilenode(Relation relation, char persistence, TransactionId freezeXid, MultiXactId minmulti)
Definition: relcache.c:3416
Datum currval_oid(PG_FUNCTION_ARGS)
Definition: sequence.c:820
int errhint(const char *fmt,...)
Definition: elog.c:987
#define PG_INT64_MAX
Definition: c.h:343
#define GETSTRUCT(TUP)
Definition: htup_details.h:656
static int32 next
Definition: blutils.c:210
bool sequenceIsOwned(Oid seqId, char deptype, Oid *tableId, int32 *colId)
Definition: pg_depend.c:500
void PreventCommandIfParallelMode(const char *cmdname)
Definition: utility.c:254
char storage
Definition: parsenodes.h:646
#define RELPERSISTENCE_UNLOGGED
Definition: pg_class.h:171
#define HASH_ELEM
Definition: hsearch.h:87
#define SEQ_MAGIC
Definition: sequence.c:59
bool is_local
Definition: parsenodes.h:642
void MarkBufferDirtyHint(Buffer buffer, bool buffer_std)
Definition: bufmgr.c:3379
#define RelationGetDescr(relation)
Definition: rel.h:428
Oid GetUserId(void)
Definition: miscinit.c:283
Oid RangeVarGetRelidExtended(const RangeVar *relation, LOCKMODE lockmode, bool missing_ok, bool nowait, RangeVarGetRelidCallback callback, void *callback_arg)
Definition: namespace.c:218
struct xl_seq_rec xl_seq_rec
ResourceOwner TopTransactionResourceOwner
Definition: resowner.c:140
#define OIDOID
Definition: pg_type.h:328
#define PG_RETURN_INT64(x)
Definition: fmgr.h:327
void MarkBufferDirty(Buffer buffer)
Definition: bufmgr.c:1450
PGPROC * MyProc
Definition: proc.c:67
bool last_valid
Definition: sequence.c:77
void XLogRegisterBuffer(uint8 block_id, Buffer buffer, uint8 flags)
Definition: xloginsert.c:213
HeapTupleHeaderData * HeapTupleHeader
Definition: htup.h:23
#define RangeVarGetRelid(relation, lockmode, missing_ok)
Definition: namespace.h:53
List * constraints
Definition: parsenodes.h:652
ResourceOwner CurrentResourceOwner
Definition: resowner.c:138
static void check_permissions(void)
Definition: logicalfuncs.c:109
#define RelationRelationId
Definition: pg_class.h:29
int64 nextval_internal(Oid relid, bool check_permissions)
Definition: sequence.c:569
bool if_not_exists
Definition: parsenodes.h:2458
bool is_from_parent
Definition: parsenodes.h:645
bool rd_islocaltemp
Definition: rel.h:90
Datum nextval(PG_FUNCTION_ARGS)
Definition: sequence.c:539
#define END_CRIT_SECTION()
Definition: miscadmin.h:135
unsigned char uint8
Definition: c.h:266
List * list_truncate(List *list, int new_size)
Definition: list.c:350
Pointer Item
Definition: item.h:17
#define AccessShareLock
Definition: lockdefs.h:36
#define INT4OID
Definition: pg_type.h:316
Size entrysize
Definition: hsearch.h:73
List * list_copy(const List *oldlist)
Definition: list.c:1160
#define REGBUF_WILL_INIT
Definition: xloginsert.h:32
Definition: nodes.h:509
#define strVal(v)
Definition: value.h:54
#define START_CRIT_SECTION()
Definition: miscadmin.h:133
#define Anum_pg_sequence_seqcache
Definition: pg_sequence.h:29
int errcode(int sqlerrcode)
Definition: elog.c:575
void seq_redo(XLogReaderState *record)
Definition: sequence.c:1874
void relation_close(Relation relation, LOCKMODE lockmode)
Definition: heapam.c:1260
#define PageAddItem(page, item, size, offsetNumber, overwrite, is_heap)
Definition: bufpage.h:412
#define SequenceRelationId
Definition: pg_sequence.h:6
char * format_type_be(Oid type_oid)
Definition: format_type.c:94
#define SEQ_COL_FIRSTCOL
Definition: sequence.h:42
return result
Definition: formatting.c:1632
int64 defGetInt64(DefElem *def)
Definition: define.c:190
int snprintf(char *str, size_t count, const char *fmt,...) pg_attribute_printf(3
uint32 BlockNumber
Definition: block.h:31
void CatalogTupleDelete(Relation heapRel, ItemPointer tid)
Definition: indexing.c:255
FormData_pg_sequence * Form_pg_sequence
Definition: pg_sequence.h:20
struct SeqTableData SeqTableData
void recordDependencyOn(const ObjectAddress *depender, const ObjectAddress *referenced, DependencyType behavior)
Definition: pg_depend.c:44
RangeVar * makeRangeVarFromNameList(List *names)
Definition: namespace.c:2980
#define P_NEW
Definition: bufmgr.h:82
#define HEAP_XMAX_COMMITTED
Definition: htup_details.h:192
HeapTuple heap_form_tuple(TupleDesc tupleDescriptor, Datum *values, bool *isnull)
Definition: heaptuple.c:692
#define heap_close(r, l)
Definition: heapam.h:97
TransactionId GetTopTransactionId(void)
Definition: xact.c:389
#define PG_GETARG_BOOL(n)
Definition: fmgr.h:239
bool is_not_null
Definition: parsenodes.h:643
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:885
RelFileNode node
Definition: sequence.h:50
#define BUFFER_LOCK_EXCLUSIVE
Definition: bufmgr.h:89
Form_pg_class rd_rel
Definition: rel.h:114
void heap_freetuple(HeapTuple htup)
Definition: heaptuple.c:1372
unsigned int Oid
Definition: postgres_ext.h:31
#define OidIsValid(objectId)
Definition: c.h:538
#define PANIC
Definition: elog.h:53
DefElem * makeDefElem(char *name, Node *arg, int location)
Definition: makefuncs.c:544
#define Anum_pg_sequence_seqtypid
Definition: pg_sequence.h:24
#define SearchSysCache1(cacheId, key1)
Definition: syscache.h:156
List * options
Definition: parsenodes.h:2465
void mask_unused_space(Page page)
Definition: bufmask.c:69
signed int int32
Definition: c.h:256
#define FirstCommandId
Definition: c.h:413
XLogRecPtr EndRecPtr
Definition: xlogreader.h:115
#define PG_GETARG_TEXT_PP(n)
Definition: fmgr.h:273
uint16 OffsetNumber
Definition: off.h:24
HeapTupleHeader t_data
Definition: htup.h:67
List * constraints
Definition: parsenodes.h:1994
bool if_not_exists
Definition: parsenodes.h:1998
Node * cooked_default
Definition: parsenodes.h:648
char * relname
Definition: primnodes.h:68
Value * makeInteger(long i)
Definition: value.c:23
Definition: dynahash.c:193
static ListCell * list_tail(List *l)
Definition: pg_list.h:83
static HTAB * seqhashtab
Definition: sequence.c:87
TypeName * defGetTypeName(DefElem *def)
Definition: define.c:255
#define SearchSysCacheExists1(cacheId, key1)
Definition: syscache.h:174
#define HeapTupleHeaderGetRawXmax(tup)
Definition: htup_details.h:369
void pfree(void *pointer)
Definition: mcxt.c:950
#define ItemIdGetLength(itemId)
Definition: itemid.h:58
Datum nextval_oid(PG_FUNCTION_ARGS)
Definition: sequence.c:561
#define XLogRecGetData(decoder)
Definition: xlogreader.h:220
#define linitial(l)
Definition: pg_list.h:111
void UnlockReleaseBuffer(Buffer buffer)
Definition: bufmgr.c:3332
void RangeVarCallbackOwnsRelation(const RangeVar *relation, Oid relId, Oid oldRelId, void *arg)
Definition: tablecmds.c:12971
#define SEQ_COL_LASTVAL
Definition: sequence.h:38
FormData_pg_sequence
Definition: pg_sequence.h:18
#define ObjectIdGetDatum(X)
Definition: postgres.h:513
#define ERROR
Definition: elog.h:43
static void create_seq_hashtable(void)
Definition: sequence.c:1084
#define XLogRecGetDataLen(decoder)
Definition: xlogreader.h:221
Oid CatalogTupleInsert(Relation heapRel, HeapTuple tup)
Definition: indexing.c:162
void mask_page_lsn(Page page)
Definition: bufmask.c:30
#define HEAP_XMAX_INVALID
Definition: htup_details.h:193
Buffer XLogInitBufferForRedo(XLogReaderState *record, uint8 block_id)
Definition: xlogutils.c:302
Datum pg_sequence_parameters(PG_FUNCTION_ARGS)
Definition: sequence.c:1779
ItemPointerData t_ctid
Definition: htup_details.h:150
#define Natts_pg_sequence
Definition: pg_sequence.h:22
static struct @121 value
ItemPointerData t_self
Definition: htup.h:65
TupleDesc BlessTupleDesc(TupleDesc tupdesc)
Definition: execTuples.c:1031
#define INT2OID
Definition: pg_type.h:308
uint32 t_len
Definition: htup.h:64
#define NoLock
Definition: lockdefs.h:34
static char * buf
Definition: pg_test_fsync.c:66
#define PG_INT64_MIN
Definition: c.h:342
#define PG_GETARG_OID(n)
Definition: fmgr.h:240
AttrNumber get_attnum(Oid relid, const char *attname)
Definition: lsyscache.c:821
Oid collOid
Definition: parsenodes.h:651
int location
Definition: parsenodes.h:722
#define FirstOffsetNumber
Definition: off.h:27
#define RowExclusiveLock
Definition: lockdefs.h:38
int errdetail(const char *fmt,...)
Definition: elog.c:873
static void do_setval(Oid relid, int64 next, bool iscalled)
Definition: sequence.c:899
#define HeapTupleHeaderSetXmax(tup, xid)
Definition: htup_details.h:374
#define InvalidTransactionId
Definition: transam.h:31
#define RelationGetRelationName(relation)
Definition: rel.h:436
List * options
Definition: parsenodes.h:1995
static void process_owned_by(Relation seqrel, List *owned_by, bool for_identity)
Definition: sequence.c:1639
unsigned int uint32
Definition: c.h:268
int64 last
Definition: sequence.c:78
#define ACL_USAGE
Definition: parsenodes.h:80
#define RELKIND_FOREIGN_TABLE
Definition: pg_class.h:167
int location
Definition: parsenodes.h:654
uint32 LocalTransactionId
Definition: c.h:399
void DeleteSequenceTuple(Oid relid)
Definition: sequence.c:516
Datum Int64GetDatum(int64 X)
Definition: fmgr.c:1791
void TupleDescInitEntry(TupleDesc desc, AttrNumber attributeNumber, const char *attributeName, Oid oidtypeid, int32 typmod, int attdim)
Definition: tupdesc.c:497
#define PG_INT16_MIN
Definition: c.h:336
#define BufferGetPage(buffer)
Definition: bufmgr.h:160
#define PG_INT32_MIN
Definition: c.h:339
ObjectAddress DefineSequence(ParseState *pstate, CreateSeqStmt *seq)
Definition: sequence.c:116
ObjectAddress DefineRelation(CreateStmt *stmt, char relkind, Oid ownerId, ObjectAddress *typaddress, const char *queryString)
Definition: tablecmds.c:498
#define ereport(elevel, rest)
Definition: elog.h:122
#define InvokeObjectPostAlterHook(classId, objectId, subId)
Definition: objectaccess.h:163
#define XLogRecGetInfo(decoder)
Definition: xlogreader.h:216
#define SEQ_COL_LOG
Definition: sequence.h:39
static Form_pg_sequence_data read_seq_tuple(Relation rel, Buffer *buf, HeapTuple seqdatatuple)
Definition: sequence.c:1168
List * textToQualifiedNameList(text *textval)
Definition: varlena.c:3190
Node * arg
Definition: parsenodes.h:720
Node * raw_default
Definition: parsenodes.h:647
List * lappend(List *list, void *datum)
Definition: list.c:128
char * tablespacename
Definition: parsenodes.h:1997
static char ** options
#define PageGetItemId(page, offsetNumber)
Definition: bufpage.h:231
void XLogRegisterData(char *data, int len)
Definition: xloginsert.c:323
XLogRecPtr XLogInsert(RmgrId rmid, uint8 info)
Definition: xloginsert.c:415
Oid RangeVarGetAndCheckCreationNamespace(RangeVar *relation, LOCKMODE lockmode, Oid *existing_relation_id)
Definition: namespace.c:508
#define HASH_BLOBS
Definition: hsearch.h:88
#define ACL_UPDATE
Definition: parsenodes.h:74
#define RELKIND_PARTITIONED_TABLE
Definition: pg_class.h:168
SeqTableData * SeqTable
Definition: sequence.c:85
HTAB * hash_create(const char *tabname, long nelem, HASHCTL *info, int flags)
Definition: dynahash.c:301
uintptr_t Datum
Definition: postgres.h:372
#define Anum_pg_sequence_seqmin
Definition: pg_sequence.h:28
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1117
#define ACL_SELECT
Definition: parsenodes.h:73
#define BufferGetPageSize(buffer)
Definition: bufmgr.h:147
#define Anum_pg_sequence_seqcycle
Definition: pg_sequence.h:30
Oid filenode
Definition: sequence.c:75
void LockBuffer(Buffer buffer, int mode)
Definition: bufmgr.c:3546
Relation heap_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1284
#define Int64GetDatumFast(X)
Definition: postgres.h:781
Size keysize
Definition: hsearch.h:72
#define InvalidMultiXactId
Definition: multixact.h:23
long deleteDependencyRecordsForClass(Oid classId, Oid objectId, Oid refclassId, char deptype)
Definition: pg_depend.c:241
#define HEAP_XMAX_IS_MULTI
Definition: htup_details.h:194
void seq_mask(char *page, BlockNumber blkno)
Definition: sequence.c:1942
#define BoolGetDatum(X)
Definition: postgres.h:408
#define InvalidOffsetNumber
Definition: off.h:26
TypeName * makeTypeNameFromOid(Oid typeOid, int32 typmod)
Definition: makefuncs.c:469
#define InvalidOid
Definition: postgres_ext.h:36
RangeVar * sequence
Definition: parsenodes.h:2464
void ResetSequenceCaches(void)
Definition: sequence.c:1927
RangeVar * sequence
Definition: parsenodes.h:2454
bool is_from_type
Definition: parsenodes.h:644
#define NOTICE
Definition: elog.h:37
#define INT8OID
Definition: pg_type.h:304
List * tableElts
Definition: parsenodes.h:1988
struct sequence_magic sequence_magic
RelFileNode rd_node
Definition: rel.h:85
#define PG_CATCH()
Definition: elog.h:293
#define makeNode(_type_)
Definition: nodes.h:557
#define HeapTupleIsValid(tuple)
Definition: htup.h:77
#define NULL
Definition: c.h:229
uint64 XLogRecPtr
Definition: xlogdefs.h:21
#define Assert(condition)
Definition: c.h:675
#define XLR_INFO_MASK
Definition: xlogrecord.h:62
#define SEQ_LOG_VALS
Definition: sequence.c:54
#define lfirst(lc)
Definition: pg_list.h:106
int64 increment
Definition: sequence.c:81
#define ShareRowExclusiveLock
Definition: lockdefs.h:42
#define FrozenTransactionId
Definition: transam.h:33
#define ItemIdIsNormal(itemId)
Definition: itemid.h:98
List * defGetQualifiedName(DefElem *def)
Definition: define.c:223
WalTimeSample buffer[LAG_TRACKER_BUFFER_SIZE]
Definition: walsender.c:214
Buffer ReadBuffer(Relation reln, BlockNumber blockNum)
Definition: bufmgr.c:594
uint32 magic
Definition: sequence.c:63
size_t Size
Definition: c.h:356
#define PageGetSpecialPointer(page)
Definition: bufpage.h:322
void CatalogTupleUpdate(Relation heapRel, ItemPointer otid, HeapTuple tup)
Definition: indexing.c:210
static int list_length(const List *l)
Definition: pg_list.h:89
int parser_errposition(ParseState *pstate, int location)
Definition: parse_node.c:111
Datum lastval(PG_FUNCTION_ARGS)
Definition: sequence.c:851
TypeName * typeName
Definition: parsenodes.h:640
XLogRecPtr GetRedoRecPtr(void)
Definition: xlog.c:8162
CollateClause * collClause
Definition: parsenodes.h:650
#define PG_INT16_MAX
Definition: c.h:337
#define Anum_pg_sequence_seqstart
Definition: pg_sequence.h:25
#define PG_RE_THROW()
Definition: elog.h:314
#define HeapTupleGetDatum(tuple)
Definition: funcapi.h:222
#define BOOLOID
Definition: pg_type.h:288
#define RelationNeedsWAL(relation)
Definition: rel.h:505
TupleDesc CreateTemplateTupleDesc(int natts, bool hasoid)
Definition: tupdesc.c:41
LocalTransactionId lxid
Definition: sequence.c:76
#define INT64_FORMAT
Definition: c.h:315
void PreventCommandIfReadOnly(const char *cmdname)
Definition: utility.c:236
#define InvalidAttrNumber
Definition: attnum.h:23
#define ObjectAddressSet(addr, class_id, object_id)
Definition: objectaddress.h:40
static SeqTableData * last_used_seq
Definition: sequence.c:93
AclResult pg_class_aclcheck(Oid table_oid, Oid roleid, AclMode mode)
Definition: aclchk.c:4422
char relpersistence
Definition: primnodes.h:71
#define PageGetLSN(page)
Definition: bufpage.h:362
static Datum values[MAXATTR]
Definition: bootstrap.c:163
#define SEQ_COL_LASTCOL
Definition: sequence.h:43
#define SearchSysCacheCopy1(cacheId, key1)
Definition: syscache.h:165
#define AccessExclusiveLock
Definition: lockdefs.h:45
Datum setval3_oid(PG_FUNCTION_ARGS)
Definition: sequence.c:1027
static void init_params(ParseState *pstate, List *options, bool for_identity, bool isInit, Form_pg_sequence seqform, Form_pg_sequence_data seqdataform, bool *need_seq_rewrite, List **owned_by)
Definition: sequence.c:1234
BlockNumber BufferGetBlockNumber(Buffer buffer)
Definition: bufmgr.c:2605
static void init_sequence(Oid relid, SeqTable *p_elm, Relation *p_rel)
Definition: sequence.c:1101
#define intVal(v)
Definition: value.h:52
const ObjectAddress InvalidObjectAddress
void * palloc(Size size)
Definition: mcxt.c:849
int errmsg(const char *fmt,...)
Definition: elog.c:797
#define SEQ_COL_CALLED
Definition: sequence.h:40
#define Anum_pg_sequence_seqrelid
Definition: pg_sequence.h:23
Datum setval_oid(PG_FUNCTION_ARGS)
Definition: sequence.c:1012
#define PG_INT32_MAX
Definition: c.h:340
#define RELKIND_VIEW
Definition: pg_class.h:164
#define InvalidLocalTransactionId
Definition: lock.h:69
int i
int inhcount
Definition: parsenodes.h:641
#define HeapTupleHeaderSetXminFrozen(tup)
Definition: htup_details.h:346
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition: heapam.c:1114
bool for_identity
Definition: parsenodes.h:2466
Definition: c.h:439
#define PG_FUNCTION_ARGS
Definition: fmgr.h:158
char * defname
Definition: parsenodes.h:719
char * colname
Definition: parsenodes.h:639
#define Anum_pg_sequence_seqincrement
Definition: pg_sequence.h:26
#define elog
Definition: elog.h:219
#define Anum_pg_sequence_seqmax
Definition: pg_sequence.h:27
static Relation lock_and_open_sequence(SeqTable seq)
Definition: sequence.c:1048
void ResetSequence(Oid seq_relid)
Definition: sequence.c:269
void LockRelationOid(Oid relid, LOCKMODE lockmode)
Definition: lmgr.c:105
#define XLOG_SEQ_LOG
Definition: sequence.h:46
#define PG_TRY()
Definition: elog.h:284
#define RELKIND_RELATION
Definition: pg_class.h:160
void XLogBeginInsert(void)
Definition: xloginsert.c:120
#define PG_GETARG_INT64(n)
Definition: fmgr.h:247
List * sequence_options(Oid relid)
Definition: sequence.c:1752
#define RELKIND_SEQUENCE
Definition: pg_class.h:162
#define PageSetLSN(page, lsn)
Definition: bufpage.h:364
Definition: pg_list.h:45
char * get_rel_name(Oid relid)
Definition: lsyscache.c:1726
int Buffer
Definition: buf.h:23
static void fill_seq_with_data(Relation rel, HeapTuple tuple)
Definition: sequence.c:337
int16 AttrNumber
Definition: attnum.h:21
Datum pg_sequence_last_value(PG_FUNCTION_ARGS)
Definition: sequence.c:1838
#define RelationGetRelid(relation)
Definition: rel.h:416
#define PG_RETURN_NULL()
Definition: fmgr.h:305
#define PG_END_TRY()
Definition: elog.h:300
#define HeapTupleHeaderSetCmin(tup, cid)
Definition: htup_details.h:391
#define BoolIsValid(boolean)
Definition: c.h:520
#define PageGetItem(page, itemId)
Definition: bufpage.h:336
FormData_pg_sequence_data * Form_pg_sequence_data
Definition: sequence.h:32
Pointer Page
Definition: bufpage.h:74
List * options
Definition: parsenodes.h:2455
#define ItemPointerSet(pointer, blockNumber, offNum)
Definition: itemptr.h:105
Oid typenameTypeId(ParseState *pstate, const TypeName *typeName)
Definition: parse_type.c:274
LocalTransactionId lxid
Definition: proc.h:105
#define RelationGetNamespace(relation)
Definition: rel.h:443
void PageInit(Page page, Size pageSize, Size specialSize)
Definition: bufpage.c:41
#define HeapTupleHeaderSetXmin(tup, xid)
Definition: htup_details.h:313