bitmap.h 10 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288
  1. /*
  2. * bitmap.h: Copyright (C) Peter T. Breuer (ptb@ot.uc3m.es) 2003
  3. *
  4. * additions: Copyright (C) 2003-2004, Paul Clements, SteelEye Technology, Inc.
  5. */
  6. #ifndef BITMAP_H
  7. #define BITMAP_H 1
  8. #define BITMAP_MAJOR_LO 3
  9. /* version 4 insists the bitmap is in little-endian order
  10. * with version 3, it is host-endian which is non-portable
  11. */
  12. #define BITMAP_MAJOR_HI 4
  13. #define BITMAP_MAJOR_HOSTENDIAN 3
  14. #define BITMAP_MINOR 39
  15. /*
  16. * in-memory bitmap:
  17. *
  18. * Use 16 bit block counters to track pending writes to each "chunk".
  19. * The 2 high order bits are special-purpose, the first is a flag indicating
  20. * whether a resync is needed. The second is a flag indicating whether a
  21. * resync is active.
  22. * This means that the counter is actually 14 bits:
  23. *
  24. * +--------+--------+------------------------------------------------+
  25. * | resync | resync | counter |
  26. * | needed | active | |
  27. * | (0-1) | (0-1) | (0-16383) |
  28. * +--------+--------+------------------------------------------------+
  29. *
  30. * The "resync needed" bit is set when:
  31. * a '1' bit is read from storage at startup.
  32. * a write request fails on some drives
  33. * a resync is aborted on a chunk with 'resync active' set
  34. * It is cleared (and resync-active set) when a resync starts across all drives
  35. * of the chunk.
  36. *
  37. *
  38. * The "resync active" bit is set when:
  39. * a resync is started on all drives, and resync_needed is set.
  40. * resync_needed will be cleared (as long as resync_active wasn't already set).
  41. * It is cleared when a resync completes.
  42. *
  43. * The counter counts pending write requests, plus the on-disk bit.
  44. * When the counter is '1' and the resync bits are clear, the on-disk
  45. * bit can be cleared aswell, thus setting the counter to 0.
  46. * When we set a bit, or in the counter (to start a write), if the fields is
  47. * 0, we first set the disk bit and set the counter to 1.
  48. *
  49. * If the counter is 0, the on-disk bit is clear and the stipe is clean
  50. * Anything that dirties the stipe pushes the counter to 2 (at least)
  51. * and sets the on-disk bit (lazily).
  52. * If a periodic sweep find the counter at 2, it is decremented to 1.
  53. * If the sweep find the counter at 1, the on-disk bit is cleared and the
  54. * counter goes to zero.
  55. *
  56. * Also, we'll hijack the "map" pointer itself and use it as two 16 bit block
  57. * counters as a fallback when "page" memory cannot be allocated:
  58. *
  59. * Normal case (page memory allocated):
  60. *
  61. * page pointer (32-bit)
  62. *
  63. * [ ] ------+
  64. * |
  65. * +-------> [ ][ ]..[ ] (4096 byte page == 2048 counters)
  66. * c1 c2 c2048
  67. *
  68. * Hijacked case (page memory allocation failed):
  69. *
  70. * hijacked page pointer (32-bit)
  71. *
  72. * [ ][ ] (no page memory allocated)
  73. * counter #1 (16-bit) counter #2 (16-bit)
  74. *
  75. */
  76. #ifdef __KERNEL__
  77. #define PAGE_BITS (PAGE_SIZE << 3)
  78. #define PAGE_BIT_SHIFT (PAGE_SHIFT + 3)
  79. typedef __u16 bitmap_counter_t;
  80. #define COUNTER_BITS 16
  81. #define COUNTER_BIT_SHIFT 4
  82. #define COUNTER_BYTE_RATIO (COUNTER_BITS / 8)
  83. #define COUNTER_BYTE_SHIFT (COUNTER_BIT_SHIFT - 3)
  84. #define NEEDED_MASK ((bitmap_counter_t) (1 << (COUNTER_BITS - 1)))
  85. #define RESYNC_MASK ((bitmap_counter_t) (1 << (COUNTER_BITS - 2)))
  86. #define COUNTER_MAX ((bitmap_counter_t) RESYNC_MASK - 1)
  87. #define NEEDED(x) (((bitmap_counter_t) x) & NEEDED_MASK)
  88. #define RESYNC(x) (((bitmap_counter_t) x) & RESYNC_MASK)
  89. #define COUNTER(x) (((bitmap_counter_t) x) & COUNTER_MAX)
  90. /* how many counters per page? */
  91. #define PAGE_COUNTER_RATIO (PAGE_BITS / COUNTER_BITS)
  92. /* same, except a shift value for more efficient bitops */
  93. #define PAGE_COUNTER_SHIFT (PAGE_BIT_SHIFT - COUNTER_BIT_SHIFT)
  94. /* same, except a mask value for more efficient bitops */
  95. #define PAGE_COUNTER_MASK (PAGE_COUNTER_RATIO - 1)
  96. #define BITMAP_BLOCK_SIZE 512
  97. #define BITMAP_BLOCK_SHIFT 9
  98. /* how many blocks per chunk? (this is variable) */
  99. #define CHUNK_BLOCK_RATIO(bitmap) ((bitmap)->chunksize >> BITMAP_BLOCK_SHIFT)
  100. #define CHUNK_BLOCK_SHIFT(bitmap) ((bitmap)->chunkshift - BITMAP_BLOCK_SHIFT)
  101. #define CHUNK_BLOCK_MASK(bitmap) (CHUNK_BLOCK_RATIO(bitmap) - 1)
  102. /* when hijacked, the counters and bits represent even larger "chunks" */
  103. /* there will be 1024 chunks represented by each counter in the page pointers */
  104. #define PAGEPTR_BLOCK_RATIO(bitmap) \
  105. (CHUNK_BLOCK_RATIO(bitmap) << PAGE_COUNTER_SHIFT >> 1)
  106. #define PAGEPTR_BLOCK_SHIFT(bitmap) \
  107. (CHUNK_BLOCK_SHIFT(bitmap) + PAGE_COUNTER_SHIFT - 1)
  108. #define PAGEPTR_BLOCK_MASK(bitmap) (PAGEPTR_BLOCK_RATIO(bitmap) - 1)
  109. /*
  110. * on-disk bitmap:
  111. *
  112. * Use one bit per "chunk" (block set). We do the disk I/O on the bitmap
  113. * file a page at a time. There's a superblock at the start of the file.
  114. */
  115. /* map chunks (bits) to file pages - offset by the size of the superblock */
  116. #define CHUNK_BIT_OFFSET(chunk) ((chunk) + (sizeof(bitmap_super_t) << 3))
  117. #endif
  118. /*
  119. * bitmap structures:
  120. */
  121. #define BITMAP_MAGIC 0x6d746962
  122. /* use these for bitmap->flags and bitmap->sb->state bit-fields */
  123. enum bitmap_state {
  124. BITMAP_STALE = 0x002, /* the bitmap file is out of date or had -EIO */
  125. BITMAP_WRITE_ERROR = 0x004, /* A write error has occurred */
  126. BITMAP_HOSTENDIAN = 0x8000,
  127. };
  128. /* the superblock at the front of the bitmap file -- little endian */
  129. typedef struct bitmap_super_s {
  130. __le32 magic; /* 0 BITMAP_MAGIC */
  131. __le32 version; /* 4 the bitmap major for now, could change... */
  132. __u8 uuid[16]; /* 8 128 bit uuid - must match md device uuid */
  133. __le64 events; /* 24 event counter for the bitmap (1)*/
  134. __le64 events_cleared;/*32 event counter when last bit cleared (2) */
  135. __le64 sync_size; /* 40 the size of the md device's sync range(3) */
  136. __le32 state; /* 48 bitmap state information */
  137. __le32 chunksize; /* 52 the bitmap chunk size in bytes */
  138. __le32 daemon_sleep; /* 56 seconds between disk flushes */
  139. __le32 write_behind; /* 60 number of outstanding write-behind writes */
  140. __u8 pad[256 - 64]; /* set to zero */
  141. } bitmap_super_t;
  142. /* notes:
  143. * (1) This event counter is updated before the eventcounter in the md superblock
  144. * When a bitmap is loaded, it is only accepted if this event counter is equal
  145. * to, or one greater than, the event counter in the superblock.
  146. * (2) This event counter is updated when the other one is *if*and*only*if* the
  147. * array is not degraded. As bits are not cleared when the array is degraded,
  148. * this represents the last time that any bits were cleared.
  149. * If a device is being added that has an event count with this value or
  150. * higher, it is accepted as conforming to the bitmap.
  151. * (3)This is the number of sectors represented by the bitmap, and is the range that
  152. * resync happens across. For raid1 and raid5/6 it is the size of individual
  153. * devices. For raid10 it is the size of the array.
  154. */
  155. #ifdef __KERNEL__
  156. /* the in-memory bitmap is represented by bitmap_pages */
  157. struct bitmap_page {
  158. /*
  159. * map points to the actual memory page
  160. */
  161. char *map;
  162. /*
  163. * in emergencies (when map cannot be alloced), hijack the map
  164. * pointer and use it as two counters itself
  165. */
  166. unsigned int hijacked:1;
  167. /*
  168. * count of dirty bits on the page
  169. */
  170. unsigned int count:31;
  171. };
  172. /* keep track of bitmap file pages that have pending writes on them */
  173. struct page_list {
  174. struct list_head list;
  175. struct page *page;
  176. };
  177. /* the main bitmap structure - one per mddev */
  178. struct bitmap {
  179. struct bitmap_page *bp;
  180. unsigned long pages; /* total number of pages in the bitmap */
  181. unsigned long missing_pages; /* number of pages not yet allocated */
  182. mddev_t *mddev; /* the md device that the bitmap is for */
  183. int counter_bits; /* how many bits per block counter */
  184. /* bitmap chunksize -- how much data does each bit represent? */
  185. unsigned long chunksize;
  186. unsigned long chunkshift; /* chunksize = 2^chunkshift (for bitops) */
  187. unsigned long chunks; /* total number of data chunks for the array */
  188. /* We hold a count on the chunk currently being synced, and drop
  189. * it when the last block is started. If the resync is aborted
  190. * midway, we need to be able to drop that count, so we remember
  191. * the counted chunk..
  192. */
  193. unsigned long syncchunk;
  194. __u64 events_cleared;
  195. int need_sync;
  196. /* bitmap spinlock */
  197. spinlock_t lock;
  198. long offset; /* offset from superblock if file is NULL */
  199. struct file *file; /* backing disk file */
  200. struct page *sb_page; /* cached copy of the bitmap file superblock */
  201. struct page **filemap; /* list of cache pages for the file */
  202. unsigned long *filemap_attr; /* attributes associated w/ filemap pages */
  203. unsigned long file_pages; /* number of pages in the file */
  204. int last_page_size; /* bytes in the last page */
  205. unsigned long flags;
  206. int allclean;
  207. unsigned long max_write_behind; /* write-behind mode */
  208. atomic_t behind_writes;
  209. /*
  210. * the bitmap daemon - periodically wakes up and sweeps the bitmap
  211. * file, cleaning up bits and flushing out pages to disk as necessary
  212. */
  213. unsigned long daemon_lastrun; /* jiffies of last run */
  214. unsigned long daemon_sleep; /* how many seconds between updates? */
  215. unsigned long last_end_sync; /* when we lasted called end_sync to
  216. * update bitmap with resync progress */
  217. atomic_t pending_writes; /* pending writes to the bitmap file */
  218. wait_queue_head_t write_wait;
  219. wait_queue_head_t overflow_wait;
  220. };
  221. /* the bitmap API */
  222. /* these are used only by md/bitmap */
  223. int bitmap_create(mddev_t *mddev);
  224. void bitmap_flush(mddev_t *mddev);
  225. void bitmap_destroy(mddev_t *mddev);
  226. void bitmap_print_sb(struct bitmap *bitmap);
  227. void bitmap_update_sb(struct bitmap *bitmap);
  228. int bitmap_setallbits(struct bitmap *bitmap);
  229. void bitmap_write_all(struct bitmap *bitmap);
  230. void bitmap_dirty_bits(struct bitmap *bitmap, unsigned long s, unsigned long e);
  231. /* these are exported */
  232. int bitmap_startwrite(struct bitmap *bitmap, sector_t offset,
  233. unsigned long sectors, int behind);
  234. void bitmap_endwrite(struct bitmap *bitmap, sector_t offset,
  235. unsigned long sectors, int success, int behind);
  236. int bitmap_start_sync(struct bitmap *bitmap, sector_t offset, int *blocks, int degraded);
  237. void bitmap_end_sync(struct bitmap *bitmap, sector_t offset, int *blocks, int aborted);
  238. void bitmap_close_sync(struct bitmap *bitmap);
  239. void bitmap_cond_end_sync(struct bitmap *bitmap, sector_t sector);
  240. void bitmap_unplug(struct bitmap *bitmap);
  241. void bitmap_daemon_work(struct bitmap *bitmap);
  242. #endif
  243. #endif