/[escript]/trunk/dudley/src/IndexList.cpp
ViewVC logotype

Annotation of /trunk/dudley/src/IndexList.cpp

Parent Directory Parent Directory | Revision Log Revision Log


Revision 3221 - (hide annotations)
Wed Sep 29 01:00:21 2010 UTC (8 years, 11 months ago) by jfenwick
Original Path: branches/domexper/dudley/src/IndexList.c
File MIME type: text/plain
File size: 7707 byte(s)
Comment stripping

1 jgs 82
2 ksteube 1312 /*******************************************************
3 ksteube 1811 *
4 jfenwick 2881 * Copyright (c) 2003-2010 by University of Queensland
5 ksteube 1811 * Earth Systems Science Computational Center (ESSCC)
6     * http://www.uq.edu.au/esscc
7     *
8     * Primary Business: Queensland, Australia
9     * Licensed under the Open Software License version 3.0
10     * http://www.opensource.org/licenses/osl-3.0.php
11     *
12     *******************************************************/
13 jgs 82
14 ksteube 1811
15 jgs 82 /**************************************************************/
16    
17 jfenwick 3086 /* Dudley: Converting an element list into a matrix shape */
18 jgs 82
19     /**************************************************************/
20    
21     #include "IndexList.h"
22    
23 ksteube 1312 /* Translate from distributed/local array indices to global indices */
24    
25 jgs 82 /**************************************************************/
26     /* inserts the contributions from the element matrices of elements
27     into the row index col. If symmetric is set, only the upper
28     triangle of the matrix is stored. */
29    
30 jfenwick 3086 void Dudley_IndexList_insertElements(Dudley_IndexList* index_list, Dudley_ElementFile* elements,
31 ksteube 1312 bool_t reduce_row_order, index_t* row_map,
32 jfenwick 3141 bool_t reduce_col_order, index_t* col_map)
33     {
34 ksteube 1312 /* index_list is an array of linked lists. Each entry is a row (DOF) and contains the indices to the non-zero columns */
35 gross 2748 index_t color;
36 jfenwick 3145 dim_t e, kr, kc, NN_row, NN_col, icol, irow, NN;
37 jfenwick 3141 if (elements!=NULL)
38     {
39 ksteube 1312 NN=elements->numNodes;
40 jfenwick 3216 NN_col=(elements->numShapes);
41     NN_row=(elements->numShapes) ;
42 gross 2748
43 jfenwick 3141 for (color=elements->minColor;color<=elements->maxColor;color++)
44     {
45 jfenwick 3161 #pragma omp for private(e,irow,kr,kc,icol) schedule(static)
46 jfenwick 3141 for (e=0;e<elements->numElements;e++)
47     {
48     if (elements->Color[e]==color)
49     {
50     for (kr=0;kr<NN_row;kr++)
51     {
52 jfenwick 3145 irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
53 jfenwick 3141 for (kc=0;kc<NN_col;kc++)
54     {
55 jfenwick 3145 icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
56 jfenwick 3141 Dudley_IndexList_insertIndex(&(index_list[irow]),icol);
57     }
58     }
59     }
60 gross 2748 }
61 jfenwick 3144 }
62 jgs 82 }
63     return;
64     }
65    
66 gross 2748
67 jfenwick 3086 void Dudley_IndexList_insertElementsWithRowRange(Dudley_IndexList* index_list, index_t firstRow, index_t lastRow,
68     Dudley_ElementFile* elements, index_t* row_map, index_t* col_map)
69 ksteube 1312 {
70 gross 2748 /* this does not resolve macro elements */
71     index_t color;
72 phornby 1628 dim_t e,kr,kc,icol,irow, NN;
73 ksteube 1312 if (elements!=NULL) {
74     NN=elements->numNodes;
75     for (color=elements->minColor;color<=elements->maxColor;color++) {
76     #pragma omp for private(e,irow,kr,kc,icol) schedule(static)
77     for (e=0;e<elements->numElements;e++) {
78     if (elements->Color[e]==color) {
79     for (kr=0;kr<NN;kr++) {
80     irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
81     if ((firstRow<=irow) && (irow < lastRow)) {
82     irow-=firstRow;
83     for (kc=0;kc<NN;kc++) {
84     icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
85 jfenwick 3086 Dudley_IndexList_insertIndex(&(index_list[irow]),icol);
86 ksteube 1312 }
87     }
88     }
89     }
90     }
91     }
92     }
93     }
94 jfenwick 3086 void Dudley_IndexList_insertElementsWithRowRangeNoMainDiagonal(Dudley_IndexList* index_list, index_t firstRow, index_t lastRow,
95     Dudley_ElementFile* elements, index_t* row_map, index_t* col_map)
96 gross 1722 {
97 gross 2748 /* this does not resolve macro elements */
98 gross 1722 index_t color;
99     dim_t e,kr,kc,icol,irow, NN,irow_loc;
100     if (elements!=NULL) {
101     NN=elements->numNodes;
102     for (color=elements->minColor;color<=elements->maxColor;color++) {
103     #pragma omp for private(e,irow,kr,kc,icol,irow_loc) schedule(static)
104     for (e=0;e<elements->numElements;e++) {
105     if (elements->Color[e]==color) {
106     for (kr=0;kr<NN;kr++) {
107     irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
108     if ((firstRow<=irow) && (irow < lastRow)) {
109     irow_loc=irow-firstRow;
110     for (kc=0;kc<NN;kc++) {
111     icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
112 jfenwick 3086 if (icol != irow) Dudley_IndexList_insertIndex(&(index_list[irow_loc]),icol);
113 gross 1722 }
114     }
115     }
116     }
117     }
118     }
119     }
120     }
121 ksteube 1312
122 jfenwick 3086 /* inserts row index row into the Dudley_IndexList in if it does not exist */
123 jgs 82
124 jfenwick 3086 void Dudley_IndexList_insertIndex(Dudley_IndexList* in, index_t index) {
125 jgs 123 dim_t i;
126 jgs 82 /* is index in in? */
127     for (i=0;i<in->n;i++) {
128 jgs 102 if (in->index[i]==index) return;
129 jgs 82 }
130     /* index could not be found */
131     if (in->n==INDEXLIST_LENGTH) {
132     /* if in->index is full check the extension */
133     if (in->extension==NULL) {
134 jfenwick 3086 in->extension=TMPMEMALLOC(1,Dudley_IndexList);
135     if (Dudley_checkPtr(in->extension)) return;
136 jgs 82 in->extension->n=0;
137     in->extension->extension=NULL;
138     }
139 jfenwick 3086 Dudley_IndexList_insertIndex(in->extension,index);
140 jgs 82 } else {
141     /* insert index into in->index*/
142     in->index[in->n]=index;
143     in->n++;
144     }
145     }
146    
147 jfenwick 3086 /* counts the number of row indices in the Dudley_IndexList in */
148 jgs 82
149 jfenwick 3086 dim_t Dudley_IndexList_count(Dudley_IndexList* in, index_t range_min,index_t range_max) {
150 ksteube 1312 dim_t i;
151     dim_t out=0;
152     register index_t itmp;
153 jgs 82 if (in==NULL) {
154     return 0;
155     } else {
156 ksteube 1312 for (i=0;i<in->n;i++) {
157     itmp=in->index[i];
158     if ((itmp>=range_min) && (range_max>itmp)) ++out;
159     }
160 jfenwick 3086 return out+Dudley_IndexList_count(in->extension, range_min,range_max);
161 jgs 82 }
162     }
163    
164 jfenwick 3086 /* count the number of row indices in the Dudley_IndexList in */
165 jgs 82
166 jfenwick 3086 void Dudley_IndexList_toArray(Dudley_IndexList* in, index_t* array, index_t range_min,index_t range_max, index_t index_offset) {
167 ksteube 1312 dim_t i, ptr;
168     register index_t itmp;
169 jgs 82 if (in!=NULL) {
170 ksteube 1312 ptr=0;
171     for (i=0;i<in->n;i++) {
172     itmp=in->index[i];
173     if ((itmp>=range_min) && (range_max>itmp)) {
174     array[ptr]=itmp+index_offset;
175     ptr++;
176     }
177    
178     }
179 jfenwick 3086 Dudley_IndexList_toArray(in->extension,&(array[ptr]), range_min, range_max, index_offset);
180 jgs 82 }
181     }
182    
183 jfenwick 3086 /* deallocates the Dudley_IndexList in by recursive calls */
184 jgs 82
185 jfenwick 3086 void Dudley_IndexList_free(Dudley_IndexList* in) {
186 jgs 82 if (in!=NULL) {
187 jfenwick 3086 Dudley_IndexList_free(in->extension);
188 jgs 82 TMPMEMFREE(in);
189     }
190     }
191    
192 ksteube 1312 /* creates a Paso_pattern from a range of indices */
193 jfenwick 3086 Paso_Pattern* Dudley_IndexList_createPattern(dim_t n0, dim_t n,Dudley_IndexList* index_list,index_t range_min,index_t range_max,index_t index_offset)
194 ksteube 1312 {
195     dim_t *ptr=NULL;
196     register dim_t s,i,itmp;
197     index_t *index=NULL;
198     Paso_Pattern* out=NULL;
199    
200 gross 1552 ptr=MEMALLOC(n+1-n0,index_t);
201 jfenwick 3086 if (! Dudley_checkPtr(ptr) ) {
202 ksteube 1312 /* get the number of connections per row */
203     #pragma omp parallel for schedule(static) private(i)
204 gross 1552 for(i=n0;i<n;++i) {
205 jfenwick 3086 ptr[i-n0]=Dudley_IndexList_count(&index_list[i],range_min,range_max);
206 ksteube 1312 }
207     /* accumulate ptr */
208     s=0;
209 gross 1552 for(i=n0;i<n;++i) {
210     itmp=ptr[i-n0];
211     ptr[i-n0]=s;
212 ksteube 1312 s+=itmp;
213     }
214 gross 1552 ptr[n-n0]=s;
215 ksteube 1312 /* fill index */
216 gross 1552 index=MEMALLOC(ptr[n-n0],index_t);
217 jfenwick 3086 if (! Dudley_checkPtr(index)) {
218 ksteube 1312 #pragma omp parallel for schedule(static)
219 gross 1552 for(i=n0;i<n;++i) {
220 jfenwick 3086 Dudley_IndexList_toArray(&index_list[i],&index[ptr[i-n0]],range_min,range_max,index_offset);
221 ksteube 1312 }
222 gross 2551 out=Paso_Pattern_alloc(PATTERN_FORMAT_DEFAULT,n-n0,range_max+index_offset,ptr,index);
223 ksteube 1312 }
224     }
225 jfenwick 3086 if (! Dudley_noError()) {
226 ksteube 1312 MEMFREE(ptr);
227     MEMFREE(index);
228     Paso_Pattern_free(out);
229     }
230     return out;
231     }

Properties

Name Value
svn:eol-style native
svn:keywords Author Date Id Revision

  ViewVC Help
Powered by ViewVC 1.1.26