I couldn't find any users, so removing it.. Signed-off-by: Daniel Walker <dwalker@mvista.com> --- drivers/isdn/i4l/isdn_tty.c | 1 - include/linux/isdn.h | 1 - 2 files changed, 2 deletions(-) Index: linux-2.6.23/drivers/isdn/i4l/isdn_tty.c =================================================================== --- linux-2.6.23.orig/drivers/isdn/i4l/isdn_tty.c +++ linux-2.6.23/drivers/isdn/i4l/isdn_tty.c @@ -1915,7 +1915,6 @@ isdn_tty_modem_init(void) info->owner = THI...

On Tue, 04 Dec 2007 00:00:01 -0800 Acked-by: Alan Cox <alan@redhat.com> --

Acked-by: Ingo Molnar <mingo@elte.hu> Ingo --

[Empty message]

Hmm ... guess we need a schedule_timeout_killable. This should probably look like: if (*timeout > NFS4_POLL_RETRY_MAX) *timeout = NFS4_POLL_RETRY_MAX; + schedule_timeout_killable(*timeout); + if (fatal_signalled()) res = -ERESTARTSYS; wait_event_killable? Anyway, none of these explain the non-killability of the *stat* calls. -- Intel are signing my paycheques ... these opinions are still mine "Bill, look, we understand that you're interested in selling us this operating...

please post patches against sched-devel.git - it has part of your previous patches included already, plus some cleanups i did to them, so this series of yours wont apply. sched-devel.git is at: git://git.kernel.org/pub/scm/linux/kernel/git/mingo/linux-2.6-sched-devel.git Ingo --

The current code use a linear algorithm which causes scaling issues on larger SMP machines. This patch replaces that algorithm with a 2-dimensional bitmap to reduce latencies in the wake-up path. Signed-off-by: Gregory Haskins <ghaskins@novell.com> CC: Christoph Lameter <clameter@sgi.com> --- kernel/Kconfig.preempt | 11 +++ kernel/Makefile | 1 kernel/sched.c | 8 ++ kernel/sched_cpupri.c | 174 ++++++++++++++++++++++++++++++++++++++++++++++++ kernel/sc...

We add the notion of a root-domain which will be used later to rescope global variables to per-domain variables. Each exclusive cpuset essentially defines an island domain by fully partitioning the member cpus from any other cpuset. However, we currently still maintain some policy/state as global variables which transcend all cpusets. Consider, for instance, rt-overload state. Whenever a new exclusive cpuset is created, we also create a new root-domain object and move each cpu member to the root...

From: Steven Rostedt <srostedt@redhat.com> This patch changes the searching for a run queue by a waking RT task to try to pick another runqueue if the currently running task is an RT task. The reason is that RT tasks behave different than normal tasks. Preempting a normal task to run a RT task to keep its cache hot is fine, because the preempted non-RT task may wait on that same runqueue to run again unless the migration thread comes along and pulls it off. RT tasks behave differently. ...

From: Steven Rostedt <srostedt@redhat.com> This patch removes several cpumask operations by keeping track of the first of the CPUS that is of the lowest priority. When the search for the lowest priority runqueue is completed, all the bits up to the first CPU with the lowest priority runqueue is cleared. Signed-off-by: Steven Rostedt <srostedt@redhat.com> Signed-off-by: Gregory Haskins <ghaskins@novell.com> --- kernel/sched_rt.c | 49 ++++++++++++++++++++++++++++++++++++---...

We have logic to detect whether the system has migratable tasks, but we are not using it when deciding whether to push tasks away. So we add support for considering this new information. Signed-off-by: Gregory Haskins <ghaskins@novell.com> Signed-off-by: Steven Rostedt <srostedt@redhat.com> --- kernel/sched.c | 2 ++ kernel/sched_rt.c | 10 ++++++++-- 2 files changed, 10 insertions(+), 2 deletions(-) diff --git a/kernel/sched.c b/kernel/sched.c index 651270e..ed031bd 10...

In the original patch series that Steven Rostedt and I worked on together, we both took different approaches to low-priority wakeup path. I utilized "pre-routing" (push the task away to a less important RQ before activating) approach, while Steve utilized a "post-routing" approach. The advantage of my approach is that you avoid the overhead of a wasted activate/deactivate cycle and peripherally related burdens. The advantage of Steve's method is that it neatly solves an issue preventing a "pull" op...

It doesn't hurt if we allow the current CPU to be included in the search. We will just simply skip it later if the current CPU turns out to be the lowest. We will use this later in the series Signed-off-by: Gregory Haskins <ghaskins@novell.com> Signed-off-by: Steven Rostedt <srostedt@redhat.com> --- kernel/sched_rt.c | 5 +---- 1 files changed, 1 insertions(+), 4 deletions(-) diff --git a/kernel/sched_rt.c b/kernel/sched_rt.c index 7e26c2c..7e444f4 100644 --- a/kernel/sch...

"this_rq" is normally used to denote the RQ on the current cpu (i.e. "cpu_rq(this_cpu)"). So clean up the usage of this_rq to be more consistent with the rest of the code. Signed-off-by: Gregory Haskins <ghaskins@novell.com> Signed-off-by: Steven Rostedt <srostedt@redhat.com> --- kernel/sched_rt.c | 22 +++++++++++----------- 1 files changed, 11 insertions(+), 11 deletions(-) diff --git a/kernel/sched_rt.c b/kernel/sched_rt.c index e5bce6a..d8f8738 100644 --- a/kernel/sched_r...

From: Steven Rostedt <srostedt@redhat.com> This patch adds an algorithm to push extra RT tasks off a run queue to other CPU runqueues. When more than one RT task is added to a run queue, this algorithm takes an assertive approach to push the RT tasks that are not running onto other run queues that have lower priority. The way this works is that the highest RT task that is not running is looked at and we examine the runqueues on the CPUS for that tasks affinity mask. We find the runqueue wi...

From: Steven Rostedt <srostedt@redhat.com> Since we now take an active approach to load balancing, we don't need to balance RT tasks via CFS. In fact, this code was found to pull RT tasks away from CPUS that the active movement performed, resulting in large latencies. Signed-off-by: Steven Rostedt <srostedt@redhat.com> Signed-off-by: Gregory Haskins <ghaskins@novell.com> --- kernel/sched_rt.c | 95 ++--------------------------------------------------- 1 files changed, 4 i...

From: Steven Rostedt <srostedt@redhat.com> This patch adds an RT overload accounting system. When a runqueue has more than one RT task queued, it is marked as overloaded. That is that it is a candidate to have RT tasks pulled from it. Signed-off-by: Steven Rostedt <srostedt@redhat.com> Signed-off-by: Gregory Haskins <ghaskins@novell.com> --- kernel/sched_rt.c | 36 ++++++++++++++++++++++++++++++++++++ 1 files changed, 36 insertions(+), 0 deletions(-) diff --git a/kernel...

From: Steven Rostedt <srostedt@redhat.com> This patch adds accounting to keep track of the number of RT tasks running on a runqueue. This information will be used in later patches. Signed-off-by: Steven Rostedt <srostedt@redhat.com> Signed-off-by: Gregory Haskins <ghaskins@novell.com> --- kernel/sched.c | 1 + kernel/sched_rt.c | 17 +++++++++++++++++ 2 files changed, 18 insertions(+), 0 deletions(-) diff --git a/kernel/sched.c b/kernel/sched.c index b062856..475...

Hello everyone, I've just tagged and released Btrfs v0.9. Special thanks to Yan Zheng and Josef Bacik for their work. This release includes a number of disk format changes from v0.8 and also a small change from recent btrfs-unstable HG trees. So, if you have existing Btrfs filesystems, you will need to backup, reformat and restore to try out v0.9. You can find download links and other details here: http://oss.oracle.com/projects/btrfs/ Since v0.8: * Support for btree blocks larger th...

No. Unacceptable. This is a memory leak in case nobody retries it. It's basically not how you can do this thing. The *only* thing you can pass for a system call restart is the argument block register state. If that is not enough, then you cannot restart it. It's that simple. Andrew, please do *not* put this in any queues. It's fundamentally broken, and cannot be fixed as is. Linus --

Yes. That should work fine. The restart logic sometimes results in odd calling conventions, and quite frankly, we could just change how "restart_block" looks too. There is nothing that says that it has to be unsigned long arg0, arg1, arg2, arg3 and that particular layout was just picked on a whim. The only issue is: - we don't want the restart block to be *too* large, since it's part of the thread info. - but we need to have enough room for all the system calls that want to ...

no, we cannot remove them - asmlinkage is needed for the syscall entry (and other entry code) to work, the and the prevent_tail_call works around a compiler bug. (which might or might not be fixed in latest gcc - but we generally dont remove workarounds unless we are really sure it's fine.) so your patch looks good to me, i've queued it up. Ingo --

the removal of FASTCALL is fine: the default (and only) compiler model for x86 (32-bit) is regparm(3), so the regparm(3) macro is equivalent to the empty one in linux/linkage.h. btw., removal of FASTCALL from the tree is worthwile after this: it should probably be done via the -mm tree, because it's more of a generic kernel matter than an arch/x86 matter. Ingo --

I'm curious how UML is using FASTCALL/fastcall. Any pointers? Harvey --

Agreed, just noting that there was nobody defining it anymore, it's widespread enough that I'll submit them separately to appropriate maintainers and they can dribble in over time. Cheers, Harvey --