/usr/lib/petscdir/3.7.7/x86_64-linux-gnu-real-debug/include/petsc/private/kernels/blockinvert.h is in libpetsc3.7.7-dbg 3.7.7+dfsg1-2build5.
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 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 | /*
Kernels used in sparse ILU (and LU) and in the resulting triangular
solves. These are for block algorithms where the block sizes are on
the order of 2-6+.
There are TWO versions of the macros below.
1) standard for MatScalar == PetscScalar use the standard BLAS for
block size larger than 7 and
2) handcoded Fortran single precision for the matrices, since BLAS
does not have some arguments in single and some in double.
*/
#if !defined(__ILU_H)
#define __ILU_H
#include <petscblaslapack.h>
/*
These are C kernels,they are contained in
src/mat/impls/baij/seq
*/
PETSC_INTERN PetscErrorCode PetscLINPACKgefa(MatScalar*,PetscInt,PetscInt*,PetscBool,PetscBool*);
PETSC_INTERN PetscErrorCode PetscLINPACKgedi(MatScalar*,PetscInt,PetscInt*,MatScalar*);
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_2(MatScalar*,PetscReal,PetscBool,PetscBool*);
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_3(MatScalar*,PetscReal,PetscBool,PetscBool*);
#define PetscKernel_A_gets_inverse_A_4_nopivot(mat) 0; \
{ \
MatScalar d, di; \
\
di = mat[0]; \
mat[0] = d = 1.0 / di; \
mat[4] *= -d; \
mat[8] *= -d; \
mat[12] *= -d; \
mat[1] *= d; \
mat[2] *= d; \
mat[3] *= d; \
mat[5] += mat[4] * mat[1] * di; \
mat[6] += mat[4] * mat[2] * di; \
mat[7] += mat[4] * mat[3] * di; \
mat[9] += mat[8] * mat[1] * di; \
mat[10] += mat[8] * mat[2] * di; \
mat[11] += mat[8] * mat[3] * di; \
mat[13] += mat[12] * mat[1] * di; \
mat[14] += mat[12] * mat[2] * di; \
mat[15] += mat[12] * mat[3] * di; \
di = mat[5]; \
mat[5] = d = 1.0 / di; \
mat[1] *= -d; \
mat[9] *= -d; \
mat[13] *= -d; \
mat[4] *= d; \
mat[6] *= d; \
mat[7] *= d; \
mat[0] += mat[1] * mat[4] * di; \
mat[2] += mat[1] * mat[6] * di; \
mat[3] += mat[1] * mat[7] * di; \
mat[8] += mat[9] * mat[4] * di; \
mat[10] += mat[9] * mat[6] * di; \
mat[11] += mat[9] * mat[7] * di; \
mat[12] += mat[13] * mat[4] * di; \
mat[14] += mat[13] * mat[6] * di; \
mat[15] += mat[13] * mat[7] * di; \
di = mat[10]; \
mat[10] = d = 1.0 / di; \
mat[2] *= -d; \
mat[6] *= -d; \
mat[14] *= -d; \
mat[8] *= d; \
mat[9] *= d; \
mat[11] *= d; \
mat[0] += mat[2] * mat[8] * di; \
mat[1] += mat[2] * mat[9] * di; \
mat[3] += mat[2] * mat[11] * di; \
mat[4] += mat[6] * mat[8] * di; \
mat[5] += mat[6] * mat[9] * di; \
mat[7] += mat[6] * mat[11] * di; \
mat[12] += mat[14] * mat[8] * di; \
mat[13] += mat[14] * mat[9] * di; \
mat[15] += mat[14] * mat[11] * di; \
di = mat[15]; \
mat[15] = d = 1.0 / di; \
mat[3] *= -d; \
mat[7] *= -d; \
mat[11] *= -d; \
mat[12] *= d; \
mat[13] *= d; \
mat[14] *= d; \
mat[0] += mat[3] * mat[12] * di; \
mat[1] += mat[3] * mat[13] * di; \
mat[2] += mat[3] * mat[14] * di; \
mat[4] += mat[7] * mat[12] * di; \
mat[5] += mat[7] * mat[13] * di; \
mat[6] += mat[7] * mat[14] * di; \
mat[8] += mat[11] * mat[12] * di; \
mat[9] += mat[11] * mat[13] * di; \
mat[10] += mat[11] * mat[14] * di; \
}
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_4(MatScalar*,PetscReal,PetscBool,PetscBool*);
# if defined(PETSC_HAVE_SSE)
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_4_SSE(MatScalar*);
# endif
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_5(MatScalar*,PetscInt*,MatScalar*,PetscReal,PetscBool,PetscBool*);
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_6(MatScalar*,PetscReal,PetscBool,PetscBool*);
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_7(MatScalar*,PetscReal,PetscBool,PetscBool*);
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_9(MatScalar*,PetscReal,PetscBool,PetscBool*);
PETSC_EXTERN PetscErrorCode PetscKernel_A_gets_inverse_A_15(MatScalar*,PetscInt*,MatScalar*,PetscReal,PetscBool,PetscBool*);
/*
A = inv(A) A_gets_inverse_A
A - square bs by bs array stored in column major order
pivots - integer work array of length bs
W - bs by 1 work array
*/
#define PetscKernel_A_gets_inverse_A(bs,A,pivots,W,allowzeropivot,zeropivotdetected) (PetscLINPACKgefa((A),(bs),(pivots),(allowzeropivot),(zeropivotdetected)) || PetscLINPACKgedi((A),(bs),(pivots),(W)))
/* -----------------------------------------------------------------------*/
#if !defined(PETSC_USE_REAL_MAT_SINGLE)
/*
Version that calls the BLAS directly
*/
/*
A = A * B A_gets_A_times_B
A, B - square bs by bs arrays stored in column major order
W - square bs by bs work array
*/
#define PetscKernel_A_gets_A_times_B(bs,A,B,W) \
{ \
PetscBLASInt _bbs; \
PetscScalar _one = 1.0,_zero = 0.0; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(ierr); \
_ierr = PetscMemcpy((W),(A),(bs)*(bs)*sizeof(MatScalar));CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&(_bbs),&(_bbs),&(_bbs),&_one,(W),&(_bbs),(B),&(_bbs),&_zero,(A),&(_bbs))); \
}
/*
A = A - B * C A_gets_A_minus_B_times_C
A, B, C - square bs by bs arrays stored in column major order
*/
#define PetscKernel_A_gets_A_minus_B_times_C(bs,A,B,C) \
{ \
PetscScalar _mone = -1.0,_one = 1.0; \
PetscBLASInt _bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemm",BLASgemm_("N","N",&(_bbs),&(_bbs),&(_bbs),&_mone,(B),&(_bbs),(C),&(_bbs),&_one,(A),&(_bbs))); \
}
/*
A = A + B^T * C A_gets_A_plus_Btranspose_times_C
A, B, C - square bs by bs arrays stored in column major order
*/
#define PetscKernel_A_gets_A_plus_Btranspose_times_C(bs,A,B,C) \
{ \
PetscScalar _one = 1.0; \
PetscBLASInt _bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemm",BLASgemm_("T","N",&(_bbs),&(_bbs),&(_bbs),&_one,(B),&(_bbs),(C),&(_bbs),&_one,(A),&(_bbs))); \
}
/*
v = v + A^T w v_gets_v_plus_Atranspose_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_v_gets_v_plus_Atranspose_times_w(bs,v,A,w) \
{ \
PetscScalar _one = 1.0; \
PetscBLASInt _ione = 1, _bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("T",&(_bbs),&(_bbs),&_one,A,&(_bbs),w,&_ione,&_one,v,&_ione)); \
}
/*
v = v - A w v_gets_v_minus_A_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_v_gets_v_minus_A_times_w(bs,v,A,w) \
{ \
PetscScalar _mone = -1.0,_one = 1.0; \
PetscBLASInt _ione = 1,_bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&(_bbs),&(_bbs),&_mone,A,&(_bbs),w,&_ione,&_one,v,&_ione)); \
}
/*
v = v - A w v_gets_v_minus_transA_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_v_gets_v_minus_transA_times_w(bs,v,A,w) \
{ \
PetscScalar _mone = -1.0,_one = 1.0; \
PetscBLASInt _ione = 1,_bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("T",&(_bbs),&(_bbs),&_mone,A,&(_bbs),w,&_ione,&_one,v,&_ione)); \
}
/*
v = v + A w v_gets_v_plus_A_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_v_gets_v_plus_A_times_w(bs,v,A,w) \
{ \
PetscScalar _one = 1.0; \
PetscBLASInt _ione = 1,_bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&(_bbs),&(_bbs),&_one,A,&(_bbs),w,&_ione,&_one,v,&_ione)); \
}
/*
v = v + A w v_gets_v_plus_Ar_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_w_gets_w_plus_Ar_times_v(bs,ncols,v,A,w) \
{ \
PetscScalar _one = 1.0; \
PetscBLASInt _ione = 1,_bbs,_bncols; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
_ierr = PetscBLASIntCast(ncols,&_bncols);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&(_bbs),&(_bncols),&_one,A,&(_bbs),v,&_ione,&_one,w,&_ione)); \
}
/*
v = v - A w v_gets_v_minus_Ar_times_w
v - array of length ncol
A(bs,ncols)
w - array of length bs
*/
#define PetscKernel_w_gets_w_minus_Ar_times_v(bs,ncols,w,A,v) \
{ \
PetscScalar _one = 1.0,_mone = -1.0; \
PetscBLASInt _ione = 1,_bbs,_bncols; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
_ierr = PetscBLASIntCast(ncols,&_bncols);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&(_bbs),&(_bncols),&_mone,A,&(_bbs),v,&_ione,&_one,w,&_ione)); \
}
/*
w = A v w_gets_A_times_v
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_w_gets_A_times_v(bs,v,A,w) \
{ \
PetscScalar _zero = 0.0,_one = 1.0; \
PetscBLASInt _ione = 1,_bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&(_bbs),&(_bbs),&_one,A,&(_bbs),v,&_ione,&_zero,w,&_ione)); \
}
/*
w = A' v w_gets_transA_times_v
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_w_gets_transA_times_v(bs,v,A,w) \
{ \
PetscScalar _zero = 0.0,_one = 1.0; \
PetscBLASInt _ione = 1,_bbs; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("T",&(_bbs),&(_bbs),&_one,A,&(_bbs),v,&_ione,&_zero,w,&_ione)); \
}
/*
z = A*x
*/
#define PetscKernel_w_gets_Ar_times_v(bs,ncols,x,A,z) \
{ \
PetscScalar _one = 1.0,_zero = 0.0; \
PetscBLASInt _ione = 1,_bbs,_bncols; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
_ierr = PetscBLASIntCast(ncols,&_bncols);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("N",&(_bbs),&_bncols,&_one,A,&(_bbs),x,&_ione,&_zero,z,&_ione)); \
}
/*
z = trans(A)*x
*/
#define PetscKernel_w_gets_w_plus_trans_Ar_times_v(bs,ncols,x,A,z) \
{ \
PetscScalar _one = 1.0; \
PetscBLASInt _ione = 1,_bbs,_bncols; \
PetscErrorCode _ierr; \
_ierr = PetscBLASIntCast(bs,&_bbs);CHKERRQ(_ierr); \
_ierr = PetscBLASIntCast(ncols,&_bncols);CHKERRQ(_ierr); \
PetscStackCallBLAS("BLASgemv",BLASgemv_("T",&_bbs,&_bncols,&_one,A,&_bbs,x,&_ione,&_one,z,&_ione)); \
}
#else
/*
Version that calls Fortran routines; can handle different precision
of matrix (array) and vectors
*/
/*
These are Fortran kernels: They replace certain BLAS routines but
have some arguments that may be single precision,rather than double
These routines are provided in src/fortran/kernels/sgemv.F
They are pretty pitiful but get the job done. The intention is
that for important block sizes (currently 1,2,3,4,5,6,7) custom inlined
code is used.
*/
#if defined(PETSC_HAVE_FORTRAN_CAPS)
#define msgemv_ MSGEMV
#define msgemvp_ MSGEMVP
#define msgemvm_ MSGEMVM
#define msgemvt_ MSGEMVT
#define msgemmi_ MSGEMMI
#define msgemm_ MSGEMM
#elif !defined(PETSC_HAVE_FORTRAN_UNDERSCORE)
#define msgemv_ msgemv
#define msgemvp_ msgemvp
#define msgemvm_ msgemvm
#define msgemvt_ msgemvt
#define msgemmi_ msgemmi
#define msgemm_ msgemm
#endif
PETSC_EXTERN void msgemv_(PetscInt*,PetscInt*,MatScalar*,PetscScalar*,PetscScalar*);
PETSC_EXTERN void msgemvp_(PetscInt*,PetscInt*,MatScalar*,PetscScalar*,PetscScalar*);
PETSC_EXTERN void msgemvm_(PetscInt*,PetscInt*,MatScalar*,PetscScalar*,PetscScalar*);
PETSC_EXTERN void msgemvt_(PetscInt*,PetscInt*,MatScalar*,PetscScalar*,PetscScalar*);
PETSC_EXTERN void msgemmi_(PetscInt*,MatScalar*,MatScalar*,MatScalar*);
PETSC_EXTERN void msgemm_(PetscInt*,MatScalar*,MatScalar*,MatScalar*);
/*
A = A * B A_gets_A_times_B
A, B - square bs by bs arrays stored in column major order
W - square bs by bs work array
*/
#define PetscKernel_A_gets_A_times_B(bs,A,B,W) \
{ \
PetscErrorCode _ierr = PetscMemcpy((W),(A),(bs)*(bs)*sizeof(MatScalar));CHKERRQ(_ierr); \
msgemmi_(&bs,A,B,W); \
}
/*
A = A - B * C A_gets_A_minus_B_times_C
A, B, C - square bs by bs arrays stored in column major order
*/
#define PetscKernel_A_gets_A_minus_B_times_C(bs,A,B,C) \
{ \
msgemm_(&bs,A,B,C); \
}
/*
v = v - A w v_gets_v_minus_A_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_v_gets_v_minus_A_times_w(bs,v,A,w) \
{ \
msgemvm_(&bs,&bs,A,w,v); \
}
/*
v = v + A w v_gets_v_plus_A_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_v_gets_v_plus_A_times_w(bs,v,A,w) \
{ \
msgemvp_(&bs,&bs,A,w,v); \
}
/*
v = v + A w v_gets_v_plus_Ar_times_w
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_w_gets_w_plus_Ar_times_v(bs,ncol,v,A,w) \
{ \
msgemvp_(&bs,&ncol,A,v,w); \
}
/*
w = A v w_gets_A_times_v
v - array of length bs
A - square bs by bs array
w - array of length bs
*/
#define PetscKernel_w_gets_A_times_v(bs,v,A,w) \
{ \
msgemv_(&bs,&bs,A,v,w); \
}
/*
z = A*x
*/
#define PetscKernel_w_gets_Ar_times_v(bs,ncols,x,A,z) \
{ \
msgemv_(&bs,&ncols,A,x,z); \
}
/*
z = trans(A)*x
*/
#define PetscKernel_w_gets_w_plus_trans_Ar_times_v(bs,ncols,x,A,z) \
{ \
msgemvt_(&bs,&ncols,A,x,z); \
}
/* These do not work yet */
#define PetscKernel_A_gets_A_plus_Btranspose_times_C(bs,A,B,C)
#define PetscKernel_v_gets_v_plus_Atranspose_times_w(bs,v,A,w)
#endif
#endif
|