This patch implements a generic strcspn.

Sparc64 (and probably others) need all the kernel symbols within
32-bits, which includes the manufactured "__this_module" which refers
to the struct module *.

This changes the interface back to its old style: the arch-specific code
manipulates the init and core sizes, and we call module_alloc() ourselves.

Separates the module loading function prototypes (and elf.h) into
moduleloader.h.  AT_GID in elf.h clashes with xfs.h, but this also
makes module.h less cluttered.

<linux/fs.h> cleanups

memory space it was associated with.

Change from PCI name to generic device name.

The timer code is attempting to replicate the softirq characteristics at
the tasklet level, which is a little pointless.  This patch converts
timers to be a first-class softirq citizen.

fs.h is pulling so much crap in..  No need to include net.h in fs.h if
we move struct sock_alloc to net.h (which already includes fs.h through
skbuf.h and mm.h..).  Fixup the few files in net/ that relied on this,
and the readv/writev implementations that got uio.h through net.h.

into home.transmeta.com:/home/torvalds/v2.5/linux

The "procedure number" has been used for 2 purposes in the kernel
client RPC implementation:

  1) As a number to pass to the server in the RPC header.

  2) As an index into the "procedure array" of type 'struct
     rpc_procinfo', from which the RPC layer can find the XDR
     encode/decode functions, buffer size, and all the other static
     data that it needs to construct the on-wire RPC message.

This works fine for NFSv2, v3 and for the NLM locking code for which
there is a one-to-one mapping between NFS file operations, and RPC
procedures.
For NFSv4 on the other hand, the mapping is many-to-one, since there
is only one RPC procedure number: NFSPROC4_COMPOUND.

For efficiency purposes, we want to have a one-to-one mapping between
NFS file operations and the corresponding XDR encode/decode routines,
but currently this is not possible because of (2). The result is the
mess that is 'struct nfs4_op' and encode/decode_compound.

In the process eliminating (2), we might as well change to passing a
pointer to the appropriate procedure array entry instead of an
index. This change can be made transparent

The appended patch therefore does the following:

   - Substitute a pointer to the rpc_procinfo instead of the RPC
     procedure number in the struct rpc_message.
   - Make the RPC procedure number an entry in the struct
     rpc_procinfo.
   - Clean out the largely unused (except in some obscure lockd
     debugging code) p_name field. The latter was just a stringified
     version of the RPC procedure name, so for those lockd cases, we
     can use the RPC procedure number instead.

This adds error handling to the resource allocations in yenta.c: check
that request_resource returns success, reduce allocation size if
allocate_resource fails, free resources on module unload.

This splits poll_table into one structure used by f_op->poll and one
structure used by the implemenation of sys_poll/sys_select: poll_table
contains just the callback function pointer.  struct poll_wrapper
additionally contains err and table, i.e.  the members used by the poll
implementation.

Changes:
- split poll_table into 2 structures
- reorder the declarations in <linux/poll.h> accordingly
- uninline poll_initwait().

Also fix a printk usage.

dquot that got it implicitly before.

smbfs that got it implicitly before.

pci_hotplug_core that got it implicitly before.

ntfs that got it implicitly before.

jffs2 that got it implicitly before.

intermezzo that got it implicitly before.

hugetlbfs that got it implicitly before.

cifs that got it implicitly before.

quota that got it implicitly before.

This does:

- naming cleanup: ep_* -> eventpoll_* for non-static functions ( 2 )

- No more limit of 2 poll wait queue for each file*

Before epoll used to have, inside its item struct, space for two wait
queues. This was driven by the fact that during a f_op->poll() each file
won't register more than one read and one write wait queue. Now, I'm not
sure if this is 100% true or not, but with the current implementation a
linked list of wait queues is kept to remove each limit.

into uml.karaya.com:/home/jdike/linux/2.5/work-2.5

into uml.karaya.com:/home/jdike/linux/2.5/work-2.5

into uml.karaya.com:/home/jdike/linux/2.5/fixes-2.5

drivers/base relies on device.h pulling in sched.h pulling in the rest
of the world.  Add some explicit dependencies in preparation for removing
sched.h from device.h.

coda_linux simply doesn't need sched.h

elf.h simply doesn't need sched.h

ftape.h really wants interrupt.h, not sched.h

i2c.h simply doesn't need sched.h

if_pppox simply doesn't need sched.h

NFSD users that got it implicitly before.

mmuless ports don't need dup_mmap nor allocation of a pgd.

I tried to avoid ifdef-mess as far as possible, and to archive that
I created small wrappers for pgd allocation/freeing and move taking
of the mmap semaphore into dup_mmap from the only caller.  The end
result is just one additiona ifdef.

It's only need for the two monster-inlines set_fs_root and set_fs_pwd
that should better be out of line anyway.  Some additional cleanup like
named initializers as extra bonus.

Once again we only need a forward-declaration of struct vfsmount.