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

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

Parent Directory Parent Directory | Revision Log Revision Log | View Patch Patch

trunk/finley/src/finley/IndexList.c revision 201 by jgs, Wed Nov 23 04:10:21 2005 UTC branches/domexper/dudley/src/IndexList.c revision 3152 by jfenwick, Fri Sep 3 05:48:31 2010 UTC
# Line 1  Line 1 
 /*  
  ******************************************************************************  
  *                                                                            *  
  *       COPYRIGHT  ACcESS 2003,2004,2005 -  All Rights Reserved              *  
  *                                                                            *  
  * This software is the property of ACcESS. No part of this code              *  
  * may be copied in any form or by any means without the expressed written    *  
  * consent of ACcESS.  Copying, use or modification of this software          *  
  * by any unauthorised person is illegal unless that person has a software    *  
  * license agreement with ACcESS.                                             *  
  *                                                                            *  
  ******************************************************************************  
 */  
1    
2  /**************************************************************/  /*******************************************************
3    *
4    * Copyright (c) 2003-2010 by University of Queensland
5    * 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    
 /* Finley: Converting an element list into a matrix shape     */  
14    
15  /**************************************************************/  /**************************************************************/
16    
17  /*  Author: gross@access.edu.au */  /* Dudley: Converting an element list into a matrix shape     */
 /*  Version: $Id$ */  
18    
19  /**************************************************************/  /**************************************************************/
20    
21  #include "IndexList.h"  #include "IndexList.h"
22    
23    /* Translate from distributed/local array indices to global indices */
24    
25  /**************************************************************/  /**************************************************************/
26  /* inserts the contributions from the element matrices of elements  /* inserts the contributions from the element matrices of elements
27     into the row index col. If symmetric is set, only the upper     into the row index col. If symmetric is set, only the upper
28     triangle of the matrix is stored. */     triangle of the matrix is stored. */
29    
30  void Finley_IndexList_insertElements(Finley_IndexList* index_list, Finley_ElementFile* elements,  void Dudley_IndexList_insertElements(Dudley_IndexList* index_list, Dudley_ElementFile* elements,
31                                         bool_t reduce_row_order, index_t* row_Label,                                         bool_t reduce_row_order, index_t* row_map,
32                                         bool_t reduce_col_order, index_t* col_Label) {                                         bool_t reduce_col_order, index_t* col_map)
33    {
34      /* 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;    index_t color;
36    dim_t e,kr,kc,NN_row,NN_col,i,icol,irow;    Dudley_ReferenceElement*refElement;
37      dim_t e, kr, kc, NN_row, NN_col, icol, irow, NN;
38      if (elements!=NULL)
39      {
40        NN=elements->numNodes;
41        refElement= Dudley_ReferenceElementSet_borrowReferenceElement(elements->referenceElementSet, FALSE);
42        NN_col=(refElement->BasisFunctions->Type->numShapes);
43        NN_col=(refElement->BasisFunctions->Type->numShapes);
44        NN_row=(refElement->BasisFunctions->Type->numShapes) ;
45    
46        for (color=elements->minColor;color<=elements->maxColor;color++)
47        {
48        #pragma omp for private(e,irow,kr,kc,icol,isub) schedule(static)
49        for (e=0;e<elements->numElements;e++)
50        {
51            if (elements->Color[e]==color)
52            {
53                for (kr=0;kr<NN_row;kr++)
54                {
55                    irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
56                    for (kc=0;kc<NN_col;kc++)
57                    {
58                    icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
59                    Dudley_IndexList_insertIndex(&(index_list[irow]),icol);
60                    }
61                }
62            }
63        }
64         }
65      }
66      return;
67    }
68    
69    
70    void Dudley_IndexList_insertElementsWithRowRange(Dudley_IndexList* index_list, index_t firstRow, index_t lastRow,
71                                                     Dudley_ElementFile* elements, index_t* row_map, index_t* col_map)
72    {
73    /* this does not resolve macro elements */
74        index_t color;
75      dim_t e,kr,kc,icol,irow, NN;
76    if (elements!=NULL) {    if (elements!=NULL) {
77      dim_t NN=elements->ReferenceElement->Type->numNodes;      NN=elements->numNodes;
78      index_t id[NN],*row_node,*col_node;      for (color=elements->minColor;color<=elements->maxColor;color++) {
79      for (i=0;i<NN;i++) id[i]=i;             #pragma omp for private(e,irow,kr,kc,icol) schedule(static)
80      if (reduce_col_order) {             for (e=0;e<elements->numElements;e++) {
81         col_node=elements->ReferenceElement->Type->linearNodes;                 if (elements->Color[e]==color) {
82         NN_col=elements->LinearReferenceElement->Type->numNodes;                     for (kr=0;kr<NN;kr++) {
83      } else {                       irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
84         col_node=id;                       if ((firstRow<=irow) && (irow < lastRow)) {
85         NN_col=elements->ReferenceElement->Type->numNodes;                            irow-=firstRow;
86      }                            for (kc=0;kc<NN;kc++) {
87      if (reduce_row_order) {                                icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
88         row_node=elements->ReferenceElement->Type->linearNodes;                                Dudley_IndexList_insertIndex(&(index_list[irow]),icol);
89         NN_row=elements->LinearReferenceElement->Type->numNodes;                            }
90      } else {                        }
91         row_node=id;                    }
92         NN_row=elements->ReferenceElement->Type->numNodes;                 }
93               }
94      }      }
95      }
96    }
97    void Dudley_IndexList_insertElementsWithRowRangeNoMainDiagonal(Dudley_IndexList* index_list, index_t firstRow, index_t lastRow,
98                                                                  Dudley_ElementFile* elements, index_t* row_map, index_t* col_map)
99    {
100      /* this does not resolve macro elements */
101      index_t color;
102      dim_t e,kr,kc,icol,irow, NN,irow_loc;
103      if (elements!=NULL) {
104        NN=elements->numNodes;
105      for (color=elements->minColor;color<=elements->maxColor;color++) {      for (color=elements->minColor;color<=elements->maxColor;color++) {
106          #pragma omp for private(e,irow,kr,kc,icol) schedule(static)             #pragma omp for private(e,irow,kr,kc,icol,irow_loc) schedule(static)
107          for (e=0;e<elements->numElements;e++) {             for (e=0;e<elements->numElements;e++) {
108              if (elements->Color[e]==color) {                 if (elements->Color[e]==color) {
109                  for (kr=0;kr<NN_row;kr++) {                     for (kr=0;kr<NN;kr++) {
110                    irow=row_Label[elements->Nodes[INDEX2(row_node[kr],e,NN)]];                       irow=row_map[elements->Nodes[INDEX2(kr,e,NN)]];
111                    for (kc=0;kc<NN_col;kc++) {                       if ((firstRow<=irow) && (irow < lastRow)) {
112                         icol=col_Label[elements->Nodes[INDEX2(col_node[kc],e,NN)]];                            irow_loc=irow-firstRow;
113                         Finley_IndexList_insertIndex(&(index_list[irow]),icol);                            for (kc=0;kc<NN;kc++) {
114                                  icol=col_map[elements->Nodes[INDEX2(kc,e,NN)]];
115                                  if (icol != irow) Dudley_IndexList_insertIndex(&(index_list[irow_loc]),icol);
116                              }
117                          }
118                    }                    }
119                  }                 }
120              }             }
121          }      }
       }  
122    }    }
   return;  
123  }  }
124    
125  /* inserts row index row into the Finley_IndexList in if it does not exist */  /* inserts row index row into the Dudley_IndexList in if it does not exist */
126    
127  void Finley_IndexList_insertIndex(Finley_IndexList* in, index_t index) {  void Dudley_IndexList_insertIndex(Dudley_IndexList* in, index_t index) {
128    dim_t i;    dim_t i;
129    /* is index in in? */    /* is index in in? */
130    for (i=0;i<in->n;i++) {    for (i=0;i<in->n;i++) {
# Line 84  void Finley_IndexList_insertIndex(Finley Line 134  void Finley_IndexList_insertIndex(Finley
134    if (in->n==INDEXLIST_LENGTH) {    if (in->n==INDEXLIST_LENGTH) {
135       /* if in->index is full check the extension */       /* if in->index is full check the extension */
136       if (in->extension==NULL) {       if (in->extension==NULL) {
137          in->extension=TMPMEMALLOC(1,Finley_IndexList);          in->extension=TMPMEMALLOC(1,Dudley_IndexList);
138          if (Finley_checkPtr(in->extension)) return;          if (Dudley_checkPtr(in->extension)) return;
139          in->extension->n=0;          in->extension->n=0;
140          in->extension->extension=NULL;          in->extension->extension=NULL;
141       }       }
142       Finley_IndexList_insertIndex(in->extension,index);       Dudley_IndexList_insertIndex(in->extension,index);
143    } else {    } else {
144       /* insert index into in->index*/       /* insert index into in->index*/
145       in->index[in->n]=index;       in->index[in->n]=index;
# Line 97  void Finley_IndexList_insertIndex(Finley Line 147  void Finley_IndexList_insertIndex(Finley
147    }    }
148  }  }
149    
150  /* counts the number of row indices in the Finley_IndexList in */  /* counts the number of row indices in the Dudley_IndexList in */
151    
152  dim_t Finley_IndexList_count(Finley_IndexList* in) {  dim_t Dudley_IndexList_count(Dudley_IndexList* in, index_t range_min,index_t range_max) {
153      dim_t i;
154      dim_t out=0;
155      register index_t itmp;
156    if (in==NULL) {    if (in==NULL) {
157       return 0;       return 0;
158    } else {    } else {
159       return (in->n)+Finley_IndexList_count(in->extension);      for (i=0;i<in->n;i++) {
160              itmp=in->index[i];
161              if ((itmp>=range_min) && (range_max>itmp)) ++out;
162        }
163         return out+Dudley_IndexList_count(in->extension, range_min,range_max);
164    }    }
165  }  }
166    
167  /* count the number of row indices in the Finley_IndexList in */  /* count the number of row indices in the Dudley_IndexList in */
168    
169  void Finley_IndexList_toArray(Finley_IndexList* in, index_t* array) {  void Dudley_IndexList_toArray(Dudley_IndexList* in, index_t* array, index_t range_min,index_t range_max, index_t index_offset) {
170    dim_t i;    dim_t i, ptr;
171      register index_t itmp;
172    if (in!=NULL) {    if (in!=NULL) {
173      for (i=0;i<in->n;i++) array[i]=in->index[i]+INDEX_OFFSET;      ptr=0;
174      Finley_IndexList_toArray(in->extension,&(array[in->n]));      for (i=0;i<in->n;i++) {
175              itmp=in->index[i];
176              if ((itmp>=range_min) && (range_max>itmp)) {
177                 array[ptr]=itmp+index_offset;
178                 ptr++;
179              }
180    
181        }
182        Dudley_IndexList_toArray(in->extension,&(array[ptr]), range_min, range_max, index_offset);
183    }    }
184  }  }
185    
186  /* deallocates the Finley_IndexList in by recursive calls */  /* deallocates the Dudley_IndexList in by recursive calls */
187    
188  void Finley_IndexList_free(Finley_IndexList* in) {  void Dudley_IndexList_free(Dudley_IndexList* in) {
189    if (in!=NULL) {    if (in!=NULL) {
190      Finley_IndexList_free(in->extension);      Dudley_IndexList_free(in->extension);
191      TMPMEMFREE(in);      TMPMEMFREE(in);
192    }    }
193  }  }
194    
195  /*  /* creates a Paso_pattern from a range of indices */
196   * $Log$  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)
197   * Revision 1.6  2005/09/15 03:44:22  jgs  {
198   * Merge of development branch dev-02 back to main trunk on 2005-09-15     dim_t *ptr=NULL;
199   *     register dim_t s,i,itmp;
200   * Revision 1.5.2.1  2005/09/07 06:26:18  gross     index_t *index=NULL;
201   * the solver from finley are put into the standalone package paso now     Paso_Pattern* out=NULL;
202   *  
203   * Revision 1.5  2005/07/08 04:07:51  jgs     ptr=MEMALLOC(n+1-n0,index_t);
204   * Merge of development branch back to main trunk on 2005-07-08     if (! Dudley_checkPtr(ptr) ) {
205   *         /* get the number of connections per row */
206   * Revision 1.4  2004/12/15 07:08:32  jgs         #pragma omp parallel for schedule(static) private(i)
207   * *** empty log message ***         for(i=n0;i<n;++i) {
208   * Revision 1.1.1.1.2.3  2005/06/29 02:34:50  gross                ptr[i-n0]=Dudley_IndexList_count(&index_list[i],range_min,range_max);
209   * some changes towards 64 integers in finley         }
210   *         /* accumulate ptr */
211   * Revision 1.1.1.1.2.2  2004/11/24 01:37:13  gross         s=0;
212   * some changes dealing with the integer overflow in memory allocation. Finley solves 4M unknowns now         for(i=n0;i<n;++i) {
213   *                 itmp=ptr[i-n0];
214   *                 ptr[i-n0]=s;
215   *                 s+=itmp;
216   */         }
217           ptr[n-n0]=s;
218           /* fill index */
219           index=MEMALLOC(ptr[n-n0],index_t);
220           if (! Dudley_checkPtr(index)) {
221                  #pragma omp parallel for schedule(static)
222                  for(i=n0;i<n;++i) {
223                      Dudley_IndexList_toArray(&index_list[i],&index[ptr[i-n0]],range_min,range_max,index_offset);
224                  }
225                  out=Paso_Pattern_alloc(PATTERN_FORMAT_DEFAULT,n-n0,range_max+index_offset,ptr,index);
226           }
227      }
228      if (! Dudley_noError()) {
229            MEMFREE(ptr);
230            MEMFREE(index);
231            Paso_Pattern_free(out);
232      }
233      return out;
234    }

Legend:
Removed from v.201  
changed lines
  Added in v.3152

  ViewVC Help
Powered by ViewVC 1.1.26