search for: memcopy

Folks, the packets I want to place in an ogg stream are concatenations of two hunks of memory. Rather than memcopy() them into one then pass them to libogg, I patched framing.c to accept iovecs. The unified diff is 80 lines, minus the OS-specific stuff for defining struct ogg_iovec_t - pretty trivial. Is there any interest in it? Or is libogg frozen while all efforts are concentrated on libogg2? I had a...

Yes, I know this works peachy keen for char arrays. I'm looking at (which is hard to express in C) something like void foo () { int bar[20] = { 42, 42, ..., 42 }; } I don't want to do a memcopy of the 20 element constant array, and memset doesn't work here. I want an intrinsic that copys the scalar int constant 42 to each element of the int array. bagel On 11/10/2016 03:30 PM, Mehdi Amini wrote: > Hi, > > An alternative is to perform what is done for the equivalent C con...

...led in different times directly from 'portaudio'. On capture I do: speex_echo_cancellation(es,input,buffer,output); Input is the audio just captured Buffer is the last frame audio playbacked Output is obvious On playback I do: speex_preprocess_run(ps,(spx_int16_t*)output); memcopy(buffer,output,settings.bufferSize()); output is the frame audio to sound (different that the 'output' in capture) buffer store the last frame audio to be used later on capture (look on capture) Echo and preprocess states are conveniently initiated using speex_echo_state_init(fpb,fpb*2...

> On Aug 7, 2014, at 4:12 AM, Anton Korobeynikov <anton at korobeynikov.info> wrote: > >> I downloaded the latest NDK (r10) and compiled with the following cmd: >> arm-linux-androideabi-clang myMemcpy.c -S -fno-builtin -o0 >> It still produces assembly with a call to "memcpy". Maybe the -fno-builtin >> is broken also in the latest release. >

...do ugly stuff. For example, you can get a fake offset from an argument, and guarantee that this is always zero. Or you can add a random offset internally to one of them, and then compare that one is exactly the offset higher (or lower) than the other. Or you could pass %a and %b as parameters and memcopy them in the caller. Anything that would make it difficult for the compiler to see that both are the same would do... cheers, --renato

Use access_extent_buffer_page() to point at btree location of inline compressed data so it can be inflated without a memcopy. Signed-off-by: jim owens <jowens@hp.com> Signed-off-by: jim owens <jim6336@gmail.com> --- V2 fixes whitespace checkpatch warning fs/btrfs/extent_io.c | 16 ++++++++++++++++ fs/btrfs/extent_io.h | 3 +++ 2 files changed, 19 insertions(+), 0 deletions(-) diff --git a/fs/btrfs/e...

Hi, I am from a Java background and pretty new to Ruby and Rails. What I am wondering is how I would shared state accross requests and users without involving IO, i.e. use memory. My current understanding is that for each request a new process ist spawn and therefore it gets its own memory. So no sharing can take place between requests? Do I understand this right? For those who know

...erted into three instructions: VLDR + {whatever} + VSTR If the load and store are normally performed by one operation (I assume it's the same on Intel and others), why bother with the structure passing instead of just using load/store for vector types? Also, the extra struct { [i8 x 8] } for memcopy seems also redundant. If you're explicitly telling you want NEON (or whatever vector instructions), why bother with compatibility? -- cheers, --renato http://systemcall.org/ Reclaim your digital rights, eliminate DRM, learn more at http://www.defectivebydesign.org/what_is_drm

Hello, The code snippet pasted in the previous email are generated at -O0 with llc. Since I am inserting a new basic block (contains printf statement and program exit) which is jumped upon based on the result of the comparison, the compiler cannot/shouldnot optimize that away by means of DCE or anything else. The same kind of stuff is happening for the following duplication. bb6.split:

...f the alignment is better, and either the source or destination is on the stack, then it may make sense to increase the alignment of the alloca. A somewhat hacky alternative that would address this case would be to have a codegen prepare pass that would try to turn load-store sequences back into memcopy / memmove intrinsics (although the aliasing information present in the decision to use memmove may be lost from the load / store sequence), which we can then expand more efficiently in SelectionDAG. Do we have a sensible way of exposing this kind of target-specific information to optimisers other...

Frank, Both RZope and Rho solve this problem. RZope (http://www.analytics.washington.edu/statcomp/projects/rzope/)solves it by using *nix's fork command, which takes as much time as a memcopy. Rho(http://rho-project.org) solves it by maintaining a pool of idling R processes, which it maintains active & can pull to do a calculation immediately. Both of these are pretty immediate & allow multistep/session calculations.(As compared to CGI stuff) cheers, Nathan Here...

...knowledge would be pretty nasty IMHO. Did you modify the front end driver to do grant table mapping or is this all being done by mapping the domain's memory? > TCP receive throughput of > single vnic from 2.77Gbps up to 6Gps。In VM receive side，I instead grant_copy > with grant_map + memcopy，it efficiently reduce the cost of grant_table > spin_lock of dom0，So the hole server TCP performance from 5.33Gps up to > 9.5Gps。 > > Now I am consider the live migrate of vhost_net on Xen，vhost_net use > vhost_log for live migrate on Kvm，but qemu on Xen havn't manage the hole &g...

Greetings, I'm having some sort of problem using ov_read_float(). Everything looks good to me, but I'm trashing memory somehow, so clearly I'm screwing something up. What confuses me is why it takes a ***float for the buffer. I call it like so: float **buffer bytes_read = ov_read_float(&vf, &buffer, 0) memcpy (b, *buffer, 0); This compiles fine, but after a few reads,

...gel via llvm-dev <llvm-dev at lists.llvm.org<mailto:llvm-dev at lists.llvm.org>> wrote: Yes, I know this works peachy keen for char arrays. I'm looking at (which is hard to express in C) something like void foo () { int bar[20] = { 42, 42, ..., 42 }; } I don't want to do a memcopy of the 20 element constant array, and memset doesn't work here. I want an intrinsic that copys the scalar int constant 42 to each element of the int array. bagel On 11/10/2016 03:30 PM, Mehdi Amini wrote: > Hi, > > An alternative is to perform what is done for the equivalent C cons...

...> structure passing instead of just using load/store for vector types? As you noted, the struct wrappers produce a lot of extra code but it should all be optimized away. If you see a case where that is not happening, please file a bug report. > > Also, the extra struct { [i8 x 8] } for memcopy seems also redundant. > If you're explicitly telling you want NEON (or whatever vector > instructions), why bother with compatibility? I don't know what you're referring to here. Can you give an example?

HA! Just when I was getting ready to drop myself from this list, along comes a ham radio question! Shoving digital voice down a 100 Hz pipe would be mighty darned tough/impossible. N0YMV has a good suggestion. Try those WSJT modes. They use narrow bandwidth and are fun to play with. There are documented instances where moon-bounce QSOs have been completed with these modes. No, it's

...example, you can get a fake offset from an argument, and guarantee > that this is always zero. Or you can add a random offset internally to > one of them, and then compare that one is exactly the offset higher > (or lower) than the other. Or you could pass %a and %b as parameters > and memcopy them in the caller. > > Anything that would make it difficult for the compiler to see that > both are the same would do... > > cheers, > --renato > -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attac...

I am asking for some collective wisdom/guidance. What sort of IR construct should one use to implement filling each element in an array (or vector) with the same value? In C++, this might arise in "std:fill" or "std:fill_n", when the element values in the vector are identical. In the D language, one can fill an array or a slice of an array by an assignment, e.g.

...m-commits > -- *Alexandre Isoard* -------------- next part -------------- An HTML attachment was scrubbed... URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20180123/53c12b57/attachment.html> -------------- next part -------------- A non-text attachment was scrubbed... Name: memcopy.sed Type: application/octet-stream Size: 3741 bytes Desc: not available URL: <http://lists.llvm.org/pipermail/llvm-dev/attachments/20180123/53c12b57/attachment.obj>

...mentation/DataFlowSanitizer/memset.ll (145 more files...) _______________________________________________ llvm-commits mailing list llvm-commits at lists.llvm.org<mailto:llvm-commits at lists.llvm.org> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-commits -- Alexandre Isoard <memcopy.sed>_______________________________________________ LLVM Developers mailing list llvm-dev at lists.llvm.org<mailto:llvm-dev at lists.llvm.org> http://lists.llvm.org/cgi-bin/mailman/listinfo/llvm-dev -------------- next part -------------- An HTML attachment was scrubbed... URL: <http:/...