IFPACK Development
Loading...
Searching...
No Matches
ExternalRows_dh.h
1/*@HEADER
2// ***********************************************************************
3//
4// Ifpack: Object-Oriented Algebraic Preconditioner Package
5// Copyright (2002) Sandia Corporation
6//
7// Under terms of Contract DE-AC04-94AL85000, there is a non-exclusive
8// license for use of this work by or on behalf of the U.S. Government.
9//
10// Redistribution and use in source and binary forms, with or without
11// modification, are permitted provided that the following conditions are
12// met:
13//
14// 1. Redistributions of source code must retain the above copyright
15// notice, this list of conditions and the following disclaimer.
16//
17// 2. Redistributions in binary form must reproduce the above copyright
18// notice, this list of conditions and the following disclaimer in the
19// documentation and/or other materials provided with the distribution.
20//
21// 3. Neither the name of the Corporation nor the names of the
22// contributors may be used to endorse or promote products derived from
23// this software without specific prior written permission.
24//
25// THIS SOFTWARE IS PROVIDED BY SANDIA CORPORATION "AS IS" AND ANY
26// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
27// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
28// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL SANDIA CORPORATION OR THE
29// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
30// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
31// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
32// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
33// LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
34// NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
35// SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
36//
37// Questions? Contact Michael A. Heroux (maherou@sandia.gov)
38//
39// ***********************************************************************
40//@HEADER
41*/
42
43#ifndef EXTERNAL_ROWS_DH_H
44#define EXTERNAL_ROWS_DH_H
45
46#if defined(Ifpack_SHOW_DEPRECATED_WARNINGS)
47#ifdef __GNUC__
48#warning "The Ifpack package is deprecated"
49#endif
50#endif
51
52#include "euclid_common.h"
53#ifdef __cplusplus
54extern "C"
55{
56#endif
57
58 extern void ExternalRows_dhCreate (ExternalRows_dh * er);
59 extern void ExternalRows_dhDestroy (ExternalRows_dh er);
60 extern void ExternalRows_dhInit (ExternalRows_dh er, Euclid_dh ctx);
61 extern void ExternalRows_dhRecvRows (ExternalRows_dh extRows);
62 extern void ExternalRows_dhSendRows (ExternalRows_dh extRows);
63 extern void ExternalRows_dhGetRow (ExternalRows_dh er, int globalRow,
64 int *len, int **cval, int **fill,
65 REAL_DH ** aval);
66
68 {
69 SubdomainGraph_dh sg; /* not owned! */
70 Factor_dh F; /* not owned! */
71
72 MPI_Status status[MAX_MPI_TASKS];
73 MPI_Request req1[MAX_MPI_TASKS];
74 MPI_Request req2[MAX_MPI_TASKS];
75 MPI_Request req3[MAX_MPI_TASKS];
76 MPI_Request req4[MAX_MPI_TASKS];
77 MPI_Request cval_req[MAX_MPI_TASKS];
78 MPI_Request fill_req[MAX_MPI_TASKS];
79 MPI_Request aval_req[MAX_MPI_TASKS];
80
81 /*------------------------------------------------------------------------
82 * data structures for receiving, storing, and accessing external rows
83 * from lower-ordered nabors
84 *------------------------------------------------------------------------*/
85 /* for reception of row counts, row numbers, and row lengths: */
86 int rcv_row_counts[MAX_MPI_TASKS]; /* P_i will send rcv_row_counts[i] rows */
87 int rcv_nz_counts[MAX_MPI_TASKS]; /* P_i's rows contain rcv_nz_counts[i] nonzeros */
88 int *rcv_row_lengths[MAX_MPI_TASKS]; /* rcv_row_lengths[i][] lists the length of each row */
89 int *rcv_row_numbers[MAX_MPI_TASKS]; /* rcv_row_lengths[i][] lists the length of each row */
90
91 /* for reception of the actual rows: */
92 int *cvalExt;
93 int *fillExt;
94 REAL_DH *avalExt;
95
96 /* table for accessing the rows */
97 Hash_dh rowLookup;
98
99 /*--------------------------------------------------------------------------
100 * data structures for sending boundary rows to higher-ordered nabors
101 *--------------------------------------------------------------------------*/
102 /* for sending row counts, numbers, and lengths: */
103 int *my_row_counts; /* my_row_counts[i] = nzcount in upper tri portion o */
104 int *my_row_numbers; /* my_row_numbers[i] = global row number of local ro */
105
106 /* for sending the actual rows: */
107 int nzSend; /* total entries in upper tri portions of bdry rows */
108 int *cvalSend;
109 int *fillSend;
110 REAL_DH *avalSend;
111
112 bool debug;
113 };
114#ifdef __cplusplus
115}
116#endif
117
118#endif