|
| 1 | +/*------------------------------------------------------------------------- |
| 2 | + * |
| 3 | + * datapagemap.c |
| 4 | + * A data structure for keeping track of data pages that have changed. |
| 5 | + * |
| 6 | + * This is a fairly simple bitmap. |
| 7 | + * |
| 8 | + * Copyright (c) 2013-2020, PostgreSQL Global Development Group |
| 9 | + * Copyright (c) 2019-2020, Postgres Professional |
| 10 | + * |
| 11 | + *------------------------------------------------------------------------- |
| 12 | + */ |
| 13 | + |
| 14 | +#include "postgres.h" |
| 15 | + |
| 16 | +#include "datapagemap.h" |
| 17 | + |
| 18 | +struct datapagemap_iterator |
| 19 | +{ |
| 20 | + datapagemap_t *map; |
| 21 | + BlockNumber nextblkno; |
| 22 | +}; |
| 23 | + |
| 24 | +/* |
| 25 | + * Add a block to the bitmap. |
| 26 | + */ |
| 27 | +void |
| 28 | +datapagemap_add(datapagemap_t *map, BlockNumber blkno) |
| 29 | +{ |
| 30 | + int offset; |
| 31 | + int bitno; |
| 32 | + |
| 33 | + offset = blkno / 8; |
| 34 | + bitno = blkno % 8; |
| 35 | + |
| 36 | + /* enlarge or create bitmap if needed */ |
| 37 | + if (map->bitmapsize <= offset) |
| 38 | + { |
| 39 | + int oldsize = map->bitmapsize; |
| 40 | + int newsize; |
| 41 | + |
| 42 | + /* |
| 43 | + * The minimum to hold the new bit is offset + 1. But add some |
| 44 | + * headroom, so that we don't need to repeatedly enlarge the bitmap in |
| 45 | + * the common case that blocks are modified in order, from beginning |
| 46 | + * of a relation to the end. |
| 47 | + */ |
| 48 | + newsize = offset + 1; |
| 49 | + newsize += 10; |
| 50 | + |
| 51 | + if (map->bitmap != NULL) |
| 52 | + map->bitmap = repalloc(map->bitmap, newsize); |
| 53 | + else |
| 54 | + map->bitmap = palloc(newsize); |
| 55 | + |
| 56 | + /* zero out the newly allocated region */ |
| 57 | + memset(&map->bitmap[oldsize], 0, newsize - oldsize); |
| 58 | + |
| 59 | + map->bitmapsize = newsize; |
| 60 | + } |
| 61 | + |
| 62 | + /* Set the bit */ |
| 63 | + map->bitmap[offset] |= (1 << bitno); |
| 64 | +} |
| 65 | + |
| 66 | +/* |
| 67 | + * Start iterating through all entries in the page map. |
| 68 | + * |
| 69 | + * After datapagemap_iterate, call datapagemap_next to return the entries, |
| 70 | + * until it returns false. After you're done, use pg_free() to destroy the |
| 71 | + * iterator. |
| 72 | + */ |
| 73 | +datapagemap_iterator_t * |
| 74 | +datapagemap_iterate(datapagemap_t *map) |
| 75 | +{ |
| 76 | + datapagemap_iterator_t *iter; |
| 77 | + |
| 78 | + iter = palloc(sizeof(datapagemap_iterator_t)); |
| 79 | + iter->map = map; |
| 80 | + iter->nextblkno = 0; |
| 81 | + |
| 82 | + return iter; |
| 83 | +} |
| 84 | + |
| 85 | +bool |
| 86 | +datapagemap_next(datapagemap_iterator_t *iter, BlockNumber *blkno) |
| 87 | +{ |
| 88 | + datapagemap_t *map = iter->map; |
| 89 | + |
| 90 | + for (;;) |
| 91 | + { |
| 92 | + BlockNumber blk = iter->nextblkno; |
| 93 | + int nextoff = blk / 8; |
| 94 | + int bitno = blk % 8; |
| 95 | + |
| 96 | + if (nextoff >= map->bitmapsize) |
| 97 | + break; |
| 98 | + |
| 99 | + iter->nextblkno++; |
| 100 | + |
| 101 | + if (map->bitmap[nextoff] & (1 << bitno)) |
| 102 | + { |
| 103 | + *blkno = blk; |
| 104 | + return true; |
| 105 | + } |
| 106 | + } |
| 107 | + |
| 108 | + /* no more set bits in this bitmap. */ |
| 109 | + return false; |
| 110 | +} |
| 111 | + |
| 112 | +/* |
| 113 | + * A debugging aid. Prints out the contents of the page map. |
| 114 | + */ |
| 115 | +void |
| 116 | +datapagemap_print(datapagemap_t *map) |
| 117 | +{ |
| 118 | + datapagemap_iterator_t *iter; |
| 119 | + BlockNumber blocknum; |
| 120 | + |
| 121 | + iter = datapagemap_iterate(map); |
| 122 | + while (datapagemap_next(iter, &blocknum)) |
| 123 | + elog(DEBUG3, "block %u", blocknum); |
| 124 | + |
| 125 | + pfree(iter); |
| 126 | +} |
0 commit comments