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"

static inline void
exec_put(const VarSizeElement element, const char * restrict offset )
{
  int i;
  const int item_size = element.info.put.item_size;
  void * dst;
  
  for (i = 0; i < element.info.put.item_count; i++)
   {
      memcpy(&dst, offset, sizeof(void *)); // copy destination pointer
      offset += sizeof(void *);
      memcpy(dst, offset, item_size);
      offset += item_size;
   }
}

void
deliveryTable_execute (ExpandableTable * restrict table, ExpandableTable * restrict memreg,
                       ExpandableTable * restrict mesgq)
{
  int i, j, end;
  VarSizeElement *restrict elements;

  for (i = 0; i < table->nprocs; i++)
    {
      elements = (VarSizeElement *) table->data + i * table->rows;
      end = table->used_slot_count[i];
      j = 0;
      
      while( j < end)
        {
          switch (elements[j].type)
            {
            case popreg:
              memoryRegister_pop (memreg, i, elements[j].info.pop.address);
              break;

            case pushreg:
              memoryRegister_push (memreg, i, elements[j].info.push.address);
              break;

            case put:
              exec_put(elements[j], (char *) &elements[j + 1]);
              break;

            case send:
             /* there is no need to set elements[j].data because this value is
              * calculated in messageQueue */
              messageQueue_push (mesgq, (char *) &elements[j], 
                                  sizeof(VarSizeElement) + elements[j].size);
              break;

            case settag:
              messageQueue_setTagSize (mesgq, elements[j].info.settag.tag_size);
              break;
            
            case get:
              bsp_intern_abort(ERR_GET_DELIVERED, __func__, __FILE__,__LINE__);
            } //switch
           j+= 1 + (elements[j].size + sizeof(VarSizeElement) - 1) / sizeof(VarSizeElement);
        }//while
    }//for
}

---