2007-05-18 03:11:25 +08:00
|
|
|
/*
|
2010-09-21 04:08:53 +08:00
|
|
|
* contrib/pageinspect/btreefuncs.c
|
2008-05-17 09:28:26 +08:00
|
|
|
*
|
|
|
|
*
|
2007-05-18 03:11:25 +08:00
|
|
|
* btreefuncs.c
|
|
|
|
*
|
|
|
|
* Copyright (c) 2006 Satoshi Nagayasu <nagayasus@nttdata.co.jp>
|
|
|
|
*
|
|
|
|
* Permission to use, copy, modify, and distribute this software and
|
|
|
|
* its documentation for any purpose, without fee, and without a
|
|
|
|
* written agreement is hereby granted, provided that the above
|
|
|
|
* copyright notice and this paragraph and the following two
|
|
|
|
* paragraphs appear in all copies.
|
|
|
|
*
|
|
|
|
* IN NO EVENT SHALL THE AUTHOR BE LIABLE TO ANY PARTY FOR DIRECT,
|
|
|
|
* INDIRECT, SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING
|
|
|
|
* LOST PROFITS, ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS
|
|
|
|
* DOCUMENTATION, EVEN IF THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED
|
|
|
|
* OF THE POSSIBILITY OF SUCH DAMAGE.
|
|
|
|
*
|
|
|
|
* THE AUTHOR SPECIFICALLY DISCLAIMS ANY WARRANTIES, INCLUDING, BUT NOT
|
|
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
|
|
|
* A PARTICULAR PURPOSE. THE SOFTWARE PROVIDED HEREUNDER IS ON AN "AS
|
|
|
|
* IS" BASIS, AND THE AUTHOR HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE,
|
|
|
|
* SUPPORT, UPDATES, ENHANCEMENTS, OR MODIFICATIONS.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "postgres.h"
|
|
|
|
|
2017-02-04 00:34:41 +08:00
|
|
|
#include "pageinspect.h"
|
|
|
|
|
2007-05-18 03:11:25 +08:00
|
|
|
#include "access/nbtree.h"
|
|
|
|
#include "catalog/namespace.h"
|
Restructure index access method API to hide most of it at the C level.
This patch reduces pg_am to just two columns, a name and a handler
function. All the data formerly obtained from pg_am is now provided
in a C struct returned by the handler function. This is similar to
the designs we've adopted for FDWs and tablesample methods. There
are multiple advantages. For one, the index AM's support functions
are now simple C functions, making them faster to call and much less
error-prone, since the C compiler can now check function signatures.
For another, this will make it far more practical to define index access
methods in installable extensions.
A disadvantage is that SQL-level code can no longer see attributes
of index AMs; in particular, some of the crosschecks in the opr_sanity
regression test are no longer possible from SQL. We've addressed that
by adding a facility for the index AM to perform such checks instead.
(Much more could be done in that line, but for now we're content if the
amvalidate functions more or less replace what opr_sanity used to do.)
We might also want to expose some sort of reporting functionality, but
this patch doesn't do that.
Alexander Korotkov, reviewed by Petr Jelínek, and rather heavily
editorialized on by me.
2016-01-18 08:36:59 +08:00
|
|
|
#include "catalog/pg_am.h"
|
2007-08-27 07:22:49 +08:00
|
|
|
#include "funcapi.h"
|
|
|
|
#include "miscadmin.h"
|
2007-05-18 03:11:25 +08:00
|
|
|
#include "utils/builtins.h"
|
2011-02-24 01:18:09 +08:00
|
|
|
#include "utils/rel.h"
|
2017-01-21 09:29:53 +08:00
|
|
|
#include "utils/varlena.h"
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
PG_FUNCTION_INFO_V1(bt_metap);
|
|
|
|
PG_FUNCTION_INFO_V1(bt_page_items);
|
2017-04-05 11:48:49 +08:00
|
|
|
PG_FUNCTION_INFO_V1(bt_page_items_bytea);
|
2007-08-27 07:22:49 +08:00
|
|
|
PG_FUNCTION_INFO_V1(bt_page_stats);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
#define IS_INDEX(r) ((r)->rd_rel->relkind == RELKIND_INDEX)
|
2007-05-18 03:11:25 +08:00
|
|
|
#define IS_BTREE(r) ((r)->rd_rel->relam == BTREE_AM_OID)
|
|
|
|
|
2007-07-16 07:46:20 +08:00
|
|
|
/* note: BlockNumber is unsigned, hence can't be negative */
|
2007-05-18 03:11:25 +08:00
|
|
|
#define CHECK_RELATION_BLOCK_RANGE(rel, blkno) { \
|
2007-07-16 07:46:20 +08:00
|
|
|
if ( RelationGetNumberOfBlocks(rel) <= (BlockNumber) (blkno) ) \
|
2007-07-16 07:09:26 +08:00
|
|
|
elog(ERROR, "block number out of range"); }
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
/* ------------------------------------------------
|
|
|
|
* structure for single btree page statistics
|
|
|
|
* ------------------------------------------------
|
|
|
|
*/
|
|
|
|
typedef struct BTPageStat
|
|
|
|
{
|
|
|
|
uint32 blkno;
|
|
|
|
uint32 live_items;
|
|
|
|
uint32 dead_items;
|
|
|
|
uint32 page_size;
|
|
|
|
uint32 max_avail;
|
|
|
|
uint32 free_size;
|
|
|
|
uint32 avg_item_size;
|
|
|
|
char type;
|
|
|
|
|
|
|
|
/* opaque data */
|
|
|
|
BlockNumber btpo_prev;
|
|
|
|
BlockNumber btpo_next;
|
|
|
|
union
|
|
|
|
{
|
|
|
|
uint32 level;
|
|
|
|
TransactionId xact;
|
|
|
|
} btpo;
|
|
|
|
uint16 btpo_flags;
|
|
|
|
BTCycleId btpo_cycleid;
|
2009-06-11 22:49:15 +08:00
|
|
|
} BTPageStat;
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
|
|
|
|
/* -------------------------------------------------
|
|
|
|
* GetBTPageStatistics()
|
|
|
|
*
|
2007-08-27 07:22:49 +08:00
|
|
|
* Collect statistics of single b-tree page
|
2007-05-18 03:11:25 +08:00
|
|
|
* -------------------------------------------------
|
|
|
|
*/
|
|
|
|
static void
|
2009-06-11 22:49:15 +08:00
|
|
|
GetBTPageStatistics(BlockNumber blkno, Buffer buffer, BTPageStat *stat)
|
2007-05-18 03:11:25 +08:00
|
|
|
{
|
2016-04-20 21:31:19 +08:00
|
|
|
Page page = BufferGetPage(buffer);
|
2007-05-18 03:11:25 +08:00
|
|
|
PageHeader phdr = (PageHeader) page;
|
|
|
|
OffsetNumber maxoff = PageGetMaxOffsetNumber(page);
|
|
|
|
BTPageOpaque opaque = (BTPageOpaque) PageGetSpecialPointer(page);
|
|
|
|
int item_size = 0;
|
|
|
|
int off;
|
|
|
|
|
|
|
|
stat->blkno = blkno;
|
|
|
|
|
|
|
|
stat->max_avail = BLCKSZ - (BLCKSZ - phdr->pd_special + SizeOfPageHeaderData);
|
|
|
|
|
|
|
|
stat->dead_items = stat->live_items = 0;
|
|
|
|
|
|
|
|
stat->page_size = PageGetPageSize(page);
|
|
|
|
|
|
|
|
/* page type (flags) */
|
|
|
|
if (P_ISDELETED(opaque))
|
|
|
|
{
|
|
|
|
stat->type = 'd';
|
|
|
|
stat->btpo.xact = opaque->btpo.xact;
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
else if (P_IGNORE(opaque))
|
|
|
|
stat->type = 'e';
|
|
|
|
else if (P_ISLEAF(opaque))
|
|
|
|
stat->type = 'l';
|
|
|
|
else if (P_ISROOT(opaque))
|
|
|
|
stat->type = 'r';
|
|
|
|
else
|
|
|
|
stat->type = 'i';
|
|
|
|
|
|
|
|
/* btpage opaque data */
|
|
|
|
stat->btpo_prev = opaque->btpo_prev;
|
|
|
|
stat->btpo_next = opaque->btpo_next;
|
|
|
|
stat->btpo.level = opaque->btpo.level;
|
|
|
|
stat->btpo_flags = opaque->btpo_flags;
|
|
|
|
stat->btpo_cycleid = opaque->btpo_cycleid;
|
|
|
|
|
|
|
|
/* count live and dead tuples, and free space */
|
|
|
|
for (off = FirstOffsetNumber; off <= maxoff; off++)
|
|
|
|
{
|
|
|
|
IndexTuple itup;
|
|
|
|
|
|
|
|
ItemId id = PageGetItemId(page, off);
|
|
|
|
|
|
|
|
itup = (IndexTuple) PageGetItem(page, id);
|
|
|
|
|
|
|
|
item_size += IndexTupleSize(itup);
|
|
|
|
|
2007-09-13 06:10:26 +08:00
|
|
|
if (!ItemIdIsDead(id))
|
2007-05-18 03:11:25 +08:00
|
|
|
stat->live_items++;
|
|
|
|
else
|
|
|
|
stat->dead_items++;
|
|
|
|
}
|
|
|
|
stat->free_size = PageGetFreeSpace(page);
|
|
|
|
|
|
|
|
if ((stat->live_items + stat->dead_items) > 0)
|
|
|
|
stat->avg_item_size = item_size / (stat->live_items + stat->dead_items);
|
|
|
|
else
|
|
|
|
stat->avg_item_size = 0;
|
|
|
|
}
|
|
|
|
|
|
|
|
/* -----------------------------------------------
|
2012-12-01 06:02:29 +08:00
|
|
|
* bt_page_stats()
|
2007-05-18 03:11:25 +08:00
|
|
|
*
|
2012-12-01 06:02:29 +08:00
|
|
|
* Usage: SELECT * FROM bt_page_stats('t1_pkey', 1);
|
2007-05-18 03:11:25 +08:00
|
|
|
* -----------------------------------------------
|
|
|
|
*/
|
|
|
|
Datum
|
|
|
|
bt_page_stats(PG_FUNCTION_ARGS)
|
|
|
|
{
|
2017-03-13 07:35:34 +08:00
|
|
|
text *relname = PG_GETARG_TEXT_PP(0);
|
2007-05-18 03:11:25 +08:00
|
|
|
uint32 blkno = PG_GETARG_UINT32(1);
|
|
|
|
Buffer buffer;
|
|
|
|
Relation rel;
|
|
|
|
RangeVar *relrv;
|
|
|
|
Datum result;
|
2007-08-27 07:22:49 +08:00
|
|
|
HeapTuple tuple;
|
|
|
|
TupleDesc tupleDesc;
|
|
|
|
int j;
|
|
|
|
char *values[11];
|
|
|
|
BTPageStat stat;
|
|
|
|
|
|
|
|
if (!superuser())
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
|
|
|
|
(errmsg("must be superuser to use pageinspect functions"))));
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
relrv = makeRangeVarFromNameList(textToQualifiedNameList(relname));
|
|
|
|
rel = relation_openrv(relrv, AccessShareLock);
|
|
|
|
|
|
|
|
if (!IS_INDEX(rel) || !IS_BTREE(rel))
|
2007-08-27 07:22:49 +08:00
|
|
|
elog(ERROR, "relation \"%s\" is not a btree index",
|
|
|
|
RelationGetRelationName(rel));
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2009-04-01 06:54:31 +08:00
|
|
|
/*
|
2009-06-11 22:49:15 +08:00
|
|
|
* Reject attempts to read non-local temporary relations; we would be
|
|
|
|
* likely to get wrong data since we have no visibility into the owning
|
|
|
|
* session's local buffers.
|
2009-04-01 06:54:31 +08:00
|
|
|
*/
|
|
|
|
if (RELATION_IS_OTHER_TEMP(rel))
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
|
|
|
errmsg("cannot access temporary tables of other sessions")));
|
|
|
|
|
2007-05-18 03:11:25 +08:00
|
|
|
if (blkno == 0)
|
2007-07-16 07:09:26 +08:00
|
|
|
elog(ERROR, "block 0 is a meta page");
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
CHECK_RELATION_BLOCK_RANGE(rel, blkno);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
buffer = ReadBuffer(rel, blkno);
|
2012-12-01 06:02:29 +08:00
|
|
|
LockBuffer(buffer, BUFFER_LOCK_SHARE);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
/* keep compiler quiet */
|
|
|
|
stat.btpo_prev = stat.btpo_next = InvalidBlockNumber;
|
|
|
|
stat.btpo_flags = stat.free_size = stat.avg_item_size = 0;
|
|
|
|
|
|
|
|
GetBTPageStatistics(blkno, buffer, &stat);
|
|
|
|
|
2012-12-01 06:02:29 +08:00
|
|
|
UnlockReleaseBuffer(buffer);
|
|
|
|
relation_close(rel, AccessShareLock);
|
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
/* Build a tuple descriptor for our result type */
|
|
|
|
if (get_call_result_type(fcinfo, NULL, &tupleDesc) != TYPEFUNC_COMPOSITE)
|
|
|
|
elog(ERROR, "return type must be a row type");
|
|
|
|
|
|
|
|
j = 0;
|
2014-01-07 10:30:26 +08:00
|
|
|
values[j++] = psprintf("%d", stat.blkno);
|
|
|
|
values[j++] = psprintf("%c", stat.type);
|
|
|
|
values[j++] = psprintf("%d", stat.live_items);
|
|
|
|
values[j++] = psprintf("%d", stat.dead_items);
|
|
|
|
values[j++] = psprintf("%d", stat.avg_item_size);
|
|
|
|
values[j++] = psprintf("%d", stat.page_size);
|
|
|
|
values[j++] = psprintf("%d", stat.free_size);
|
|
|
|
values[j++] = psprintf("%d", stat.btpo_prev);
|
|
|
|
values[j++] = psprintf("%d", stat.btpo_next);
|
|
|
|
values[j++] = psprintf("%d", (stat.type == 'd') ? stat.btpo.xact : stat.btpo.level);
|
|
|
|
values[j++] = psprintf("%d", stat.btpo_flags);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
tuple = BuildTupleFromCStrings(TupleDescGetAttInMetadata(tupleDesc),
|
|
|
|
values);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
result = HeapTupleGetDatum(tuple);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
PG_RETURN_DATUM(result);
|
|
|
|
}
|
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
|
|
|
|
/*
|
|
|
|
* cross-call data structure for SRF
|
2007-05-18 03:11:25 +08:00
|
|
|
*/
|
|
|
|
struct user_args
|
|
|
|
{
|
|
|
|
Page page;
|
2007-08-27 07:22:49 +08:00
|
|
|
OffsetNumber offset;
|
2007-05-18 03:11:25 +08:00
|
|
|
};
|
|
|
|
|
2017-04-05 11:48:49 +08:00
|
|
|
/*-------------------------------------------------------
|
|
|
|
* bt_page_print_tuples()
|
|
|
|
*
|
|
|
|
* Form a tuple describing index tuple at a given offset
|
|
|
|
* ------------------------------------------------------
|
|
|
|
*/
|
|
|
|
static Datum
|
|
|
|
bt_page_print_tuples(FuncCallContext *fctx, Page page, OffsetNumber offset)
|
|
|
|
{
|
|
|
|
char *values[6];
|
|
|
|
HeapTuple tuple;
|
|
|
|
ItemId id;
|
|
|
|
IndexTuple itup;
|
|
|
|
int j;
|
|
|
|
int off;
|
|
|
|
int dlen;
|
|
|
|
char *dump;
|
|
|
|
char *ptr;
|
|
|
|
|
|
|
|
id = PageGetItemId(page, offset);
|
|
|
|
|
|
|
|
if (!ItemIdIsValid(id))
|
|
|
|
elog(ERROR, "invalid ItemId");
|
|
|
|
|
|
|
|
itup = (IndexTuple) PageGetItem(page, id);
|
|
|
|
|
|
|
|
j = 0;
|
|
|
|
values[j++] = psprintf("%d", offset);
|
|
|
|
values[j++] = psprintf("(%u,%u)",
|
|
|
|
ItemPointerGetBlockNumberNoCheck(&itup->t_tid),
|
|
|
|
ItemPointerGetOffsetNumberNoCheck(&itup->t_tid));
|
|
|
|
values[j++] = psprintf("%d", (int) IndexTupleSize(itup));
|
|
|
|
values[j++] = psprintf("%c", IndexTupleHasNulls(itup) ? 't' : 'f');
|
|
|
|
values[j++] = psprintf("%c", IndexTupleHasVarwidths(itup) ? 't' : 'f');
|
|
|
|
|
|
|
|
ptr = (char *) itup + IndexInfoFindDataOffset(itup->t_info);
|
|
|
|
dlen = IndexTupleSize(itup) - IndexInfoFindDataOffset(itup->t_info);
|
|
|
|
dump = palloc0(dlen * 3 + 1);
|
|
|
|
values[j] = dump;
|
|
|
|
for (off = 0; off < dlen; off++)
|
|
|
|
{
|
|
|
|
if (off > 0)
|
|
|
|
*dump++ = ' ';
|
|
|
|
sprintf(dump, "%02x", *(ptr + off) & 0xff);
|
|
|
|
dump += 2;
|
|
|
|
}
|
|
|
|
|
|
|
|
tuple = BuildTupleFromCStrings(fctx->attinmeta, values);
|
|
|
|
|
|
|
|
return HeapTupleGetDatum(tuple);
|
|
|
|
}
|
|
|
|
|
|
|
|
/*-------------------------------------------------------
|
|
|
|
* bt_page_items()
|
|
|
|
*
|
|
|
|
* Get IndexTupleData set in a btree page
|
|
|
|
*
|
|
|
|
* Usage: SELECT * FROM bt_page_items('t1_pkey', 1);
|
|
|
|
*-------------------------------------------------------
|
|
|
|
*/
|
2007-05-18 03:11:25 +08:00
|
|
|
Datum
|
|
|
|
bt_page_items(PG_FUNCTION_ARGS)
|
|
|
|
{
|
2017-03-13 07:35:34 +08:00
|
|
|
text *relname = PG_GETARG_TEXT_PP(0);
|
2007-05-18 03:11:25 +08:00
|
|
|
uint32 blkno = PG_GETARG_UINT32(1);
|
|
|
|
Datum result;
|
|
|
|
FuncCallContext *fctx;
|
|
|
|
MemoryContext mctx;
|
2007-08-27 07:22:49 +08:00
|
|
|
struct user_args *uargs;
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
if (!superuser())
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
|
|
|
|
(errmsg("must be superuser to use pageinspect functions"))));
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
if (SRF_IS_FIRSTCALL())
|
|
|
|
{
|
2007-08-27 07:22:49 +08:00
|
|
|
RangeVar *relrv;
|
|
|
|
Relation rel;
|
|
|
|
Buffer buffer;
|
|
|
|
BTPageOpaque opaque;
|
|
|
|
TupleDesc tupleDesc;
|
|
|
|
|
2007-05-18 03:11:25 +08:00
|
|
|
fctx = SRF_FIRSTCALL_INIT();
|
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
relrv = makeRangeVarFromNameList(textToQualifiedNameList(relname));
|
|
|
|
rel = relation_openrv(relrv, AccessShareLock);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
if (!IS_INDEX(rel) || !IS_BTREE(rel))
|
|
|
|
elog(ERROR, "relation \"%s\" is not a btree index",
|
|
|
|
RelationGetRelationName(rel));
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2009-04-01 06:54:31 +08:00
|
|
|
/*
|
2009-06-11 22:49:15 +08:00
|
|
|
* Reject attempts to read non-local temporary relations; we would be
|
|
|
|
* likely to get wrong data since we have no visibility into the
|
2009-04-01 06:54:31 +08:00
|
|
|
* owning session's local buffers.
|
|
|
|
*/
|
|
|
|
if (RELATION_IS_OTHER_TEMP(rel))
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
Phase 3 of pgindent updates.
Don't move parenthesized lines to the left, even if that means they
flow past the right margin.
By default, BSD indent lines up statement continuation lines that are
within parentheses so that they start just to the right of the preceding
left parenthesis. However, traditionally, if that resulted in the
continuation line extending to the right of the desired right margin,
then indent would push it left just far enough to not overrun the margin,
if it could do so without making the continuation line start to the left of
the current statement indent. That makes for a weird mix of indentations
unless one has been completely rigid about never violating the 80-column
limit.
This behavior has been pretty universally panned by Postgres developers.
Hence, disable it with indent's new -lpl switch, so that parenthesized
lines are always lined up with the preceding left paren.
This patch is much less interesting than the first round of indent
changes, but also bulkier, so I thought it best to separate the effects.
Discussion: https://postgr.es/m/E1dAmxK-0006EE-1r@gemulon.postgresql.org
Discussion: https://postgr.es/m/30527.1495162840@sss.pgh.pa.us
2017-06-22 03:35:54 +08:00
|
|
|
errmsg("cannot access temporary tables of other sessions")));
|
2009-04-01 06:54:31 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
if (blkno == 0)
|
|
|
|
elog(ERROR, "block 0 is a meta page");
|
|
|
|
|
|
|
|
CHECK_RELATION_BLOCK_RANGE(rel, blkno);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
buffer = ReadBuffer(rel, blkno);
|
2012-12-01 06:02:29 +08:00
|
|
|
LockBuffer(buffer, BUFFER_LOCK_SHARE);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
/*
|
2007-11-16 05:14:46 +08:00
|
|
|
* We copy the page into local storage to avoid holding pin on the
|
|
|
|
* buffer longer than we must, and possibly failing to release it at
|
|
|
|
* all if the calling query doesn't fetch all rows.
|
2007-08-27 07:22:49 +08:00
|
|
|
*/
|
|
|
|
mctx = MemoryContextSwitchTo(fctx->multi_call_memory_ctx);
|
|
|
|
|
|
|
|
uargs = palloc(sizeof(struct user_args));
|
|
|
|
|
|
|
|
uargs->page = palloc(BLCKSZ);
|
2016-04-20 21:31:19 +08:00
|
|
|
memcpy(uargs->page, BufferGetPage(buffer), BLCKSZ);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2012-12-01 06:02:29 +08:00
|
|
|
UnlockReleaseBuffer(buffer);
|
2007-08-27 07:22:49 +08:00
|
|
|
relation_close(rel, AccessShareLock);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2007-08-27 07:22:49 +08:00
|
|
|
uargs->offset = FirstOffsetNumber;
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
opaque = (BTPageOpaque) PageGetSpecialPointer(uargs->page);
|
|
|
|
|
|
|
|
if (P_ISDELETED(opaque))
|
2007-07-16 07:09:26 +08:00
|
|
|
elog(NOTICE, "page is deleted");
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
fctx->max_calls = PageGetMaxOffsetNumber(uargs->page);
|
2007-08-27 07:22:49 +08:00
|
|
|
|
|
|
|
/* Build a tuple descriptor for our result type */
|
|
|
|
if (get_call_result_type(fcinfo, NULL, &tupleDesc) != TYPEFUNC_COMPOSITE)
|
|
|
|
elog(ERROR, "return type must be a row type");
|
|
|
|
|
|
|
|
fctx->attinmeta = TupleDescGetAttInMetadata(tupleDesc);
|
|
|
|
|
2007-05-18 03:11:25 +08:00
|
|
|
fctx->user_fctx = uargs;
|
|
|
|
|
|
|
|
MemoryContextSwitchTo(mctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
fctx = SRF_PERCALL_SETUP();
|
|
|
|
uargs = fctx->user_fctx;
|
|
|
|
|
|
|
|
if (fctx->call_cntr < fctx->max_calls)
|
|
|
|
{
|
2017-04-05 11:48:49 +08:00
|
|
|
result = bt_page_print_tuples(fctx, uargs->page, uargs->offset);
|
|
|
|
uargs->offset++;
|
2007-05-18 03:11:25 +08:00
|
|
|
SRF_RETURN_NEXT(fctx, result);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2007-08-27 07:22:49 +08:00
|
|
|
pfree(uargs->page);
|
|
|
|
pfree(uargs);
|
2007-05-18 03:11:25 +08:00
|
|
|
SRF_RETURN_DONE(fctx);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2017-04-05 11:48:49 +08:00
|
|
|
/*-------------------------------------------------------
|
|
|
|
* bt_page_items_bytea()
|
|
|
|
*
|
|
|
|
* Get IndexTupleData set in a btree page
|
|
|
|
*
|
|
|
|
* Usage: SELECT * FROM bt_page_items(get_raw_page('t1_pkey', 1));
|
|
|
|
*-------------------------------------------------------
|
|
|
|
*/
|
|
|
|
|
|
|
|
Datum
|
|
|
|
bt_page_items_bytea(PG_FUNCTION_ARGS)
|
|
|
|
{
|
|
|
|
bytea *raw_page = PG_GETARG_BYTEA_P(0);
|
|
|
|
Datum result;
|
|
|
|
FuncCallContext *fctx;
|
|
|
|
struct user_args *uargs;
|
|
|
|
int raw_page_size;
|
|
|
|
|
|
|
|
if (!superuser())
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
|
|
|
|
(errmsg("must be superuser to use pageinspect functions"))));
|
|
|
|
|
|
|
|
if (SRF_IS_FIRSTCALL())
|
|
|
|
{
|
|
|
|
BTPageOpaque opaque;
|
|
|
|
MemoryContext mctx;
|
|
|
|
TupleDesc tupleDesc;
|
|
|
|
|
|
|
|
raw_page_size = VARSIZE(raw_page) - VARHDRSZ;
|
|
|
|
|
|
|
|
if (raw_page_size < SizeOfPageHeaderData)
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
|
Phase 3 of pgindent updates.
Don't move parenthesized lines to the left, even if that means they
flow past the right margin.
By default, BSD indent lines up statement continuation lines that are
within parentheses so that they start just to the right of the preceding
left parenthesis. However, traditionally, if that resulted in the
continuation line extending to the right of the desired right margin,
then indent would push it left just far enough to not overrun the margin,
if it could do so without making the continuation line start to the left of
the current statement indent. That makes for a weird mix of indentations
unless one has been completely rigid about never violating the 80-column
limit.
This behavior has been pretty universally panned by Postgres developers.
Hence, disable it with indent's new -lpl switch, so that parenthesized
lines are always lined up with the preceding left paren.
This patch is much less interesting than the first round of indent
changes, but also bulkier, so I thought it best to separate the effects.
Discussion: https://postgr.es/m/E1dAmxK-0006EE-1r@gemulon.postgresql.org
Discussion: https://postgr.es/m/30527.1495162840@sss.pgh.pa.us
2017-06-22 03:35:54 +08:00
|
|
|
errmsg("input page too small (%d bytes)", raw_page_size)));
|
2017-04-05 11:48:49 +08:00
|
|
|
|
|
|
|
fctx = SRF_FIRSTCALL_INIT();
|
|
|
|
mctx = MemoryContextSwitchTo(fctx->multi_call_memory_ctx);
|
|
|
|
|
|
|
|
uargs = palloc(sizeof(struct user_args));
|
|
|
|
|
|
|
|
uargs->page = VARDATA(raw_page);
|
|
|
|
|
|
|
|
uargs->offset = FirstOffsetNumber;
|
|
|
|
|
|
|
|
opaque = (BTPageOpaque) PageGetSpecialPointer(uargs->page);
|
|
|
|
|
|
|
|
if (P_ISMETA(opaque))
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_INVALID_PARAMETER_VALUE),
|
|
|
|
errmsg("block is a meta page")));
|
|
|
|
|
|
|
|
if (P_ISDELETED(opaque))
|
|
|
|
elog(NOTICE, "page is deleted");
|
|
|
|
|
|
|
|
fctx->max_calls = PageGetMaxOffsetNumber(uargs->page);
|
|
|
|
|
|
|
|
/* Build a tuple descriptor for our result type */
|
|
|
|
if (get_call_result_type(fcinfo, NULL, &tupleDesc) != TYPEFUNC_COMPOSITE)
|
|
|
|
elog(ERROR, "return type must be a row type");
|
|
|
|
|
|
|
|
fctx->attinmeta = TupleDescGetAttInMetadata(tupleDesc);
|
|
|
|
|
|
|
|
fctx->user_fctx = uargs;
|
|
|
|
|
|
|
|
MemoryContextSwitchTo(mctx);
|
|
|
|
}
|
|
|
|
|
|
|
|
fctx = SRF_PERCALL_SETUP();
|
|
|
|
uargs = fctx->user_fctx;
|
|
|
|
|
|
|
|
if (fctx->call_cntr < fctx->max_calls)
|
|
|
|
{
|
|
|
|
result = bt_page_print_tuples(fctx, uargs->page, uargs->offset);
|
|
|
|
uargs->offset++;
|
|
|
|
SRF_RETURN_NEXT(fctx, result);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
pfree(uargs);
|
|
|
|
SRF_RETURN_DONE(fctx);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
/* ------------------------------------------------
|
|
|
|
* bt_metap()
|
|
|
|
*
|
2007-08-27 07:22:49 +08:00
|
|
|
* Get a btree's meta-page information
|
2007-05-18 03:11:25 +08:00
|
|
|
*
|
|
|
|
* Usage: SELECT * FROM bt_metap('t1_pkey')
|
|
|
|
* ------------------------------------------------
|
|
|
|
*/
|
|
|
|
Datum
|
|
|
|
bt_metap(PG_FUNCTION_ARGS)
|
|
|
|
{
|
2017-03-13 07:35:34 +08:00
|
|
|
text *relname = PG_GETARG_TEXT_PP(0);
|
2007-08-27 07:22:49 +08:00
|
|
|
Datum result;
|
2007-05-18 03:11:25 +08:00
|
|
|
Relation rel;
|
|
|
|
RangeVar *relrv;
|
2007-08-27 07:22:49 +08:00
|
|
|
BTMetaPageData *metad;
|
|
|
|
TupleDesc tupleDesc;
|
|
|
|
int j;
|
|
|
|
char *values[6];
|
|
|
|
Buffer buffer;
|
|
|
|
Page page;
|
|
|
|
HeapTuple tuple;
|
|
|
|
|
|
|
|
if (!superuser())
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
|
|
|
|
(errmsg("must be superuser to use pageinspect functions"))));
|
2007-05-18 03:11:25 +08:00
|
|
|
|
|
|
|
relrv = makeRangeVarFromNameList(textToQualifiedNameList(relname));
|
|
|
|
rel = relation_openrv(relrv, AccessShareLock);
|
|
|
|
|
|
|
|
if (!IS_INDEX(rel) || !IS_BTREE(rel))
|
2007-08-27 07:22:49 +08:00
|
|
|
elog(ERROR, "relation \"%s\" is not a btree index",
|
|
|
|
RelationGetRelationName(rel));
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2009-04-01 06:54:31 +08:00
|
|
|
/*
|
2009-06-11 22:49:15 +08:00
|
|
|
* Reject attempts to read non-local temporary relations; we would be
|
|
|
|
* likely to get wrong data since we have no visibility into the owning
|
|
|
|
* session's local buffers.
|
2009-04-01 06:54:31 +08:00
|
|
|
*/
|
|
|
|
if (RELATION_IS_OTHER_TEMP(rel))
|
|
|
|
ereport(ERROR,
|
|
|
|
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
|
|
|
|
errmsg("cannot access temporary tables of other sessions")));
|
|
|
|
|
2007-05-18 03:11:25 +08:00
|
|
|
buffer = ReadBuffer(rel, 0);
|
2012-12-01 06:02:29 +08:00
|
|
|
LockBuffer(buffer, BUFFER_LOCK_SHARE);
|
|
|
|
|
2016-04-20 21:31:19 +08:00
|
|
|
page = BufferGetPage(buffer);
|
2007-08-27 07:22:49 +08:00
|
|
|
metad = BTPageGetMeta(page);
|
|
|
|
|
|
|
|
/* Build a tuple descriptor for our result type */
|
|
|
|
if (get_call_result_type(fcinfo, NULL, &tupleDesc) != TYPEFUNC_COMPOSITE)
|
|
|
|
elog(ERROR, "return type must be a row type");
|
|
|
|
|
|
|
|
j = 0;
|
2014-01-07 10:30:26 +08:00
|
|
|
values[j++] = psprintf("%d", metad->btm_magic);
|
|
|
|
values[j++] = psprintf("%d", metad->btm_version);
|
|
|
|
values[j++] = psprintf("%d", metad->btm_root);
|
|
|
|
values[j++] = psprintf("%d", metad->btm_level);
|
|
|
|
values[j++] = psprintf("%d", metad->btm_fastroot);
|
|
|
|
values[j++] = psprintf("%d", metad->btm_fastlevel);
|
2007-08-27 07:22:49 +08:00
|
|
|
|
|
|
|
tuple = BuildTupleFromCStrings(TupleDescGetAttInMetadata(tupleDesc),
|
|
|
|
values);
|
|
|
|
|
|
|
|
result = HeapTupleGetDatum(tuple);
|
2007-05-18 03:11:25 +08:00
|
|
|
|
2012-12-01 06:02:29 +08:00
|
|
|
UnlockReleaseBuffer(buffer);
|
2007-05-18 03:11:25 +08:00
|
|
|
relation_close(rel, AccessShareLock);
|
|
|
|
|
|
|
|
PG_RETURN_DATUM(result);
|
|
|
|
}
|