15 Jul, 2006

3 commits


05 Jul, 2006

2 commits

  • * master.kernel.org:/pub/scm/linux/kernel/git/davej/cpufreq:
    Move workqueue exports to where the functions are defined.
    [CPUFREQ] Misc cleanups in ondemand.
    [CPUFREQ] Make ondemand sampling per CPU and remove the mutex usage in sampling path.
    [CPUFREQ] Add queue_delayed_work_on() interface for workqueues.
    [CPUFREQ] Remove slowdown from ondemand sampling path.

    Linus Torvalds
     
  • * git://git.infradead.org/hdrinstall-2.6:
    Remove export of include/linux/isdn/tpam.h
    Remove and from userspace export
    Restrict headers exported to userspace for SPARC and SPARC64
    Add empty Kbuild files for 'make headers_install' in remaining arches.
    Add Kbuild file for Alpha 'make headers_install'
    Add Kbuild file for SPARC 'make headers_install'
    Add Kbuild file for IA64 'make headers_install'
    Add Kbuild file for S390 'make headers_install'
    Add Kbuild file for i386 'make headers_install'
    Add Kbuild file for x86_64 'make headers_install'
    Add Kbuild file for PowerPC 'make headers_install'
    Add generic Kbuild files for 'make headers_install'
    Basic implementation of 'make headers_check'
    Basic implementation of 'make headers_install'

    Linus Torvalds
     

04 Jul, 2006

2 commits

  • Generic lock debugging:

    - generalized lock debugging framework. For example, a bug in one lock
    subsystem turns off debugging in all lock subsystems.

    - got rid of the caller address passing (__IP__/__IP_DECL__/etc.) from
    the mutex/rtmutex debugging code: it caused way too much prototype
    hackery, and lockdep will give the same information anyway.

    - ability to do silent tests

    - check lock freeing in vfree too.

    - more finegrained debugging options, to allow distributions to
    turn off more expensive debugging features.

    There's no separate 'held mutexes' list anymore - but there's a 'held locks'
    stack within lockdep, which unifies deadlock detection across all lock
    classes. (this is independent of the lockdep validation stuff - lockdep first
    checks whether we are holding a lock already)

    Here are the current debugging options:

    CONFIG_DEBUG_MUTEXES=y
    CONFIG_DEBUG_LOCK_ALLOC=y

    which do:

    config DEBUG_MUTEXES
    bool "Mutex debugging, basic checks"

    config DEBUG_LOCK_ALLOC
    bool "Detect incorrect freeing of live mutexes"

    Signed-off-by: Ingo Molnar
    Signed-off-by: Arjan van de Ven
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Ingo Molnar
     
  • Add the per_cpu_offset() generic method. (used by the lock validator)

    Signed-off-by: Ingo Molnar
    Signed-off-by: Arjan van de Ven
    Cc: Rusty Russell
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Ingo Molnar
     

02 Jul, 2006

2 commits


01 Jul, 2006

1 commit

  • Allow to tie upper bits of syscall bitmap in audit rules to kernel-defined
    sets of syscalls. Infrastructure, a couple of classes (with 32bit counterparts
    for biarch targets) and actual tie-in on i386, amd64 and ia64.

    Signed-off-by: Al Viro

    Al Viro
     

30 Jun, 2006

1 commit

  • Remove slowdown from ondemand sampling path. This reduces the code path length
    in dbs_check_cpu() by half. slowdown was not used by ondemand by default.
    If there are any user level tools that were using this tunable, they
    may report error now.

    Signed-off-by: Alexey Starikovskiy
    Signed-off-by: Venkatesh Pallipadi
    Signed-off-by: Dave Jones

    Venkatesh Pallipadi
     

29 Jun, 2006

1 commit

  • Temporarily add EXPORT_UNUSED_SYMBOL and EXPORT_UNUSED_SYMBOL_GPL. These
    will be used as a transition measure for symbols that aren't used in the
    kernel and are on the way out. When a module uses such a symbol, a warning
    is printk'd at modprobe time.

    The main reason for removing unused exports is size: eacho export takes
    roughly between 100 and 150 bytes of kernel space in the binary. This
    patch gives users the option to immediately get this size gain via a config
    option.

    Signed-off-by: Arjan van de Ven
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Arjan van de Ven
     

28 Jun, 2006

1 commit


26 Jun, 2006

2 commits

  • Add WARN_ON_ONCE(cond) to print once-per-bootup messages.

    [rostedt@goodmis.org: improve code generation]
    Signed-off-by: Ingo Molnar
    Signed-off-by: Arjan van de Ven
    Signed-off-by: Steven Rostedt
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Ingo Molnar
     
  • There are several instances of per_cpu(foo, raw_smp_processor_id()), which
    is semantically equivalent to __get_cpu_var(foo) but without the warning
    that smp_processor_id() can give if CONFIG_DEBUG_PREEMPT is enabled. For
    those architectures with optimized per-cpu implementations, namely ia64,
    powerpc, s390, sparc64 and x86_64, per_cpu() turns into more and slower
    code than __get_cpu_var(), so it would be preferable to use __get_cpu_var
    on those platforms.

    This defines a __raw_get_cpu_var(x) macro which turns into per_cpu(x,
    raw_smp_processor_id()) on architectures that use the generic per-cpu
    implementation, and turns into __get_cpu_var(x) on the architectures that
    have an optimized per-cpu implementation.

    Signed-off-by: Paul Mackerras
    Acked-by: David S. Miller
    Acked-by: Ingo Molnar
    Acked-by: Martin Schwidefsky
    Cc: Rusty Russell
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Paul Mackerras
     

25 Jun, 2006

1 commit

  • Considering that there isn't a lot of hw we can depend on during resume,
    this is about as good as it gets.

    This is x86-only for now, although the basic concept (and most of the
    code) will certainly work on almost any platform.

    Signed-off-by: Linus Torvalds

    Linus Torvalds
     

23 Jun, 2006

1 commit

  • We have architectures where the size of page_to_pfn and pfn_to_page are
    significant enough to overall image size that they wish to push them out of
    line. However, in the process we have grown a second copy of the
    implementation of each of these routines for each memory model. Share the
    implmentation exposing it either inline or out-of-line as required.

    Signed-off-by: Andy Whitcroft
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Andy Whitcroft
     

21 Jun, 2006

1 commit

  • * git://git.infradead.org/hdrcleanup-2.6: (63 commits)
    [S390] __FD_foo definitions.
    Switch to __s32 types in joystick.h instead of C99 types for consistency.
    Add to headers included for userspace in
    Move inclusion of out of user scope in asm-x86_64/mtrr.h
    Remove struct fddi_statistics from user view in
    Move user-visible parts of drivers/s390/crypto/z90crypt.h to include/asm-s390
    Revert include/media changes: Mauro says those ioctls are only used in-kernel(!)
    Include and use __uXX types in
    Use __uXX types in , include too
    Remove private struct dx_hash_info from public view in
    Include and use __uXX types in
    Use __uXX types in for struct divert_blk et al.
    Use __u32 for elf_addr_t in , not u32. It's user-visible.
    Remove PPP_FCS from user view in , remove __P mess entirely
    Use __uXX types in user-visible structures in
    Don't use 'u32' in user-visible struct ip_conntrack_old_tuple.
    Use __uXX types for S390 DASD volume label definitions which are user-visible
    S390 BIODASDREADCMB ioctl should use __u64 not u64 type.
    Remove unneeded inclusion of from
    Fix private integer types used in V4L2 ioctls.
    ...

    Manually resolve conflict in include/linux/mtd/physmap.h

    Linus Torvalds
     

18 Jun, 2006

1 commit


02 Jun, 2006

1 commit

  • If we move a mapping from one virtual address to another,
    and this changes the virtual color of the mapping to those
    pages, we can see corrupt data due to D-cache aliasing.

    Check for and deal with this by overriding the move_pte()
    macro. Set things up so that other platforms can cleanly
    override the move_pte() macro too.

    Signed-off-by: David S. Miller

    David S. Miller
     

27 Apr, 2006

1 commit


26 Apr, 2006

1 commit


01 Apr, 2006

2 commits

  • Turn some macros into inline functions and add proper type checking as
    well as being more readable. Also a minor comment adjustment.

    Signed-off-by: Nicolas Pitre
    Acked-by: Ingo Molnar
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Nicolas Pitre
     
  • local_t's were defined to be unsigned. This increases confusion because
    atomic_t's are signed. The patch goes through and changes all implementations
    to use signed longs throughout.

    Also, x86-64 was using 32-bit quantities for the value passed into local_add()
    and local_sub(). Fixed.

    All (actually, both) existing users have been audited.

    (Also s/__inline__/inline/ in x86_64/local.h)

    Cc: Andi Kleen
    Cc: Benjamin LaHaise
    Cc: Kyle McMartin
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Andrew Morton
     

29 Mar, 2006

2 commits

  • replaces for_each_cpu with for_each_possible_cpu().

    Signed-off-by: KAMEZAWA Hiroyuki
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    KAMEZAWA Hiroyuki
     
  • Now that Christoph Lameter's atomic_long_t support is merged in mainline,
    might as well convert asm-generic/local.h to use it, so the same code can
    be used for both sizes of 32 and 64-bit unsigned longs.

    akpm sayeth:

    Q:

    Is there any particular reason why these routines weren't simply
    implemented with local_save/restore_flags, if they are only meant to
    guarantee atomicity to the local cpu? I'm sure on most platforms this
    would be more efficient than using an atomic...

    A:

    The whole _point_ of local_t is to avoid local_irq_disable(). It's
    designed to exploit the fact that many CPUs can do incs and decs in a way
    which is atomic wrt local interrupts, but not atomic wrt SMP.

    But this patch makes sense, because asm-generic/local.h is just a fallback
    implementation for architectures which either cannot perform these
    local-irq-atomic operations, or its maintainers haven't yet got around to
    implementing them.

    We need more work done on local_t in the 2.6.17 timeframe - they're defined as
    unsigned long, but some architectures implement them as signed long.

    Signed-off-by: Kyle McMartin
    Cc: Benjamin LaHaise
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Kyle McMartin
     

28 Mar, 2006

4 commits

  • - fix: initialize the robust list(s) to NULL in copy_process.

    - doc update

    - cleanup: rename _inuser to _inatomic

    - __user cleanups and other small cleanups

    Signed-off-by: Ingo Molnar
    Cc: Thomas Gleixner
    Cc: Arjan van de Ven
    Cc: Ulrich Drepper
    Cc: Andi Kleen
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Ingo Molnar
     
  • This patchset provides a new (written from scratch) implementation of robust
    futexes, called "lightweight robust futexes". We believe this new
    implementation is faster and simpler than the vma-based robust futex solutions
    presented before, and we'd like this patchset to be adopted in the upstream
    kernel. This is version 1 of the patchset.

    Background
    ----------

    What are robust futexes? To answer that, we first need to understand what
    futexes are: normal futexes are special types of locks that in the
    noncontended case can be acquired/released from userspace without having to
    enter the kernel.

    A futex is in essence a user-space address, e.g. a 32-bit lock variable
    field. If userspace notices contention (the lock is already owned and someone
    else wants to grab it too) then the lock is marked with a value that says
    "there's a waiter pending", and the sys_futex(FUTEX_WAIT) syscall is used to
    wait for the other guy to release it. The kernel creates a 'futex queue'
    internally, so that it can later on match up the waiter with the waker -
    without them having to know about each other. When the owner thread releases
    the futex, it notices (via the variable value) that there were waiter(s)
    pending, and does the sys_futex(FUTEX_WAKE) syscall to wake them up. Once all
    waiters have taken and released the lock, the futex is again back to
    'uncontended' state, and there's no in-kernel state associated with it. The
    kernel completely forgets that there ever was a futex at that address. This
    method makes futexes very lightweight and scalable.

    "Robustness" is about dealing with crashes while holding a lock: if a process
    exits prematurely while holding a pthread_mutex_t lock that is also shared
    with some other process (e.g. yum segfaults while holding a pthread_mutex_t,
    or yum is kill -9-ed), then waiters for that lock need to be notified that the
    last owner of the lock exited in some irregular way.

    To solve such types of problems, "robust mutex" userspace APIs were created:
    pthread_mutex_lock() returns an error value if the owner exits prematurely -
    and the new owner can decide whether the data protected by the lock can be
    recovered safely.

    There is a big conceptual problem with futex based mutexes though: it is the
    kernel that destroys the owner task (e.g. due to a SEGFAULT), but the kernel
    cannot help with the cleanup: if there is no 'futex queue' (and in most cases
    there is none, futexes being fast lightweight locks) then the kernel has no
    information to clean up after the held lock! Userspace has no chance to clean
    up after the lock either - userspace is the one that crashes, so it has no
    opportunity to clean up. Catch-22.

    In practice, when e.g. yum is kill -9-ed (or segfaults), a system reboot is
    needed to release that futex based lock. This is one of the leading
    bugreports against yum.

    To solve this problem, 'Robust Futex' patches were created and presented on
    lkml: the one written by Todd Kneisel and David Singleton is the most advanced
    at the moment. These patches all tried to extend the futex abstraction by
    registering futex-based locks in the kernel - and thus give the kernel a
    chance to clean up.

    E.g. in David Singleton's robust-futex-6.patch, there are 3 new syscall
    variants to sys_futex(): FUTEX_REGISTER, FUTEX_DEREGISTER and FUTEX_RECOVER.
    The kernel attaches such robust futexes to vmas (via
    vma->vm_file->f_mapping->robust_head), and at do_exit() time, all vmas are
    searched to see whether they have a robust_head set.

    Lots of work went into the vma-based robust-futex patch, and recently it has
    improved significantly, but unfortunately it still has two fundamental
    problems left:

    - they have quite complex locking and race scenarios. The vma-based
    patches had been pending for years, but they are still not completely
    reliable.

    - they have to scan _every_ vma at sys_exit() time, per thread!

    The second disadvantage is a real killer: pthread_exit() takes around 1
    microsecond on Linux, but with thousands (or tens of thousands) of vmas every
    pthread_exit() takes a millisecond or more, also totally destroying the CPU's
    L1 and L2 caches!

    This is very much noticeable even for normal process sys_exit_group() calls:
    the kernel has to do the vma scanning unconditionally! (this is because the
    kernel has no knowledge about how many robust futexes there are to be cleaned
    up, because a robust futex might have been registered in another task, and the
    futex variable might have been simply mmap()-ed into this process's address
    space).

    This huge overhead forced the creation of CONFIG_FUTEX_ROBUST, but worse than
    that: the overhead makes robust futexes impractical for any type of generic
    Linux distribution.

    So it became clear to us, something had to be done. Last week, when Thomas
    Gleixner tried to fix up the vma-based robust futex patch in the -rt tree, he
    found a handful of new races and we were talking about it and were analyzing
    the situation. At that point a fundamentally different solution occured to
    me. This patchset (written in the past couple of days) implements that new
    solution. Be warned though - the patchset does things we normally dont do in
    Linux, so some might find the approach disturbing. Parental advice
    recommended ;-)

    New approach to robust futexes
    ------------------------------

    At the heart of this new approach there is a per-thread private list of robust
    locks that userspace is holding (maintained by glibc) - which userspace list
    is registered with the kernel via a new syscall [this registration happens at
    most once per thread lifetime]. At do_exit() time, the kernel checks this
    user-space list: are there any robust futex locks to be cleaned up?

    In the common case, at do_exit() time, there is no list registered, so the
    cost of robust futexes is just a simple current->robust_list != NULL
    comparison. If the thread has registered a list, then normally the list is
    empty. If the thread/process crashed or terminated in some incorrect way then
    the list might be non-empty: in this case the kernel carefully walks the list
    [not trusting it], and marks all locks that are owned by this thread with the
    FUTEX_OWNER_DEAD bit, and wakes up one waiter (if any).

    The list is guaranteed to be private and per-thread, so it's lockless. There
    is one race possible though: since adding to and removing from the list is
    done after the futex is acquired by glibc, there is a few instructions window
    for the thread (or process) to die there, leaving the futex hung. To protect
    against this possibility, userspace (glibc) also maintains a simple per-thread
    'list_op_pending' field, to allow the kernel to clean up if the thread dies
    after acquiring the lock, but just before it could have added itself to the
    list. Glibc sets this list_op_pending field before it tries to acquire the
    futex, and clears it after the list-add (or list-remove) has finished.

    That's all that is needed - all the rest of robust-futex cleanup is done in
    userspace [just like with the previous patches].

    Ulrich Drepper has implemented the necessary glibc support for this new
    mechanism, which fully enables robust mutexes. (Ulrich plans to commit these
    changes to glibc-HEAD later today.)

    Key differences of this userspace-list based approach, compared to the vma
    based method:

    - it's much, much faster: at thread exit time, there's no need to loop
    over every vma (!), which the VM-based method has to do. Only a very
    simple 'is the list empty' op is done.

    - no VM changes are needed - 'struct address_space' is left alone.

    - no registration of individual locks is needed: robust mutexes dont need
    any extra per-lock syscalls. Robust mutexes thus become a very lightweight
    primitive - so they dont force the application designer to do a hard choice
    between performance and robustness - robust mutexes are just as fast.

    - no per-lock kernel allocation happens.

    - no resource limits are needed.

    - no kernel-space recovery call (FUTEX_RECOVER) is needed.

    - the implementation and the locking is "obvious", and there are no
    interactions with the VM.

    Performance
    -----------

    I have benchmarked the time needed for the kernel to process a list of 1
    million (!) held locks, using the new method [on a 2GHz CPU]:

    - with FUTEX_WAIT set [contended mutex]: 130 msecs
    - without FUTEX_WAIT set [uncontended mutex]: 30 msecs

    I have also measured an approach where glibc does the lock notification [which
    it currently does for !pshared robust mutexes], and that took 256 msecs -
    clearly slower, due to the 1 million FUTEX_WAKE syscalls userspace had to do.

    (1 million held locks are unheard of - we expect at most a handful of locks to
    be held at a time. Nevertheless it's nice to know that this approach scales
    nicely.)

    Implementation details
    ----------------------

    The patch adds two new syscalls: one to register the userspace list, and one
    to query the registered list pointer:

    asmlinkage long
    sys_set_robust_list(struct robust_list_head __user *head,
    size_t len);

    asmlinkage long
    sys_get_robust_list(int pid, struct robust_list_head __user **head_ptr,
    size_t __user *len_ptr);

    List registration is very fast: the pointer is simply stored in
    current->robust_list. [Note that in the future, if robust futexes become
    widespread, we could extend sys_clone() to register a robust-list head for new
    threads, without the need of another syscall.]

    So there is virtually zero overhead for tasks not using robust futexes, and
    even for robust futex users, there is only one extra syscall per thread
    lifetime, and the cleanup operation, if it happens, is fast and
    straightforward. The kernel doesnt have any internal distinction between
    robust and normal futexes.

    If a futex is found to be held at exit time, the kernel sets the highest bit
    of the futex word:

    #define FUTEX_OWNER_DIED 0x40000000

    and wakes up the next futex waiter (if any). User-space does the rest of
    the cleanup.

    Otherwise, robust futexes are acquired by glibc by putting the TID into the
    futex field atomically. Waiters set the FUTEX_WAITERS bit:

    #define FUTEX_WAITERS 0x80000000

    and the remaining bits are for the TID.

    Testing, architecture support
    -----------------------------

    I've tested the new syscalls on x86 and x86_64, and have made sure the parsing
    of the userspace list is robust [ ;-) ] even if the list is deliberately
    corrupted.

    i386 and x86_64 syscalls are wired up at the moment, and Ulrich has tested the
    new glibc code (on x86_64 and i386), and it works for his robust-mutex
    testcases.

    All other architectures should build just fine too - but they wont have the
    new syscalls yet.

    Architectures need to implement the new futex_atomic_cmpxchg_inuser() inline
    function before writing up the syscalls (that function returns -ENOSYS right
    now).

    This patch:

    Add placeholder futex_atomic_cmpxchg_inuser() implementations to every
    architecture that supports futexes. It returns -ENOSYS.

    Signed-off-by: Ingo Molnar
    Signed-off-by: Thomas Gleixner
    Signed-off-by: Arjan van de Ven
    Acked-by: Ulrich Drepper
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Ingo Molnar
     
  • This patch removes zone_mem_map.

    pfn_to_page uses pgdat, page_to_pfn uses zone. page_to_pfn can use pgdat
    instead of zone, which is only one user of zone_mem_map. By modifing it,
    we can remove zone_mem_map.

    Signed-off-by: KAMEZAWA Hiroyuki
    Cc: Dave Hansen
    Cc: Christoph Lameter
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    KAMEZAWA Hiroyuki
     
  • There are 3 memory models, FLATMEM, DISCONTIGMEM, SPARSEMEM.
    Each arch has its own page_to_pfn(), pfn_to_page() for each models.
    But most of them can use the same arithmetic.

    This patch adds asm-generic/memory_model.h, which includes generic
    page_to_pfn(), pfn_to_page() definitions for each memory model.

    When CONFIG_OUT_OF_LINE_PFN_TO_PAGE=y, out-of-line functions are
    used instead of macro. This is enabled by some archs and reduces
    text size.

    Signed-off-by: KAMEZAWA Hiroyuki
    Cc: Hugh Dickins
    Cc: Andi Kleen
    Cc: Paul Mackerras
    Cc: Benjamin Herrenschmidt
    Cc: Richard Henderson
    Cc: Ivan Kokshaysky
    Cc: Russell King
    Cc: Ian Molton
    Cc: Mikael Starvik
    Cc: David Howells
    Cc: Yoshinori Sato
    Cc: Hirokazu Takata
    Cc: Ralf Baechle
    Cc: Kyle McMartin
    Cc: Heiko Carstens
    Cc: Martin Schwidefsky
    Cc: Paul Mundt
    Cc: Kazumoto Kojima
    Cc: Richard Curnow
    Cc: William Lee Irwin III
    Cc: "David S. Miller"
    Cc: Jeff Dike
    Cc: Paolo 'Blaisorblade' Giarrusso
    Cc: Miles Bader
    Cc: Chris Zankel
    Cc: "Luck, Tony"
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    KAMEZAWA Hiroyuki
     

27 Mar, 2006

10 commits

  • Currently include/asm-generic/bitops.h is not referenced from anywhere. But
    it will be the benefit of those who are trying to port Linux to another
    architecture.

    So update it by same manner

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalents of the functions below:

    int minix_test_and_set_bit(int nr, volatile unsigned long *addr);
    int minix_set_bit(int nr, volatile unsigned long *addr);
    int minix_test_and_clear_bit(int nr, volatile unsigned long *addr);
    int minix_test_bit(int nr, const volatile unsigned long *addr);
    unsigned long minix_find_first_zero_bit(const unsigned long *addr,
    unsigned long size);

    In include/asm-generic/bitops/minix.h
    and include/asm-generic/bitops/minix-le.h

    This code largely copied from: include/asm-sparc/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalents of the functions below:

    int ext2_set_bit_atomic(int nr, volatile unsigned long *addr);
    int ext2_clear_bit_atomic(int nr, volatile unsigned long *addr);

    In include/asm-generic/bitops/ext2-atomic.h

    This code largely copied from: include/asm-sparc/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalents of the functions below:

    int ext2_set_bit(int nr, volatile unsigned long *addr);
    int ext2_clear_bit(int nr, volatile unsigned long *addr);
    int ext2_test_bit(int nr, const volatile unsigned long *addr);
    unsigned long ext2_find_first_zero_bit(const unsigned long *addr,
    unsigned long size);
    unsinged long ext2_find_next_zero_bit(const unsigned long *addr,
    unsigned long size);

    In include/asm-generic/bitops/ext2-non-atomic.h

    This code largely copied from:

    include/asm-powerpc/bitops.h
    include/asm-parisc/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • Build fix for s390 declare __u32 and __u64.

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalents of the functions below:

    unsigned int hweight32(unsigned int w);
    unsigned int hweight16(unsigned int w);
    unsigned int hweight8(unsigned int w);
    unsigned long hweight64(__u64 w);

    In include/asm-generic/bitops/hweight.h

    This code largely copied from: include/linux/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalent of the function: int ffs(int
    x);

    In include/asm-generic/bitops/ffs.h

    This code largely copied from: include/linux/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalent of the function: int
    sched_find_first_bit(const unsigned long *b);

    In include/asm-generic/bitops/sched.h

    This code largely copied from: include/asm-powerpc/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalents of the functions below:

    unsigned logn find_next_bit(const unsigned long *addr, unsigned long size,
    unsigned long offset);
    unsigned long find_next_zero_bit(const unsigned long *addr, unsigned long size,
    unsigned long offset);
    unsigned long find_first_zero_bit(const unsigned long *addr,
    unsigned long size);
    unsigned long find_first_bit(const unsigned long *addr, unsigned long size);

    In include/asm-generic/bitops/find.h

    This code largely copied from: arch/powerpc/lib/bitops.c

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita
     
  • This patch introduces the C-language equivalent of the function: int
    fls64(__u64 x);

    In include/asm-generic/bitops/fls64.h

    This code largely copied from: include/linux/bitops.h

    Signed-off-by: Akinobu Mita
    Signed-off-by: Andrew Morton
    Signed-off-by: Linus Torvalds

    Akinobu Mita