search for: hole

...ends describe the copy using >>> metadata. For example: >> >> Why not simply have something like this? >> >> %1 = load bar* %b >> store %1, bar* %a > > That preserves 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...

[originally reported for ZFS on FreeBSD but Pawel Jakub Dawid says this problem also exists on Solaris hence this email.] Summary: on ZFS, overhead for reading a hole seems far worse than actual reading from a disk. Small buffers are used to make this overhead more visible. I ran the following script on both ZFS and UF2 filesystems. [Note that on FreeBSD cat uses a 4k buffer and md5 uses a 1k buffer. On Solaris you can replace them with dd with respective b...

...n I propose here is to have front-ends describe the copy using >> metadata. For example: > > Why not simply have something like this? > > %1 = load bar* %b > store %1, bar* %a That preserves an IR type, but not source level types. IR types are insufficient for TBAA or "hole" information. -Chris

...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 ;;...

Hi. I've tried to create a polygon with one hole by gpclib using following 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...

...il Nadu",], col = 1:8) #Extract centroid for a State (this works): gCentroid(india[india$NAME == "Tamil Nadu",]) #Error arises for this State: gCentroid(india[india$NAME == "Gujarat",]) #Error says: #Error in createPolygonsComment(p) : #rgeos_PolyCreateComment: orphaned hole, cannot find containing polygon for hole at index 2 #Code ends I don't know my way around SpatialPolygonsDataFrame objects very well, and have no idea how to fix the errant hole. Any help greatly appreciated. Thanks Dan Bebber

...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 ca...

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 poten...

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 poten...

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...

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 t...

On 10/13/2017 10:19 AM, Anand Buddhdev wrote: > .. > Stop trying to force a square peg into a round hole. 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 roun...

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 late...

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 being assigned to PCI devices by the HVM BIOS (and prevents rollover to 0x00000000) I also have some code to par...