search for: short_ptr

On Thu, Feb 5, 2009 at 1:34 PM, Villmow, Micah <Micah.Villmow at amd.com> wrote: > I need to do a similar where I convert the 16bit floats to 32bit floats on > memory operations for both scalar and vector formats. So can these > operations be implemented without adding 16 bit float support natively to > LLVM? If so, how? In this case, you only really need two currently

Eli, This is similar to what I was originally thinking, but I also need to support i16 data type and conversions between it and floating point values. So would there be a way for me to distinguish between a half and a short? For example, I have the short a = load_from_memory(short_ptr, index); and half a = load_from_memory(half_ptr, index); if I force it to use i16 wouldn't the function be the sam in the IR? i.e. declare i16 @load_from_memory(i16*, i32)? Thanks, Micah -----Original Message----- From: llvmdev-bounces at cs.uiuc.edu [mailto:llvmdev-bounces at cs.uiuc.edu]...

...the end of the sum. For example, shifting only by 8 in the loop and doing a final shift by 7 outside the loop. 9) For endianness conversion, you shouldn't have to even detect it. I think something like this (untested) should work for both little-endian and big endian: for (i=0;i<...;i++) short_ptr[i] = char_ptr[2*i] + (char_ptr[2*i] << 8); 10) Please don't store pointers (MappingMatrix, OpusMSEncoder, ...) in the OpusPEncoder/OpusPDecoder structs. All the data should be in a single struct with no pointers (except to constant data) so that they can be shallow-copied. Cheers, Jea...

...understand what you mean here (and I can't see where that change is in the code). > 9) For endianness conversion, you shouldn't have to even detect it. I > think something like this (untested) should work for both little-endian > and big endian: > for (i=0;i<...;i++) > short_ptr[i] = char_ptr[2*i] + (char_ptr[2*i] << 8); > > *Can you show how to go from short -> char as well? I'm alittle confused > on how this can be done without knowing the endianness first.* Well, the endianness of a machine is only visible when you attempt to cast multi-byte valu...

...>>4 to input inside the loop and >>= 7 to the output outside the loop. Let me know your thoughts.* 9) For endianness conversion, you shouldn't have to even detect it. I think something like this (untested) should work for both little-endian and big endian: for (i=0;i<...;i++) short_ptr[i] = char_ptr[2*i] + (char_ptr[2*i] << 8); *Can you show how to go from short -> char as well? I'm alittle confused on how this can be done without knowing the endianness first.* 10) Please don't store pointers (MappingMatrix, OpusMSEncoder, ...) in the OpusPEncoder/OpusPDecoder...

...I can't see where that > change is in the code). > > > 9) For endianness conversion, you shouldn't have to even detect it. I > > think something like this (untested) should work for both little-endian > > and big endian: > > for (i=0;i<...;i++) > > short_ptr[i] = char_ptr[2*i] + (char_ptr[2*i] << 8); > > > > *Can you show how to go from short -> char as well? I'm alittle confused > > on how this can be done without knowing the endianness first.* > > Well, the endianness of a machine is only visible when you attempt...

...change is in the code). > > > 9) For endianness conversion, you shouldn't have to even detect it. I > > think something like this (untested) should work for both > little-endian > > and big endian: > > for (i=0;i<...;i++) > > short_ptr[i] = char_ptr[2*i] + (char_ptr[2*i] << 8); > > > > *Can you show how to go from short -> char as well? I'm alittle > confused > > on how this can be done without knowing the endianness first.* > > Well, the endianness of a machine is only...

Hello all, Attached is an up-to-date patch for supporting channel mapping 253. Please advise and Thank you for your time. Cheers, Drew -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.xiph.org/pipermail/opus/attachments/20170919/055d9034/attachment-0001.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: