/usr/include/gmsh/linearSystemCSR.h is in libgmsh-dev 2.15.0+dfsg1-3.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 | // Gmsh - Copyright (C) 1997-2016 C. Geuzaine, J.-F. Remacle
//
// See the LICENSE.txt file for license information. Please report all
// bugs and problems to the public mailing list <gmsh@onelab.info>.
#ifndef _LINEAR_SYSTEM_CSR_H_
#define _LINEAR_SYSTEM_CSR_H_
#include <vector>
#include "GmshConfig.h"
#include "GmshMessage.h"
#include "linearSystem.h"
#include "sparsityPattern.h"
typedef int INDEX_TYPE ;
typedef struct {
int nmax;
int size;
int incr;
int n;
int isorder;
char *array;
} CSRList_T;
void CSRList_Add(CSRList_T *liste, const void *data);
int CSRList_Nbr(CSRList_T *liste);
template <class scalar>
class linearSystemCSR : public linearSystem<scalar> {
protected:
bool sorted;
bool _entriesPreAllocated;
char *something;
CSRList_T *_a, *_ai, *_ptr, *_jptr;
std::vector<scalar> *_b, *_x;
sparsityPattern _sparsity; // only used for pre-allocation, does not store the sparsity once allocated
public:
int getNNZ() {return CSRList_Nbr(linearSystemCSR<scalar>::_a);}
int getNbUnk() {return linearSystemCSR<scalar>::_b->size();}
linearSystemCSR()
: sorted(false), _entriesPreAllocated(false), _a(0), _b(0), _x(0) {}
virtual bool isAllocated() const { return _a != 0; }
virtual void allocate(int) ;
virtual void clear()
{
allocate(0);
}
virtual ~linearSystemCSR()
{
allocate(0);
}
virtual void insertInSparsityPattern (int i, int j) {
_sparsity.insertEntry (i,j);
}
virtual void preAllocateEntries ();
virtual void addToMatrix(int il, int ic, const scalar &val)
{
if (!_entriesPreAllocated)
preAllocateEntries();
INDEX_TYPE *jptr = (INDEX_TYPE*) _jptr->array;
INDEX_TYPE *ptr = (INDEX_TYPE*) _ptr->array;
INDEX_TYPE *ai = (INDEX_TYPE*) _ai->array;
scalar *a = ( scalar * ) _a->array;
INDEX_TYPE position = jptr[il];
if (sorted) { // use bisection and direct adressing if sorted
int p0 = jptr[il];
int p1 = jptr[il+1];
while (p1-p0 > 20) {
position = ((p0+p1)/2);
if (ai[position] > ic)
p1 = position;
else if (ai[position] < ic)
p0 = position + 1;
else {
a[position] += val;
return;
}
}
for (position = p0; position < p1; position++) {
if (ai[position] >= ic) {
if (ai[position] == ic){
a[position] += val;
return;
}
break;
}
}
} else if(something[il]) {
while(1){
if(ai[position] == ic){
a[position] += val;
return;
}
if (ptr[position] == 0) break;
position = ptr[position];
}
}
INDEX_TYPE zero = 0;
CSRList_Add(_a, &val);
CSRList_Add(_ai, &ic);
CSRList_Add(_ptr, &zero);
// The pointers may have been modified if there has been a
// reallocation in CSRList_Add
ptr = (INDEX_TYPE*) _ptr->array;
ai = (INDEX_TYPE*) _ai->array;
a = (scalar*) _a->array;
INDEX_TYPE n = CSRList_Nbr(_a) - 1;
if(!something[il]) {
jptr[il] = n;
something[il] = 1;
}
else ptr[position] = n;
}
virtual void getMatrix(INDEX_TYPE*& jptr,INDEX_TYPE*& ai,double*& a);
virtual void getFromMatrix (int row, int col, scalar &val) const
{
Msg::Error("getFromMatrix not implemented for CSR");
}
virtual void addToRightHandSide(int row, const scalar &val, int ith = 0)
{
if (!_b) return;
if(val != scalar()) (*_b)[row] += val;
}
virtual void addToSolution(int row, const scalar &val)
{
if (!_x) return;
if(val != scalar()) (*_x)[row] += val;
}
virtual void getFromRightHandSide(int row, scalar &val) const
{
if (!_b) return;
val = (*_b)[row];
}
virtual void getFromSolution(int row, scalar &val) const
{
if (!_x) return;
val = (*_x)[row];
}
virtual void zeroMatrix()
{
if (!_a) return;
int N = CSRList_Nbr(_a);
scalar *a = (scalar*) _a->array;
for (int i = 0; i < N; i++) a[i] = scalar();
}
virtual void zeroRightHandSide()
{
if (!_b) return;
for(unsigned int i = 0; i < _b->size(); i++) (*_b)[i] = scalar();
}
virtual void zeroSolution()
{
if (!_x) return;
for(unsigned int i = 0; i < _x->size(); i++) (*_x)[i] = scalar();
}
virtual double normInfRightHandSide() const
{
if (!_b) return 0.;
double nor = 0.;
double temp;
for(unsigned int i = 0; i < _b->size(); i++){
temp = std::abs((*_b)[i]);
if(nor < temp) nor = temp;
}
return nor;
}
};
template <class scalar>
class linearSystemCSRGmm : public linearSystemCSR<scalar> {
private:
double _prec;
int _noisy, _gmres;
public:
linearSystemCSRGmm() : _prec(1.e-8), _noisy(0), _gmres(0) {}
virtual ~linearSystemCSRGmm(){}
void setPrec(double p){ _prec = p; }
void setNoisy(int n){ _noisy = n; }
void setGmres(int n){ _gmres = n; }
virtual int systemSolve()
#if !defined(HAVE_GMM)
{
Msg::Error("Gmm++ is not available in this version of Gmsh");
return 0;
}
#endif
;
};
template <class scalar>
class linearSystemCSRTaucs : public linearSystemCSR<scalar> {
bool _symmetric;
public:
linearSystemCSRTaucs(bool s = true) : _symmetric(s){}
virtual ~linearSystemCSRTaucs(){}
virtual void addToMatrix(int il, int ic, const scalar &val)
{
if (!_symmetric || il <= ic) {
linearSystemCSR<scalar>::addToMatrix(il, ic, val);
}
}
virtual void insertInSparsityPattern(int il, int ic) {
if (!_symmetric || il <= ic)
linearSystemCSR<scalar>::insertInSparsityPattern(il,ic);
}
virtual int systemSolve()
#if !defined(HAVE_TAUCS)
{
Msg::Error("TAUCS is not available in this version of Gmsh");
return 0;
}
#endif
;
};
#endif
|