21 Apr, 2015

2 commits

  • When CONFIG_DEBUG_FORCE_WEAK_PER_CPU is set, the DEFINE_PER_CPU_SECTION
    macro will define an extern __pcpu_unique_##name variable that could
    conflict with the same definition in powerpc at this time. Avoid that
    conflict by renaming iommu_pool_hash in iommu-common.c

    Thanks to Guenter Roeck for catching this, and helping to test the fix.

    Signed-off-by: Sowmini Varadhan
    Tested-by: Guenter Roeck
    Reviewed-by: Guenter Roeck
    Signed-off-by: David S. Miller

    Sowmini Varadhan
     
  • Declare iommu_large_alloc as static. Remove extern definition for
    iommu_tbl_pool_init().

    Signed-off-by: Sowmini Varadhan
    Tested-by: Guenter Roeck
    Reviewed-by: Guenter Roeck
    Signed-off-by: David S. Miller

    Sowmini Varadhan
     

19 Apr, 2015

3 commits

  • Fixes warnings due to
    - no DMA_ERROR_CODE on PARISC,
    - sizeof (unsigned long) == 4 bytes on PARISC.

    Signed-off-by: Sowmini Varadhan
    Signed-off-by: David S. Miller

    Sowmini Varadhan
     
  • Investigation of multithreaded iperf experiments on an ethernet
    interface show the iommu->lock as the hottest lock identified by
    lockstat, with something of the order of 21M contentions out of
    27M acquisitions, and an average wait time of 26 us for the lock.
    This is not efficient. A more scalable design is to follow the ppc
    model, where the iommu_map_table has multiple pools, each stretching
    over a segment of the map, and with a separate lock for each pool.
    This model allows for better parallelization of the iommu map search.

    This patch adds the iommu range alloc/free function infrastructure.

    Signed-off-by: Sowmini Varadhan
    Acked-by: Benjamin Herrenschmidt
    Signed-off-by: David S. Miller

    Sowmini Varadhan
     
  • I applied the wrong version of this patch series, V4 instead
    of V10, due to a patchwork bundling snafu.

    Signed-off-by: David S. Miller

    David S. Miller
     

18 Apr, 2015

1 commit


17 Apr, 2015

1 commit

  • Investigation of multithreaded iperf experiments on an ethernet
    interface show the iommu->lock as the hottest lock identified by
    lockstat, with something of the order of 21M contentions out of
    27M acquisitions, and an average wait time of 26 us for the lock.
    This is not efficient. A more scalable design is to follow the ppc
    model, where the iommu_table has multiple pools, each stretching
    over a segment of the map, and with a separate lock for each pool.
    This model allows for better parallelization of the iommu map search.

    This patch adds the iommu range alloc/free function infrastructure.

    Signed-off-by: Sowmini Varadhan
    Signed-off-by: David S. Miller

    Sowmini Varadhan