Pavel Emelianov writes:
There are many places in the kernel where the construction like
foo = list_entry(head-next, struct foo_struct, list);
are used.
The code might look more descriptive and neat if using the macro
list_first_entry(head, type, member) \
Amit Gud writes:
Hello,
This is an initial implementation of ChunkFS technique, briefly discussed
at: http://lwn.net/Articles/190222 and
http://cis.ksu.edu/~gud/docs/chunkfs-hotdep-val-arjan-gud-zach.pdf
I have a couple of questions about chunkfs repair process.
First, as I
David Lang writes:
On Tue, 24 Apr 2007, Nikita Danilov wrote:
Amit Gud writes:
Hello,
This is an initial implementation of ChunkFS technique, briefly discussed
at: http://lwn.net/Articles/190222 and
http://cis.ksu.edu/~gud/docs/chunkfs-hotdep-val-arjan-gud-zach.pdf
David Lang writes:
On Tue, 24 Apr 2007, Nikita Danilov wrote:
David Lang writes:
On Tue, 24 Apr 2007, Nikita Danilov wrote:
Amit Gud writes:
Hello,
This is an initial implementation of ChunkFS technique, briefly
discussed
at: http
Rik van Riel writes:
[ OK, I suck. I edited yesterday's email with the new info, but forgot
to change the attachment to today's patch. Here is today's patch. ]
Split the anonymous and file backed pages out onto their own pageout
queues. This we do not unnecessarily churn through
Rik van Riel writes:
Nikita Danilov wrote:
Rik van Riel writes:
[ OK, I suck. I edited yesterday's email with the new info, but forgot
to change the attachment to today's patch. Here is today's patch. ]
Split the anonymous and file backed pages out onto their own
Rik van Riel writes:
Rik van Riel wrote:
Nikita Danilov wrote:
Probably I am missing something, but I don't see how that can help. For
example, suppose (for simplicity) that we have swappiness of 100%, and
that fraction of referenced anon pages gets slightly less than of file
Rik van Riel writes:
Nikita Danilov wrote:
Generally speaking, multi-queue replacement mechanisms were tried in the
past, and they all suffer from the common drawback: once scanning rate
is different for different queues, so is the notion of hotness,
measured by scanner
Nick Piggin writes:
On Fri, Mar 23, 2007 at 11:04:18AM +0100, Ingo Molnar wrote:
* Nick Piggin [EMAIL PROTECTED] wrote:
Implement queued spinlocks for i386. [...]
isnt this patented by MS? (which might not worry you SuSE/Novell guys,
but it might be a worry for the rest
Ingo Molnar writes:
* Nikita Danilov [EMAIL PROTECTED] wrote:
Indeed, this technique is very well known. E.g.,
http://citeseer.ist.psu.edu/anderson01sharedmemory.html has a whole
section (3. Local-spin Algorithms) on them, citing papers from the
1990 onward
Ignatich writes:
You might want to look at this discussion:
http://mail.opensolaris.org/pipermail/zfs-discuss/2007-April/027041.html
Licenses involved cover file system _code_, rather than storage format
that is openly specified. Just stand up and implement driver for zfs
format from scratch
Tomoki Sekiyama writes:
Hi,
Hello,
[...]
While Dirty+Writeback pages get more than 40% of memory, process-B is
blocked in balance_dirty_pages() until writeback of some (`write_chunk',
typically = 1536) dirty pages on disk-b is started.
May be the simpler solution is to use
Matt Mackall writes:
Add /proc/pid/pagemap interface
This interface provides a mapping for each page in an address space to
its physical page frame number, allowing precise determination of what
pages are mapped and what pages are shared between processes.
[...]
+#ifdef
Matt Mackall writes:
[...]
Now I could adjust these to only export u64s in some preferred
endianness. But given I already need details like the page size to
make any sense of it, it seems unnecessary. Also, the PFNs are fairly
opaque unless you're attempting to correlate them with
Peter Zijlstra writes:
[...]
My idea is to extend kswapd, run cpus_per_node instances of kswapd per
node for each of GFP_KERNEL, GFP_NOFS, GFP_NOIO. (basically 3 kswapds
per cpu)
whenever we would hit direct reclaim, add ourselves to a special
waitqueue corresponding to the type of
Andrew Morton writes:
[...]
It's pretty much unfixable given the ext3 journalling design, and the
guarantees which data-ordered provides.
ZFS has intent log to handle this
(http://blogs.sun.com/realneel/entry/the_zfs_intent_log). Something like
that can --theoretically-- be added to
karthik [EMAIL PROTECTED] writes:
Hi,
If anybody is having any idea of what is MCR and what is its use,
just tell me. i think its some Monitor related software. But i want in more
detail of what is it and how is it working.
MCR stands for Monitor Console Routine. Press Ctrl-C to
Anton Altaparmakov writes:
[...]
mm/filemap.c::file_buffered_write():
- It calls fault_in_pages_readable() which is completely bogus if
@nr_segs 1. It needs to be replaced by a to be written
fault_in_pages_readable_iovec().
Which will be only marginally less bogus, because
Christoph Lameter writes:
On Fri, 11 Mar 2005, Dave Jones wrote:
Splitting this last one into inc_mm_counter() and dec_mm_counter()
means you can kill off the last argument, and get some of the
readability back. As it stands, I think this patch adds a bunch
of obfuscation for no
Andrew Morton [EMAIL PROTECTED] writes:
Jes Sorensen [EMAIL PROTECTED] wrote:
[...]
[EMAIL PROTECTED] linux-2.6.11-rc5-mm1]$ grep PG_arch fs/reiser4/*.c
fs/reiser4/page_cache.c: page_flag_name(page, PG_arch_1),
fs/reiser4/txnmgr.c:assert(vs-1448,
Hello,
following patch cures oopses in 2.4.7-pre9 when
proc_pid_make_inode() is called on task with task-mm == NULL.
Linus, please apply, if you haven't got a bunch of equivalent patches
already, which is doubtful.
Nikita.
---
Howard Chu [EMAIL PROTECTED] writes:
[...]
concurrency. It is the nature of such a system to encounter deadlocks
over the normal course of operations. When a deadlock is detected, some
thread must be chosen (by one of a variety of algorithms) to abort its
transaction, in order to allow other
Howard Chu writes:
Nikita Danilov wrote:
[...]
What prevents transaction monitor from using, say, condition
variables to yield cpu? That would have an additional advantage of
blocking thread precisely until specific event occurs, instead of
blocking for some vague
Howard Chu writes:
Nikita Danilov wrote:
That returns us to the core of the problem: sched_yield() is used to
implement a synchronization primitive and non-portable assumptions are
made about its behavior: SUS defines that after sched_yield() thread
ceases to run on the CPU until
Howard Chu writes:
Lee Revell wrote:
On Sat, 2005-08-20 at 11:38 -0700, Howard Chu wrote:
But I also found that I needed to add a new yield(), to work around
yet another unexpected issue on this system - we have a number of
threads waiting on a condition variable, and the thread
Mikulas Patocka writes:
On Fri, 29 Dec 2006, Trond Myklebust wrote:
On Thu, 2006-12-28 at 19:14 +0100, Mikulas Patocka wrote:
Why don't you rip off the support for colliding inode number from the
kernel at all (i.e. remove iget5_locked)?
It's reasonable to have either no
Mikulas Patocka writes:
[...]
BTW. How does ReiserFS find that a given inode number (or object ID in
ReiserFS terminology) is free before assigning it to new file/directory?
reiserfs v3 has an extent map of free object identifiers in
super-block. reiser4 used 64 bit object identifiers
Mikulas Patocka writes:
BTW. How does ReiserFS find that a given inode number (or object ID in
ReiserFS terminology) is free before assigning it to new file/directory?
reiserfs v3 has an extent map of free object identifiers in
super-block.
Inode free space can have at most
by kernel slab allocator prevents write throttling from ever
happening.
Signed-off-by: Nikita Danilov [EMAIL PROTECTED]
mm/page-writeback.c | 33 -
1 files changed, 24 insertions(+), 9 deletions(-)
Index: git-linux/mm/page-writeback.c
Alan Cox writes:
[...]
A few innovations that afaik first appeared the Linux kernel
- Making multiple hosts appear transparently as one IP address
- Futex fast hybrid locking
DEC Firefly workstation, before 1987.
Nikita.
-
To unsubscribe from this list: send the line unsubscribe
Neil Brown writes:
[...]
Thus the general sequence might be:
a/ issue all preceding writes.
b/ issue the commit write with BIO_RW_BARRIER
c/ wait for the commit to complete.
If it was successful - done.
If it failed other than with EOPNOTSUPP, abort
Nick Piggin writes:
Hi,
[...]
/**
+ * clear_bit_unlock - Clears a bit in memory with release
+ * @nr: Bit to clear
+ * @addr: Address to start counting from
+ *
+ * clear_bit() is atomic and may not be reordered. It does
s/clear_bit/clear_bit_unlock/ ?
+ * contain a
karthik <[EMAIL PROTECTED]> writes:
> Hi,
>
> If anybody is having any idea of what is MCR and what is its use,
> just tell me. i think its some Monitor related software. But i want in more
> detail of what is it and how is it working.
MCR stands for "Monitor Console Routine". Press
Anton Altaparmakov writes:
[...]
>
> mm/filemap.c::file_buffered_write():
>
> - It calls fault_in_pages_readable() which is completely bogus if
> @nr_segs > 1. It needs to be replaced by a to be written
> "fault_in_pages_readable_iovec()".
Which will be only marginally less bogus,
Christoph Lameter writes:
> On Fri, 11 Mar 2005, Dave Jones wrote:
>
> > Splitting this last one into inc_mm_counter() and dec_mm_counter()
> > means you can kill off the last argument, and get some of the
> > readability back. As it stands, I think this patch adds a bunch
> > of
Andrew Morton <[EMAIL PROTECTED]> writes:
> Jes Sorensen <[EMAIL PROTECTED]> wrote:
>>
[...]
>>
>> [EMAIL PROTECTED] linux-2.6.11-rc5-mm1]$ grep PG_arch fs/reiser4/*.c
>> fs/reiser4/page_cache.c: page_flag_name(page, PG_arch_1),
>> fs/reiser4/txnmgr.c:
Howard Chu <[EMAIL PROTECTED]> writes:
[...]
> concurrency. It is the nature of such a system to encounter deadlocks
> over the normal course of operations. When a deadlock is detected, some
> thread must be chosen (by one of a variety of algorithms) to abort its
> transaction, in order to allow
Howard Chu writes:
> Nikita Danilov wrote:
[...]
>
> > What prevents transaction monitor from using, say, condition
> > variables to "yield cpu"? That would have an additional advantage of
> > blocking thread precisely until specific event occurs,
Howard Chu writes:
> Nikita Danilov wrote:
> > That returns us to the core of the problem: sched_yield() is used to
> > implement a synchronization primitive and non-portable assumptions are
> > made about its behavior: SUS defines that after sched_yield() thread
> &g
Howard Chu writes:
> Lee Revell wrote:
> > On Sat, 2005-08-20 at 11:38 -0700, Howard Chu wrote:
> > > But I also found that I needed to add a new yield(), to work around
> > > yet another unexpected issue on this system - we have a number of
> > > threads waiting on a condition variable, and
Mikulas Patocka writes:
>
>
> On Fri, 29 Dec 2006, Trond Myklebust wrote:
>
> > On Thu, 2006-12-28 at 19:14 +0100, Mikulas Patocka wrote:
> >> Why don't you rip off the support for colliding inode number from the
> >> kernel at all (i.e. remove iget5_locked)?
> >>
> >> It's reasonable
Mikulas Patocka writes:
[...]
>
> BTW. How does ReiserFS find that a given inode number (or object ID in
> ReiserFS terminology) is free before assigning it to new file/directory?
reiserfs v3 has an extent map of free object identifiers in
super-block. reiser4 used 64 bit object
Mikulas Patocka writes:
> > > BTW. How does ReiserFS find that a given inode number (or object ID in
> > > ReiserFS terminology) is free before assigning it to new file/directory?
> >
> > reiserfs v3 has an extent map of free object identifiers in
> > super-block.
>
> Inode free space can
Hello,
following patch cures oopses in 2.4.7-pre9 when
proc_pid_make_inode() is called on task with task->mm == NULL.
Linus, please apply, if you haven't got a bunch of equivalent patches
already, which is doubtful.
Nikita.
---
Tomoki Sekiyama writes:
> Hi,
Hello,
>
[...]
>
> While Dirty+Writeback pages get more than 40% of memory, process-B is
> blocked in balance_dirty_pages() until writeback of some (`write_chunk',
> typically = 1536) dirty pages on disk-b is started.
May be the simpler solution is to use
Matt Mackall writes:
> Add /proc/pid/pagemap interface
>
> This interface provides a mapping for each page in an address space to
> its physical page frame number, allowing precise determination of what
> pages are mapped and what pages are shared between processes.
[...]
>
> +#ifdef
Matt Mackall writes:
[...]
>
> Now I could adjust these to only export u64s in some preferred
> endianness. But given I already need details like the page size to
> make any sense of it, it seems unnecessary. Also, the PFNs are fairly
> opaque unless you're attempting to correlate them
ons (among other things) when
memory consumed by kernel slab allocator prevents write throttling from ever
happening.
Signed-off-by: Nikita Danilov <[EMAIL PROTECTED]>
mm/page-writeback.c | 33 -
1 files changed, 24 insertions(+), 9 deletion
Rik van Riel writes:
> [ OK, I suck. I edited yesterday's email with the new info, but forgot
>to change the attachment to today's patch. Here is today's patch. ]
>
> Split the anonymous and file backed pages out onto their own pageout
> queues. This we do not unnecessarily churn
Rik van Riel writes:
> Nikita Danilov wrote:
> > Rik van Riel writes:
> > > [ OK, I suck. I edited yesterday's email with the new info, but forgot
> > >to change the attachment to today's patch. Here is today's patch. ]
> > >
> > >
Rik van Riel writes:
> Rik van Riel wrote:
> > Nikita Danilov wrote:
> >
> >> Probably I am missing something, but I don't see how that can help. For
> >> example, suppose (for simplicity) that we have swappiness of 100%, and
> >> that fraction o
Rik van Riel writes:
> Nikita Danilov wrote:
>
> > Generally speaking, multi-queue replacement mechanisms were tried in the
> > past, and they all suffer from the common drawback: once scanning rate
> > is different for different queues, so is the notion of
Nick Piggin writes:
> On Fri, Mar 23, 2007 at 11:04:18AM +0100, Ingo Molnar wrote:
> >
> > * Nick Piggin <[EMAIL PROTECTED]> wrote:
> >
> > > Implement queued spinlocks for i386. [...]
> >
> > isnt this patented by MS? (which might not worry you SuSE/Novell guys,
> > but it might be a
Ingo Molnar writes:
>
> * Nikita Danilov <[EMAIL PROTECTED]> wrote:
>
> > Indeed, this technique is very well known. E.g.,
> > http://citeseer.ist.psu.edu/anderson01sharedmemory.html has a whole
> > section (3. Local-spin Algorithms) on them, citing
Amit Gud writes:
Hello,
>
> This is an initial implementation of ChunkFS technique, briefly discussed
> at: http://lwn.net/Articles/190222 and
> http://cis.ksu.edu/~gud/docs/chunkfs-hotdep-val-arjan-gud-zach.pdf
I have a couple of questions about chunkfs repair process.
First, as I
David Lang writes:
> On Tue, 24 Apr 2007, Nikita Danilov wrote:
>
> > Amit Gud writes:
> >
> > Hello,
> >
> > >
> > > This is an initial implementation of ChunkFS technique, briefly discussed
> > > at: http://lwn.net/Articles/1902
David Lang writes:
> On Tue, 24 Apr 2007, Nikita Danilov wrote:
>
> > David Lang writes:
> > > On Tue, 24 Apr 2007, Nikita Danilov wrote:
> > >
> > > > Amit Gud writes:
> > > >
> > > > Hello,
> > > >
> &
Ignatich writes:
> You might want to look at this discussion:
> http://mail.opensolaris.org/pipermail/zfs-discuss/2007-April/027041.html
Licenses involved cover file system _code_, rather than storage format
that is openly specified. Just stand up and implement driver for zfs
format from
Pavel Emelianov writes:
> There are many places in the kernel where the construction like
>
>foo = list_entry(head->next, struct foo_struct, list);
>
> are used.
> The code might look more descriptive and neat if using the macro
>
>list_first_entry(head, type, member) \
>
Neil Brown writes:
>
[...]
> Thus the general sequence might be:
>
> a/ issue all "preceding writes".
> b/ issue the commit write with BIO_RW_BARRIER
> c/ wait for the commit to complete.
> If it was successful - done.
> If it failed other than with EOPNOTSUPP,
Nick Piggin writes:
> Hi,
[...]
>
> /**
> + * clear_bit_unlock - Clears a bit in memory with release
> + * @nr: Bit to clear
> + * @addr: Address to start counting from
> + *
> + * clear_bit() is atomic and may not be reordered. It does
s/clear_bit/clear_bit_unlock/ ?
> + *
Alan Cox writes:
[...]
>
> A few innovations that afaik first appeared the Linux kernel
> - Making multiple hosts appear transparently as one IP address
> - Futex fast hybrid locking
DEC Firefly workstation, before 1987.
Nikita.
-
To unsubscribe from this list: send the line "unsubscribe
Peter Zijlstra writes:
[...]
> My idea is to extend kswapd, run cpus_per_node instances of kswapd per
> node for each of GFP_KERNEL, GFP_NOFS, GFP_NOIO. (basically 3 kswapds
> per cpu)
>
> whenever we would hit direct reclaim, add ourselves to a special
> waitqueue corresponding to the
Andrew Morton writes:
[...]
>
> It's pretty much unfixable given the ext3 journalling design, and the
> guarantees which data-ordered provides.
ZFS has intent log to handle this
(http://blogs.sun.com/realneel/entry/the_zfs_intent_log). Something like
that can --theoretically-- be added to
64 matches
Mail list logo
