22 Mar, 2006

7 commits


21 Mar, 2006

3 commits

  • * master.kernel.org:/pub/scm/linux/kernel/git/davem/sparc-2.6: (230 commits)
    [SPARC64]: Update defconfig.
    [SPARC64]: Fix 2 bugs in huge page support.
    [SPARC64]: CONFIG_BLK_DEV_RAM fix
    [SPARC64]: Optimized TSB table initialization.
    [SPARC64]: Allow CONFIG_MEMORY_HOTPLUG to build.
    [SPARC64]: Use SLAB caches for TSB tables.
    [SPARC64]: Don't kill the page allocator when growing a TSB.
    [SPARC64]: Randomize mm->mmap_base when PF_RANDOMIZE is set.
    [SPARC64]: Increase top of 32-bit process stack.
    [SPARC64]: Top-down address space allocation for 32-bit tasks.
    [SPARC64] bbc_i2c: Fix cpu check and add missing module license.
    [SPARC64]: Fix and re-enable dynamic TSB sizing.
    [SUNSU]: Fix missing spinlock initialization.
    [TG3]: Do not try to access NIC_SRAM_DATA_SIG on Sun parts.
    [SPARC64]: First cut at VIS simulator for Niagara.
    [SPARC64]: Fix system type in /proc/cpuinfo and remove bogus OBP check.
    [SPARC64]: Add SMT scheduling support for Niagara.
    [SPARC64]: Fix 32-bit truncation which broke sparsemem.
    [SPARC64]: Move over to sparsemem.
    [SPARC64]: Fix new context version SMP handling.
    ...

    Linus Torvalds
     
  • * 'upstream-linus' of master.kernel.org:/pub/scm/linux/kernel/git/jgarzik/netdev-2.6: (150 commits)
    [PATCH] ipw2100: Update version ipw2100 stamp to 1.2.2
    [PATCH] ipw2100: move mutex.h include from ipw2100.c to ipw2100.h
    [PATCH] ipw2100: semaphore to mutexes conversion
    [PATCH] ipw2100: Fix radiotap code gcc warning
    [PATCH] ipw2100: add radiotap headers to packtes captured in monitor mode
    [PATCH] ipw2x00: expend Copyright to 2006
    [PATCH] drivers/net/wireless/ipw2200.c: fix an array overun
    [PATCH] ieee80211: Don't update network statistics from off-channel packets.
    [PATCH] ipw2200: Update ipw2200 version stamp to 1.1.1
    [PATCH] ipw2200: switch to the new ipw2200-fw-3.0 image format
    [PATCH] ipw2200: wireless extension sensitivity threshold support
    [PATCH] ipw2200: Enables the "slow diversity" algorithm
    [PATCH] ipw2200: Set a meaningful silence threshold value
    [PATCH] ipw2200: export `debug' module param only if CONFIG_IPW2200_DEBUG
    [PATCH] ipw2200: Change debug level for firmware error logging
    [PATCH] ipw2200: Filter unsupported channels out in ad-hoc mode
    [PATCH] ipw2200: Fix ipw_sw_reset() implementation inconsistent with comment
    [PATCH] ipw2200: Fix rf_kill is activated after mode change with 'disable=1'
    [PATCH] ipw2200: remove the WPA card associates to non-WPA AP checking
    [PATCH] ipw2200: Add signal level to iwlist scan output
    ...

    Linus Torvalds
     
  • * 'block-fixes' of git://git.kernel.org/pub/scm/linux/kernel/git/viro/block:
    [PATCH] fix rmmod problems with elevator attributes, clean them up
    [PATCH] elevator_t lifetime rules and sysfs fixes
    [PATCH] noise removal: cfq-iosched.c
    [PATCH] don't bother with refcounting for cfq_data
    [PATCH] fix sysfs interaction and lifetime rules handling for queues
    [PATCH] regularize blk_cleanup_queue() use
    [PATCH] fix cfq_get_queue()/ioprio_set(2) races
    [PATCH] deal with rmmod/put_io_context() races
    [PATCH] stop elv_unregister() from rogering other iosched's data, fix locking
    [PATCH] stop cfq from pinning queue down
    [PATCH] make cfq_exit_queue() prune the cfq_io_context for that queue
    [PATCH] fix the exclusion for ioprio_set()
    [PATCH] keep sync and async cfq_queue separate
    [PATCH] switch to use of ->key to get cfq_data by cfq_io_context
    [PATCH] stop leaking cfq_data in cfq_set_request()
    [PATCH] fix cfq hash lookups
    [PATCH] fix locking in queue_requests_store()
    [PATCH] fix double-free in blk_init_queue_node()
    [PATCH] don't do exit_io_context() until we know we won't be doing any IO

    Linus Torvalds
     

20 Mar, 2006

30 commits

  • Jeff Garzik
     
  • 1) huge_pte_offset() did not check the page table hierarchy
    elements as being empty correctly, resulting in an OOPS

    2) Need platform specific hugetlb_get_unmapped_area() to handle
    the top-down vs. bottom-up address space allocation strategies.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • We only need to write an invalid tag every 16 bytes,
    so taking advantage of this can save many instructions
    compared to the simple memset() call we make now.

    A prefetching implementation is implemented for sun4u
    and a block-init store version if implemented for Niagara.

    The next trick is to be able to perform an init and
    a copy_tsb() in parallel when growing a TSB table.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Put it one page below the top of the 32-bit address space.
    This gives us ~16MB more address space to work with.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Currently allocations are very constrained for 32-bit processes.
    It grows down-up from 0x70000000 to 0xf0000000 which gives about
    2GB of stack + dynamic mmap() space.

    So support the top-down method, and we need to override the
    generic helper function in order to deal with D-cache coloring.

    With these changes I was able to squeeze out a mmap() just over
    3.6GB in size in a 32-bit process.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • This is good for up to %50 performance improvement of some test cases.
    The problem has been the race conditions, and hopefully I've plugged
    them all up here.

    1) There was a serious race in switch_mm() wrt. lazy TLB
    switching to and from kernel threads.

    We could erroneously skip a tsb_context_switch() and thus
    use a stale TSB across a TSB grow event.

    There is a big comment now in that function describing
    exactly how it can happen.

    2) All code paths that do something with the TSB need to be
    guarded with the mm->context.lock spinlock. This makes
    page table flushing paths properly synchronize with both
    TSB growing and TLB context changes.

    3) TSB growing events are moved to the end of successful fault
    processing. Previously it was in update_mmu_cache() but
    that is deadlock prone. At the end of do_sparc64_fault()
    we hold no spinlocks that could deadlock the TSB grow
    sequence. We also have dropped the address space semaphore.

    While we're here, add prefetching to the copy_tsb() routine
    and put it in assembler into the tsb.S file. This piece of
    code is quite time critical.

    There are some small negative side effects to this code which
    can be improved upon. In particular we grab the mm->context.lock
    even for the tsb insert done by update_mmu_cache() now and that's
    a bit excessive. We can get rid of that locking, and the same
    lock taking in flush_tsb_user(), by disabling PSTATE_IE around
    the whole operation including the capturing of the tsb pointer
    and tsb_nentries value. That would work because anyone growing
    the TSB won't free up the old TSB until all cpus respond to the
    TSB change cross call.

    I'm not quite so confident in that optimization to put it in
    right now, but eventually we might be able to and the description
    is here for reference.

    This code seems very solid now. It passes several parallel GCC
    bootstrap builds, and our favorite "nut cruncher" stress test which is
    a full "make -j8192" build of a "make allmodconfig" kernel. That puts
    about 256 processes on each cpu's run queue, makes lots of process cpu
    migrations occur, causes lots of page table and TLB flushing activity,
    incurs many context version number changes, and it swaps the machine
    real far out to disk even though there is 16GB of ram on this test
    system. :-)

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Report 'sun4v' when appropriate in /proc/cpuinfo

    Remove all the verifications of the OBP version string. Just
    make sure it's there, and report it raw in the bootup logs and
    via /proc/cpuinfo.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • The mapping is a simple "(cpuid >> 2) == core" for now.
    Later we'll add more sophisticated code that will walk
    the sun4v machine description and figure this out from
    there.

    We should also add core mappings for jaguar and panther
    processors.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • This has been pending for a long time, and the fact
    that we waste a ton of ram on some configurations
    kind of pushed things over the edge.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Don't piggy back the SMP receive signal code to do the
    context version change handling.

    Instead allocate another fixed PIL number for this
    asynchronous cross-call. We can't use smp_call_function()
    because this thing is invoked with interrupts disabled
    and a few spinlocks held.

    Also, fix smp_call_function_mask() to count "cpus" correctly.
    There is no guarentee that the local cpu is in the mask
    yet that is exactly what this code was assuming.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • 1) Always spin_lock_init() in init_context(). The caller essentially
    clears it out, or copies the mm info from the parent. In both
    cases we need to explicitly initialize the spinlock.

    2) Always do explicit IRQ disabling while taking mm->context.lock
    and ctx_alloc_lock.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • The UltraSPARC T1 manual recommends this because the chip
    could instruction prefetch into the VA hole, and this would
    also make decoding certain kinds of memory access traps
    more difficult (because the chip sign extends certain pieces
    of trap state).

    Signed-off-by: David S. Miller

    David S. Miller
     
  • These are all implemented inline earlier in the file.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • There were several bugs in the SUN4V cpu mondo dispatch code.

    In fact, if we ever got a EWOULDBLOCK or other error from
    the hypervisor call, we'd potentially send a cpu mondo multiple
    times to the same cpu and even worse we could loop until the
    timeout resending the same mondo over and over to such cpus.

    So let's bulletproof this thing as follows:

    1) Implement cpu_mondo_send() and cpu_state() hypervisor calls
    in arch/sparc64/kernel/entry.S, add prototypes to asm/hypervisor.h

    2) Don't build and update the cpulist using inline functions, this
    was causing the cpu mask to not get updated in the caller.

    3) Disable interrupts during the entire mondo send, otherwise our
    cpu list and/or mondo block could get overwritten if we take
    an interrupt and do a cpu mondo send on the current cpu.

    4) Check for all possible error return types from the cpu_mondo_send()
    hypervisor call. In particular:

    HV_EOK) Our work is done, all cpus have received the mondo.
    HV_CPUERROR) One or more of the cpus in the cpu list we passed
    to the hypervisor are in error state. Use cpu_state()
    calls over the entries in the cpu list to see which
    ones. Record them in "error_mask" and report this
    after we are done sending the mondo to cpus which are
    not in error state.
    HV_EWOULDBLOCK) We need to keep trying.

    Any other error we consider fatal, we report the event and exit
    immediately.

    5) We only timeout if forward progress is not made. Forward progress
    is defined as having at least one cpu get the mondo successfully
    in a given cpu_mondo_send() call. Otherwise we bump a counter
    and delay a little. If the counter hits a limit, we signal an
    error and report the event.

    Also, smp_call_function_mask() error handling reports the number
    of cpus incorrectly.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • We no longer have the problems that require using the smaller
    sizes.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Signed-off-by: David S. Miller

    David S. Miller
     
  • The context allocation scheme we use depends upon there being a 11
    mapping from cpu to physical TLB for correctness. Chips like Niagara
    break this assumption.

    So what we do is notify all cpus with a cross call when the context
    version number changes, and if necessary this makes them allocate
    a valid context for the address space they are running at the time.

    Stress tested with make -j1024, make -j2048, and make -j4096 kernel
    builds on a 32-strand, 8 core, T2000 with 16GB of ram.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Niagara helps us find a ancient bug in the sparc64 port :-)

    The ASI_* values are plain constant defines, thus signed 32-bit
    on sparc64. To put shift this into the regs->tstate value we were
    doing or'ing "(ASI_PNF << 24)" into there.

    ASI_PNF is 0x82 and shifted left by 24 makes that topmost bit the
    sign bit in a 32-bit value. This would get sign extended to 64-bits
    and thus corrupt the top-half of the reg->tstate value.

    This never caused problems in pre-Niagara cpus because the only thing
    up there were the condition code values. But Niagara has the global
    register level field, and this all 1's value is illegal there so
    Niagara gives an illegal instruction trap due to this bug.

    I'm pretty sure this bug is about as old as the sparc64 port itself.

    This also points out that we weren't setting ASI_PNF for 32-bit tasks.
    We should, so fix that while we're here.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • It can map all of the linear kernel mappings with zero TSB hash
    conflicts for systems with 16GB or less ram. In such cases, on
    SUN4V, once we load up this TSB the first time with all the
    mappings, we never take a linear kernel mapping TLB miss ever
    again, the hypervisor handles them all.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Signed-off-by: David S. Miller

    David S. Miller
     
  • Set, but never used.

    We used to use this for dynamic IRQ retargetting, but that
    code died a long time ago.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • For drivers/media/*, noticed by Fabbione.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Signed-off-by: Fabio M. Di Nitto
    Signed-off-by: David S. Miller

    Fabio M. Di Nitto
     
  • The SUN4V convention with non-shared TSBs is that the context
    bit of the TAG is clear. So we have to choose an "invalid"
    bit and initialize new TSBs appropriately. Otherwise a zero
    TAG looks "valid".

    Make sure, for the window fixup cases, that we use the right
    global registers and that we don't potentially trample on
    the live global registers in etrap/rtrap handling (%g2 and
    %g6) and that we put the missing virtual address properly
    in %g5.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • This gives more consistent bogomips and delay() semantics,
    especially on sun4v. It gives weird looking values though...

    Signed-off-by: David S. Miller

    David S. Miller
     
  • Signed-off-by: David S. Miller

    David S. Miller
     
  • Signed-off-by: David S. Miller

    David S. Miller
     
  • We need to use the real hardware processor ID when
    targetting interrupts, not the "define to 0" thing
    the uniprocessor build gives us.

    Also, fill in the Node-ID and Agent-ID fields properly
    on sun4u/Safari.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • The sibling cpu bringup is extremely fragile. We can only
    perform the most basic calls until we take over the trap
    table from the firmware/hypervisor on the new cpu.

    This means no accesses to %g4, %g5, %g6 since those can't be
    TLB translated without our trap handlers.

    In order to achieve this:

    1) Change sun4v_init_mondo_queues() so that it can operate in
    several modes.

    It can allocate the queues, or install them in the current
    processor, or both.

    The boot cpu does both in it's call early on.

    Later, the boot cpu allocates the sibling cpu queue, starts
    the sibling cpu, then the sibling cpu loads them in.

    2) init_cur_cpu_trap() is changed to take the current_thread_info()
    as an argument instead of reading %g6 directly on the current
    cpu.

    3) Create a trampoline stack for the sibling cpus. We do our basic
    kernel calls using this stack, which is locked into the kernel
    image, then go to our proper thread stack after taking over the
    trap table.

    4) While we are in this delicate startup state, we put 0xdeadbeef
    into %g4/%g5/%g6 in order to catch accidental accesses.

    5) On the final prom_set_trap_table*() call, we put &init_thread_union
    into %g6. This is a hack to make prom_world(0) work. All that
    wants to do is restore the %asi register using
    get_thread_current_ds().

    Longer term we should just do the OBP calls to set the trap table by
    hand just like we do for everything else. This would avoid that silly
    prom_world(0) issue, then we can remove the init_thread_union hack.

    Signed-off-by: David S. Miller

    David S. Miller
     
  • So we can read the %gl register for debugging.

    Signed-off-by: David S. Miller

    David S. Miller