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,727 @@
1
+ /*-------------------------------------------------------------------------
2
+ *
3
+ * ilist.h
4
+ * integrated/inline doubly- and singly-linked lists
5
+ *
6
+ * These list types are useful when there are only a predetermined set of
7
+ * lists that an object could be in. List links are embedded directly into
8
+ * the objects, and thus no extra memory management overhead is required.
9
+ * (Of course, if only a small proportion of existing objects are in a list,
10
+ * the link fields in the remainder would be wasted space. But usually,
11
+ * it saves space to not have separately-allocated list nodes.)
12
+ *
13
+ * None of the functions here allocate any memory; they just manipulate
14
+ * externally managed memory. The APIs for singly and doubly linked lists
15
+ * are identical as far as capabilities of both allow.
16
+ *
17
+ * Each list has a list header, which exists even when the list is empty.
18
+ * An empty singly-linked list has a NULL pointer in its header.
19
+ * There are two kinds of empty doubly linked lists: those that have been
20
+ * initialized to NULL, and those that have been initialized to circularity.
21
+ * (If a dlist is modified and then all its elements are deleted, it will be
22
+ * in the circular state.) We prefer circular dlists because there are some
23
+ * operations that can be done without branches (and thus faster) on lists
24
+ * that use circular representation. However, it is often convenient to
25
+ * initialize list headers to zeroes rather than setting them up with an
26
+ * explicit initialization function, so we also allow the other case.
27
+ *
28
+ * EXAMPLES
29
+ *
30
+ * Here's a simple example demonstrating how this can be used. Let's assume
31
+ * we want to store information about the tables contained in a database.
32
+ *
33
+ * #include "lib/ilist.h"
34
+ *
35
+ * // Define struct for the databases including a list header that will be
36
+ * // used to access the nodes in the table list later on.
37
+ * typedef struct my_database
38
+ * {
39
+ * char *datname;
40
+ * dlist_head tables;
41
+ * // ...
42
+ * } my_database;
43
+ *
44
+ * // Define struct for the tables. Note the list_node element which stores
45
+ * // prev/next list links. The list_node element need not be first.
46
+ * typedef struct my_table
47
+ * {
48
+ * char *tablename;
49
+ * dlist_node list_node;
50
+ * perm_t permissions;
51
+ * // ...
52
+ * } my_table;
53
+ *
54
+ * // create a database
55
+ * my_database *db = create_database();
56
+ *
57
+ * // and add a few tables to its table list
58
+ * dlist_push_head(&db->tables, &create_table(db, "a")->list_node);
59
+ * ...
60
+ * dlist_push_head(&db->tables, &create_table(db, "b")->list_node);
61
+ *
62
+ *
63
+ * To iterate over the table list, we allocate an iterator variable and use
64
+ * a specialized looping construct. Inside a dlist_foreach, the iterator's
65
+ * 'cur' field can be used to access the current element. iter.cur points to
66
+ * a 'dlist_node', but most of the time what we want is the actual table
67
+ * information; dlist_container() gives us that, like so:
68
+ *
69
+ * dlist_iter iter;
70
+ * dlist_foreach(iter, &db->tables)
71
+ * {
72
+ * my_table *tbl = dlist_container(my_table, list_node, iter.cur);
73
+ * printf("we have a table: %s in database %s\n",
74
+ * tbl->tablename, db->datname);
75
+ * }
76
+ *
77
+ *
78
+ * While a simple iteration is useful, we sometimes also want to manipulate
79
+ * the list while iterating. There is a different iterator element and looping
80
+ * construct for that. Suppose we want to delete tables that meet a certain
81
+ * criterion:
82
+ *
83
+ * dlist_mutable_iter miter;
84
+ * dlist_foreach_modify(miter, &db->tables)
85
+ * {
86
+ * my_table *tbl = dlist_container(my_table, list_node, miter.cur);
87
+ *
88
+ * if (!tbl->to_be_deleted)
89
+ * continue; // don't touch this one
90
+ *
91
+ * // unlink the current table from the linked list
92
+ * dlist_delete(miter.cur);
93
+ * // as these lists never manage memory, we can still access the table
94
+ * // after it's been unlinked
95
+ * drop_table(db, tbl);
96
+ * }
97
+ *
98
+ *
99
+ * Portions Copyright (c) 1996-2020, PostgreSQL Global Development Group
100
+ * Portions Copyright (c) 1994, Regents of the University of California
101
+ *
102
+ * IDENTIFICATION
103
+ * src/include/lib/ilist.h
104
+ *-------------------------------------------------------------------------
105
+ */
106
+ #ifndef ILIST_H
107
+ #define ILIST_H
108
+
109
+ /*
110
+ * Enable for extra debugging. This is rather expensive, so it's not enabled by
111
+ * default even when USE_ASSERT_CHECKING.
112
+ */
113
+ /* #define ILIST_DEBUG */
114
+
115
+ /*
116
+ * Node of a doubly linked list.
117
+ *
118
+ * Embed this in structs that need to be part of a doubly linked list.
119
+ */
120
+ typedef struct dlist_node dlist_node;
121
+ struct dlist_node
122
+ {
123
+ dlist_node *prev;
124
+ dlist_node *next;
125
+ };
126
+
127
+ /*
128
+ * Head of a doubly linked list.
129
+ *
130
+ * Non-empty lists are internally circularly linked. Circular lists have the
131
+ * advantage of not needing any branches in the most common list manipulations.
132
+ * An empty list can also be represented as a pair of NULL pointers, making
133
+ * initialization easier.
134
+ */
135
+ typedef struct dlist_head
136
+ {
137
+ /*
138
+ * head.next either points to the first element of the list; to &head if
139
+ * it's a circular empty list; or to NULL if empty and not circular.
140
+ *
141
+ * head.prev either points to the last element of the list; to &head if
142
+ * it's a circular empty list; or to NULL if empty and not circular.
143
+ */
144
+ dlist_node head;
145
+ } dlist_head;
146
+
147
+
148
+ /*
149
+ * Doubly linked list iterator.
150
+ *
151
+ * Used as state in dlist_foreach() and dlist_reverse_foreach(). To get the
152
+ * current element of the iteration use the 'cur' member.
153
+ *
154
+ * Iterations using this are *not* allowed to change the list while iterating!
155
+ *
156
+ * NB: We use an extra "end" field here to avoid multiple evaluations of
157
+ * arguments in the dlist_foreach() macro.
158
+ */
159
+ typedef struct dlist_iter
160
+ {
161
+ dlist_node *cur; /* current element */
162
+ dlist_node *end; /* last node we'll iterate to */
163
+ } dlist_iter;
164
+
165
+ /*
166
+ * Doubly linked list iterator allowing some modifications while iterating.
167
+ *
168
+ * Used as state in dlist_foreach_modify(). To get the current element of the
169
+ * iteration use the 'cur' member.
170
+ *
171
+ * Iterations using this are only allowed to change the list at the current
172
+ * point of iteration. It is fine to delete the current node, but it is *not*
173
+ * fine to insert or delete adjacent nodes.
174
+ *
175
+ * NB: We need a separate type for mutable iterations so that we can store
176
+ * the 'next' node of the current node in case it gets deleted or modified.
177
+ */
178
+ typedef struct dlist_mutable_iter
179
+ {
180
+ dlist_node *cur; /* current element */
181
+ dlist_node *next; /* next node we'll iterate to */
182
+ dlist_node *end; /* last node we'll iterate to */
183
+ } dlist_mutable_iter;
184
+
185
+ /*
186
+ * Node of a singly linked list.
187
+ *
188
+ * Embed this in structs that need to be part of a singly linked list.
189
+ */
190
+ typedef struct slist_node slist_node;
191
+ struct slist_node
192
+ {
193
+ slist_node *next;
194
+ };
195
+
196
+ /*
197
+ * Head of a singly linked list.
198
+ *
199
+ * Singly linked lists are not circularly linked, in contrast to doubly linked
200
+ * lists; we just set head.next to NULL if empty. This doesn't incur any
201
+ * additional branches in the usual manipulations.
202
+ */
203
+ typedef struct slist_head
204
+ {
205
+ slist_node head;
206
+ } slist_head;
207
+
208
+ /*
209
+ * Singly linked list iterator.
210
+ *
211
+ * Used as state in slist_foreach(). To get the current element of the
212
+ * iteration use the 'cur' member.
213
+ *
214
+ * It's allowed to modify the list while iterating, with the exception of
215
+ * deleting the iterator's current node; deletion of that node requires
216
+ * care if the iteration is to be continued afterward. (Doing so and also
217
+ * deleting or inserting adjacent list elements might misbehave; also, if
218
+ * the user frees the current node's storage, continuing the iteration is
219
+ * not safe.)
220
+ *
221
+ * NB: this wouldn't really need to be an extra struct, we could use an
222
+ * slist_node * directly. We prefer a separate type for consistency.
223
+ */
224
+ typedef struct slist_iter
225
+ {
226
+ slist_node *cur;
227
+ } slist_iter;
228
+
229
+ /*
230
+ * Singly linked list iterator allowing some modifications while iterating.
231
+ *
232
+ * Used as state in slist_foreach_modify(). To get the current element of the
233
+ * iteration use the 'cur' member.
234
+ *
235
+ * The only list modification allowed while iterating is to remove the current
236
+ * node via slist_delete_current() (*not* slist_delete()). Insertion or
237
+ * deletion of nodes adjacent to the current node would misbehave.
238
+ */
239
+ typedef struct slist_mutable_iter
240
+ {
241
+ slist_node *cur; /* current element */
242
+ slist_node *next; /* next node we'll iterate to */
243
+ slist_node *prev; /* prev node, for deletions */
244
+ } slist_mutable_iter;
245
+
246
+
247
+ /* Static initializers */
248
+ #define DLIST_STATIC_INIT(name) {{&(name).head, &(name).head}}
249
+ #define SLIST_STATIC_INIT(name) {{NULL}}
250
+
251
+
252
+ /* Prototypes for functions too big to be inline */
253
+
254
+ /* Caution: this is O(n); consider using slist_delete_current() instead */
255
+ extern void slist_delete(slist_head *head, slist_node *node);
256
+
257
+ #ifdef ILIST_DEBUG
258
+ extern void dlist_check(dlist_head *head);
259
+ extern void slist_check(slist_head *head);
260
+ #else
261
+ /*
262
+ * These seemingly useless casts to void are here to keep the compiler quiet
263
+ * about the argument being unused in many functions in a non-debug compile,
264
+ * in which functions the only point of passing the list head pointer is to be
265
+ * able to run these checks.
266
+ */
267
+ #define dlist_check(head) ((void) (head))
268
+ #define slist_check(head) ((void) (head))
269
+ #endif /* ILIST_DEBUG */
270
+
271
+ /* doubly linked list implementation */
272
+
273
+ /*
274
+ * Initialize a doubly linked list.
275
+ * Previous state will be thrown away without any cleanup.
276
+ */
277
+ static inline void
278
+ dlist_init(dlist_head *head)
279
+ {
280
+ head->head.next = head->head.prev = &head->head;
281
+ }
282
+
283
+ /*
284
+ * Is the list empty?
285
+ *
286
+ * An empty list has either its first 'next' pointer set to NULL, or to itself.
287
+ */
288
+ static inline bool
289
+ dlist_is_empty(dlist_head *head)
290
+ {
291
+ dlist_check(head);
292
+
293
+ return head->head.next == NULL || head->head.next == &(head->head);
294
+ }
295
+
296
+ /*
297
+ * Insert a node at the beginning of the list.
298
+ */
299
+ static inline void
300
+ dlist_push_head(dlist_head *head, dlist_node *node)
301
+ {
302
+ if (head->head.next == NULL) /* convert NULL header to circular */
303
+ dlist_init(head);
304
+
305
+ node->next = head->head.next;
306
+ node->prev = &head->head;
307
+ node->next->prev = node;
308
+ head->head.next = node;
309
+
310
+ dlist_check(head);
311
+ }
312
+
313
+ /*
314
+ * Insert a node at the end of the list.
315
+ */
316
+ static inline void
317
+ dlist_push_tail(dlist_head *head, dlist_node *node)
318
+ {
319
+ if (head->head.next == NULL) /* convert NULL header to circular */
320
+ dlist_init(head);
321
+
322
+ node->next = &head->head;
323
+ node->prev = head->head.prev;
324
+ node->prev->next = node;
325
+ head->head.prev = node;
326
+
327
+ dlist_check(head);
328
+ }
329
+
330
+ /*
331
+ * Insert a node after another *in the same list*
332
+ */
333
+ static inline void
334
+ dlist_insert_after(dlist_node *after, dlist_node *node)
335
+ {
336
+ node->prev = after;
337
+ node->next = after->next;
338
+ after->next = node;
339
+ node->next->prev = node;
340
+ }
341
+
342
+ /*
343
+ * Insert a node before another *in the same list*
344
+ */
345
+ static inline void
346
+ dlist_insert_before(dlist_node *before, dlist_node *node)
347
+ {
348
+ node->prev = before->prev;
349
+ node->next = before;
350
+ before->prev = node;
351
+ node->prev->next = node;
352
+ }
353
+
354
+ /*
355
+ * Delete 'node' from its list (it must be in one).
356
+ */
357
+ static inline void
358
+ dlist_delete(dlist_node *node)
359
+ {
360
+ node->prev->next = node->next;
361
+ node->next->prev = node->prev;
362
+ }
363
+
364
+ /*
365
+ * Remove and return the first node from a list (there must be one).
366
+ */
367
+ static inline dlist_node *
368
+ dlist_pop_head_node(dlist_head *head)
369
+ {
370
+ dlist_node *node;
371
+
372
+ Assert(!dlist_is_empty(head));
373
+ node = head->head.next;
374
+ dlist_delete(node);
375
+ return node;
376
+ }
377
+
378
+ /*
379
+ * Move element from its current position in the list to the head position in
380
+ * the same list.
381
+ *
382
+ * Undefined behaviour if 'node' is not already part of the list.
383
+ */
384
+ static inline void
385
+ dlist_move_head(dlist_head *head, dlist_node *node)
386
+ {
387
+ /* fast path if it's already at the head */
388
+ if (head->head.next == node)
389
+ return;
390
+
391
+ dlist_delete(node);
392
+ dlist_push_head(head, node);
393
+
394
+ dlist_check(head);
395
+ }
396
+
397
+ /*
398
+ * Check whether 'node' has a following node.
399
+ * Caution: unreliable if 'node' is not in the list.
400
+ */
401
+ static inline bool
402
+ dlist_has_next(dlist_head *head, dlist_node *node)
403
+ {
404
+ return node->next != &head->head;
405
+ }
406
+
407
+ /*
408
+ * Check whether 'node' has a preceding node.
409
+ * Caution: unreliable if 'node' is not in the list.
410
+ */
411
+ static inline bool
412
+ dlist_has_prev(dlist_head *head, dlist_node *node)
413
+ {
414
+ return node->prev != &head->head;
415
+ }
416
+
417
+ /*
418
+ * Return the next node in the list (there must be one).
419
+ */
420
+ static inline dlist_node *
421
+ dlist_next_node(dlist_head *head, dlist_node *node)
422
+ {
423
+ Assert(dlist_has_next(head, node));
424
+ return node->next;
425
+ }
426
+
427
+ /*
428
+ * Return previous node in the list (there must be one).
429
+ */
430
+ static inline dlist_node *
431
+ dlist_prev_node(dlist_head *head, dlist_node *node)
432
+ {
433
+ Assert(dlist_has_prev(head, node));
434
+ return node->prev;
435
+ }
436
+
437
+ /* internal support function to get address of head element's struct */
438
+ static inline void *
439
+ dlist_head_element_off(dlist_head *head, size_t off)
440
+ {
441
+ Assert(!dlist_is_empty(head));
442
+ return (char *) head->head.next - off;
443
+ }
444
+
445
+ /*
446
+ * Return the first node in the list (there must be one).
447
+ */
448
+ static inline dlist_node *
449
+ dlist_head_node(dlist_head *head)
450
+ {
451
+ return (dlist_node *) dlist_head_element_off(head, 0);
452
+ }
453
+
454
+ /* internal support function to get address of tail element's struct */
455
+ static inline void *
456
+ dlist_tail_element_off(dlist_head *head, size_t off)
457
+ {
458
+ Assert(!dlist_is_empty(head));
459
+ return (char *) head->head.prev - off;
460
+ }
461
+
462
+ /*
463
+ * Return the last node in the list (there must be one).
464
+ */
465
+ static inline dlist_node *
466
+ dlist_tail_node(dlist_head *head)
467
+ {
468
+ return (dlist_node *) dlist_tail_element_off(head, 0);
469
+ }
470
+
471
+ /*
472
+ * Return the containing struct of 'type' where 'membername' is the dlist_node
473
+ * pointed at by 'ptr'.
474
+ *
475
+ * This is used to convert a dlist_node * back to its containing struct.
476
+ */
477
+ #define dlist_container(type, membername, ptr) \
478
+ (AssertVariableIsOfTypeMacro(ptr, dlist_node *), \
479
+ AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node), \
480
+ ((type *) ((char *) (ptr) - offsetof(type, membername))))
481
+
482
+ /*
483
+ * Return the address of the first element in the list.
484
+ *
485
+ * The list must not be empty.
486
+ */
487
+ #define dlist_head_element(type, membername, lhead) \
488
+ (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node), \
489
+ (type *) dlist_head_element_off(lhead, offsetof(type, membername)))
490
+
491
+ /*
492
+ * Return the address of the last element in the list.
493
+ *
494
+ * The list must not be empty.
495
+ */
496
+ #define dlist_tail_element(type, membername, lhead) \
497
+ (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, dlist_node), \
498
+ ((type *) dlist_tail_element_off(lhead, offsetof(type, membername))))
499
+
500
+ /*
501
+ * Iterate through the list pointed at by 'lhead' storing the state in 'iter'.
502
+ *
503
+ * Access the current element with iter.cur.
504
+ *
505
+ * It is *not* allowed to manipulate the list during iteration.
506
+ */
507
+ #define dlist_foreach(iter, lhead) \
508
+ for (AssertVariableIsOfTypeMacro(iter, dlist_iter), \
509
+ AssertVariableIsOfTypeMacro(lhead, dlist_head *), \
510
+ (iter).end = &(lhead)->head, \
511
+ (iter).cur = (iter).end->next ? (iter).end->next : (iter).end; \
512
+ (iter).cur != (iter).end; \
513
+ (iter).cur = (iter).cur->next)
514
+
515
+ /*
516
+ * Iterate through the list pointed at by 'lhead' storing the state in 'iter'.
517
+ *
518
+ * Access the current element with iter.cur.
519
+ *
520
+ * Iterations using this are only allowed to change the list at the current
521
+ * point of iteration. It is fine to delete the current node, but it is *not*
522
+ * fine to insert or delete adjacent nodes.
523
+ */
524
+ #define dlist_foreach_modify(iter, lhead) \
525
+ for (AssertVariableIsOfTypeMacro(iter, dlist_mutable_iter), \
526
+ AssertVariableIsOfTypeMacro(lhead, dlist_head *), \
527
+ (iter).end = &(lhead)->head, \
528
+ (iter).cur = (iter).end->next ? (iter).end->next : (iter).end, \
529
+ (iter).next = (iter).cur->next; \
530
+ (iter).cur != (iter).end; \
531
+ (iter).cur = (iter).next, (iter).next = (iter).cur->next)
532
+
533
+ /*
534
+ * Iterate through the list in reverse order.
535
+ *
536
+ * It is *not* allowed to manipulate the list during iteration.
537
+ */
538
+ #define dlist_reverse_foreach(iter, lhead) \
539
+ for (AssertVariableIsOfTypeMacro(iter, dlist_iter), \
540
+ AssertVariableIsOfTypeMacro(lhead, dlist_head *), \
541
+ (iter).end = &(lhead)->head, \
542
+ (iter).cur = (iter).end->prev ? (iter).end->prev : (iter).end; \
543
+ (iter).cur != (iter).end; \
544
+ (iter).cur = (iter).cur->prev)
545
+
546
+
547
+ /* singly linked list implementation */
548
+
549
+ /*
550
+ * Initialize a singly linked list.
551
+ * Previous state will be thrown away without any cleanup.
552
+ */
553
+ static inline void
554
+ slist_init(slist_head *head)
555
+ {
556
+ head->head.next = NULL;
557
+ }
558
+
559
+ /*
560
+ * Is the list empty?
561
+ */
562
+ static inline bool
563
+ slist_is_empty(slist_head *head)
564
+ {
565
+ slist_check(head);
566
+
567
+ return head->head.next == NULL;
568
+ }
569
+
570
+ /*
571
+ * Insert a node at the beginning of the list.
572
+ */
573
+ static inline void
574
+ slist_push_head(slist_head *head, slist_node *node)
575
+ {
576
+ node->next = head->head.next;
577
+ head->head.next = node;
578
+
579
+ slist_check(head);
580
+ }
581
+
582
+ /*
583
+ * Insert a node after another *in the same list*
584
+ */
585
+ static inline void
586
+ slist_insert_after(slist_node *after, slist_node *node)
587
+ {
588
+ node->next = after->next;
589
+ after->next = node;
590
+ }
591
+
592
+ /*
593
+ * Remove and return the first node from a list (there must be one).
594
+ */
595
+ static inline slist_node *
596
+ slist_pop_head_node(slist_head *head)
597
+ {
598
+ slist_node *node;
599
+
600
+ Assert(!slist_is_empty(head));
601
+ node = head->head.next;
602
+ head->head.next = node->next;
603
+ slist_check(head);
604
+ return node;
605
+ }
606
+
607
+ /*
608
+ * Check whether 'node' has a following node.
609
+ */
610
+ static inline bool
611
+ slist_has_next(slist_head *head, slist_node *node)
612
+ {
613
+ slist_check(head);
614
+
615
+ return node->next != NULL;
616
+ }
617
+
618
+ /*
619
+ * Return the next node in the list (there must be one).
620
+ */
621
+ static inline slist_node *
622
+ slist_next_node(slist_head *head, slist_node *node)
623
+ {
624
+ Assert(slist_has_next(head, node));
625
+ return node->next;
626
+ }
627
+
628
+ /* internal support function to get address of head element's struct */
629
+ static inline void *
630
+ slist_head_element_off(slist_head *head, size_t off)
631
+ {
632
+ Assert(!slist_is_empty(head));
633
+ return (char *) head->head.next - off;
634
+ }
635
+
636
+ /*
637
+ * Return the first node in the list (there must be one).
638
+ */
639
+ static inline slist_node *
640
+ slist_head_node(slist_head *head)
641
+ {
642
+ return (slist_node *) slist_head_element_off(head, 0);
643
+ }
644
+
645
+ /*
646
+ * Delete the list element the iterator currently points to.
647
+ *
648
+ * Caution: this modifies iter->cur, so don't use that again in the current
649
+ * loop iteration.
650
+ */
651
+ static inline void
652
+ slist_delete_current(slist_mutable_iter *iter)
653
+ {
654
+ /*
655
+ * Update previous element's forward link. If the iteration is at the
656
+ * first list element, iter->prev will point to the list header's "head"
657
+ * field, so we don't need a special case for that.
658
+ */
659
+ iter->prev->next = iter->next;
660
+
661
+ /*
662
+ * Reset cur to prev, so that prev will continue to point to the prior
663
+ * valid list element after slist_foreach_modify() advances to the next.
664
+ */
665
+ iter->cur = iter->prev;
666
+ }
667
+
668
+ /*
669
+ * Return the containing struct of 'type' where 'membername' is the slist_node
670
+ * pointed at by 'ptr'.
671
+ *
672
+ * This is used to convert a slist_node * back to its containing struct.
673
+ */
674
+ #define slist_container(type, membername, ptr) \
675
+ (AssertVariableIsOfTypeMacro(ptr, slist_node *), \
676
+ AssertVariableIsOfTypeMacro(((type *) NULL)->membername, slist_node), \
677
+ ((type *) ((char *) (ptr) - offsetof(type, membername))))
678
+
679
+ /*
680
+ * Return the address of the first element in the list.
681
+ *
682
+ * The list must not be empty.
683
+ */
684
+ #define slist_head_element(type, membername, lhead) \
685
+ (AssertVariableIsOfTypeMacro(((type *) NULL)->membername, slist_node), \
686
+ (type *) slist_head_element_off(lhead, offsetof(type, membername)))
687
+
688
+ /*
689
+ * Iterate through the list pointed at by 'lhead' storing the state in 'iter'.
690
+ *
691
+ * Access the current element with iter.cur.
692
+ *
693
+ * It's allowed to modify the list while iterating, with the exception of
694
+ * deleting the iterator's current node; deletion of that node requires
695
+ * care if the iteration is to be continued afterward. (Doing so and also
696
+ * deleting or inserting adjacent list elements might misbehave; also, if
697
+ * the user frees the current node's storage, continuing the iteration is
698
+ * not safe.)
699
+ */
700
+ #define slist_foreach(iter, lhead) \
701
+ for (AssertVariableIsOfTypeMacro(iter, slist_iter), \
702
+ AssertVariableIsOfTypeMacro(lhead, slist_head *), \
703
+ (iter).cur = (lhead)->head.next; \
704
+ (iter).cur != NULL; \
705
+ (iter).cur = (iter).cur->next)
706
+
707
+ /*
708
+ * Iterate through the list pointed at by 'lhead' storing the state in 'iter'.
709
+ *
710
+ * Access the current element with iter.cur.
711
+ *
712
+ * The only list modification allowed while iterating is to remove the current
713
+ * node via slist_delete_current() (*not* slist_delete()). Insertion or
714
+ * deletion of nodes adjacent to the current node would misbehave.
715
+ */
716
+ #define slist_foreach_modify(iter, lhead) \
717
+ for (AssertVariableIsOfTypeMacro(iter, slist_mutable_iter), \
718
+ AssertVariableIsOfTypeMacro(lhead, slist_head *), \
719
+ (iter).prev = &(lhead)->head, \
720
+ (iter).cur = (iter).prev->next, \
721
+ (iter).next = (iter).cur ? (iter).cur->next : NULL; \
722
+ (iter).cur != NULL; \
723
+ (iter).prev = (iter).cur, \
724
+ (iter).cur = (iter).next, \
725
+ (iter).next = (iter).next ? (iter).next->next : NULL)
726
+
727
+ #endif /* ILIST_H */