10 May, 2011

1 commit


27 Aug, 2010

1 commit

  • We are using a very simple sort routine which sorts the .iommu_table
    array in the order of dependencies. Specifically each structure
    of iommu_table_entry has a field 'depend' which contains the function
    pointer to the IOMMU that MUST be run before us. We sort the array
    of structures so that the struct iommu_table_entry with no
    'depend' field are first, and then the subsequent ones are the
    ones for which the 'depend' function has been already invoked
    (in other words, precede us).

    Using the kernel's version 'sort', which is a mergeheap is
    feasible, but would require making the comparison operator
    scan recursivly the array to satisfy the "heapify" process: setting the
    levels properly. The end result would much more complex than it should
    be an it is just much simpler to utilize this simple sort routine.

    Signed-off-by: Konrad Rzeszutek Wilk
    LKML-Reference:
    CC: H. Peter Anvin
    CC: Fujita Tomonori
    Signed-off-by: H. Peter Anvin

    Konrad Rzeszutek Wilk