scanD0()

void scanD0	(	char *	uplo,
		char *	diag,
		Int	action,
		ptrbuff	,
		Int *	ptrsizebuff,
		Int	m,
		Int	n,
		MDESC *	ma,
		Int	ia,
		Int	ja,
		Int	p0,
		Int	q0,
		MDESC *	mb,
		Int	ib,
		Int	jb,
		Int	p1,
		Int	q1,
		IDESC *	v_inter,
		Int	vinter_nb,
		IDESC *	h_inter,
		Int	hinter_nb,
		Int *ptrbuff *	ptrblock
	)

Definition at line 302 of file pitrmr2.c.

{/* Rmk: the a+au type addresses are strict bounds as a+au does not belong to
  * the [a..a+au-1] interval of length au */
  Int   templateheight1, templatewidth1;
  Int   templateheight0, templatewidth0;
  Int   h, v;   /* for scanning the intervals */
  /* initializations */
  templateheight1 = p1 * mb->nbrow;
  templateheight0 = p0 * ma->nbrow;
  templatewidth1 = q1 * mb->nbcol;
  templatewidth0 = q0 * ma->nbcol;
  /* we now will deal will logical grids, that's to say we change our
   * numbering of processors so that (0,0) begin on logical processor (0,0) */
  /* in case we will not enter the while loop */
  (*ptrsizebuff) = 0;
  for (h = 0; h < hinter_nb; h++)
    for (v = 0; v < vinter_nb; v++) {
      Int   j;
      for (j = 0; j < h_inter[h].len; j++)
        intersect(uplo, diag, j + h_inter[h].gstart,
                  v_inter[v].gstart, v_inter[v].gstart + v_inter[v].len,
                  action, ptrsizebuff, &ptrbuff, ptrblock, m, n,
                  ma, ia, ja, templateheight0, templatewidth0,
                  mb, ib, jb, templateheight1, templatewidth1);
    }
}/* scanD0() */

Here is the call graph for this function: