portal.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252
  1. /*-------------------------------------------------------------------------
  2. *
  3. * portal.h
  4. * POSTGRES portal definitions.
  5. *
  6. * A portal is an abstraction which represents the execution state of
  7. * a running or runnable query. Portals support both SQL-level CURSORs
  8. * and protocol-level portals.
  9. *
  10. * Scrolling (nonsequential access) and suspension of execution are allowed
  11. * only for portals that contain a single SELECT-type query. We do not want
  12. * to let the client suspend an update-type query partway through! Because
  13. * the query rewriter does not allow arbitrary ON SELECT rewrite rules,
  14. * only queries that were originally update-type could produce multiple
  15. * plan trees; so the restriction to a single query is not a problem
  16. * in practice.
  17. *
  18. * For SQL cursors, we support three kinds of scroll behavior:
  19. *
  20. * (1) Neither NO SCROLL nor SCROLL was specified: to remain backward
  21. * compatible, we allow backward fetches here, unless it would
  22. * impose additional runtime overhead to do so.
  23. *
  24. * (2) NO SCROLL was specified: don't allow any backward fetches.
  25. *
  26. * (3) SCROLL was specified: allow all kinds of backward fetches, even
  27. * if we need to take a performance hit to do so. (The planner sticks
  28. * a Materialize node atop the query plan if needed.)
  29. *
  30. * Case #1 is converted to #2 or #3 by looking at the query itself and
  31. * determining if scrollability can be supported without additional
  32. * overhead.
  33. *
  34. * Protocol-level portals have no nonsequential-fetch API and so the
  35. * distinction doesn't matter for them. They are always initialized
  36. * to look like NO SCROLL cursors.
  37. *
  38. *
  39. * Portions Copyright (c) 1996-2022, PostgreSQL Global Development Group
  40. * Portions Copyright (c) 1994, Regents of the University of California
  41. *
  42. * src/include/utils/portal.h
  43. *
  44. *-------------------------------------------------------------------------
  45. */
  46. #ifndef PORTAL_H
  47. #define PORTAL_H
  48. #include "datatype/timestamp.h"
  49. #include "executor/execdesc.h"
  50. #include "tcop/cmdtag.h"
  51. #include "utils/plancache.h"
  52. #include "utils/resowner.h"
  53. /*
  54. * We have several execution strategies for Portals, depending on what
  55. * query or queries are to be executed. (Note: in all cases, a Portal
  56. * executes just a single source-SQL query, and thus produces just a
  57. * single result from the user's viewpoint. However, the rule rewriter
  58. * may expand the single source query to zero or many actual queries.)
  59. *
  60. * PORTAL_ONE_SELECT: the portal contains one single SELECT query. We run
  61. * the Executor incrementally as results are demanded. This strategy also
  62. * supports holdable cursors (the Executor results can be dumped into a
  63. * tuplestore for access after transaction completion).
  64. *
  65. * PORTAL_ONE_RETURNING: the portal contains a single INSERT/UPDATE/DELETE
  66. * query with a RETURNING clause (plus possibly auxiliary queries added by
  67. * rule rewriting). On first execution, we run the portal to completion
  68. * and dump the primary query's results into the portal tuplestore; the
  69. * results are then returned to the client as demanded. (We can't support
  70. * suspension of the query partway through, because the AFTER TRIGGER code
  71. * can't cope, and also because we don't want to risk failing to execute
  72. * all the auxiliary queries.)
  73. *
  74. * PORTAL_ONE_MOD_WITH: the portal contains one single SELECT query, but
  75. * it has data-modifying CTEs. This is currently treated the same as the
  76. * PORTAL_ONE_RETURNING case because of the possibility of needing to fire
  77. * triggers. It may act more like PORTAL_ONE_SELECT in future.
  78. *
  79. * PORTAL_UTIL_SELECT: the portal contains a utility statement that returns
  80. * a SELECT-like result (for example, EXPLAIN or SHOW). On first execution,
  81. * we run the statement and dump its results into the portal tuplestore;
  82. * the results are then returned to the client as demanded.
  83. *
  84. * PORTAL_MULTI_QUERY: all other cases. Here, we do not support partial
  85. * execution: the portal's queries will be run to completion on first call.
  86. */
  87. typedef enum PortalStrategy
  88. {
  89. PORTAL_ONE_SELECT,
  90. PORTAL_ONE_RETURNING,
  91. PORTAL_ONE_MOD_WITH,
  92. PORTAL_UTIL_SELECT,
  93. PORTAL_MULTI_QUERY
  94. } PortalStrategy;
  95. /*
  96. * A portal is always in one of these states. It is possible to transit
  97. * from ACTIVE back to READY if the query is not run to completion;
  98. * otherwise we never back up in status.
  99. */
  100. typedef enum PortalStatus
  101. {
  102. PORTAL_NEW, /* freshly created */
  103. PORTAL_DEFINED, /* PortalDefineQuery done */
  104. PORTAL_READY, /* PortalStart complete, can run it */
  105. PORTAL_ACTIVE, /* portal is running (can't delete it) */
  106. PORTAL_DONE, /* portal is finished (don't re-run it) */
  107. PORTAL_FAILED /* portal got error (can't re-run it) */
  108. } PortalStatus;
  109. typedef struct PortalData *Portal;
  110. typedef struct PortalData
  111. {
  112. /* Bookkeeping data */
  113. const char *name; /* portal's name */
  114. const char *prepStmtName; /* source prepared statement (NULL if none) */
  115. MemoryContext portalContext; /* subsidiary memory for portal */
  116. ResourceOwner resowner; /* resources owned by portal */
  117. void (*cleanup) (Portal portal); /* cleanup hook */
  118. /*
  119. * State data for remembering which subtransaction(s) the portal was
  120. * created or used in. If the portal is held over from a previous
  121. * transaction, both subxids are InvalidSubTransactionId. Otherwise,
  122. * createSubid is the creating subxact and activeSubid is the last subxact
  123. * in which we ran the portal.
  124. */
  125. SubTransactionId createSubid; /* the creating subxact */
  126. SubTransactionId activeSubid; /* the last subxact with activity */
  127. int createLevel; /* creating subxact's nesting level */
  128. /* The query or queries the portal will execute */
  129. const char *sourceText; /* text of query (as of 8.4, never NULL) */
  130. CommandTag commandTag; /* command tag for original query */
  131. QueryCompletion qc; /* command completion data for executed query */
  132. List *stmts; /* list of PlannedStmts */
  133. CachedPlan *cplan; /* CachedPlan, if stmts are from one */
  134. ParamListInfo portalParams; /* params to pass to query */
  135. QueryEnvironment *queryEnv; /* environment for query */
  136. /* Features/options */
  137. PortalStrategy strategy; /* see above */
  138. int cursorOptions; /* DECLARE CURSOR option bits */
  139. bool run_once; /* portal will only be run once */
  140. /* Status data */
  141. PortalStatus status; /* see above */
  142. bool portalPinned; /* a pinned portal can't be dropped */
  143. bool autoHeld; /* was automatically converted from pinned to
  144. * held (see HoldPinnedPortals()) */
  145. /* If not NULL, Executor is active; call ExecutorEnd eventually: */
  146. QueryDesc *queryDesc; /* info needed for executor invocation */
  147. /* If portal returns tuples, this is their tupdesc: */
  148. TupleDesc tupDesc; /* descriptor for result tuples */
  149. /* and these are the format codes to use for the columns: */
  150. int16 *formats; /* a format code for each column */
  151. /*
  152. * Outermost ActiveSnapshot for execution of the portal's queries. For
  153. * all but a few utility commands, we require such a snapshot to exist.
  154. * This ensures that TOAST references in query results can be detoasted,
  155. * and helps to reduce thrashing of the process's exposed xmin.
  156. */
  157. Snapshot portalSnapshot; /* active snapshot, or NULL if none */
  158. /*
  159. * Where we store tuples for a held cursor or a PORTAL_ONE_RETURNING or
  160. * PORTAL_UTIL_SELECT query. (A cursor held past the end of its
  161. * transaction no longer has any active executor state.)
  162. */
  163. Tuplestorestate *holdStore; /* store for holdable cursors */
  164. MemoryContext holdContext; /* memory containing holdStore */
  165. /*
  166. * Snapshot under which tuples in the holdStore were read. We must keep a
  167. * reference to this snapshot if there is any possibility that the tuples
  168. * contain TOAST references, because releasing the snapshot could allow
  169. * recently-dead rows to be vacuumed away, along with any toast data
  170. * belonging to them. In the case of a held cursor, we avoid needing to
  171. * keep such a snapshot by forcibly detoasting the data.
  172. */
  173. Snapshot holdSnapshot; /* registered snapshot, or NULL if none */
  174. /*
  175. * atStart, atEnd and portalPos indicate the current cursor position.
  176. * portalPos is zero before the first row, N after fetching N'th row of
  177. * query. After we run off the end, portalPos = # of rows in query, and
  178. * atEnd is true. Note that atStart implies portalPos == 0, but not the
  179. * reverse: we might have backed up only as far as the first row, not to
  180. * the start. Also note that various code inspects atStart and atEnd, but
  181. * only the portal movement routines should touch portalPos.
  182. */
  183. bool atStart;
  184. bool atEnd;
  185. uint64 portalPos;
  186. /* Presentation data, primarily used by the pg_cursors system view */
  187. TimestampTz creation_time; /* time at which this portal was defined */
  188. bool visible; /* include this portal in pg_cursors? */
  189. } PortalData;
  190. /*
  191. * PortalIsValid
  192. * True iff portal is valid.
  193. */
  194. #define PortalIsValid(p) PointerIsValid(p)
  195. /* Prototypes for functions in utils/mmgr/portalmem.c */
  196. extern void EnablePortalManager(void);
  197. extern bool PreCommit_Portals(bool isPrepare);
  198. extern void AtAbort_Portals(void);
  199. extern void AtCleanup_Portals(void);
  200. extern void PortalErrorCleanup(void);
  201. extern void AtSubCommit_Portals(SubTransactionId mySubid,
  202. SubTransactionId parentSubid,
  203. int parentLevel,
  204. ResourceOwner parentXactOwner);
  205. extern void AtSubAbort_Portals(SubTransactionId mySubid,
  206. SubTransactionId parentSubid,
  207. ResourceOwner myXactOwner,
  208. ResourceOwner parentXactOwner);
  209. extern void AtSubCleanup_Portals(SubTransactionId mySubid);
  210. extern Portal CreatePortal(const char *name, bool allowDup, bool dupSilent);
  211. extern Portal CreateNewPortal(void);
  212. extern void PinPortal(Portal portal);
  213. extern void UnpinPortal(Portal portal);
  214. extern void MarkPortalActive(Portal portal);
  215. extern void MarkPortalDone(Portal portal);
  216. extern void MarkPortalFailed(Portal portal);
  217. extern void PortalDrop(Portal portal, bool isTopCommit);
  218. extern Portal GetPortalByName(const char *name);
  219. extern void PortalDefineQuery(Portal portal,
  220. const char *prepStmtName,
  221. const char *sourceText,
  222. CommandTag commandTag,
  223. List *stmts,
  224. CachedPlan *cplan);
  225. extern PlannedStmt *PortalGetPrimaryStmt(Portal portal);
  226. extern void PortalCreateHoldStore(Portal portal);
  227. extern void PortalHashTableDeleteAll(void);
  228. extern bool ThereAreNoReadyPortals(void);
  229. extern void HoldPinnedPortals(void);
  230. extern void ForgetPortalSnapshots(void);
  231. #endif /* PORTAL_H */