bsp_delivtable.c

Go to the documentation of this file.

/*
    BSPonMPI. This is an implementation of the BSPlib standard on top of MPI
    Copyright (C) 2006  Wijnand J. Suijlen
                                                                                
    This library is free software; you can redistribute it and/or
    modify it under the terms of the GNU Lesser General Public
    License as published by the Free Software Foundation; either
    version 2.1 of the License, or (at your option) any later version.
                                                                                
    This library is distributed in the hope that it will be useful,
    but WITHOUT ANY WARRANTY; without even the implied warranty of
    MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the GNU
    Lesser General Public License for more details.
                                                                                
    You should have received a copy of the GNU Lesser General Public
    License along with this library; if not, write to the Free Software
    Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA
                                                                                
    You may contact me via electronic mail:
      wjsuijle@users.sourceforge.net
    or snail mail:
      W.J. Suijlen
      Kraaiheidelaan 10
      2803 VP Gouda
      The Netherlands
*/

#include "bsp_exptable.h"
#include "bsp_memreg.h"
#include "bsp_mesgqueue.h"

void
deliveryTable_execute (ExpandableTable * restrict table, 
                       ExpandableTable * restrict memreg, 
                       MessageQueue * restrict mesgq, const int rank)
{
  int p, i;
  const DelivElement *restrict element;
  DelivElement * restrict message = NULL;
  const ALIGNED_TYPE * restrict pointer;
  const unsigned int tag_size = 
    no_slots(sizeof(DelivElement), sizeof(ALIGNED_TYPE));

  for (p = 0; p < table->nprocs; p++)
    {
      /* do put's */
      pointer = (ALIGNED_TYPE *) table->data + p * table->rows + 
                  table->info.deliv.start[p][put] ;
     
      for (i = 0; i < table->info.deliv.count[p][put]; i++)
        {
          element = (DelivElement *) pointer;
          memcpy(element->info.put.dst, pointer + tag_size, element->size);
          pointer+=element->next;
        }  

      /* do pushreg's */        
      pointer = (ALIGNED_TYPE *) table->data + p * table->rows + 
                   table->info.deliv.start[p][pushreg];
     
      for (i = 0; i < table->info.deliv.count[p][pushreg]; i++)
        {
          element = (DelivElement *) pointer;
          memoryRegister_push( memreg, p, element->info.push.address);
          pointer+=element->next;
        }  
      
      /* gather data about send's */
      pointer = (ALIGNED_TYPE *) table->data + p * table->rows + 
                   table->info.deliv.start[p][send];
      /* link the last element of the previous column to the first of this
       * column */
      if (message != NULL) 
           message->next = ((unsigned long) pointer - (unsigned long) message) / sizeof(ALIGNED_TYPE);

      for (i = 0; i < table->info.deliv.count[p][send]; i++)
        {
          message = (DelivElement *) pointer;
          mesgq->accum_size += message->size;
          mesgq->n_mesg ++;
          pointer+=message->next;
        }  

    }   
      /* get's aren't supposed to be in this queue */
    
    /* do popreg's (they only appear in processor column 'rank') */
    pointer = (ALIGNED_TYPE *) table->data + rank * table->rows +
                   table->info.deliv.start[rank][popreg];
    for (i = 0; i < table->info.deliv.count[rank][popreg]; i++)
      {
        element = (DelivElement *) pointer;
        memoryRegister_pop( memreg, rank, element->info.pop.address);
        pointer+=element->next;
      }
    
    /* do settag's (they only appear in processor column 'rank') */
   pointer = (ALIGNED_TYPE *) table->data + rank * table->rows +
        table->info.deliv.start[rank][settag];
   for (i = 0; i < table->info.deliv.count[rank][settag]; i++)
      {
        element = (DelivElement *) pointer;
        mesgq->send_tag_size = element->info.settag.tag_size;
        pointer+=element->next;
      }

    /* look for the first message in the message queue */
    for (p = 0; p < table->nprocs; p++)
      {
        if ( table->info.deliv.count[p][send] > 0 )
          {
            mesgq->head = (ALIGNED_TYPE *) table->data + p * table->rows 
                 + table->info.deliv.start[p][send];
            break;
          }
      }   
}

---