Function rectDivision

src/library/blas/generic/solution_seq_make.c:868–974

Rectangular division is done according to the picture: * * +------+-----+ * | | 2 | * | | | * | 1 +--+--+ * | |3 | 4| * | | | | * +------+--+--+ * * The longest side is divided first. */

 * The longest side is divided first.
 */
static void
rectDivision(
     BlasFunctionID funcID,
     const CLBlasKargs *args,
     ListHead *seq,
     cl_uint totalCUs)
 {
     SolutionStep *step, **sortedSteps;
     ListNode *i, *j;
     cl_int err;
     cl_device_id device;
     cl_uint nrCU, k, l;
     SubproblemDim size, offset, stepSize;
     unsigned int nrSteps = 0;

     /* 1. Sort steps according to the number of CU they have */
     /* NOTE: We expect small number of steps, so simple insertion sort
      *       would be enough.
      */

     sortedSteps = calloc(listLength(seq), sizeof(*sortedSteps));
     // assert(sortedSteps != NULL);

     k = 0;
     for (i = listNodeFirst(seq); i != seq; i = i->next, nrSteps++) {
         step = container_of(i, node, SolutionStep);
         err = getQueueDevice(step->cmdQueue, &device);

         sortedSteps[k] = step;
         nrCU = deviceComputeUnits(device, &err);

         for (j = i->next; j != seq; j = j->next) {
             step = container_of(i, node, SolutionStep);
             err = getQueueDevice(step->cmdQueue, &device);

             if (nrCU < deviceComputeUnits(device, &err)) {
                 sortedSteps[k] = step;
                 nrCU = deviceComputeUnits(device, &err);
             }
         }

         k++;
     }

     /* 2. Calculate rectangle sizes */

     kargsToProbDims(&offset, funcID, args, true);
     kargsToProbDims(&size, funcID, args, false);
     stepSize = size;

     for (l = 0; l < k; l++) {
         step = sortedSteps[l];
         err = getQueueDevice(step->cmdQueue, &device);
         nrCU = deviceComputeUnits(device, &err);

         if (totalCUs == 0) {
             step->cmdQueue = NULL;
             continue;