search for: bmaps

Add support for a block mapping API, used by the 'virt-bmap' tool. --- daemon/Makefile.am | 1 + daemon/bmap.c | 168 +++++++++++++++++++++++++++++++++++++++++++++++++++ generator/actions.ml | 44 ++++++++++++++ po/POTFILES | 1 + src/MAX_PROC_NR | 2 +- 5 files changed, 215 insertions(+), 1 deletion(-) create mode 100644 daemon/bmap.c diff --git

On Sunday 23 November 2014 22:16:41 Richard W.M. Jones wrote: > Add support for a block mapping API, used by the 'virt-bmap' tool. > --- > daemon/Makefile.am | 1 + > daemon/bmap.c | 168 +++++++++++++++++++++++++++++++++++++++++++++++++++ > generator/actions.ml | 44 ++++++++++++++ > po/POTFILES | 1 + > src/MAX_PROC_NR | 2 +- > 5

See http://rwmj.wordpress.com/2014/11/23/mapping-files-to-disk/

Does *not* incorporate changes suggested by Pino yet. Rich.

I'm writing a stackable file system and one of it's features is that it can combine many sparse files into a single view. On ext2/3 I was using bmap to give me the information needed, so for instance, if I created a big sparse file and tacked on some information at the end on ext2/3 I'd get something like blade12:~# ~/a.out abc File: abc Size: 30002 Blocks: 8 Blocksize: 4096 0

On Wed, Jan 23, 2019 at 12:00:06PM +0000, Sudhakar Paulzagade wrote: > https://rwmj.wordpress.com/2014/11/23/mapping-files-to-disk/#content > > Couple of questions: > > 1. How do I get virt-bmap. I installed latest version of libguestfs and libguestfs-tools but couldn't find this tool. Is there a separate package that I need to install? It's here:

Hi all, I just applied the generic path searching to ISOLINUX, and you can check it here: http://git.zytor.com/?p=users/liu/gsoc09_liu.git since commit 4bb194f14a43674cced3a8c35d5e625e59db32dc. hpa, for now, all the fs code have been converted to new-style interface and I have done my best to make all the fs C code be clean and readable. Well, it would be great if you take a minute to

Get the free pages information through virtio and filter out the free pages in the ram bulk stage. This can significantly reduce the total live migration time as well as network traffic. Signed-off-by: Liang Li <liang.z.li at intel.com> --- migration/ram.c | 52 ++++++++++++++++++++++++++++++++++++++++++++++------ 1 file changed, 46 insertions(+), 6 deletions(-) diff --git

On 06/14/2017 01:56 AM, Michael S. Tsirkin wrote: > On Fri, Jun 09, 2017 at 06:41:38PM +0800, Wei Wang wrote: >> Add a new feature, VIRTIO_BALLOON_F_PAGE_CHUNKS, which enables >> the transfer of the ballooned (i.e. inflated/deflated) pages in >> chunks to the host. > so now these chunks are just s/g list entry. > So let's rename this VIRTIO_BALLOON_F_SG with a

This patch adds support to find next 1 or 0 bit in a xbmitmap range and clear a range of bits. More possible optimizations to add in the future: 1) xb_set_bit_range: set a range of bits. 2) when searching a bit, if the bit is not found in the slot, move on to the next slot directly. 3) add tags to help searching. Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Matthew Wilcox

..._page_chunk_hdr *balloon_page_chunk_hdr; >> + struct virtio_balloon_page_chunk *balloon_page_chunk; >> + >> + /* Bitmap used to record pages */ >> + unsigned long *page_bmap[PAGE_BMAP_COUNT_MAX]; >> + /* Number of the allocated page_bmap */ >> + unsigned int page_bmaps; >> + >> + /* >> + * The allocated page_bmap size may be smaller than the pfn range of >> + * the ballooned pages. In this case, we need to use the page_bmap >> + * multiple times to cover the entire pfn range. It's like using a >> + * short ruler several...

The message from this sender included one or more files which could not be scanned for virus detection; do not open these files unless you are certain of the sender's intent. ---------------------------------------------------------------------- Introduce i_blockmask() to simplify code, which replace (i_blocksize(node) - 1). Like done in commit 93407472a21b("fs: add i_blocksize()").

From: Matthew Wilcox <mawilcox at microsoft.com> Add the following tests for xbitmap: 1) single bit test: single bit set/clear/find; 2) bit range test: set/clear a range of bits and find a 0 or 1 bit in the range. Signed-off-by: Wei Wang <wei.w.wang at intel.com> Cc: Matthew Wilcox <mawilcox at microsoft.com> Cc: Andrew Morton <akpm at linux-foundation.org> Cc: Michael S.

Introduce i_blockmask() to simplify code, which replace (i_blocksize(node) - 1). Like done in commit 93407472a21b("fs: add i_blocksize()"). Signed-off-by: Yangtao Li <frank.li at vivo.com> --- v4: -drop ext4 patch -erofs patch based on mainline -a bit change in ocfs2 patch include/linux/fs.h | 5 +++++ 1 file changed, 5 insertions(+) diff --git a/include/linux/fs.h

...ving this to probe, that's where we do a bunch of inits. And then you can move private init back to allocate too. > + if (!vb->balloon_page_chunk.desc_table) > + goto err_page_chunk; > + vb->balloon_page_chunk.chunk_num = 0; > + > + /* > + * The default number of page_bmaps are allocated. More may be > + * allocated on demand. > + */ > + for (i = 0; i < VIRTIO_BALLOON_PAGE_BMAP_DEFAULT_NUM; i++) { > + vb->balloon_page_chunk.page_bmap[i] = > + kmalloc(VIRTIO_BALLOON_PAGE_BMAP_SIZE, GFP_KERNEL); > + if (!vb->balloon_page_chunk.page_b...

...ving this to probe, that's where we do a bunch of inits. And then you can move private init back to allocate too. > + if (!vb->balloon_page_chunk.desc_table) > + goto err_page_chunk; > + vb->balloon_page_chunk.chunk_num = 0; > + > + /* > + * The default number of page_bmaps are allocated. More may be > + * allocated on demand. > + */ > + for (i = 0; i < VIRTIO_BALLOON_PAGE_BMAP_DEFAULT_NUM; i++) { > + vb->balloon_page_chunk.page_bmap[i] = > + kmalloc(VIRTIO_BALLOON_PAGE_BMAP_SIZE, GFP_KERNEL); > + if (!vb->balloon_page_chunk.page_b...

...+ struct virtio_balloon_page_chunk_hdr *balloon_page_chunk_hdr; > + struct virtio_balloon_page_chunk *balloon_page_chunk; > + > + /* Bitmap used to record pages */ > + unsigned long *page_bmap[PAGE_BMAP_COUNT_MAX]; > + /* Number of the allocated page_bmap */ > + unsigned int page_bmaps; > + > + /* > + * The allocated page_bmap size may be smaller than the pfn range of > + * the ballooned pages. In this case, we need to use the page_bmap > + * multiple times to cover the entire pfn range. It's like using a > + * short ruler several times to finish measuri...

...+ struct virtio_balloon_page_chunk_hdr *balloon_page_chunk_hdr; > + struct virtio_balloon_page_chunk *balloon_page_chunk; > + > + /* Bitmap used to record pages */ > + unsigned long *page_bmap[PAGE_BMAP_COUNT_MAX]; > + /* Number of the allocated page_bmap */ > + unsigned int page_bmaps; > + > + /* > + * The allocated page_bmap size may be smaller than the pfn range of > + * the ballooned pages. In this case, we need to use the page_bmap > + * multiple times to cover the entire pfn range. It's like using a > + * short ruler several times to finish measuri...

...ess of response data. */ + resp_data_t *resp_data; + /* Size of response data buffer. */ + unsigned int resp_buf_size; + /* Pointer offset of the response data. */ + unsigned int resp_pos; + /* Bitmap used to record pages */ + unsigned long *page_bmap[PAGE_BMAP_COUNT_MAX]; + /* Number of split page bmaps */ + unsigned int page_bmaps; + + /* + * The allocated page_bmap size may be smaller than the pfn range of + * the ballooned pages. In this case, we need to use the page_bmap + * multiple times to cover the entire pfn range. It's like using a + * short ruler several times to finish measurin...

From: Matthew Wilcox <mawilcox at microsoft.com> The eXtensible Bitmap is a sparse bitmap representation which is efficient for set bits which tend to cluster. It supports up to 'unsigned long' worth of bits, and this commit adds the bare bones -- xb_set_bit(), xb_clear_bit(), xb_clear_bit_range(), xb_test_bit(), xb_find_next_set_bit(), xb_find_next_zero_bit(). More possible