into penguin.transmeta.com:/home/penguin/torvalds/repositories/kernel/linux

The CPUFREQ initialisation now registers an interface with the device
model, and thus needs to initialise after postcore.  We use the
arch level for this.  This does, however, impose the restriction
that cpufreq may not be available for other architecture
initialisated code.

into flint.arm.linux.org.uk:/usr/src/linux-bk-2.5/linux-2.5-rmk

Remove ide_release_lock and ide_get_lock definitions from asm-arm/ide.h;
they're defined in include/linux/ide.h.

Add entries for sendfile64, futex, async io, etc system calls to
both unistd.h and the system call handler table.

into penguin.transmeta.com:/home/penguin/torvalds/repositories/kernel/linux

In addition to the diff from the 1.7 i8kutils release to the 1.13
release, I made the new globals static as per Rusty's namespace
pollution patch yesterday, and removed the reference to an include no
longer in 2.5.

	An old AMD 486DX4-SE(as reported by bios) here crashes on boot in
amd_init, doing rdmsr in k6 case. Elan fixes added case 4 there but
without break. This break allows it to boot.

Northwood P4's have one more bit in the CPUID processor info set: bit
31.  Intel calls the feature PBE (Pending Break Enable).

The attached patch adds the necessary entry.

into penguin.transmeta.com:/home/penguin/torvalds/repositories/kernel/linux

SGI Modid: 2.5.x-xfs:slinx:136827a

This doesn't mean dmapi is scheduled for inclusion, just adding
the reserved minor number to miscdevice.h for documentation purposes.

SGI Modid: 2.5.x-xfs:slinx:136795a

apparently the root file system are not being synced 
correctly during system shutdown

SGI Modid: 2.5.x-xfs:slinx:136269a

SGI Modid: 2.5.x-xfs:slinx:136126a

SGI Modid: 2.5.x-xfs:slinx:135869a

SGI Modid: 2.5.x-xfs:slinx:135920a

SGI Modid: 2.5.x-xfs:slinx:135919a3

SGI Modid: 2.5.x-xfs:slinx:135168a

These shouldn't be there, probably the result of corruption.
However, if we find one, handle it specially so that we don't
deadlock during unlinked list processing in recovery.  Without
xfs_iput_new, we'd be waiting on an inode lock we already hold.

SGI Modid: 2.5.x-xfs:slinx:136535a

SGI Modid: 2.5.x-xfs:slinx:135917a

SGI Modid: 2.5.x-xfs:slinx:135881a

SGI Modid: 2.5.x-xfs:slinx:135847a

SGI Modid: 2.5.x-xfs:slinx:135827a

into penguin.transmeta.com:/home/penguin/torvalds/repositories/kernel/linux

into tetrachloride.(none):/mnt/stuff/kernel/2.5/watchdog

into penguin.transmeta.com:/home/penguin/torvalds/repositories/kernel/linux

into penguin.transmeta.com:/home/penguin/torvalds/repositories/kernel/linux

patch from Bill Irwin

has_stopped_jobs() is completely unused. This patch removes
has_stopped_jobs() and renames __has_stopped_jobs() to has_stopped_jobs().

proc_fill_super() simply wants a count of processes, not threads.
This creates a per-cpu counter for it to use to determine that.

Patch from Bill Irwin.

__do_SAK() simply wants to kill off processes using a given tty.  This
converts it to use for_each_task_pid().

From Rohit Seth.

We're currently disabling read() and write() against hugetlbfs files via the
address_space ops.  But that's a bit awkward, and results in reads and writes
instantiating useless, non-uptodate 4k pagecache against the inodes.

The patch removes the read, write and sendfile file_operations entries.  So
the caller will get their -EINVAL without us ever having to go to the
pagecache layer.

This is the leak which Con found.  Long story...

- If a dirty page is fed into ext3_writepage() during truncate,
  block_write_full_page() will reutrn -EIO (it's outside i_size) and will
  leave the buffers dirty.  In the expectation that discard_buffer() will
  clean them.

- ext3_writepage() then adds the still-dirty buffers to the journal's
  "async data list".  These are buffers which are known to have had IO
  started.  All we need to do is to wait on them in commit.

- meanwhile, truncate will chop the pages off the address_space.  But
  truncate cannot invalidate the buffers (in journal_unmap_buffer()) because
  the buffers are attached to the committing transaction.  (hm.  This
  behaviour in journal_unmap_buffer() is bogus.  We just never need to write
  these buffers.)

- ext3 commit will "wait on writeout" of these writepage buffers (even
  though it was never started) and will then release them from the
  journalling system.

So we end up with pages which are attached to no mapping, which are clean and
which have dirty buffers.  These are unreclaimable.


Aside:

  ext3-ordered has two buffer lists: the "sync data list" and the "async
  data list".

  The sync list consists of probably-dirty buffers which were dirtied in
  commit_write().  Transaction commit must write all thee out and wait on
  them.

  The async list supposedly consists of clean buffers which were attached
  to the journal in ->writepage.  These have had IO started (by writepage) so
  commit merely needs to wait on them.

  This is all designed for the 2.4 VM really.  In 2.5, tons of writeback
  goes via writepage (instead of the buffer lru) and these buffers end up
  madly hpooing between the async and sync lists.

  Plus it's arguably incorrect to just wait on the writes in commit - if
  the buffers were set dirty again (say, by zap_pte_range()) then perhaps we
  should write them again before committing.


So what the patch does is to remove the async list.  All ordered-data buffers
are now attached to the single "sync data list".  So when we come to commit,
those buffers which are dirty will have IO started and all buffers are waited
upon.

This means that the dirty buffers against a clean page which came about from
block_write_full_page()'s -EIO will be written to disk in commit - this
cleans them, and the page is now reclaimable.  No leak.

It seems bogus to write these buffers in commit, and indeed it is.  But ext3
will not allow those blocks to be reused until the commit has ended so there
is no corruption risk.  And the amount of data involved is low - it only
comes about as a race between truncate and writepage().

max_sane_readahead() permits the user to readahead up to
half-the-inactive-list's worth of pages.  Which is totally wrong if most of
memory is free.

So make the limit be

	(nr_inactive + nr_free) / 2