sequence.c 12.4 KB
Newer Older
1 2 3
/*-------------------------------------------------------------------------
 *
 * sequence.c--
4
 *	  PostgreSQL sequences support code.
5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
 *
 *-------------------------------------------------------------------------
 */
#include <stdio.h>
#include <string.h>

#include <postgres.h>

#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>

22
#define SEQ_MAGIC	  0x1717
23 24 25 26

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

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

typedef FormData_pg_sequence *SequenceTupleForm;

typedef struct sequence_magic
{
43
	uint32		magic;
44
} sequence_magic;
45

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

typedef SeqTableData *SeqTable;

static SeqTable seqtab = NULL;

61
static SeqTable init_sequence(char *caller, char *name);
B
Bruce Momjian 已提交
62
static SequenceTupleForm read_info(char *caller, SeqTable elm, Buffer *buf);
63 64
static void init_params(CreateSeqStmt *seq, SequenceTupleForm new);
static int	get_param(DefElem *def);
65 66 67

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

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

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

		switch (i)
		{
109 110 111
			case SEQ_COL_NAME:
				typnam->name = "name";
				coldef->colname = "sequence_name";
112 113
				namestrcpy(&name, seq->seqname);
				value[i - 1] = NameGetDatum(&name);
114 115 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
				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;
150 151 152 153 154 155 156 157
		}
		stmt->tableElts = lappend(stmt->tableElts, coldef);
	}

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

158
	DefineRelation(stmt, RELKIND_SEQUENCE);
159 160 161 162 163 164 165 166 167 168 169 170

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

	RelationSetLockForWrite(rel);

	tupDesc = RelationGetTupleDescriptor(rel);

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

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

	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)
184
		elog(ERROR, "DefineSequence: WriteBuffer failed");
185 186 187 188 189

	RelationUnsetLockForWrite(rel);
	heap_close(rel);

	return;
190 191 192 193 194

}


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

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

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

	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 */
233
	{
234 235 236 237 238 239 240 241 242 243 244 245 246

		/*
		 * 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')
247
					elog(ERROR, "%s.nextval: got MAXVALUE (%d)",
248 249 250 251 252 253 254 255 256 257 258 259 260 261 262
						 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')
263
					elog(ERROR, "%s.nextval: got MINVALUE (%d)",
264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283
						 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)
284
		elog(ERROR, "%s.nextval: WriteBuffer failed", elm->name);
285 286 287 288 289 290

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

	return (result);

291 292 293 294
}


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

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

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

	result = elm->last;

	return (result);

312 313
}

314
static SequenceTupleForm
B
Bruce Momjian 已提交
315
read_info(char *caller, SeqTable elm, Buffer *buf)
316
{
317
	ItemPointerData iptr;
318 319 320
	PageHeader	page;
	ItemId		lp;
	HeapTuple	tuple;
321 322 323 324 325 326 327
	sequence_magic *sm;
	SequenceTupleForm seq;

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

	if (RelationGetNumberOfBlocks(elm->rel) != 1)
328
		elog(ERROR, "%s.%s: invalid number of blocks in sequence",
329 330 331 332
			 elm->name, caller);

	*buf = ReadBuffer(elm->rel, 0);
	if (!BufferIsValid(*buf))
333
		elog(ERROR, "%s.%s: ReadBuffer failed", elm->name, caller);
334 335 336 337 338

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

	if (sm->magic != SEQ_MAGIC)
339
		elog(ERROR, "%s.%s: bad magic (%08X)", elm->name, caller, sm->magic);
340 341 342 343 344 345 346 347 348 349

	lp = PageGetItemId(page, FirstOffsetNumber);
	Assert(ItemIdIsUsed(lp));
	tuple = (HeapTuple) PageGetItem((Page) page, lp);

	seq = (SequenceTupleForm) GETSTRUCT(tuple);

	elm->increment = seq->increment_by;

	return (seq);
350 351 352 353

}


354
static SeqTable
355
init_sequence(char *caller, char *name)
356
{
357 358 359
	SeqTable	elm,
				priv = (SeqTable) NULL;
	SeqTable	temp;
360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388

	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 */
			return (elm);
		temp = elm;
	}

	temp->rel = heap_openr(name);

	if (!RelationIsValid(temp->rel))
389
		elog(ERROR, "%s.%s: sequence does not exist", name, caller);
390 391 392 393

	RelationSetWIntentLock(temp->rel);

	if (temp->rel->rd_rel->relkind != RELKIND_SEQUENCE)
394
		elog(ERROR, "%s.%s: %s is not sequence !", name, caller, name);
395 396 397

	if (elm != (SeqTable) NULL) /* we opened sequence from our */
	{							/* SeqTable - check relid ! */
398
		if (RelationGetRelid(elm->rel) != elm->relid)
399 400 401 402
		{
			elog(NOTICE, "%s.%s: sequence was re-created",
				 name, caller, name);
			elm->cached = elm->last = elm->increment = 0;
403
			elm->relid = RelationGetRelid(elm->rel);
404 405 406 407 408
		}
	}
	else
	{
		elm = temp;
409
		elm->relid = RelationGetRelid(elm->rel);
410 411 412 413 414 415 416 417
		if (seqtab == (SeqTable) NULL)
			seqtab = elm;
		else
			priv->next = elm;
	}

	return (elm);

418 419 420 421 422
}


/*
 * CloseSequences --
423
 *				is calling by xact mgr at commit/abort.
424 425
 */
void
426
CloseSequences(void)
427
{
428 429
	SeqTable	elm;
	Relation	rel;
430 431

	for (elm = seqtab; elm != (SeqTable) NULL;)
432
	{
433 434 435 436 437 438 439 440 441 442 443 444
		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;

445 446 447
}


448
static void
449
init_params(CreateSeqStmt *seq, SequenceTupleForm new)
450
{
451 452 453 454 455 456
	DefElem    *last_value = NULL;
	DefElem    *increment_by = NULL;
	DefElem    *max_value = NULL;
	DefElem    *min_value = NULL;
	DefElem    *cache_value = NULL;
	List	   *option;
457 458 459 460

	new->is_cycled = 'f';
	foreach(option, seq->options)
	{
461
		DefElem    *defel = (DefElem *) lfirst(option);
462 463 464 465 466 467 468 469 470 471 472 473 474 475

		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)
476
				elog(ERROR, "DefineSequence: CYCLE ??");
477 478 479
			new->is_cycled = 't';
		}
		else
480
			elog(ERROR, "DefineSequence: option \"%s\" not recognized",
481 482 483 484 485 486
				 defel->defname);
	}

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

	if (max_value == (DefElem *) NULL)	/* MAXVALUE */
490
	{
491 492 493 494
		if (new->increment_by > 0)
			new->max_value = SEQ_MAXVALUE;		/* ascending seq */
		else
			new->max_value = -1;/* descending seq */
495
	}
496
	else
497
		new->max_value = get_param(max_value);
498

499
	if (min_value == (DefElem *) NULL)	/* MINVALUE */
500
	{
501 502 503 504
		if (new->increment_by > 0)
			new->min_value = 1; /* ascending seq */
		else
			new->min_value = SEQ_MINVALUE;		/* descending seq */
505
	}
506
	else
507 508 509
		new->min_value = get_param(min_value);

	if (new->min_value >= new->max_value)
510
		elog(ERROR, "DefineSequence: MINVALUE (%d) can't be >= MAXVALUE (%d)",
511 512 513
			 new->min_value, new->max_value);

	if (last_value == (DefElem *) NULL) /* START WITH */
514
	{
515 516 517 518
		if (new->increment_by > 0)
			new->last_value = new->min_value;	/* ascending seq */
		else
			new->last_value = new->max_value;	/* descending seq */
519
	}
520
	else
521 522 523
		new->last_value = get_param(last_value);

	if (new->last_value < new->min_value)
524
		elog(ERROR, "DefineSequence: START value (%d) can't be < MINVALUE (%d)",
525 526
			 new->last_value, new->min_value);
	if (new->last_value > new->max_value)
527
		elog(ERROR, "DefineSequence: START value (%d) can't be > MAXVALUE (%d)",
528 529 530 531 532
			 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)
533
		elog(ERROR, "DefineSequence: CACHE (%d) can't be <= 0",
534
			 new->cache_value);
535 536 537 538 539

}


static int
540
get_param(DefElem *def)
541
{
542
	if (def->arg == (Node *) NULL)
543
		elog(ERROR, "DefineSequence: \"%s\" value unspecified", def->defname);
544 545 546 547

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

548
	elog(ERROR, "DefineSequence: \"%s\" is to be integer", def->defname);
549
	return (-1);
550
}