- 18 Jun, 2002 40 commits
-
-
Dave Kleikamp authored
Submitted by Manfred Spraul.
-
Dave Kleikamp authored
into kleikamp.austin.ibm.com:/home/shaggy/bk/jfs-2.5
-
Linus Torvalds authored
-
Linus Torvalds authored
-
Linus Torvalds authored
-
Linus Torvalds authored
Damn it, use the normal "-p1" format for patches!
-
Frank Davis authored
The following patch addresses a name change (i_zombie --> i_sem) within struct inode, which affects fs/intermezzo/vfs.c.
-
Frank Davis authored
The following patch fixes a compile error regarding a name change within task_struct, which affects ISLENTO().
-
Andries E. Brouwer authored
It looks like there are no in-tree users of path_init. Maybe it can be removed.
-
Martin Schwidefsky authored
another resend of the partition patch for ibm.c. Nobody sent a veto so far so please add it.
-
Martin Schwidefsky authored
seems someone else was faster fixing the hardsects problem in the xpram driver. We continued with my new version of the xpram driver. Arnd Bergmann found some bugs and added support for the driverfs.
-
Martin Schwidefsky authored
The dasd driver as a module needs to call elevator_init/elavator_exit to change the elevator algorithm to elevator_noop.
-
Martin Schwidefsky authored
1) Replace is_read_only with bdev_read_only. The last user of is_read_only is gone... 2) Remove alloc & free of the label array in dasd_genhd. This is needed for the label array extension but this is a patch of its own. 3) Maintain the old behaviour of /proc/dasd/devices. Its is possible again to use "add <devno>" instead of "add device <devno>" or "add range=<devno>".
-
Martin Schwidefsky authored
1) Add __s390__ to the list of architectures that use unsigned int as type for rautofs_wqt_t. __s390__ is defined for both 31-bit and 64-bit linux for s/390. Both architectures are fine with unsigned int since sizeof(unsigned int) == sizeof(unsigned long) for 31 bit s/390. 2) Remove early initialization call ccwcache_init(). It doesn't exists anymore. 3) Remove special case for irq_stat. We moved the irq_stat structure out of the lowcore. 4) Replace acquire_console_sem with down_trylock & return to avoid an endless trap loop if console_unblank is called from interrupt context and the console semaphore is taken.
-
Andries E. Brouwer authored
-
Martin Schwidefsky authored
some recent changes in the s390 architectures files: 1) Makefile fixes. 2) Add missing include statements. 3) Convert all parametes in the 31 bit emulation wrapper of sys_futex. 4) Remove semicolons after 'fi' in Config.in 5) Fix scheduler defines in system.h 6) Simplifications in qdio.c
-
http://linux-isdn.bkbits.net/linux-2.5.makeLinus Torvalds authored
into home.transmeta.com:/home/torvalds/v2.5/linux
-
Andi Kleen authored
Pure luck that this ever worked at all. The optimized assembly for XOR in RAID-5 declared did clobber registers, but did declare them as read-only. I'm pretty sure that at least the 4 disk and possibly the 5 disk cases did corrupt callee saved registers. The others probably got away because they were always used in own functions (and only clobbering caller saved registers)and only called via pointers, preventing inlining. Some of the replacements are a bit complicated because the functions exceed gcc's 10 asm argument limit when each input/output register needs two arguments. Works around that by saving/restoring some of the registers manually. I wasn't able to test it in real-life because I don't have a RAID setup and the RAID code didn't compile since several 2.5 releases. I wrote some test programs that did test the XOR and they showed no regression. Also aligns to XMM save area to 16 bytes to save a few cycles.
-
Jan Kara authored
This renames 'xqm.h' to a bit better (more consistent with rest of sources) name.
-
Zwane Mwaikambo authored
Patch to reorder the APIC configuration so that dependencies are determined beforehand for MCE. Keith Owens pointed this out a whiles back actually.
-
Adrian Bunk authored
It seems func.h needs to inlude linux/kdev_t.h:
-
Jens Axboe authored
For some odd reason, the blkdev.h changes did not get patched into your tree from the patch I sent?! Anyways, here's that change:
-
Stephen Rothwell authored
This patch fixes the following problems in the file lease: when there are multiple shared leases on a file, all the lease holders get notified when someone opens the file for writing (used to be only the first). when a nonblocking open breaks a lease, it will time out as it should (used to never time out). This should make the leases code more usable (hopefully).
-
Stephen Rothwell authored
This patch makes copy_siginfo_to_user excplicitly copy the correct union member. Previously we were getting the correct result but really by accident.
-
Stephen Rothwell authored
I needed these to make 2.5.22 build for me.
-
Stephen Rothwell authored
arch/ppc64/kernel/sys_ppc32.c has a getname32 function. The only difference between it and getname() is that it calls do_getname32() instead of do_getname() (see fs/namei.c). The difference between do_getname and do_getname32 is that the former checks to make sure that the pointer it is passed is less that TASK_SIZE and restricts the length copied to the lesser of PATH_MAX and (TASK_SIZE - pointer). do_getname32 uses PAGE_SIZE instead of PATH_MAX. Anton Blanchard says it is OK to remove getname32. arch/ia64/ia32/sys_ia32.c defined a getname32(), but nothing used it. This patch removes both.
-
Linus Torvalds authored
into home.transmeta.com:/home/torvalds/v2.5/linux
-
Ingo Molnar authored
without making sure that the target CPU is allowed.
-
Ingo Molnar authored
-
Ingo Molnar authored
the current implementation does the following to 'give up' the CPU: - it decreases its priority by 1 until it reaches the lowest level - it queues the task to the end of the priority queue this scheme works fine in most cases, but if sched_yield()-active tasks are mixed with CPU-using processes then it's quite likely that the CPU-using process is in the expired array. In that case the yield()-ing process only requeues itself in the active array - a true context-switch to the expired process will only occur once the timeslice of the yield()-ing process has expired: in ~150 msecs. This leads to the yield()-ing and CPU-using process to use up rougly the same amount of CPU-time, which is arguably deficient. i've fixed this problem by extending sched_yield() the following way: + * There are three levels of how a yielding task will give up + * the current CPU: + * + * #1 - it decreases its priority by one. This priority loss is + * temporary, it's recovered once the current timeslice + * expires. + * + * #2 - once it has reached the lowest priority level, + * it will give up timeslices one by one. (We do not + * want to give them up all at once, it's gradual, + * to protect the casual yield()er.) + * + * #3 - once all timeslices are gone we put the process into + * the expired array. + * + * (special rule: RT tasks do not lose any priority, they just + * roundrobin on their current priority level.) + */
-
Linus Torvalds authored
into home.transmeta.com:/home/torvalds/v2.5/linux
-
Ingo Molnar authored
-
Ingo Molnar authored
-
Paul Menage authored
This patch (against 2.5.22) removes the BKL from around the call to i_op->permission() in fs/namei.c, and pushes the BKL into those filesystems that have permission() methods that require it.
-
Linus Torvalds authored
into home.transmeta.com:/home/torvalds/v2.5/linux
-
Kai Mäkisara authored
This contains the following changes to the SCSI tape driver: - one buffer is used for each tape (no buffer pool) - buffers allocated when needed and freed when device closed - common code from read and write moved to a function - default maximum number of scatter/gather segments increased to 64 - tape status set to "no tape" after succesful unload
-
Matthew Wilcox authored
Nobody's using it any more, kill:
-
Matthew Wilcox authored
This is actually part of the work I've been doing to remove BHs, but it stands by itself.
-
Andi Kleen authored
This patch streamlines poll and select by adding fast paths for a small number of descriptors passed. The majority of polls/selects seem to be of this nature. The main saving comes from not allocating two pages for wait queue and table, but from using stack allocation (upto 256bytes) when only a few descriptors are needed. This makes it as fast again as 2.0 and even a bit faster because the wait queue page allocation is avoided too (except when the drivers overflow it) select also skips a lot faster over big holes and avoids the separate pass of determining the max. number of descriptors in the bitmap. A typical linux system saves a considerable amount of unswappable memory with this patch, because it usually has 10+ daemons hanging around in poll or select with each two pages allocated for data and wait queue. Some other cleanups.
-
Andi Kleen authored
x86-64 needs an own special declaration of jiffies_64. prepare for this by moving the jiffies_64 declaration from kernel/timer.c down into each architecture.
-