Displaying 18 results from an estimated 18 matches for "range_starts".
Did you mean:
range_start
2006 Apr 16
12
tired of using defined? all the time
Hi everyone,
It seems like every time I want to evaluate a possibly undefined variable I
have to use defined? to see that it exists first, so I can''t simply have
-- if params[:range_start] > 3
or something like it. I need to have
-- if defined? params[:range_start] && params[:range_start] > 3
I can''t even have
-- if params[:range_start].nil?
This is really
2008 Jul 09
1
memory leak in sub("[range]",...)
...eval (eval.c:461)
==32503== by 0x8160DA7: do_begin (eval.c:1174)
==32503== by 0x815F0EB: Rf_eval (eval.c:461)
==32503== by 0x8162210: Rf_applyClosure (eval.c:667)
The leaked blocks are allocated in iinternal_function build_range_exp() at
5200 /* Use realloc since mbcset->range_starts and
mbcset->range_ends
5201 are NULL if *range_alloc == 0. */
5202 new_array_start = re_realloc (mbcset->range_starts,
wchar_t,
5203 new_nranges);
5204 new_array_end = re_realloc (mbcset->range_en...
2008 Aug 07
1
memory leak in sub("[range]", ...) when #ifndef _LIBC (PR#11946)
...: 12,599,585 bytes in 5,915 blocks.
==28643== suppressed: 0 bytes in 0 blocks.
==28643== Reachable blocks (those to which a pointer was found) are not shown.
==28643== To see them, rerun with: --show-reachable=yes
The flagged memory block is the range_ends component of mbcset.
I think that range_starts was also being leaked, but valgrind was
combining the two.
It looks like the cpp macro _LIBC is not defined when I compile
R in this Linux box. regex.c defines range_ends and range_starts
as different types, depending on the value of _LIBC, and it allocates
space for them in either case. Howeve...
2006 Mar 30
2
Functional test confusion
I have been reading about testing in RoR for what seems like hours now
in search of the answer to what is probably a simple problem. Where is
the best place to test the second action explained below?
I have a controller (NetworkingController) with a method
(create_network_segment) that makes use of two models (NetworkSegment
and NetworkIpaddress). This particular method does two actions:
1.
2008 Aug 07
0
memory leak in sub("[range]", ...) when #ifndef _LIBC (PR#12488)
...locks.
> ==28643== suppressed: 0 bytes in 0 blocks.
> ==28643== Reachable blocks (those to which a pointer was found) are not shown.
> ==28643== To see them, rerun with: --show-reachable=yes
>
> The flagged memory block is the range_ends component of mbcset.
> I think that range_starts was also being leaked, but valgrind was
> combining the two.
>
> It looks like the cpp macro _LIBC is not defined when I compile
> R in this Linux box. regex.c defines range_ends and range_starts
> as different types, depending on the value of _LIBC, and it allocates
> space for...
2011 Apr 04
1
[PATCH] com32: Do not use centralized bitops header in vsscanf
From: Matt Fleming <matt.fleming at linux.intel.com>
Partially revert "com32: add a centralized bitops header"
This reverts part of commit db74cf6c4182f40ecf7fad1f04799d09d82f896d.
The usage of the centralized bitops in com32/lib/vsscanf.c is not
correct because the bitmap that we're accessing is too large for the
'bt', 'bts' and 'btc' instructions to
2019 Jul 23
4
[PATCH] mm/hmm: replace hmm_update with mmu_notifier_range
The hmm_mirror_ops callback function sync_cpu_device_pagetables() passes
a struct hmm_update which is a simplified version of struct
mmu_notifier_range. This is unnecessary so replace hmm_update with
mmu_notifier_range directly.
Signed-off-by: Ralph Campbell <rcampbell at nvidia.com>
Cc: "Jérôme Glisse" <jglisse at redhat.com>
Cc: Jason Gunthorpe <jgg at mellanox.com>
2019 Jul 24
5
[PATCH] mm/hmm: replace hmm_update with mmu_notifier_range
On Wed, Jul 24, 2019 at 09:05:53AM +0200, Christoph Hellwig wrote:
> Looks good:
>
> Reviewed-by: Christoph Hellwig <hch at lst.de>
>
> One comment on a related cleanup:
>
> > list_for_each_entry(mirror, &hmm->mirrors, list) {
> > int rc;
> >
> > - rc = mirror->ops->sync_cpu_device_pagetables(mirror, &update);
> > +
2023 Mar 06
0
[PATCH drm-next v2 05/16] drm: manager to keep track of GPUs VA mappings
On 2/28/23 17:24, Liam R. Howlett wrote:
> * Danilo Krummrich <dakr at redhat.com> [230227 21:17]:
>> On Tue, Feb 21, 2023 at 01:20:50PM -0500, Liam R. Howlett wrote:
>>> * Danilo Krummrich <dakr at redhat.com> [230217 08:45]:
>>>> Add infrastructure to keep track of GPU virtual address (VA) mappings
>>>> with a decicated VA space manager
2012 Jun 26
6
[PATCH] Add a page cache-backed balloon device driver.
This implementation of a virtio balloon driver uses the page cache to
"store" pages that have been released to the host. The communication
(outside of target counts) is one way--the guest notifies the host when
it adds a page to the page cache, allowing the host to madvise(2) with
MADV_DONTNEED. Reclaim in the guest is therefore automatic and implicit
(via the regular page reclaim).
2012 Jun 26
6
[PATCH] Add a page cache-backed balloon device driver.
This implementation of a virtio balloon driver uses the page cache to
"store" pages that have been released to the host. The communication
(outside of target counts) is one way--the guest notifies the host when
it adds a page to the page cache, allowing the host to madvise(2) with
MADV_DONTNEED. Reclaim in the guest is therefore automatic and implicit
(via the regular page reclaim).
2012 Jul 25
0
No subject
pagecache for pages above lower limit but that
is a separate question about driver design,
I would like to make sure I understand the high
level design first.
> >
> > Note that users could not care less about how a driver
> > is implemented internally.
> >
> > Is there some workload where you see VM working better with
> > this than regular balloon? Any
2012 Jul 25
0
No subject
pagecache for pages above lower limit but that
is a separate question about driver design,
I would like to make sure I understand the high
level design first.
> >
> > Note that users could not care less about how a driver
> > is implemented internally.
> >
> > Is there some workload where you see VM working better with
> > this than regular balloon? Any
2009 Oct 14
4
Refactor ovirt-node-image code base for inclusion in Fedora
Main reason for refactor is no ovirt-node-image binary image allowed in fedora.
Removed ks files, now in ovirt-node-recipe, which is subpackage of ovirt-node.
Removed tools, these are now in ovirt-node-recipe which is subpackage of
ovirt-node.
2009 Oct 14
8
Refactor ovirt-node code base for inclusion in Fedora
Main reason for refactor is no ovirt-node-image binary image allowed in fedora.
Moves tools and kickstart files form ovirt-node-image to subpackage ovirt-node-recipe.
Removes old sub packages form ovirt-node, stateless, logos, selinux.
Modifies init scripts to meet Fedora packaging guidelines: added status, reload, and lockfile, rhbz: 514221
Added License file.
2007 Mar 28
2
[PATCH 2/3] User-space grant table device - main driver
A character device for accessing (in user-space) pages that have been
granted by other domains.
Signed-off-by: Derek Murray <Derek.Murray@cl.cam.ac.uk>
_______________________________________________
Xen-devel mailing list
Xen-devel@lists.xensource.com
http://lists.xensource.com/xen-devel
2019 Nov 12
20
[PATCH hmm v3 00/14] Consolidate the mmu notifier interval_tree and locking
From: Jason Gunthorpe <jgg at mellanox.com>
8 of the mmu_notifier using drivers (i915_gem, radeon_mn, umem_odp, hfi1,
scif_dma, vhost, gntdev, hmm) drivers are using a common pattern where
they only use invalidate_range_start/end and immediately check the
invalidating range against some driver data structure to tell if the
driver is interested. Half of them use an interval_tree, the others
2019 Oct 28
32
[PATCH v2 00/15] Consolidate the mmu notifier interval_tree and locking
From: Jason Gunthorpe <jgg at mellanox.com>
8 of the mmu_notifier using drivers (i915_gem, radeon_mn, umem_odp, hfi1,
scif_dma, vhost, gntdev, hmm) drivers are using a common pattern where
they only use invalidate_range_start/end and immediately check the
invalidating range against some driver data structure to tell if the
driver is interested. Half of them use an interval_tree, the others