Actual source code: da2.c
petsc-3.5.4 2015-05-23
2: #include <petsc-private/dmdaimpl.h> /*I "petscdmda.h" I*/
3: #include <petscdraw.h>
7: PetscErrorCode DMView_DA_2d(DM da,PetscViewer viewer)
8: {
10: PetscMPIInt rank;
11: PetscBool iascii,isdraw,isbinary;
12: DM_DA *dd = (DM_DA*)da->data;
13: #if defined(PETSC_HAVE_MATLAB_ENGINE)
14: PetscBool ismatlab;
15: #endif
18: MPI_Comm_rank(PetscObjectComm((PetscObject)da),&rank);
20: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERASCII,&iascii);
21: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERDRAW,&isdraw);
22: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERBINARY,&isbinary);
23: #if defined(PETSC_HAVE_MATLAB_ENGINE)
24: PetscObjectTypeCompare((PetscObject)viewer,PETSCVIEWERMATLAB,&ismatlab);
25: #endif
26: if (iascii) {
27: PetscViewerFormat format;
29: PetscViewerGetFormat(viewer, &format);
30: if (format != PETSC_VIEWER_ASCII_VTK && format != PETSC_VIEWER_ASCII_VTK_CELL) {
31: DMDALocalInfo info;
32: DMDAGetLocalInfo(da,&info);
33: PetscViewerASCIISynchronizedAllow(viewer,PETSC_TRUE);
34: PetscViewerASCIISynchronizedPrintf(viewer,"Processor [%d] M %D N %D m %D n %D w %D s %D\n",rank,dd->M,dd->N,dd->m,dd->n,dd->w,dd->s);
35: PetscViewerASCIISynchronizedPrintf(viewer,"X range of indices: %D %D, Y range of indices: %D %D\n",info.xs,info.xs+info.xm,info.ys,info.ys+info.ym);
36: PetscViewerFlush(viewer);
37: PetscViewerASCIISynchronizedAllow(viewer,PETSC_FALSE);
38: } else {
39: DMView_DA_VTK(da,viewer);
40: }
41: } else if (isdraw) {
42: PetscDraw draw;
43: double ymin = -1*dd->s-1,ymax = dd->N+dd->s;
44: double xmin = -1*dd->s-1,xmax = dd->M+dd->s;
45: double x,y;
46: PetscInt base;
47: const PetscInt *idx;
48: char node[10];
49: PetscBool isnull;
51: PetscViewerDrawGetDraw(viewer,0,&draw);
52: PetscDrawIsNull(draw,&isnull); if (isnull) return(0);
53: if (!da->coordinates) {
54: PetscDrawSetCoordinates(draw,xmin,ymin,xmax,ymax);
55: }
56: PetscDrawSynchronizedClear(draw);
58: /* first processor draw all node lines */
59: if (!rank) {
60: ymin = 0.0; ymax = dd->N - 1;
61: for (xmin=0; xmin<dd->M; xmin++) {
62: PetscDrawLine(draw,xmin,ymin,xmin,ymax,PETSC_DRAW_BLACK);
63: }
64: xmin = 0.0; xmax = dd->M - 1;
65: for (ymin=0; ymin<dd->N; ymin++) {
66: PetscDrawLine(draw,xmin,ymin,xmax,ymin,PETSC_DRAW_BLACK);
67: }
68: }
69: PetscDrawSynchronizedFlush(draw);
70: PetscDrawPause(draw);
72: /* draw my box */
73: ymin = dd->ys; ymax = dd->ye - 1; xmin = dd->xs/dd->w;
74: xmax =(dd->xe-1)/dd->w;
75: PetscDrawLine(draw,xmin,ymin,xmax,ymin,PETSC_DRAW_RED);
76: PetscDrawLine(draw,xmin,ymin,xmin,ymax,PETSC_DRAW_RED);
77: PetscDrawLine(draw,xmin,ymax,xmax,ymax,PETSC_DRAW_RED);
78: PetscDrawLine(draw,xmax,ymin,xmax,ymax,PETSC_DRAW_RED);
80: /* put in numbers */
81: base = (dd->base)/dd->w;
82: for (y=ymin; y<=ymax; y++) {
83: for (x=xmin; x<=xmax; x++) {
84: sprintf(node,"%d",(int)base++);
85: PetscDrawString(draw,x,y,PETSC_DRAW_BLACK,node);
86: }
87: }
89: PetscDrawSynchronizedFlush(draw);
90: PetscDrawPause(draw);
91: /* overlay ghost numbers, useful for error checking */
92: /* put in numbers */
94: base = 0;
95: ISLocalToGlobalMappingGetBlockIndices(da->ltogmap,&idx);
96: ymin = dd->Ys; ymax = dd->Ye; xmin = dd->Xs; xmax = dd->Xe;
97: for (y=ymin; y<ymax; y++) {
98: for (x=xmin; x<xmax; x++) {
99: if ((base % dd->w) == 0) {
100: sprintf(node,"%d",(int)(idx[base/dd->w]));
101: PetscDrawString(draw,x/dd->w,y,PETSC_DRAW_BLUE,node);
102: }
103: base++;
104: }
105: }
106: ISLocalToGlobalMappingRestoreBlockIndices(da->ltogmap,&idx);
107: PetscDrawSynchronizedFlush(draw);
108: PetscDrawPause(draw);
109: } else if (isbinary) {
110: DMView_DA_Binary(da,viewer);
111: #if defined(PETSC_HAVE_MATLAB_ENGINE)
112: } else if (ismatlab) {
113: DMView_DA_Matlab(da,viewer);
114: #endif
115: }
116: return(0);
117: }
119: /*
120: M is number of grid points
121: m is number of processors
123: */
126: PetscErrorCode DMDASplitComm2d(MPI_Comm comm,PetscInt M,PetscInt N,PetscInt sw,MPI_Comm *outcomm)
127: {
129: PetscInt m,n = 0,x = 0,y = 0;
130: PetscMPIInt size,csize,rank;
133: MPI_Comm_size(comm,&size);
134: MPI_Comm_rank(comm,&rank);
136: csize = 4*size;
137: do {
138: if (csize % 4) SETERRQ4(PETSC_COMM_SELF,PETSC_ERR_ARG_INCOMP,"Cannot split communicator of size %d tried %d %D %D",size,csize,x,y);
139: csize = csize/4;
141: m = (PetscInt)(0.5 + PetscSqrtReal(((PetscReal)M)*((PetscReal)csize)/((PetscReal)N)));
142: if (!m) m = 1;
143: while (m > 0) {
144: n = csize/m;
145: if (m*n == csize) break;
146: m--;
147: }
148: if (M > N && m < n) {PetscInt _m = m; m = n; n = _m;}
150: x = M/m + ((M % m) > ((csize-1) % m));
151: y = (N + (csize-1)/m)/n;
152: } while ((x < 4 || y < 4) && csize > 1);
153: if (size != csize) {
154: MPI_Group entire_group,sub_group;
155: PetscMPIInt i,*groupies;
157: MPI_Comm_group(comm,&entire_group);
158: PetscMalloc1(csize,&groupies);
159: for (i=0; i<csize; i++) {
160: groupies[i] = (rank/csize)*csize + i;
161: }
162: MPI_Group_incl(entire_group,csize,groupies,&sub_group);
163: PetscFree(groupies);
164: MPI_Comm_create(comm,sub_group,outcomm);
165: MPI_Group_free(&entire_group);
166: MPI_Group_free(&sub_group);
167: PetscInfo1(0,"DMDASplitComm2d:Creating redundant coarse problems of size %d\n",csize);
168: } else {
169: *outcomm = comm;
170: }
171: return(0);
172: }
174: #if defined(new)
177: /*
178: DMDAGetDiagonal_MFFD - Gets the diagonal for a matrix free matrix where local
179: function lives on a DMDA
181: y ~= (F(u + ha) - F(u))/h,
182: where F = nonlinear function, as set by SNESSetFunction()
183: u = current iterate
184: h = difference interval
185: */
186: PetscErrorCode DMDAGetDiagonal_MFFD(DM da,Vec U,Vec a)
187: {
188: PetscScalar h,*aa,*ww,v;
189: PetscReal epsilon = PETSC_SQRT_MACHINE_EPSILON,umin = 100.0*PETSC_SQRT_MACHINE_EPSILON;
191: PetscInt gI,nI;
192: MatStencil stencil;
193: DMDALocalInfo info;
196: (*ctx->func)(0,U,a,ctx->funcctx);
197: (*ctx->funcisetbase)(U,ctx->funcctx);
199: VecGetArray(U,&ww);
200: VecGetArray(a,&aa);
202: nI = 0;
203: h = ww[gI];
204: if (h == 0.0) h = 1.0;
205: if (PetscAbsScalar(h) < umin && PetscRealPart(h) >= 0.0) h = umin;
206: else if (PetscRealPart(h) < 0.0 && PetscAbsScalar(h) < umin) h = -umin;
207: h *= epsilon;
209: ww[gI] += h;
210: (*ctx->funci)(i,w,&v,ctx->funcctx);
211: aa[nI] = (v - aa[nI])/h;
212: ww[gI] -= h;
213: nI++;
215: VecRestoreArray(U,&ww);
216: VecRestoreArray(a,&aa);
217: return(0);
218: }
219: #endif
223: PetscErrorCode DMSetUp_DA_2D(DM da)
224: {
225: DM_DA *dd = (DM_DA*)da->data;
226: const PetscInt M = dd->M;
227: const PetscInt N = dd->N;
228: PetscInt m = dd->m;
229: PetscInt n = dd->n;
230: const PetscInt dof = dd->w;
231: const PetscInt s = dd->s;
232: DMBoundaryType bx = dd->bx;
233: DMBoundaryType by = dd->by;
234: DMDAStencilType stencil_type = dd->stencil_type;
235: PetscInt *lx = dd->lx;
236: PetscInt *ly = dd->ly;
237: MPI_Comm comm;
238: PetscMPIInt rank,size;
239: PetscInt xs,xe,ys,ye,x,y,Xs,Xe,Ys,Ye,IXs,IXe,IYs,IYe;
240: PetscInt up,down,left,right,i,n0,n1,n2,n3,n5,n6,n7,n8,*idx,nn;
241: PetscInt xbase,*bases,*ldims,j,x_t,y_t,s_t,base,count;
242: PetscInt s_x,s_y; /* s proportionalized to w */
243: PetscInt sn0 = 0,sn2 = 0,sn6 = 0,sn8 = 0;
244: Vec local,global;
245: VecScatter gtol;
246: IS to,from;
247: PetscErrorCode ierr;
250: if (stencil_type == DMDA_STENCIL_BOX && (bx == DM_BOUNDARY_MIRROR || by == DM_BOUNDARY_MIRROR)) SETERRQ(PetscObjectComm((PetscObject)da),PETSC_ERR_SUP,"Mirror boundary and box stencil");
251: PetscObjectGetComm((PetscObject)da,&comm);
252: #if !defined(PETSC_USE_64BIT_INDICES)
253: if (((Petsc64bitInt) M)*((Petsc64bitInt) N)*((Petsc64bitInt) dof) > (Petsc64bitInt) PETSC_MPI_INT_MAX) SETERRQ3(comm,PETSC_ERR_INT_OVERFLOW,"Mesh of %D by %D by %D (dof) is too large for 32 bit indices",M,N,dof);
254: #endif
256: if (dof < 1) SETERRQ1(comm,PETSC_ERR_ARG_OUTOFRANGE,"Must have 1 or more degrees of freedom per node: %D",dof);
257: if (s < 0) SETERRQ1(comm,PETSC_ERR_ARG_OUTOFRANGE,"Stencil width cannot be negative: %D",s);
259: MPI_Comm_size(comm,&size);
260: MPI_Comm_rank(comm,&rank);
262: if (m != PETSC_DECIDE) {
263: if (m < 1) SETERRQ1(comm,PETSC_ERR_ARG_OUTOFRANGE,"Non-positive number of processors in X direction: %D",m);
264: else if (m > size) SETERRQ2(comm,PETSC_ERR_ARG_OUTOFRANGE,"Too many processors in X direction: %D %d",m,size);
265: }
266: if (n != PETSC_DECIDE) {
267: if (n < 1) SETERRQ1(comm,PETSC_ERR_ARG_OUTOFRANGE,"Non-positive number of processors in Y direction: %D",n);
268: else if (n > size) SETERRQ2(comm,PETSC_ERR_ARG_OUTOFRANGE,"Too many processors in Y direction: %D %d",n,size);
269: }
271: if (m == PETSC_DECIDE || n == PETSC_DECIDE) {
272: if (n != PETSC_DECIDE) {
273: m = size/n;
274: } else if (m != PETSC_DECIDE) {
275: n = size/m;
276: } else {
277: /* try for squarish distribution */
278: m = (PetscInt)(0.5 + PetscSqrtReal(((PetscReal)M)*((PetscReal)size)/((PetscReal)N)));
279: if (!m) m = 1;
280: while (m > 0) {
281: n = size/m;
282: if (m*n == size) break;
283: m--;
284: }
285: if (M > N && m < n) {PetscInt _m = m; m = n; n = _m;}
286: }
287: if (m*n != size) SETERRQ(comm,PETSC_ERR_PLIB,"Unable to create partition, check the size of the communicator and input m and n ");
288: } else if (m*n != size) SETERRQ(comm,PETSC_ERR_ARG_OUTOFRANGE,"Given Bad partition");
290: if (M < m) SETERRQ2(comm,PETSC_ERR_ARG_OUTOFRANGE,"Partition in x direction is too fine! %D %D",M,m);
291: if (N < n) SETERRQ2(comm,PETSC_ERR_ARG_OUTOFRANGE,"Partition in y direction is too fine! %D %D",N,n);
293: /*
294: Determine locally owned region
295: xs is the first local node number, x is the number of local nodes
296: */
297: if (!lx) {
298: PetscMalloc1(m, &dd->lx);
299: lx = dd->lx;
300: for (i=0; i<m; i++) {
301: lx[i] = M/m + ((M % m) > i);
302: }
303: }
304: x = lx[rank % m];
305: xs = 0;
306: for (i=0; i<(rank % m); i++) {
307: xs += lx[i];
308: }
309: #if defined(PETSC_USE_DEBUG)
310: left = xs;
311: for (i=(rank % m); i<m; i++) {
312: left += lx[i];
313: }
314: if (left != M) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Sum of lx across processors not equal to M: %D %D",left,M);
315: #endif
317: /*
318: Determine locally owned region
319: ys is the first local node number, y is the number of local nodes
320: */
321: if (!ly) {
322: PetscMalloc1(n, &dd->ly);
323: ly = dd->ly;
324: for (i=0; i<n; i++) {
325: ly[i] = N/n + ((N % n) > i);
326: }
327: }
328: y = ly[rank/m];
329: ys = 0;
330: for (i=0; i<(rank/m); i++) {
331: ys += ly[i];
332: }
333: #if defined(PETSC_USE_DEBUG)
334: left = ys;
335: for (i=(rank/m); i<n; i++) {
336: left += ly[i];
337: }
338: if (left != N) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Sum of ly across processors not equal to N: %D %D",left,N);
339: #endif
341: /*
342: check if the scatter requires more than one process neighbor or wraps around
343: the domain more than once
344: */
345: if ((x < s) && ((m > 1) || (bx == DM_BOUNDARY_PERIODIC))) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Local x-width of domain x %D is smaller than stencil width s %D",x,s);
346: if ((y < s) && ((n > 1) || (by == DM_BOUNDARY_PERIODIC))) SETERRQ2(PETSC_COMM_SELF,PETSC_ERR_ARG_OUTOFRANGE,"Local y-width of domain y %D is smaller than stencil width s %D",y,s);
347: xe = xs + x;
348: ye = ys + y;
350: /* determine ghost region (Xs) and region scattered into (IXs) */
351: if (xs-s > 0) {
352: Xs = xs - s; IXs = xs - s;
353: } else {
354: if (bx) {
355: Xs = xs - s;
356: } else {
357: Xs = 0;
358: }
359: IXs = 0;
360: }
361: if (xe+s <= M) {
362: Xe = xe + s; IXe = xe + s;
363: } else {
364: if (bx) {
365: Xs = xs - s; Xe = xe + s;
366: } else {
367: Xe = M;
368: }
369: IXe = M;
370: }
372: if (bx == DM_BOUNDARY_PERIODIC || bx == DM_BOUNDARY_MIRROR) {
373: IXs = xs - s;
374: IXe = xe + s;
375: Xs = xs - s;
376: Xe = xe + s;
377: }
379: if (ys-s > 0) {
380: Ys = ys - s; IYs = ys - s;
381: } else {
382: if (by) {
383: Ys = ys - s;
384: } else {
385: Ys = 0;
386: }
387: IYs = 0;
388: }
389: if (ye+s <= N) {
390: Ye = ye + s; IYe = ye + s;
391: } else {
392: if (by) {
393: Ye = ye + s;
394: } else {
395: Ye = N;
396: }
397: IYe = N;
398: }
400: if (by == DM_BOUNDARY_PERIODIC || by == DM_BOUNDARY_MIRROR) {
401: IYs = ys - s;
402: IYe = ye + s;
403: Ys = ys - s;
404: Ye = ye + s;
405: }
407: /* stencil length in each direction */
408: s_x = s;
409: s_y = s;
411: /* determine starting point of each processor */
412: nn = x*y;
413: PetscMalloc2(size+1,&bases,size,&ldims);
414: MPI_Allgather(&nn,1,MPIU_INT,ldims,1,MPIU_INT,comm);
415: bases[0] = 0;
416: for (i=1; i<=size; i++) {
417: bases[i] = ldims[i-1];
418: }
419: for (i=1; i<=size; i++) {
420: bases[i] += bases[i-1];
421: }
422: base = bases[rank]*dof;
424: /* allocate the base parallel and sequential vectors */
425: dd->Nlocal = x*y*dof;
426: VecCreateMPIWithArray(comm,dof,dd->Nlocal,PETSC_DECIDE,NULL,&global);
427: dd->nlocal = (Xe-Xs)*(Ye-Ys)*dof;
428: VecCreateSeqWithArray(PETSC_COMM_SELF,dof,dd->nlocal,NULL,&local);
430: /* generate appropriate vector scatters */
431: /* local to global inserts non-ghost point region into global */
432: PetscMalloc1((IXe-IXs)*(IYe-IYs),&idx);
433: left = xs - Xs; right = left + x;
434: down = ys - Ys; up = down + y;
435: count = 0;
436: for (i=down; i<up; i++) {
437: for (j=left; j<right; j++) {
438: idx[count++] = i*(Xe-Xs) + j;
439: }
440: }
442: /* global to local must include ghost points within the domain,
443: but not ghost points outside the domain that aren't periodic */
444: if (stencil_type == DMDA_STENCIL_BOX) {
445: left = IXs - Xs; right = left + (IXe-IXs);
446: down = IYs - Ys; up = down + (IYe-IYs);
447: count = 0;
448: for (i=down; i<up; i++) {
449: for (j=left; j<right; j++) {
450: idx[count++] = j + i*(Xe-Xs);
451: }
452: }
453: ISCreateBlock(comm,dof,count,idx,PETSC_OWN_POINTER,&to);
455: } else {
456: /* must drop into cross shape region */
457: /* ---------|
458: | top |
459: |--- ---| up
460: | middle |
461: | |
462: ---- ---- down
463: | bottom |
464: -----------
465: Xs xs xe Xe */
466: left = xs - Xs; right = left + x;
467: down = ys - Ys; up = down + y;
468: count = 0;
469: /* bottom */
470: for (i=(IYs-Ys); i<down; i++) {
471: for (j=left; j<right; j++) {
472: idx[count++] = j + i*(Xe-Xs);
473: }
474: }
475: /* middle */
476: for (i=down; i<up; i++) {
477: for (j=(IXs-Xs); j<(IXe-Xs); j++) {
478: idx[count++] = j + i*(Xe-Xs);
479: }
480: }
481: /* top */
482: for (i=up; i<up+IYe-ye; i++) {
483: for (j=left; j<right; j++) {
484: idx[count++] = j + i*(Xe-Xs);
485: }
486: }
487: ISCreateBlock(comm,dof,count,idx,PETSC_OWN_POINTER,&to);
488: }
491: /* determine who lies on each side of us stored in n6 n7 n8
492: n3 n5
493: n0 n1 n2
494: */
496: /* Assume the Non-Periodic Case */
497: n1 = rank - m;
498: if (rank % m) {
499: n0 = n1 - 1;
500: } else {
501: n0 = -1;
502: }
503: if ((rank+1) % m) {
504: n2 = n1 + 1;
505: n5 = rank + 1;
506: n8 = rank + m + 1; if (n8 >= m*n) n8 = -1;
507: } else {
508: n2 = -1; n5 = -1; n8 = -1;
509: }
510: if (rank % m) {
511: n3 = rank - 1;
512: n6 = n3 + m; if (n6 >= m*n) n6 = -1;
513: } else {
514: n3 = -1; n6 = -1;
515: }
516: n7 = rank + m; if (n7 >= m*n) n7 = -1;
518: if (bx == DM_BOUNDARY_PERIODIC && by == DM_BOUNDARY_PERIODIC) {
519: /* Modify for Periodic Cases */
520: /* Handle all four corners */
521: if ((n6 < 0) && (n7 < 0) && (n3 < 0)) n6 = m-1;
522: if ((n8 < 0) && (n7 < 0) && (n5 < 0)) n8 = 0;
523: if ((n2 < 0) && (n5 < 0) && (n1 < 0)) n2 = size-m;
524: if ((n0 < 0) && (n3 < 0) && (n1 < 0)) n0 = size-1;
526: /* Handle Top and Bottom Sides */
527: if (n1 < 0) n1 = rank + m * (n-1);
528: if (n7 < 0) n7 = rank - m * (n-1);
529: if ((n3 >= 0) && (n0 < 0)) n0 = size - m + rank - 1;
530: if ((n3 >= 0) && (n6 < 0)) n6 = (rank%m)-1;
531: if ((n5 >= 0) && (n2 < 0)) n2 = size - m + rank + 1;
532: if ((n5 >= 0) && (n8 < 0)) n8 = (rank%m)+1;
534: /* Handle Left and Right Sides */
535: if (n3 < 0) n3 = rank + (m-1);
536: if (n5 < 0) n5 = rank - (m-1);
537: if ((n1 >= 0) && (n0 < 0)) n0 = rank-1;
538: if ((n1 >= 0) && (n2 < 0)) n2 = rank-2*m+1;
539: if ((n7 >= 0) && (n6 < 0)) n6 = rank+2*m-1;
540: if ((n7 >= 0) && (n8 < 0)) n8 = rank+1;
541: } else if (by == DM_BOUNDARY_PERIODIC) { /* Handle Top and Bottom Sides */
542: if (n1 < 0) n1 = rank + m * (n-1);
543: if (n7 < 0) n7 = rank - m * (n-1);
544: if ((n3 >= 0) && (n0 < 0)) n0 = size - m + rank - 1;
545: if ((n3 >= 0) && (n6 < 0)) n6 = (rank%m)-1;
546: if ((n5 >= 0) && (n2 < 0)) n2 = size - m + rank + 1;
547: if ((n5 >= 0) && (n8 < 0)) n8 = (rank%m)+1;
548: } else if (bx == DM_BOUNDARY_PERIODIC) { /* Handle Left and Right Sides */
549: if (n3 < 0) n3 = rank + (m-1);
550: if (n5 < 0) n5 = rank - (m-1);
551: if ((n1 >= 0) && (n0 < 0)) n0 = rank-1;
552: if ((n1 >= 0) && (n2 < 0)) n2 = rank-2*m+1;
553: if ((n7 >= 0) && (n6 < 0)) n6 = rank+2*m-1;
554: if ((n7 >= 0) && (n8 < 0)) n8 = rank+1;
555: }
557: PetscMalloc1(9,&dd->neighbors);
559: dd->neighbors[0] = n0;
560: dd->neighbors[1] = n1;
561: dd->neighbors[2] = n2;
562: dd->neighbors[3] = n3;
563: dd->neighbors[4] = rank;
564: dd->neighbors[5] = n5;
565: dd->neighbors[6] = n6;
566: dd->neighbors[7] = n7;
567: dd->neighbors[8] = n8;
569: if (stencil_type == DMDA_STENCIL_STAR) {
570: /* save corner processor numbers */
571: sn0 = n0; sn2 = n2; sn6 = n6; sn8 = n8;
572: n0 = n2 = n6 = n8 = -1;
573: }
575: PetscMalloc1((Xe-Xs)*(Ye-Ys),&idx);
577: nn = 0;
578: xbase = bases[rank];
579: for (i=1; i<=s_y; i++) {
580: if (n0 >= 0) { /* left below */
581: x_t = lx[n0 % m];
582: y_t = ly[(n0/m)];
583: s_t = bases[n0] + x_t*y_t - (s_y-i)*x_t - s_x;
584: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
585: }
587: if (n1 >= 0) { /* directly below */
588: x_t = x;
589: y_t = ly[(n1/m)];
590: s_t = bases[n1] + x_t*y_t - (s_y+1-i)*x_t;
591: for (j=0; j<x_t; j++) idx[nn++] = s_t++;
592: } else if (by == DM_BOUNDARY_MIRROR) {
593: for (j=0; j<x; j++) idx[nn++] = bases[rank] + x*(s_y - i + 1) + j;
594: }
596: if (n2 >= 0) { /* right below */
597: x_t = lx[n2 % m];
598: y_t = ly[(n2/m)];
599: s_t = bases[n2] + x_t*y_t - (s_y+1-i)*x_t;
600: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
601: }
602: }
604: for (i=0; i<y; i++) {
605: if (n3 >= 0) { /* directly left */
606: x_t = lx[n3 % m];
607: /* y_t = y; */
608: s_t = bases[n3] + (i+1)*x_t - s_x;
609: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
610: } else if (bx == DM_BOUNDARY_MIRROR) {
611: for (j=0; j<s_x; j++) idx[nn++] = bases[rank] + x*i + s_x - j;
612: }
614: for (j=0; j<x; j++) idx[nn++] = xbase++; /* interior */
616: if (n5 >= 0) { /* directly right */
617: x_t = lx[n5 % m];
618: /* y_t = y; */
619: s_t = bases[n5] + (i)*x_t;
620: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
621: } else if (bx == DM_BOUNDARY_MIRROR) {
622: for (j=0; j<s_x; j++) idx[nn++] = bases[rank] + x*(i + 1) - 2 - j;
623: }
624: }
626: for (i=1; i<=s_y; i++) {
627: if (n6 >= 0) { /* left above */
628: x_t = lx[n6 % m];
629: /* y_t = ly[(n6/m)]; */
630: s_t = bases[n6] + (i)*x_t - s_x;
631: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
632: }
634: if (n7 >= 0) { /* directly above */
635: x_t = x;
636: /* y_t = ly[(n7/m)]; */
637: s_t = bases[n7] + (i-1)*x_t;
638: for (j=0; j<x_t; j++) idx[nn++] = s_t++;
639: } else if (by == DM_BOUNDARY_MIRROR) {
640: for (j=0; j<x; j++) idx[nn++] = bases[rank] + x*(y - i - 1) + j;
641: }
643: if (n8 >= 0) { /* right above */
644: x_t = lx[n8 % m];
645: /* y_t = ly[(n8/m)]; */
646: s_t = bases[n8] + (i-1)*x_t;
647: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
648: }
649: }
651: ISCreateBlock(comm,dof,nn,idx,PETSC_USE_POINTER,&from);
652: VecScatterCreate(global,from,local,to,>ol);
653: PetscLogObjectParent((PetscObject)da,(PetscObject)gtol);
654: ISDestroy(&to);
655: ISDestroy(&from);
657: if (stencil_type == DMDA_STENCIL_STAR) {
658: n0 = sn0; n2 = sn2; n6 = sn6; n8 = sn8;
659: }
661: if (((stencil_type == DMDA_STENCIL_STAR) ||
662: (bx && bx != DM_BOUNDARY_PERIODIC) ||
663: (by && by != DM_BOUNDARY_PERIODIC))) {
664: /*
665: Recompute the local to global mappings, this time keeping the
666: information about the cross corner processor numbers and any ghosted
667: but not periodic indices.
668: */
669: nn = 0;
670: xbase = bases[rank];
671: for (i=1; i<=s_y; i++) {
672: if (n0 >= 0) { /* left below */
673: x_t = lx[n0 % m];
674: y_t = ly[(n0/m)];
675: s_t = bases[n0] + x_t*y_t - (s_y-i)*x_t - s_x;
676: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
677: } else if (xs-Xs > 0 && ys-Ys > 0) {
678: for (j=0; j<s_x; j++) idx[nn++] = -1;
679: }
680: if (n1 >= 0) { /* directly below */
681: x_t = x;
682: y_t = ly[(n1/m)];
683: s_t = bases[n1] + x_t*y_t - (s_y+1-i)*x_t;
684: for (j=0; j<x_t; j++) idx[nn++] = s_t++;
685: } else if (ys-Ys > 0) {
686: if (by == DM_BOUNDARY_MIRROR) {
687: for (j=0; j<x; j++) idx[nn++] = bases[rank] + x*(s_y - i + 1) + j;
688: } else {
689: for (j=0; j<x; j++) idx[nn++] = -1;
690: }
691: }
692: if (n2 >= 0) { /* right below */
693: x_t = lx[n2 % m];
694: y_t = ly[(n2/m)];
695: s_t = bases[n2] + x_t*y_t - (s_y+1-i)*x_t;
696: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
697: } else if (Xe-xe> 0 && ys-Ys > 0) {
698: for (j=0; j<s_x; j++) idx[nn++] = -1;
699: }
700: }
702: for (i=0; i<y; i++) {
703: if (n3 >= 0) { /* directly left */
704: x_t = lx[n3 % m];
705: /* y_t = y; */
706: s_t = bases[n3] + (i+1)*x_t - s_x;
707: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
708: } else if (xs-Xs > 0) {
709: if (bx == DM_BOUNDARY_MIRROR) {
710: for (j=0; j<s_x; j++) idx[nn++] = bases[rank] + x*i + s_x - j;
711: } else {
712: for (j=0; j<s_x; j++) idx[nn++] = -1;
713: }
714: }
716: for (j=0; j<x; j++) idx[nn++] = xbase++; /* interior */
718: if (n5 >= 0) { /* directly right */
719: x_t = lx[n5 % m];
720: /* y_t = y; */
721: s_t = bases[n5] + (i)*x_t;
722: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
723: } else if (Xe-xe > 0) {
724: if (bx == DM_BOUNDARY_MIRROR) {
725: for (j=0; j<s_x; j++) idx[nn++] = bases[rank] + x*(i + 1) - 2 - j;
726: } else {
727: for (j=0; j<s_x; j++) idx[nn++] = -1;
728: }
729: }
730: }
732: for (i=1; i<=s_y; i++) {
733: if (n6 >= 0) { /* left above */
734: x_t = lx[n6 % m];
735: /* y_t = ly[(n6/m)]; */
736: s_t = bases[n6] + (i)*x_t - s_x;
737: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
738: } else if (xs-Xs > 0 && Ye-ye > 0) {
739: for (j=0; j<s_x; j++) idx[nn++] = -1;
740: }
741: if (n7 >= 0) { /* directly above */
742: x_t = x;
743: /* y_t = ly[(n7/m)]; */
744: s_t = bases[n7] + (i-1)*x_t;
745: for (j=0; j<x_t; j++) idx[nn++] = s_t++;
746: } else if (Ye-ye > 0) {
747: if (by == DM_BOUNDARY_MIRROR) {
748: for (j=0; j<x; j++) idx[nn++] = bases[rank] + x*(y - i - 1) + j;
749: } else {
750: for (j=0; j<x; j++) idx[nn++] = -1;
751: }
752: }
753: if (n8 >= 0) { /* right above */
754: x_t = lx[n8 % m];
755: /* y_t = ly[(n8/m)]; */
756: s_t = bases[n8] + (i-1)*x_t;
757: for (j=0; j<s_x; j++) idx[nn++] = s_t++;
758: } else if (Xe-xe > 0 && Ye-ye > 0) {
759: for (j=0; j<s_x; j++) idx[nn++] = -1;
760: }
761: }
762: }
763: /*
764: Set the local to global ordering in the global vector, this allows use
765: of VecSetValuesLocal().
766: */
767: ISLocalToGlobalMappingCreate(comm,dof,nn,idx,PETSC_OWN_POINTER,&da->ltogmap);
768: PetscLogObjectParent((PetscObject)da,(PetscObject)da->ltogmap);
770: PetscFree2(bases,ldims);
771: dd->m = m; dd->n = n;
772: /* note petsc expects xs/xe/Xs/Xe to be multiplied by #dofs in many places */
773: dd->xs = xs*dof; dd->xe = xe*dof; dd->ys = ys; dd->ye = ye; dd->zs = 0; dd->ze = 1;
774: dd->Xs = Xs*dof; dd->Xe = Xe*dof; dd->Ys = Ys; dd->Ye = Ye; dd->Zs = 0; dd->Ze = 1;
776: VecDestroy(&local);
777: VecDestroy(&global);
779: dd->gtol = gtol;
780: dd->base = base;
781: da->ops->view = DMView_DA_2d;
782: dd->ltol = NULL;
783: dd->ao = NULL;
784: return(0);
785: }
789: /*@C
790: DMDACreate2d - Creates an object that will manage the communication of two-dimensional
791: regular array data that is distributed across some processors.
793: Collective on MPI_Comm
795: Input Parameters:
796: + comm - MPI communicator
797: . bx,by - type of ghost nodes the array have.
798: Use one of DM_BOUNDARY_NONE, DM_BOUNDARY_GHOSTED, DM_BOUNDARY_PERIODIC.
799: . stencil_type - stencil type. Use either DMDA_STENCIL_BOX or DMDA_STENCIL_STAR.
800: . M,N - global dimension in each direction of the array (use -M and or -N to indicate that it may be set to a different value
801: from the command line with -da_grid_x <M> -da_grid_y <N>)
802: . m,n - corresponding number of processors in each dimension
803: (or PETSC_DECIDE to have calculated)
804: . dof - number of degrees of freedom per node
805: . s - stencil width
806: - lx, ly - arrays containing the number of nodes in each cell along
807: the x and y coordinates, or NULL. If non-null, these
808: must be of length as m and n, and the corresponding
809: m and n cannot be PETSC_DECIDE. The sum of the lx[] entries
810: must be M, and the sum of the ly[] entries must be N.
812: Output Parameter:
813: . da - the resulting distributed array object
815: Options Database Key:
816: + -dm_view - Calls DMView() at the conclusion of DMDACreate2d()
817: . -da_grid_x <nx> - number of grid points in x direction, if M < 0
818: . -da_grid_y <ny> - number of grid points in y direction, if N < 0
819: . -da_processors_x <nx> - number of processors in x direction
820: . -da_processors_y <ny> - number of processors in y direction
821: . -da_refine_x <rx> - refinement ratio in x direction
822: . -da_refine_y <ry> - refinement ratio in y direction
823: - -da_refine <n> - refine the DMDA n times before creating, if M or N < 0
826: Level: beginner
828: Notes:
829: The stencil type DMDA_STENCIL_STAR with width 1 corresponds to the
830: standard 5-pt stencil, while DMDA_STENCIL_BOX with width 1 denotes
831: the standard 9-pt stencil.
833: The array data itself is NOT stored in the DMDA, it is stored in Vec objects;
834: The appropriate vector objects can be obtained with calls to DMCreateGlobalVector()
835: and DMCreateLocalVector() and calls to VecDuplicate() if more are needed.
837: .keywords: distributed array, create, two-dimensional
839: .seealso: DMDestroy(), DMView(), DMDACreate1d(), DMDACreate3d(), DMGlobalToLocalBegin(), DMDAGetRefinementFactor(),
840: DMGlobalToLocalEnd(), DMLocalToGlobalBegin(), DMLocalToLocalBegin(), DMLocalToLocalEnd(), DMDASetRefinementFactor(),
841: DMDAGetInfo(), DMCreateGlobalVector(), DMCreateLocalVector(), DMDACreateNaturalVector(), DMLoad(), DMDAGetOwnershipRanges()
843: @*/
845: PetscErrorCode DMDACreate2d(MPI_Comm comm,DMBoundaryType bx,DMBoundaryType by,DMDAStencilType stencil_type,
846: PetscInt M,PetscInt N,PetscInt m,PetscInt n,PetscInt dof,PetscInt s,const PetscInt lx[],const PetscInt ly[],DM *da)
847: {
851: DMDACreate(comm, da);
852: DMDASetDim(*da, 2);
853: DMDASetSizes(*da, M, N, 1);
854: DMDASetNumProcs(*da, m, n, PETSC_DECIDE);
855: DMDASetBoundaryType(*da, bx, by, DM_BOUNDARY_NONE);
856: DMDASetDof(*da, dof);
857: DMDASetStencilType(*da, stencil_type);
858: DMDASetStencilWidth(*da, s);
859: DMDASetOwnershipRanges(*da, lx, ly, NULL);
860: /* This violates the behavior for other classes, but right now users expect negative dimensions to be handled this way */
861: DMSetFromOptions(*da);
862: DMSetUp(*da);
863: return(0);
864: }