similar to: perl code to remove newlines

On 2 Oct 2012, at 03:40, Nick Lewycky wrote: > As far as I know, this optimization is legal. Fix the test with a volatile pointer: Why would that be required? malloc() is defined by the standard to return a pointer that is distinct from any other valid pointer, or NULL. Any optimisation that makes any assumptions about its next value is invalid. > int main() { > volatile char

DMA-related logic is separated from the virtqueue_add_packed(). DMA address will be saved as sg->dma_address, then virtqueue_add_packed() will use it directly. Unmap operation will be simpler. The purpose of this is to facilitate subsequent support to receive dma address mapped by drivers. Signed-off-by: Xuan Zhuo <xuanzhuo at linux.alibaba.com> --- drivers/virtio/virtio_ring.c | 37

This code is essentially from an LTP test ( http://ltp.sourceforge.net/ <http://ltp.sourceforge.net/> ). #include <stdlib.h> int main() { void *curr; do { curr = malloc(1); } while (curr); return 0; } If you compile it with no optimization, it will keep the malloc calls. If you compile it with -O2, it will create an infinite loop, i.e. assuming that malloc

I've sent this issue to some friends on the C++ committee. The first response I received indicates that the person thinks the optimizer is within it's rights to optimize away the call to malloc. Here are some points, extracted from the response: "There is no observable behavior (a technical term in the standard) that violates requirements of the standard. In particular, malloc in

This patch adds a simple callback framework. Modified loadfile and floadfile to look for callbacks and call them if present Supports multiple callbacks Modified com32/modules/linux.c to demonstrate functionality (it's a little more complicated than it should be just to demonstrate multiple callbacks). Add progress argument to display a percentage indicator when loading. Example boot:

Dear all, I'm currently working on the automated program analysis tool AProVE (http://aprove.informatik.rwth-aachen.de/) and would like to use LLVM for analysis of C programs. I have the following example C program dealing with simple lists of integers: ------------ start C example ------------- #include<stdlib.h> struct list_el { int val; struct list_el * next; }; typedef

Extend the guestfs_inspect_list_applications2 API call to work on Arch Linux guest images. --- src/inspect-apps.c | 125 +++++++++++++++++++++++++++++++++++++++++++++++++++++ 1 file changed, 125 insertions(+) diff --git a/src/inspect-apps.c b/src/inspect-apps.c index b62b432..b7a3b0e 100644 --- a/src/inspect-apps.c +++ b/src/inspect-apps.c @@ -60,6 +60,7 @@ static struct

David Chisnall wrote: > On 2 Oct 2012, at 03:40, Nick Lewycky wrote: > >> As far as I know, this optimization is legal. Fix the test with a volatile pointer: > > Why would that be required? It isn't. My suggestion for fixing the test is to make use of the returned pointer in a fashion that the compiler is forbidden to elide it: make it an observable side-effect using

DMA-related logic is separated from the virtqueue_add_vring_packed() to prepare for subsequent support for premapped. DMA address will be saved as sg->dma_address, then virtqueue_add_vring_packed() will use it directly. If it is a premapped scene, the transmitted sgs should have saved DMA address in dma_address, and in virtio core, we need to pass virtqueue_map_sgs(). Signed-off-by: Xuan

On 1 October 2012 18:34, reed kotler <rkotler at mips.com> wrote: > This code is essentially from an LTP test ( http://ltp.sourceforge.net/). > > > #include <stdlib.h> > > int main() { > void *curr; > > do { > curr = malloc(1); > } while (curr); > > return 0; > > } > > If you compile it with no optimization, it will keep

Hi, sorry if I misunderstood everything... In the file src/gallium/drivers/nouveau/nv30/nv30_screen.c there is loans of PUSH_DATA which is basically *push->curr = data; I'm thinking that somehow push->curr is the bo->map = drm_mmap(...) that is called in nouveau_bo_map. But I cannot see how they are linked... Because when nouveau_bo_map calls nouveau_bo_wait push =

See also this proposal for the next C++ committee meeting, which aims to clarify this case and others like it: http://www.open-std.org/jtc1/sc22/wg21/docs/papers/2012/n3433.html On Tue, Oct 2, 2012 at 9:49 AM, Reed Kotler <rkotler at mips.com> wrote: > I've sent this issue to some friends on the C++ committee. > > The first response I received indicates that the person thinks

But at the time the mesa3d file src/gallium/drivers/nouveau/nv30/nv30_screen.c is called and when the various PUSH_DATA begin to be called there is not yet a call to nouveau_pushbuf_space. So it would generate a seg fault in push->curr. Again, sorry for the confusion and thanks for the reply. Awaiting for an answer if possible. Thanks in advance. 2015-11-02 14:44 GMT-03:00 Ilia Mirkin

On 07/26/2016 06:23 PM, Liang Li wrote: > + for_each_migratetype_order(order, t) { > + list_for_each(curr, &zone->free_area[order].free_list[t]) { > + pfn = page_to_pfn(list_entry(curr, struct page, lru)); > + if (pfn >= start_pfn && pfn <= end_pfn) { > + page_num = 1UL << order; > + if (pfn + page_num > end_pfn) > + page_num =

On 07/26/2016 06:23 PM, Liang Li wrote: > + for_each_migratetype_order(order, t) { > + list_for_each(curr, &zone->free_area[order].free_list[t]) { > + pfn = page_to_pfn(list_entry(curr, struct page, lru)); > + if (pfn >= start_pfn && pfn <= end_pfn) { > + page_num = 1UL << order; > + if (pfn + page_num > end_pfn) > + page_num =

This is the next patch series for scrub userland tools. Change log v1->v2: - commands now reachable as "btrfs scrub ..." instead of "btrfs filesystem scrub ..." - ability to scrub a single device instead of a whole file system - superfluous command line options removed - resume is now a separate command ("scrub resume") instead of "scrub start -r" -

Hi, is there a good reason why taskomatic check the number of real cores in the find_capable_host ? It prevents to use the full capacity of multithreading Signed-off-by: Arthur Clement <aclement at linagora.com> --- src/task-omatic/taskomatic.rb | 2 +- 1 files changed, 1 insertions(+), 1 deletions(-) diff --git a/src/task-omatic/taskomatic.rb b/src/task-omatic/taskomatic.rb index

Change code to use list_entry api. And removed comment suggesting that change. Signed-off-by: Abhishek Kane <v-abkane at microsoft.com> Signed-off-by: K.Y. Srinivasan <kys at microsoft.com> Signed-off-by: Hank Janssen <hjanssen at microsoft.com> --- drivers/staging/hv/channel_mgmt.c | 17 +++++++++-------- 1 files changed, 9 insertions(+), 8 deletions(-) diff --git

Change code to use list_entry api. And removed comment suggesting that change. Signed-off-by: Abhishek Kane <v-abkane at microsoft.com> Signed-off-by: K.Y. Srinivasan <kys at microsoft.com> Signed-off-by: Hank Janssen <hjanssen at microsoft.com> --- drivers/staging/hv/channel_mgmt.c | 17 +++++++++-------- 1 files changed, 9 insertions(+), 8 deletions(-) diff --git

On 07/18/2011 07:03 PM, Jimborean Alexandra wrote: > Hi, > > I plan to do some speculative parallelization in LLVM using Polly and I > target loops that contain pointers and indirect references. As far as I > know, Polly generates optimized code starting from the SCoPs, therefore > I plan to replace all pointer accesses with array accesses, such that > Polly will accept the