pigemr2.c File Reference

#include "redist.h"
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <assert.h>
#include <ctype.h>

Go to the source code of this file.

Data Structures
struct	MDESC
struct	IDESC

Macros
#define	static2   static
#define	fortran_mr2d   pigemr2do
#define	fortran_mr2dnew   pigemr2d
#define	icopy_   icopy
#define	ilacpy_   ilacpy
#define	Clacpy   Cigelacpy
#define	BLOCK_CYCLIC_2D   1
#define	SHIFT(row, sprow, nbrow)
#define	max(A, B)
#define	min(A, B)
#define	DIVUP(a, b)
#define	ROUNDUP(a, b)
#define	scanD0   igescanD0
#define	dispmat   igedispmat
#define	setmemory   igesetmemory
#define	freememory   igefreememory
#define	scan_intervals   igescan_intervals
#define	SENDBUFF   0
#define	RECVBUFF   1
#define	SIZEBUFF   2
#define	NDEBUG

Functions
void	Cblacs_pcoord ()
Int	Cblacs_pnum ()
void	Csetpvmtids ()
void	Cblacs_get ()
void	Cblacs_pinfo ()
void	Cblacs_gridinfo ()
void	Cblacs_gridinit ()
void	Cblacs_exit ()
void	Cblacs_gridexit ()
void	Cblacs_setup ()
void	Cigebs2d ()
void	Cigebr2d ()
void	Cigesd2d ()
void	Cigerv2d ()
void	Cigsum2d ()
void	Cigamn2d ()
void	Cigamx2d ()
Int	localindice ()
void *	mr2d_malloc ()
Int	ppcm ()
Int	localsize ()
Int	memoryblocksize ()
Int	changeorigin ()
void	paramcheck ()
void	Cpigemr2do ()
void	Cpigemr2d ()
void	setmemory (Int **adpointer, Int blocksize)
void	freememory (Int *ptrtobefreed)
Int	scan_intervals (char type, Int ja, Int jb, Int n, MDESC *ma, MDESC *mb, Int q0, Int q1, Int col0, Int col1, IDESC *result)

Macro Definition Documentation

BLOCK_CYCLIC_2D

#define BLOCK_CYCLIC_2D   1

Definition at line 36 of file pigemr2.c.

Clacpy

#define Clacpy   Cigelacpy

Definition at line 23 of file pigemr2.c.

dispmat

#define dispmat   igedispmat

Definition at line 83 of file pigemr2.c.

DIVUP

#define DIVUP	(		a,
			b )

Value:

( ((a)-1) /(b)+1)

Definition at line 44 of file pigemr2.c.

fortran_mr2d

#define fortran_mr2d   pigemr2do

Definition at line 18 of file pigemr2.c.

fortran_mr2dnew

#define fortran_mr2dnew   pigemr2d

Definition at line 19 of file pigemr2.c.

freememory

#define freememory   igefreememory

Definition at line 85 of file pigemr2.c.

icopy_

#define icopy_   icopy

Definition at line 20 of file pigemr2.c.

ilacpy_

#define ilacpy_   ilacpy

Definition at line 21 of file pigemr2.c.

max

#define max	(		A,
			B )

Value:

((A)>(B)?(A):(B))

Definition at line 42 of file pigemr2.c.

min

#define min	(		A,
			B )

Value:

((A)>(B)?(B):(A))

Definition at line 43 of file pigemr2.c.

NDEBUG

#define NDEBUG

Definition at line 102 of file pigemr2.c.

RECVBUFF

#define RECVBUFF   1

Definition at line 96 of file pigemr2.c.

ROUNDUP

#define ROUNDUP	(		a,
			b )

Value:

(DIVUP(a,b)*(b))

Definition at line 45 of file pigemr2.c.

scan_intervals

#define scan_intervals   igescan_intervals

Definition at line 86 of file pigemr2.c.

scanD0

#define scanD0   igescanD0

Definition at line 82 of file pigemr2.c.

SENDBUFF

#define SENDBUFF   0

Definition at line 95 of file pigemr2.c.

setmemory

#define setmemory   igesetmemory

Definition at line 84 of file pigemr2.c.

SHIFT

#define SHIFT	(		row,
			sprow,
			nbrow )

Value:

((row)-(sprow)+ ((row) >= (sprow) ? 0 : (nbrow)))

Definition at line 41 of file pigemr2.c.

SIZEBUFF

#define SIZEBUFF   2

Definition at line 97 of file pigemr2.c.

static2

#define static2   static

Definition at line 8 of file pigemr2.c.

Function Documentation

Cblacs_exit()

void Cblacs_exit ( )

extern

Cblacs_get()

void Cblacs_get ( )

extern

Cblacs_gridexit()

void Cblacs_gridexit ( )

extern

Cblacs_gridinfo()

void Cblacs_gridinfo ( )

extern

Cblacs_gridinit()

void Cblacs_gridinit ( )

extern

Cblacs_pcoord()

void Cblacs_pcoord ( )

extern

Cblacs_pinfo()

void Cblacs_pinfo ( )

extern

Cblacs_pnum()

Int Cblacs_pnum ( )

extern

Cblacs_setup()

void Cblacs_setup ( )

extern

changeorigin()

Int changeorigin ( )

extern

Cigamn2d()

void Cigamn2d ( )

extern

Cigamx2d()

void Cigamx2d ( )

extern

Cigebr2d()

void Cigebr2d ( )

extern

Cigebs2d()

void Cigebs2d ( )

extern

Cigerv2d()

void Cigerv2d ( )

extern

Cigesd2d()

void Cigesd2d ( )

extern

Cigsum2d()

void Cigsum2d ( )

extern

Cpigemr2d()

void Cpigemr2d ( )

extern

Cpigemr2do()

void Cpigemr2do ( )

extern

Csetpvmtids()

void Csetpvmtids ( )

extern

freememory()

void freememory

(

Int *

ptrtobefreed

)

Definition at line 126 of file pigemr2.c.

{
  if (ptrtobefreed == NULL)
    return;
  free((char *) ptrtobefreed);
}

localindice()

Int localindice ( )

extern

localsize()

Int localsize ( )

extern

memoryblocksize()

Int memoryblocksize ( )

extern

mr2d_malloc()

void * mr2d_malloc ( )

extern

paramcheck()

void paramcheck ( )

extern

ppcm()

Int ppcm ( )

extern

scan_intervals()

Int scan_intervals	(	char	type,
		Int	ja,
		Int	jb,
		Int	n,
		MDESC *	ma,
		MDESC *	mb,
		Int	q0,
		Int	q1,
		Int	col0,
		Int	col1,
		IDESC *	result )

Definition at line 138 of file pigemr2.c.

{
  Int   offset, j0, j1, templatewidth0, templatewidth1, nbcol0, nbcol1;
  Int   l;   /* local indice on the beginning of the interval */
  assert(type == 'c' || type == 'r');
  nbcol0 = (type == 'c' ? ma->nbcol : ma->nbrow);
  nbcol1 = (type == 'c' ? mb->nbcol : mb->nbrow);
  templatewidth0 = q0 * nbcol0;
  templatewidth1 = q1 * nbcol1;
  {
    Int   sp0 = (type == 'c' ? ma->spcol : ma->sprow);
    Int   sp1 = (type == 'c' ? mb->spcol : mb->sprow);
    j0 = SHIFT(col0, sp0, q0) * nbcol0 - ja;
    j1 = SHIFT(col1, sp1, q1) * nbcol1 - jb;
  }
  offset = 0;
  l = 0;
  /* a small check to verify that the submatrix begin inside the first block
   * of the original matrix, this done by a sort of coordinate change at the
   * beginning of the Cpigemr2d */
  assert(j0 + nbcol0 > 0);
  assert(j1 + nbcol1 > 0);
  while ((j0 < n) && (j1 < n)) {
    Int   end0, end1;
    Int   start, end;
    end0 = j0 + nbcol0;
    end1 = j1 + nbcol1;
    if (end0 <= j1) {
      j0 += templatewidth0;
      l += nbcol0;
      continue;
    }
    if (end1 <= j0) {
      j1 += templatewidth1;
      continue;
    }
    /* compute the raw intersection */
    start = max(j0, j1);
    start = max(start, 0);
    /* the start is correct now, update the corresponding fields */
    result[offset].lstart = l + start - j0;
    end = min(end0, end1);
    if (end0 == end) {
      j0 += templatewidth0;
      l += nbcol0;
    }
    if (end1 == end)
      j1 += templatewidth1;
    /* throw the limit if they go out of the matrix */
    end = min(end, n);
    assert(end > start);
    /* it is a bit tricky to see why the length is always positive after all
     * this min and max, first we have the property that every interval
     * considered is at least partly into the submatrix, second we arrive
     * here only if the raw intersection is non-void, if we remove a limit
     * that means the corresponding frontier is in both intervals which
     * proove the final interval is non-void, clear ?? */
    result[offset].len = end - start;
    offset += 1;
  } /* while */
  return offset;
}

setmemory()

void setmemory	(	Int **	adpointer,
		Int	blocksize )

Definition at line 113 of file pigemr2.c.

{
  assert(blocksize >= 0);
  if (blocksize == 0) {
    *adpointer = NULL;
    return;
  }
  *adpointer = (Int *) mr2d_malloc(
                   blocksize * sizeof(Int));
}