sgpemv2/src/backend/pyloader/Policy.py

from Abstract import *
                
## @brief This is the abstract class a user-defined policy
# should inherit from
#
# This class also exposes the method sort, which can be
# used to easily sort the queue of ready process with a
# given compare function
class Policy:
    ## @var Avoid instantiation of an abstract class
    __metaclass__ = Metaclass
    
    configure = AbstractMethod('configure')
    sort_queue = AbstractMethod('sort_queue')
    is_preemptive = AbstractMethod('is_preemptive')
    get_time_slice = AbstractMethod('get_time_slice')
    
    ## @brief this function implements a quicksort in place
    # using the SchedulableQueue methods
    #
    # The compare parameter should be a user defined function
    # name returning either True or False, defined like:
    # @code
    # def compare(SchedulableA,SchedulableB):
    #     return SchedulableA.someProperty() < SchedulableB.someProperty()
    # @endcode
    #
    # @param queue The SchedulableQueue to be sorted in place
    # @param cmpf The binary function to use to compare elements
    # @returns None
    def sort(queue, cmpf):
        __recursive_qsort_(queue, 0, queue.size()-1, cmpf)

    ## @brief Recursive (private) call to perform quicksort on a
    # queue
    #
    # @param queue The queue to sort
    # @param a The initial element position of the slice
    # @param b The final element position of the slice
    # @param cmpf The user-defined compare function to employ
    # @returns None
    def __recursive_qsort_(queue, a, b, cmpf):
        if(b>a):
            pivot = __partition_(queue, a, b, cmpf)
            __recursive_qsort_(queue, a, pivot-1, cmpf)
            __recursive_qsort_(queue, pivot+1, b, cmpf)
        
    ## @brief Recursive (private) call to partition a slice of the queue
    #
    # This private function (the name mangling should work)
    # naively sorts a partition of queue in place using just
    # its methods.
    #
    # Feel the love.
    #
    # @param queue The SchedulableQueue to sort
    # @param a The partition starting element position in the queue
    # @param b The partition ending element position in the queue
    # @param cmpf The binary function to use for comparing two elements
    # @return The new pivot index
    def __partition_(queue, a, b, cmpf):
        # takes pivot element:
        right = queue.get_item_at(b)
        i = a
        for j in range(a,b-1):
            if cmpf(queue.get_item_at(j), right):
                # the C++ code should do nothing if i == j:
                queue.swap(i,j)
                i = i+1
        # puts pivot in place
        queue.swap(i,b)
        return i