Correspondence branch names to PostgreSQL version numbers:

-_PG9_5_ --- PostgreSQL 9.5

-_PGPRO9_5_ --- PostgresPro 9.5

-_master_ --- development version for PostgreSQL 10devel

Then execute this in the module's directory:

triggersboolean DEFAULT FALSE,

formattext DEFAULT'text')

Extract current query state from backend with specified`pid`. Since a function call causes nested subqueries so that state of execution may be viewed as stack of running queries, return value of`pg_query_state` has type`TABLE (query_text text, plan text)` and represents table where each row specifies stack frame -- correspondence between query and plan tree.

Extract current query state from backend with specified`pid`. Since parallel query can spawn workers and function call causes nested subqueries so that state of execution may be viewed as stack of running queries, return value of`pg_query_state` has type`TABLE (pid integer, frame_number integer, query_text text, plan text, leader_pid integer)`. It represents tree structure consisting of leader process and its spawned workers. Each worker refers to leader through`leader_pid` column. For leader process the value of this column is` null`. For each process the stack frames are specified as correspondence between`frame_number`,`query_text` and`plan` columns.

Thus, user can see the states of main query and queries generated from function calls for leader process and all workers spawned from it.

In process of execution some nodes of plan tree can take loops of full execution. Therefore statistics for each node consists of two parts: average statistics for previous loops just like in EXPLAIN ANALYZE output and statistics for current loop if node have not finished.

, buffersboolean= FALSE

, triggersboolean= FALSE

, formattext='text')

RETURNS TABLE (query_texttext, plantext)

RETURNS TABLE (pidinteger

, frame_numberinteger

, query_texttext

, plantext

, leader_pidinteger)

LANGUAGE C STRICT VOLATILE;

{

ListCell*cursor;

intindex;

List*stack;

}pg_qs_fctx;

FuncCallContext*funcctx;

MemoryContextoldcontext;

pg_qs_fctx*fctx;

constintN_ATTRS=5;

pid_tpid=PG_GETARG_INT32(0);

if (SRF_IS_FIRSTCALL())

{

LOCKTAGtag;

pid_tpid=PG_GETARG_INT32(0);

boolverbose=PG_GETARG_BOOL(1),

costs=PG_GETARG_BOOL(2),

timing=PG_GETARG_BOOL(3),

fctx= (pg_qs_fctx*)palloc(sizeof(pg_qs_fctx));

qs_stack=deserialize_stack(msg->stack,msg->stack_depth);

fctx->stack=qs_stack;

fctx->index=0;

fctx->cursor=list_head(qs_stack);

funcctx->user_fctx=fctx;

funcctx->max_calls=list_length(qs_stack);

tupdesc=CreateTemplateTupleDesc(2, false);

TupleDescInitEntry(tupdesc, (AttrNumber)1,"query_text",TEXTOID,-1,0);

TupleDescInitEntry(tupdesc, (AttrNumber)2,"plan",TEXTOID,-1,0);

tupdesc=CreateTemplateTupleDesc(N_ATTRS, false);

TupleDescInitEntry(tupdesc, (AttrNumber)1,"pid",INT4OID,-1,0);

TupleDescInitEntry(tupdesc, (AttrNumber)2,"frame_number",INT4OID,-1,0);

TupleDescInitEntry(tupdesc, (AttrNumber)3,"query_text",TEXTOID,-1,0);

TupleDescInitEntry(tupdesc, (AttrNumber)4,"plan",TEXTOID,-1,0);

TupleDescInitEntry(tupdesc, (AttrNumber)5,"leader_pid",INT4OID,-1,0);

funcctx->tuple_desc=BlessTupleDesc(tupdesc);

LockRelease(&tag,ExclusiveLock, false);

if (funcctx->call_cntr<funcctx->max_calls)

{

HeapTupletuple;

Datumvalues[2];

boolnulls[2];

Datumvalues[N_ATTRS];

boolnulls[N_ATTRS];

stack_frame*frame= (stack_frame*)lfirst(fctx->cursor);

MemSet(values,0,sizeof(values));

MemSet(nulls,0,sizeof(nulls));

values[0]=PointerGetDatum(frame->query);

values[1]=PointerGetDatum(frame->plan);

values[0]=Int32GetDatum(pid);

values[1]=Int32GetDatum(fctx->index);

values[2]=PointerGetDatum(frame->query);

values[3]=PointerGetDatum(frame->plan);

nulls[4]= true;

tuple=heap_form_tuple(funcctx->tuple_desc,values,nulls);

fctx->cursor=lnext(fctx->cursor);

fctx->index++;

SRF_RETURN_NEXT(funcctx,HeapTupleGetDatum(tuple));

}