/*
Code for manipulating distributed regular arrays in parallel.
*/
#include "private/daimpl.h" /*I "petscdm.h" I*/
#undef __FUNCT__
#define __FUNCT__ "DMDAGetGlobalIndices"
/*@C
DMDAGetGlobalIndices - Returns the global node number of all local nodes,
including ghost nodes.
Not Collective
Input Parameter:
. da - the distributed array
Output Parameters:
+ n - the number of local elements, including ghost nodes (or PETSC_NULL)
- idx - the global indices
Level: intermediate
Note:
For DMDA_STENCIL_STAR stencils the inactive corner ghost nodes are also included
in the list of local indices (even though those nodes are not updated
during calls to DMDAXXXToXXX().
Essentially the same data is returned in the form of a local-to-global mapping
with the routine DMDAGetISLocalToGlobalMapping();
Fortran Note:
This routine is used differently from Fortran
.vb
DM da
integer n,da_array(1)
PetscOffset i_da
integer ierr
call DMDAGetGlobalIndices(da,n,da_array,i_da,ierr)
C Access first local entry in list
value = da_array(i_da + 1)
.ve
See the Fortran chapter of the users manual for details.
.keywords: distributed array, get, global, indices, local-to-global
.seealso: DMDACreate2d(), DMDAGetGhostCorners(), DMDAGetCorners(), DMLocalToGlobalBegin()
DMGlobalToLocalBegin(), DMGlobalToLocalEnd(), DMDALocalToLocalBegin(), DMDAGetAO(), DMDAGetGlobalIndicesF90()
DMDAGetISLocalToGlobalMapping(), DMDACreate3d(), DMDACreate1d(), DMDALocalToLocalEnd(), DMDAGetOwnershipRanges()
@*/
PetscErrorCode DMDAGetGlobalIndices(DM da,PetscInt *n,PetscInt **idx)
{
DM_DA *dd = (DM_DA*)da->data;
PetscFunctionBegin;
PetscValidHeaderSpecific(da,DM_CLASSID,1);
if (n) *n = dd->Nl;
if (idx) *idx = dd->idx;
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "DMDAGetNatural_Private"
/*
Gets the natural number for each global number on the process.
Used by DMDAGetAO() and DMDAGlobalToNatural_Create()
*/
PetscErrorCode DMDAGetNatural_Private(DM da,PetscInt *outNlocal,IS *isnatural)
{
PetscErrorCode ierr;
PetscInt Nlocal,i,j,k,*lidx,lict = 0;
DM_DA *dd = (DM_DA*)da->data;
PetscFunctionBegin;
Nlocal = (dd->xe-dd->xs);
if (dd->dim > 1) {
Nlocal *= (dd->ye-dd->ys);
}
if (dd->dim > 2) {
Nlocal *= (dd->ze-dd->zs);
}
ierr = PetscMalloc(Nlocal*sizeof(PetscInt),&lidx);CHKERRQ(ierr);
if (dd->dim == 1) {
for (i=dd->xs; ixe; i++) {
/* global number in natural ordering */
lidx[lict++] = i;
}
} else if (dd->dim == 2) {
for (j=dd->ys; jye; j++) {
for (i=dd->xs; ixe; i++) {
/* global number in natural ordering */
lidx[lict++] = i + j*dd->M*dd->w;
}
}
} else if (dd->dim == 3) {
for (k=dd->zs; kze; k++) {
for (j=dd->ys; jye; j++) {
for (i=dd->xs; ixe; i++) {
lidx[lict++] = i + j*dd->M*dd->w + k*dd->M*dd->N*dd->w;
}
}
}
}
*outNlocal = Nlocal;
ierr = ISCreateGeneral(((PetscObject)da)->comm,Nlocal,lidx,PETSC_OWN_POINTER,isnatural);CHKERRQ(ierr);
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "DMDAGetAO"
/*@
DMDAGetAO - Gets the application ordering context for a distributed array.
Collective on DMDA
Input Parameter:
. da - the distributed array
Output Parameters:
. ao - the application ordering context for DMDAs
Level: intermediate
Notes:
In this case, the AO maps to the natural grid ordering that would be used
for the DMDA if only 1 processor were employed (ordering most rapidly in the
x-direction, then y, then z). Multiple degrees of freedom are numbered
for each node (rather than 1 component for the whole grid, then the next
component, etc.)
.keywords: distributed array, get, global, indices, local-to-global
.seealso: DMDACreate2d(), DMDAGetGhostCorners(), DMDAGetCorners(), DMDALocalToGlocal()
DMGlobalToLocalBegin(), DMGlobalToLocalEnd(), DMDALocalToLocalBegin(), DMDALocalToLocalEnd(), DMDAGetGlobalIndices(), DMDAGetOwnershipRanges(),
AO, AOPetscToApplication(), AOApplicationToPetsc()
@*/
PetscErrorCode DMDAGetAO(DM da,AO *ao)
{
DM_DA *dd = (DM_DA*)da->data;
PetscFunctionBegin;
PetscValidHeaderSpecific(da,DM_CLASSID,1);
PetscValidPointer(ao,2);
/*
Build the natural ordering to PETSc ordering mappings.
*/
if (!dd->ao) {
IS ispetsc,isnatural;
PetscErrorCode ierr;
PetscInt Nlocal;
ierr = DMDAGetNatural_Private(da,&Nlocal,&isnatural);CHKERRQ(ierr);
ierr = ISCreateStride(((PetscObject)da)->comm,Nlocal,dd->base,1,&ispetsc);CHKERRQ(ierr);
ierr = AOCreateBasicIS(isnatural,ispetsc,&dd->ao);CHKERRQ(ierr);
ierr = PetscLogObjectParent(da,dd->ao);CHKERRQ(ierr);
ierr = ISDestroy(ispetsc);CHKERRQ(ierr);
ierr = ISDestroy(isnatural);CHKERRQ(ierr);
}
*ao = dd->ao;
PetscFunctionReturn(0);
}
/*MC
DMDAGetGlobalIndicesF90 - Returns a Fortran90 pointer to the list of
global indices (global node number of all local nodes, including
ghost nodes).
Synopsis:
DMDAGetGlobalIndicesF90(DM da,integer n,{integer, pointer :: idx(:)},integer ierr)
Not Collective
Input Parameter:
. da - the distributed array
Output Parameters:
+ n - the number of local elements, including ghost nodes (or PETSC_NULL)
. idx - the Fortran90 pointer to the global indices
- ierr - error code
Level: intermediate
Notes:
Not yet supported for all F90 compilers
.keywords: distributed array, get, global, indices, local-to-global, f90
.seealso: DMDAGetGlobalIndices()
M*/