sequence.c 13.7 KB
Newer Older
1 2 3
/*-------------------------------------------------------------------------
 *
 * sequence.c--
4
 *	  PostgreSQL sequences support code.
5 6 7 8 9 10 11
 *
 *-------------------------------------------------------------------------
 */
#include <stdio.h>
#include <string.h>

#include <postgres.h>
M
 
Marc G. Fournier 已提交
12
#include <miscadmin.h>
13 14 15 16 17 18 19 20 21

#include <storage/bufmgr.h>
#include <storage/bufpage.h>
#include <storage/lmgr.h>
#include <access/heapam.h>
#include <nodes/parsenodes.h>
#include <commands/creatinh.h>
#include <commands/sequence.h>
#include <utils/builtins.h>
M
 
Marc G. Fournier 已提交
22
#include <utils/acl.h>
23

24
#define SEQ_MAGIC	  0x1717
25 26 27 28

#define SEQ_MAXVALUE	((int4)0x7FFFFFFF)
#define SEQ_MINVALUE	-(SEQ_MAXVALUE)

29 30
typedef struct FormData_pg_sequence
{
31 32 33 34 35 36 37 38
	NameData	sequence_name;
	int4		last_value;
	int4		increment_by;
	int4		max_value;
	int4		min_value;
	int4		cache_value;
	char		is_cycled;
	char		is_called;
39
} FormData_pg_sequence;
40

41
typedef FormData_pg_sequence *Form_pg_sequence;
42 43 44

typedef struct sequence_magic
{
45
	uint32		magic;
46
} sequence_magic;
47

48 49
typedef struct SeqTableData
{
50 51 52 53 54 55
	char	   *name;
	Oid			relid;
	Relation	rel;
	int4		cached;
	int4		last;
	int4		increment;
56
	struct SeqTableData *next;
57
} SeqTableData;
58 59 60 61 62

typedef SeqTableData *SeqTable;

static SeqTable seqtab = NULL;

63
static SeqTable init_sequence(char *caller, char *name);
64 65
static Form_pg_sequence read_info(char *caller, SeqTable elm, Buffer *buf);
static void init_params(CreateSeqStmt *seq, Form_pg_sequence new);
66
static int	get_param(DefElem *def);
67 68 69

/*
 * DefineSequence --
70
 *				Creates a new sequence relation
71 72
 */
void
73
DefineSequence(CreateSeqStmt *seq)
74
{
75
	FormData_pg_sequence new;
76 77 78 79 80 81
	CreateStmt *stmt = makeNode(CreateStmt);
	ColumnDef  *coldef;
	TypeName   *typnam;
	Relation	rel;
	Buffer		buf;
	PageHeader	page;
82
	sequence_magic *sm;
83 84 85 86 87
	HeapTuple	tuple;
	TupleDesc	tupDesc;
	Datum		value[SEQ_COL_LASTCOL];
	char		null[SEQ_COL_LASTCOL];
	int			i;
88
	NameData	name;
89 90 91 92 93

	/* Check and set values */
	init_params(seq, &new);

	/*
94
	 * Create relation (and fill *null & *value)
95 96 97
	 */
	stmt->tableElts = NIL;
	for (i = SEQ_COL_FIRSTCOL; i <= SEQ_COL_LASTCOL; i++)
98
	{
99 100 101
		typnam = makeNode(TypeName);
		typnam->setof = FALSE;
		typnam->arrayBounds = NULL;
B
Bruce Momjian 已提交
102
		typnam->typmod = -1;
103 104 105 106 107 108 109 110
		coldef = makeNode(ColumnDef);
		coldef->typename = typnam;
		coldef->defval = NULL;
		coldef->is_not_null = false;
		null[i - 1] = ' ';

		switch (i)
		{
111 112 113
			case SEQ_COL_NAME:
				typnam->name = "name";
				coldef->colname = "sequence_name";
114 115
				namestrcpy(&name, seq->seqname);
				value[i - 1] = NameGetDatum(&name);
116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151
				break;
			case SEQ_COL_LASTVAL:
				typnam->name = "int4";
				coldef->colname = "last_value";
				value[i - 1] = Int32GetDatum(new.last_value);
				break;
			case SEQ_COL_INCBY:
				typnam->name = "int4";
				coldef->colname = "increment_by";
				value[i - 1] = Int32GetDatum(new.increment_by);
				break;
			case SEQ_COL_MAXVALUE:
				typnam->name = "int4";
				coldef->colname = "max_value";
				value[i - 1] = Int32GetDatum(new.max_value);
				break;
			case SEQ_COL_MINVALUE:
				typnam->name = "int4";
				coldef->colname = "min_value";
				value[i - 1] = Int32GetDatum(new.min_value);
				break;
			case SEQ_COL_CACHE:
				typnam->name = "int4";
				coldef->colname = "cache_value";
				value[i - 1] = Int32GetDatum(new.cache_value);
				break;
			case SEQ_COL_CYCLE:
				typnam->name = "char";
				coldef->colname = "is_cycled";
				value[i - 1] = CharGetDatum(new.is_cycled);
				break;
			case SEQ_COL_CALLED:
				typnam->name = "char";
				coldef->colname = "is_called";
				value[i - 1] = CharGetDatum('f');
				break;
152 153 154 155 156 157 158 159
		}
		stmt->tableElts = lappend(stmt->tableElts, coldef);
	}

	stmt->relname = seq->seqname;
	stmt->inhRelnames = NIL;
	stmt->constraints = NIL;

160
	DefineRelation(stmt, RELKIND_SEQUENCE);
161 162 163 164 165 166

	rel = heap_openr(seq->seqname);
	Assert(RelationIsValid(rel));

	RelationSetLockForWrite(rel);

167
	tupDesc = RelationGetDescr(rel);
168 169 170 171 172

	Assert(RelationGetNumberOfBlocks(rel) == 0);
	buf = ReadBuffer(rel, P_NEW);

	if (!BufferIsValid(buf))
173
		elog(ERROR, "DefineSequence: ReadBuffer failed");
174 175 176 177 178 179 180 181 182 183 184 185

	page = (PageHeader) BufferGetPage(buf);

	PageInit((Page) page, BufferGetPageSize(buf), sizeof(sequence_magic));
	sm = (sequence_magic *) PageGetSpecialPointer(page);
	sm->magic = SEQ_MAGIC;

	/* Now - form & insert sequence tuple */
	tuple = heap_formtuple(tupDesc, value, null);
	heap_insert(rel, tuple);

	if (WriteBuffer(buf) == STATUS_ERROR)
186
		elog(ERROR, "DefineSequence: WriteBuffer failed");
187 188 189 190 191

	RelationUnsetLockForWrite(rel);
	heap_close(rel);

	return;
192 193 194 195 196

}


int4
197
nextval(struct varlena * seqin)
198
{
199 200 201
	char	   *seqname = textout(seqin);
	SeqTable	elm;
	Buffer		buf;
202
	Form_pg_sequence seq;
203
	ItemPointerData iptr;
204 205 206 207 208 209 210
	int4		incby,
				maxv,
				minv,
				cache;
	int4		result,
				next,
				rescnt = 0;
211 212 213 214 215 216 217 218

	/* open and WIntentLock sequence */
	elm = init_sequence("nextval", seqname);
	pfree(seqname);

	if (elm->last != elm->cached)		/* some numbers were cached */
	{
		elm->last += elm->increment;
219
		return elm->last;
220
	}
221 222 223 224 225 226 227 228 229 230 231 232 233 234

	seq = read_info("nextval", elm, &buf);		/* lock page and read
												 * tuple */

	next = result = seq->last_value;
	incby = seq->increment_by;
	maxv = seq->max_value;
	minv = seq->min_value;
	cache = seq->cache_value;

	if (seq->is_called != 't')
		rescnt++;				/* last_value if not called */

	while (rescnt < cache)		/* try to fetch cache numbers */
235
	{
236 237 238 239 240 241 242 243 244 245 246 247 248

		/*
		 * Check MAXVALUE for ascending sequences and MINVALUE for
		 * descending sequences
		 */
		if (incby > 0)			/* ascending sequence */
		{
			if ((maxv >= 0 && next > maxv - incby) ||
				(maxv < 0 && next + incby > maxv))
			{
				if (rescnt > 0)
					break;		/* stop caching */
				if (seq->is_cycled != 't')
249
					elog(ERROR, "%s.nextval: got MAXVALUE (%d)",
250 251 252 253 254 255 256 257 258 259 260 261 262 263 264
						 elm->name, maxv);
				next = minv;
			}
			else
				next += incby;
		}
		else
/* descending sequence */
		{
			if ((minv < 0 && next < minv - incby) ||
				(minv >= 0 && next + incby < minv))
			{
				if (rescnt > 0)
					break;		/* stop caching */
				if (seq->is_cycled != 't')
265
					elog(ERROR, "%s.nextval: got MINVALUE (%d)",
266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285
						 elm->name, minv);
				next = maxv;
			}
			else
				next += incby;
		}
		rescnt++;				/* got result */
		if (rescnt == 1)		/* if it's first one - */
			result = next;		/* it's what to return */
	}

	/* save info in local cache */
	elm->last = result;			/* last returned number */
	elm->cached = next;			/* last cached number */

	/* save info in sequence relation */
	seq->last_value = next;		/* last fetched number */
	seq->is_called = 't';

	if (WriteBuffer(buf) == STATUS_ERROR)
286
		elog(ERROR, "%s.nextval: WriteBuffer failed", elm->name);
287 288 289 290

	ItemPointerSet(&iptr, 0, FirstOffsetNumber);
	RelationUnsetSingleWLockPage(elm->rel, &iptr);

291
	return result;
292

293 294 295 296
}


int4
297
currval(struct varlena * seqin)
298
{
299 300 301
	char	   *seqname = textout(seqin);
	SeqTable	elm;
	int4		result;
302 303 304 305 306 307

	/* open and WIntentLock sequence */
	elm = init_sequence("currval", seqname);
	pfree(seqname);

	if (elm->increment == 0)	/* nextval/read_info were not called */
308
		elog(ERROR, "%s.currval is not yet defined in this session", elm->name);
309 310 311

	result = elm->last;

312
	return result;
313

314 315
}

M
 
Marc G. Fournier 已提交
316 317 318
int4
setval(struct varlena * seqin, int4 next)
{
319
	char	   *seqname = textout(seqin);
M
 
Marc G. Fournier 已提交
320
	SeqTable	elm;
321
	Buffer		buf;
322
	Form_pg_sequence seq;
M
 
Marc G. Fournier 已提交
323 324 325 326 327 328 329 330 331
	ItemPointerData iptr;

#ifndef NO_SECURITY
	if (pg_aclcheck(seqname, getpgusername(), ACL_WR) != ACLCHECK_OK)
		elog(ERROR, "%s.setval: you don't have permissions to set sequence %s",
			 seqname, seqname);
#endif

	/* open and WIntentLock sequence */
332 333 334
	elm = init_sequence("setval", seqname);
	seq = read_info("setval", elm, &buf);		/* lock page and read
												 * tuple */
M
 
Marc G. Fournier 已提交
335

336 337 338 339
	if (seq->cache_value != 1)
	{
		elog(ERROR, "%s.setval: can't set value of sequence %s, cache != 1",
			 seqname, seqname);
M
 
Marc G. Fournier 已提交
340 341
	}

342 343 344 345
	if ((next < seq->min_value) || (next > seq->max_value))
	{
		elog(ERROR, "%s.setval: value %d is of of bounds (%d,%d)",
			 seqname, next, seq->min_value, seq->max_value);
M
 
Marc G. Fournier 已提交
346 347 348 349 350 351 352 353 354 355
	}

	/* save info in local cache */
	elm->last = next;			/* last returned number */
	elm->cached = next;			/* last cached number */

	/* save info in sequence relation */
	seq->last_value = next;		/* last fetched number */
	seq->is_called = 't';

356 357
	if (WriteBuffer(buf) == STATUS_ERROR)
		elog(ERROR, "%s.settval: WriteBuffer failed", seqname);
M
 
Marc G. Fournier 已提交
358 359

	ItemPointerSet(&iptr, 0, FirstOffsetNumber);
360
	RelationUnsetSingleWLockPage(elm->rel, &iptr);
M
 
Marc G. Fournier 已提交
361

362
	return next;
M
 
Marc G. Fournier 已提交
363 364
}

365
static Form_pg_sequence
B
Bruce Momjian 已提交
366
read_info(char *caller, SeqTable elm, Buffer *buf)
367
{
368
	ItemPointerData iptr;
369 370
	PageHeader	page;
	ItemId		lp;
371
	HeapTupleData	tuple;
372
	sequence_magic *sm;
373
	Form_pg_sequence seq;
374 375 376 377 378

	ItemPointerSet(&iptr, 0, FirstOffsetNumber);
	RelationSetSingleWLockPage(elm->rel, &iptr);

	if (RelationGetNumberOfBlocks(elm->rel) != 1)
379
		elog(ERROR, "%s.%s: invalid number of blocks in sequence",
380 381 382 383
			 elm->name, caller);

	*buf = ReadBuffer(elm->rel, 0);
	if (!BufferIsValid(*buf))
384
		elog(ERROR, "%s.%s: ReadBuffer failed", elm->name, caller);
385 386 387 388 389

	page = (PageHeader) BufferGetPage(*buf);
	sm = (sequence_magic *) PageGetSpecialPointer(page);

	if (sm->magic != SEQ_MAGIC)
390
		elog(ERROR, "%s.%s: bad magic (%08X)", elm->name, caller, sm->magic);
391 392 393

	lp = PageGetItemId(page, FirstOffsetNumber);
	Assert(ItemIdIsUsed(lp));
394
	tuple.t_data = (HeapTupleHeader) PageGetItem((Page) page, lp);
395

396
	seq = (Form_pg_sequence) GETSTRUCT(&tuple);
397 398 399

	elm->increment = seq->increment_by;

400
	return seq;
401 402 403 404

}


405
static SeqTable
406
init_sequence(char *caller, char *name)
407
{
408 409 410
	SeqTable	elm,
				priv = (SeqTable) NULL;
	SeqTable	temp;
411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432

	for (elm = seqtab; elm != (SeqTable) NULL;)
	{
		if (strcmp(elm->name, name) == 0)
			break;
		priv = elm;
		elm = elm->next;
	}

	if (elm == (SeqTable) NULL) /* not found */
	{
		temp = (SeqTable) malloc(sizeof(SeqTableData));
		temp->name = malloc(strlen(name) + 1);
		strcpy(temp->name, name);
		temp->rel = (Relation) NULL;
		temp->cached = temp->last = temp->increment = 0;
		temp->next = (SeqTable) NULL;
	}
	else
/* found */
	{
		if (elm->rel != (Relation) NULL)		/* already opened */
433
			return elm;
434 435 436 437 438 439
		temp = elm;
	}

	temp->rel = heap_openr(name);

	if (!RelationIsValid(temp->rel))
440
		elog(ERROR, "%s.%s: sequence does not exist", name, caller);
441 442 443 444

	RelationSetWIntentLock(temp->rel);

	if (temp->rel->rd_rel->relkind != RELKIND_SEQUENCE)
445
		elog(ERROR, "%s.%s: %s is not sequence !", name, caller, name);
446 447 448

	if (elm != (SeqTable) NULL) /* we opened sequence from our */
	{							/* SeqTable - check relid ! */
449
		if (RelationGetRelid(elm->rel) != elm->relid)
450 451 452 453
		{
			elog(NOTICE, "%s.%s: sequence was re-created",
				 name, caller, name);
			elm->cached = elm->last = elm->increment = 0;
454
			elm->relid = RelationGetRelid(elm->rel);
455 456 457 458 459
		}
	}
	else
	{
		elm = temp;
460
		elm->relid = RelationGetRelid(elm->rel);
461 462 463 464 465 466
		if (seqtab == (SeqTable) NULL)
			seqtab = elm;
		else
			priv->next = elm;
	}

467
	return elm;
468

469 470 471 472 473
}


/*
 * CloseSequences --
474
 *				is calling by xact mgr at commit/abort.
475 476
 */
void
477
CloseSequences(void)
478
{
479 480
	SeqTable	elm;
	Relation	rel;
481 482

	for (elm = seqtab; elm != (SeqTable) NULL;)
483
	{
484 485 486 487 488 489 490 491 492 493 494 495
		if (elm->rel != (Relation) NULL)		/* opened in current xact */
		{
			rel = elm->rel;
			elm->rel = (Relation) NULL;
			RelationUnsetWIntentLock(rel);
			heap_close(rel);
		}
		elm = elm->next;
	}

	return;

496 497 498
}


499
static void
500
init_params(CreateSeqStmt *seq, Form_pg_sequence new)
501
{
502 503 504 505 506 507
	DefElem    *last_value = NULL;
	DefElem    *increment_by = NULL;
	DefElem    *max_value = NULL;
	DefElem    *min_value = NULL;
	DefElem    *cache_value = NULL;
	List	   *option;
508 509 510 511

	new->is_cycled = 'f';
	foreach(option, seq->options)
	{
512
		DefElem    *defel = (DefElem *) lfirst(option);
513 514 515 516 517 518 519 520 521 522 523 524 525 526

		if (!strcasecmp(defel->defname, "increment"))
			increment_by = defel;
		else if (!strcasecmp(defel->defname, "start"))
			last_value = defel;
		else if (!strcasecmp(defel->defname, "maxvalue"))
			max_value = defel;
		else if (!strcasecmp(defel->defname, "minvalue"))
			min_value = defel;
		else if (!strcasecmp(defel->defname, "cache"))
			cache_value = defel;
		else if (!strcasecmp(defel->defname, "cycle"))
		{
			if (defel->arg != (Node *) NULL)
527
				elog(ERROR, "DefineSequence: CYCLE ??");
528 529 530
			new->is_cycled = 't';
		}
		else
531
			elog(ERROR, "DefineSequence: option \"%s\" not recognized",
532 533 534 535 536 537
				 defel->defname);
	}

	if (increment_by == (DefElem *) NULL)		/* INCREMENT BY */
		new->increment_by = 1;
	else if ((new->increment_by = get_param(increment_by)) == 0)
538
		elog(ERROR, "DefineSequence: can't INCREMENT by 0");
539 540

	if (max_value == (DefElem *) NULL)	/* MAXVALUE */
541
	{
542 543 544 545
		if (new->increment_by > 0)
			new->max_value = SEQ_MAXVALUE;		/* ascending seq */
		else
			new->max_value = -1;/* descending seq */
546
	}
547
	else
548
		new->max_value = get_param(max_value);
549

550
	if (min_value == (DefElem *) NULL)	/* MINVALUE */
551
	{
552 553 554 555
		if (new->increment_by > 0)
			new->min_value = 1; /* ascending seq */
		else
			new->min_value = SEQ_MINVALUE;		/* descending seq */
556
	}
557
	else
558 559 560
		new->min_value = get_param(min_value);

	if (new->min_value >= new->max_value)
561
		elog(ERROR, "DefineSequence: MINVALUE (%d) can't be >= MAXVALUE (%d)",
562 563 564
			 new->min_value, new->max_value);

	if (last_value == (DefElem *) NULL) /* START WITH */
565
	{
566 567 568 569
		if (new->increment_by > 0)
			new->last_value = new->min_value;	/* ascending seq */
		else
			new->last_value = new->max_value;	/* descending seq */
570
	}
571
	else
572 573 574
		new->last_value = get_param(last_value);

	if (new->last_value < new->min_value)
575
		elog(ERROR, "DefineSequence: START value (%d) can't be < MINVALUE (%d)",
576 577
			 new->last_value, new->min_value);
	if (new->last_value > new->max_value)
578
		elog(ERROR, "DefineSequence: START value (%d) can't be > MAXVALUE (%d)",
579 580 581 582 583
			 new->last_value, new->max_value);

	if (cache_value == (DefElem *) NULL)		/* CACHE */
		new->cache_value = 1;
	else if ((new->cache_value = get_param(cache_value)) <= 0)
584
		elog(ERROR, "DefineSequence: CACHE (%d) can't be <= 0",
585
			 new->cache_value);
586 587 588 589 590

}


static int
591
get_param(DefElem *def)
592
{
593
	if (def->arg == (Node *) NULL)
594
		elog(ERROR, "DefineSequence: \"%s\" value unspecified", def->defname);
595 596

	if (nodeTag(def->arg) == T_Integer)
597
		return intVal(def->arg);
598

599
	elog(ERROR, "DefineSequence: \"%s\" is to be integer", def->defname);
600
	return -1;
601
}