pzplghe.c 2.59 KB
Newer Older
1 2
/**
 *
3 4
 * @copyright (c) 2009-2014 The University of Tennessee and The University
 *                          of Tennessee Research Foundation.
5
 *                          All rights reserved.
6
 * @copyright (c) 2012-2016 Inria. All rights reserved.
7
 * @copyright (c) 2012-2014 Bordeaux INP, CNRS (LaBRI UMR 5800), Inria, Univ. Bordeaux. All rights reserved.
8 9 10 11 12 13 14 15 16 17 18 19
 *
 **/

/**
 *
 * @file pzplghe.c
 *
 *  MORSE auxiliary routines
 *  MORSE is a software package provided by Univ. of Tennessee,
 *  Univ. of California Berkeley and Univ. of Colorado Denver
 *
 * @version 2.5.0
20 21
 * @comment This file is a copy from pzplghe.c
 *          wich has been automatically generated
22 23 24 25
 *          from Plasma 2.5.0 for MORSE 1.0.0
 * @author Mathieu Faverge
 * @author Emmanuel Agullo
 * @author Cedric Castagnede
26 27 28
 * @author Rade Mathis
 * @author Florent Pruvost
 * @date 2016-08-01
29 30 31
 * @precisions normal z -> c
 *
 **/
32
#include "control/common.h"
33 34 35

#define A(m,n) A,  m,  n
/***************************************************************************//**
36
 *  morse_pzplghe - Generate a random hermitian (positive definite if 'bump' is large enough) half-matrix by tiles.
37
 **/
38 39 40
void morse_pzplghe( double bump, MORSE_enum uplo, MORSE_desc_t *A,
		            unsigned long long int seed,
                    MORSE_sequence_t *sequence, MORSE_request_t *request )
41 42 43 44 45 46 47 48 49 50 51 52 53 54
{
    MORSE_context_t *morse;
    MORSE_option_t options;

    int m, n;
    int ldam;
    int tempmm, tempnn;

    morse = morse_context_self();
    if (sequence->status != MORSE_SUCCESS)
        return;
    RUNTIME_options_init(&options, morse, sequence, request);

    for (m = 0; m < A->mt; m++) {
55 56
    	tempmm = m == A->mt-1 ? A->m-m*A->mb : A->mb;
    	ldam = BLKLDD(A, m);
57

58 59 60 61 62 63
		/*
		 *  MorseLower
		 */
		if (uplo == MorseLower) {
			for (n = 0; n <= m; n++) {
				tempnn = n == A->nt-1 ? A->n-n*A->nb : A->nb;
64

65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98
				options.priority = m + n;
				MORSE_TASK_zplghe(
					&options,
					bump, tempmm, tempnn, A(m, n), ldam,
					A->m, m*A->mb, n*A->nb, seed );
			}
		}
		/*
		 * MorseUpper
		 */
		else if (uplo == MorseUpper) {
			for (n = m; n < A->nt; n++) {
				tempnn = n == A->nt-1 ? A->n-n*A->nb : A->nb;

				options.priority = m + n;
				MORSE_TASK_zplghe(
					&options,
					bump, tempmm, tempnn, A(m, n), ldam,
					A->m, m*A->mb, n*A->nb, seed );
			}
		}
		/*
		 * MorseUpperLower
		 */
		else {
			for (n = 0; n < A->nt; n++) {
				tempnn = n == A->nt-1 ? A->n-n*A->nb : A->nb;

				MORSE_TASK_zplghe(
					&options,
					bump, tempmm, tempnn, A(m, n), ldam,
					A->m, m*A->mb, n*A->nb, seed );
			}
		}
99 100 101 102
    }
    RUNTIME_options_finalize(&options, morse);
    MORSE_TASK_dataflush_all();
}