blob: ddd29770819417436766c9b34f924582acc2b5a5 [file] [log] [blame]
Philipp Reisnerb411b362009-09-25 16:07:19 -07001/*
2 drbd_bitmap.c
3
4 This file is part of DRBD by Philipp Reisner and Lars Ellenberg.
5
6 Copyright (C) 2004-2008, LINBIT Information Technologies GmbH.
7 Copyright (C) 2004-2008, Philipp Reisner <philipp.reisner@linbit.com>.
8 Copyright (C) 2004-2008, Lars Ellenberg <lars.ellenberg@linbit.com>.
9
10 drbd is free software; you can redistribute it and/or modify
11 it under the terms of the GNU General Public License as published by
12 the Free Software Foundation; either version 2, or (at your option)
13 any later version.
14
15 drbd is distributed in the hope that it will be useful,
16 but WITHOUT ANY WARRANTY; without even the implied warranty of
17 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
18 GNU General Public License for more details.
19
20 You should have received a copy of the GNU General Public License
21 along with drbd; see the file COPYING. If not, write to
22 the Free Software Foundation, 675 Mass Ave, Cambridge, MA 02139, USA.
23 */
24
25#include <linux/bitops.h>
26#include <linux/vmalloc.h>
27#include <linux/string.h>
28#include <linux/drbd.h>
Tejun Heo5a0e3ad2010-03-24 17:04:11 +090029#include <linux/slab.h>
Philipp Reisnerb411b362009-09-25 16:07:19 -070030#include <asm/kmap_types.h>
Stephen Rothwellf0ff1352011-03-17 15:02:51 +010031
Philipp Reisnerb411b362009-09-25 16:07:19 -070032#include "drbd_int.h"
33
Lars Ellenberg95a0f102010-12-15 08:59:09 +010034
Philipp Reisnerb411b362009-09-25 16:07:19 -070035/* OPAQUE outside this file!
36 * interface defined in drbd_int.h
37
38 * convention:
39 * function name drbd_bm_... => used elsewhere, "public".
40 * function name bm_... => internal to implementation, "private".
Lars Ellenberg4b0715f2010-12-14 15:13:04 +010041 */
Philipp Reisnerb411b362009-09-25 16:07:19 -070042
Lars Ellenberg4b0715f2010-12-14 15:13:04 +010043
44/*
45 * LIMITATIONS:
46 * We want to support >= peta byte of backend storage, while for now still using
47 * a granularity of one bit per 4KiB of storage.
48 * 1 << 50 bytes backend storage (1 PiB)
49 * 1 << (50 - 12) bits needed
50 * 38 --> we need u64 to index and count bits
51 * 1 << (38 - 3) bitmap bytes needed
52 * 35 --> we still need u64 to index and count bytes
53 * (that's 32 GiB of bitmap for 1 PiB storage)
54 * 1 << (35 - 2) 32bit longs needed
55 * 33 --> we'd even need u64 to index and count 32bit long words.
56 * 1 << (35 - 3) 64bit longs needed
57 * 32 --> we could get away with a 32bit unsigned int to index and count
58 * 64bit long words, but I rather stay with unsigned long for now.
59 * We probably should neither count nor point to bytes or long words
60 * directly, but either by bitnumber, or by page index and offset.
61 * 1 << (35 - 12)
62 * 22 --> we need that much 4KiB pages of bitmap.
63 * 1 << (22 + 3) --> on a 64bit arch,
64 * we need 32 MiB to store the array of page pointers.
65 *
66 * Because I'm lazy, and because the resulting patch was too large, too ugly
67 * and still incomplete, on 32bit we still "only" support 16 TiB (minus some),
68 * (1 << 32) bits * 4k storage.
69 *
70
71 * bitmap storage and IO:
72 * Bitmap is stored little endian on disk, and is kept little endian in
73 * core memory. Currently we still hold the full bitmap in core as long
74 * as we are "attached" to a local disk, which at 32 GiB for 1PiB storage
75 * seems excessive.
76 *
Bart Van Assche24c48302011-05-21 18:32:29 +020077 * We plan to reduce the amount of in-core bitmap pages by paging them in
Lars Ellenberg4b0715f2010-12-14 15:13:04 +010078 * and out against their on-disk location as necessary, but need to make
79 * sure we don't cause too much meta data IO, and must not deadlock in
80 * tight memory situations. This needs some more work.
Philipp Reisnerb411b362009-09-25 16:07:19 -070081 */
82
83/*
84 * NOTE
85 * Access to the *bm_pages is protected by bm_lock.
86 * It is safe to read the other members within the lock.
87 *
88 * drbd_bm_set_bits is called from bio_endio callbacks,
89 * We may be called with irq already disabled,
90 * so we need spin_lock_irqsave().
91 * And we need the kmap_atomic.
92 */
93struct drbd_bitmap {
94 struct page **bm_pages;
95 spinlock_t bm_lock;
Lars Ellenberg4b0715f2010-12-14 15:13:04 +010096
97 /* see LIMITATIONS: above */
98
Philipp Reisnerb411b362009-09-25 16:07:19 -070099 unsigned long bm_set; /* nr of set bits; THINK maybe atomic_t? */
100 unsigned long bm_bits;
101 size_t bm_words;
102 size_t bm_number_of_pages;
103 sector_t bm_dev_capacity;
Thomas Gleixner8a03ae22010-01-29 20:39:07 +0000104 struct mutex bm_change; /* serializes resize operations */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700105
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100106 wait_queue_head_t bm_io_wait; /* used to serialize IO of single pages */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700107
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100108 enum bm_flag bm_flags;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700109
110 /* debugging aid, in case we are still racy somewhere */
111 char *bm_why;
112 struct task_struct *bm_task;
113};
114
Philipp Reisnerb411b362009-09-25 16:07:19 -0700115#define bm_print_lock_info(m) __bm_print_lock_info(m, __func__)
116static void __bm_print_lock_info(struct drbd_conf *mdev, const char *func)
117{
118 struct drbd_bitmap *b = mdev->bitmap;
119 if (!__ratelimit(&drbd_ratelimit_state))
120 return;
121 dev_err(DEV, "FIXME %s in %s, bitmap locked for '%s' by %s\n",
Philipp Reisner392c8802011-02-09 10:33:31 +0100122 drbd_task_to_thread_name(mdev->tconn, current),
Philipp Reisnerbed879a2011-02-04 14:00:37 +0100123 func, b->bm_why ?: "?",
Philipp Reisner392c8802011-02-09 10:33:31 +0100124 drbd_task_to_thread_name(mdev->tconn, b->bm_task));
Philipp Reisnerb411b362009-09-25 16:07:19 -0700125}
126
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100127void drbd_bm_lock(struct drbd_conf *mdev, char *why, enum bm_flag flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700128{
129 struct drbd_bitmap *b = mdev->bitmap;
130 int trylock_failed;
131
132 if (!b) {
133 dev_err(DEV, "FIXME no bitmap in drbd_bm_lock!?\n");
134 return;
135 }
136
Thomas Gleixner8a03ae22010-01-29 20:39:07 +0000137 trylock_failed = !mutex_trylock(&b->bm_change);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700138
139 if (trylock_failed) {
140 dev_warn(DEV, "%s going to '%s' but bitmap already locked for '%s' by %s\n",
Philipp Reisner392c8802011-02-09 10:33:31 +0100141 drbd_task_to_thread_name(mdev->tconn, current),
Philipp Reisnerbed879a2011-02-04 14:00:37 +0100142 why, b->bm_why ?: "?",
Philipp Reisner392c8802011-02-09 10:33:31 +0100143 drbd_task_to_thread_name(mdev->tconn, b->bm_task));
Thomas Gleixner8a03ae22010-01-29 20:39:07 +0000144 mutex_lock(&b->bm_change);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700145 }
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100146 if (BM_LOCKED_MASK & b->bm_flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700147 dev_err(DEV, "FIXME bitmap already locked in bm_lock\n");
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100148 b->bm_flags |= flags & BM_LOCKED_MASK;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700149
150 b->bm_why = why;
151 b->bm_task = current;
152}
153
154void drbd_bm_unlock(struct drbd_conf *mdev)
155{
156 struct drbd_bitmap *b = mdev->bitmap;
157 if (!b) {
158 dev_err(DEV, "FIXME no bitmap in drbd_bm_unlock!?\n");
159 return;
160 }
161
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100162 if (!(BM_LOCKED_MASK & mdev->bitmap->bm_flags))
Philipp Reisnerb411b362009-09-25 16:07:19 -0700163 dev_err(DEV, "FIXME bitmap not locked in bm_unlock\n");
164
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100165 b->bm_flags &= ~BM_LOCKED_MASK;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700166 b->bm_why = NULL;
167 b->bm_task = NULL;
Thomas Gleixner8a03ae22010-01-29 20:39:07 +0000168 mutex_unlock(&b->bm_change);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700169}
170
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100171/* we store some "meta" info about our pages in page->private */
172/* at a granularity of 4k storage per bitmap bit:
173 * one peta byte storage: 1<<50 byte, 1<<38 * 4k storage blocks
174 * 1<<38 bits,
175 * 1<<23 4k bitmap pages.
176 * Use 24 bits as page index, covers 2 peta byte storage
177 * at a granularity of 4k per bit.
178 * Used to report the failed page idx on io error from the endio handlers.
179 */
180#define BM_PAGE_IDX_MASK ((1UL<<24)-1)
181/* this page is currently read in, or written back */
182#define BM_PAGE_IO_LOCK 31
183/* if there has been an IO error for this page */
184#define BM_PAGE_IO_ERROR 30
185/* this is to be able to intelligently skip disk IO,
186 * set if bits have been set since last IO. */
187#define BM_PAGE_NEED_WRITEOUT 29
188/* to mark for lazy writeout once syncer cleared all clearable bits,
189 * we if bits have been cleared since last IO. */
190#define BM_PAGE_LAZY_WRITEOUT 28
Lars Ellenberg45dfffe2011-02-21 13:21:00 +0100191/* pages marked with this "HINT" will be considered for writeout
192 * on activity log transactions */
193#define BM_PAGE_HINT_WRITEOUT 27
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100194
Bart Van Assche24c48302011-05-21 18:32:29 +0200195/* store_page_idx uses non-atomic assignment. It is only used directly after
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100196 * allocating the page. All other bm_set_page_* and bm_clear_page_* need to
197 * use atomic bit manipulation, as set_out_of_sync (and therefore bitmap
198 * changes) may happen from various contexts, and wait_on_bit/wake_up_bit
199 * requires it all to be atomic as well. */
200static void bm_store_page_idx(struct page *page, unsigned long idx)
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100201{
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100202 BUG_ON(0 != (idx & ~BM_PAGE_IDX_MASK));
203 page_private(page) |= idx;
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100204}
205
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100206static unsigned long bm_page_to_idx(struct page *page)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700207{
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100208 return page_private(page) & BM_PAGE_IDX_MASK;
209}
Philipp Reisnerb411b362009-09-25 16:07:19 -0700210
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100211/* As is very unlikely that the same page is under IO from more than one
212 * context, we can get away with a bit per page and one wait queue per bitmap.
213 */
214static void bm_page_lock_io(struct drbd_conf *mdev, int page_nr)
215{
216 struct drbd_bitmap *b = mdev->bitmap;
217 void *addr = &page_private(b->bm_pages[page_nr]);
218 wait_event(b->bm_io_wait, !test_and_set_bit(BM_PAGE_IO_LOCK, addr));
219}
220
221static void bm_page_unlock_io(struct drbd_conf *mdev, int page_nr)
222{
223 struct drbd_bitmap *b = mdev->bitmap;
224 void *addr = &page_private(b->bm_pages[page_nr]);
Lars Ellenberg4738fa12011-02-21 13:20:55 +0100225 clear_bit_unlock(BM_PAGE_IO_LOCK, addr);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100226 wake_up(&mdev->bitmap->bm_io_wait);
227}
228
229/* set _before_ submit_io, so it may be reset due to being changed
230 * while this page is in flight... will get submitted later again */
231static void bm_set_page_unchanged(struct page *page)
232{
233 /* use cmpxchg? */
234 clear_bit(BM_PAGE_NEED_WRITEOUT, &page_private(page));
235 clear_bit(BM_PAGE_LAZY_WRITEOUT, &page_private(page));
236}
237
238static void bm_set_page_need_writeout(struct page *page)
239{
240 set_bit(BM_PAGE_NEED_WRITEOUT, &page_private(page));
241}
242
Lars Ellenberg45dfffe2011-02-21 13:21:00 +0100243/**
244 * drbd_bm_mark_for_writeout() - mark a page with a "hint" to be considered for writeout
245 * @mdev: DRBD device.
246 * @page_nr: the bitmap page to mark with the "hint" flag
247 *
248 * From within an activity log transaction, we mark a few pages with these
249 * hints, then call drbd_bm_write_hinted(), which will only write out changed
250 * pages which are flagged with this mark.
251 */
252void drbd_bm_mark_for_writeout(struct drbd_conf *mdev, int page_nr)
253{
254 struct page *page;
255 if (page_nr >= mdev->bitmap->bm_number_of_pages) {
256 dev_warn(DEV, "BAD: page_nr: %u, number_of_pages: %u\n",
257 page_nr, (int)mdev->bitmap->bm_number_of_pages);
258 return;
259 }
260 page = mdev->bitmap->bm_pages[page_nr];
261 set_bit(BM_PAGE_HINT_WRITEOUT, &page_private(page));
262}
263
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100264static int bm_test_page_unchanged(struct page *page)
265{
266 volatile const unsigned long *addr = &page_private(page);
267 return (*addr & ((1UL<<BM_PAGE_NEED_WRITEOUT)|(1UL<<BM_PAGE_LAZY_WRITEOUT))) == 0;
268}
269
270static void bm_set_page_io_err(struct page *page)
271{
272 set_bit(BM_PAGE_IO_ERROR, &page_private(page));
273}
274
275static void bm_clear_page_io_err(struct page *page)
276{
277 clear_bit(BM_PAGE_IO_ERROR, &page_private(page));
278}
279
280static void bm_set_page_lazy_writeout(struct page *page)
281{
282 set_bit(BM_PAGE_LAZY_WRITEOUT, &page_private(page));
283}
284
285static int bm_test_page_lazy_writeout(struct page *page)
286{
287 return test_bit(BM_PAGE_LAZY_WRITEOUT, &page_private(page));
288}
289
290/* on a 32bit box, this would allow for exactly (2<<38) bits. */
291static unsigned int bm_word_to_page_idx(struct drbd_bitmap *b, unsigned long long_nr)
292{
Philipp Reisnerb411b362009-09-25 16:07:19 -0700293 /* page_nr = (word*sizeof(long)) >> PAGE_SHIFT; */
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100294 unsigned int page_nr = long_nr >> (PAGE_SHIFT - LN2_BPL + 3);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700295 BUG_ON(page_nr >= b->bm_number_of_pages);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100296 return page_nr;
297}
Philipp Reisnerb411b362009-09-25 16:07:19 -0700298
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100299static unsigned int bm_bit_to_page_idx(struct drbd_bitmap *b, u64 bitnr)
300{
301 /* page_nr = (bitnr/8) >> PAGE_SHIFT; */
302 unsigned int page_nr = bitnr >> (PAGE_SHIFT + 3);
303 BUG_ON(page_nr >= b->bm_number_of_pages);
304 return page_nr;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700305}
306
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100307static unsigned long *__bm_map_pidx(struct drbd_bitmap *b, unsigned int idx, const enum km_type km)
308{
309 struct page *page = b->bm_pages[idx];
310 return (unsigned long *) kmap_atomic(page, km);
311}
312
313static unsigned long *bm_map_pidx(struct drbd_bitmap *b, unsigned int idx)
314{
315 return __bm_map_pidx(b, idx, KM_IRQ1);
316}
317
Philipp Reisnerb411b362009-09-25 16:07:19 -0700318static void __bm_unmap(unsigned long *p_addr, const enum km_type km)
319{
320 kunmap_atomic(p_addr, km);
321};
322
323static void bm_unmap(unsigned long *p_addr)
324{
325 return __bm_unmap(p_addr, KM_IRQ1);
326}
327
328/* long word offset of _bitmap_ sector */
329#define S2W(s) ((s)<<(BM_EXT_SHIFT-BM_BLOCK_SHIFT-LN2_BPL))
330/* word offset from start of bitmap to word number _in_page_
331 * modulo longs per page
332#define MLPP(X) ((X) % (PAGE_SIZE/sizeof(long))
Bart Van Assche24c48302011-05-21 18:32:29 +0200333 hm, well, Philipp thinks gcc might not optimize the % into & (... - 1)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700334 so do it explicitly:
335 */
336#define MLPP(X) ((X) & ((PAGE_SIZE/sizeof(long))-1))
337
338/* Long words per page */
339#define LWPP (PAGE_SIZE/sizeof(long))
340
341/*
342 * actually most functions herein should take a struct drbd_bitmap*, not a
343 * struct drbd_conf*, but for the debug macros I like to have the mdev around
344 * to be able to report device specific.
345 */
346
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100347
Philipp Reisnerb411b362009-09-25 16:07:19 -0700348static void bm_free_pages(struct page **pages, unsigned long number)
349{
350 unsigned long i;
351 if (!pages)
352 return;
353
354 for (i = 0; i < number; i++) {
355 if (!pages[i]) {
356 printk(KERN_ALERT "drbd: bm_free_pages tried to free "
357 "a NULL pointer; i=%lu n=%lu\n",
358 i, number);
359 continue;
360 }
361 __free_page(pages[i]);
362 pages[i] = NULL;
363 }
364}
365
366static void bm_vk_free(void *ptr, int v)
367{
368 if (v)
369 vfree(ptr);
370 else
371 kfree(ptr);
372}
373
374/*
375 * "have" and "want" are NUMBER OF PAGES.
376 */
377static struct page **bm_realloc_pages(struct drbd_bitmap *b, unsigned long want)
378{
379 struct page **old_pages = b->bm_pages;
380 struct page **new_pages, *page;
381 unsigned int i, bytes, vmalloced = 0;
382 unsigned long have = b->bm_number_of_pages;
383
384 BUG_ON(have == 0 && old_pages != NULL);
385 BUG_ON(have != 0 && old_pages == NULL);
386
387 if (have == want)
388 return old_pages;
389
390 /* Trying kmalloc first, falling back to vmalloc.
391 * GFP_KERNEL is ok, as this is done when a lower level disk is
Andreas Gruenbachera209b4a2011-08-17 12:43:25 +0200392 * "attached" to the drbd. Context is receiver thread or drbdsetup /
393 * netlink process. As we have no disk yet, we are not in the IO path,
Philipp Reisnerb411b362009-09-25 16:07:19 -0700394 * not even the IO path of the peer. */
395 bytes = sizeof(struct page *)*want;
396 new_pages = kmalloc(bytes, GFP_KERNEL);
397 if (!new_pages) {
398 new_pages = vmalloc(bytes);
399 if (!new_pages)
400 return NULL;
401 vmalloced = 1;
402 }
403
404 memset(new_pages, 0, bytes);
405 if (want >= have) {
406 for (i = 0; i < have; i++)
407 new_pages[i] = old_pages[i];
408 for (; i < want; i++) {
409 page = alloc_page(GFP_HIGHUSER);
410 if (!page) {
411 bm_free_pages(new_pages + have, i - have);
412 bm_vk_free(new_pages, vmalloced);
413 return NULL;
414 }
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100415 /* we want to know which page it is
416 * from the endio handlers */
417 bm_store_page_idx(page, i);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700418 new_pages[i] = page;
419 }
420 } else {
421 for (i = 0; i < want; i++)
422 new_pages[i] = old_pages[i];
423 /* NOT HERE, we are outside the spinlock!
424 bm_free_pages(old_pages + want, have - want);
425 */
426 }
427
428 if (vmalloced)
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100429 b->bm_flags |= BM_P_VMALLOCED;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700430 else
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100431 b->bm_flags &= ~BM_P_VMALLOCED;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700432
433 return new_pages;
434}
435
436/*
437 * called on driver init only. TODO call when a device is created.
438 * allocates the drbd_bitmap, and stores it in mdev->bitmap.
439 */
440int drbd_bm_init(struct drbd_conf *mdev)
441{
442 struct drbd_bitmap *b = mdev->bitmap;
443 WARN_ON(b != NULL);
444 b = kzalloc(sizeof(struct drbd_bitmap), GFP_KERNEL);
445 if (!b)
446 return -ENOMEM;
447 spin_lock_init(&b->bm_lock);
Thomas Gleixner8a03ae22010-01-29 20:39:07 +0000448 mutex_init(&b->bm_change);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700449 init_waitqueue_head(&b->bm_io_wait);
450
451 mdev->bitmap = b;
452
453 return 0;
454}
455
456sector_t drbd_bm_capacity(struct drbd_conf *mdev)
457{
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100458 if (!expect(mdev->bitmap))
459 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700460 return mdev->bitmap->bm_dev_capacity;
461}
462
463/* called on driver unload. TODO: call when a device is destroyed.
464 */
465void drbd_bm_cleanup(struct drbd_conf *mdev)
466{
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100467 if (!expect(mdev->bitmap))
468 return;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700469 bm_free_pages(mdev->bitmap->bm_pages, mdev->bitmap->bm_number_of_pages);
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100470 bm_vk_free(mdev->bitmap->bm_pages, (BM_P_VMALLOCED & mdev->bitmap->bm_flags));
Philipp Reisnerb411b362009-09-25 16:07:19 -0700471 kfree(mdev->bitmap);
472 mdev->bitmap = NULL;
473}
474
475/*
476 * since (b->bm_bits % BITS_PER_LONG) != 0,
477 * this masks out the remaining bits.
478 * Returns the number of bits cleared.
479 */
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100480#define BITS_PER_PAGE (1UL << (PAGE_SHIFT + 3))
481#define BITS_PER_PAGE_MASK (BITS_PER_PAGE - 1)
482#define BITS_PER_LONG_MASK (BITS_PER_LONG - 1)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700483static int bm_clear_surplus(struct drbd_bitmap *b)
484{
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100485 unsigned long mask;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700486 unsigned long *p_addr, *bm;
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100487 int tmp;
488 int cleared = 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700489
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100490 /* number of bits modulo bits per page */
491 tmp = (b->bm_bits & BITS_PER_PAGE_MASK);
492 /* mask the used bits of the word containing the last bit */
493 mask = (1UL << (tmp & BITS_PER_LONG_MASK)) -1;
494 /* bitmap is always stored little endian,
495 * on disk and in core memory alike */
496 mask = cpu_to_lel(mask);
497
Lars Ellenberg6850c442010-12-16 00:32:38 +0100498 p_addr = bm_map_pidx(b, b->bm_number_of_pages - 1);
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100499 bm = p_addr + (tmp/BITS_PER_LONG);
500 if (mask) {
501 /* If mask != 0, we are not exactly aligned, so bm now points
502 * to the long containing the last bit.
503 * If mask == 0, bm already points to the word immediately
504 * after the last (long word aligned) bit. */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700505 cleared = hweight_long(*bm & ~mask);
506 *bm &= mask;
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100507 bm++;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700508 }
509
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100510 if (BITS_PER_LONG == 32 && ((bm - p_addr) & 1) == 1) {
511 /* on a 32bit arch, we may need to zero out
512 * a padding long to align with a 64bit remote */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700513 cleared += hweight_long(*bm);
514 *bm = 0;
515 }
516 bm_unmap(p_addr);
517 return cleared;
518}
519
520static void bm_set_surplus(struct drbd_bitmap *b)
521{
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100522 unsigned long mask;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700523 unsigned long *p_addr, *bm;
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100524 int tmp;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700525
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100526 /* number of bits modulo bits per page */
527 tmp = (b->bm_bits & BITS_PER_PAGE_MASK);
528 /* mask the used bits of the word containing the last bit */
529 mask = (1UL << (tmp & BITS_PER_LONG_MASK)) -1;
530 /* bitmap is always stored little endian,
531 * on disk and in core memory alike */
532 mask = cpu_to_lel(mask);
533
Lars Ellenberg6850c442010-12-16 00:32:38 +0100534 p_addr = bm_map_pidx(b, b->bm_number_of_pages - 1);
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100535 bm = p_addr + (tmp/BITS_PER_LONG);
536 if (mask) {
537 /* If mask != 0, we are not exactly aligned, so bm now points
538 * to the long containing the last bit.
539 * If mask == 0, bm already points to the word immediately
540 * after the last (long word aligned) bit. */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700541 *bm |= ~mask;
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100542 bm++;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700543 }
544
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100545 if (BITS_PER_LONG == 32 && ((bm - p_addr) & 1) == 1) {
546 /* on a 32bit arch, we may need to zero out
547 * a padding long to align with a 64bit remote */
548 *bm = ~0UL;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700549 }
550 bm_unmap(p_addr);
551}
552
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100553/* you better not modify the bitmap while this is running,
554 * or its results will be stale */
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100555static unsigned long bm_count_bits(struct drbd_bitmap *b)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700556{
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100557 unsigned long *p_addr;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700558 unsigned long bits = 0;
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100559 unsigned long mask = (1UL << (b->bm_bits & BITS_PER_LONG_MASK)) -1;
Lars Ellenberg6850c442010-12-16 00:32:38 +0100560 int idx, i, last_word;
Lars Ellenberg7777a8b2010-12-15 23:21:39 +0100561
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100562 /* all but last page */
Lars Ellenberg6850c442010-12-16 00:32:38 +0100563 for (idx = 0; idx < b->bm_number_of_pages - 1; idx++) {
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100564 p_addr = __bm_map_pidx(b, idx, KM_USER0);
565 for (i = 0; i < LWPP; i++)
566 bits += hweight_long(p_addr[i]);
Lars Ellenberg7777a8b2010-12-15 23:21:39 +0100567 __bm_unmap(p_addr, KM_USER0);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700568 cond_resched();
569 }
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100570 /* last (or only) page */
571 last_word = ((b->bm_bits - 1) & BITS_PER_PAGE_MASK) >> LN2_BPL;
572 p_addr = __bm_map_pidx(b, idx, KM_USER0);
573 for (i = 0; i < last_word; i++)
574 bits += hweight_long(p_addr[i]);
575 p_addr[last_word] &= cpu_to_lel(mask);
576 bits += hweight_long(p_addr[last_word]);
577 /* 32bit arch, may have an unused padding long */
578 if (BITS_PER_LONG == 32 && (last_word & 1) == 0)
579 p_addr[last_word+1] = 0;
580 __bm_unmap(p_addr, KM_USER0);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700581 return bits;
582}
583
Philipp Reisnerb411b362009-09-25 16:07:19 -0700584/* offset and len in long words.*/
585static void bm_memset(struct drbd_bitmap *b, size_t offset, int c, size_t len)
586{
587 unsigned long *p_addr, *bm;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100588 unsigned int idx;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700589 size_t do_now, end;
590
Philipp Reisnerb411b362009-09-25 16:07:19 -0700591 end = offset + len;
592
593 if (end > b->bm_words) {
594 printk(KERN_ALERT "drbd: bm_memset end > bm_words\n");
595 return;
596 }
597
598 while (offset < end) {
599 do_now = min_t(size_t, ALIGN(offset + 1, LWPP), end) - offset;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100600 idx = bm_word_to_page_idx(b, offset);
601 p_addr = bm_map_pidx(b, idx);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700602 bm = p_addr + MLPP(offset);
603 if (bm+do_now > p_addr + LWPP) {
604 printk(KERN_ALERT "drbd: BUG BUG BUG! p_addr:%p bm:%p do_now:%d\n",
605 p_addr, bm, (int)do_now);
Lars Ellenberg84e7c0f2010-12-16 00:37:57 +0100606 } else
607 memset(bm, c, do_now * sizeof(long));
Philipp Reisnerb411b362009-09-25 16:07:19 -0700608 bm_unmap(p_addr);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100609 bm_set_page_need_writeout(b->bm_pages[idx]);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700610 offset += do_now;
611 }
612}
613
614/*
615 * make sure the bitmap has enough room for the attached storage,
616 * if necessary, resize.
617 * called whenever we may have changed the device size.
618 * returns -ENOMEM if we could not allocate enough memory, 0 on success.
619 * In case this is actually a resize, we copy the old bitmap into the new one.
620 * Otherwise, the bitmap is initialized to all bits set.
621 */
Philipp Reisner02d9a942010-03-24 16:23:03 +0100622int drbd_bm_resize(struct drbd_conf *mdev, sector_t capacity, int set_new_bits)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700623{
624 struct drbd_bitmap *b = mdev->bitmap;
Lars Ellenberg6850c442010-12-16 00:32:38 +0100625 unsigned long bits, words, owords, obits;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700626 unsigned long want, have, onpages; /* number of pages */
627 struct page **npages, **opages = NULL;
628 int err = 0, growing;
629 int opages_vmalloced;
630
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100631 if (!expect(b))
632 return -ENOMEM;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700633
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100634 drbd_bm_lock(mdev, "resize", BM_LOCKED_MASK);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700635
636 dev_info(DEV, "drbd_bm_resize called with capacity == %llu\n",
637 (unsigned long long)capacity);
638
639 if (capacity == b->bm_dev_capacity)
640 goto out;
641
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +0100642 opages_vmalloced = (BM_P_VMALLOCED & b->bm_flags);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700643
644 if (capacity == 0) {
645 spin_lock_irq(&b->bm_lock);
646 opages = b->bm_pages;
647 onpages = b->bm_number_of_pages;
648 owords = b->bm_words;
649 b->bm_pages = NULL;
650 b->bm_number_of_pages =
651 b->bm_set =
652 b->bm_bits =
653 b->bm_words =
654 b->bm_dev_capacity = 0;
655 spin_unlock_irq(&b->bm_lock);
656 bm_free_pages(opages, onpages);
657 bm_vk_free(opages, opages_vmalloced);
658 goto out;
659 }
660 bits = BM_SECT_TO_BIT(ALIGN(capacity, BM_SECT_PER_BIT));
661
662 /* if we would use
663 words = ALIGN(bits,BITS_PER_LONG) >> LN2_BPL;
664 a 32bit host could present the wrong number of words
665 to a 64bit host.
666 */
667 words = ALIGN(bits, 64) >> LN2_BPL;
668
669 if (get_ldev(mdev)) {
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100670 u64 bits_on_disk = ((u64)mdev->ldev->md.md_size_sect-MD_BM_OFFSET) << 12;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700671 put_ldev(mdev);
Lars Ellenberg4b0715f2010-12-14 15:13:04 +0100672 if (bits > bits_on_disk) {
673 dev_info(DEV, "bits = %lu\n", bits);
674 dev_info(DEV, "bits_on_disk = %llu\n", bits_on_disk);
675 err = -ENOSPC;
676 goto out;
677 }
Philipp Reisnerb411b362009-09-25 16:07:19 -0700678 }
679
Lars Ellenberg6850c442010-12-16 00:32:38 +0100680 want = ALIGN(words*sizeof(long), PAGE_SIZE) >> PAGE_SHIFT;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700681 have = b->bm_number_of_pages;
682 if (want == have) {
683 D_ASSERT(b->bm_pages != NULL);
684 npages = b->bm_pages;
685 } else {
Andreas Gruenbacher0cf9d272010-12-07 10:43:29 +0100686 if (drbd_insert_fault(mdev, DRBD_FAULT_BM_ALLOC))
Philipp Reisnerb411b362009-09-25 16:07:19 -0700687 npages = NULL;
688 else
689 npages = bm_realloc_pages(b, want);
690 }
691
692 if (!npages) {
693 err = -ENOMEM;
694 goto out;
695 }
696
697 spin_lock_irq(&b->bm_lock);
698 opages = b->bm_pages;
699 owords = b->bm_words;
700 obits = b->bm_bits;
701
702 growing = bits > obits;
Philipp Reisner52236712010-04-28 14:46:57 +0200703 if (opages && growing && set_new_bits)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700704 bm_set_surplus(b);
705
706 b->bm_pages = npages;
707 b->bm_number_of_pages = want;
708 b->bm_bits = bits;
709 b->bm_words = words;
710 b->bm_dev_capacity = capacity;
711
712 if (growing) {
Philipp Reisner02d9a942010-03-24 16:23:03 +0100713 if (set_new_bits) {
714 bm_memset(b, owords, 0xff, words-owords);
715 b->bm_set += bits - obits;
716 } else
717 bm_memset(b, owords, 0x00, words-owords);
718
Philipp Reisnerb411b362009-09-25 16:07:19 -0700719 }
720
721 if (want < have) {
722 /* implicit: (opages != NULL) && (opages != npages) */
723 bm_free_pages(opages + want, have - want);
724 }
725
Philipp Reisnerb411b362009-09-25 16:07:19 -0700726 (void)bm_clear_surplus(b);
727
728 spin_unlock_irq(&b->bm_lock);
729 if (opages != npages)
730 bm_vk_free(opages, opages_vmalloced);
731 if (!growing)
732 b->bm_set = bm_count_bits(b);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100733 dev_info(DEV, "resync bitmap: bits=%lu words=%lu pages=%lu\n", bits, words, want);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700734
735 out:
736 drbd_bm_unlock(mdev);
737 return err;
738}
739
740/* inherently racy:
741 * if not protected by other means, return value may be out of date when
742 * leaving this function...
743 * we still need to lock it, since it is important that this returns
744 * bm_set == 0 precisely.
745 *
746 * maybe bm_set should be atomic_t ?
747 */
Philipp Reisner07782862010-08-31 12:00:50 +0200748unsigned long _drbd_bm_total_weight(struct drbd_conf *mdev)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700749{
750 struct drbd_bitmap *b = mdev->bitmap;
751 unsigned long s;
752 unsigned long flags;
753
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100754 if (!expect(b))
755 return 0;
756 if (!expect(b->bm_pages))
757 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700758
759 spin_lock_irqsave(&b->bm_lock, flags);
760 s = b->bm_set;
761 spin_unlock_irqrestore(&b->bm_lock, flags);
762
763 return s;
764}
765
766unsigned long drbd_bm_total_weight(struct drbd_conf *mdev)
767{
768 unsigned long s;
769 /* if I don't have a disk, I don't know about out-of-sync status */
770 if (!get_ldev_if_state(mdev, D_NEGOTIATING))
771 return 0;
772 s = _drbd_bm_total_weight(mdev);
773 put_ldev(mdev);
774 return s;
775}
776
777size_t drbd_bm_words(struct drbd_conf *mdev)
778{
779 struct drbd_bitmap *b = mdev->bitmap;
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100780 if (!expect(b))
781 return 0;
782 if (!expect(b->bm_pages))
783 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700784
785 return b->bm_words;
786}
787
788unsigned long drbd_bm_bits(struct drbd_conf *mdev)
789{
790 struct drbd_bitmap *b = mdev->bitmap;
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100791 if (!expect(b))
792 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700793
794 return b->bm_bits;
795}
796
797/* merge number words from buffer into the bitmap starting at offset.
798 * buffer[i] is expected to be little endian unsigned long.
799 * bitmap must be locked by drbd_bm_lock.
800 * currently only used from receive_bitmap.
801 */
802void drbd_bm_merge_lel(struct drbd_conf *mdev, size_t offset, size_t number,
803 unsigned long *buffer)
804{
805 struct drbd_bitmap *b = mdev->bitmap;
806 unsigned long *p_addr, *bm;
807 unsigned long word, bits;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100808 unsigned int idx;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700809 size_t end, do_now;
810
811 end = offset + number;
812
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100813 if (!expect(b))
814 return;
815 if (!expect(b->bm_pages))
816 return;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700817 if (number == 0)
818 return;
819 WARN_ON(offset >= b->bm_words);
820 WARN_ON(end > b->bm_words);
821
822 spin_lock_irq(&b->bm_lock);
823 while (offset < end) {
824 do_now = min_t(size_t, ALIGN(offset+1, LWPP), end) - offset;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100825 idx = bm_word_to_page_idx(b, offset);
826 p_addr = bm_map_pidx(b, idx);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700827 bm = p_addr + MLPP(offset);
828 offset += do_now;
829 while (do_now--) {
830 bits = hweight_long(*bm);
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100831 word = *bm | *buffer++;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700832 *bm++ = word;
833 b->bm_set += hweight_long(word) - bits;
834 }
835 bm_unmap(p_addr);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100836 bm_set_page_need_writeout(b->bm_pages[idx]);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700837 }
838 /* with 32bit <-> 64bit cross-platform connect
839 * this is only correct for current usage,
840 * where we _know_ that we are 64 bit aligned,
841 * and know that this function is used in this way, too...
842 */
843 if (end == b->bm_words)
844 b->bm_set -= bm_clear_surplus(b);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700845 spin_unlock_irq(&b->bm_lock);
846}
847
848/* copy number words from the bitmap starting at offset into the buffer.
849 * buffer[i] will be little endian unsigned long.
850 */
851void drbd_bm_get_lel(struct drbd_conf *mdev, size_t offset, size_t number,
852 unsigned long *buffer)
853{
854 struct drbd_bitmap *b = mdev->bitmap;
855 unsigned long *p_addr, *bm;
856 size_t end, do_now;
857
858 end = offset + number;
859
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100860 if (!expect(b))
861 return;
862 if (!expect(b->bm_pages))
863 return;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700864
865 spin_lock_irq(&b->bm_lock);
866 if ((offset >= b->bm_words) ||
867 (end > b->bm_words) ||
868 (number <= 0))
869 dev_err(DEV, "offset=%lu number=%lu bm_words=%lu\n",
870 (unsigned long) offset,
871 (unsigned long) number,
872 (unsigned long) b->bm_words);
873 else {
874 while (offset < end) {
875 do_now = min_t(size_t, ALIGN(offset+1, LWPP), end) - offset;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100876 p_addr = bm_map_pidx(b, bm_word_to_page_idx(b, offset));
Philipp Reisnerb411b362009-09-25 16:07:19 -0700877 bm = p_addr + MLPP(offset);
878 offset += do_now;
879 while (do_now--)
Lars Ellenberg95a0f102010-12-15 08:59:09 +0100880 *buffer++ = *bm++;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700881 bm_unmap(p_addr);
882 }
883 }
884 spin_unlock_irq(&b->bm_lock);
885}
886
887/* set all bits in the bitmap */
888void drbd_bm_set_all(struct drbd_conf *mdev)
889{
890 struct drbd_bitmap *b = mdev->bitmap;
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100891 if (!expect(b))
892 return;
893 if (!expect(b->bm_pages))
894 return;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700895
896 spin_lock_irq(&b->bm_lock);
897 bm_memset(b, 0, 0xff, b->bm_words);
898 (void)bm_clear_surplus(b);
899 b->bm_set = b->bm_bits;
900 spin_unlock_irq(&b->bm_lock);
901}
902
903/* clear all bits in the bitmap */
904void drbd_bm_clear_all(struct drbd_conf *mdev)
905{
906 struct drbd_bitmap *b = mdev->bitmap;
Andreas Gruenbacher841ce242010-12-15 19:31:20 +0100907 if (!expect(b))
908 return;
909 if (!expect(b->bm_pages))
910 return;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700911
912 spin_lock_irq(&b->bm_lock);
913 bm_memset(b, 0, 0, b->bm_words);
914 b->bm_set = 0;
915 spin_unlock_irq(&b->bm_lock);
916}
917
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100918struct bm_aio_ctx {
919 struct drbd_conf *mdev;
920 atomic_t in_flight;
Philipp Reisnercdfda632011-07-05 15:38:59 +0200921 unsigned int done;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100922 unsigned flags;
923#define BM_AIO_COPY_PAGES 1
Lars Ellenberg45dfffe2011-02-21 13:21:00 +0100924#define BM_AIO_WRITE_HINTED 2
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100925 int error;
Philipp Reisnercdfda632011-07-05 15:38:59 +0200926 struct kref kref;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100927};
928
Philipp Reisnercdfda632011-07-05 15:38:59 +0200929static void bm_aio_ctx_destroy(struct kref *kref)
930{
931 struct bm_aio_ctx *ctx = container_of(kref, struct bm_aio_ctx, kref);
932
933 put_ldev(ctx->mdev);
934 kfree(ctx);
935}
936
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100937/* bv_page may be a copy, or may be the original */
Philipp Reisnerb411b362009-09-25 16:07:19 -0700938static void bm_async_io_complete(struct bio *bio, int error)
939{
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100940 struct bm_aio_ctx *ctx = bio->bi_private;
941 struct drbd_conf *mdev = ctx->mdev;
942 struct drbd_bitmap *b = mdev->bitmap;
943 unsigned int idx = bm_page_to_idx(bio->bi_io_vec[0].bv_page);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700944 int uptodate = bio_flagged(bio, BIO_UPTODATE);
945
946
947 /* strange behavior of some lower level drivers...
948 * fail the request by clearing the uptodate flag,
949 * but do not return any error?!
950 * do we want to WARN() on this? */
951 if (!error && !uptodate)
952 error = -EIO;
953
Lars Ellenberg7648cdf2010-12-17 23:58:41 +0100954 if ((ctx->flags & BM_AIO_COPY_PAGES) == 0 &&
955 !bm_test_page_unchanged(b->bm_pages[idx]))
956 dev_warn(DEV, "bitmap page idx %u changed during IO!\n", idx);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100957
Philipp Reisnerb411b362009-09-25 16:07:19 -0700958 if (error) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100959 /* ctx error will hold the completed-last non-zero error code,
960 * in case error codes differ. */
961 ctx->error = error;
962 bm_set_page_io_err(b->bm_pages[idx]);
963 /* Not identical to on disk version of it.
964 * Is BM_PAGE_IO_ERROR enough? */
965 if (__ratelimit(&drbd_ratelimit_state))
966 dev_err(DEV, "IO ERROR %d on bitmap page idx %u\n",
967 error, idx);
968 } else {
969 bm_clear_page_io_err(b->bm_pages[idx]);
970 dynamic_dev_dbg(DEV, "bitmap page idx %u completed\n", idx);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700971 }
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100972
973 bm_page_unlock_io(mdev, idx);
974
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100975 if (ctx->flags & BM_AIO_COPY_PAGES)
Lars Ellenberg9db4e772011-02-23 15:38:47 +0100976 mempool_free(bio->bi_io_vec[0].bv_page, drbd_md_io_page_pool);
Philipp Reisnerb411b362009-09-25 16:07:19 -0700977
978 bio_put(bio);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100979
Philipp Reisnercdfda632011-07-05 15:38:59 +0200980 if (atomic_dec_and_test(&ctx->in_flight)) {
981 ctx->done = 1;
982 wake_up(&mdev->misc_wait);
983 kref_put(&ctx->kref, &bm_aio_ctx_destroy);
984 }
Philipp Reisnerb411b362009-09-25 16:07:19 -0700985}
986
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100987static void bm_page_io_async(struct bm_aio_ctx *ctx, int page_nr, int rw) __must_hold(local)
Philipp Reisnerb411b362009-09-25 16:07:19 -0700988{
Philipp Reisnercdfda632011-07-05 15:38:59 +0200989 struct bio *bio = bio_alloc_drbd(GFP_NOIO);
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100990 struct drbd_conf *mdev = ctx->mdev;
991 struct drbd_bitmap *b = mdev->bitmap;
992 struct page *page;
Philipp Reisnerb411b362009-09-25 16:07:19 -0700993 unsigned int len;
Lars Ellenberg19f843a2010-12-15 08:59:11 +0100994
Philipp Reisnerb411b362009-09-25 16:07:19 -0700995 sector_t on_disk_sector =
996 mdev->ldev->md.md_offset + mdev->ldev->md.bm_offset;
997 on_disk_sector += ((sector_t)page_nr) << (PAGE_SHIFT-9);
998
999 /* this might happen with very small
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001000 * flexible external meta data device,
1001 * or with PAGE_SIZE > 4k */
Philipp Reisnerb411b362009-09-25 16:07:19 -07001002 len = min_t(unsigned int, PAGE_SIZE,
1003 (drbd_md_last_sector(mdev->ldev) - on_disk_sector + 1)<<9);
1004
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001005 /* serialize IO on this page */
1006 bm_page_lock_io(mdev, page_nr);
1007 /* before memcpy and submit,
1008 * so it can be redirtied any time */
1009 bm_set_page_unchanged(b->bm_pages[page_nr]);
1010
1011 if (ctx->flags & BM_AIO_COPY_PAGES) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001012 void *src, *dest;
Lars Ellenberg9db4e772011-02-23 15:38:47 +01001013 page = mempool_alloc(drbd_md_io_page_pool, __GFP_HIGHMEM|__GFP_WAIT);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001014 dest = kmap_atomic(page, KM_USER0);
1015 src = kmap_atomic(b->bm_pages[page_nr], KM_USER1);
1016 memcpy(dest, src, PAGE_SIZE);
1017 kunmap_atomic(src, KM_USER1);
1018 kunmap_atomic(dest, KM_USER0);
1019 bm_store_page_idx(page, page_nr);
1020 } else
1021 page = b->bm_pages[page_nr];
1022
Philipp Reisnerb411b362009-09-25 16:07:19 -07001023 bio->bi_bdev = mdev->ldev->md_bdev;
1024 bio->bi_sector = on_disk_sector;
Lars Ellenberg9db4e772011-02-23 15:38:47 +01001025 /* bio_add_page of a single page to an empty bio will always succeed,
1026 * according to api. Do we want to assert that? */
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001027 bio_add_page(bio, page, len, 0);
1028 bio->bi_private = ctx;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001029 bio->bi_end_io = bm_async_io_complete;
1030
Andreas Gruenbacher0cf9d272010-12-07 10:43:29 +01001031 if (drbd_insert_fault(mdev, (rw & WRITE) ? DRBD_FAULT_MD_WR : DRBD_FAULT_MD_RD)) {
Philipp Reisnerb411b362009-09-25 16:07:19 -07001032 bio->bi_rw |= rw;
1033 bio_endio(bio, -EIO);
1034 } else {
1035 submit_bio(rw, bio);
Lars Ellenberg5a8b4242011-06-14 14:18:23 +02001036 /* this should not count as user activity and cause the
1037 * resync to throttle -- see drbd_rs_should_slow_down(). */
1038 atomic_add(len >> 9, &mdev->rs_sect_ev);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001039 }
1040}
1041
Philipp Reisnerb411b362009-09-25 16:07:19 -07001042/*
1043 * bm_rw: read/write the whole bitmap from/to its on disk location.
1044 */
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001045static int bm_rw(struct drbd_conf *mdev, int rw, unsigned flags, unsigned lazy_writeout_upper_idx) __must_hold(local)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001046{
Philipp Reisnercdfda632011-07-05 15:38:59 +02001047 struct bm_aio_ctx *ctx;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001048 struct drbd_bitmap *b = mdev->bitmap;
Lars Ellenberg6850c442010-12-16 00:32:38 +01001049 int num_pages, i, count = 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001050 unsigned long now;
1051 char ppb[10];
1052 int err = 0;
1053
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001054 /*
1055 * We are protected against bitmap disappearing/resizing by holding an
1056 * ldev reference (caller must have called get_ldev()).
1057 * For read/write, we are protected against changes to the bitmap by
1058 * the bitmap lock (see drbd_bitmap_io).
1059 * For lazy writeout, we don't care for ongoing changes to the bitmap,
1060 * as we submit copies of pages anyways.
1061 */
Philipp Reisnercdfda632011-07-05 15:38:59 +02001062
1063 ctx = kmalloc(sizeof(struct bm_aio_ctx), GFP_NOIO);
1064 if (!ctx)
1065 return -ENOMEM;
1066
1067 *ctx = (struct bm_aio_ctx) {
1068 .mdev = mdev,
1069 .in_flight = ATOMIC_INIT(1),
1070 .done = 0,
1071 .flags = flags,
1072 .error = 0,
1073 .kref = { ATOMIC_INIT(2) },
1074 };
1075
1076 if (!get_ldev_if_state(mdev, D_ATTACHING)) { /* put is in bm_aio_ctx_destroy() */
1077 dev_err(DEV, "ASSERT FAILED: get_ldev_if_state() == 1 in bm_rw()\n");
Lars Ellenberg9dab3842012-03-26 16:22:00 +02001078 kfree(ctx);
1079 return -ENODEV;
Philipp Reisnercdfda632011-07-05 15:38:59 +02001080 }
1081
1082 if (!ctx->flags)
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001083 WARN_ON(!(BM_LOCKED_MASK & b->bm_flags));
Philipp Reisnerb411b362009-09-25 16:07:19 -07001084
Lars Ellenberg6850c442010-12-16 00:32:38 +01001085 num_pages = b->bm_number_of_pages;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001086
Philipp Reisnerb411b362009-09-25 16:07:19 -07001087 now = jiffies;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001088
1089 /* let the layers below us try to merge these bios... */
Lars Ellenberg6850c442010-12-16 00:32:38 +01001090 for (i = 0; i < num_pages; i++) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001091 /* ignore completely unchanged pages */
1092 if (lazy_writeout_upper_idx && i == lazy_writeout_upper_idx)
1093 break;
1094 if (rw & WRITE) {
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001095 if ((flags & BM_AIO_WRITE_HINTED) &&
1096 !test_and_clear_bit(BM_PAGE_HINT_WRITEOUT,
1097 &page_private(b->bm_pages[i])))
1098 continue;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001099 if (bm_test_page_unchanged(b->bm_pages[i])) {
1100 dynamic_dev_dbg(DEV, "skipped bm write for idx %u\n", i);
1101 continue;
1102 }
1103 /* during lazy writeout,
1104 * ignore those pages not marked for lazy writeout. */
1105 if (lazy_writeout_upper_idx &&
1106 !bm_test_page_lazy_writeout(b->bm_pages[i])) {
1107 dynamic_dev_dbg(DEV, "skipped bm lazy write for idx %u\n", i);
1108 continue;
1109 }
1110 }
Philipp Reisnercdfda632011-07-05 15:38:59 +02001111 atomic_inc(&ctx->in_flight);
1112 bm_page_io_async(ctx, i, rw);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001113 ++count;
1114 cond_resched();
1115 }
Philipp Reisnerb411b362009-09-25 16:07:19 -07001116
Lars Ellenberg725a97e2010-12-19 11:29:55 +01001117 /*
Philipp Reisnercdfda632011-07-05 15:38:59 +02001118 * We initialize ctx->in_flight to one to make sure bm_async_io_complete
1119 * will not set ctx->done early, and decrement / test it here. If there
Lars Ellenberg725a97e2010-12-19 11:29:55 +01001120 * are still some bios in flight, we need to wait for them here.
Philipp Reisnercdfda632011-07-05 15:38:59 +02001121 * If all IO is done already (or nothing had been submitted), there is
1122 * no need to wait. Still, we need to put the kref associated with the
1123 * "in_flight reached zero, all done" event.
Lars Ellenberg725a97e2010-12-19 11:29:55 +01001124 */
Philipp Reisnercdfda632011-07-05 15:38:59 +02001125 if (!atomic_dec_and_test(&ctx->in_flight))
Philipp Reisner32db80f2012-02-22 11:51:57 +01001126 wait_until_done_or_disk_failure(mdev, mdev->ldev, &ctx->done);
Philipp Reisnercdfda632011-07-05 15:38:59 +02001127 else
1128 kref_put(&ctx->kref, &bm_aio_ctx_destroy);
Lars Ellenbergc9d963a2011-02-21 15:10:23 +01001129
1130 /* summary for global bitmap IO */
1131 if (flags == 0)
1132 dev_info(DEV, "bitmap %s of %u pages took %lu jiffies\n",
Philipp Reisnercdfda632011-07-05 15:38:59 +02001133 rw == WRITE ? "WRITE" : "READ",
1134 count, jiffies - now);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001135
Philipp Reisnercdfda632011-07-05 15:38:59 +02001136 if (ctx->error) {
Philipp Reisnerb411b362009-09-25 16:07:19 -07001137 dev_alert(DEV, "we had at least one MD IO ERROR during bitmap IO\n");
Andreas Gruenbacher81e84652010-12-09 15:03:57 +01001138 drbd_chk_io_error(mdev, 1, true);
Philipp Reisnercdfda632011-07-05 15:38:59 +02001139 err = -EIO; /* ctx->error ? */
Philipp Reisnerb411b362009-09-25 16:07:19 -07001140 }
1141
Philipp Reisnercdfda632011-07-05 15:38:59 +02001142 if (atomic_read(&ctx->in_flight))
1143 err = -EIO; /* Disk failed during IO... */
1144
Philipp Reisnerb411b362009-09-25 16:07:19 -07001145 now = jiffies;
1146 if (rw == WRITE) {
Philipp Reisnerb411b362009-09-25 16:07:19 -07001147 drbd_md_flush(mdev);
1148 } else /* rw == READ */ {
Lars Ellenberg95a0f102010-12-15 08:59:09 +01001149 b->bm_set = bm_count_bits(b);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001150 dev_info(DEV, "recounting of set bits took additional %lu jiffies\n",
1151 jiffies - now);
1152 }
1153 now = b->bm_set;
1154
Lars Ellenbergc9d963a2011-02-21 15:10:23 +01001155 if (flags == 0)
1156 dev_info(DEV, "%s (%lu bits) marked out-of-sync by on disk bit-map.\n",
1157 ppsize(ppb, now << (BM_BLOCK_SHIFT-10)), now);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001158
Philipp Reisnercdfda632011-07-05 15:38:59 +02001159 kref_put(&ctx->kref, &bm_aio_ctx_destroy);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001160 return err;
1161}
1162
1163/**
1164 * drbd_bm_read() - Read the whole bitmap from its on disk location.
1165 * @mdev: DRBD device.
1166 */
1167int drbd_bm_read(struct drbd_conf *mdev) __must_hold(local)
1168{
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001169 return bm_rw(mdev, READ, 0, 0);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001170}
1171
1172/**
1173 * drbd_bm_write() - Write the whole bitmap to its on disk location.
1174 * @mdev: DRBD device.
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001175 *
1176 * Will only write pages that have changed since last IO.
Philipp Reisnerb411b362009-09-25 16:07:19 -07001177 */
1178int drbd_bm_write(struct drbd_conf *mdev) __must_hold(local)
1179{
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001180 return bm_rw(mdev, WRITE, 0, 0);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001181}
1182
1183/**
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001184 * drbd_bm_lazy_write_out() - Write bitmap pages 0 to @upper_idx-1, if they have changed.
Philipp Reisnerb411b362009-09-25 16:07:19 -07001185 * @mdev: DRBD device.
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001186 * @upper_idx: 0: write all changed pages; +ve: page index to stop scanning for changed pages
Philipp Reisnerb411b362009-09-25 16:07:19 -07001187 */
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001188int drbd_bm_write_lazy(struct drbd_conf *mdev, unsigned upper_idx) __must_hold(local)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001189{
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001190 return bm_rw(mdev, WRITE, BM_AIO_COPY_PAGES, upper_idx);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001191}
Philipp Reisnerb411b362009-09-25 16:07:19 -07001192
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001193/**
Lars Ellenberga220d292012-05-07 12:07:18 +02001194 * drbd_bm_write_copy_pages() - Write the whole bitmap to its on disk location.
1195 * @mdev: DRBD device.
1196 *
1197 * Will only write pages that have changed since last IO.
1198 * In contrast to drbd_bm_write(), this will copy the bitmap pages
1199 * to temporary writeout pages. It is intended to trigger a full write-out
1200 * while still allowing the bitmap to change, for example if a resync or online
1201 * verify is aborted due to a failed peer disk, while local IO continues, or
1202 * pending resync acks are still being processed.
1203 */
1204int drbd_bm_write_copy_pages(struct drbd_conf *mdev) __must_hold(local)
1205{
1206 return bm_rw(mdev, WRITE, BM_AIO_COPY_PAGES, 0);
1207}
1208
1209/**
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001210 * drbd_bm_write_hinted() - Write bitmap pages with "hint" marks, if they have changed.
1211 * @mdev: DRBD device.
1212 */
1213int drbd_bm_write_hinted(struct drbd_conf *mdev) __must_hold(local)
1214{
1215 return bm_rw(mdev, WRITE, BM_AIO_WRITE_HINTED | BM_AIO_COPY_PAGES, 0);
1216}
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001217
1218/**
Lars Ellenberg45dfffe2011-02-21 13:21:00 +01001219 * drbd_bm_write_page() - Writes a PAGE_SIZE aligned piece of bitmap
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001220 * @mdev: DRBD device.
1221 * @idx: bitmap page index
1222 *
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001223 * We don't want to special case on logical_block_size of the backend device,
1224 * so we submit PAGE_SIZE aligned pieces.
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001225 * Note that on "most" systems, PAGE_SIZE is 4k.
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001226 *
1227 * In case this becomes an issue on systems with larger PAGE_SIZE,
1228 * we may want to change this again to write 4k aligned 4k pieces.
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001229 */
1230int drbd_bm_write_page(struct drbd_conf *mdev, unsigned int idx) __must_hold(local)
1231{
Philipp Reisnercdfda632011-07-05 15:38:59 +02001232 struct bm_aio_ctx *ctx;
1233 int err;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001234
1235 if (bm_test_page_unchanged(mdev->bitmap->bm_pages[idx])) {
Lars Ellenberg7648cdf2010-12-17 23:58:41 +01001236 dynamic_dev_dbg(DEV, "skipped bm page write for idx %u\n", idx);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001237 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001238 }
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001239
Philipp Reisnercdfda632011-07-05 15:38:59 +02001240 ctx = kmalloc(sizeof(struct bm_aio_ctx), GFP_NOIO);
1241 if (!ctx)
1242 return -ENOMEM;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001243
Philipp Reisnercdfda632011-07-05 15:38:59 +02001244 *ctx = (struct bm_aio_ctx) {
1245 .mdev = mdev,
1246 .in_flight = ATOMIC_INIT(1),
1247 .done = 0,
1248 .flags = BM_AIO_COPY_PAGES,
1249 .error = 0,
1250 .kref = { ATOMIC_INIT(2) },
1251 };
1252
1253 if (!get_ldev_if_state(mdev, D_ATTACHING)) { /* put is in bm_aio_ctx_destroy() */
1254 dev_err(DEV, "ASSERT FAILED: get_ldev_if_state() == 1 in drbd_bm_write_page()\n");
Lars Ellenberg9dab3842012-03-26 16:22:00 +02001255 kfree(ctx);
1256 return -ENODEV;
Philipp Reisnercdfda632011-07-05 15:38:59 +02001257 }
1258
1259 bm_page_io_async(ctx, idx, WRITE_SYNC);
Philipp Reisner32db80f2012-02-22 11:51:57 +01001260 wait_until_done_or_disk_failure(mdev, mdev->ldev, &ctx->done);
Philipp Reisnercdfda632011-07-05 15:38:59 +02001261
1262 if (ctx->error)
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001263 drbd_chk_io_error(mdev, 1, true);
1264 /* that should force detach, so the in memory bitmap will be
1265 * gone in a moment as well. */
1266
Philipp Reisnerb411b362009-09-25 16:07:19 -07001267 mdev->bm_writ_cnt++;
Philipp Reisnercdfda632011-07-05 15:38:59 +02001268 err = atomic_read(&ctx->in_flight) ? -EIO : ctx->error;
Philipp Reisnercdfda632011-07-05 15:38:59 +02001269 kref_put(&ctx->kref, &bm_aio_ctx_destroy);
1270 return err;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001271}
1272
1273/* NOTE
1274 * find_first_bit returns int, we return unsigned long.
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001275 * For this to work on 32bit arch with bitnumbers > (1<<32),
1276 * we'd need to return u64, and get a whole lot of other places
1277 * fixed where we still use unsigned long.
Philipp Reisnerb411b362009-09-25 16:07:19 -07001278 *
1279 * this returns a bit number, NOT a sector!
1280 */
Philipp Reisnerb411b362009-09-25 16:07:19 -07001281static unsigned long __bm_find_next(struct drbd_conf *mdev, unsigned long bm_fo,
1282 const int find_zero_bit, const enum km_type km)
1283{
1284 struct drbd_bitmap *b = mdev->bitmap;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001285 unsigned long *p_addr;
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001286 unsigned long bit_offset;
1287 unsigned i;
1288
Philipp Reisnerb411b362009-09-25 16:07:19 -07001289
1290 if (bm_fo > b->bm_bits) {
1291 dev_err(DEV, "bm_fo=%lu bm_bits=%lu\n", bm_fo, b->bm_bits);
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001292 bm_fo = DRBD_END_OF_BITMAP;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001293 } else {
1294 while (bm_fo < b->bm_bits) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001295 /* bit offset of the first bit in the page */
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001296 bit_offset = bm_fo & ~BITS_PER_PAGE_MASK;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001297 p_addr = __bm_map_pidx(b, bm_bit_to_page_idx(b, bm_fo), km);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001298
1299 if (find_zero_bit)
Linus Torvalds7e599e62011-03-28 07:42:58 -07001300 i = find_next_zero_bit_le(p_addr,
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001301 PAGE_SIZE*8, bm_fo & BITS_PER_PAGE_MASK);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001302 else
Linus Torvalds7e599e62011-03-28 07:42:58 -07001303 i = find_next_bit_le(p_addr,
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001304 PAGE_SIZE*8, bm_fo & BITS_PER_PAGE_MASK);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001305
1306 __bm_unmap(p_addr, km);
1307 if (i < PAGE_SIZE*8) {
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001308 bm_fo = bit_offset + i;
1309 if (bm_fo >= b->bm_bits)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001310 break;
1311 goto found;
1312 }
1313 bm_fo = bit_offset + PAGE_SIZE*8;
1314 }
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001315 bm_fo = DRBD_END_OF_BITMAP;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001316 }
1317 found:
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001318 return bm_fo;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001319}
1320
1321static unsigned long bm_find_next(struct drbd_conf *mdev,
1322 unsigned long bm_fo, const int find_zero_bit)
1323{
1324 struct drbd_bitmap *b = mdev->bitmap;
Lars Ellenberg4b0715f2010-12-14 15:13:04 +01001325 unsigned long i = DRBD_END_OF_BITMAP;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001326
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001327 if (!expect(b))
1328 return i;
1329 if (!expect(b->bm_pages))
1330 return i;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001331
1332 spin_lock_irq(&b->bm_lock);
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001333 if (BM_DONT_TEST & b->bm_flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001334 bm_print_lock_info(mdev);
1335
1336 i = __bm_find_next(mdev, bm_fo, find_zero_bit, KM_IRQ1);
1337
1338 spin_unlock_irq(&b->bm_lock);
1339 return i;
1340}
1341
1342unsigned long drbd_bm_find_next(struct drbd_conf *mdev, unsigned long bm_fo)
1343{
1344 return bm_find_next(mdev, bm_fo, 0);
1345}
1346
1347#if 0
1348/* not yet needed for anything. */
1349unsigned long drbd_bm_find_next_zero(struct drbd_conf *mdev, unsigned long bm_fo)
1350{
1351 return bm_find_next(mdev, bm_fo, 1);
1352}
1353#endif
1354
1355/* does not spin_lock_irqsave.
1356 * you must take drbd_bm_lock() first */
1357unsigned long _drbd_bm_find_next(struct drbd_conf *mdev, unsigned long bm_fo)
1358{
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001359 /* WARN_ON(!(BM_DONT_SET & mdev->b->bm_flags)); */
Philipp Reisnerb411b362009-09-25 16:07:19 -07001360 return __bm_find_next(mdev, bm_fo, 0, KM_USER1);
1361}
1362
1363unsigned long _drbd_bm_find_next_zero(struct drbd_conf *mdev, unsigned long bm_fo)
1364{
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001365 /* WARN_ON(!(BM_DONT_SET & mdev->b->bm_flags)); */
Philipp Reisnerb411b362009-09-25 16:07:19 -07001366 return __bm_find_next(mdev, bm_fo, 1, KM_USER1);
1367}
1368
1369/* returns number of bits actually changed.
1370 * for val != 0, we change 0 -> 1, return code positive
1371 * for val == 0, we change 1 -> 0, return code negative
1372 * wants bitnr, not sector.
1373 * expected to be called for only a few bits (e - s about BITS_PER_LONG).
1374 * Must hold bitmap lock already. */
Philipp Reisnerb4ee79d2010-04-01 09:57:40 +02001375static int __bm_change_bits_to(struct drbd_conf *mdev, const unsigned long s,
Lars Ellenberg829c6082011-06-03 21:18:13 +02001376 unsigned long e, int val)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001377{
1378 struct drbd_bitmap *b = mdev->bitmap;
1379 unsigned long *p_addr = NULL;
1380 unsigned long bitnr;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001381 unsigned int last_page_nr = -1U;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001382 int c = 0;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001383 int changed_total = 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001384
1385 if (e >= b->bm_bits) {
1386 dev_err(DEV, "ASSERT FAILED: bit_s=%lu bit_e=%lu bm_bits=%lu\n",
1387 s, e, b->bm_bits);
1388 e = b->bm_bits ? b->bm_bits -1 : 0;
1389 }
1390 for (bitnr = s; bitnr <= e; bitnr++) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001391 unsigned int page_nr = bm_bit_to_page_idx(b, bitnr);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001392 if (page_nr != last_page_nr) {
1393 if (p_addr)
Lars Ellenberg829c6082011-06-03 21:18:13 +02001394 __bm_unmap(p_addr, KM_IRQ1);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001395 if (c < 0)
1396 bm_set_page_lazy_writeout(b->bm_pages[last_page_nr]);
1397 else if (c > 0)
1398 bm_set_page_need_writeout(b->bm_pages[last_page_nr]);
1399 changed_total += c;
1400 c = 0;
Lars Ellenberg829c6082011-06-03 21:18:13 +02001401 p_addr = __bm_map_pidx(b, page_nr, KM_IRQ1);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001402 last_page_nr = page_nr;
1403 }
1404 if (val)
Linus Torvalds7e599e62011-03-28 07:42:58 -07001405 c += (0 == __test_and_set_bit_le(bitnr & BITS_PER_PAGE_MASK, p_addr));
Philipp Reisnerb411b362009-09-25 16:07:19 -07001406 else
Linus Torvalds7e599e62011-03-28 07:42:58 -07001407 c -= (0 != __test_and_clear_bit_le(bitnr & BITS_PER_PAGE_MASK, p_addr));
Philipp Reisnerb411b362009-09-25 16:07:19 -07001408 }
1409 if (p_addr)
Lars Ellenberg829c6082011-06-03 21:18:13 +02001410 __bm_unmap(p_addr, KM_IRQ1);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001411 if (c < 0)
1412 bm_set_page_lazy_writeout(b->bm_pages[last_page_nr]);
1413 else if (c > 0)
1414 bm_set_page_need_writeout(b->bm_pages[last_page_nr]);
1415 changed_total += c;
1416 b->bm_set += changed_total;
1417 return changed_total;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001418}
1419
1420/* returns number of bits actually changed.
1421 * for val != 0, we change 0 -> 1, return code positive
1422 * for val == 0, we change 1 -> 0, return code negative
1423 * wants bitnr, not sector */
Philipp Reisnerb4ee79d2010-04-01 09:57:40 +02001424static int bm_change_bits_to(struct drbd_conf *mdev, const unsigned long s,
Philipp Reisnerb411b362009-09-25 16:07:19 -07001425 const unsigned long e, int val)
1426{
1427 unsigned long flags;
1428 struct drbd_bitmap *b = mdev->bitmap;
1429 int c = 0;
1430
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001431 if (!expect(b))
1432 return 1;
1433 if (!expect(b->bm_pages))
1434 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001435
1436 spin_lock_irqsave(&b->bm_lock, flags);
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001437 if ((val ? BM_DONT_SET : BM_DONT_CLEAR) & b->bm_flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001438 bm_print_lock_info(mdev);
1439
Lars Ellenberg829c6082011-06-03 21:18:13 +02001440 c = __bm_change_bits_to(mdev, s, e, val);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001441
1442 spin_unlock_irqrestore(&b->bm_lock, flags);
1443 return c;
1444}
1445
1446/* returns number of bits changed 0 -> 1 */
1447int drbd_bm_set_bits(struct drbd_conf *mdev, const unsigned long s, const unsigned long e)
1448{
1449 return bm_change_bits_to(mdev, s, e, 1);
1450}
1451
1452/* returns number of bits changed 1 -> 0 */
1453int drbd_bm_clear_bits(struct drbd_conf *mdev, const unsigned long s, const unsigned long e)
1454{
1455 return -bm_change_bits_to(mdev, s, e, 0);
1456}
1457
1458/* sets all bits in full words,
1459 * from first_word up to, but not including, last_word */
1460static inline void bm_set_full_words_within_one_page(struct drbd_bitmap *b,
1461 int page_nr, int first_word, int last_word)
1462{
1463 int i;
1464 int bits;
Lars Ellenberg22d81142011-09-26 09:58:04 +02001465 int changed = 0;
Lars Ellenberg829c6082011-06-03 21:18:13 +02001466 unsigned long *paddr = kmap_atomic(b->bm_pages[page_nr], KM_IRQ1);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001467 for (i = first_word; i < last_word; i++) {
1468 bits = hweight_long(paddr[i]);
1469 paddr[i] = ~0UL;
Lars Ellenberg22d81142011-09-26 09:58:04 +02001470 changed += BITS_PER_LONG - bits;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001471 }
Lars Ellenberg829c6082011-06-03 21:18:13 +02001472 kunmap_atomic(paddr, KM_IRQ1);
Lars Ellenberg22d81142011-09-26 09:58:04 +02001473 if (changed) {
1474 /* We only need lazy writeout, the information is still in the
1475 * remote bitmap as well, and is reconstructed during the next
1476 * bitmap exchange, if lost locally due to a crash. */
1477 bm_set_page_lazy_writeout(b->bm_pages[page_nr]);
1478 b->bm_set += changed;
1479 }
Philipp Reisnerb411b362009-09-25 16:07:19 -07001480}
1481
Lars Ellenberg829c6082011-06-03 21:18:13 +02001482/* Same thing as drbd_bm_set_bits,
1483 * but more efficient for a large bit range.
Philipp Reisnerb411b362009-09-25 16:07:19 -07001484 * You must first drbd_bm_lock().
1485 * Can be called to set the whole bitmap in one go.
1486 * Sets bits from s to e _inclusive_. */
1487void _drbd_bm_set_bits(struct drbd_conf *mdev, const unsigned long s, const unsigned long e)
1488{
1489 /* First set_bit from the first bit (s)
1490 * up to the next long boundary (sl),
1491 * then assign full words up to the last long boundary (el),
1492 * then set_bit up to and including the last bit (e).
1493 *
1494 * Do not use memset, because we must account for changes,
1495 * so we need to loop over the words with hweight() anyways.
1496 */
Lars Ellenberg829c6082011-06-03 21:18:13 +02001497 struct drbd_bitmap *b = mdev->bitmap;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001498 unsigned long sl = ALIGN(s,BITS_PER_LONG);
1499 unsigned long el = (e+1) & ~((unsigned long)BITS_PER_LONG-1);
1500 int first_page;
1501 int last_page;
1502 int page_nr;
1503 int first_word;
1504 int last_word;
1505
1506 if (e - s <= 3*BITS_PER_LONG) {
1507 /* don't bother; el and sl may even be wrong. */
Lars Ellenberg829c6082011-06-03 21:18:13 +02001508 spin_lock_irq(&b->bm_lock);
1509 __bm_change_bits_to(mdev, s, e, 1);
1510 spin_unlock_irq(&b->bm_lock);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001511 return;
1512 }
1513
1514 /* difference is large enough that we can trust sl and el */
1515
Lars Ellenberg829c6082011-06-03 21:18:13 +02001516 spin_lock_irq(&b->bm_lock);
1517
Philipp Reisnerb411b362009-09-25 16:07:19 -07001518 /* bits filling the current long */
1519 if (sl)
Lars Ellenberg829c6082011-06-03 21:18:13 +02001520 __bm_change_bits_to(mdev, s, sl-1, 1);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001521
1522 first_page = sl >> (3 + PAGE_SHIFT);
1523 last_page = el >> (3 + PAGE_SHIFT);
1524
1525 /* MLPP: modulo longs per page */
1526 /* LWPP: long words per page */
1527 first_word = MLPP(sl >> LN2_BPL);
1528 last_word = LWPP;
1529
1530 /* first and full pages, unless first page == last page */
1531 for (page_nr = first_page; page_nr < last_page; page_nr++) {
1532 bm_set_full_words_within_one_page(mdev->bitmap, page_nr, first_word, last_word);
Lars Ellenberg8ccee202011-06-06 11:31:42 +02001533 spin_unlock_irq(&b->bm_lock);
1534 cond_resched();
Philipp Reisnerb411b362009-09-25 16:07:19 -07001535 first_word = 0;
Lars Ellenberg8ccee202011-06-06 11:31:42 +02001536 spin_lock_irq(&b->bm_lock);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001537 }
1538
1539 /* last page (respectively only page, for first page == last page) */
1540 last_word = MLPP(el >> LN2_BPL);
1541 bm_set_full_words_within_one_page(mdev->bitmap, last_page, first_word, last_word);
1542
1543 /* possibly trailing bits.
1544 * example: (e & 63) == 63, el will be e+1.
1545 * if that even was the very last bit,
1546 * it would trigger an assert in __bm_change_bits_to()
1547 */
1548 if (el <= e)
Lars Ellenberg829c6082011-06-03 21:18:13 +02001549 __bm_change_bits_to(mdev, el, e, 1);
1550 spin_unlock_irq(&b->bm_lock);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001551}
1552
1553/* returns bit state
1554 * wants bitnr, NOT sector.
1555 * inherently racy... area needs to be locked by means of {al,rs}_lru
1556 * 1 ... bit set
1557 * 0 ... bit not set
1558 * -1 ... first out of bounds access, stop testing for bits!
1559 */
1560int drbd_bm_test_bit(struct drbd_conf *mdev, const unsigned long bitnr)
1561{
1562 unsigned long flags;
1563 struct drbd_bitmap *b = mdev->bitmap;
1564 unsigned long *p_addr;
1565 int i;
1566
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001567 if (!expect(b))
1568 return 0;
1569 if (!expect(b->bm_pages))
1570 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001571
1572 spin_lock_irqsave(&b->bm_lock, flags);
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001573 if (BM_DONT_TEST & b->bm_flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001574 bm_print_lock_info(mdev);
1575 if (bitnr < b->bm_bits) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001576 p_addr = bm_map_pidx(b, bm_bit_to_page_idx(b, bitnr));
Linus Torvalds7e599e62011-03-28 07:42:58 -07001577 i = test_bit_le(bitnr & BITS_PER_PAGE_MASK, p_addr) ? 1 : 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001578 bm_unmap(p_addr);
1579 } else if (bitnr == b->bm_bits) {
1580 i = -1;
1581 } else { /* (bitnr > b->bm_bits) */
1582 dev_err(DEV, "bitnr=%lu > bm_bits=%lu\n", bitnr, b->bm_bits);
1583 i = 0;
1584 }
1585
1586 spin_unlock_irqrestore(&b->bm_lock, flags);
1587 return i;
1588}
1589
1590/* returns number of bits set in the range [s, e] */
1591int drbd_bm_count_bits(struct drbd_conf *mdev, const unsigned long s, const unsigned long e)
1592{
1593 unsigned long flags;
1594 struct drbd_bitmap *b = mdev->bitmap;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001595 unsigned long *p_addr = NULL;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001596 unsigned long bitnr;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001597 unsigned int page_nr = -1U;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001598 int c = 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001599
1600 /* If this is called without a bitmap, that is a bug. But just to be
1601 * robust in case we screwed up elsewhere, in that case pretend there
1602 * was one dirty bit in the requested area, so we won't try to do a
1603 * local read there (no bitmap probably implies no disk) */
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001604 if (!expect(b))
1605 return 1;
1606 if (!expect(b->bm_pages))
1607 return 1;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001608
1609 spin_lock_irqsave(&b->bm_lock, flags);
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001610 if (BM_DONT_TEST & b->bm_flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001611 bm_print_lock_info(mdev);
1612 for (bitnr = s; bitnr <= e; bitnr++) {
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001613 unsigned int idx = bm_bit_to_page_idx(b, bitnr);
1614 if (page_nr != idx) {
1615 page_nr = idx;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001616 if (p_addr)
1617 bm_unmap(p_addr);
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001618 p_addr = bm_map_pidx(b, idx);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001619 }
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001620 if (expect(bitnr < b->bm_bits))
Linus Torvalds7e599e62011-03-28 07:42:58 -07001621 c += (0 != test_bit_le(bitnr - (page_nr << (PAGE_SHIFT+3)), p_addr));
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001622 else
1623 dev_err(DEV, "bitnr=%lu bm_bits=%lu\n", bitnr, b->bm_bits);
Philipp Reisnerb411b362009-09-25 16:07:19 -07001624 }
1625 if (p_addr)
1626 bm_unmap(p_addr);
1627 spin_unlock_irqrestore(&b->bm_lock, flags);
1628 return c;
1629}
1630
1631
1632/* inherently racy...
1633 * return value may be already out-of-date when this function returns.
1634 * but the general usage is that this is only use during a cstate when bits are
1635 * only cleared, not set, and typically only care for the case when the return
1636 * value is zero, or we already "locked" this "bitmap extent" by other means.
1637 *
1638 * enr is bm-extent number, since we chose to name one sector (512 bytes)
1639 * worth of the bitmap a "bitmap extent".
1640 *
1641 * TODO
1642 * I think since we use it like a reference count, we should use the real
1643 * reference count of some bitmap extent element from some lru instead...
1644 *
1645 */
1646int drbd_bm_e_weight(struct drbd_conf *mdev, unsigned long enr)
1647{
1648 struct drbd_bitmap *b = mdev->bitmap;
1649 int count, s, e;
1650 unsigned long flags;
1651 unsigned long *p_addr, *bm;
1652
Andreas Gruenbacher841ce242010-12-15 19:31:20 +01001653 if (!expect(b))
1654 return 0;
1655 if (!expect(b->bm_pages))
1656 return 0;
Philipp Reisnerb411b362009-09-25 16:07:19 -07001657
1658 spin_lock_irqsave(&b->bm_lock, flags);
Lars Ellenberg20ceb2b2011-01-21 10:56:44 +01001659 if (BM_DONT_TEST & b->bm_flags)
Philipp Reisnerb411b362009-09-25 16:07:19 -07001660 bm_print_lock_info(mdev);
1661
1662 s = S2W(enr);
1663 e = min((size_t)S2W(enr+1), b->bm_words);
1664 count = 0;
1665 if (s < b->bm_words) {
1666 int n = e-s;
Lars Ellenberg19f843a2010-12-15 08:59:11 +01001667 p_addr = bm_map_pidx(b, bm_word_to_page_idx(b, s));
Philipp Reisnerb411b362009-09-25 16:07:19 -07001668 bm = p_addr + MLPP(s);
1669 while (n--)
1670 count += hweight_long(*bm++);
1671 bm_unmap(p_addr);
1672 } else {
1673 dev_err(DEV, "start offset (%d) too large in drbd_bm_e_weight\n", s);
1674 }
1675 spin_unlock_irqrestore(&b->bm_lock, flags);
1676 return count;
1677}