# Diff of /branches/domexper/dudley/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 1628 by phornby, Fri Jul 11 13:12:46 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
11     *  Licensed under the Open Software License version 3.0
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      }      }
if (reduce_row_order) {
row_node=elements->ReferenceElement->Type->linearNodes;
NN_row=elements->LinearReferenceElement->Type->numNodes;
} else {
row_node=id;
NN_row=elements->ReferenceElement->Type->numNodes;
}
for (color=0;color<elements->numColors;color++) {
#pragma omp for private(e,irow,kr,kc,icol) schedule(static)
for (e=0;e<elements->numElements;e++) {
if (elements->Color[e]==color) {
for (kr=0;kr<NN_row;kr++) {
irow=row_Label[elements->Nodes[INDEX2(row_node[kr],e,NN)]];
for (kc=0;kc<NN_col;kc++) {
icol=col_Label[elements->Nodes[INDEX2(col_node[kc],e,NN)]];
Finley_IndexList_insertIndex(&(index_list[irow]),icol);
}
}
}
}
}
72    }    }
73    return;    return;
74  }  }
75
76    void Finley_IndexList_insertElementsWithRowRange(Finley_IndexList* index_list, index_t firstRow, index_t lastRow,
77                                                     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      }
101    }
102
103  /* 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 */
104
105  void Finley_IndexList_insertIndex(Finley_IndexList* in, maybelong index) {  void Finley_IndexList_insertIndex(Finley_IndexList* in, index_t index) {
106    int i;    dim_t i;
107    /* is index in in? */    /* is index in in? */
108    for (i=0;i<in->n;i++) {    for (i=0;i<in->n;i++) {
109      if (in->index[i]==index)  return;      if (in->index[i]==index)  return;
# Line 89  void Finley_IndexList_insertIndex(Finley Line 127  void Finley_IndexList_insertIndex(Finley
127
128  /* counts the number of row indices in the Finley_IndexList in */  /* counts the number of row indices in the Finley_IndexList in */
129
130  int Finley_IndexList_count(Finley_IndexList* in) {  dim_t Finley_IndexList_count(Finley_IndexList* in, index_t range_min,index_t range_max) {
131      dim_t i;
132      dim_t out=0;
133      register index_t itmp;
134    if (in==NULL) {    if (in==NULL) {
135       return 0;       return 0;
136    } else {    } else {
137       return (in->n)+Finley_IndexList_count(in->extension);      for (i=0;i<in->n;i++) {
138              itmp=in->index[i];
139              if ((itmp>=range_min) && (range_max>itmp)) ++out;
140        }
141         return out+Finley_IndexList_count(in->extension, range_min,range_max);
142    }    }
143  }  }
144
145  /* count the number of row indices in the Finley_IndexList in */  /* count the number of row indices in the Finley_IndexList in */
146
147  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) {
148    int i;    dim_t i, ptr;
149      register index_t itmp;
150    if (in!=NULL) {    if (in!=NULL) {
151      for (i=0;i<in->n;i++) array[i]=in->index[i]+INDEX_OFFSET;      ptr=0;
152      Finley_IndexList_toArray(in->extension,&(array[in->n]));      for (i=0;i<in->n;i++) {
153              itmp=in->index[i];
154              if ((itmp>=range_min) && (range_max>itmp)) {
155                 array[ptr]=itmp+index_offset;
156                 ptr++;
157              }
158
159        }
160        Finley_IndexList_toArray(in->extension,&(array[ptr]), range_min, range_max, index_offset);
161    }    }
162  }  }
163
# Line 116  void Finley_IndexList_free(Finley_IndexL Line 170  void Finley_IndexList_free(Finley_IndexL
170    }    }
171  }  }
172
173  /*  /* creates a Paso_pattern from a range of indices */
174   * \$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)
175   * Revision 1.2  2004/12/14 05:39:30  jgs  {
176   * *** empty log message ***     dim_t *ptr=NULL;
177   *     register dim_t s,i,itmp;
178   * Revision 1.1.1.1.2.2  2004/11/24 01:37:13  gross     index_t *index=NULL;
179   * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now     Paso_Pattern* out=NULL;
180   *
181   * Revision 1.1.1.1.2.1  2004/11/12 06:58:18  gross     ptr=MEMALLOC(n+1-n0,index_t);
182   * 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) ) {
183   *         /* get the number of connections per row */
184   * Revision 1.1.1.1  2004/10/26 06:53:57  jgs         #pragma omp parallel for schedule(static) private(i)
185   * initial import of project esys2         for(i=n0;i<n;++i) {
186   *                ptr[i-n0]=Finley_IndexList_count(&index_list[i],range_min,range_max);
187   * Revision 1.1.2.2  2004/10/26 06:36:39  jgs         }
188   * committing Lutz's changes to branch jgs         /* accumulate ptr */
189   *         s=0;
190   * Revision 1.2  2004/10/13 01:53:42  gross         for(i=n0;i<n;++i) {
191   * bug in CSC assembling fixed                 itmp=ptr[i-n0];
192   *                 ptr[i-n0]=s;
193   * Revision 1.1  2004/07/02 04:21:13  gross                 s+=itmp;
194   * Finley C code has been included         }
195   *         ptr[n-n0]=s;
196   *         /* fill index */
197   */         index=MEMALLOC(ptr[n-n0],index_t);
198           if (! Finley_checkPtr(index)) {
199                  #pragma omp parallel for schedule(static)
200                  for(i=n0;i<n;++i) {
201                      Finley_IndexList_toArray(&index_list[i],&index[ptr[i-n0]],range_min,range_max,index_offset);
202                  }
203                  out=Paso_Pattern_alloc(PATTERN_FORMAT_DEFAULT,1,1,n-n0,ptr,index);
204           }
205      }
206      if (! Finley_noError()) {
207            MEMFREE(ptr);
208            MEMFREE(index);
209            Paso_Pattern_free(out);
210      }
211      return out;
212    }

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