PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
hash.h
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * hash.h
4  * header file for postgres hash access method implementation
5  *
6  *
7  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
8  * Portions Copyright (c) 1994, Regents of the University of California
9  *
10  * src/include/access/hash.h
11  *
12  * NOTES
13  * modeled after Margo Seltzer's hash implementation for unix.
14  *
15  *-------------------------------------------------------------------------
16  */
17 #ifndef HASH_H
18 #define HASH_H
19 
20 #include "access/amapi.h"
21 #include "access/itup.h"
22 #include "access/sdir.h"
23 #include "fmgr.h"
24 #include "lib/stringinfo.h"
25 #include "storage/bufmgr.h"
26 #include "storage/lockdefs.h"
27 #include "utils/hsearch.h"
28 #include "utils/relcache.h"
29 
30 /*
31  * Mapping from hash bucket number to physical block number of bucket's
32  * starting page. Beware of multiple evaluations of argument!
33  */
34 typedef uint32 Bucket;
35 
36 #define InvalidBucket ((Bucket) 0xFFFFFFFF)
37 
38 #define BUCKET_TO_BLKNO(metap,B) \
39  ((BlockNumber) ((B) + ((B) ? (metap)->hashm_spares[_hash_spareindex((B)+1)-1] : 0)) + 1)
40 
41 /*
42  * Special space for hash index pages.
43  *
44  * hasho_flag's LH_PAGE_TYPE bits tell us which type of page we're looking at.
45  * Additional bits in the flag word are used for more transient purposes.
46  *
47  * To test a page's type, do (hasho_flag & LH_PAGE_TYPE) == LH_xxx_PAGE.
48  * However, we ensure that each used page type has a distinct bit so that
49  * we can OR together page types for uses such as the allowable-page-types
50  * argument of _hash_checkpage().
51  */
52 #define LH_UNUSED_PAGE (0)
53 #define LH_OVERFLOW_PAGE (1 << 0)
54 #define LH_BUCKET_PAGE (1 << 1)
55 #define LH_BITMAP_PAGE (1 << 2)
56 #define LH_META_PAGE (1 << 3)
57 #define LH_BUCKET_BEING_POPULATED (1 << 4)
58 #define LH_BUCKET_BEING_SPLIT (1 << 5)
59 #define LH_BUCKET_NEEDS_SPLIT_CLEANUP (1 << 6)
60 #define LH_PAGE_HAS_DEAD_TUPLES (1 << 7)
61 
62 #define LH_PAGE_TYPE \
63  (LH_OVERFLOW_PAGE | LH_BUCKET_PAGE | LH_BITMAP_PAGE | LH_META_PAGE)
64 
65 /*
66  * In an overflow page, hasho_prevblkno stores the block number of the previous
67  * page in the bucket chain; in a bucket page, hasho_prevblkno stores the
68  * hashm_maxbucket value as of the last time the bucket was last split, or
69  * else as of the time the bucket was created. The latter convention is used
70  * to determine whether a cached copy of the metapage is too stale to be used
71  * without needing to lock or pin the metapage.
72  *
73  * hasho_nextblkno is always the block number of the next page in the
74  * bucket chain, or InvalidBlockNumber if there are no more such pages.
75  */
76 typedef struct HashPageOpaqueData
77 {
78  BlockNumber hasho_prevblkno; /* see above */
79  BlockNumber hasho_nextblkno; /* see above */
80  Bucket hasho_bucket; /* bucket number this pg belongs to */
81  uint16 hasho_flag; /* page type code + flag bits, see above */
82  uint16 hasho_page_id; /* for identification of hash indexes */
84 
86 
87 #define H_NEEDS_SPLIT_CLEANUP(opaque) (((opaque)->hasho_flag & LH_BUCKET_NEEDS_SPLIT_CLEANUP) != 0)
88 #define H_BUCKET_BEING_SPLIT(opaque) (((opaque)->hasho_flag & LH_BUCKET_BEING_SPLIT) != 0)
89 #define H_BUCKET_BEING_POPULATED(opaque) (((opaque)->hasho_flag & LH_BUCKET_BEING_POPULATED) != 0)
90 #define H_HAS_DEAD_TUPLES(opaque) (((opaque)->hasho_flag & LH_PAGE_HAS_DEAD_TUPLES) != 0)
91 
92 /*
93  * The page ID is for the convenience of pg_filedump and similar utilities,
94  * which otherwise would have a hard time telling pages of different index
95  * types apart. It should be the last 2 bytes on the page. This is more or
96  * less "free" due to alignment considerations.
97  */
98 #define HASHO_PAGE_ID 0xFF80
99 
100 typedef struct HashScanPosItem /* what we remember about each match */
101 {
102  ItemPointerData heapTid; /* TID of referenced heap item */
103  OffsetNumber indexOffset; /* index item's location within page */
105 
106 
107 /*
108  * HashScanOpaqueData is private state for a hash index scan.
109  */
110 typedef struct HashScanOpaqueData
111 {
112  /* Hash value of the scan key, ie, the hash key we seek */
114 
115  /*
116  * We also want to remember which buffer we're currently examining in the
117  * scan. We keep the buffer pinned (but not locked) across hashgettuple
118  * calls, in order to avoid doing a ReadBuffer() for every tuple in the
119  * index.
120  */
122 
123  /* remember the buffer associated with primary bucket */
125 
126  /*
127  * remember the buffer associated with primary bucket page of bucket being
128  * split. it is required during the scan of the bucket which is being
129  * populated during split operation.
130  */
132 
133  /* Current position of the scan, as an index TID */
135 
136  /* Current position of the scan, as a heap TID */
138 
139  /* Whether scan starts on bucket being populated due to split */
141 
142  /*
143  * Whether scanning bucket being split? The value of this parameter is
144  * referred only when hashso_buc_populated is true.
145  */
147  /* info about killed items if any (killedItems is NULL if never used) */
148  HashScanPosItem *killedItems; /* tids and offset numbers of killed items */
149  int numKilled; /* number of currently stored items */
151 
153 
154 /*
155  * Definitions for metapage.
156  */
157 
158 #define HASH_METAPAGE 0 /* metapage is always block 0 */
159 
160 #define HASH_MAGIC 0x6440640
161 #define HASH_VERSION 3 /* 3 signifies multi-phased bucket allocation
162  * to reduce doubling */
163 
164 /*
165  * spares[] holds the number of overflow pages currently allocated at or
166  * before a certain splitpoint. For example, if spares[3] = 7 then there are
167  * 7 ovflpages before splitpoint 3 (compare BUCKET_TO_BLKNO macro). The
168  * value in spares[ovflpoint] increases as overflow pages are added at the
169  * end of the index. Once ovflpoint increases (ie, we have actually allocated
170  * the bucket pages belonging to that splitpoint) the number of spares at the
171  * prior splitpoint cannot change anymore.
172  *
173  * ovflpages that have been recycled for reuse can be found by looking at
174  * bitmaps that are stored within ovflpages dedicated for the purpose.
175  * The blknos of these bitmap pages are kept in mapp[]; nmaps is the
176  * number of currently existing bitmaps.
177  *
178  * The limitation on the size of spares[] comes from the fact that there's
179  * no point in having more than 2^32 buckets with only uint32 hashcodes.
180  * (Note: The value of HASH_MAX_SPLITPOINTS which is the size of spares[] is
181  * adjusted in such a way to accommodate multi phased allocation of buckets
182  * after HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE).
183  *
184  * There is no particular upper limit on the size of mapp[], other than
185  * needing to fit into the metapage. (With 8K block size, 128 bitmaps
186  * limit us to 64 GB of overflow space...)
187  */
188 #define HASH_MAX_BITMAPS 128
189 
190 #define HASH_SPLITPOINT_PHASE_BITS 2
191 #define HASH_SPLITPOINT_PHASES_PER_GRP (1 << HASH_SPLITPOINT_PHASE_BITS)
192 #define HASH_SPLITPOINT_PHASE_MASK (HASH_SPLITPOINT_PHASES_PER_GRP - 1)
193 #define HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE 10
194 
195 /* defines max number of splitpoit phases a hash index can have */
196 #define HASH_MAX_SPLITPOINT_GROUP 32
197 #define HASH_MAX_SPLITPOINTS \
198  (((HASH_MAX_SPLITPOINT_GROUP - HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE) * \
199  HASH_SPLITPOINT_PHASES_PER_GRP) + \
200  HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE)
201 
202 typedef struct HashMetaPageData
203 {
204  uint32 hashm_magic; /* magic no. for hash tables */
205  uint32 hashm_version; /* version ID */
206  double hashm_ntuples; /* number of tuples stored in the table */
207  uint16 hashm_ffactor; /* target fill factor (tuples/bucket) */
208  uint16 hashm_bsize; /* index page size (bytes) */
209  uint16 hashm_bmsize; /* bitmap array size (bytes) - must be a power
210  * of 2 */
211  uint16 hashm_bmshift; /* log2(bitmap array size in BITS) */
212  uint32 hashm_maxbucket; /* ID of maximum bucket in use */
213  uint32 hashm_highmask; /* mask to modulo into entire table */
214  uint32 hashm_lowmask; /* mask to modulo into lower half of table */
215  uint32 hashm_ovflpoint;/* splitpoint from which ovflpgs being
216  * allocated */
217  uint32 hashm_firstfree; /* lowest-number free ovflpage (bit#) */
218  uint32 hashm_nmaps; /* number of bitmap pages */
219  RegProcedure hashm_procid; /* hash procedure id from pg_proc */
220  uint32 hashm_spares[HASH_MAX_SPLITPOINTS]; /* spare pages before
221  * each splitpoint */
222  BlockNumber hashm_mapp[HASH_MAX_BITMAPS]; /* blknos of ovfl bitmaps */
224 
226 
227 /*
228  * Maximum size of a hash index item (it's okay to have only one per page)
229  */
230 #define HashMaxItemSize(page) \
231  MAXALIGN_DOWN(PageGetPageSize(page) - \
232  SizeOfPageHeaderData - \
233  sizeof(ItemIdData) - \
234  MAXALIGN(sizeof(HashPageOpaqueData)))
235 
236 #define INDEX_MOVED_BY_SPLIT_MASK 0x2000
237 
238 #define HASH_MIN_FILLFACTOR 10
239 #define HASH_DEFAULT_FILLFACTOR 75
240 
241 /*
242  * Constants
243  */
244 #define BYTE_TO_BIT 3 /* 2^3 bits/byte */
245 #define ALL_SET ((uint32) ~0)
246 
247 /*
248  * Bitmap pages do not contain tuples. They do contain the standard
249  * page headers and trailers; however, everything in between is a
250  * giant bit array. The number of bits that fit on a page obviously
251  * depends on the page size and the header/trailer overhead. We require
252  * the number of bits per page to be a power of 2.
253  */
254 #define BMPGSZ_BYTE(metap) ((metap)->hashm_bmsize)
255 #define BMPGSZ_BIT(metap) ((metap)->hashm_bmsize << BYTE_TO_BIT)
256 #define BMPG_SHIFT(metap) ((metap)->hashm_bmshift)
257 #define BMPG_MASK(metap) (BMPGSZ_BIT(metap) - 1)
258 
259 #define HashPageGetBitmap(page) \
260  ((uint32 *) PageGetContents(page))
261 
262 #define HashGetMaxBitmapSize(page) \
263  (PageGetPageSize((Page) page) - \
264  (MAXALIGN(SizeOfPageHeaderData) + MAXALIGN(sizeof(HashPageOpaqueData))))
265 
266 #define HashPageGetMeta(page) \
267  ((HashMetaPage) PageGetContents(page))
268 
269 /*
270  * The number of bits in an ovflpage bitmap word.
271  */
272 #define BITS_PER_MAP 32 /* Number of bits in uint32 */
273 
274 /* Given the address of the beginning of a bit map, clear/set the nth bit */
275 #define CLRBIT(A, N) ((A)[(N)/BITS_PER_MAP] &= ~(1<<((N)%BITS_PER_MAP)))
276 #define SETBIT(A, N) ((A)[(N)/BITS_PER_MAP] |= (1<<((N)%BITS_PER_MAP)))
277 #define ISSET(A, N) ((A)[(N)/BITS_PER_MAP] & (1<<((N)%BITS_PER_MAP)))
278 
279 /*
280  * page-level and high-level locking modes (see README)
281  */
282 #define HASH_READ BUFFER_LOCK_SHARE
283 #define HASH_WRITE BUFFER_LOCK_EXCLUSIVE
284 #define HASH_NOLOCK (-1)
285 
286 /*
287  * Strategy number. There's only one valid strategy for hashing: equality.
288  */
289 #define HTEqualStrategyNumber 1
290 #define HTMaxStrategyNumber 1
291 
292 /*
293  * When a new operator class is declared, we require that the user supply
294  * us with an amproc procudure for hashing a key of the new type.
295  * Since we only have one such proc in amproc, it's number 1.
296  */
297 #define HASHPROC 1
298 #define HASHNProcs 1
299 
300 
301 /* public routines */
302 
304  struct IndexInfo *indexInfo);
305 extern void hashbuildempty(Relation index);
306 extern bool hashinsert(Relation rel, Datum *values, bool *isnull,
307  ItemPointer ht_ctid, Relation heapRel,
308  IndexUniqueCheck checkUnique,
309  struct IndexInfo *indexInfo);
310 extern bool hashgettuple(IndexScanDesc scan, ScanDirection dir);
311 extern int64 hashgetbitmap(IndexScanDesc scan, TIDBitmap *tbm);
312 extern IndexScanDesc hashbeginscan(Relation rel, int nkeys, int norderbys);
313 extern void hashrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys,
314  ScanKey orderbys, int norderbys);
315 extern void hashendscan(IndexScanDesc scan);
317  IndexBulkDeleteResult *stats,
319  void *callback_state);
321  IndexBulkDeleteResult *stats);
322 extern bytea *hashoptions(Datum reloptions, bool validate);
323 extern bool hashvalidate(Oid opclassoid);
324 
325 extern Datum hash_any(register const unsigned char *k, register int keylen);
326 extern Datum hash_uint32(uint32 k);
327 
328 /* private routines */
329 
330 /* hashinsert.c */
331 extern void _hash_doinsert(Relation rel, IndexTuple itup, Relation heapRel);
333  Size itemsize, IndexTuple itup);
334 extern void _hash_pgaddmultitup(Relation rel, Buffer buf, IndexTuple *itups,
335  OffsetNumber *itup_offsets, uint16 nitups);
336 
337 /* hashovfl.c */
338 extern Buffer _hash_addovflpage(Relation rel, Buffer metabuf, Buffer buf, bool retain_pin);
339 extern BlockNumber _hash_freeovflpage(Relation rel, Buffer bucketbuf, Buffer ovflbuf,
340  Buffer wbuf, IndexTuple *itups, OffsetNumber *itup_offsets,
341  Size *tups_size, uint16 nitups, BufferAccessStrategy bstrategy);
342 extern void _hash_initbitmapbuffer(Buffer buf, uint16 bmsize, bool initpage);
343 extern void _hash_squeezebucket(Relation rel,
344  Bucket bucket, BlockNumber bucket_blkno,
345  Buffer bucket_buf,
346  BufferAccessStrategy bstrategy);
348 
349 /* hashpage.c */
350 extern Buffer _hash_getbuf(Relation rel, BlockNumber blkno,
351  int access, int flags);
353  BlockNumber blkno, int flags);
354 extern HashMetaPage _hash_getcachedmetap(Relation rel, Buffer *metabuf,
355  bool force_refresh);
357  int access,
358  HashMetaPage *cachedmetap);
359 extern Buffer _hash_getinitbuf(Relation rel, BlockNumber blkno);
360 extern void _hash_initbuf(Buffer buf, uint32 max_bucket, uint32 num_bucket,
361  uint32 flag, bool initpage);
362 extern Buffer _hash_getnewbuf(Relation rel, BlockNumber blkno,
363  ForkNumber forkNum);
365  int access, int flags,
366  BufferAccessStrategy bstrategy);
367 extern void _hash_relbuf(Relation rel, Buffer buf);
368 extern void _hash_dropbuf(Relation rel, Buffer buf);
369 extern void _hash_dropscanbuf(Relation rel, HashScanOpaque so);
370 extern uint32 _hash_init(Relation rel, double num_tuples,
371  ForkNumber forkNum);
372 extern void _hash_init_metabuffer(Buffer buf, double num_tuples,
373  RegProcedure procid, uint16 ffactor, bool initpage);
374 extern void _hash_pageinit(Page page, Size size);
375 extern void _hash_expandtable(Relation rel, Buffer metabuf);
376 extern void _hash_finish_split(Relation rel, Buffer metabuf, Buffer obuf,
377  Bucket obucket, uint32 maxbucket, uint32 highmask,
378  uint32 lowmask);
379 
380 /* hashsearch.c */
381 extern bool _hash_next(IndexScanDesc scan, ScanDirection dir);
382 extern bool _hash_first(IndexScanDesc scan, ScanDirection dir);
383 extern bool _hash_step(IndexScanDesc scan, Buffer *bufP, ScanDirection dir);
384 
385 /* hashsort.c */
386 typedef struct HSpool HSpool; /* opaque struct in hashsort.c */
387 
388 extern HSpool *_h_spoolinit(Relation heap, Relation index, uint32 num_buckets);
389 extern void _h_spooldestroy(HSpool *hspool);
390 extern void _h_spool(HSpool *hspool, ItemPointer self,
391  Datum *values, bool *isnull);
392 extern void _h_indexbuild(HSpool *hspool, Relation heapRel);
393 
394 /* hashutil.c */
395 extern bool _hash_checkqual(IndexScanDesc scan, IndexTuple itup);
396 extern uint32 _hash_datum2hashkey(Relation rel, Datum key);
397 extern uint32 _hash_datum2hashkey_type(Relation rel, Datum key, Oid keytype);
398 extern Bucket _hash_hashkey2bucket(uint32 hashkey, uint32 maxbucket,
399  uint32 highmask, uint32 lowmask);
400 extern uint32 _hash_log2(uint32 num);
401 extern uint32 _hash_spareindex(uint32 num_bucket);
402 extern uint32 _hash_get_totalbuckets(uint32 splitpoint_phase);
403 extern void _hash_checkpage(Relation rel, Buffer buf, int flags);
406  Datum *user_values, bool *user_isnull,
407  Datum *index_values, bool *index_isnull);
408 extern OffsetNumber _hash_binsearch(Page page, uint32 hash_value);
409 extern OffsetNumber _hash_binsearch_last(Page page, uint32 hash_value);
413  uint32 lowmask, uint32 maxbucket);
414 extern void _hash_kill_items(IndexScanDesc scan);
415 
416 /* hash.c */
417 extern void hashbucketcleanup(Relation rel, Bucket cur_bucket,
418  Buffer bucket_buf, BlockNumber bucket_blkno,
419  BufferAccessStrategy bstrategy,
420  uint32 maxbucket, uint32 highmask, uint32 lowmask,
421  double *tuples_removed, double *num_index_tuples,
422  bool bucket_has_garbage,
423  IndexBulkDeleteCallback callback, void *callback_state);
424 
425 #endif /* HASH_H */
bool _hash_convert_tuple(Relation index, Datum *user_values, bool *user_isnull, Datum *index_values, bool *index_isnull)
Definition: hashutil.c:326
void hashendscan(IndexScanDesc scan)
Definition: hash.c:513
HashScanOpaqueData * HashScanOpaque
Definition: hash.h:152
uint16 hashm_bmshift
Definition: hash.h:211
uint16 hasho_page_id
Definition: hash.h:82
IndexScanDesc hashbeginscan(Relation rel, int nkeys, int norderbys)
Definition: hash.c:440
Buffer _hash_getbuf(Relation rel, BlockNumber blkno, int access, int flags)
Definition: hashpage.c:78
BlockNumber _hash_freeovflpage(Relation rel, Buffer bucketbuf, Buffer ovflbuf, Buffer wbuf, IndexTuple *itups, OffsetNumber *itup_offsets, Size *tups_size, uint16 nitups, BufferAccessStrategy bstrategy)
Definition: hashovfl.c:488
RegProcedure hashm_procid
Definition: hash.h:219
void _hash_pageinit(Page page, Size size)
Definition: hashpage.c:597
void hashbucketcleanup(Relation rel, Bucket cur_bucket, Buffer bucket_buf, BlockNumber bucket_blkno, BufferAccessStrategy bstrategy, uint32 maxbucket, uint32 highmask, uint32 lowmask, double *tuples_removed, double *num_index_tuples, bool bucket_has_garbage, IndexBulkDeleteCallback callback, void *callback_state)
Definition: hash.c:779
bool hashvalidate(Oid opclassoid)
Definition: hashvalidate.c:44
uint32 _hash_log2(uint32 num)
Definition: hashutil.c:141
bytea * hashoptions(Datum reloptions, bool validate)
Definition: hashutil.c:290
int64 hashgetbitmap(IndexScanDesc scan, TIDBitmap *tbm)
Definition: hash.c:394
Buffer _hash_getbucketbuf_from_hashkey(Relation rel, uint32 hashkey, int access, HashMetaPage *cachedmetap)
Definition: hashpage.c:1530
bool _hash_checkqual(IndexScanDesc scan, IndexTuple itup)
Definition: hashutil.c:31
regproc RegProcedure
Definition: c.h:395
uint32 hashm_magic
Definition: hash.h:204
HashMetaPage _hash_getcachedmetap(Relation rel, Buffer *metabuf, bool force_refresh)
Definition: hashpage.c:1472
void hashrescan(IndexScanDesc scan, ScanKey scankey, int nscankeys, ScanKey orderbys, int norderbys)
Definition: hash.c:473
uint16 hashm_ffactor
Definition: hash.h:207
uint32 hashm_highmask
Definition: hash.h:213
HashMetaPageData * HashMetaPage
Definition: hash.h:225
void _hash_init_metabuffer(Buffer buf, double num_tuples, RegProcedure procid, uint16 ffactor, bool initpage)
Definition: hashpage.c:497
IndexBuildResult * hashbuild(Relation heap, Relation index, struct IndexInfo *indexInfo)
Definition: hash.c:103
uint32 BlockNumber
Definition: block.h:31
unsigned int Oid
Definition: postgres_ext.h:31
bool hashgettuple(IndexScanDesc scan, ScanDirection dir)
Definition: hash.c:268
void _hash_squeezebucket(Relation rel, Bucket bucket, BlockNumber bucket_blkno, Buffer bucket_buf, BufferAccessStrategy bstrategy)
Definition: hashovfl.c:804
uint32 hashm_lowmask
Definition: hash.h:214
void _h_spool(HSpool *hspool, ItemPointer self, Datum *values, bool *isnull)
Definition: hashsort.c:104
void _hash_initbuf(Buffer buf, uint32 max_bucket, uint32 num_bucket, uint32 flag, bool initpage)
Definition: hashpage.c:165
void _hash_dropscanbuf(Relation rel, HashScanOpaque so)
Definition: hashpage.c:297
Buffer _hash_getinitbuf(Relation rel, BlockNumber blkno)
Definition: hashpage.c:143
bool hashinsert(Relation rel, Datum *values, bool *isnull, ItemPointer ht_ctid, Relation heapRel, IndexUniqueCheck checkUnique, struct IndexInfo *indexInfo)
Definition: hash.c:237
#define HASH_MAX_SPLITPOINTS
Definition: hash.h:197
bool _hash_step(IndexScanDesc scan, Buffer *bufP, ScanDirection dir)
Definition: hashsearch.c:391
uint32 _hash_datum2hashkey_type(Relation rel, Datum key, Oid keytype)
Definition: hashutil.c:102
uint16 OffsetNumber
Definition: off.h:24
Definition: type.h:90
uint32 Bucket
Definition: hash.h:34
IndexUniqueCheck
Definition: genam.h:111
bool _hash_next(IndexScanDesc scan, ScanDirection dir)
Definition: hashsearch.c:34
unsigned short uint16
Definition: c.h:267
void _hash_finish_split(Relation rel, Buffer metabuf, Buffer obuf, Bucket obucket, uint32 maxbucket, uint32 highmask, uint32 lowmask)
Definition: hashpage.c:1325
BlockNumber hasho_prevblkno
Definition: hash.h:78
Buffer _hash_getnewbuf(Relation rel, BlockNumber blkno, ForkNumber forkNum)
Definition: hashpage.c:206
uint32 _hash_spareindex(uint32 num_bucket)
Definition: hashutil.c:157
void _hash_checkpage(Relation rel, Buffer buf, int flags)
Definition: hashutil.c:225
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:48
uint32 hashm_version
Definition: hash.h:205
uint32 hashm_nmaps
Definition: hash.h:218
struct HashMetaPageData HashMetaPageData
Buffer _hash_addovflpage(Relation rel, Buffer metabuf, Buffer buf, bool retain_pin)
Definition: hashovfl.c:111
IndexBulkDeleteResult * hashvacuumcleanup(IndexVacuumInfo *info, IndexBulkDeleteResult *stats)
Definition: hash.c:739
static char * buf
Definition: pg_test_fsync.c:66
char * flag(int b)
Definition: test-ctype.c:33
void _hash_doinsert(Relation rel, IndexTuple itup, Relation heapRel)
Definition: hashinsert.c:36
ScanDirection
Definition: sdir.h:22
OffsetNumber _hash_pgaddtup(Relation rel, Buffer buf, Size itemsize, IndexTuple itup)
Definition: hashinsert.c:267
void _hash_initbitmapbuffer(Buffer buf, uint16 bmsize, bool initpage)
Definition: hashovfl.c:739
HashScanPosItem * killedItems
Definition: hash.h:148
unsigned int uint32
Definition: c.h:268
Buffer hashso_bucket_buf
Definition: hash.h:124
uint32 _hash_get_totalbuckets(uint32 splitpoint_phase)
Definition: hashutil.c:189
ForkNumber
Definition: relpath.h:24
void _hash_relbuf(Relation rel, Buffer buf)
Definition: hashpage.c:274
#define HASH_MAX_BITMAPS
Definition: hash.h:188
void _hash_expandtable(Relation rel, Buffer metabuf)
Definition: hashpage.c:615
bool _hash_first(IndexScanDesc scan, ScanDirection dir)
Definition: hashsearch.c:222
uint32 hashm_ovflpoint
Definition: hash.h:215
uint16 hashm_bsize
Definition: hash.h:208
uint32 _hash_init(Relation rel, double num_tuples, ForkNumber forkNum)
Definition: hashpage.c:335
BlockNumber _hash_get_newblock_from_oldbucket(Relation rel, Bucket old_bucket)
Definition: hashutil.c:469
uintptr_t Datum
Definition: postgres.h:372
BlockNumber _hash_get_oldblock_from_newbucket(Relation rel, Bucket new_bucket)
Definition: hashutil.c:430
double hashm_ntuples
Definition: hash.h:206
bool hashso_buc_populated
Definition: hash.h:140
uint32 hashm_firstfree
Definition: hash.h:217
uint32 hashm_spares[HASH_MAX_SPLITPOINTS]
Definition: hash.h:220
uint32 hashso_sk_hash
Definition: hash.h:113
uint32 _hash_get_indextuple_hashkey(IndexTuple itup)
Definition: hashutil.c:299
Bucket _hash_get_newbucket_from_oldbucket(Relation rel, Bucket old_bucket, uint32 lowmask, uint32 maxbucket)
Definition: hashutil.c:502
void hashbuildempty(Relation index)
Definition: hash.c:186
void _h_spooldestroy(HSpool *hspool)
Definition: hashsort.c:94
Bucket hasho_bucket
Definition: hash.h:80
struct HashScanPosItem HashScanPosItem
size_t Size
Definition: c.h:356
void _hash_dropbuf(Relation rel, Buffer buf)
Definition: hashpage.c:285
HashPageOpaqueData * HashPageOpaque
Definition: hash.h:85
OffsetNumber _hash_binsearch_last(Page page, uint32 hash_value)
Definition: hashutil.c:396
ItemPointerData hashso_curpos
Definition: hash.h:134
HSpool * _h_spoolinit(Relation heap, Relation index, uint32 num_buckets)
Definition: hashsort.c:56
Buffer _hash_getbuf_with_condlock_cleanup(Relation rel, BlockNumber blkno, int flags)
Definition: hashpage.c:104
struct HashScanOpaqueData HashScanOpaqueData
uint32 hashm_maxbucket
Definition: hash.h:212
struct HashPageOpaqueData HashPageOpaqueData
uint16 hasho_flag
Definition: hash.h:81
bool hashso_buc_split
Definition: hash.h:146
static Datum values[MAXATTR]
Definition: bootstrap.c:163
Datum hash_any(register const unsigned char *k, register int keylen)
Definition: hashfunc.c:307
Bucket _hash_hashkey2bucket(uint32 hashkey, uint32 maxbucket, uint32 highmask, uint32 lowmask)
Definition: hashutil.c:125
OffsetNumber indexOffset
Definition: hash.h:103
void _h_indexbuild(HSpool *hspool, Relation heapRel)
Definition: hashsort.c:115
void _hash_kill_items(IndexScanDesc scan)
Definition: hashutil.c:529
Buffer hashso_split_bucket_buf
Definition: hash.h:131
Buffer _hash_getbuf_with_strategy(Relation rel, BlockNumber blkno, int access, int flags, BufferAccessStrategy bstrategy)
Definition: hashpage.c:247
BlockNumber hasho_nextblkno
Definition: hash.h:79
uint16 hashm_bmsize
Definition: hash.h:209
uint32 _hash_datum2hashkey(Relation rel, Datum key)
Definition: hashutil.c:82
Datum hash_uint32(uint32 k)
Definition: hashfunc.c:512
Definition: c.h:439
ItemPointerData heapTid
Definition: hash.h:102
OffsetNumber _hash_binsearch(Page page, uint32 hash_value)
Definition: hashutil.c:358
uint32 _hash_ovflblkno_to_bitno(HashMetaPage metap, BlockNumber ovflblkno)
Definition: hashovfl.c:61
IndexBulkDeleteResult * hashbulkdelete(IndexVacuumInfo *info, IndexBulkDeleteResult *stats, IndexBulkDeleteCallback callback, void *callback_state)
Definition: hash.c:549
void _hash_pgaddmultitup(Relation rel, Buffer buf, IndexTuple *itups, OffsetNumber *itup_offsets, uint16 nitups)
Definition: hashinsert.c:298
BlockNumber hashm_mapp[HASH_MAX_BITMAPS]
Definition: hash.h:222
int Buffer
Definition: buf.h:23
ItemPointerData hashso_heappos
Definition: hash.h:137
bool(* IndexBulkDeleteCallback)(ItemPointer itemptr, void *state)
Definition: genam.h:83
Buffer hashso_curbuf
Definition: hash.h:121
Pointer Page
Definition: bufpage.h:74