- 20 Apr, 2003 30 commits
-
-
Andrew Morton authored
From: William Lee Irwin III <wli@holomorphy.com> shm_get_stat() didn't know about hugetlbpage-backed shm.
-
Andrew Morton authored
From: Dave Olien <dmo@osdl.org> The following patch adds a call to blk_queue_bounce_limit to the DAC960 driver. Otherwise, it uses bounce buffering more than it needs to.
-
Andrew Morton authored
From: Hugh Dickins <hugh@veritas.com> The current behaviour is that once swapoff has filled memory, other tasks get OOMkilled one by one until swapoff completes, or more likely hangs. It is better that swapoff be the first choice for OOMkill. The patch changes the oom-killer so that it will kill off any currently-running swapoff instance before killing any other task. (Bit kludgy, couldn't think of a better way)
-
Andrew Morton authored
From: Hugh Dickins <hugh@veritas.com> Sometimes you start a swapoff and, seeing how long it takes, wish you had not: allow signal to interrupt and stop swapoff.
-
Andrew Morton authored
From: Hugh Dickins <hugh@veritas.com> First of three small "stop swapoff" patches based on 2.5.67-mm3: stop swapoff 1/3 vm_enough_memory? Before embarking upon swapoff, check vm_enough_memory. Mainly for consistency in the overcommit_memory 2 (strict accounting) case: fail with -ENOMEM if it wouldn't let the amount removed be committed. Will always succeed in the overcommit_memory 1 case, as it should in root-shoot-foot mode. In the overcommit_memory 0 case, well, I don't care much either way, so opted for the simplest code: no special case. Which means it could now fail at the start; but that's unlikely (case 0 is over-generous) and only when it would have got stuck later on anyway.
-
Andrew Morton authored
Convert all pmd_alloc_one() implementations to use __GFP_REPEAT
-
Andrew Morton authored
Remove all the open-coded retry loops in various architectures, use __GFP_REPEAT. It could be that at some time in the future we change __GFP_REPEAT to give up after ten seconds or so, so all the checks for failed allocations are retained.
-
Andrew Morton authored
- alloc_buffer_head() should take the allocation mode as an arg, and not assume. - Use __GFP_NOFAIL in JBD's call to alloc_buffer_head(). - Remove all the retry code from jbd_kmalloc() - do it via page allocator controls.
-
Andrew Morton authored
This is a cleanup patch. There are quite a lot of places in the kernel which will infinitely retry a memory allocation. Generally, they get it wrong. Some do yield(), the semantics of which have changed over time. Some do schedule(), which can lock up if the caller is SCHED_FIFO/RR. Some do schedule_timeout(), etc. And often it is unnecessary, because the page allocator will do the retry internally anyway. But we cannot rely on that - this behaviour may change (-aa and -rmap kernels do not do this, for instance). So it is good to formalise and to centralise this operation. If an allocation specifies __GFP_REPEAT then the page allocator must infinitely retry the allocation. The semantics of __GFP_REPEAT are "try harder". The allocation _may_ fail (the 2.4 -aa and -rmap VM's do not retry infinitely by default). The semantics of __GFP_NOFAIL are "cannot fail". It is a no-op in this VM, but needs to be honoured (or fix up the callers) if the VM ischanged to not retry infinitely by default. The semantics of __GFP_NOREPEAT are "try once, don't loop". This isn't used at present (although perhaps it should be, in swapoff). It is mainly for completeness.
-
Andrew Morton authored
From: William Lee Irwin III <wli@holomorphy.com> Micro-optimize sys_shmdt(). There are methods of exploiting knowledge of the vma's being searched to restrict the search space. These are: (1) shm mappings always start their lives at file offset 0, so only vma's above shmaddr need be considered. find_vma() can be used to seek to the proper position in mm->mmap in O(lg(n)) time. (2) The search is for a vma which could be a fragment of a broken-up shm mapping, which would have been created starting at shmaddr with vm_pgoff 0 and then continued no further into userspace than shmaddr + size. So after having found an initial vma, find the size of the shm segment it maps to calculate an upper bound to the virtualspace that needs to be searched. (3) mremap() would have caused the original checks to miss vma's mapping the shm segment if shmaddr were the original address at which the shm segments were attached. This does no better and no worse than the original code in that situation. (4) If the chain of references in vma->vm_file->f_dentry->d_inode->i_size is not guaranteed by refcounting and/or the shm code then this is oopsable; AFAICT an inode is always allocated.
-
Andrew Morton authored
From: Badari Pulavarty <pbadari@us.ibm.com> Here is a small bug fix for AIO. get_user_pages() takes number of pages to map as argument. (not in bytes)
-
Andrew Morton authored
From: Jan Kara <jack@suse.cz> I'm resending a patch which implements quotactl(2) call for syncing all devices. Particulary it allows the caller not to specify the device for syncing and in that case quotas on all the devices are written. The patch is rather trivial (mostly moving the code).
-
Andrew Morton authored
From: Geert Uytterhoeven <geert@linux-m68k.org> Atyfb: Add missing parts of reversal of Mobility changes, allowing ATI Mach64 GX support to compile again.
-
Andrew Morton authored
From: William Lee Irwin III <wli@holomorphy.com> And this one fixes an overflow when there is more than 4GB of hugetlb.
-
Andrew Morton authored
From: William Lee Irwin III <wli@holomorphy.com> follow_hugetlb_page() drops out of the loop prematurely and fails to take the appropriate refcounts if its starting address was not hugepage-aligned. It looked a bit unclean too, so I rewrote it. This fixes a bug, and more importantly, makes the thing readable by something other than a compiler (e.g. programmers).
-
Andrew Morton authored
From: William Lee Irwin III <wli@holomorphy.com> Remove page_has_buffers() from various functions, document the dependencies on buffer_head.h from other files besides filemap.c, and s/this file/core VM/ in filemap.c
-
Andrew Morton authored
From: William Lee Irwin III <wli@holomorphy.com> Move __set_page_dirty_buffers() to fs/buffer.c, as per the FIXME.
-
Andrew Morton authored
From: "Martin J. Bligh" <mbligh@aracnet.com> I'd forgotten that I'd set this to only fire every 20s in the past, because it would rebalance too agressively. That seems to be fixed now, so we should turn it back on.
-
Andrew Morton authored
From: Chuck Ebbert <76306.1226@compuserve.com> 2.4 builds its global PCI device list in breadth-first order. 2.5 is doing the scan that way but defers the construction of the global list until later and then does it depth-first. This causes devices to found in different order by drivers. The below fixed that problem for me. Russell King has acked this change.
-
Andrew Morton authored
From: Chris Heath <chris@heathens.co.nz> Trivial fix to get the SAK key working in raw and medium raw modes. Patch is against kernel 2.5.67.
-
Andrew Morton authored
From: Jean Tourrilhes <jt@bougret.hpl.hp.com> The following command will do nothing at all on 2.5.X : setserial /dev/ttyS0 uart none
-
Andrew Morton authored
From: john stultz <johnstul@us.ibm.com> This patch fixes a race in the timer_interrupt code caused by detect_lost_tick(). Since we're doing lost-tick compensation outside timer->mark_offset, time can pass between time-source reads which can cause gettimeofday inconsistencies. Additionally detect_lost_tick() was broken for the PIT case, since the whole point of detect_lost_tick() is to interpolate between two time sources to find inconsistencies. Additionally this could cause xtime_lock seq_lock reader starvation which has been causing machine hangs for SMP boxes that use the PIT as a time source. This patch fixes the described race by removing detect_lost_tick() and instead implementing the lost tick detection code inside mark_offset(). Some of the divs and mods being added here might concern folks, but by not calling timer->get_offset() in detect_lost_tick() we eliminate much of the same math. I did some simple cycle counting and the new code comes out on average equivalent or faster.
-
Andrew Morton authored
From: john stultz <johnstul@us.ibm.com>, Alexander Atanasov <alex@ssi.bg> We want to make sure we update jiffies_p and count_p atomically. So I'm inserting the spin_unlock_irqrestore() after we update count_p, rather then just before.
-
Andrew Morton authored
From: george anzinger <george@mvista.com> In the current system (2.5.67) time_spec to jiffies, time_val to jiffies and the converse (jiffies to time_val and jiffies to time_spec) all use 1/HZ as the measure of a jiffie. Because of the inability of the PIT to actually generate an accurate 1/HZ interrupt, the wall clock is updated with a more accurate value (999848 nanoseconds per jiffie for HZ = 1000). This causes a 1/HZ interpretation of jiffies based timing to run faster than the wall clock, thus causing sleeps and timers to expire short of the requested time. Try, for example: time sleep 60 This patch changes the conversion routines to use the same value as the wall clock update code to do the conversions. The actual math is almost all done at compile time. The run time conversions require little if any more execution time. This patch must be applied after the patch I posted earlier today which fixed the CLOCK_MONOTONIC resolution issue.
-
Andrew Morton authored
The POSIX CLOCK_MONOTONIC currently has only 1/HZ resolution. Further, it is tied to jiffies (i.e. is a restatment of jiffies) rather than "xtime" or the gettimeofday() clock. This patch changes CLOCK_MONOTONIC to be a restatment of gettimeofday() plus an offset to remove any clock setting activity from CLOCK_MONOTONIC. An offset is kept that represents the difference between CLOCK_MONOTONIC and gettimeofday(). This offset is updated when ever the gettimeofday() clock is set to back the clock setting change out of CLOCK_MONOTONIC (which by the standard, can not be set). With this change CLOCK_REALTIME (a direct restatement of gettimeofday()), CLOCK_MONOTONIC and gettimeofday() will all tick at the same time and with the same rate. And all will be affected by NTP adjustments (save those which actually set the time).
-
Andrew Morton authored
From: Maneesh Soni <maneesh@in.ibm.com> This patch changes the way DCACHE_REFERENCED flag is used. It got messed up in dcache_rcu iterations. I hope this will be ok now. The flag was meant to be advisory flag which is used while prune_dcache() so as not to free dentries which have recently entered d_lru list. At first pass in prune_dcache the dentries marked DCACHE_REFERENCED are left with the flag reset. and they are freed in the next pass. So, now we mark the dentry as DCACHE_REFERENCED when it is first entering the d_lru list in dput() and resetthe flag in prune_dcache(). If the flag remains reset in the next call to prune_dcache(), the dentry is then freed. Also I don't think any file system have to use this flag as it is taken care by the dcache layer. The patch removes such code from a few of file systems. Moreover these filesystems were anyway doing worng thing as they were changing the flag out of dcache_lock. Changes: o dput() marks dentry DCACHE_REFERENCED when it is added to the dentry_unused list o no need to set the flag in dget, dget_locked, d_lookup as these guys anyway increments the ref count. o check the ref count in prune_dcache and use DCACHE_REFERENCED flag just for two stage aging. o remove code for setting DACACHE_REFERENCED from reiserfs, fat, xfs and exportfs.
-
Andrew Morton authored
From: Maneesh Soni <maneesh@in.ibm.com> This patch the corrects the dentry_stat.nr_unused calculation. In select_parent() and shrink_dcache_anon() we were not doing any adjustments to the nr_unused count after manipulating the dentry_unused list. Now the nr_unused count is decremented if the dentry is on dentry_unused list and is removed from there. Further in the same routines, we have to adjust the nr_unused count again if the dentry is moved to the end of d_lru list for pruning.
-
Andrew Morton authored
dev_kfree_skb() can end up calling local_bh_enable() which goes BUG if local interrupts are disabled. Apparently it can deadlock. So move the skb freeing outside the lock in the dmfe driver. It will decrease the lock hold time as well.
-
Andrew Morton authored
Fix this: fs/partitions/nec98.c:169: undefined reference to `parse_bsd'
-
Andrew Morton authored
- It was doing spin_lock_irqsave()/spin_unlock() - Can't free the skb inside local_irq_save(): kfree_skb ends up running local_bh_enable(), which enables interrupts.
-
- 19 Apr, 2003 6 commits
-
-
Linus Torvalds authored
-
Ben Collins authored
- Cleaned up hostinfo usage in all drivers and created a central API to handle them all. - Fixup some spinlock mis-usage. - Remove devfs_handle mis-usage. - Cleaned up some heavy handed spinlocking to use mutexes instead. - Add function to send PHY config packets and use to to settle IRM/cycle-master/root descrepancies.
-
bk://bk.arm.linux.org.uk/linux-2.5-serialLinus Torvalds authored
into home.transmeta.com:/home/torvalds/v2.5/linux
-
Andries E. Brouwer authored
-
Andries E. Brouwer authored
If copy_namespace() returns -EPERM, copy_process() will return a confusing -ENOMEM. Fix it thus.
-
Andries E. Brouwer authored
new_ns = kmalloc(sizeof(struct namespace *), GFP_KERNEL); thing wasn't a very good idea. The rest are whitespace cleanups.
-
- 18 Apr, 2003 4 commits
-
-
Andries E. Brouwer authored
(i) Replace in struct loop_info the dev_t field by __kernel_old_dev_t, where this type is defined in <asm/posix_types.h>, so that problems with a differently sized dev_t in userspace are avoided. (ii) Introduce a new loop_info64, with __u64 device, inode and offset fields.
-
Romain Liévin authored
This replaces checkboxes by radiobuttons whereever necessary (menu choices). It partially fixes the #540 bug report.
-
bk://kernel.bkbits.net/davem/sparc-2.5Linus Torvalds authored
into home.transmeta.com:/home/torvalds/v2.5/linux
-
Stephen Hemminger authored
Second try at the bridge driver module handling cleanup... 1) Eliminate keeping a seperate bridge_list and use a bit on the priv_flags structure. This is equivalent to how the VLAN code works. Makes code cleaner and correctly handles cases like creating a bridge with the same name as an existing ether device etc. 2) Don't do own module ref counting that is inhernently racy. Instead set owner field and cleanup debris on unload. 3) Do last state cleanup in destructor 4) Change of bridge state (dev_open/stop) should use write_lock 5) Make sure timer is not running when cleared. 6) Use "const char *" where possible
-