search for: holes

...erves an IR type, but not source level types. IR types are insufficient for TBAA or "hole" information. But do IR types have to remain insufficient? Couldn't we ensure the front-end adds fields to the IR types for all bytes which really exist (in any one of the unioned types). Then holes in the IR type really are holes and we wouldn't need new metadata for holes. In your example from earlier: union x { struct { char b; int c; } a; short b; } u; currently generates %union.x = type { %struct.anon } %struct.anon = type { i8, i32 } but would fully describe all the holes if...

...22.44 22.41 24.24 24.13 A2 cat SPACY 119.64 33.04 342.77 17.30 B1 cat HOLEY 222.85 222.08 22.91 22.41 B2 md5 SPACY 210.01 77.46 337.51 25.54 C1 md5 HOLEY 856.39 801.21 82.11 28.31 C2 A1, A2: Numbers are more or less as expected. When doing large reads, reading from "holes" takes far less time than from a real disk. We also see that UFS2 disk is about 3 times slower for sequential reads. B1, B2: UFS2 numbers are as expected but ZFS numbers for the HOLEY file are much too high. Why should *not* going to a real disk cost more? We also see that UFS2 handles hol...

On Aug 30, 2012, at 1:34 PM, Krzysztof Parzyszek <kparzysz at codeaurora.org> wrote: > On 8/22/2012 3:15 PM, Dan Gohman wrote: >> Here's an example showing the basic problem: >> >> struct bar { >> char x; >> float y; >> double z; >> }; >> void copy_bar(struct bar *a, struct bar *b) { >> *a = *b; >> } >>

...apple.com> wrote: >> On Aug 23, 2012, at 3:59 PM, Dan Gohman <gohman at apple.com> wrote: >>> On Aug 23, 2012, at 3:31 PM, Chris Lattner <clattner at apple.com> wrote: >>>> Interesting approach. The IR type for a struct may or may not be enough to describe holes (think unions and other cases), have you considered a more explicit MDNode that describes the ranges of any holes? >>> >>> What's the issue with unions? Do you mean unions containing structs >>> containing holes? >> >> Unions don't lower to a unique...

Instead of printing something like ‘type=0’ or ‘type=3’, this changes the output to show the hole and zero flags separately. For example: $ ./nbdkit -U - --filter=log sh - logfile=/dev/stdout \ --run 'qemu-img map $nbd' <<'EOF' case "$1" in get_size) echo 1M ;; pread) dd if=/dev/zero count=$3 iflag=count_bytes ;; can_extents) exit 0 ;;

...example script. holepoly <- read.polyfile(system.file("poly-ex/hole-poly.txt", package ="gpclib"), nohole = FALSE) area.poly(holepoly) plot(holepoly,poly.args=list(col="red",border="blue")) And I noticed plot function couldn't draw polygons with holes correctly. Does anyone know how to solve this situation? Regards.

I have obtained shapefiles for Indian states from here: http://www.maptell.com/index.php?option=com_remository&Itemid=159&func=fileinfo&filecatid=115&parent=category Problem: I want to extract centroid coordinates for each State, but there is some coding problem with the shapefiles that prevents this. #Code: #After extracting the shapefiles from the india_state.zip file, then:

...able to do this, while handling all common types on the fast path, if we use both alignment and type information. When accessing data of B bytes, 2*B bits of shadow memory can be used. Thus, we'll get 2 bits for a one-byte type, 4 bits for a two-byte type, etc. Moreover, we need appropriate holes in the encoding space so that no type has a shadow encoding that overlaps with an aligned part of a larger type's encoding. For example, we need to detect: double f = ...; return *(int*) &f; // We should catch this. We might use the following encoding. The idea is that the common cas...

Allow compile time creation of a hole at the high end of linear address space. This makes accomodating a hypervisor a much more tractable problem by giving it ample playground to live in. Currently, the hole size is fixed at config time; I have experimented with dynamically sized holes, and have a later patch that developes this potential, but it becomes much more useful once the exact negotiation of linear address space with the hypervisor is defined. The fixed compile time solution is sufficient for now. Signed-off-by: Zachary Amsden <zach@vmware.com> Index: linux-2.6.1...

Allow compile time creation of a hole at the high end of linear address space. This makes accomodating a hypervisor a much more tractable problem by giving it ample playground to live in. Currently, the hole size is fixed at config time; I have experimented with dynamically sized holes, and have a later patch that developes this potential, but it becomes much more useful once the exact negotiation of linear address space with the hypervisor is defined. The fixed compile time solution is sufficient for now. Signed-off-by: Zachary Amsden <zach@vmware.com> Index: linux-2.6.1...

Is there a way to find the holes in sparse files, other than assuming contiguous blocks of zeroes are holes? Thanks, Sean

I have a partly damaged CD, from which I extracted 192Kb/s Vorbis files a while ago (before it got damaged) and I'd like to get FLAC files. `cdparanoia' extracted most of the data from the CD, but there are some holes due to the damages. How could I fill those holes in my FLAC files using the Vorbis files? Stefan

I have a partly damaged CD, from which I extracted 192Kb/s Vorbis files a while ago (before it got damaged) and I'd like to get FLAC files. `cdparanoia' extracted most of the data from the CD, but there are some holes due to the damages. How could I fill those holes in my FLAC files using the Vorbis files? Stefan

I have a partly damaged CD, from which I extracted 192Kb/s Vorbis files a while ago (before it got damaged) and I'd like to get FLAC files. `cdparanoia' extracted most of the data from the CD, but there are some holes due to the damages. How could I fill those holes in my FLAC files using the Vorbis files? Stefan

...all common types on the fast path, if we use both > alignment and type information. When accessing data of B bytes, > 2*B bits of shadow memory can be used. Thus, we'll get 2 bits for > a one-byte type, 4 bits for a two-byte type, etc. Moreover, we > need appropriate holes in the encoding space so that no type has a > shadow encoding that overlaps with an aligned part of a larger > type's encoding. > For example, we need to detect: > > double f = ...; return *(int*) &f; // We should catch this. > > We might use the f...

Hi,all I have tried to passthrough GPU card(Nvidia quadro 4000) on the latest Xen unstable version (QEMU is using Qemu-upsteam-unstable, not traditional Qemu). This issue as below: Windows7 64-bit guest will blue screen when GPU passthrough configure 4g memory,blue screen code is 50, and SUSE 11 64-bit guest will always stay at the grub screen. I noticed that it will relocate RAM that

...the fast path, if we use both alignment and type information. >> When accessing data of B bytes, 2*B bits of shadow memory can >> be used. Thus, we'll get 2 bits for a one-byte type, 4 bits >> for a two-byte type, etc. Moreover, we need appropriate holes >> in the encoding space so that no type has a shadow encoding >> that overlaps with an aligned part of a larger type's encoding. >> For example, we need to detect: >> >> double f = ...; return *(int*) &f; // We should catch th...

...Whee, I just _know_ I'm going to be positively skewered (and maybe even plonked!) for this.... but, hey, it's Friday, and this post is meant to be a bit funny.? So lighten up, and enjoy a short read. obHumor: I actually have a piece of furniture (a small table) with square pegs in round holes.? The spaces between the sides of the square peg and the round hole are filled with a color-contrasting glue, and the result is rather pretty.? :-)? I intentionally picked this furniture specifically because of the square pegs in the round holes..... obHistory: Cobblers making boots back in the...

the data in holes is actually not zeros as there might be a parent image having other data. Properly reporting (non-)zero hole extents allows clients to have information about whether the data in the image is unallocated, but the read will return zero blocks (HOLE+ZERO) or whether the data is just not in this later...

Keir, Here''s a first patch to address the issue with rolling over to guest-physical address 0x00000000 when assigning address regions to PCI BARs during HVM boot. For now, this: - Makes the hole bigger: 0xC0000000-0xF5000000. This might be overkill...but it should only matter for 32-bit guest OSes assigned more than 3GB of RAM. - Prevents addresses from above 0xF50000000 from