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,605 @@
1
+ /*-------------------------------------------------------------------------
2
+ *
3
+ * pg_list.h
4
+ * interface for PostgreSQL generic list package
5
+ *
6
+ * Once upon a time, parts of Postgres were written in Lisp and used real
7
+ * cons-cell lists for major data structures. When that code was rewritten
8
+ * in C, we initially had a faithful emulation of cons-cell lists, which
9
+ * unsurprisingly was a performance bottleneck. A couple of major rewrites
10
+ * later, these data structures are actually simple expansible arrays;
11
+ * but the "List" name and a lot of the notation survives.
12
+ *
13
+ * One important concession to the original implementation is that an empty
14
+ * list is always represented by a null pointer (preferentially written NIL).
15
+ * Non-empty lists have a header, which will not be relocated as long as the
16
+ * list remains non-empty, and an expansible data array.
17
+ *
18
+ * We support three types of lists:
19
+ *
20
+ * T_List: lists of pointers
21
+ * (in practice usually pointers to Nodes, but not always;
22
+ * declared as "void *" to minimize casting annoyances)
23
+ * T_IntList: lists of integers
24
+ * T_OidList: lists of Oids
25
+ *
26
+ * (At the moment, ints and Oids are the same size, but they may not
27
+ * always be so; try to be careful to maintain the distinction.)
28
+ *
29
+ *
30
+ * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
31
+ * Portions Copyright (c) 1994, Regents of the University of California
32
+ *
33
+ * src/include/nodes/pg_list.h
34
+ *
35
+ *-------------------------------------------------------------------------
36
+ */
37
+ #ifndef PG_LIST_H
38
+ #define PG_LIST_H
39
+
40
+ #include "nodes/nodes.h"
41
+
42
+
43
+ typedef union ListCell
44
+ {
45
+ void *ptr_value;
46
+ int int_value;
47
+ Oid oid_value;
48
+ } ListCell;
49
+
50
+ typedef struct List
51
+ {
52
+ NodeTag type; /* T_List, T_IntList, or T_OidList */
53
+ int length; /* number of elements currently present */
54
+ int max_length; /* allocated length of elements[] */
55
+ ListCell *elements; /* re-allocatable array of cells */
56
+ /* We may allocate some cells along with the List header: */
57
+ ListCell initial_elements[FLEXIBLE_ARRAY_MEMBER];
58
+ /* If elements == initial_elements, it's not a separate allocation */
59
+ } List;
60
+
61
+ /*
62
+ * The *only* valid representation of an empty list is NIL; in other
63
+ * words, a non-NIL list is guaranteed to have length >= 1.
64
+ */
65
+ #define NIL ((List *) NULL)
66
+
67
+ /*
68
+ * State structs for various looping macros below.
69
+ */
70
+ typedef struct ForEachState
71
+ {
72
+ const List *l; /* list we're looping through */
73
+ int i; /* current element index */
74
+ } ForEachState;
75
+
76
+ typedef struct ForBothState
77
+ {
78
+ const List *l1; /* lists we're looping through */
79
+ const List *l2;
80
+ int i; /* common element index */
81
+ } ForBothState;
82
+
83
+ typedef struct ForBothCellState
84
+ {
85
+ const List *l1; /* lists we're looping through */
86
+ const List *l2;
87
+ int i1; /* current element indexes */
88
+ int i2;
89
+ } ForBothCellState;
90
+
91
+ typedef struct ForThreeState
92
+ {
93
+ const List *l1; /* lists we're looping through */
94
+ const List *l2;
95
+ const List *l3;
96
+ int i; /* common element index */
97
+ } ForThreeState;
98
+
99
+ typedef struct ForFourState
100
+ {
101
+ const List *l1; /* lists we're looping through */
102
+ const List *l2;
103
+ const List *l3;
104
+ const List *l4;
105
+ int i; /* common element index */
106
+ } ForFourState;
107
+
108
+ typedef struct ForFiveState
109
+ {
110
+ const List *l1; /* lists we're looping through */
111
+ const List *l2;
112
+ const List *l3;
113
+ const List *l4;
114
+ const List *l5;
115
+ int i; /* common element index */
116
+ } ForFiveState;
117
+
118
+ /*
119
+ * These routines are small enough, and used often enough, to justify being
120
+ * inline.
121
+ */
122
+
123
+ /* Fetch address of list's first cell; NULL if empty list */
124
+ static inline ListCell *
125
+ list_head(const List *l)
126
+ {
127
+ return l ? &l->elements[0] : NULL;
128
+ }
129
+
130
+ /* Fetch address of list's last cell; NULL if empty list */
131
+ static inline ListCell *
132
+ list_tail(const List *l)
133
+ {
134
+ return l ? &l->elements[l->length - 1] : NULL;
135
+ }
136
+
137
+ /* Fetch address of list's second cell, if it has one, else NULL */
138
+ static inline ListCell *
139
+ list_second_cell(const List *l)
140
+ {
141
+ if (l && l->length >= 2)
142
+ return &l->elements[1];
143
+ else
144
+ return NULL;
145
+ }
146
+
147
+ /* Fetch address of list's third cell, if it has one, else NULL */
148
+ static inline ListCell *
149
+ list_third_cell(const List *l)
150
+ {
151
+ if (l && l->length >= 3)
152
+ return &l->elements[2];
153
+ else
154
+ return NULL;
155
+ }
156
+
157
+ /* Fetch address of list's fourth cell, if it has one, else NULL */
158
+ static inline ListCell *
159
+ list_fourth_cell(const List *l)
160
+ {
161
+ if (l && l->length >= 4)
162
+ return &l->elements[3];
163
+ else
164
+ return NULL;
165
+ }
166
+
167
+ /* Fetch list's length */
168
+ static inline int
169
+ list_length(const List *l)
170
+ {
171
+ return l ? l->length : 0;
172
+ }
173
+
174
+ /*
175
+ * Macros to access the data values within List cells.
176
+ *
177
+ * Note that with the exception of the "xxx_node" macros, these are
178
+ * lvalues and can be assigned to.
179
+ *
180
+ * NB: There is an unfortunate legacy from a previous incarnation of
181
+ * the List API: the macro lfirst() was used to mean "the data in this
182
+ * cons cell". To avoid changing every usage of lfirst(), that meaning
183
+ * has been kept. As a result, lfirst() takes a ListCell and returns
184
+ * the data it contains; to get the data in the first cell of a
185
+ * List, use linitial(). Worse, lsecond() is more closely related to
186
+ * linitial() than lfirst(): given a List, lsecond() returns the data
187
+ * in the second list cell.
188
+ */
189
+
190
+ #define lfirst(lc) ((lc)->ptr_value)
191
+ #define lfirst_int(lc) ((lc)->int_value)
192
+ #define lfirst_oid(lc) ((lc)->oid_value)
193
+ #define lfirst_node(type,lc) castNode(type, lfirst(lc))
194
+
195
+ #define linitial(l) lfirst(list_head(l))
196
+ #define linitial_int(l) lfirst_int(list_head(l))
197
+ #define linitial_oid(l) lfirst_oid(list_head(l))
198
+ #define linitial_node(type,l) castNode(type, linitial(l))
199
+
200
+ #define lsecond(l) lfirst(list_second_cell(l))
201
+ #define lsecond_int(l) lfirst_int(list_second_cell(l))
202
+ #define lsecond_oid(l) lfirst_oid(list_second_cell(l))
203
+ #define lsecond_node(type,l) castNode(type, lsecond(l))
204
+
205
+ #define lthird(l) lfirst(list_third_cell(l))
206
+ #define lthird_int(l) lfirst_int(list_third_cell(l))
207
+ #define lthird_oid(l) lfirst_oid(list_third_cell(l))
208
+ #define lthird_node(type,l) castNode(type, lthird(l))
209
+
210
+ #define lfourth(l) lfirst(list_fourth_cell(l))
211
+ #define lfourth_int(l) lfirst_int(list_fourth_cell(l))
212
+ #define lfourth_oid(l) lfirst_oid(list_fourth_cell(l))
213
+ #define lfourth_node(type,l) castNode(type, lfourth(l))
214
+
215
+ #define llast(l) lfirst(list_tail(l))
216
+ #define llast_int(l) lfirst_int(list_tail(l))
217
+ #define llast_oid(l) lfirst_oid(list_tail(l))
218
+ #define llast_node(type,l) castNode(type, llast(l))
219
+
220
+ /*
221
+ * Convenience macros for building fixed-length lists
222
+ */
223
+ #define list_make_ptr_cell(v) ((ListCell) {.ptr_value = (v)})
224
+ #define list_make_int_cell(v) ((ListCell) {.int_value = (v)})
225
+ #define list_make_oid_cell(v) ((ListCell) {.oid_value = (v)})
226
+
227
+ #define list_make1(x1) \
228
+ list_make1_impl(T_List, list_make_ptr_cell(x1))
229
+ #define list_make2(x1,x2) \
230
+ list_make2_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2))
231
+ #define list_make3(x1,x2,x3) \
232
+ list_make3_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2), \
233
+ list_make_ptr_cell(x3))
234
+ #define list_make4(x1,x2,x3,x4) \
235
+ list_make4_impl(T_List, list_make_ptr_cell(x1), list_make_ptr_cell(x2), \
236
+ list_make_ptr_cell(x3), list_make_ptr_cell(x4))
237
+
238
+ #define list_make1_int(x1) \
239
+ list_make1_impl(T_IntList, list_make_int_cell(x1))
240
+ #define list_make2_int(x1,x2) \
241
+ list_make2_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2))
242
+ #define list_make3_int(x1,x2,x3) \
243
+ list_make3_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2), \
244
+ list_make_int_cell(x3))
245
+ #define list_make4_int(x1,x2,x3,x4) \
246
+ list_make4_impl(T_IntList, list_make_int_cell(x1), list_make_int_cell(x2), \
247
+ list_make_int_cell(x3), list_make_int_cell(x4))
248
+
249
+ #define list_make1_oid(x1) \
250
+ list_make1_impl(T_OidList, list_make_oid_cell(x1))
251
+ #define list_make2_oid(x1,x2) \
252
+ list_make2_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2))
253
+ #define list_make3_oid(x1,x2,x3) \
254
+ list_make3_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2), \
255
+ list_make_oid_cell(x3))
256
+ #define list_make4_oid(x1,x2,x3,x4) \
257
+ list_make4_impl(T_OidList, list_make_oid_cell(x1), list_make_oid_cell(x2), \
258
+ list_make_oid_cell(x3), list_make_oid_cell(x4))
259
+
260
+ /*
261
+ * Locate the n'th cell (counting from 0) of the list.
262
+ * It is an assertion failure if there is no such cell.
263
+ */
264
+ static inline ListCell *
265
+ list_nth_cell(const List *list, int n)
266
+ {
267
+ Assert(list != NIL);
268
+ Assert(n >= 0 && n < list->length);
269
+ return &list->elements[n];
270
+ }
271
+
272
+ /*
273
+ * Return the pointer value contained in the n'th element of the
274
+ * specified list. (List elements begin at 0.)
275
+ */
276
+ static inline void *
277
+ list_nth(const List *list, int n)
278
+ {
279
+ Assert(IsA(list, List));
280
+ return lfirst(list_nth_cell(list, n));
281
+ }
282
+
283
+ /*
284
+ * Return the integer value contained in the n'th element of the
285
+ * specified list.
286
+ */
287
+ static inline int
288
+ list_nth_int(const List *list, int n)
289
+ {
290
+ Assert(IsA(list, IntList));
291
+ return lfirst_int(list_nth_cell(list, n));
292
+ }
293
+
294
+ /*
295
+ * Return the OID value contained in the n'th element of the specified
296
+ * list.
297
+ */
298
+ static inline Oid
299
+ list_nth_oid(const List *list, int n)
300
+ {
301
+ Assert(IsA(list, OidList));
302
+ return lfirst_oid(list_nth_cell(list, n));
303
+ }
304
+
305
+ #define list_nth_node(type,list,n) castNode(type, list_nth(list, n))
306
+
307
+ /*
308
+ * Get the given ListCell's index (from 0) in the given List.
309
+ */
310
+ static inline int
311
+ list_cell_number(const List *l, const ListCell *c)
312
+ {
313
+ Assert(c >= &l->elements[0] && c < &l->elements[l->length]);
314
+ return c - l->elements;
315
+ }
316
+
317
+ /*
318
+ * Get the address of the next cell after "c" within list "l", or NULL if none.
319
+ */
320
+ static inline ListCell *
321
+ lnext(const List *l, const ListCell *c)
322
+ {
323
+ Assert(c >= &l->elements[0] && c < &l->elements[l->length]);
324
+ c++;
325
+ if (c < &l->elements[l->length])
326
+ return (ListCell *) c;
327
+ else
328
+ return NULL;
329
+ }
330
+
331
+ /*
332
+ * foreach -
333
+ * a convenience macro for looping through a list
334
+ *
335
+ * "cell" must be the name of a "ListCell *" variable; it's made to point
336
+ * to each List element in turn. "cell" will be NULL after normal exit from
337
+ * the loop, but an early "break" will leave it pointing at the current
338
+ * List element.
339
+ *
340
+ * Beware of changing the List object while the loop is iterating.
341
+ * The current semantics are that we examine successive list indices in
342
+ * each iteration, so that insertion or deletion of list elements could
343
+ * cause elements to be re-visited or skipped unexpectedly. Previous
344
+ * implementations of foreach() behaved differently. However, it's safe
345
+ * to append elements to the List (or in general, insert them after the
346
+ * current element); such new elements are guaranteed to be visited.
347
+ * Also, the current element of the List can be deleted, if you use
348
+ * foreach_delete_current() to do so. BUT: either of these actions will
349
+ * invalidate the "cell" pointer for the remainder of the current iteration.
350
+ */
351
+ #define foreach(cell, lst) \
352
+ for (ForEachState cell##__state = {(lst), 0}; \
353
+ (cell##__state.l != NIL && \
354
+ cell##__state.i < cell##__state.l->length) ? \
355
+ (cell = &cell##__state.l->elements[cell##__state.i], true) : \
356
+ (cell = NULL, false); \
357
+ cell##__state.i++)
358
+
359
+ /*
360
+ * foreach_delete_current -
361
+ * delete the current list element from the List associated with a
362
+ * surrounding foreach() loop, returning the new List pointer.
363
+ *
364
+ * This is equivalent to list_delete_cell(), but it also adjusts the foreach
365
+ * loop's state so that no list elements will be missed. Do not delete
366
+ * elements from an active foreach loop's list in any other way!
367
+ */
368
+ #define foreach_delete_current(lst, cell) \
369
+ (cell##__state.i--, \
370
+ (List *) (cell##__state.l = list_delete_cell(lst, cell)))
371
+
372
+ /*
373
+ * foreach_current_index -
374
+ * get the zero-based list index of a surrounding foreach() loop's
375
+ * current element; pass the name of the "ListCell *" iterator variable.
376
+ *
377
+ * Beware of using this after foreach_delete_current(); the value will be
378
+ * out of sync for the rest of the current loop iteration. Anyway, since
379
+ * you just deleted the current element, the value is pretty meaningless.
380
+ */
381
+ #define foreach_current_index(cell) (cell##__state.i)
382
+
383
+ /*
384
+ * for_each_from -
385
+ * Like foreach(), but start from the N'th (zero-based) list element,
386
+ * not necessarily the first one.
387
+ *
388
+ * It's okay for N to exceed the list length, but not for it to be negative.
389
+ *
390
+ * The caveats for foreach() apply equally here.
391
+ */
392
+ #define for_each_from(cell, lst, N) \
393
+ for (ForEachState cell##__state = for_each_from_setup(lst, N); \
394
+ (cell##__state.l != NIL && \
395
+ cell##__state.i < cell##__state.l->length) ? \
396
+ (cell = &cell##__state.l->elements[cell##__state.i], true) : \
397
+ (cell = NULL, false); \
398
+ cell##__state.i++)
399
+
400
+ static inline ForEachState
401
+ for_each_from_setup(const List *lst, int N)
402
+ {
403
+ ForEachState r = {lst, N};
404
+
405
+ Assert(N >= 0);
406
+ return r;
407
+ }
408
+
409
+ /*
410
+ * for_each_cell -
411
+ * a convenience macro which loops through a list starting from a
412
+ * specified cell
413
+ *
414
+ * The caveats for foreach() apply equally here.
415
+ */
416
+ #define for_each_cell(cell, lst, initcell) \
417
+ for (ForEachState cell##__state = for_each_cell_setup(lst, initcell); \
418
+ (cell##__state.l != NIL && \
419
+ cell##__state.i < cell##__state.l->length) ? \
420
+ (cell = &cell##__state.l->elements[cell##__state.i], true) : \
421
+ (cell = NULL, false); \
422
+ cell##__state.i++)
423
+
424
+ static inline ForEachState
425
+ for_each_cell_setup(const List *lst, const ListCell *initcell)
426
+ {
427
+ ForEachState r = {lst,
428
+ initcell ? list_cell_number(lst, initcell) : list_length(lst)};
429
+
430
+ return r;
431
+ }
432
+
433
+ /*
434
+ * forboth -
435
+ * a convenience macro for advancing through two linked lists
436
+ * simultaneously. This macro loops through both lists at the same
437
+ * time, stopping when either list runs out of elements. Depending
438
+ * on the requirements of the call site, it may also be wise to
439
+ * assert that the lengths of the two lists are equal. (But, if they
440
+ * are not, some callers rely on the ending cell values being separately
441
+ * NULL or non-NULL as defined here; don't try to optimize that.)
442
+ *
443
+ * The caveats for foreach() apply equally here.
444
+ */
445
+ #define forboth(cell1, list1, cell2, list2) \
446
+ for (ForBothState cell1##__state = {(list1), (list2), 0}; \
447
+ multi_for_advance_cell(cell1, cell1##__state, l1, i), \
448
+ multi_for_advance_cell(cell2, cell1##__state, l2, i), \
449
+ (cell1 != NULL && cell2 != NULL); \
450
+ cell1##__state.i++)
451
+
452
+ #define multi_for_advance_cell(cell, state, l, i) \
453
+ (cell = (state.l != NIL && state.i < state.l->length) ? \
454
+ &state.l->elements[state.i] : NULL)
455
+
456
+ /*
457
+ * for_both_cell -
458
+ * a convenience macro which loops through two lists starting from the
459
+ * specified cells of each. This macro loops through both lists at the same
460
+ * time, stopping when either list runs out of elements. Depending on the
461
+ * requirements of the call site, it may also be wise to assert that the
462
+ * lengths of the two lists are equal, and initcell1 and initcell2 are at
463
+ * the same position in the respective lists.
464
+ *
465
+ * The caveats for foreach() apply equally here.
466
+ */
467
+ #define for_both_cell(cell1, list1, initcell1, cell2, list2, initcell2) \
468
+ for (ForBothCellState cell1##__state = \
469
+ for_both_cell_setup(list1, initcell1, list2, initcell2); \
470
+ multi_for_advance_cell(cell1, cell1##__state, l1, i1), \
471
+ multi_for_advance_cell(cell2, cell1##__state, l2, i2), \
472
+ (cell1 != NULL && cell2 != NULL); \
473
+ cell1##__state.i1++, cell1##__state.i2++)
474
+
475
+ static inline ForBothCellState
476
+ for_both_cell_setup(const List *list1, const ListCell *initcell1,
477
+ const List *list2, const ListCell *initcell2)
478
+ {
479
+ ForBothCellState r = {list1, list2,
480
+ initcell1 ? list_cell_number(list1, initcell1) : list_length(list1),
481
+ initcell2 ? list_cell_number(list2, initcell2) : list_length(list2)};
482
+
483
+ return r;
484
+ }
485
+
486
+ /*
487
+ * forthree -
488
+ * the same for three lists
489
+ */
490
+ #define forthree(cell1, list1, cell2, list2, cell3, list3) \
491
+ for (ForThreeState cell1##__state = {(list1), (list2), (list3), 0}; \
492
+ multi_for_advance_cell(cell1, cell1##__state, l1, i), \
493
+ multi_for_advance_cell(cell2, cell1##__state, l2, i), \
494
+ multi_for_advance_cell(cell3, cell1##__state, l3, i), \
495
+ (cell1 != NULL && cell2 != NULL && cell3 != NULL); \
496
+ cell1##__state.i++)
497
+
498
+ /*
499
+ * forfour -
500
+ * the same for four lists
501
+ */
502
+ #define forfour(cell1, list1, cell2, list2, cell3, list3, cell4, list4) \
503
+ for (ForFourState cell1##__state = {(list1), (list2), (list3), (list4), 0}; \
504
+ multi_for_advance_cell(cell1, cell1##__state, l1, i), \
505
+ multi_for_advance_cell(cell2, cell1##__state, l2, i), \
506
+ multi_for_advance_cell(cell3, cell1##__state, l3, i), \
507
+ multi_for_advance_cell(cell4, cell1##__state, l4, i), \
508
+ (cell1 != NULL && cell2 != NULL && cell3 != NULL && cell4 != NULL); \
509
+ cell1##__state.i++)
510
+
511
+ /*
512
+ * forfive -
513
+ * the same for five lists
514
+ */
515
+ #define forfive(cell1, list1, cell2, list2, cell3, list3, cell4, list4, cell5, list5) \
516
+ for (ForFiveState cell1##__state = {(list1), (list2), (list3), (list4), (list5), 0}; \
517
+ multi_for_advance_cell(cell1, cell1##__state, l1, i), \
518
+ multi_for_advance_cell(cell2, cell1##__state, l2, i), \
519
+ multi_for_advance_cell(cell3, cell1##__state, l3, i), \
520
+ multi_for_advance_cell(cell4, cell1##__state, l4, i), \
521
+ multi_for_advance_cell(cell5, cell1##__state, l5, i), \
522
+ (cell1 != NULL && cell2 != NULL && cell3 != NULL && \
523
+ cell4 != NULL && cell5 != NULL); \
524
+ cell1##__state.i++)
525
+
526
+ /* Functions in src/backend/nodes/list.c */
527
+
528
+ extern List *list_make1_impl(NodeTag t, ListCell datum1);
529
+ extern List *list_make2_impl(NodeTag t, ListCell datum1, ListCell datum2);
530
+ extern List *list_make3_impl(NodeTag t, ListCell datum1, ListCell datum2,
531
+ ListCell datum3);
532
+ extern List *list_make4_impl(NodeTag t, ListCell datum1, ListCell datum2,
533
+ ListCell datum3, ListCell datum4);
534
+
535
+ extern List *lappend(List *list, void *datum);
536
+ extern List *lappend_int(List *list, int datum);
537
+ extern List *lappend_oid(List *list, Oid datum);
538
+
539
+ extern List *list_insert_nth(List *list, int pos, void *datum);
540
+ extern List *list_insert_nth_int(List *list, int pos, int datum);
541
+ extern List *list_insert_nth_oid(List *list, int pos, Oid datum);
542
+
543
+ extern List *lcons(void *datum, List *list);
544
+ extern List *lcons_int(int datum, List *list);
545
+ extern List *lcons_oid(Oid datum, List *list);
546
+
547
+ extern List *list_concat(List *list1, const List *list2);
548
+ extern List *list_concat_copy(const List *list1, const List *list2);
549
+
550
+ extern List *list_truncate(List *list, int new_size);
551
+
552
+ extern bool list_member(const List *list, const void *datum);
553
+ extern bool list_member_ptr(const List *list, const void *datum);
554
+ extern bool list_member_int(const List *list, int datum);
555
+ extern bool list_member_oid(const List *list, Oid datum);
556
+
557
+ extern List *list_delete(List *list, void *datum);
558
+ extern List *list_delete_ptr(List *list, void *datum);
559
+ extern List *list_delete_int(List *list, int datum);
560
+ extern List *list_delete_oid(List *list, Oid datum);
561
+ extern List *list_delete_first(List *list);
562
+ extern List *list_delete_last(List *list);
563
+ extern List *list_delete_nth_cell(List *list, int n);
564
+ extern List *list_delete_cell(List *list, ListCell *cell);
565
+
566
+ extern List *list_union(const List *list1, const List *list2);
567
+ extern List *list_union_ptr(const List *list1, const List *list2);
568
+ extern List *list_union_int(const List *list1, const List *list2);
569
+ extern List *list_union_oid(const List *list1, const List *list2);
570
+
571
+ extern List *list_intersection(const List *list1, const List *list2);
572
+ extern List *list_intersection_int(const List *list1, const List *list2);
573
+
574
+ /* currently, there's no need for list_intersection_ptr etc */
575
+
576
+ extern List *list_difference(const List *list1, const List *list2);
577
+ extern List *list_difference_ptr(const List *list1, const List *list2);
578
+ extern List *list_difference_int(const List *list1, const List *list2);
579
+ extern List *list_difference_oid(const List *list1, const List *list2);
580
+
581
+ extern List *list_append_unique(List *list, void *datum);
582
+ extern List *list_append_unique_ptr(List *list, void *datum);
583
+ extern List *list_append_unique_int(List *list, int datum);
584
+ extern List *list_append_unique_oid(List *list, Oid datum);
585
+
586
+ extern List *list_concat_unique(List *list1, const List *list2);
587
+ extern List *list_concat_unique_ptr(List *list1, const List *list2);
588
+ extern List *list_concat_unique_int(List *list1, const List *list2);
589
+ extern List *list_concat_unique_oid(List *list1, const List *list2);
590
+
591
+ extern void list_deduplicate_oid(List *list);
592
+
593
+ extern void list_free(List *list);
594
+ extern void list_free_deep(List *list);
595
+
596
+ extern List *list_copy(const List *list);
597
+ extern List *list_copy_tail(const List *list, int nskip);
598
+ extern List *list_copy_deep(const List *oldlist);
599
+
600
+ typedef int (*list_sort_comparator) (const ListCell *a, const ListCell *b);
601
+ extern void list_sort(List *list, list_sort_comparator cmp);
602
+
603
+ extern int list_oid_cmp(const ListCell *p1, const ListCell *p2);
604
+
605
+ #endif /* PG_LIST_H */