# Diff of /trunk/finley/src/IndexList.c

trunk/esys2/finley/src/finleyC/IndexList.c revision 97 by jgs, Tue Dec 14 05:39:33 2004 UTC trunk/finley/src/IndexList.c revision 1736 by gross, Fri Aug 29 02:23:16 2008 UTC
# Line 1  Line 1
/* \$Id\$ */
1
2  /**************************************************************/  /* \$Id\$ */
3
4  /* Finley: Converting an element list into a matrix shape     */  /*******************************************************
5     *
6     *           Copyright 2003-2007 by ACceSS MNRF
7     *       Copyright 2007 by University of Queensland
8     *
9     *                http://esscc.uq.edu.au
10     *        Primary Business: Queensland, Australia
13     *
14     *******************************************************/
15
16  /**************************************************************/  /**************************************************************/
17
18  /* Copyrights by ACcESS Australia 2003,2004 */  /* Finley: Converting an element list into a matrix shape     */
/* Author: gross@access.edu.au */
19
20  /**************************************************************/  /**************************************************************/
21
#include "Finley.h"
#include "ElementFile.h"
#include "System.h"
22  #include "IndexList.h"  #include "IndexList.h"
23
24    /* Translate from distributed/local array indices to global indices */
25
26  /**************************************************************/  /**************************************************************/
27  /* inserts the contributions from the element matrices of elements  /* inserts the contributions from the element matrices of elements
28     into the row index col. If symmetric is set, only the upper     into the row index col. If symmetric is set, only the upper
29     triangle of the matrix is stored. */     triangle of the matrix is stored. */
30
31  void Finley_IndexList_insertElements(Finley_IndexList* index_list, Finley_ElementFile* elements,  void Finley_IndexList_insertElements(Finley_IndexList* index_list, Finley_ElementFile* elements,
32                                         int reduce_row_order, maybelong* row_Label,                                         bool_t reduce_row_order, index_t* row_map,
33                                         int reduce_col_order, maybelong* col_Label) {                                         bool_t reduce_col_order, index_t* col_map) {
34    maybelong e,kr,kc,NN_row,NN_col,i,icol,irow,color;    /* index_list is an array of linked lists. Each entry is a row (DOF) and contains the indices to the non-zero columns */
35      index_t color, *id=NULL;
36      dim_t e,kr,kc,NN_row,NN_col,i,icol,irow, NN, *row_node=NULL,*col_node=NULL;
37    if (elements!=NULL) {    if (elements!=NULL) {
38      maybelong NN=elements->ReferenceElement->Type->numNodes;      NN=elements->numNodes;
39      maybelong id[NN],*row_node,*col_node;      id=TMPMEMALLOC(NN, index_t);
40      for (i=0;i<NN;i++) id[i]=i;      if (! Finley_checkPtr(id) ) {
41      if (reduce_col_order) {         for (i=0;i<NN;i++) id[i]=i;
42         col_node=elements->ReferenceElement->Type->linearNodes;         if (reduce_col_order) {
43         NN_col=elements->LinearReferenceElement->Type->numNodes;            col_node=elements->ReferenceElement->Type->linearNodes;
44      } else {            NN_col=elements->LinearReferenceElement->Type->numNodes;
45         col_node=id;         } else {
46         NN_col=elements->ReferenceElement->Type->numNodes;            col_node=id;
47              NN_col=elements->ReferenceElement->Type->numNodes;
48           }
49           if (reduce_row_order) {
50              row_node=elements->ReferenceElement->Type->linearNodes;
51              NN_row=elements->LinearReferenceElement->Type->numNodes;
52           } else {
53              row_node=id;
54              NN_row=elements->ReferenceElement->Type->numNodes;
55           }
56           for (color=elements->minColor;color<=elements->maxColor;color++) {
57               #pragma omp for private(e,irow,kr,kc,icol) schedule(static)
58               for (e=0;e<elements->numElements;e++) {
59                   if (elements->Color[e]==color) {
60                       for (kr=0;kr<NN_row;kr++) {
61                         irow=row_map[elements->Nodes[INDEX2(row_node[kr],e,NN)]];
62                         for (kc=0;kc<NN_col;kc++) {
63                              icol=col_map[elements->Nodes[INDEX2(col_node[kc],e,NN)]];
64                              Finley_IndexList_insertIndex(&(index_list[irow]),icol);
65                         }
66                       }
67                   }
68               }
69           }
70           TMPMEMFREE(id);
71      }      }
72      if (reduce_row_order) {    }
73         row_node=elements->ReferenceElement->Type->linearNodes;    return;
74         NN_row=elements->LinearReferenceElement->Type->numNodes;  }
75      } else {
76         row_node=id;  void Finley_IndexList_insertElementsWithRowRange(Finley_IndexList* index_list, index_t firstRow, index_t lastRow,
77         NN_row=elements->ReferenceElement->Type->numNodes;                                                   Finley_ElementFile* elements, index_t* row_map, index_t* col_map)
78    {
79      index_t color;
80      dim_t e,kr,kc,icol,irow, NN;
81      if (elements!=NULL) {
82        NN=elements->numNodes;
83        for (color=elements->minColor;color<=elements->maxColor;color++) {
84               #pragma omp for private(e,irow,kr,kc,icol) schedule(static)
85               for (e=0;e<elements->numElements;e++) {
86                   if (elements->Color[e]==color) {
87                       for (kr=0;kr<NN;kr++) {
88                         irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
89                         if ((firstRow<=irow) && (irow < lastRow)) {
90                              irow-=firstRow;
91                              for (kc=0;kc<NN;kc++) {
92                                  icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
93                                  Finley_IndexList_insertIndex(&(index_list[irow]),icol);
94                              }
95                          }
96                      }
97                   }
98               }
99      }      }
100      for (color=0;color<elements->numColors;color++) {    }
101          #pragma omp for private(e,irow,kr,kc,icol) schedule(static)  }
102          for (e=0;e<elements->numElements;e++) {  void Finley_IndexList_insertElementsWithRowRangeNoMainDiagonal(Finley_IndexList* index_list, index_t firstRow, index_t lastRow,
103              if (elements->Color[e]==color) {                                                                Finley_ElementFile* elements, index_t* row_map, index_t* col_map)
104                  for (kr=0;kr<NN_row;kr++) {  {
105                    irow=row_Label[elements->Nodes[INDEX2(row_node[kr],e,NN)]];    index_t color;
106                    for (kc=0;kc<NN_col;kc++) {    dim_t e,kr,kc,icol,irow, NN,irow_loc;
107                         icol=col_Label[elements->Nodes[INDEX2(col_node[kc],e,NN)]];    if (elements!=NULL) {
108                         Finley_IndexList_insertIndex(&(index_list[irow]),icol);      NN=elements->numNodes;
109        for (color=elements->minColor;color<=elements->maxColor;color++) {
110               #pragma omp for private(e,irow,kr,kc,icol,irow_loc) schedule(static)
111               for (e=0;e<elements->numElements;e++) {
112                   if (elements->Color[e]==color) {
113                       for (kr=0;kr<NN;kr++) {
114                         irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
115                         if ((firstRow<=irow) && (irow < lastRow)) {
116                              irow_loc=irow-firstRow;
117                              for (kc=0;kc<NN;kc++) {
118                                  icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
119                                  if (icol != irow) Finley_IndexList_insertIndex(&(index_list[irow_loc]),icol);
120                              }
121                          }
122                    }                    }
123                  }                 }
124              }             }
125          }      }
}
126    }    }
return;
127  }  }
128
129  /* inserts row index row into the Finley_IndexList in if it does not exist */  /* inserts row index row into the Finley_IndexList in if it does not exist */
130
131  void Finley_IndexList_insertIndex(Finley_IndexList* in, maybelong index) {  void Finley_IndexList_insertIndex(Finley_IndexList* in, index_t index) {
132    int i;    dim_t i;
133    /* is index in in? */    /* is index in in? */
134    for (i=0;i<in->n;i++) {    for (i=0;i<in->n;i++) {
135      if (in->index[i]==index)  return;      if (in->index[i]==index)  return;
# Line 89  void Finley_IndexList_insertIndex(Finley Line 153  void Finley_IndexList_insertIndex(Finley
153
154  /* counts the number of row indices in the Finley_IndexList in */  /* counts the number of row indices in the Finley_IndexList in */
155
156  int Finley_IndexList_count(Finley_IndexList* in) {  dim_t Finley_IndexList_count(Finley_IndexList* in, index_t range_min,index_t range_max) {
157      dim_t i;
158      dim_t out=0;
159      register index_t itmp;
160    if (in==NULL) {    if (in==NULL) {
161       return 0;       return 0;
162    } else {    } else {
163       return (in->n)+Finley_IndexList_count(in->extension);      for (i=0;i<in->n;i++) {
164              itmp=in->index[i];
165              if ((itmp>=range_min) && (range_max>itmp)) ++out;
166        }
167         return out+Finley_IndexList_count(in->extension, range_min,range_max);
168    }    }
169  }  }
170
171  /* count the number of row indices in the Finley_IndexList in */  /* count the number of row indices in the Finley_IndexList in */
172
173  void Finley_IndexList_toArray(Finley_IndexList* in, maybelong* array) {  void Finley_IndexList_toArray(Finley_IndexList* in, index_t* array, index_t range_min,index_t range_max, index_t index_offset) {
174    int i;    dim_t i, ptr;
175      register index_t itmp;
176    if (in!=NULL) {    if (in!=NULL) {
177      for (i=0;i<in->n;i++) array[i]=in->index[i]+INDEX_OFFSET;      ptr=0;
178      Finley_IndexList_toArray(in->extension,&(array[in->n]));      for (i=0;i<in->n;i++) {
179              itmp=in->index[i];
180              if ((itmp>=range_min) && (range_max>itmp)) {
181                 array[ptr]=itmp+index_offset;
182                 ptr++;
183              }
184
185        }
186        Finley_IndexList_toArray(in->extension,&(array[ptr]), range_min, range_max, index_offset);
187    }    }
188  }  }
189
# Line 116  void Finley_IndexList_free(Finley_IndexL Line 196  void Finley_IndexList_free(Finley_IndexL
196    }    }
197  }  }
198
199  /*  /* creates a Paso_pattern from a range of indices */
200   * \$Log\$  Paso_Pattern* Finley_IndexList_createPattern(dim_t n0, dim_t n,Finley_IndexList* index_list,index_t range_min,index_t range_max,index_t index_offset)
201   * Revision 1.2  2004/12/14 05:39:30  jgs  {
202   * *** empty log message ***     dim_t *ptr=NULL;
203   *     register dim_t s,i,itmp;
204   * Revision 1.1.1.1.2.2  2004/11/24 01:37:13  gross     index_t *index=NULL;
205   * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now     Paso_Pattern* out=NULL;
206   *
207   * Revision 1.1.1.1.2.1  2004/11/12 06:58:18  gross     ptr=MEMALLOC(n+1-n0,index_t);
208   * a lot of changes to get the linearPDE class running: most important change is that there is no matrix format exposed to the user anymore. the format is chosen by the Domain according to the solver and symmetry     if (! Finley_checkPtr(ptr) ) {
209   *         /* get the number of connections per row */
210   * Revision 1.1.1.1  2004/10/26 06:53:57  jgs         #pragma omp parallel for schedule(static) private(i)
211   * initial import of project esys2         for(i=n0;i<n;++i) {
212   *                ptr[i-n0]=Finley_IndexList_count(&index_list[i],range_min,range_max);
213   * Revision 1.1.2.2  2004/10/26 06:36:39  jgs         }
214   * committing Lutz's changes to branch jgs         /* accumulate ptr */
215   *         s=0;
216   * Revision 1.2  2004/10/13 01:53:42  gross         for(i=n0;i<n;++i) {
217   * bug in CSC assembling fixed                 itmp=ptr[i-n0];
218   *                 ptr[i-n0]=s;
219   * Revision 1.1  2004/07/02 04:21:13  gross                 s+=itmp;
220   * Finley C code has been included         }
221   *         ptr[n-n0]=s;
222   *         /* fill index */
223   */         index=MEMALLOC(ptr[n-n0],index_t);
224           if (! Finley_checkPtr(index)) {
225                  #pragma omp parallel for schedule(static)
226                  for(i=n0;i<n;++i) {
227                      Finley_IndexList_toArray(&index_list[i],&index[ptr[i-n0]],range_min,range_max,index_offset);
228                  }
229                  out=Paso_Pattern_alloc(PATTERN_FORMAT_DEFAULT,1,1,n-n0,range_max+index_offset,ptr,index);
230           }
231      }
232      if (! Finley_noError()) {
233            MEMFREE(ptr);
234            MEMFREE(index);
235            Paso_Pattern_free(out);
236      }
237      return out;
238    }

Legend:
 Removed from v.97 changed lines Added in v.1736