pg_query 1.3.0 → 2.0.0
Sign up to get free protection for your applications and to get access to all the features.
- checksums.yaml +4 -4
- data/CHANGELOG.md +86 -52
- data/README.md +72 -65
- data/Rakefile +82 -1
- data/ext/pg_query/extconf.rb +2 -39
- data/ext/pg_query/guc-file.c +0 -0
- data/ext/pg_query/pg_query.c +104 -0
- data/ext/pg_query/pg_query.pb-c.c +37628 -0
- data/ext/pg_query/pg_query_deparse.c +9953 -0
- data/ext/pg_query/pg_query_fingerprint.c +292 -0
- data/ext/pg_query/pg_query_fingerprint.h +8 -0
- data/ext/pg_query/pg_query_internal.h +24 -0
- data/ext/pg_query/pg_query_json_plpgsql.c +738 -0
- data/ext/pg_query/pg_query_json_plpgsql.h +9 -0
- data/ext/pg_query/pg_query_normalize.c +437 -0
- data/ext/pg_query/pg_query_outfuncs.h +10 -0
- data/ext/pg_query/pg_query_outfuncs_json.c +297 -0
- data/ext/pg_query/pg_query_outfuncs_protobuf.c +237 -0
- data/ext/pg_query/pg_query_parse.c +148 -0
- data/ext/pg_query/pg_query_parse_plpgsql.c +460 -0
- data/ext/pg_query/pg_query_readfuncs.h +11 -0
- data/ext/pg_query/pg_query_readfuncs_protobuf.c +142 -0
- data/ext/pg_query/pg_query_ruby.c +108 -12
- data/ext/pg_query/pg_query_scan.c +173 -0
- data/ext/pg_query/pg_query_split.c +221 -0
- data/ext/pg_query/protobuf-c.c +3660 -0
- data/ext/pg_query/src_backend_catalog_namespace.c +1051 -0
- data/ext/pg_query/src_backend_catalog_pg_proc.c +142 -0
- data/ext/pg_query/src_backend_commands_define.c +117 -0
- data/ext/pg_query/src_backend_libpq_pqcomm.c +651 -0
- data/ext/pg_query/src_backend_nodes_bitmapset.c +513 -0
- data/ext/pg_query/src_backend_nodes_copyfuncs.c +6013 -0
- data/ext/pg_query/src_backend_nodes_equalfuncs.c +4003 -0
- data/ext/pg_query/src_backend_nodes_extensible.c +99 -0
- data/ext/pg_query/src_backend_nodes_list.c +922 -0
- data/ext/pg_query/src_backend_nodes_makefuncs.c +417 -0
- data/ext/pg_query/src_backend_nodes_nodeFuncs.c +1363 -0
- data/ext/pg_query/src_backend_nodes_value.c +84 -0
- data/ext/pg_query/src_backend_parser_gram.c +47456 -0
- data/ext/pg_query/src_backend_parser_parse_expr.c +313 -0
- data/ext/pg_query/src_backend_parser_parser.c +497 -0
- data/ext/pg_query/src_backend_parser_scan.c +7091 -0
- data/ext/pg_query/src_backend_parser_scansup.c +160 -0
- data/ext/pg_query/src_backend_postmaster_postmaster.c +2230 -0
- data/ext/pg_query/src_backend_storage_ipc_ipc.c +192 -0
- data/ext/pg_query/src_backend_storage_lmgr_s_lock.c +370 -0
- data/ext/pg_query/src_backend_tcop_postgres.c +776 -0
- data/ext/pg_query/src_backend_utils_adt_datum.c +326 -0
- data/ext/pg_query/src_backend_utils_adt_expandeddatum.c +98 -0
- data/ext/pg_query/src_backend_utils_adt_format_type.c +136 -0
- data/ext/pg_query/src_backend_utils_adt_ruleutils.c +1683 -0
- data/ext/pg_query/src_backend_utils_error_assert.c +74 -0
- data/ext/pg_query/src_backend_utils_error_elog.c +1748 -0
- data/ext/pg_query/src_backend_utils_fmgr_fmgr.c +570 -0
- data/ext/pg_query/src_backend_utils_hash_dynahash.c +1086 -0
- data/ext/pg_query/src_backend_utils_init_globals.c +168 -0
- data/ext/pg_query/src_backend_utils_mb_mbutils.c +839 -0
- data/ext/pg_query/src_backend_utils_misc_guc.c +1831 -0
- data/ext/pg_query/src_backend_utils_mmgr_aset.c +1560 -0
- data/ext/pg_query/src_backend_utils_mmgr_mcxt.c +1006 -0
- data/ext/pg_query/src_common_encnames.c +158 -0
- data/ext/pg_query/src_common_keywords.c +39 -0
- data/ext/pg_query/src_common_kwlist_d.h +1081 -0
- data/ext/pg_query/src_common_kwlookup.c +91 -0
- data/ext/pg_query/src_common_psprintf.c +158 -0
- data/ext/pg_query/src_common_string.c +86 -0
- data/ext/pg_query/src_common_stringinfo.c +336 -0
- data/ext/pg_query/src_common_wchar.c +1651 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_comp.c +1133 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_funcs.c +877 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_gram.c +6533 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_handler.c +107 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_reserved_kwlist_d.h +123 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_scanner.c +671 -0
- data/ext/pg_query/src_pl_plpgsql_src_pl_unreserved_kwlist_d.h +255 -0
- data/ext/pg_query/src_port_erand48.c +127 -0
- data/ext/pg_query/src_port_pg_bitutils.c +246 -0
- data/ext/pg_query/src_port_pgsleep.c +69 -0
- data/ext/pg_query/src_port_pgstrcasecmp.c +83 -0
- data/ext/pg_query/src_port_qsort.c +240 -0
- data/ext/pg_query/src_port_random.c +31 -0
- data/ext/pg_query/src_port_snprintf.c +1449 -0
- data/ext/pg_query/src_port_strerror.c +324 -0
- data/ext/pg_query/src_port_strnlen.c +39 -0
- data/ext/pg_query/xxhash.c +43 -0
- data/lib/pg_query.rb +7 -4
- data/lib/pg_query/constants.rb +21 -0
- data/lib/pg_query/deparse.rb +15 -1673
- data/lib/pg_query/filter_columns.rb +86 -85
- data/lib/pg_query/fingerprint.rb +122 -87
- data/lib/pg_query/json_field_names.rb +1402 -0
- data/lib/pg_query/node.rb +31 -0
- data/lib/pg_query/param_refs.rb +42 -37
- data/lib/pg_query/parse.rb +220 -203
- data/lib/pg_query/parse_error.rb +1 -1
- data/lib/pg_query/pg_query_pb.rb +3211 -0
- data/lib/pg_query/scan.rb +23 -0
- data/lib/pg_query/treewalker.rb +24 -40
- data/lib/pg_query/truncate.rb +64 -43
- data/lib/pg_query/version.rb +2 -2
- metadata +101 -11
- data/ext/pg_query/pg_query_ruby.h +0 -10
- data/lib/pg_query/deep_dup.rb +0 -16
- data/lib/pg_query/deparse/alter_table.rb +0 -42
- data/lib/pg_query/deparse/interval.rb +0 -105
- data/lib/pg_query/deparse/keywords.rb +0 -159
- data/lib/pg_query/deparse/rename.rb +0 -41
- data/lib/pg_query/legacy_parsetree.rb +0 -109
- data/lib/pg_query/node_types.rb +0 -297
@@ -0,0 +1,513 @@
|
|
1
|
+
/*--------------------------------------------------------------------
|
2
|
+
* Symbols referenced in this file:
|
3
|
+
* - bms_copy
|
4
|
+
* - bms_equal
|
5
|
+
* - bms_is_empty
|
6
|
+
* - bms_first_member
|
7
|
+
* - bms_free
|
8
|
+
* - bms_next_member
|
9
|
+
* - bms_num_members
|
10
|
+
*--------------------------------------------------------------------
|
11
|
+
*/
|
12
|
+
|
13
|
+
/*-------------------------------------------------------------------------
|
14
|
+
*
|
15
|
+
* bitmapset.c
|
16
|
+
* PostgreSQL generic bitmap set package
|
17
|
+
*
|
18
|
+
* A bitmap set can represent any set of nonnegative integers, although
|
19
|
+
* it is mainly intended for sets where the maximum value is not large,
|
20
|
+
* say at most a few hundred. By convention, a NULL pointer is always
|
21
|
+
* accepted by all operations to represent the empty set. (But beware
|
22
|
+
* that this is not the only representation of the empty set. Use
|
23
|
+
* bms_is_empty() in preference to testing for NULL.)
|
24
|
+
*
|
25
|
+
*
|
26
|
+
* Copyright (c) 2003-2020, PostgreSQL Global Development Group
|
27
|
+
*
|
28
|
+
* IDENTIFICATION
|
29
|
+
* src/backend/nodes/bitmapset.c
|
30
|
+
*
|
31
|
+
*-------------------------------------------------------------------------
|
32
|
+
*/
|
33
|
+
#include "postgres.h"
|
34
|
+
|
35
|
+
#include "common/hashfn.h"
|
36
|
+
#include "nodes/bitmapset.h"
|
37
|
+
#include "nodes/pg_list.h"
|
38
|
+
#include "port/pg_bitutils.h"
|
39
|
+
|
40
|
+
|
41
|
+
#define WORDNUM(x) ((x) / BITS_PER_BITMAPWORD)
|
42
|
+
#define BITNUM(x) ((x) % BITS_PER_BITMAPWORD)
|
43
|
+
|
44
|
+
#define BITMAPSET_SIZE(nwords) \
|
45
|
+
(offsetof(Bitmapset, words) + (nwords) * sizeof(bitmapword))
|
46
|
+
|
47
|
+
/*----------
|
48
|
+
* This is a well-known cute trick for isolating the rightmost one-bit
|
49
|
+
* in a word. It assumes two's complement arithmetic. Consider any
|
50
|
+
* nonzero value, and focus attention on the rightmost one. The value is
|
51
|
+
* then something like
|
52
|
+
* xxxxxx10000
|
53
|
+
* where x's are unspecified bits. The two's complement negative is formed
|
54
|
+
* by inverting all the bits and adding one. Inversion gives
|
55
|
+
* yyyyyy01111
|
56
|
+
* where each y is the inverse of the corresponding x. Incrementing gives
|
57
|
+
* yyyyyy10000
|
58
|
+
* and then ANDing with the original value gives
|
59
|
+
* 00000010000
|
60
|
+
* This works for all cases except original value = zero, where of course
|
61
|
+
* we get zero.
|
62
|
+
*----------
|
63
|
+
*/
|
64
|
+
#define RIGHTMOST_ONE(x) ((signedbitmapword) (x) & -((signedbitmapword) (x)))
|
65
|
+
|
66
|
+
#define HAS_MULTIPLE_ONES(x) ((bitmapword) RIGHTMOST_ONE(x) != (x))
|
67
|
+
|
68
|
+
/* Select appropriate bit-twiddling functions for bitmap word size */
|
69
|
+
#if BITS_PER_BITMAPWORD == 32
|
70
|
+
#define bmw_leftmost_one_pos(w) pg_leftmost_one_pos32(w)
|
71
|
+
#define bmw_rightmost_one_pos(w) pg_rightmost_one_pos32(w)
|
72
|
+
#define bmw_popcount(w) pg_popcount32(w)
|
73
|
+
#elif BITS_PER_BITMAPWORD == 64
|
74
|
+
#define bmw_leftmost_one_pos(w) pg_leftmost_one_pos64(w)
|
75
|
+
#define bmw_rightmost_one_pos(w) pg_rightmost_one_pos64(w)
|
76
|
+
#define bmw_popcount(w) pg_popcount64(w)
|
77
|
+
#else
|
78
|
+
#error "invalid BITS_PER_BITMAPWORD"
|
79
|
+
#endif
|
80
|
+
|
81
|
+
|
82
|
+
/*
|
83
|
+
* bms_copy - make a palloc'd copy of a bitmapset
|
84
|
+
*/
|
85
|
+
Bitmapset *
|
86
|
+
bms_copy(const Bitmapset *a)
|
87
|
+
{
|
88
|
+
Bitmapset *result;
|
89
|
+
size_t size;
|
90
|
+
|
91
|
+
if (a == NULL)
|
92
|
+
return NULL;
|
93
|
+
size = BITMAPSET_SIZE(a->nwords);
|
94
|
+
result = (Bitmapset *) palloc(size);
|
95
|
+
memcpy(result, a, size);
|
96
|
+
return result;
|
97
|
+
}
|
98
|
+
|
99
|
+
/*
|
100
|
+
* bms_equal - are two bitmapsets equal?
|
101
|
+
*
|
102
|
+
* This is logical not physical equality; in particular, a NULL pointer will
|
103
|
+
* be reported as equal to a palloc'd value containing no members.
|
104
|
+
*/
|
105
|
+
bool
|
106
|
+
bms_equal(const Bitmapset *a, const Bitmapset *b)
|
107
|
+
{
|
108
|
+
const Bitmapset *shorter;
|
109
|
+
const Bitmapset *longer;
|
110
|
+
int shortlen;
|
111
|
+
int longlen;
|
112
|
+
int i;
|
113
|
+
|
114
|
+
/* Handle cases where either input is NULL */
|
115
|
+
if (a == NULL)
|
116
|
+
{
|
117
|
+
if (b == NULL)
|
118
|
+
return true;
|
119
|
+
return bms_is_empty(b);
|
120
|
+
}
|
121
|
+
else if (b == NULL)
|
122
|
+
return bms_is_empty(a);
|
123
|
+
/* Identify shorter and longer input */
|
124
|
+
if (a->nwords <= b->nwords)
|
125
|
+
{
|
126
|
+
shorter = a;
|
127
|
+
longer = b;
|
128
|
+
}
|
129
|
+
else
|
130
|
+
{
|
131
|
+
shorter = b;
|
132
|
+
longer = a;
|
133
|
+
}
|
134
|
+
/* And process */
|
135
|
+
shortlen = shorter->nwords;
|
136
|
+
for (i = 0; i < shortlen; i++)
|
137
|
+
{
|
138
|
+
if (shorter->words[i] != longer->words[i])
|
139
|
+
return false;
|
140
|
+
}
|
141
|
+
longlen = longer->nwords;
|
142
|
+
for (; i < longlen; i++)
|
143
|
+
{
|
144
|
+
if (longer->words[i] != 0)
|
145
|
+
return false;
|
146
|
+
}
|
147
|
+
return true;
|
148
|
+
}
|
149
|
+
|
150
|
+
/*
|
151
|
+
* bms_compare - qsort-style comparator for bitmapsets
|
152
|
+
*
|
153
|
+
* This guarantees to report values as equal iff bms_equal would say they are
|
154
|
+
* equal. Otherwise, the highest-numbered bit that is set in one value but
|
155
|
+
* not the other determines the result. (This rule means that, for example,
|
156
|
+
* {6} is greater than {5}, which seems plausible.)
|
157
|
+
*/
|
158
|
+
|
159
|
+
|
160
|
+
/*
|
161
|
+
* bms_make_singleton - build a bitmapset containing a single member
|
162
|
+
*/
|
163
|
+
|
164
|
+
|
165
|
+
/*
|
166
|
+
* bms_free - free a bitmapset
|
167
|
+
*
|
168
|
+
* Same as pfree except for allowing NULL input
|
169
|
+
*/
|
170
|
+
void
|
171
|
+
bms_free(Bitmapset *a)
|
172
|
+
{
|
173
|
+
if (a)
|
174
|
+
pfree(a);
|
175
|
+
}
|
176
|
+
|
177
|
+
|
178
|
+
/*
|
179
|
+
* These operations all make a freshly palloc'd result,
|
180
|
+
* leaving their inputs untouched
|
181
|
+
*/
|
182
|
+
|
183
|
+
|
184
|
+
/*
|
185
|
+
* bms_union - set union
|
186
|
+
*/
|
187
|
+
|
188
|
+
|
189
|
+
/*
|
190
|
+
* bms_intersect - set intersection
|
191
|
+
*/
|
192
|
+
|
193
|
+
|
194
|
+
/*
|
195
|
+
* bms_difference - set difference (ie, A without members of B)
|
196
|
+
*/
|
197
|
+
|
198
|
+
|
199
|
+
/*
|
200
|
+
* bms_is_subset - is A a subset of B?
|
201
|
+
*/
|
202
|
+
|
203
|
+
|
204
|
+
/*
|
205
|
+
* bms_subset_compare - compare A and B for equality/subset relationships
|
206
|
+
*
|
207
|
+
* This is more efficient than testing bms_is_subset in both directions.
|
208
|
+
*/
|
209
|
+
|
210
|
+
|
211
|
+
/*
|
212
|
+
* bms_is_member - is X a member of A?
|
213
|
+
*/
|
214
|
+
|
215
|
+
|
216
|
+
/*
|
217
|
+
* bms_member_index
|
218
|
+
* determine 0-based index of member x in the bitmap
|
219
|
+
*
|
220
|
+
* Returns (-1) when x is not a member.
|
221
|
+
*/
|
222
|
+
|
223
|
+
|
224
|
+
/*
|
225
|
+
* bms_overlap - do sets overlap (ie, have a nonempty intersection)?
|
226
|
+
*/
|
227
|
+
|
228
|
+
|
229
|
+
/*
|
230
|
+
* bms_overlap_list - does a set overlap an integer list?
|
231
|
+
*/
|
232
|
+
|
233
|
+
|
234
|
+
/*
|
235
|
+
* bms_nonempty_difference - do sets have a nonempty difference?
|
236
|
+
*/
|
237
|
+
|
238
|
+
|
239
|
+
/*
|
240
|
+
* bms_singleton_member - return the sole integer member of set
|
241
|
+
*
|
242
|
+
* Raises error if |a| is not 1.
|
243
|
+
*/
|
244
|
+
|
245
|
+
|
246
|
+
/*
|
247
|
+
* bms_get_singleton_member
|
248
|
+
*
|
249
|
+
* Test whether the given set is a singleton.
|
250
|
+
* If so, set *member to the value of its sole member, and return true.
|
251
|
+
* If not, return false, without changing *member.
|
252
|
+
*
|
253
|
+
* This is more convenient and faster than calling bms_membership() and then
|
254
|
+
* bms_singleton_member(), if we don't care about distinguishing empty sets
|
255
|
+
* from multiple-member sets.
|
256
|
+
*/
|
257
|
+
|
258
|
+
|
259
|
+
/*
|
260
|
+
* bms_num_members - count members of set
|
261
|
+
*/
|
262
|
+
int
|
263
|
+
bms_num_members(const Bitmapset *a)
|
264
|
+
{
|
265
|
+
int result = 0;
|
266
|
+
int nwords;
|
267
|
+
int wordnum;
|
268
|
+
|
269
|
+
if (a == NULL)
|
270
|
+
return 0;
|
271
|
+
nwords = a->nwords;
|
272
|
+
for (wordnum = 0; wordnum < nwords; wordnum++)
|
273
|
+
{
|
274
|
+
bitmapword w = a->words[wordnum];
|
275
|
+
|
276
|
+
/* No need to count the bits in a zero word */
|
277
|
+
if (w != 0)
|
278
|
+
result += bmw_popcount(w);
|
279
|
+
}
|
280
|
+
return result;
|
281
|
+
}
|
282
|
+
|
283
|
+
/*
|
284
|
+
* bms_membership - does a set have zero, one, or multiple members?
|
285
|
+
*
|
286
|
+
* This is faster than making an exact count with bms_num_members().
|
287
|
+
*/
|
288
|
+
|
289
|
+
|
290
|
+
/*
|
291
|
+
* bms_is_empty - is a set empty?
|
292
|
+
*
|
293
|
+
* This is even faster than bms_membership().
|
294
|
+
*/
|
295
|
+
bool
|
296
|
+
bms_is_empty(const Bitmapset *a)
|
297
|
+
{
|
298
|
+
int nwords;
|
299
|
+
int wordnum;
|
300
|
+
|
301
|
+
if (a == NULL)
|
302
|
+
return true;
|
303
|
+
nwords = a->nwords;
|
304
|
+
for (wordnum = 0; wordnum < nwords; wordnum++)
|
305
|
+
{
|
306
|
+
bitmapword w = a->words[wordnum];
|
307
|
+
|
308
|
+
if (w != 0)
|
309
|
+
return false;
|
310
|
+
}
|
311
|
+
return true;
|
312
|
+
}
|
313
|
+
|
314
|
+
|
315
|
+
/*
|
316
|
+
* These operations all "recycle" their non-const inputs, ie, either
|
317
|
+
* return the modified input or pfree it if it can't hold the result.
|
318
|
+
*
|
319
|
+
* These should generally be used in the style
|
320
|
+
*
|
321
|
+
* foo = bms_add_member(foo, x);
|
322
|
+
*/
|
323
|
+
|
324
|
+
|
325
|
+
/*
|
326
|
+
* bms_add_member - add a specified member to set
|
327
|
+
*
|
328
|
+
* Input set is modified or recycled!
|
329
|
+
*/
|
330
|
+
|
331
|
+
|
332
|
+
/*
|
333
|
+
* bms_del_member - remove a specified member from set
|
334
|
+
*
|
335
|
+
* No error if x is not currently a member of set
|
336
|
+
*
|
337
|
+
* Input set is modified in-place!
|
338
|
+
*/
|
339
|
+
|
340
|
+
|
341
|
+
/*
|
342
|
+
* bms_add_members - like bms_union, but left input is recycled
|
343
|
+
*/
|
344
|
+
|
345
|
+
|
346
|
+
/*
|
347
|
+
* bms_add_range
|
348
|
+
* Add members in the range of 'lower' to 'upper' to the set.
|
349
|
+
*
|
350
|
+
* Note this could also be done by calling bms_add_member in a loop, however,
|
351
|
+
* using this function will be faster when the range is large as we work at
|
352
|
+
* the bitmapword level rather than at bit level.
|
353
|
+
*/
|
354
|
+
|
355
|
+
|
356
|
+
/*
|
357
|
+
* bms_int_members - like bms_intersect, but left input is recycled
|
358
|
+
*/
|
359
|
+
|
360
|
+
|
361
|
+
/*
|
362
|
+
* bms_del_members - like bms_difference, but left input is recycled
|
363
|
+
*/
|
364
|
+
|
365
|
+
|
366
|
+
/*
|
367
|
+
* bms_join - like bms_union, but *both* inputs are recycled
|
368
|
+
*/
|
369
|
+
|
370
|
+
|
371
|
+
/*
|
372
|
+
* bms_first_member - find and remove first member of a set
|
373
|
+
*
|
374
|
+
* Returns -1 if set is empty. NB: set is destructively modified!
|
375
|
+
*
|
376
|
+
* This is intended as support for iterating through the members of a set.
|
377
|
+
* The typical pattern is
|
378
|
+
*
|
379
|
+
* while ((x = bms_first_member(inputset)) >= 0)
|
380
|
+
* process member x;
|
381
|
+
*
|
382
|
+
* CAUTION: this destroys the content of "inputset". If the set must
|
383
|
+
* not be modified, use bms_next_member instead.
|
384
|
+
*/
|
385
|
+
int
|
386
|
+
bms_first_member(Bitmapset *a)
|
387
|
+
{
|
388
|
+
int nwords;
|
389
|
+
int wordnum;
|
390
|
+
|
391
|
+
if (a == NULL)
|
392
|
+
return -1;
|
393
|
+
nwords = a->nwords;
|
394
|
+
for (wordnum = 0; wordnum < nwords; wordnum++)
|
395
|
+
{
|
396
|
+
bitmapword w = a->words[wordnum];
|
397
|
+
|
398
|
+
if (w != 0)
|
399
|
+
{
|
400
|
+
int result;
|
401
|
+
|
402
|
+
w = RIGHTMOST_ONE(w);
|
403
|
+
a->words[wordnum] &= ~w;
|
404
|
+
|
405
|
+
result = wordnum * BITS_PER_BITMAPWORD;
|
406
|
+
result += bmw_rightmost_one_pos(w);
|
407
|
+
return result;
|
408
|
+
}
|
409
|
+
}
|
410
|
+
return -1;
|
411
|
+
}
|
412
|
+
|
413
|
+
/*
|
414
|
+
* bms_next_member - find next member of a set
|
415
|
+
*
|
416
|
+
* Returns smallest member greater than "prevbit", or -2 if there is none.
|
417
|
+
* "prevbit" must NOT be less than -1, or the behavior is unpredictable.
|
418
|
+
*
|
419
|
+
* This is intended as support for iterating through the members of a set.
|
420
|
+
* The typical pattern is
|
421
|
+
*
|
422
|
+
* x = -1;
|
423
|
+
* while ((x = bms_next_member(inputset, x)) >= 0)
|
424
|
+
* process member x;
|
425
|
+
*
|
426
|
+
* Notice that when there are no more members, we return -2, not -1 as you
|
427
|
+
* might expect. The rationale for that is to allow distinguishing the
|
428
|
+
* loop-not-started state (x == -1) from the loop-completed state (x == -2).
|
429
|
+
* It makes no difference in simple loop usage, but complex iteration logic
|
430
|
+
* might need such an ability.
|
431
|
+
*/
|
432
|
+
int
|
433
|
+
bms_next_member(const Bitmapset *a, int prevbit)
|
434
|
+
{
|
435
|
+
int nwords;
|
436
|
+
int wordnum;
|
437
|
+
bitmapword mask;
|
438
|
+
|
439
|
+
if (a == NULL)
|
440
|
+
return -2;
|
441
|
+
nwords = a->nwords;
|
442
|
+
prevbit++;
|
443
|
+
mask = (~(bitmapword) 0) << BITNUM(prevbit);
|
444
|
+
for (wordnum = WORDNUM(prevbit); wordnum < nwords; wordnum++)
|
445
|
+
{
|
446
|
+
bitmapword w = a->words[wordnum];
|
447
|
+
|
448
|
+
/* ignore bits before prevbit */
|
449
|
+
w &= mask;
|
450
|
+
|
451
|
+
if (w != 0)
|
452
|
+
{
|
453
|
+
int result;
|
454
|
+
|
455
|
+
result = wordnum * BITS_PER_BITMAPWORD;
|
456
|
+
result += bmw_rightmost_one_pos(w);
|
457
|
+
return result;
|
458
|
+
}
|
459
|
+
|
460
|
+
/* in subsequent words, consider all bits */
|
461
|
+
mask = (~(bitmapword) 0);
|
462
|
+
}
|
463
|
+
return -2;
|
464
|
+
}
|
465
|
+
|
466
|
+
/*
|
467
|
+
* bms_prev_member - find prev member of a set
|
468
|
+
*
|
469
|
+
* Returns largest member less than "prevbit", or -2 if there is none.
|
470
|
+
* "prevbit" must NOT be more than one above the highest possible bit that can
|
471
|
+
* be set at the Bitmapset at its current size.
|
472
|
+
*
|
473
|
+
* To ease finding the highest set bit for the initial loop, the special
|
474
|
+
* prevbit value of -1 can be passed to have the function find the highest
|
475
|
+
* valued member in the set.
|
476
|
+
*
|
477
|
+
* This is intended as support for iterating through the members of a set in
|
478
|
+
* reverse. The typical pattern is
|
479
|
+
*
|
480
|
+
* x = -1;
|
481
|
+
* while ((x = bms_prev_member(inputset, x)) >= 0)
|
482
|
+
* process member x;
|
483
|
+
*
|
484
|
+
* Notice that when there are no more members, we return -2, not -1 as you
|
485
|
+
* might expect. The rationale for that is to allow distinguishing the
|
486
|
+
* loop-not-started state (x == -1) from the loop-completed state (x == -2).
|
487
|
+
* It makes no difference in simple loop usage, but complex iteration logic
|
488
|
+
* might need such an ability.
|
489
|
+
*/
|
490
|
+
|
491
|
+
|
492
|
+
|
493
|
+
/*
|
494
|
+
* bms_hash_value - compute a hash key for a Bitmapset
|
495
|
+
*
|
496
|
+
* Note: we must ensure that any two bitmapsets that are bms_equal() will
|
497
|
+
* hash to the same value; in practice this means that trailing all-zero
|
498
|
+
* words must not affect the result. Hence we strip those before applying
|
499
|
+
* hash_any().
|
500
|
+
*/
|
501
|
+
|
502
|
+
|
503
|
+
/*
|
504
|
+
* bitmap_hash - hash function for keys that are (pointers to) Bitmapsets
|
505
|
+
*
|
506
|
+
* Note: don't forget to specify bitmap_match as the match function!
|
507
|
+
*/
|
508
|
+
|
509
|
+
|
510
|
+
/*
|
511
|
+
* bitmap_match - match function to use with bitmap_hash
|
512
|
+
*/
|
513
|
+
|