bsp_memreg.h

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
*/

#ifndef BSP_MEMREG_H
#define BSP_MEMREG_H
#include <stdlib.h>
#include "bsp_abort.h"
#include "bsp_exptable.h"
#include <config.h>

void
memoryRegister_initialize (ExpandableTable * restrict , const unsigned int,
                           const unsigned int, const unsigned int);

void memoryRegister_destruct (ExpandableTable * restrict );

void memoryRegister_expand (ExpandableTable * restrict, const unsigned int);

void memoryRegister_push (ExpandableTable * restrict, const unsigned int, const char * const restrict );

void memoryRegister_pop (ExpandableTable * restrict, const unsigned int, const char * const restrict );

void memoryRegister_pack (ExpandableTable * restrict);

static inline MemRegElement
memoryRegister_find (const ExpandableTable * restrict table, 
                     const unsigned int sp, const unsigned int dp,
                     const char * const pointer)
{
  int count;
  const MemRegElement * restrict array;
  const unsigned int srccol = table->rows * sp;
  const unsigned int dstcol = table->rows * dp;
  array  = (MemRegElement *) table->data + srccol;
  for ( count = table->used_slot_count[sp]-1; count >= 0; count--)
    {
      if (array[count] == pointer && !table->info.reg.removed[count])
        return *(array + count - srccol + dstcol);
    }
  bsp_intern_abort (ERR_POP_REG_WITHOUT_PUSH, __func__, __FILE__, __LINE__);
  return NULL;
}

static inline MemRegElement
memoryRegister_memoized_find (const ExpandableTable * restrict table,  
                              const unsigned int dp, const char * const pointer)
{
  const unsigned int dstcol = table->rows * dp;
  const MemRegElement * restrict data_iter = table->info.reg.memoized_data_iter;
 
  /* WARNING: If element is not in register, then loop may not terminate */
  while(*data_iter != pointer)
    data_iter--;

  return *(data_iter - table->info.reg.memoized_srccol + dstcol);
}

#endif

---