search for: unrepresentable

I would be interested in learning what the set of used semantics for float-to-int conversion is. If the only two used are 1) undefined behavior if unrepresentable and 2) saturate to int_{min,max} with NaN going to zero, then I think it makes sense to expose both of those natively in the IR. If the set is much larger, I think separate intrinsics for each behavior would make sense. It would be nice to get rid of the wasm-specific intrinsic for behavior (2) and...

...vary depending on the size of the floating point number, and the size and signedness of the target integer type. I think there are broadly three ways in which the current situation can be improved: 1. Provide a fptoui/fptosi variant to produces target-specific values instead of a poison value for unrepresentable values. The result would be whatever is fastest for the given target. 2. Provide an intrinsic for saturating floating point to int conversions, as described above. 3. Provide an intrinsic for floating point to int conversions, which additionally indicates whether the value was representable, simi...

I've been debugging some strange happenings over here and I put an assert in APInt to catch what I think is the source of the problem: int64_t getSExtValue() const { // An i1 -1 is unrepresentable. assert(BitWidth != 1 && "Signed i1 value is not representable!"); To me an i1 -1 makes no sense whatsoever. It is not representable in twos-complement form. It cannot be distinguished from unsigned i1 1. It turns out this assert triggers all over the place. Before I dive...

...> matroska timestamp. So rather than have continuous opus that > could be decoded one after another, you'd have to jump over these > little gaps? The intent was not to allow gaps in the file like this (that would confuse the encoder, compress badly, and complicate decoders, plus be unrepresentable in Ogg). The intent was to allow trimming from the _last_ frame in a stream to allow sample-accurate total duration. If there's some way to say that it cannot be used anywhere else in the spec, we should do so. > The document says it would be useful for Vorbis too, but Vorbis > seems...

...> NEW FEATURES: > * type.convert() (and hence by default read.table()) returns a > character vector or factor when representing a numeric input as a > double would lose accuracy. Similarly for complex inputs. > > If a file contains numeric data with unrepresentable numbers of > decimal places that are intended to be read as numeric, specify > colClasses in read.table() to be "numeric". How do I get the old behavior where type.convert() automatically converts to numeric if suitable, regardless of whether or not the string has mo...

On Jan 17, 2014, at 3:00 PM, Timothy B. Terriberry wrote: > The intent was not to allow gaps in the file like this (that would > confuse the encoder, compress badly, and complicate decoders, plus be > unrepresentable in Ogg). The intent was to allow trimming from the > _last_ frame in a stream to allow sample-accurate total duration. Ahhh, that makes sense. So you'd add some samples at the very end just to complete that last Opus frame? > > Like Opus, the idea was to use it in the last frame...

...5 12:49 PM > To: llvmdev at cs.uiuc.edu > Subject: [LLVMdev] i1 Values > > I've been debugging some strange happenings over here and I put an assert > in APInt to catch what I think is the source of the problem: > > int64_t getSExtValue() const { > // An i1 -1 is unrepresentable. > assert(BitWidth != 1 && "Signed i1 value is not representable!"); > > To me an i1 -1 makes no sense whatsoever. It is not representable in twos- > complement form. It cannot be distinguished from unsigned i1 1. > > It turns out this assert triggers all...

...t dma_addr_t 291 * are certain non-highmem MIPS and x86 292 * configurations, but these configurations 293 * should never allocate physical pages above 32 294 * bits, so this is fine. Just in case, throw a 295 * warning and abort if we end up with an 296 * unrepresentable address. 297 */ 298 if (WARN_ON_ONCE(*dma_handle != phys_addr)) { 299 free_pages_exact(queue, PAGE_ALIGN(size)); 300 return NULL; 301 } 302 } 303 return queue; 304 } 305 } 306 --- 0-DAY CI Kernel Test Service, Intel Corporation https://lists.01...

...pixman-sse2: Fix an undefined left shift pixman-fast-path: Fix various undefined left shifts pixman-bits-image: Fix various undefined left shifts pixman-bits-image: Fix left shift of a negative number pixman-matrix: Fix left shift of a negative number test: Fix unrepresentable subtraction in stress-test pixman-mmx: Fix undefined left-shifts pixman-mmx: Fix undefined unaligned loads pixman-sse2: Fix undefined unaligned loads fast-path: Fix some sketchy pointer arithmetic Antonio Ospite (1): pixman-compiler.h: fix building tests with M...

Yes, it's basically an intrinsic aspect of the mathematics. If you seek into the middle of an Opus stream, that's about how long it takes before the audio converges to be correct. On Jan 17, 2014 2:13 PM, "Brendan Bolles" <brendan at fnordware.com> wrote: > On Jan 7, 2014, at 11:11 AM, Brendan Bolles wrote: > > > The closest thing to a standards document for

...ddress calculation as a dereference. The word ‘dereference’ does not appear in the C standard, which talks only about use, and therefore treats *x and &x->y both as uses. This is intentional, because on segmented architectures it is possible that NULL + X will give you an out-of-bounds and unrepresentable pointer, possibly even causing a trap. A Linux kernel compiled with clang was not vulnerable, because LLVM was not eliding this check, which makes this flag somewhat pointless. LLVM assumed that a reachable load or a store of an pointer guaranteed that it was not NULL, but that a GEP did not. I...

> On Apr 20, 2018, at 2:06 AM, Csaba Raduly via cfe-dev <cfe-dev at lists.llvm.org> wrote: > > On 4/20/18, James Y Knight wrote: >> >> >> Yep. "-fnull-pointer-is-valid" has been suggested before. >> > > -fplacate-linux-kernel-developers ? Please, lets keep this discussion on topic and productive. The semantics described upstream of (the

...t dma_addr_t 291 * are certain non-highmem MIPS and x86 292 * configurations, but these configurations 293 * should never allocate physical pages above 32 294 * bits, so this is fine. Just in case, throw a 295 * warning and abort if we end up with an 296 * unrepresentable address. 297 */ 298 if (WARN_ON_ONCE(*dma_handle != phys_addr)) { 299 free_pages_exact(queue, PAGE_ALIGN(size)); 300 return NULL; 301 } 302 } 303 return queue; 304 } 305 } 306 --- 0-DAY CI Kernel Test Service, Intel Corporation https://lists.01...

...ue. I think we already discussed this in review and settled on keeping it undefined, but from my side it's only because I don't really have a good argument for making it zeroed; technically this is overflow and therefore undefined anyway. I think that ensuring that we don't produce unrepresentable values is good, though. >>>> I’m unsure if I should stop what I’m working on now though to >>>> implement this type. Although it seems correct, there also doesn’t >>>> seem to be a very high demand for a new llvm type. I imagine another >>>> reason on...

On 2018-08-22 05:56, John McCall via llvm-dev wrote: >> On Aug 21, 2018, at 6:20 PM, Leonard Chan <leonardchan at google.com> wrote: >> If we were to create a new type down the line, I think the main >> features that would distinguish them from other types are the >> arbitrary width and scale. Saturation can be handled through >> instructions since saturation

FYI, looks like support for Racoon is ending. Does anyone have any experience with the version in ipsec-tools ? ---Mike >Racoon users, > >This is the announcement that the kame project will quit providing >a key management daemon, the racoon, and that "ipsec-tools" will become >the formal team to release the racoon. >The final release of the racoon in the

This patch series is the follow up on the discussions we had before about the RFC titled [RFC,V2] virtio: Add platform specific DMA API translation for virito devices (https://patchwork.kernel.org/patch/10417371/). There were suggestions about doing away with two different paths of transactions with the host/QEMU, first being the direct GPA and the other being the DMA API based translations.

This patch series is the follow up on the discussions we had before about the RFC titled [RFC,V2] virtio: Add platform specific DMA API translation for virito devices (https://patchwork.kernel.org/patch/10417371/). There were suggestions about doing away with two different paths of transactions with the host/QEMU, first being the direct GPA and the other being the DMA API based translations.

Hi, This patch set implements packed ring support in virtio driver. A performance test between pktgen (pktgen_sample03_burst_single_flow.sh) and DPDK vhost (testpmd/rxonly/vhost-PMD) has been done, I saw ~30% performance gain in packed ring in this case. To make this patch set work with below patch set for vhost, some hacks are needed to set the _F_NEXT flag in indirect descriptors (this should

Hi, This patch set implements packed ring support in virtio driver. A performance test between pktgen (pktgen_sample03_burst_single_flow.sh) and DPDK vhost (testpmd/rxonly/vhost-PMD) has been done, I saw ~30% performance gain in packed ring in this case. To make this patch set work with below patch set for vhost, some hacks are needed to set the _F_NEXT flag in indirect descriptors (this should