gitlab-pg_query 1.3.1 → 2.0.4

Sign up to get free protection for your applications and to get access to all the features.
Files changed (480) hide show
  1. checksums.yaml +4 -4
  2. data/CHANGELOG.md +217 -99
  3. data/README.md +92 -69
  4. data/Rakefile +85 -5
  5. data/ext/pg_query/extconf.rb +3 -40
  6. data/ext/pg_query/guc-file.c +0 -0
  7. data/ext/pg_query/include/access/amapi.h +246 -0
  8. data/ext/pg_query/include/access/attmap.h +52 -0
  9. data/ext/pg_query/include/access/attnum.h +64 -0
  10. data/ext/pg_query/include/access/clog.h +61 -0
  11. data/ext/pg_query/include/access/commit_ts.h +77 -0
  12. data/ext/pg_query/include/access/detoast.h +92 -0
  13. data/ext/pg_query/include/access/genam.h +228 -0
  14. data/ext/pg_query/include/access/gin.h +78 -0
  15. data/ext/pg_query/include/access/htup.h +89 -0
  16. data/ext/pg_query/include/access/htup_details.h +819 -0
  17. data/ext/pg_query/include/access/itup.h +161 -0
  18. data/ext/pg_query/include/access/parallel.h +82 -0
  19. data/ext/pg_query/include/access/printtup.h +35 -0
  20. data/ext/pg_query/include/access/relation.h +28 -0
  21. data/ext/pg_query/include/access/relscan.h +176 -0
  22. data/ext/pg_query/include/access/rmgr.h +35 -0
  23. data/ext/pg_query/include/access/rmgrlist.h +49 -0
  24. data/ext/pg_query/include/access/sdir.h +58 -0
  25. data/ext/pg_query/include/access/skey.h +151 -0
  26. data/ext/pg_query/include/access/stratnum.h +83 -0
  27. data/ext/pg_query/include/access/sysattr.h +29 -0
  28. data/ext/pg_query/include/access/table.h +27 -0
  29. data/ext/pg_query/include/access/tableam.h +1825 -0
  30. data/ext/pg_query/include/access/transam.h +265 -0
  31. data/ext/pg_query/include/access/tupconvert.h +51 -0
  32. data/ext/pg_query/include/access/tupdesc.h +154 -0
  33. data/ext/pg_query/include/access/tupmacs.h +247 -0
  34. data/ext/pg_query/include/access/twophase.h +61 -0
  35. data/ext/pg_query/include/access/xact.h +463 -0
  36. data/ext/pg_query/include/access/xlog.h +398 -0
  37. data/ext/pg_query/include/access/xlog_internal.h +330 -0
  38. data/ext/pg_query/include/access/xlogdefs.h +109 -0
  39. data/ext/pg_query/include/access/xloginsert.h +64 -0
  40. data/ext/pg_query/include/access/xlogreader.h +327 -0
  41. data/ext/pg_query/include/access/xlogrecord.h +227 -0
  42. data/ext/pg_query/include/bootstrap/bootstrap.h +62 -0
  43. data/ext/pg_query/include/c.h +1322 -0
  44. data/ext/pg_query/include/catalog/catalog.h +42 -0
  45. data/ext/pg_query/include/catalog/catversion.h +58 -0
  46. data/ext/pg_query/include/catalog/dependency.h +275 -0
  47. data/ext/pg_query/include/catalog/genbki.h +64 -0
  48. data/ext/pg_query/include/catalog/index.h +199 -0
  49. data/ext/pg_query/include/catalog/indexing.h +366 -0
  50. data/ext/pg_query/include/catalog/namespace.h +188 -0
  51. data/ext/pg_query/include/catalog/objectaccess.h +197 -0
  52. data/ext/pg_query/include/catalog/objectaddress.h +84 -0
  53. data/ext/pg_query/include/catalog/pg_aggregate.h +176 -0
  54. data/ext/pg_query/include/catalog/pg_aggregate_d.h +77 -0
  55. data/ext/pg_query/include/catalog/pg_am.h +60 -0
  56. data/ext/pg_query/include/catalog/pg_am_d.h +45 -0
  57. data/ext/pg_query/include/catalog/pg_attribute.h +204 -0
  58. data/ext/pg_query/include/catalog/pg_attribute_d.h +59 -0
  59. data/ext/pg_query/include/catalog/pg_authid.h +58 -0
  60. data/ext/pg_query/include/catalog/pg_authid_d.h +49 -0
  61. data/ext/pg_query/include/catalog/pg_class.h +200 -0
  62. data/ext/pg_query/include/catalog/pg_class_d.h +103 -0
  63. data/ext/pg_query/include/catalog/pg_collation.h +73 -0
  64. data/ext/pg_query/include/catalog/pg_collation_d.h +45 -0
  65. data/ext/pg_query/include/catalog/pg_constraint.h +247 -0
  66. data/ext/pg_query/include/catalog/pg_constraint_d.h +67 -0
  67. data/ext/pg_query/include/catalog/pg_control.h +250 -0
  68. data/ext/pg_query/include/catalog/pg_conversion.h +72 -0
  69. data/ext/pg_query/include/catalog/pg_conversion_d.h +35 -0
  70. data/ext/pg_query/include/catalog/pg_depend.h +73 -0
  71. data/ext/pg_query/include/catalog/pg_depend_d.h +34 -0
  72. data/ext/pg_query/include/catalog/pg_event_trigger.h +51 -0
  73. data/ext/pg_query/include/catalog/pg_event_trigger_d.h +34 -0
  74. data/ext/pg_query/include/catalog/pg_index.h +80 -0
  75. data/ext/pg_query/include/catalog/pg_index_d.h +56 -0
  76. data/ext/pg_query/include/catalog/pg_language.h +67 -0
  77. data/ext/pg_query/include/catalog/pg_language_d.h +39 -0
  78. data/ext/pg_query/include/catalog/pg_namespace.h +59 -0
  79. data/ext/pg_query/include/catalog/pg_namespace_d.h +34 -0
  80. data/ext/pg_query/include/catalog/pg_opclass.h +85 -0
  81. data/ext/pg_query/include/catalog/pg_opclass_d.h +49 -0
  82. data/ext/pg_query/include/catalog/pg_operator.h +102 -0
  83. data/ext/pg_query/include/catalog/pg_operator_d.h +106 -0
  84. data/ext/pg_query/include/catalog/pg_opfamily.h +60 -0
  85. data/ext/pg_query/include/catalog/pg_opfamily_d.h +47 -0
  86. data/ext/pg_query/include/catalog/pg_partitioned_table.h +63 -0
  87. data/ext/pg_query/include/catalog/pg_partitioned_table_d.h +35 -0
  88. data/ext/pg_query/include/catalog/pg_proc.h +211 -0
  89. data/ext/pg_query/include/catalog/pg_proc_d.h +99 -0
  90. data/ext/pg_query/include/catalog/pg_publication.h +115 -0
  91. data/ext/pg_query/include/catalog/pg_publication_d.h +36 -0
  92. data/ext/pg_query/include/catalog/pg_replication_origin.h +57 -0
  93. data/ext/pg_query/include/catalog/pg_replication_origin_d.h +29 -0
  94. data/ext/pg_query/include/catalog/pg_statistic.h +275 -0
  95. data/ext/pg_query/include/catalog/pg_statistic_d.h +194 -0
  96. data/ext/pg_query/include/catalog/pg_statistic_ext.h +74 -0
  97. data/ext/pg_query/include/catalog/pg_statistic_ext_d.h +40 -0
  98. data/ext/pg_query/include/catalog/pg_transform.h +45 -0
  99. data/ext/pg_query/include/catalog/pg_transform_d.h +32 -0
  100. data/ext/pg_query/include/catalog/pg_trigger.h +137 -0
  101. data/ext/pg_query/include/catalog/pg_trigger_d.h +106 -0
  102. data/ext/pg_query/include/catalog/pg_ts_config.h +50 -0
  103. data/ext/pg_query/include/catalog/pg_ts_config_d.h +32 -0
  104. data/ext/pg_query/include/catalog/pg_ts_dict.h +54 -0
  105. data/ext/pg_query/include/catalog/pg_ts_dict_d.h +33 -0
  106. data/ext/pg_query/include/catalog/pg_ts_parser.h +57 -0
  107. data/ext/pg_query/include/catalog/pg_ts_parser_d.h +35 -0
  108. data/ext/pg_query/include/catalog/pg_ts_template.h +48 -0
  109. data/ext/pg_query/include/catalog/pg_ts_template_d.h +32 -0
  110. data/ext/pg_query/include/catalog/pg_type.h +372 -0
  111. data/ext/pg_query/include/catalog/pg_type_d.h +285 -0
  112. data/ext/pg_query/include/catalog/storage.h +48 -0
  113. data/ext/pg_query/include/commands/async.h +54 -0
  114. data/ext/pg_query/include/commands/dbcommands.h +35 -0
  115. data/ext/pg_query/include/commands/defrem.h +173 -0
  116. data/ext/pg_query/include/commands/event_trigger.h +88 -0
  117. data/ext/pg_query/include/commands/explain.h +127 -0
  118. data/ext/pg_query/include/commands/prepare.h +61 -0
  119. data/ext/pg_query/include/commands/tablespace.h +67 -0
  120. data/ext/pg_query/include/commands/trigger.h +277 -0
  121. data/ext/pg_query/include/commands/user.h +37 -0
  122. data/ext/pg_query/include/commands/vacuum.h +293 -0
  123. data/ext/pg_query/include/commands/variable.h +38 -0
  124. data/ext/pg_query/include/common/file_perm.h +56 -0
  125. data/ext/pg_query/include/common/hashfn.h +104 -0
  126. data/ext/pg_query/include/common/ip.h +37 -0
  127. data/ext/pg_query/include/common/keywords.h +33 -0
  128. data/ext/pg_query/include/common/kwlookup.h +44 -0
  129. data/ext/pg_query/include/common/relpath.h +90 -0
  130. data/ext/pg_query/include/common/string.h +19 -0
  131. data/ext/pg_query/include/common/unicode_combining_table.h +196 -0
  132. data/ext/pg_query/include/datatype/timestamp.h +197 -0
  133. data/ext/pg_query/include/executor/execdesc.h +70 -0
  134. data/ext/pg_query/include/executor/executor.h +614 -0
  135. data/ext/pg_query/include/executor/functions.h +41 -0
  136. data/ext/pg_query/include/executor/instrument.h +101 -0
  137. data/ext/pg_query/include/executor/spi.h +175 -0
  138. data/ext/pg_query/include/executor/tablefunc.h +67 -0
  139. data/ext/pg_query/include/executor/tuptable.h +487 -0
  140. data/ext/pg_query/include/fmgr.h +775 -0
  141. data/ext/pg_query/include/funcapi.h +348 -0
  142. data/ext/pg_query/include/getaddrinfo.h +162 -0
  143. data/ext/pg_query/include/jit/jit.h +105 -0
  144. data/ext/pg_query/include/kwlist_d.h +1072 -0
  145. data/ext/pg_query/include/lib/ilist.h +727 -0
  146. data/ext/pg_query/include/lib/pairingheap.h +102 -0
  147. data/ext/pg_query/include/lib/simplehash.h +1059 -0
  148. data/ext/pg_query/include/lib/stringinfo.h +161 -0
  149. data/ext/pg_query/include/libpq/auth.h +29 -0
  150. data/ext/pg_query/include/libpq/crypt.h +46 -0
  151. data/ext/pg_query/include/libpq/hba.h +140 -0
  152. data/ext/pg_query/include/libpq/libpq-be.h +326 -0
  153. data/ext/pg_query/include/libpq/libpq.h +133 -0
  154. data/ext/pg_query/include/libpq/pqcomm.h +208 -0
  155. data/ext/pg_query/include/libpq/pqformat.h +210 -0
  156. data/ext/pg_query/include/libpq/pqsignal.h +42 -0
  157. data/ext/pg_query/include/mb/pg_wchar.h +672 -0
  158. data/ext/pg_query/include/mb/stringinfo_mb.h +24 -0
  159. data/ext/pg_query/include/miscadmin.h +476 -0
  160. data/ext/pg_query/include/nodes/bitmapset.h +122 -0
  161. data/ext/pg_query/include/nodes/execnodes.h +2520 -0
  162. data/ext/pg_query/include/nodes/extensible.h +160 -0
  163. data/ext/pg_query/include/nodes/lockoptions.h +61 -0
  164. data/ext/pg_query/include/nodes/makefuncs.h +108 -0
  165. data/ext/pg_query/include/nodes/memnodes.h +108 -0
  166. data/ext/pg_query/include/nodes/nodeFuncs.h +162 -0
  167. data/ext/pg_query/include/nodes/nodes.h +842 -0
  168. data/ext/pg_query/include/nodes/params.h +170 -0
  169. data/ext/pg_query/include/nodes/parsenodes.h +3579 -0
  170. data/ext/pg_query/include/nodes/pathnodes.h +2556 -0
  171. data/ext/pg_query/include/nodes/pg_list.h +605 -0
  172. data/ext/pg_query/include/nodes/plannodes.h +1251 -0
  173. data/ext/pg_query/include/nodes/primnodes.h +1541 -0
  174. data/ext/pg_query/include/nodes/print.h +34 -0
  175. data/ext/pg_query/include/nodes/tidbitmap.h +75 -0
  176. data/ext/pg_query/include/nodes/value.h +61 -0
  177. data/ext/pg_query/include/optimizer/cost.h +206 -0
  178. data/ext/pg_query/include/optimizer/geqo.h +88 -0
  179. data/ext/pg_query/include/optimizer/geqo_gene.h +45 -0
  180. data/ext/pg_query/include/optimizer/optimizer.h +199 -0
  181. data/ext/pg_query/include/optimizer/paths.h +249 -0
  182. data/ext/pg_query/include/optimizer/planmain.h +119 -0
  183. data/ext/pg_query/include/parser/analyze.h +49 -0
  184. data/ext/pg_query/include/parser/gram.h +1067 -0
  185. data/ext/pg_query/include/parser/gramparse.h +75 -0
  186. data/ext/pg_query/include/parser/kwlist.h +477 -0
  187. data/ext/pg_query/include/parser/parse_agg.h +68 -0
  188. data/ext/pg_query/include/parser/parse_clause.h +54 -0
  189. data/ext/pg_query/include/parser/parse_coerce.h +97 -0
  190. data/ext/pg_query/include/parser/parse_collate.h +27 -0
  191. data/ext/pg_query/include/parser/parse_expr.h +26 -0
  192. data/ext/pg_query/include/parser/parse_func.h +73 -0
  193. data/ext/pg_query/include/parser/parse_node.h +327 -0
  194. data/ext/pg_query/include/parser/parse_oper.h +67 -0
  195. data/ext/pg_query/include/parser/parse_relation.h +123 -0
  196. data/ext/pg_query/include/parser/parse_target.h +46 -0
  197. data/ext/pg_query/include/parser/parse_type.h +60 -0
  198. data/ext/pg_query/include/parser/parser.h +41 -0
  199. data/ext/pg_query/include/parser/parsetree.h +61 -0
  200. data/ext/pg_query/include/parser/scanner.h +152 -0
  201. data/ext/pg_query/include/parser/scansup.h +30 -0
  202. data/ext/pg_query/include/partitioning/partdefs.h +26 -0
  203. data/ext/pg_query/include/pg_config.h +989 -0
  204. data/ext/pg_query/include/pg_config_ext.h +8 -0
  205. data/ext/pg_query/include/pg_config_manual.h +350 -0
  206. data/ext/pg_query/include/pg_config_os.h +8 -0
  207. data/ext/pg_query/include/pg_getopt.h +56 -0
  208. data/ext/pg_query/include/pg_query.h +121 -0
  209. data/ext/pg_query/include/pg_query_enum_defs.c +2454 -0
  210. data/ext/pg_query/include/pg_query_fingerprint_conds.c +875 -0
  211. data/ext/pg_query/include/pg_query_fingerprint_defs.c +12413 -0
  212. data/ext/pg_query/include/pg_query_json_helper.c +61 -0
  213. data/ext/pg_query/include/pg_query_outfuncs_conds.c +686 -0
  214. data/ext/pg_query/include/pg_query_outfuncs_defs.c +2437 -0
  215. data/ext/pg_query/include/pg_query_readfuncs_conds.c +222 -0
  216. data/ext/pg_query/include/pg_query_readfuncs_defs.c +2878 -0
  217. data/ext/pg_query/include/pg_trace.h +17 -0
  218. data/ext/pg_query/include/pgstat.h +1487 -0
  219. data/ext/pg_query/include/pgtime.h +84 -0
  220. data/ext/pg_query/include/pl_gram.h +385 -0
  221. data/ext/pg_query/include/pl_reserved_kwlist.h +52 -0
  222. data/ext/pg_query/include/pl_reserved_kwlist_d.h +114 -0
  223. data/ext/pg_query/include/pl_unreserved_kwlist.h +112 -0
  224. data/ext/pg_query/include/pl_unreserved_kwlist_d.h +246 -0
  225. data/ext/pg_query/include/plerrcodes.h +990 -0
  226. data/ext/pg_query/include/plpgsql.h +1347 -0
  227. data/ext/pg_query/include/port.h +524 -0
  228. data/ext/pg_query/include/port/atomics.h +524 -0
  229. data/ext/pg_query/include/port/atomics/arch-arm.h +26 -0
  230. data/ext/pg_query/include/port/atomics/arch-ppc.h +254 -0
  231. data/ext/pg_query/include/port/atomics/arch-x86.h +252 -0
  232. data/ext/pg_query/include/port/atomics/fallback.h +170 -0
  233. data/ext/pg_query/include/port/atomics/generic-gcc.h +286 -0
  234. data/ext/pg_query/include/port/atomics/generic.h +401 -0
  235. data/ext/pg_query/include/port/pg_bitutils.h +226 -0
  236. data/ext/pg_query/include/port/pg_bswap.h +161 -0
  237. data/ext/pg_query/include/port/pg_crc32c.h +101 -0
  238. data/ext/pg_query/include/portability/instr_time.h +256 -0
  239. data/ext/pg_query/include/postgres.h +764 -0
  240. data/ext/pg_query/include/postgres_ext.h +74 -0
  241. data/ext/pg_query/include/postmaster/autovacuum.h +83 -0
  242. data/ext/pg_query/include/postmaster/bgworker.h +161 -0
  243. data/ext/pg_query/include/postmaster/bgworker_internals.h +64 -0
  244. data/ext/pg_query/include/postmaster/bgwriter.h +45 -0
  245. data/ext/pg_query/include/postmaster/fork_process.h +17 -0
  246. data/ext/pg_query/include/postmaster/interrupt.h +32 -0
  247. data/ext/pg_query/include/postmaster/pgarch.h +39 -0
  248. data/ext/pg_query/include/postmaster/postmaster.h +77 -0
  249. data/ext/pg_query/include/postmaster/syslogger.h +98 -0
  250. data/ext/pg_query/include/postmaster/walwriter.h +21 -0
  251. data/ext/pg_query/include/protobuf-c.h +1106 -0
  252. data/ext/pg_query/include/protobuf-c/protobuf-c.h +1106 -0
  253. data/ext/pg_query/include/protobuf/pg_query.pb-c.h +10846 -0
  254. data/ext/pg_query/include/protobuf/pg_query.pb.h +124718 -0
  255. data/ext/pg_query/include/regex/regex.h +184 -0
  256. data/ext/pg_query/include/replication/logicallauncher.h +31 -0
  257. data/ext/pg_query/include/replication/logicalproto.h +110 -0
  258. data/ext/pg_query/include/replication/logicalworker.h +19 -0
  259. data/ext/pg_query/include/replication/origin.h +73 -0
  260. data/ext/pg_query/include/replication/reorderbuffer.h +467 -0
  261. data/ext/pg_query/include/replication/slot.h +219 -0
  262. data/ext/pg_query/include/replication/syncrep.h +115 -0
  263. data/ext/pg_query/include/replication/walreceiver.h +340 -0
  264. data/ext/pg_query/include/replication/walsender.h +74 -0
  265. data/ext/pg_query/include/rewrite/prs2lock.h +46 -0
  266. data/ext/pg_query/include/rewrite/rewriteHandler.h +40 -0
  267. data/ext/pg_query/include/rewrite/rewriteManip.h +87 -0
  268. data/ext/pg_query/include/rewrite/rewriteSupport.h +26 -0
  269. data/ext/pg_query/include/storage/backendid.h +37 -0
  270. data/ext/pg_query/include/storage/block.h +121 -0
  271. data/ext/pg_query/include/storage/buf.h +46 -0
  272. data/ext/pg_query/include/storage/bufmgr.h +292 -0
  273. data/ext/pg_query/include/storage/bufpage.h +459 -0
  274. data/ext/pg_query/include/storage/condition_variable.h +62 -0
  275. data/ext/pg_query/include/storage/dsm.h +61 -0
  276. data/ext/pg_query/include/storage/dsm_impl.h +75 -0
  277. data/ext/pg_query/include/storage/fd.h +168 -0
  278. data/ext/pg_query/include/storage/ipc.h +81 -0
  279. data/ext/pg_query/include/storage/item.h +19 -0
  280. data/ext/pg_query/include/storage/itemid.h +184 -0
  281. data/ext/pg_query/include/storage/itemptr.h +206 -0
  282. data/ext/pg_query/include/storage/large_object.h +100 -0
  283. data/ext/pg_query/include/storage/latch.h +190 -0
  284. data/ext/pg_query/include/storage/lmgr.h +114 -0
  285. data/ext/pg_query/include/storage/lock.h +612 -0
  286. data/ext/pg_query/include/storage/lockdefs.h +59 -0
  287. data/ext/pg_query/include/storage/lwlock.h +232 -0
  288. data/ext/pg_query/include/storage/lwlocknames.h +51 -0
  289. data/ext/pg_query/include/storage/off.h +57 -0
  290. data/ext/pg_query/include/storage/pg_sema.h +61 -0
  291. data/ext/pg_query/include/storage/pg_shmem.h +90 -0
  292. data/ext/pg_query/include/storage/pmsignal.h +94 -0
  293. data/ext/pg_query/include/storage/predicate.h +87 -0
  294. data/ext/pg_query/include/storage/proc.h +333 -0
  295. data/ext/pg_query/include/storage/proclist_types.h +51 -0
  296. data/ext/pg_query/include/storage/procsignal.h +75 -0
  297. data/ext/pg_query/include/storage/relfilenode.h +99 -0
  298. data/ext/pg_query/include/storage/s_lock.h +1047 -0
  299. data/ext/pg_query/include/storage/sharedfileset.h +45 -0
  300. data/ext/pg_query/include/storage/shm_mq.h +85 -0
  301. data/ext/pg_query/include/storage/shm_toc.h +58 -0
  302. data/ext/pg_query/include/storage/shmem.h +81 -0
  303. data/ext/pg_query/include/storage/sinval.h +153 -0
  304. data/ext/pg_query/include/storage/sinvaladt.h +43 -0
  305. data/ext/pg_query/include/storage/smgr.h +109 -0
  306. data/ext/pg_query/include/storage/spin.h +77 -0
  307. data/ext/pg_query/include/storage/standby.h +91 -0
  308. data/ext/pg_query/include/storage/standbydefs.h +74 -0
  309. data/ext/pg_query/include/storage/sync.h +62 -0
  310. data/ext/pg_query/include/tcop/cmdtag.h +58 -0
  311. data/ext/pg_query/include/tcop/cmdtaglist.h +217 -0
  312. data/ext/pg_query/include/tcop/deparse_utility.h +108 -0
  313. data/ext/pg_query/include/tcop/dest.h +149 -0
  314. data/ext/pg_query/include/tcop/fastpath.h +21 -0
  315. data/ext/pg_query/include/tcop/pquery.h +45 -0
  316. data/ext/pg_query/include/tcop/tcopprot.h +89 -0
  317. data/ext/pg_query/include/tcop/utility.h +108 -0
  318. data/ext/pg_query/include/tsearch/ts_cache.h +98 -0
  319. data/ext/pg_query/include/utils/acl.h +312 -0
  320. data/ext/pg_query/include/utils/aclchk_internal.h +45 -0
  321. data/ext/pg_query/include/utils/array.h +458 -0
  322. data/ext/pg_query/include/utils/builtins.h +127 -0
  323. data/ext/pg_query/include/utils/bytea.h +27 -0
  324. data/ext/pg_query/include/utils/catcache.h +231 -0
  325. data/ext/pg_query/include/utils/date.h +90 -0
  326. data/ext/pg_query/include/utils/datetime.h +343 -0
  327. data/ext/pg_query/include/utils/datum.h +68 -0
  328. data/ext/pg_query/include/utils/dsa.h +123 -0
  329. data/ext/pg_query/include/utils/dynahash.h +19 -0
  330. data/ext/pg_query/include/utils/elog.h +439 -0
  331. data/ext/pg_query/include/utils/errcodes.h +352 -0
  332. data/ext/pg_query/include/utils/expandeddatum.h +159 -0
  333. data/ext/pg_query/include/utils/expandedrecord.h +231 -0
  334. data/ext/pg_query/include/utils/float.h +356 -0
  335. data/ext/pg_query/include/utils/fmgroids.h +2657 -0
  336. data/ext/pg_query/include/utils/fmgrprotos.h +2646 -0
  337. data/ext/pg_query/include/utils/fmgrtab.h +48 -0
  338. data/ext/pg_query/include/utils/guc.h +443 -0
  339. data/ext/pg_query/include/utils/guc_tables.h +272 -0
  340. data/ext/pg_query/include/utils/hsearch.h +149 -0
  341. data/ext/pg_query/include/utils/inval.h +64 -0
  342. data/ext/pg_query/include/utils/lsyscache.h +197 -0
  343. data/ext/pg_query/include/utils/memdebug.h +82 -0
  344. data/ext/pg_query/include/utils/memutils.h +225 -0
  345. data/ext/pg_query/include/utils/numeric.h +76 -0
  346. data/ext/pg_query/include/utils/palloc.h +136 -0
  347. data/ext/pg_query/include/utils/partcache.h +102 -0
  348. data/ext/pg_query/include/utils/pg_locale.h +119 -0
  349. data/ext/pg_query/include/utils/pg_lsn.h +29 -0
  350. data/ext/pg_query/include/utils/pidfile.h +56 -0
  351. data/ext/pg_query/include/utils/plancache.h +235 -0
  352. data/ext/pg_query/include/utils/portal.h +241 -0
  353. data/ext/pg_query/include/utils/probes.h +114 -0
  354. data/ext/pg_query/include/utils/ps_status.h +25 -0
  355. data/ext/pg_query/include/utils/queryenvironment.h +74 -0
  356. data/ext/pg_query/include/utils/regproc.h +28 -0
  357. data/ext/pg_query/include/utils/rel.h +644 -0
  358. data/ext/pg_query/include/utils/relcache.h +151 -0
  359. data/ext/pg_query/include/utils/reltrigger.h +81 -0
  360. data/ext/pg_query/include/utils/resowner.h +86 -0
  361. data/ext/pg_query/include/utils/rls.h +50 -0
  362. data/ext/pg_query/include/utils/ruleutils.h +44 -0
  363. data/ext/pg_query/include/utils/sharedtuplestore.h +61 -0
  364. data/ext/pg_query/include/utils/snapmgr.h +158 -0
  365. data/ext/pg_query/include/utils/snapshot.h +206 -0
  366. data/ext/pg_query/include/utils/sortsupport.h +276 -0
  367. data/ext/pg_query/include/utils/syscache.h +219 -0
  368. data/ext/pg_query/include/utils/timeout.h +88 -0
  369. data/ext/pg_query/include/utils/timestamp.h +116 -0
  370. data/ext/pg_query/include/utils/tuplesort.h +277 -0
  371. data/ext/pg_query/include/utils/tuplestore.h +91 -0
  372. data/ext/pg_query/include/utils/typcache.h +202 -0
  373. data/ext/pg_query/include/utils/tzparser.h +39 -0
  374. data/ext/pg_query/include/utils/varlena.h +39 -0
  375. data/ext/pg_query/include/utils/xml.h +84 -0
  376. data/ext/pg_query/include/xxhash.h +5445 -0
  377. data/ext/pg_query/include/xxhash/xxhash.h +5445 -0
  378. data/ext/pg_query/pg_query.c +104 -0
  379. data/ext/pg_query/pg_query.pb-c.c +37628 -0
  380. data/ext/pg_query/pg_query_deparse.c +9959 -0
  381. data/ext/pg_query/pg_query_fingerprint.c +295 -0
  382. data/ext/pg_query/pg_query_fingerprint.h +8 -0
  383. data/ext/pg_query/pg_query_internal.h +24 -0
  384. data/ext/pg_query/pg_query_json_plpgsql.c +738 -0
  385. data/ext/pg_query/pg_query_json_plpgsql.h +9 -0
  386. data/ext/pg_query/pg_query_normalize.c +439 -0
  387. data/ext/pg_query/pg_query_outfuncs.h +10 -0
  388. data/ext/pg_query/pg_query_outfuncs_json.c +297 -0
  389. data/ext/pg_query/pg_query_outfuncs_protobuf.c +237 -0
  390. data/ext/pg_query/pg_query_parse.c +148 -0
  391. data/ext/pg_query/pg_query_parse_plpgsql.c +460 -0
  392. data/ext/pg_query/pg_query_readfuncs.h +11 -0
  393. data/ext/pg_query/pg_query_readfuncs_protobuf.c +142 -0
  394. data/ext/pg_query/pg_query_ruby.c +108 -12
  395. data/ext/pg_query/pg_query_scan.c +173 -0
  396. data/ext/pg_query/pg_query_split.c +221 -0
  397. data/ext/pg_query/protobuf-c.c +3660 -0
  398. data/ext/pg_query/src_backend_catalog_namespace.c +1051 -0
  399. data/ext/pg_query/src_backend_catalog_pg_proc.c +142 -0
  400. data/ext/pg_query/src_backend_commands_define.c +117 -0
  401. data/ext/pg_query/src_backend_libpq_pqcomm.c +651 -0
  402. data/ext/pg_query/src_backend_nodes_bitmapset.c +513 -0
  403. data/ext/pg_query/src_backend_nodes_copyfuncs.c +6013 -0
  404. data/ext/pg_query/src_backend_nodes_equalfuncs.c +4003 -0
  405. data/ext/pg_query/src_backend_nodes_extensible.c +99 -0
  406. data/ext/pg_query/src_backend_nodes_list.c +922 -0
  407. data/ext/pg_query/src_backend_nodes_makefuncs.c +417 -0
  408. data/ext/pg_query/src_backend_nodes_nodeFuncs.c +1363 -0
  409. data/ext/pg_query/src_backend_nodes_value.c +84 -0
  410. data/ext/pg_query/src_backend_parser_gram.c +47456 -0
  411. data/ext/pg_query/src_backend_parser_parse_expr.c +313 -0
  412. data/ext/pg_query/src_backend_parser_parser.c +497 -0
  413. data/ext/pg_query/src_backend_parser_scan.c +7091 -0
  414. data/ext/pg_query/src_backend_parser_scansup.c +160 -0
  415. data/ext/pg_query/src_backend_postmaster_postmaster.c +2230 -0
  416. data/ext/pg_query/src_backend_storage_ipc_ipc.c +192 -0
  417. data/ext/pg_query/src_backend_storage_lmgr_s_lock.c +370 -0
  418. data/ext/pg_query/src_backend_tcop_postgres.c +776 -0
  419. data/ext/pg_query/src_backend_utils_adt_datum.c +326 -0
  420. data/ext/pg_query/src_backend_utils_adt_expandeddatum.c +98 -0
  421. data/ext/pg_query/src_backend_utils_adt_format_type.c +136 -0
  422. data/ext/pg_query/src_backend_utils_adt_ruleutils.c +1683 -0
  423. data/ext/pg_query/src_backend_utils_error_assert.c +74 -0
  424. data/ext/pg_query/src_backend_utils_error_elog.c +1748 -0
  425. data/ext/pg_query/src_backend_utils_fmgr_fmgr.c +570 -0
  426. data/ext/pg_query/src_backend_utils_hash_dynahash.c +1086 -0
  427. data/ext/pg_query/src_backend_utils_init_globals.c +168 -0
  428. data/ext/pg_query/src_backend_utils_mb_mbutils.c +839 -0
  429. data/ext/pg_query/src_backend_utils_misc_guc.c +1831 -0
  430. data/ext/pg_query/src_backend_utils_mmgr_aset.c +1560 -0
  431. data/ext/pg_query/src_backend_utils_mmgr_mcxt.c +1006 -0
  432. data/ext/pg_query/src_common_encnames.c +158 -0
  433. data/ext/pg_query/src_common_keywords.c +39 -0
  434. data/ext/pg_query/src_common_kwlist_d.h +1081 -0
  435. data/ext/pg_query/src_common_kwlookup.c +91 -0
  436. data/ext/pg_query/src_common_psprintf.c +158 -0
  437. data/ext/pg_query/src_common_string.c +86 -0
  438. data/ext/pg_query/src_common_stringinfo.c +336 -0
  439. data/ext/pg_query/src_common_wchar.c +1651 -0
  440. data/ext/pg_query/src_pl_plpgsql_src_pl_comp.c +1133 -0
  441. data/ext/pg_query/src_pl_plpgsql_src_pl_funcs.c +877 -0
  442. data/ext/pg_query/src_pl_plpgsql_src_pl_gram.c +6533 -0
  443. data/ext/pg_query/src_pl_plpgsql_src_pl_handler.c +107 -0
  444. data/ext/pg_query/src_pl_plpgsql_src_pl_reserved_kwlist_d.h +123 -0
  445. data/ext/pg_query/src_pl_plpgsql_src_pl_scanner.c +671 -0
  446. data/ext/pg_query/src_pl_plpgsql_src_pl_unreserved_kwlist_d.h +255 -0
  447. data/ext/pg_query/src_port_erand48.c +127 -0
  448. data/ext/pg_query/src_port_pg_bitutils.c +246 -0
  449. data/ext/pg_query/src_port_pgsleep.c +69 -0
  450. data/ext/pg_query/src_port_pgstrcasecmp.c +83 -0
  451. data/ext/pg_query/src_port_qsort.c +240 -0
  452. data/ext/pg_query/src_port_random.c +31 -0
  453. data/ext/pg_query/src_port_snprintf.c +1449 -0
  454. data/ext/pg_query/src_port_strerror.c +324 -0
  455. data/ext/pg_query/src_port_strnlen.c +39 -0
  456. data/ext/pg_query/xxhash.c +43 -0
  457. data/lib/pg_query.rb +7 -4
  458. data/lib/pg_query/constants.rb +21 -0
  459. data/lib/pg_query/deparse.rb +15 -1581
  460. data/lib/pg_query/filter_columns.rb +88 -85
  461. data/lib/pg_query/fingerprint.rb +122 -87
  462. data/lib/pg_query/json_field_names.rb +1402 -0
  463. data/lib/pg_query/node.rb +31 -0
  464. data/lib/pg_query/param_refs.rb +42 -37
  465. data/lib/pg_query/parse.rb +220 -203
  466. data/lib/pg_query/parse_error.rb +1 -1
  467. data/lib/pg_query/pg_query_pb.rb +3211 -0
  468. data/lib/pg_query/scan.rb +23 -0
  469. data/lib/pg_query/treewalker.rb +24 -40
  470. data/lib/pg_query/truncate.rb +71 -42
  471. data/lib/pg_query/version.rb +2 -2
  472. metadata +472 -11
  473. data/ext/pg_query/pg_query_ruby.h +0 -10
  474. data/lib/pg_query/deep_dup.rb +0 -16
  475. data/lib/pg_query/deparse/alter_table.rb +0 -42
  476. data/lib/pg_query/deparse/interval.rb +0 -105
  477. data/lib/pg_query/deparse/keywords.rb +0 -159
  478. data/lib/pg_query/deparse/rename.rb +0 -41
  479. data/lib/pg_query/legacy_parsetree.rb +0 -109
  480. data/lib/pg_query/node_types.rb +0 -296
@@ -0,0 +1,78 @@
1
+ /*--------------------------------------------------------------------------
2
+ * gin.h
3
+ * Public header file for Generalized Inverted Index access method.
4
+ *
5
+ * Copyright (c) 2006-2020, PostgreSQL Global Development Group
6
+ *
7
+ * src/include/access/gin.h
8
+ *--------------------------------------------------------------------------
9
+ */
10
+ #ifndef GIN_H
11
+ #define GIN_H
12
+
13
+ #include "access/xlogreader.h"
14
+ #include "lib/stringinfo.h"
15
+ #include "storage/block.h"
16
+ #include "utils/relcache.h"
17
+
18
+
19
+ /*
20
+ * amproc indexes for inverted indexes.
21
+ */
22
+ #define GIN_COMPARE_PROC 1
23
+ #define GIN_EXTRACTVALUE_PROC 2
24
+ #define GIN_EXTRACTQUERY_PROC 3
25
+ #define GIN_CONSISTENT_PROC 4
26
+ #define GIN_COMPARE_PARTIAL_PROC 5
27
+ #define GIN_TRICONSISTENT_PROC 6
28
+ #define GIN_OPTIONS_PROC 7
29
+ #define GINNProcs 7
30
+
31
+ /*
32
+ * searchMode settings for extractQueryFn.
33
+ */
34
+ #define GIN_SEARCH_MODE_DEFAULT 0
35
+ #define GIN_SEARCH_MODE_INCLUDE_EMPTY 1
36
+ #define GIN_SEARCH_MODE_ALL 2
37
+ #define GIN_SEARCH_MODE_EVERYTHING 3 /* for internal use only */
38
+
39
+ /*
40
+ * GinStatsData represents stats data for planner use
41
+ */
42
+ typedef struct GinStatsData
43
+ {
44
+ BlockNumber nPendingPages;
45
+ BlockNumber nTotalPages;
46
+ BlockNumber nEntryPages;
47
+ BlockNumber nDataPages;
48
+ int64 nEntries;
49
+ int32 ginVersion;
50
+ } GinStatsData;
51
+
52
+ /*
53
+ * A ternary value used by tri-consistent functions.
54
+ *
55
+ * This must be of the same size as a bool because some code will cast a
56
+ * pointer to a bool to a pointer to a GinTernaryValue.
57
+ */
58
+ typedef char GinTernaryValue;
59
+
60
+ #define GIN_FALSE 0 /* item is not present / does not match */
61
+ #define GIN_TRUE 1 /* item is present / matches */
62
+ #define GIN_MAYBE 2 /* don't know if item is present / don't know
63
+ * if matches */
64
+
65
+ #define DatumGetGinTernaryValue(X) ((GinTernaryValue)(X))
66
+ #define GinTernaryValueGetDatum(X) ((Datum)(X))
67
+ #define PG_RETURN_GIN_TERNARY_VALUE(x) return GinTernaryValueGetDatum(x)
68
+
69
+ /* GUC parameters */
70
+ extern PGDLLIMPORT int GinFuzzySearchLimit;
71
+ extern int gin_pending_list_limit;
72
+
73
+ /* ginutil.c */
74
+ extern void ginGetStats(Relation index, GinStatsData *stats);
75
+ extern void ginUpdateStats(Relation index, const GinStatsData *stats,
76
+ bool is_build);
77
+
78
+ #endif /* GIN_H */
@@ -0,0 +1,89 @@
1
+ /*-------------------------------------------------------------------------
2
+ *
3
+ * htup.h
4
+ * POSTGRES heap tuple definitions.
5
+ *
6
+ *
7
+ * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
8
+ * Portions Copyright (c) 1994, Regents of the University of California
9
+ *
10
+ * src/include/access/htup.h
11
+ *
12
+ *-------------------------------------------------------------------------
13
+ */
14
+ #ifndef HTUP_H
15
+ #define HTUP_H
16
+
17
+ #include "storage/itemptr.h"
18
+
19
+ /* typedefs and forward declarations for structs defined in htup_details.h */
20
+
21
+ typedef struct HeapTupleHeaderData HeapTupleHeaderData;
22
+
23
+ typedef HeapTupleHeaderData *HeapTupleHeader;
24
+
25
+ typedef struct MinimalTupleData MinimalTupleData;
26
+
27
+ typedef MinimalTupleData *MinimalTuple;
28
+
29
+
30
+ /*
31
+ * HeapTupleData is an in-memory data structure that points to a tuple.
32
+ *
33
+ * There are several ways in which this data structure is used:
34
+ *
35
+ * * Pointer to a tuple in a disk buffer: t_data points directly into the
36
+ * buffer (which the code had better be holding a pin on, but this is not
37
+ * reflected in HeapTupleData itself).
38
+ *
39
+ * * Pointer to nothing: t_data is NULL. This is used as a failure indication
40
+ * in some functions.
41
+ *
42
+ * * Part of a palloc'd tuple: the HeapTupleData itself and the tuple
43
+ * form a single palloc'd chunk. t_data points to the memory location
44
+ * immediately following the HeapTupleData struct (at offset HEAPTUPLESIZE).
45
+ * This is the output format of heap_form_tuple and related routines.
46
+ *
47
+ * * Separately allocated tuple: t_data points to a palloc'd chunk that
48
+ * is not adjacent to the HeapTupleData. (This case is deprecated since
49
+ * it's difficult to tell apart from case #1. It should be used only in
50
+ * limited contexts where the code knows that case #1 will never apply.)
51
+ *
52
+ * * Separately allocated minimal tuple: t_data points MINIMAL_TUPLE_OFFSET
53
+ * bytes before the start of a MinimalTuple. As with the previous case,
54
+ * this can't be told apart from case #1 by inspection; code setting up
55
+ * or destroying this representation has to know what it's doing.
56
+ *
57
+ * t_len should always be valid, except in the pointer-to-nothing case.
58
+ * t_self and t_tableOid should be valid if the HeapTupleData points to
59
+ * a disk buffer, or if it represents a copy of a tuple on disk. They
60
+ * should be explicitly set invalid in manufactured tuples.
61
+ */
62
+ typedef struct HeapTupleData
63
+ {
64
+ uint32 t_len; /* length of *t_data */
65
+ ItemPointerData t_self; /* SelfItemPointer */
66
+ Oid t_tableOid; /* table the tuple came from */
67
+ #define FIELDNO_HEAPTUPLEDATA_DATA 3
68
+ HeapTupleHeader t_data; /* -> tuple header and data */
69
+ } HeapTupleData;
70
+
71
+ typedef HeapTupleData *HeapTuple;
72
+
73
+ #define HEAPTUPLESIZE MAXALIGN(sizeof(HeapTupleData))
74
+
75
+ /*
76
+ * Accessor macros to be used with HeapTuple pointers.
77
+ */
78
+ #define HeapTupleIsValid(tuple) PointerIsValid(tuple)
79
+
80
+ /* HeapTupleHeader functions implemented in utils/time/combocid.c */
81
+ extern CommandId HeapTupleHeaderGetCmin(HeapTupleHeader tup);
82
+ extern CommandId HeapTupleHeaderGetCmax(HeapTupleHeader tup);
83
+ extern void HeapTupleHeaderAdjustCmax(HeapTupleHeader tup,
84
+ CommandId *cmax, bool *iscombo);
85
+
86
+ /* Prototype for HeapTupleHeader accessors in heapam.c */
87
+ extern TransactionId HeapTupleGetUpdateXid(HeapTupleHeader tuple);
88
+
89
+ #endif /* HTUP_H */
@@ -0,0 +1,819 @@
1
+ /*-------------------------------------------------------------------------
2
+ *
3
+ * htup_details.h
4
+ * POSTGRES heap tuple header definitions.
5
+ *
6
+ *
7
+ * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
8
+ * Portions Copyright (c) 1994, Regents of the University of California
9
+ *
10
+ * src/include/access/htup_details.h
11
+ *
12
+ *-------------------------------------------------------------------------
13
+ */
14
+ #ifndef HTUP_DETAILS_H
15
+ #define HTUP_DETAILS_H
16
+
17
+ #include "access/htup.h"
18
+ #include "access/transam.h"
19
+ #include "access/tupdesc.h"
20
+ #include "access/tupmacs.h"
21
+ #include "storage/bufpage.h"
22
+
23
+ /*
24
+ * MaxTupleAttributeNumber limits the number of (user) columns in a tuple.
25
+ * The key limit on this value is that the size of the fixed overhead for
26
+ * a tuple, plus the size of the null-values bitmap (at 1 bit per column),
27
+ * plus MAXALIGN alignment, must fit into t_hoff which is uint8. On most
28
+ * machines the upper limit without making t_hoff wider would be a little
29
+ * over 1700. We use round numbers here and for MaxHeapAttributeNumber
30
+ * so that alterations in HeapTupleHeaderData layout won't change the
31
+ * supported max number of columns.
32
+ */
33
+ #define MaxTupleAttributeNumber 1664 /* 8 * 208 */
34
+
35
+ /*
36
+ * MaxHeapAttributeNumber limits the number of (user) columns in a table.
37
+ * This should be somewhat less than MaxTupleAttributeNumber. It must be
38
+ * at least one less, else we will fail to do UPDATEs on a maximal-width
39
+ * table (because UPDATE has to form working tuples that include CTID).
40
+ * In practice we want some additional daylight so that we can gracefully
41
+ * support operations that add hidden "resjunk" columns, for example
42
+ * SELECT * FROM wide_table ORDER BY foo, bar, baz.
43
+ * In any case, depending on column data types you will likely be running
44
+ * into the disk-block-based limit on overall tuple size if you have more
45
+ * than a thousand or so columns. TOAST won't help.
46
+ */
47
+ #define MaxHeapAttributeNumber 1600 /* 8 * 200 */
48
+
49
+ /*
50
+ * Heap tuple header. To avoid wasting space, the fields should be
51
+ * laid out in such a way as to avoid structure padding.
52
+ *
53
+ * Datums of composite types (row types) share the same general structure
54
+ * as on-disk tuples, so that the same routines can be used to build and
55
+ * examine them. However the requirements are slightly different: a Datum
56
+ * does not need any transaction visibility information, and it does need
57
+ * a length word and some embedded type information. We can achieve this
58
+ * by overlaying the xmin/cmin/xmax/cmax/xvac fields of a heap tuple
59
+ * with the fields needed in the Datum case. Typically, all tuples built
60
+ * in-memory will be initialized with the Datum fields; but when a tuple is
61
+ * about to be inserted in a table, the transaction fields will be filled,
62
+ * overwriting the datum fields.
63
+ *
64
+ * The overall structure of a heap tuple looks like:
65
+ * fixed fields (HeapTupleHeaderData struct)
66
+ * nulls bitmap (if HEAP_HASNULL is set in t_infomask)
67
+ * alignment padding (as needed to make user data MAXALIGN'd)
68
+ * object ID (if HEAP_HASOID_OLD is set in t_infomask, not created
69
+ * anymore)
70
+ * user data fields
71
+ *
72
+ * We store five "virtual" fields Xmin, Cmin, Xmax, Cmax, and Xvac in three
73
+ * physical fields. Xmin and Xmax are always really stored, but Cmin, Cmax
74
+ * and Xvac share a field. This works because we know that Cmin and Cmax
75
+ * are only interesting for the lifetime of the inserting and deleting
76
+ * transaction respectively. If a tuple is inserted and deleted in the same
77
+ * transaction, we store a "combo" command id that can be mapped to the real
78
+ * cmin and cmax, but only by use of local state within the originating
79
+ * backend. See combocid.c for more details. Meanwhile, Xvac is only set by
80
+ * old-style VACUUM FULL, which does not have any command sub-structure and so
81
+ * does not need either Cmin or Cmax. (This requires that old-style VACUUM
82
+ * FULL never try to move a tuple whose Cmin or Cmax is still interesting,
83
+ * ie, an insert-in-progress or delete-in-progress tuple.)
84
+ *
85
+ * A word about t_ctid: whenever a new tuple is stored on disk, its t_ctid
86
+ * is initialized with its own TID (location). If the tuple is ever updated,
87
+ * its t_ctid is changed to point to the replacement version of the tuple. Or
88
+ * if the tuple is moved from one partition to another, due to an update of
89
+ * the partition key, t_ctid is set to a special value to indicate that
90
+ * (see ItemPointerSetMovedPartitions). Thus, a tuple is the latest version
91
+ * of its row iff XMAX is invalid or
92
+ * t_ctid points to itself (in which case, if XMAX is valid, the tuple is
93
+ * either locked or deleted). One can follow the chain of t_ctid links
94
+ * to find the newest version of the row, unless it was moved to a different
95
+ * partition. Beware however that VACUUM might
96
+ * erase the pointed-to (newer) tuple before erasing the pointing (older)
97
+ * tuple. Hence, when following a t_ctid link, it is necessary to check
98
+ * to see if the referenced slot is empty or contains an unrelated tuple.
99
+ * Check that the referenced tuple has XMIN equal to the referencing tuple's
100
+ * XMAX to verify that it is actually the descendant version and not an
101
+ * unrelated tuple stored into a slot recently freed by VACUUM. If either
102
+ * check fails, one may assume that there is no live descendant version.
103
+ *
104
+ * t_ctid is sometimes used to store a speculative insertion token, instead
105
+ * of a real TID. A speculative token is set on a tuple that's being
106
+ * inserted, until the inserter is sure that it wants to go ahead with the
107
+ * insertion. Hence a token should only be seen on a tuple with an XMAX
108
+ * that's still in-progress, or invalid/aborted. The token is replaced with
109
+ * the tuple's real TID when the insertion is confirmed. One should never
110
+ * see a speculative insertion token while following a chain of t_ctid links,
111
+ * because they are not used on updates, only insertions.
112
+ *
113
+ * Following the fixed header fields, the nulls bitmap is stored (beginning
114
+ * at t_bits). The bitmap is *not* stored if t_infomask shows that there
115
+ * are no nulls in the tuple. If an OID field is present (as indicated by
116
+ * t_infomask), then it is stored just before the user data, which begins at
117
+ * the offset shown by t_hoff. Note that t_hoff must be a multiple of
118
+ * MAXALIGN.
119
+ */
120
+
121
+ typedef struct HeapTupleFields
122
+ {
123
+ TransactionId t_xmin; /* inserting xact ID */
124
+ TransactionId t_xmax; /* deleting or locking xact ID */
125
+
126
+ union
127
+ {
128
+ CommandId t_cid; /* inserting or deleting command ID, or both */
129
+ TransactionId t_xvac; /* old-style VACUUM FULL xact ID */
130
+ } t_field3;
131
+ } HeapTupleFields;
132
+
133
+ typedef struct DatumTupleFields
134
+ {
135
+ int32 datum_len_; /* varlena header (do not touch directly!) */
136
+
137
+ int32 datum_typmod; /* -1, or identifier of a record type */
138
+
139
+ Oid datum_typeid; /* composite type OID, or RECORDOID */
140
+
141
+ /*
142
+ * datum_typeid cannot be a domain over composite, only plain composite,
143
+ * even if the datum is meant as a value of a domain-over-composite type.
144
+ * This is in line with the general principle that CoerceToDomain does not
145
+ * change the physical representation of the base type value.
146
+ *
147
+ * Note: field ordering is chosen with thought that Oid might someday
148
+ * widen to 64 bits.
149
+ */
150
+ } DatumTupleFields;
151
+
152
+ struct HeapTupleHeaderData
153
+ {
154
+ union
155
+ {
156
+ HeapTupleFields t_heap;
157
+ DatumTupleFields t_datum;
158
+ } t_choice;
159
+
160
+ ItemPointerData t_ctid; /* current TID of this or newer tuple (or a
161
+ * speculative insertion token) */
162
+
163
+ /* Fields below here must match MinimalTupleData! */
164
+
165
+ #define FIELDNO_HEAPTUPLEHEADERDATA_INFOMASK2 2
166
+ uint16 t_infomask2; /* number of attributes + various flags */
167
+
168
+ #define FIELDNO_HEAPTUPLEHEADERDATA_INFOMASK 3
169
+ uint16 t_infomask; /* various flag bits, see below */
170
+
171
+ #define FIELDNO_HEAPTUPLEHEADERDATA_HOFF 4
172
+ uint8 t_hoff; /* sizeof header incl. bitmap, padding */
173
+
174
+ /* ^ - 23 bytes - ^ */
175
+
176
+ #define FIELDNO_HEAPTUPLEHEADERDATA_BITS 5
177
+ bits8 t_bits[FLEXIBLE_ARRAY_MEMBER]; /* bitmap of NULLs */
178
+
179
+ /* MORE DATA FOLLOWS AT END OF STRUCT */
180
+ };
181
+
182
+ /* typedef appears in htup.h */
183
+
184
+ #define SizeofHeapTupleHeader offsetof(HeapTupleHeaderData, t_bits)
185
+
186
+ /*
187
+ * information stored in t_infomask:
188
+ */
189
+ #define HEAP_HASNULL 0x0001 /* has null attribute(s) */
190
+ #define HEAP_HASVARWIDTH 0x0002 /* has variable-width attribute(s) */
191
+ #define HEAP_HASEXTERNAL 0x0004 /* has external stored attribute(s) */
192
+ #define HEAP_HASOID_OLD 0x0008 /* has an object-id field */
193
+ #define HEAP_XMAX_KEYSHR_LOCK 0x0010 /* xmax is a key-shared locker */
194
+ #define HEAP_COMBOCID 0x0020 /* t_cid is a combo cid */
195
+ #define HEAP_XMAX_EXCL_LOCK 0x0040 /* xmax is exclusive locker */
196
+ #define HEAP_XMAX_LOCK_ONLY 0x0080 /* xmax, if valid, is only a locker */
197
+
198
+ /* xmax is a shared locker */
199
+ #define HEAP_XMAX_SHR_LOCK (HEAP_XMAX_EXCL_LOCK | HEAP_XMAX_KEYSHR_LOCK)
200
+
201
+ #define HEAP_LOCK_MASK (HEAP_XMAX_SHR_LOCK | HEAP_XMAX_EXCL_LOCK | \
202
+ HEAP_XMAX_KEYSHR_LOCK)
203
+ #define HEAP_XMIN_COMMITTED 0x0100 /* t_xmin committed */
204
+ #define HEAP_XMIN_INVALID 0x0200 /* t_xmin invalid/aborted */
205
+ #define HEAP_XMIN_FROZEN (HEAP_XMIN_COMMITTED|HEAP_XMIN_INVALID)
206
+ #define HEAP_XMAX_COMMITTED 0x0400 /* t_xmax committed */
207
+ #define HEAP_XMAX_INVALID 0x0800 /* t_xmax invalid/aborted */
208
+ #define HEAP_XMAX_IS_MULTI 0x1000 /* t_xmax is a MultiXactId */
209
+ #define HEAP_UPDATED 0x2000 /* this is UPDATEd version of row */
210
+ #define HEAP_MOVED_OFF 0x4000 /* moved to another place by pre-9.0
211
+ * VACUUM FULL; kept for binary
212
+ * upgrade support */
213
+ #define HEAP_MOVED_IN 0x8000 /* moved from another place by pre-9.0
214
+ * VACUUM FULL; kept for binary
215
+ * upgrade support */
216
+ #define HEAP_MOVED (HEAP_MOVED_OFF | HEAP_MOVED_IN)
217
+
218
+ #define HEAP_XACT_MASK 0xFFF0 /* visibility-related bits */
219
+
220
+ /*
221
+ * A tuple is only locked (i.e. not updated by its Xmax) if the
222
+ * HEAP_XMAX_LOCK_ONLY bit is set; or, for pg_upgrade's sake, if the Xmax is
223
+ * not a multi and the EXCL_LOCK bit is set.
224
+ *
225
+ * See also HeapTupleHeaderIsOnlyLocked, which also checks for a possible
226
+ * aborted updater transaction.
227
+ *
228
+ * Beware of multiple evaluations of the argument.
229
+ */
230
+ #define HEAP_XMAX_IS_LOCKED_ONLY(infomask) \
231
+ (((infomask) & HEAP_XMAX_LOCK_ONLY) || \
232
+ (((infomask) & (HEAP_XMAX_IS_MULTI | HEAP_LOCK_MASK)) == HEAP_XMAX_EXCL_LOCK))
233
+
234
+ /*
235
+ * A tuple that has HEAP_XMAX_IS_MULTI and HEAP_XMAX_LOCK_ONLY but neither of
236
+ * HEAP_XMAX_EXCL_LOCK and HEAP_XMAX_KEYSHR_LOCK must come from a tuple that was
237
+ * share-locked in 9.2 or earlier and then pg_upgrade'd.
238
+ *
239
+ * In 9.2 and prior, HEAP_XMAX_IS_MULTI was only set when there were multiple
240
+ * FOR SHARE lockers of that tuple. That set HEAP_XMAX_LOCK_ONLY (with a
241
+ * different name back then) but neither of HEAP_XMAX_EXCL_LOCK and
242
+ * HEAP_XMAX_KEYSHR_LOCK. That combination is no longer possible in 9.3 and
243
+ * up, so if we see that combination we know for certain that the tuple was
244
+ * locked in an earlier release; since all such lockers are gone (they cannot
245
+ * survive through pg_upgrade), such tuples can safely be considered not
246
+ * locked.
247
+ *
248
+ * We must not resolve such multixacts locally, because the result would be
249
+ * bogus, regardless of where they stand with respect to the current valid
250
+ * multixact range.
251
+ */
252
+ #define HEAP_LOCKED_UPGRADED(infomask) \
253
+ ( \
254
+ ((infomask) & HEAP_XMAX_IS_MULTI) != 0 && \
255
+ ((infomask) & HEAP_XMAX_LOCK_ONLY) != 0 && \
256
+ (((infomask) & (HEAP_XMAX_EXCL_LOCK | HEAP_XMAX_KEYSHR_LOCK)) == 0) \
257
+ )
258
+
259
+ /*
260
+ * Use these to test whether a particular lock is applied to a tuple
261
+ */
262
+ #define HEAP_XMAX_IS_SHR_LOCKED(infomask) \
263
+ (((infomask) & HEAP_LOCK_MASK) == HEAP_XMAX_SHR_LOCK)
264
+ #define HEAP_XMAX_IS_EXCL_LOCKED(infomask) \
265
+ (((infomask) & HEAP_LOCK_MASK) == HEAP_XMAX_EXCL_LOCK)
266
+ #define HEAP_XMAX_IS_KEYSHR_LOCKED(infomask) \
267
+ (((infomask) & HEAP_LOCK_MASK) == HEAP_XMAX_KEYSHR_LOCK)
268
+
269
+ /* turn these all off when Xmax is to change */
270
+ #define HEAP_XMAX_BITS (HEAP_XMAX_COMMITTED | HEAP_XMAX_INVALID | \
271
+ HEAP_XMAX_IS_MULTI | HEAP_LOCK_MASK | HEAP_XMAX_LOCK_ONLY)
272
+
273
+ /*
274
+ * information stored in t_infomask2:
275
+ */
276
+ #define HEAP_NATTS_MASK 0x07FF /* 11 bits for number of attributes */
277
+ /* bits 0x1800 are available */
278
+ #define HEAP_KEYS_UPDATED 0x2000 /* tuple was updated and key cols
279
+ * modified, or tuple deleted */
280
+ #define HEAP_HOT_UPDATED 0x4000 /* tuple was HOT-updated */
281
+ #define HEAP_ONLY_TUPLE 0x8000 /* this is heap-only tuple */
282
+
283
+ #define HEAP2_XACT_MASK 0xE000 /* visibility-related bits */
284
+
285
+ /*
286
+ * HEAP_TUPLE_HAS_MATCH is a temporary flag used during hash joins. It is
287
+ * only used in tuples that are in the hash table, and those don't need
288
+ * any visibility information, so we can overlay it on a visibility flag
289
+ * instead of using up a dedicated bit.
290
+ */
291
+ #define HEAP_TUPLE_HAS_MATCH HEAP_ONLY_TUPLE /* tuple has a join match */
292
+
293
+ /*
294
+ * HeapTupleHeader accessor macros
295
+ *
296
+ * Note: beware of multiple evaluations of "tup" argument. But the Set
297
+ * macros evaluate their other argument only once.
298
+ */
299
+
300
+ /*
301
+ * HeapTupleHeaderGetRawXmin returns the "raw" xmin field, which is the xid
302
+ * originally used to insert the tuple. However, the tuple might actually
303
+ * be frozen (via HeapTupleHeaderSetXminFrozen) in which case the tuple's xmin
304
+ * is visible to every snapshot. Prior to PostgreSQL 9.4, we actually changed
305
+ * the xmin to FrozenTransactionId, and that value may still be encountered
306
+ * on disk.
307
+ */
308
+ #define HeapTupleHeaderGetRawXmin(tup) \
309
+ ( \
310
+ (tup)->t_choice.t_heap.t_xmin \
311
+ )
312
+
313
+ #define HeapTupleHeaderGetXmin(tup) \
314
+ ( \
315
+ HeapTupleHeaderXminFrozen(tup) ? \
316
+ FrozenTransactionId : HeapTupleHeaderGetRawXmin(tup) \
317
+ )
318
+
319
+ #define HeapTupleHeaderSetXmin(tup, xid) \
320
+ ( \
321
+ (tup)->t_choice.t_heap.t_xmin = (xid) \
322
+ )
323
+
324
+ #define HeapTupleHeaderXminCommitted(tup) \
325
+ ( \
326
+ ((tup)->t_infomask & HEAP_XMIN_COMMITTED) != 0 \
327
+ )
328
+
329
+ #define HeapTupleHeaderXminInvalid(tup) \
330
+ ( \
331
+ ((tup)->t_infomask & (HEAP_XMIN_COMMITTED|HEAP_XMIN_INVALID)) == \
332
+ HEAP_XMIN_INVALID \
333
+ )
334
+
335
+ #define HeapTupleHeaderXminFrozen(tup) \
336
+ ( \
337
+ ((tup)->t_infomask & (HEAP_XMIN_FROZEN)) == HEAP_XMIN_FROZEN \
338
+ )
339
+
340
+ #define HeapTupleHeaderSetXminCommitted(tup) \
341
+ ( \
342
+ AssertMacro(!HeapTupleHeaderXminInvalid(tup)), \
343
+ ((tup)->t_infomask |= HEAP_XMIN_COMMITTED) \
344
+ )
345
+
346
+ #define HeapTupleHeaderSetXminInvalid(tup) \
347
+ ( \
348
+ AssertMacro(!HeapTupleHeaderXminCommitted(tup)), \
349
+ ((tup)->t_infomask |= HEAP_XMIN_INVALID) \
350
+ )
351
+
352
+ #define HeapTupleHeaderSetXminFrozen(tup) \
353
+ ( \
354
+ AssertMacro(!HeapTupleHeaderXminInvalid(tup)), \
355
+ ((tup)->t_infomask |= HEAP_XMIN_FROZEN) \
356
+ )
357
+
358
+ /*
359
+ * HeapTupleHeaderGetRawXmax gets you the raw Xmax field. To find out the Xid
360
+ * that updated a tuple, you might need to resolve the MultiXactId if certain
361
+ * bits are set. HeapTupleHeaderGetUpdateXid checks those bits and takes care
362
+ * to resolve the MultiXactId if necessary. This might involve multixact I/O,
363
+ * so it should only be used if absolutely necessary.
364
+ */
365
+ #define HeapTupleHeaderGetUpdateXid(tup) \
366
+ ( \
367
+ (!((tup)->t_infomask & HEAP_XMAX_INVALID) && \
368
+ ((tup)->t_infomask & HEAP_XMAX_IS_MULTI) && \
369
+ !((tup)->t_infomask & HEAP_XMAX_LOCK_ONLY)) ? \
370
+ HeapTupleGetUpdateXid(tup) \
371
+ : \
372
+ HeapTupleHeaderGetRawXmax(tup) \
373
+ )
374
+
375
+ #define HeapTupleHeaderGetRawXmax(tup) \
376
+ ( \
377
+ (tup)->t_choice.t_heap.t_xmax \
378
+ )
379
+
380
+ #define HeapTupleHeaderSetXmax(tup, xid) \
381
+ ( \
382
+ (tup)->t_choice.t_heap.t_xmax = (xid) \
383
+ )
384
+
385
+ /*
386
+ * HeapTupleHeaderGetRawCommandId will give you what's in the header whether
387
+ * it is useful or not. Most code should use HeapTupleHeaderGetCmin or
388
+ * HeapTupleHeaderGetCmax instead, but note that those Assert that you can
389
+ * get a legitimate result, ie you are in the originating transaction!
390
+ */
391
+ #define HeapTupleHeaderGetRawCommandId(tup) \
392
+ ( \
393
+ (tup)->t_choice.t_heap.t_field3.t_cid \
394
+ )
395
+
396
+ /* SetCmin is reasonably simple since we never need a combo CID */
397
+ #define HeapTupleHeaderSetCmin(tup, cid) \
398
+ do { \
399
+ Assert(!((tup)->t_infomask & HEAP_MOVED)); \
400
+ (tup)->t_choice.t_heap.t_field3.t_cid = (cid); \
401
+ (tup)->t_infomask &= ~HEAP_COMBOCID; \
402
+ } while (0)
403
+
404
+ /* SetCmax must be used after HeapTupleHeaderAdjustCmax; see combocid.c */
405
+ #define HeapTupleHeaderSetCmax(tup, cid, iscombo) \
406
+ do { \
407
+ Assert(!((tup)->t_infomask & HEAP_MOVED)); \
408
+ (tup)->t_choice.t_heap.t_field3.t_cid = (cid); \
409
+ if (iscombo) \
410
+ (tup)->t_infomask |= HEAP_COMBOCID; \
411
+ else \
412
+ (tup)->t_infomask &= ~HEAP_COMBOCID; \
413
+ } while (0)
414
+
415
+ #define HeapTupleHeaderGetXvac(tup) \
416
+ ( \
417
+ ((tup)->t_infomask & HEAP_MOVED) ? \
418
+ (tup)->t_choice.t_heap.t_field3.t_xvac \
419
+ : \
420
+ InvalidTransactionId \
421
+ )
422
+
423
+ #define HeapTupleHeaderSetXvac(tup, xid) \
424
+ do { \
425
+ Assert((tup)->t_infomask & HEAP_MOVED); \
426
+ (tup)->t_choice.t_heap.t_field3.t_xvac = (xid); \
427
+ } while (0)
428
+
429
+ #define HeapTupleHeaderIsSpeculative(tup) \
430
+ ( \
431
+ (ItemPointerGetOffsetNumberNoCheck(&(tup)->t_ctid) == SpecTokenOffsetNumber) \
432
+ )
433
+
434
+ #define HeapTupleHeaderGetSpeculativeToken(tup) \
435
+ ( \
436
+ AssertMacro(HeapTupleHeaderIsSpeculative(tup)), \
437
+ ItemPointerGetBlockNumber(&(tup)->t_ctid) \
438
+ )
439
+
440
+ #define HeapTupleHeaderSetSpeculativeToken(tup, token) \
441
+ ( \
442
+ ItemPointerSet(&(tup)->t_ctid, token, SpecTokenOffsetNumber) \
443
+ )
444
+
445
+ #define HeapTupleHeaderIndicatesMovedPartitions(tup) \
446
+ (ItemPointerGetOffsetNumber(&(tup)->t_ctid) == MovedPartitionsOffsetNumber && \
447
+ ItemPointerGetBlockNumberNoCheck(&(tup)->t_ctid) == MovedPartitionsBlockNumber)
448
+
449
+ #define HeapTupleHeaderSetMovedPartitions(tup) \
450
+ ItemPointerSet(&(tup)->t_ctid, MovedPartitionsBlockNumber, MovedPartitionsOffsetNumber)
451
+
452
+ #define HeapTupleHeaderGetDatumLength(tup) \
453
+ VARSIZE(tup)
454
+
455
+ #define HeapTupleHeaderSetDatumLength(tup, len) \
456
+ SET_VARSIZE(tup, len)
457
+
458
+ #define HeapTupleHeaderGetTypeId(tup) \
459
+ ( \
460
+ (tup)->t_choice.t_datum.datum_typeid \
461
+ )
462
+
463
+ #define HeapTupleHeaderSetTypeId(tup, typeid) \
464
+ ( \
465
+ (tup)->t_choice.t_datum.datum_typeid = (typeid) \
466
+ )
467
+
468
+ #define HeapTupleHeaderGetTypMod(tup) \
469
+ ( \
470
+ (tup)->t_choice.t_datum.datum_typmod \
471
+ )
472
+
473
+ #define HeapTupleHeaderSetTypMod(tup, typmod) \
474
+ ( \
475
+ (tup)->t_choice.t_datum.datum_typmod = (typmod) \
476
+ )
477
+
478
+ /*
479
+ * Note that we stop considering a tuple HOT-updated as soon as it is known
480
+ * aborted or the would-be updating transaction is known aborted. For best
481
+ * efficiency, check tuple visibility before using this macro, so that the
482
+ * INVALID bits will be as up to date as possible.
483
+ */
484
+ #define HeapTupleHeaderIsHotUpdated(tup) \
485
+ ( \
486
+ ((tup)->t_infomask2 & HEAP_HOT_UPDATED) != 0 && \
487
+ ((tup)->t_infomask & HEAP_XMAX_INVALID) == 0 && \
488
+ !HeapTupleHeaderXminInvalid(tup) \
489
+ )
490
+
491
+ #define HeapTupleHeaderSetHotUpdated(tup) \
492
+ ( \
493
+ (tup)->t_infomask2 |= HEAP_HOT_UPDATED \
494
+ )
495
+
496
+ #define HeapTupleHeaderClearHotUpdated(tup) \
497
+ ( \
498
+ (tup)->t_infomask2 &= ~HEAP_HOT_UPDATED \
499
+ )
500
+
501
+ #define HeapTupleHeaderIsHeapOnly(tup) \
502
+ ( \
503
+ ((tup)->t_infomask2 & HEAP_ONLY_TUPLE) != 0 \
504
+ )
505
+
506
+ #define HeapTupleHeaderSetHeapOnly(tup) \
507
+ ( \
508
+ (tup)->t_infomask2 |= HEAP_ONLY_TUPLE \
509
+ )
510
+
511
+ #define HeapTupleHeaderClearHeapOnly(tup) \
512
+ ( \
513
+ (tup)->t_infomask2 &= ~HEAP_ONLY_TUPLE \
514
+ )
515
+
516
+ #define HeapTupleHeaderHasMatch(tup) \
517
+ ( \
518
+ ((tup)->t_infomask2 & HEAP_TUPLE_HAS_MATCH) != 0 \
519
+ )
520
+
521
+ #define HeapTupleHeaderSetMatch(tup) \
522
+ ( \
523
+ (tup)->t_infomask2 |= HEAP_TUPLE_HAS_MATCH \
524
+ )
525
+
526
+ #define HeapTupleHeaderClearMatch(tup) \
527
+ ( \
528
+ (tup)->t_infomask2 &= ~HEAP_TUPLE_HAS_MATCH \
529
+ )
530
+
531
+ #define HeapTupleHeaderGetNatts(tup) \
532
+ ((tup)->t_infomask2 & HEAP_NATTS_MASK)
533
+
534
+ #define HeapTupleHeaderSetNatts(tup, natts) \
535
+ ( \
536
+ (tup)->t_infomask2 = ((tup)->t_infomask2 & ~HEAP_NATTS_MASK) | (natts) \
537
+ )
538
+
539
+ #define HeapTupleHeaderHasExternal(tup) \
540
+ (((tup)->t_infomask & HEAP_HASEXTERNAL) != 0)
541
+
542
+
543
+ /*
544
+ * BITMAPLEN(NATTS) -
545
+ * Computes size of null bitmap given number of data columns.
546
+ */
547
+ #define BITMAPLEN(NATTS) (((int)(NATTS) + 7) / 8)
548
+
549
+ /*
550
+ * MaxHeapTupleSize is the maximum allowed size of a heap tuple, including
551
+ * header and MAXALIGN alignment padding. Basically it's BLCKSZ minus the
552
+ * other stuff that has to be on a disk page. Since heap pages use no
553
+ * "special space", there's no deduction for that.
554
+ *
555
+ * NOTE: we allow for the ItemId that must point to the tuple, ensuring that
556
+ * an otherwise-empty page can indeed hold a tuple of this size. Because
557
+ * ItemIds and tuples have different alignment requirements, don't assume that
558
+ * you can, say, fit 2 tuples of size MaxHeapTupleSize/2 on the same page.
559
+ */
560
+ #define MaxHeapTupleSize (BLCKSZ - MAXALIGN(SizeOfPageHeaderData + sizeof(ItemIdData)))
561
+ #define MinHeapTupleSize MAXALIGN(SizeofHeapTupleHeader)
562
+
563
+ /*
564
+ * MaxHeapTuplesPerPage is an upper bound on the number of tuples that can
565
+ * fit on one heap page. (Note that indexes could have more, because they
566
+ * use a smaller tuple header.) We arrive at the divisor because each tuple
567
+ * must be maxaligned, and it must have an associated line pointer.
568
+ *
569
+ * Note: with HOT, there could theoretically be more line pointers (not actual
570
+ * tuples) than this on a heap page. However we constrain the number of line
571
+ * pointers to this anyway, to avoid excessive line-pointer bloat and not
572
+ * require increases in the size of work arrays.
573
+ */
574
+ #define MaxHeapTuplesPerPage \
575
+ ((int) ((BLCKSZ - SizeOfPageHeaderData) / \
576
+ (MAXALIGN(SizeofHeapTupleHeader) + sizeof(ItemIdData))))
577
+
578
+ /*
579
+ * MaxAttrSize is a somewhat arbitrary upper limit on the declared size of
580
+ * data fields of char(n) and similar types. It need not have anything
581
+ * directly to do with the *actual* upper limit of varlena values, which
582
+ * is currently 1Gb (see TOAST structures in postgres.h). I've set it
583
+ * at 10Mb which seems like a reasonable number --- tgl 8/6/00.
584
+ */
585
+ #define MaxAttrSize (10 * 1024 * 1024)
586
+
587
+
588
+ /*
589
+ * MinimalTuple is an alternative representation that is used for transient
590
+ * tuples inside the executor, in places where transaction status information
591
+ * is not required, the tuple rowtype is known, and shaving off a few bytes
592
+ * is worthwhile because we need to store many tuples. The representation
593
+ * is chosen so that tuple access routines can work with either full or
594
+ * minimal tuples via a HeapTupleData pointer structure. The access routines
595
+ * see no difference, except that they must not access the transaction status
596
+ * or t_ctid fields because those aren't there.
597
+ *
598
+ * For the most part, MinimalTuples should be accessed via TupleTableSlot
599
+ * routines. These routines will prevent access to the "system columns"
600
+ * and thereby prevent accidental use of the nonexistent fields.
601
+ *
602
+ * MinimalTupleData contains a length word, some padding, and fields matching
603
+ * HeapTupleHeaderData beginning with t_infomask2. The padding is chosen so
604
+ * that offsetof(t_infomask2) is the same modulo MAXIMUM_ALIGNOF in both
605
+ * structs. This makes data alignment rules equivalent in both cases.
606
+ *
607
+ * When a minimal tuple is accessed via a HeapTupleData pointer, t_data is
608
+ * set to point MINIMAL_TUPLE_OFFSET bytes before the actual start of the
609
+ * minimal tuple --- that is, where a full tuple matching the minimal tuple's
610
+ * data would start. This trick is what makes the structs seem equivalent.
611
+ *
612
+ * Note that t_hoff is computed the same as in a full tuple, hence it includes
613
+ * the MINIMAL_TUPLE_OFFSET distance. t_len does not include that, however.
614
+ *
615
+ * MINIMAL_TUPLE_DATA_OFFSET is the offset to the first useful (non-pad) data
616
+ * other than the length word. tuplesort.c and tuplestore.c use this to avoid
617
+ * writing the padding to disk.
618
+ */
619
+ #define MINIMAL_TUPLE_OFFSET \
620
+ ((offsetof(HeapTupleHeaderData, t_infomask2) - sizeof(uint32)) / MAXIMUM_ALIGNOF * MAXIMUM_ALIGNOF)
621
+ #define MINIMAL_TUPLE_PADDING \
622
+ ((offsetof(HeapTupleHeaderData, t_infomask2) - sizeof(uint32)) % MAXIMUM_ALIGNOF)
623
+ #define MINIMAL_TUPLE_DATA_OFFSET \
624
+ offsetof(MinimalTupleData, t_infomask2)
625
+
626
+ struct MinimalTupleData
627
+ {
628
+ uint32 t_len; /* actual length of minimal tuple */
629
+
630
+ char mt_padding[MINIMAL_TUPLE_PADDING];
631
+
632
+ /* Fields below here must match HeapTupleHeaderData! */
633
+
634
+ uint16 t_infomask2; /* number of attributes + various flags */
635
+
636
+ uint16 t_infomask; /* various flag bits, see below */
637
+
638
+ uint8 t_hoff; /* sizeof header incl. bitmap, padding */
639
+
640
+ /* ^ - 23 bytes - ^ */
641
+
642
+ bits8 t_bits[FLEXIBLE_ARRAY_MEMBER]; /* bitmap of NULLs */
643
+
644
+ /* MORE DATA FOLLOWS AT END OF STRUCT */
645
+ };
646
+
647
+ /* typedef appears in htup.h */
648
+
649
+ #define SizeofMinimalTupleHeader offsetof(MinimalTupleData, t_bits)
650
+
651
+
652
+ /*
653
+ * GETSTRUCT - given a HeapTuple pointer, return address of the user data
654
+ */
655
+ #define GETSTRUCT(TUP) ((char *) ((TUP)->t_data) + (TUP)->t_data->t_hoff)
656
+
657
+ /*
658
+ * Accessor macros to be used with HeapTuple pointers.
659
+ */
660
+
661
+ #define HeapTupleHasNulls(tuple) \
662
+ (((tuple)->t_data->t_infomask & HEAP_HASNULL) != 0)
663
+
664
+ #define HeapTupleNoNulls(tuple) \
665
+ (!((tuple)->t_data->t_infomask & HEAP_HASNULL))
666
+
667
+ #define HeapTupleHasVarWidth(tuple) \
668
+ (((tuple)->t_data->t_infomask & HEAP_HASVARWIDTH) != 0)
669
+
670
+ #define HeapTupleAllFixed(tuple) \
671
+ (!((tuple)->t_data->t_infomask & HEAP_HASVARWIDTH))
672
+
673
+ #define HeapTupleHasExternal(tuple) \
674
+ (((tuple)->t_data->t_infomask & HEAP_HASEXTERNAL) != 0)
675
+
676
+ #define HeapTupleIsHotUpdated(tuple) \
677
+ HeapTupleHeaderIsHotUpdated((tuple)->t_data)
678
+
679
+ #define HeapTupleSetHotUpdated(tuple) \
680
+ HeapTupleHeaderSetHotUpdated((tuple)->t_data)
681
+
682
+ #define HeapTupleClearHotUpdated(tuple) \
683
+ HeapTupleHeaderClearHotUpdated((tuple)->t_data)
684
+
685
+ #define HeapTupleIsHeapOnly(tuple) \
686
+ HeapTupleHeaderIsHeapOnly((tuple)->t_data)
687
+
688
+ #define HeapTupleSetHeapOnly(tuple) \
689
+ HeapTupleHeaderSetHeapOnly((tuple)->t_data)
690
+
691
+ #define HeapTupleClearHeapOnly(tuple) \
692
+ HeapTupleHeaderClearHeapOnly((tuple)->t_data)
693
+
694
+
695
+ /* ----------------
696
+ * fastgetattr
697
+ *
698
+ * Fetch a user attribute's value as a Datum (might be either a
699
+ * value, or a pointer into the data area of the tuple).
700
+ *
701
+ * This must not be used when a system attribute might be requested.
702
+ * Furthermore, the passed attnum MUST be valid. Use heap_getattr()
703
+ * instead, if in doubt.
704
+ *
705
+ * This gets called many times, so we macro the cacheable and NULL
706
+ * lookups, and call nocachegetattr() for the rest.
707
+ * ----------------
708
+ */
709
+
710
+ #if !defined(DISABLE_COMPLEX_MACRO)
711
+
712
+ #define fastgetattr(tup, attnum, tupleDesc, isnull) \
713
+ ( \
714
+ AssertMacro((attnum) > 0), \
715
+ (*(isnull) = false), \
716
+ HeapTupleNoNulls(tup) ? \
717
+ ( \
718
+ TupleDescAttr((tupleDesc), (attnum)-1)->attcacheoff >= 0 ? \
719
+ ( \
720
+ fetchatt(TupleDescAttr((tupleDesc), (attnum)-1), \
721
+ (char *) (tup)->t_data + (tup)->t_data->t_hoff + \
722
+ TupleDescAttr((tupleDesc), (attnum)-1)->attcacheoff)\
723
+ ) \
724
+ : \
725
+ nocachegetattr((tup), (attnum), (tupleDesc)) \
726
+ ) \
727
+ : \
728
+ ( \
729
+ att_isnull((attnum)-1, (tup)->t_data->t_bits) ? \
730
+ ( \
731
+ (*(isnull) = true), \
732
+ (Datum)NULL \
733
+ ) \
734
+ : \
735
+ ( \
736
+ nocachegetattr((tup), (attnum), (tupleDesc)) \
737
+ ) \
738
+ ) \
739
+ )
740
+ #else /* defined(DISABLE_COMPLEX_MACRO) */
741
+
742
+ extern Datum fastgetattr(HeapTuple tup, int attnum, TupleDesc tupleDesc,
743
+ bool *isnull);
744
+ #endif /* defined(DISABLE_COMPLEX_MACRO) */
745
+
746
+
747
+ /* ----------------
748
+ * heap_getattr
749
+ *
750
+ * Extract an attribute of a heap tuple and return it as a Datum.
751
+ * This works for either system or user attributes. The given attnum
752
+ * is properly range-checked.
753
+ *
754
+ * If the field in question has a NULL value, we return a zero Datum
755
+ * and set *isnull == true. Otherwise, we set *isnull == false.
756
+ *
757
+ * <tup> is the pointer to the heap tuple. <attnum> is the attribute
758
+ * number of the column (field) caller wants. <tupleDesc> is a
759
+ * pointer to the structure describing the row and all its fields.
760
+ * ----------------
761
+ */
762
+ #define heap_getattr(tup, attnum, tupleDesc, isnull) \
763
+ ( \
764
+ ((attnum) > 0) ? \
765
+ ( \
766
+ ((attnum) > (int) HeapTupleHeaderGetNatts((tup)->t_data)) ? \
767
+ getmissingattr((tupleDesc), (attnum), (isnull)) \
768
+ : \
769
+ fastgetattr((tup), (attnum), (tupleDesc), (isnull)) \
770
+ ) \
771
+ : \
772
+ heap_getsysattr((tup), (attnum), (tupleDesc), (isnull)) \
773
+ )
774
+
775
+
776
+ /* prototypes for functions in common/heaptuple.c */
777
+ extern Size heap_compute_data_size(TupleDesc tupleDesc,
778
+ Datum *values, bool *isnull);
779
+ extern void heap_fill_tuple(TupleDesc tupleDesc,
780
+ Datum *values, bool *isnull,
781
+ char *data, Size data_size,
782
+ uint16 *infomask, bits8 *bit);
783
+ extern bool heap_attisnull(HeapTuple tup, int attnum, TupleDesc tupleDesc);
784
+ extern Datum nocachegetattr(HeapTuple tup, int attnum,
785
+ TupleDesc att);
786
+ extern Datum heap_getsysattr(HeapTuple tup, int attnum, TupleDesc tupleDesc,
787
+ bool *isnull);
788
+ extern Datum getmissingattr(TupleDesc tupleDesc,
789
+ int attnum, bool *isnull);
790
+ extern HeapTuple heap_copytuple(HeapTuple tuple);
791
+ extern void heap_copytuple_with_tuple(HeapTuple src, HeapTuple dest);
792
+ extern Datum heap_copy_tuple_as_datum(HeapTuple tuple, TupleDesc tupleDesc);
793
+ extern HeapTuple heap_form_tuple(TupleDesc tupleDescriptor,
794
+ Datum *values, bool *isnull);
795
+ extern HeapTuple heap_modify_tuple(HeapTuple tuple,
796
+ TupleDesc tupleDesc,
797
+ Datum *replValues,
798
+ bool *replIsnull,
799
+ bool *doReplace);
800
+ extern HeapTuple heap_modify_tuple_by_cols(HeapTuple tuple,
801
+ TupleDesc tupleDesc,
802
+ int nCols,
803
+ int *replCols,
804
+ Datum *replValues,
805
+ bool *replIsnull);
806
+ extern void heap_deform_tuple(HeapTuple tuple, TupleDesc tupleDesc,
807
+ Datum *values, bool *isnull);
808
+ extern void heap_freetuple(HeapTuple htup);
809
+ extern MinimalTuple heap_form_minimal_tuple(TupleDesc tupleDescriptor,
810
+ Datum *values, bool *isnull);
811
+ extern void heap_free_minimal_tuple(MinimalTuple mtup);
812
+ extern MinimalTuple heap_copy_minimal_tuple(MinimalTuple mtup);
813
+ extern HeapTuple heap_tuple_from_minimal_tuple(MinimalTuple mtup);
814
+ extern MinimalTuple minimal_tuple_from_heap_tuple(HeapTuple htup);
815
+ extern size_t varsize_any(void *p);
816
+ extern HeapTuple heap_expand_tuple(HeapTuple sourceTuple, TupleDesc tupleDesc);
817
+ extern MinimalTuple minimal_expand_tuple(HeapTuple sourceTuple, TupleDesc tupleDesc);
818
+
819
+ #endif /* HTUP_DETAILS_H */