search for: new_block

...0 to i32 > store i32 %n, i32* %n_addr > %0 = call i32 (i8*, ...)* @printf(i8* noalias getelementptr inbounds > ([20 x i8]* @.str, i32 0, i32 0)) nounwind > %1 = load i32* %n_addr, align 4 > %2 = and i32 %1, 1 > * %3* = icmp eq i32 %2, 0 > ..... > br label %new_block > > new_block: > %4 = call i32 (i8*, ...)* @printf(i8* noalias getelementptr inbounds ([10 > x i8]* @.str1, i32 0, i32 0), i32 *%3*) nounwind > ... > > > How to solve this? > > 2011/9/5 Rafael Baldiati Parizi <parizi.computacao at gmail.com> > >> Ok!...

...%"alloca point" = bitcast i32 0 to i32 store i32 %n, i32* %n_addr %0 = call i32 (i8*, ...)* @printf(i8* noalias getelementptr inbounds ([20 x i8]* @.str, i32 0, i32 0)) nounwind %1 = load i32* %n_addr, align 4 %2 = and i32 %1, 1 * %3* = icmp eq i32 %2, 0 ..... br label %new_block new_block: %4 = call i32 (i8*, ...)* @printf(i8* noalias getelementptr inbounds ([10 x i8]* @.str1, i32 0, i32 0), i32 *%4*) nounwind ... How to solve this? 2011/9/5 Rafael Baldiati Parizi <parizi.computacao at gmail.com> > Ok! I do understand. > Thanks by help! > > >...

...c_located(loc, e) -> printf "%s at line %d\n" (Printexc.to_string e) (Loc.start_line loc); exit 1 open Llvm let ( |> ) x f = f x type state = { fn: llvalue; blk: llbasicblock; vars: (string * llvalue) list } let bb state = builder_at_end state.blk let new_block state name = append_block name state.fn let find state v = try List.assoc v state.vars with Not_found -> eprintf "Unknown variable %s\n" v; raise Not_found let cont (v, state) dest_blk = build_br dest_blk (bb state) |> ignore; v, state let rec expr state = function...

Ok! I do understand. Thanks by help! 2011/9/5 Justin Holewinski <justin.holewinski at gmail.com> > On Mon, Sep 5, 2011 at 8:37 PM, Rafael Baldiati Parizi < > parizi.computacao at gmail.com> wrote: > >> Yes, that's how I'm doing now ... create a new block where the execution >> flow will continue after the shift, following the basics of basic blocks.

Here's my translation of the Fibonacci example into OCaml: open Printf open Llvm let build_fib m = let fibf = define_function "fib" (function_type i32_type [| i32_type |]) m in let bb = builder_at_end (entry_block fibf) in let one = const_int i32_type 1 and two = const_int i32_type 2 in let argx = param fibf 0 in set_value_name "AnArg" argx; let

Hi Mark/Joel, This is the v2 of bug fix for ocfs2_add_branch. Modification from V1 to V2: 1. Create a patch which return EROFS instead of BUG in ocfs2_insert_at_leaf. 2. Use ocfs2_adjust_rightmost_records to change the root and extent blocks in the rightmost path. Regards, Tao

Hello Richard As discussed in the IRC channel, when merging a moderately large reg file (~35MB) to a hiv file (~118 MB); hivex generates a huge hiv file (~580 MB). These changes address that by creating a list of unallocated blocks and reassigning unused blocks. I used https://github.com/msuhanov/regf/blob/master/Windows%20registry%20file%20format%20specification.md as a reference for the

...atic int ocfs2_add_branch(struct ocfs2_super *osb, struct ocfs2_extent_block *eb; struct ocfs2_extent_list *eb_el; struct ocfs2_extent_list *el; - u32 new_cpos; + u32 new_cpos, root_end; mlog_entry_void(); @@ -1055,6 +1126,28 @@ static int ocfs2_add_branch(struct ocfs2_super *osb, new_blocks = le16_to_cpu(el->l_tree_depth); + eb = (struct ocfs2_extent_block *)(*last_eb_bh)->b_data; + new_cpos = ocfs2_sum_rightmost_rec(&eb->h_list); + root_end = ocfs2_sum_rightmost_rec(et->et_root_el); + + /* + * If there is a gap before the root end and the real end + * of the righ...

...+ data.flags = req->flags; + data.dest_dev = data.copy_src_dev = 0; + + dmu_clr_flag(&data.flags, DMU_FLAG_COPY_FIRST); + dmu_clr_flag(&data.flags, DMU_FLAG_SYNC); + + ret = ctx->events.map_fn(ctx->event_data.map_user_data, &data); + + resp.org_block = req->org_block; + resp.new_block = data.block; + resp.offset = data.offset; + resp.flags = data.flags; + resp.id_of_req = data.id; + + dmu_split_dev(data.copy_src_dev, &resp.src_maj, &resp.src_min); + dmu_split_dev(data.dest_dev, &resp.dst_maj, &resp.dst_min); + + DPRINTF("Mapped %llu -> %llu\n", resp....

Hi all, this is the long awaited patch series to add xen device model support in qemu; the main author is Anthony Perard. Developing this series we tried to come up with the cleanest possible solution from the qemu point of view, limiting the amount of changes to common code as much as possible. The end result still requires a couple of hooks in piix_pci but overall the impact should be very

...-git a/fs/ocfs2/refcounttree.c b/fs/ocfs2/refcounttree.c index 1cf9cda..e082623 100644 --- a/fs/ocfs2/refcounttree.c +++ b/fs/ocfs2/refcounttree.c @@ -2921,7 +2921,7 @@ static int ocfs2_duplicate_clusters_by_page(handle_t *handle, struct super_block *sb = ocfs2_metadata_cache_get_super(ci); u64 new_block = ocfs2_clusters_to_blocks(sb, new_cluster); struct page *page; - pgoff_t page_index; + pgoff_t page_index, last_page; unsigned int from, to; loff_t offset, end, map_end; struct address_space *mapping = context->inode->i_mapping; @@ -2932,12 +2932,20 @@ static int ocfs2_duplicate_clus...

..._inode_flags(&btrfs_inode, BTRFS_INODE_NODATASUM); btrfs_init_path(&path); trans = btrfs_start_transaction(root, 1); @@ -862,7 +879,7 @@ static int create_ext2_image(struct btrf goto fail; ret = record_file_extent(trans, root, objectid, &btrfs_inode, last_byte, - new_block, sectorsize, 1); + new_block, sectorsize, 0); if (ret) goto fail; } @@ -902,6 +919,11 @@ again: continue; } + /* + * Check backref to distinguish extent items for normal + * files (files that correspond to files in Ext2fs) from + * extent items for ctree blocks. + */...

Hi all, So I have finally finished the v1 of reflink for ocfs2. It has some bugs that I am still investigating, but the schema is almost there. So I'd like to send it out first for review. And Tristan and I will continue to work on the stability of the code. The general information for reflink, please see http://oss.oracle.com/osswiki/OCFS2/DesignDocs/Reflink. For the design doc, please

Hi all, Change from v1 to v2: bug fix and metadata/credits reservation improvement. The general information for reflink, please see http://oss.oracle.com/osswiki/OCFS2/DesignDocs/Reflink. For the design doc, please see http://oss.oracle.com/osswiki/OCFS2/DesignDocs/RefcountTrees http://oss.oracle.com/osswiki/OCFS2/DesignDocs/ReflinkOperation

Hi all, So I have finally finished the v3 of reflink for ocfs2. The biggest change is that we support 64bit cluster offset now(Thank Mark and Joel for it). [View] http://oss.oracle.com/git/?p=tma/linux-2.6.git;a=shortlog;h=refcount [Pull] git://oss.oracle.com/git/tma/linux-2.6.git refcount The general information for reflink, please see http://oss.oracle.com/osswiki/OCFS2/DesignDocs/Reflink.

The following series of patches attempts to detach metadata I/O from struct inode. They are currently tied together pretty tightly. Metadata reads happen via the ocfs2_read_blocks() functions, writes via both jbd2 and ocfs2_write_blocks(). - Each inode has a cache of associated metadata blocks stored on its ip_metadata_cache member. The ocfs2_read/write_blocks() functions take a struct