/usr/lib/petscdir/3.7.7/x86_64-linux-gnu-complex/include/petsc/private/matimpl.h is in libpetsc-complex-3.7.7-dev 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 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 | #ifndef __MATIMPL_H
#define __MATIMPL_H
#include <petscmat.h>
#include <petsc/private/petscimpl.h>
PETSC_EXTERN PetscBool MatRegisterAllCalled;
PETSC_EXTERN PetscBool MatOrderingRegisterAllCalled;
PETSC_EXTERN PetscBool MatColoringRegisterAllCalled;
PETSC_EXTERN PetscBool MatPartitioningRegisterAllCalled;
PETSC_EXTERN PetscBool MatCoarsenRegisterAllCalled;
PETSC_EXTERN PetscErrorCode MatRegisterAll(void);
PETSC_EXTERN PetscErrorCode MatOrderingRegisterAll(void);
PETSC_EXTERN PetscErrorCode MatColoringRegisterAll(void);
PETSC_EXTERN PetscErrorCode MatPartitioningRegisterAll(void);
PETSC_EXTERN PetscErrorCode MatCoarsenRegisterAll(void);
/*
This file defines the parts of the matrix data structure that are
shared by all matrix types.
*/
/*
If you add entries here also add them to the MATOP enum
in include/petscmat.h and include/petsc/finclude/petscmat.h
*/
typedef struct _MatOps *MatOps;
struct _MatOps {
/* 0*/
PetscErrorCode (*setvalues)(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode);
PetscErrorCode (*getrow)(Mat,PetscInt,PetscInt *,PetscInt*[],PetscScalar*[]);
PetscErrorCode (*restorerow)(Mat,PetscInt,PetscInt *,PetscInt *[],PetscScalar *[]);
PetscErrorCode (*mult)(Mat,Vec,Vec);
PetscErrorCode (*multadd)(Mat,Vec,Vec,Vec);
/* 5*/
PetscErrorCode (*multtranspose)(Mat,Vec,Vec);
PetscErrorCode (*multtransposeadd)(Mat,Vec,Vec,Vec);
PetscErrorCode (*solve)(Mat,Vec,Vec);
PetscErrorCode (*solveadd)(Mat,Vec,Vec,Vec);
PetscErrorCode (*solvetranspose)(Mat,Vec,Vec);
/*10*/
PetscErrorCode (*solvetransposeadd)(Mat,Vec,Vec,Vec);
PetscErrorCode (*lufactor)(Mat,IS,IS,const MatFactorInfo*);
PetscErrorCode (*choleskyfactor)(Mat,IS,const MatFactorInfo*);
PetscErrorCode (*sor)(Mat,Vec,PetscReal,MatSORType,PetscReal,PetscInt,PetscInt,Vec);
PetscErrorCode (*transpose)(Mat,MatReuse,Mat *);
/*15*/
PetscErrorCode (*getinfo)(Mat,MatInfoType,MatInfo*);
PetscErrorCode (*equal)(Mat,Mat,PetscBool *);
PetscErrorCode (*getdiagonal)(Mat,Vec);
PetscErrorCode (*diagonalscale)(Mat,Vec,Vec);
PetscErrorCode (*norm)(Mat,NormType,PetscReal*);
/*20*/
PetscErrorCode (*assemblybegin)(Mat,MatAssemblyType);
PetscErrorCode (*assemblyend)(Mat,MatAssemblyType);
PetscErrorCode (*setoption)(Mat,MatOption,PetscBool );
PetscErrorCode (*zeroentries)(Mat);
/*24*/
PetscErrorCode (*zerorows)(Mat,PetscInt,const PetscInt[],PetscScalar,Vec,Vec);
PetscErrorCode (*lufactorsymbolic)(Mat,Mat,IS,IS,const MatFactorInfo*);
PetscErrorCode (*lufactornumeric)(Mat,Mat,const MatFactorInfo*);
PetscErrorCode (*choleskyfactorsymbolic)(Mat,Mat,IS,const MatFactorInfo*);
PetscErrorCode (*choleskyfactornumeric)(Mat,Mat,const MatFactorInfo*);
/*29*/
PetscErrorCode (*setup)(Mat);
PetscErrorCode (*ilufactorsymbolic)(Mat,Mat,IS,IS,const MatFactorInfo*);
PetscErrorCode (*iccfactorsymbolic)(Mat,Mat,IS,const MatFactorInfo*);
PetscErrorCode (*placeholder_32)(Mat);
PetscErrorCode (*placeholder_33)(Mat);
/*34*/
PetscErrorCode (*duplicate)(Mat,MatDuplicateOption,Mat*);
PetscErrorCode (*forwardsolve)(Mat,Vec,Vec);
PetscErrorCode (*backwardsolve)(Mat,Vec,Vec);
PetscErrorCode (*ilufactor)(Mat,IS,IS,const MatFactorInfo*);
PetscErrorCode (*iccfactor)(Mat,IS,const MatFactorInfo*);
/*39*/
PetscErrorCode (*axpy)(Mat,PetscScalar,Mat,MatStructure);
PetscErrorCode (*getsubmatrices)(Mat,PetscInt,const IS[],const IS[],MatReuse,Mat *[]);
PetscErrorCode (*increaseoverlap)(Mat,PetscInt,IS[],PetscInt);
PetscErrorCode (*getvalues)(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],PetscScalar []);
PetscErrorCode (*copy)(Mat,Mat,MatStructure);
/*44*/
PetscErrorCode (*getrowmax)(Mat,Vec,PetscInt[]);
PetscErrorCode (*scale)(Mat,PetscScalar);
PetscErrorCode (*shift)(Mat,PetscScalar);
PetscErrorCode (*diagonalset)(Mat,Vec,InsertMode);
PetscErrorCode (*zerorowscolumns)(Mat,PetscInt,const PetscInt[],PetscScalar,Vec,Vec);
/*49*/
PetscErrorCode (*setrandom)(Mat,PetscRandom);
PetscErrorCode (*getrowij)(Mat,PetscInt,PetscBool ,PetscBool ,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool *);
PetscErrorCode (*restorerowij)(Mat,PetscInt,PetscBool ,PetscBool ,PetscInt *,const PetscInt *[],const PetscInt *[],PetscBool *);
PetscErrorCode (*getcolumnij)(Mat,PetscInt,PetscBool ,PetscBool ,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool *);
PetscErrorCode (*restorecolumnij)(Mat,PetscInt,PetscBool ,PetscBool ,PetscInt*,const PetscInt *[],const PetscInt *[],PetscBool *);
/*54*/
PetscErrorCode (*fdcoloringcreate)(Mat,ISColoring,MatFDColoring);
PetscErrorCode (*coloringpatch)(Mat,PetscInt,PetscInt,ISColoringValue[],ISColoring*);
PetscErrorCode (*setunfactored)(Mat);
PetscErrorCode (*permute)(Mat,IS,IS,Mat*);
PetscErrorCode (*setvaluesblocked)(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode);
/*59*/
PetscErrorCode (*getsubmatrix)(Mat,IS,IS,MatReuse,Mat*);
PetscErrorCode (*destroy)(Mat);
PetscErrorCode (*view)(Mat,PetscViewer);
PetscErrorCode (*convertfrom)(Mat, MatType,MatReuse,Mat*);
PetscErrorCode (*matmatmult)(Mat,Mat,Mat,MatReuse,PetscReal,Mat*);
/*64*/
PetscErrorCode (*matmatmultsymbolic)(Mat,Mat,Mat,PetscReal,Mat*);
PetscErrorCode (*matmatmultnumeric)(Mat,Mat,Mat,Mat);
PetscErrorCode (*setlocaltoglobalmapping)(Mat,ISLocalToGlobalMapping,ISLocalToGlobalMapping);
PetscErrorCode (*setvalueslocal)(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode);
PetscErrorCode (*zerorowslocal)(Mat,PetscInt,const PetscInt[],PetscScalar,Vec,Vec);
/*69*/
PetscErrorCode (*getrowmaxabs)(Mat,Vec,PetscInt[]);
PetscErrorCode (*getrowminabs)(Mat,Vec,PetscInt[]);
PetscErrorCode (*convert)(Mat, MatType,MatReuse,Mat*);
PetscErrorCode (*setcoloring)(Mat,ISColoring);
PetscErrorCode (*placeholder_73)(Mat,void*);
/*74*/
PetscErrorCode (*setvaluesadifor)(Mat,PetscInt,void*);
PetscErrorCode (*fdcoloringapply)(Mat,MatFDColoring,Vec,void*);
PetscErrorCode (*setfromoptions)(PetscOptionItems*,Mat);
PetscErrorCode (*multconstrained)(Mat,Vec,Vec);
PetscErrorCode (*multtransposeconstrained)(Mat,Vec,Vec);
/*79*/
PetscErrorCode (*findzerodiagonals)(Mat,IS*);
PetscErrorCode (*mults)(Mat, Vecs, Vecs);
PetscErrorCode (*solves)(Mat, Vecs, Vecs);
PetscErrorCode (*getinertia)(Mat,PetscInt*,PetscInt*,PetscInt*);
PetscErrorCode (*load)(Mat, PetscViewer);
/*84*/
PetscErrorCode (*issymmetric)(Mat,PetscReal,PetscBool *);
PetscErrorCode (*ishermitian)(Mat,PetscReal,PetscBool *);
PetscErrorCode (*isstructurallysymmetric)(Mat,PetscBool *);
PetscErrorCode (*setvaluesblockedlocal)(Mat,PetscInt,const PetscInt[],PetscInt,const PetscInt[],const PetscScalar[],InsertMode);
PetscErrorCode (*getvecs)(Mat,Vec*,Vec*);
/*89*/
PetscErrorCode (*matmult)(Mat,Mat,MatReuse,PetscReal,Mat*);
PetscErrorCode (*matmultsymbolic)(Mat,Mat,PetscReal,Mat*);
PetscErrorCode (*matmultnumeric)(Mat,Mat,Mat);
PetscErrorCode (*ptap)(Mat,Mat,MatReuse,PetscReal,Mat*);
PetscErrorCode (*ptapsymbolic)(Mat,Mat,PetscReal,Mat*); /* double dispatch wrapper routine */
/*94*/
PetscErrorCode (*ptapnumeric)(Mat,Mat,Mat); /* double dispatch wrapper routine */
PetscErrorCode (*mattransposemult)(Mat,Mat,MatReuse,PetscReal,Mat*);
PetscErrorCode (*mattransposemultsymbolic)(Mat,Mat,PetscReal,Mat*);
PetscErrorCode (*mattransposemultnumeric)(Mat,Mat,Mat);
PetscErrorCode (*placeholder_98)(Mat);
/*99*/
PetscErrorCode (*placeholder_99)(Mat);
PetscErrorCode (*placeholder_100)(Mat);
PetscErrorCode (*placeholder_101)(Mat);
PetscErrorCode (*conjugate)(Mat); /* complex conjugate */
PetscErrorCode (*placeholder_103)(void);
/*104*/
PetscErrorCode (*setvaluesrow)(Mat,PetscInt,const PetscScalar[]);
PetscErrorCode (*realpart)(Mat);
PetscErrorCode (*imaginarypart)(Mat);
PetscErrorCode (*getrowuppertriangular)(Mat);
PetscErrorCode (*restorerowuppertriangular)(Mat);
/*109*/
PetscErrorCode (*matsolve)(Mat,Mat,Mat);
PetscErrorCode (*placeholder_110)(Mat);
PetscErrorCode (*getrowmin)(Mat,Vec,PetscInt[]);
PetscErrorCode (*getcolumnvector)(Mat,Vec,PetscInt);
PetscErrorCode (*missingdiagonal)(Mat,PetscBool *,PetscInt*);
/*114*/
PetscErrorCode (*getseqnonzerostructure)(Mat,Mat *);
PetscErrorCode (*create)(Mat);
PetscErrorCode (*getghosts)(Mat,PetscInt*,const PetscInt *[]);
PetscErrorCode (*getlocalsubmatrix)(Mat,IS,IS,Mat*);
PetscErrorCode (*restorelocalsubmatrix)(Mat,IS,IS,Mat*);
/*119*/
PetscErrorCode (*multdiagonalblock)(Mat,Vec,Vec);
PetscErrorCode (*hermitiantranspose)(Mat,MatReuse,Mat*);
PetscErrorCode (*multhermitiantranspose)(Mat,Vec,Vec);
PetscErrorCode (*multhermitiantransposeadd)(Mat,Vec,Vec,Vec);
PetscErrorCode (*getmultiprocblock)(Mat,MPI_Comm,MatReuse,Mat*);
/*124*/
PetscErrorCode (*findnonzerorows)(Mat,IS*);
PetscErrorCode (*getcolumnnorms)(Mat,NormType,PetscReal*);
PetscErrorCode (*invertblockdiagonal)(Mat,const PetscScalar**);
PetscErrorCode (*placeholder_127)(Mat,Vec,Vec,Vec);
PetscErrorCode (*getsubmatricesmpi)(Mat,PetscInt,const IS[], const IS[], MatReuse, Mat**);
/*129*/
PetscErrorCode (*setvaluesbatch)(Mat,PetscInt,PetscInt,PetscInt*,const PetscScalar*);
PetscErrorCode (*transposematmult)(Mat,Mat,MatReuse,PetscReal,Mat*);
PetscErrorCode (*transposematmultsymbolic)(Mat,Mat,PetscReal,Mat*);
PetscErrorCode (*transposematmultnumeric)(Mat,Mat,Mat);
PetscErrorCode (*transposecoloringcreate)(Mat,ISColoring,MatTransposeColoring);
/*134*/
PetscErrorCode (*transcoloringapplysptoden)(MatTransposeColoring,Mat,Mat);
PetscErrorCode (*transcoloringapplydentosp)(MatTransposeColoring,Mat,Mat);
PetscErrorCode (*rart)(Mat,Mat,MatReuse,PetscReal,Mat*);
PetscErrorCode (*rartsymbolic)(Mat,Mat,PetscReal,Mat*); /* double dispatch wrapper routine */
PetscErrorCode (*rartnumeric)(Mat,Mat,Mat); /* double dispatch wrapper routine */
/*139*/
PetscErrorCode (*setblocksizes)(Mat,PetscInt,PetscInt);
PetscErrorCode (*aypx)(Mat,PetscScalar,Mat,MatStructure);
PetscErrorCode (*residual)(Mat,Vec,Vec,Vec);
PetscErrorCode (*fdcoloringsetup)(Mat,ISColoring,MatFDColoring);
PetscErrorCode (*findoffblockdiagonalentries)(Mat,IS*);
/*144*/
PetscErrorCode (*creatempimatconcatenateseqmat)(MPI_Comm,Mat,PetscInt,MatReuse,Mat*);
};
/*
If you add MatOps entries above also add them to the MATOP enum
in include/petscmat.h and include/petsc/finclude/petscmat.h
*/
#include <petscsys.h>
PETSC_EXTERN PetscErrorCode MatRegisterOp(MPI_Comm, const char[], PetscVoidFunction, const char[], PetscInt, ...);
PETSC_EXTERN PetscErrorCode MatQueryOp(MPI_Comm, PetscVoidFunction*, const char[], PetscInt, ...);
typedef struct _p_MatBaseName* MatBaseName;
struct _p_MatBaseName {
char *bname,*sname,*mname;
MatBaseName next;
};
PETSC_EXTERN MatBaseName MatBaseNameList;
/*
Utility private matrix routines
*/
PETSC_INTERN PetscErrorCode MatConvert_Basic(Mat, MatType,MatReuse,Mat*);
PETSC_INTERN PetscErrorCode MatCopy_Basic(Mat,Mat,MatStructure);
PETSC_INTERN PetscErrorCode MatHeaderMerge(Mat,Mat*);
PETSC_EXTERN PetscErrorCode MatHeaderReplace(Mat,Mat*);
PETSC_INTERN PetscErrorCode MatDiagonalSet_Default(Mat,Vec,InsertMode);
#if defined(PETSC_USE_DEBUG)
# define MatCheckPreallocated(A,arg) do { \
if (PetscUnlikely(!(A)->preallocated)) SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_ARG_WRONGSTATE,"Must call MatXXXSetPreallocation() or MatSetUp() on argument %D \"%s\" before %s()",(arg),#A,PETSC_FUNCTION_NAME); \
} while (0)
#else
# define MatCheckPreallocated(A,arg) do {} while (0)
#endif
/*
The stash is used to temporarily store inserted matrix values that
belong to another processor. During the assembly phase the stashed
values are moved to the correct processor and
*/
typedef struct _MatStashSpace *PetscMatStashSpace;
struct _MatStashSpace {
PetscMatStashSpace next;
PetscScalar *space_head,*val;
PetscInt *idx,*idy;
PetscInt total_space_size;
PetscInt local_used;
PetscInt local_remaining;
};
PETSC_EXTERN PetscErrorCode PetscMatStashSpaceGet(PetscInt,PetscInt,PetscMatStashSpace *);
PETSC_EXTERN PetscErrorCode PetscMatStashSpaceContiguous(PetscInt,PetscMatStashSpace *,PetscScalar *,PetscInt *,PetscInt *);
PETSC_EXTERN PetscErrorCode PetscMatStashSpaceDestroy(PetscMatStashSpace*);
typedef struct {
PetscInt count;
} MatStashHeader;
typedef struct {
void *buffer; /* Of type blocktype, dynamically constructed */
PetscInt count;
char pending;
} MatStashFrame;
typedef struct _MatStash MatStash;
struct _MatStash {
PetscInt nmax; /* maximum stash size */
PetscInt umax; /* user specified max-size */
PetscInt oldnmax; /* the nmax value used previously */
PetscInt n; /* stash size */
PetscInt bs; /* block size of the stash */
PetscInt reallocs; /* preserve the no of mallocs invoked */
PetscMatStashSpace space_head,space; /* linked list to hold stashed global row/column numbers and matrix values */
PetscErrorCode (*ScatterBegin)(Mat,MatStash*,PetscInt*);
PetscErrorCode (*ScatterGetMesg)(MatStash*,PetscMPIInt*,PetscInt**,PetscInt**,PetscScalar**,PetscInt*);
PetscErrorCode (*ScatterEnd)(MatStash*);
PetscErrorCode (*ScatterDestroy)(MatStash*);
/* The following variables are used for communication */
MPI_Comm comm;
PetscMPIInt size,rank;
PetscMPIInt tag1,tag2;
MPI_Request *send_waits; /* array of send requests */
MPI_Request *recv_waits; /* array of receive requests */
MPI_Status *send_status; /* array of send status */
PetscInt nsends,nrecvs; /* numbers of sends and receives */
PetscScalar *svalues; /* sending data */
PetscInt *sindices;
PetscScalar **rvalues; /* receiving data (values) */
PetscInt **rindices; /* receiving data (indices) */
PetscInt nprocessed; /* number of messages already processed */
PetscMPIInt *flg_v; /* indicates what messages have arrived so far and from whom */
PetscBool reproduce;
PetscInt reproduce_count;
/* The following variables are used for BTS communication */
PetscBool subset_off_proc; /* Subsequent assemblies will set a subset (perhaps equal) of off-process entries set on first assembly */
PetscBool use_status; /* Use MPI_Status to determine number of items in each message */
PetscMPIInt nsendranks;
PetscMPIInt nrecvranks;
PetscMPIInt *sendranks;
PetscMPIInt *recvranks;
MatStashHeader *sendhdr,*recvhdr;
MatStashFrame *sendframes; /* pointers to the main messages */
MatStashFrame *recvframes;
MatStashFrame *recvframe_active;
PetscInt recvframe_i; /* index of block within active frame */
PetscMPIInt recvframe_count; /* Count actually sent for current frame */
PetscInt recvcount; /* Number of receives processed so far */
PetscMPIInt *some_indices; /* From last call to MPI_Waitsome */
MPI_Status *some_statuses; /* Statuses from last call to MPI_Waitsome */
PetscMPIInt some_count; /* Number of requests completed in last call to MPI_Waitsome */
PetscMPIInt some_i; /* Index of request currently being processed */
MPI_Request *sendreqs;
MPI_Request *recvreqs;
PetscSegBuffer segsendblocks;
PetscSegBuffer segrecvframe;
PetscSegBuffer segrecvblocks;
MPI_Datatype blocktype;
size_t blocktype_size;
InsertMode *insertmode; /* Pointer to check mat->insertmode and set upon message arrival in case no local values have been set. */
};
PETSC_INTERN PetscErrorCode MatStashCreate_Private(MPI_Comm,PetscInt,MatStash*);
PETSC_INTERN PetscErrorCode MatStashDestroy_Private(MatStash*);
PETSC_INTERN PetscErrorCode MatStashScatterEnd_Private(MatStash*);
PETSC_INTERN PetscErrorCode MatStashSetInitialSize_Private(MatStash*,PetscInt);
PETSC_INTERN PetscErrorCode MatStashGetInfo_Private(MatStash*,PetscInt*,PetscInt*);
PETSC_INTERN PetscErrorCode MatStashValuesRow_Private(MatStash*,PetscInt,PetscInt,const PetscInt[],const PetscScalar[],PetscBool );
PETSC_INTERN PetscErrorCode MatStashValuesCol_Private(MatStash*,PetscInt,PetscInt,const PetscInt[],const PetscScalar[],PetscInt,PetscBool );
PETSC_INTERN PetscErrorCode MatStashValuesRowBlocked_Private(MatStash*,PetscInt,PetscInt,const PetscInt[],const PetscScalar[],PetscInt,PetscInt,PetscInt);
PETSC_INTERN PetscErrorCode MatStashValuesColBlocked_Private(MatStash*,PetscInt,PetscInt,const PetscInt[],const PetscScalar[],PetscInt,PetscInt,PetscInt);
PETSC_INTERN PetscErrorCode MatStashScatterBegin_Private(Mat,MatStash*,PetscInt*);
PETSC_INTERN PetscErrorCode MatStashScatterGetMesg_Private(MatStash*,PetscMPIInt*,PetscInt**,PetscInt**,PetscScalar**,PetscInt*);
typedef struct {
PetscInt dim;
PetscInt dims[4];
PetscInt starts[4];
PetscBool noc; /* this is a single component problem, hence user will not set MatStencil.c */
} MatStencilInfo;
/* Info about using compressed row format */
typedef struct {
PetscBool use; /* indicates compressed rows have been checked and will be used */
PetscInt nrows; /* number of non-zero rows */
PetscInt *i; /* compressed row pointer */
PetscInt *rindex; /* compressed row index */
} Mat_CompressedRow;
PETSC_EXTERN PetscErrorCode MatCheckCompressedRow(Mat,PetscInt,Mat_CompressedRow*,PetscInt*,PetscInt,PetscReal);
typedef struct { /* used by MatCreateRedundantMatrix() for reusing matredundant */
PetscInt nzlocal,nsends,nrecvs;
PetscMPIInt *send_rank,*recv_rank;
PetscInt *sbuf_nz,*rbuf_nz,*sbuf_j,**rbuf_j;
PetscScalar *sbuf_a,**rbuf_a;
MPI_Comm subcomm; /* when user does not provide a subcomm */
IS isrow,iscol;
Mat *matseq;
} Mat_Redundant;
struct _p_Mat {
PETSCHEADER(struct _MatOps);
PetscLayout rmap,cmap;
void *data; /* implementation-specific data */
MatFactorType factortype; /* MAT_FACTOR_LU, ILU, CHOLESKY or ICC */
PetscBool assembled; /* is the matrix assembled? */
PetscBool was_assembled; /* new values inserted into assembled mat */
PetscInt num_ass; /* number of times matrix has been assembled */
PetscObjectState nonzerostate; /* each time new nonzeros locations are introduced into the matrix this is updated */
MatInfo info; /* matrix information */
InsertMode insertmode; /* have values been inserted in matrix or added? */
MatStash stash,bstash; /* used for assembling off-proc mat emements */
MatNullSpace nullsp; /* null space (operator is singular) */
MatNullSpace transnullsp; /* null space of transpose of operator */
MatNullSpace nearnullsp; /* near null space to be used by multigrid methods */
PetscBool preallocated;
MatStencilInfo stencil; /* information for structured grid */
PetscBool symmetric,hermitian,structurally_symmetric,spd;
PetscBool symmetric_set,hermitian_set,structurally_symmetric_set,spd_set; /* if true, then corresponding flag is correct*/
PetscBool symmetric_eternal;
PetscBool nooffprocentries,nooffproczerorows;
PetscBool subsetoffprocentries;
#if defined(PETSC_HAVE_CUSP)
PetscCUSPFlag valid_GPU_matrix; /* flag pointing to the matrix on the gpu*/
#elif defined(PETSC_HAVE_VIENNACL)
PetscViennaCLFlag valid_GPU_matrix; /* flag pointing to the matrix on the gpu*/
#elif defined(PETSC_HAVE_VECCUDA)
PetscCUDAFlag valid_GPU_matrix; /* flag pointing to the matrix on the gpu*/
#endif
void *spptr; /* pointer for special library like SuperLU */
MatSolverPackage solvertype;
PetscBool checksymmetryonassembly,checknullspaceonassembly;
PetscReal checksymmetrytol;
Mat_Redundant *redundant; /* used by MatCreateRedundantMatrix() */
PetscBool erroriffailure; /* Generate an error if detected (for example a zero pivot) instead of returning */
MatFactorError errortype; /* type of error */
};
PETSC_INTERN PetscErrorCode MatAXPY_Basic(Mat,PetscScalar,Mat,MatStructure);
PETSC_INTERN PetscErrorCode MatAXPY_BasicWithPreallocation(Mat,Mat,PetscScalar,Mat,MatStructure);
/*
Object for partitioning graphs
*/
typedef struct _MatPartitioningOps *MatPartitioningOps;
struct _MatPartitioningOps {
PetscErrorCode (*apply)(MatPartitioning,IS*);
PetscErrorCode (*setfromoptions)(PetscOptionItems*,MatPartitioning);
PetscErrorCode (*destroy)(MatPartitioning);
PetscErrorCode (*view)(MatPartitioning,PetscViewer);
};
struct _p_MatPartitioning {
PETSCHEADER(struct _MatPartitioningOps);
Mat adj;
PetscInt *vertex_weights;
PetscReal *part_weights;
PetscInt n; /* number of partitions */
void *data;
PetscInt setupcalled;
};
/*
Object for coarsen graphs
*/
typedef struct _MatCoarsenOps *MatCoarsenOps;
struct _MatCoarsenOps {
PetscErrorCode (*apply)(MatCoarsen);
PetscErrorCode (*setfromoptions)(PetscOptionItems*,MatCoarsen);
PetscErrorCode (*destroy)(MatCoarsen);
PetscErrorCode (*view)(MatCoarsen,PetscViewer);
};
struct _p_MatCoarsen {
PETSCHEADER(struct _MatCoarsenOps);
Mat graph;
PetscInt setupcalled;
void *subctx;
/* */
PetscBool strict_aggs;
IS perm;
PetscCoarsenData *agg_lists;
};
PETSC_EXTERN PetscErrorCode PetscCDCreate(PetscInt,PetscCoarsenData**);
PETSC_EXTERN PetscErrorCode PetscCDDestroy(PetscCoarsenData*);
PETSC_EXTERN PetscErrorCode PetscLLNSetID(PetscCDIntNd*,PetscInt);
PETSC_EXTERN PetscErrorCode PetscLLNGetID(const PetscCDIntNd*,PetscInt*);
PETSC_EXTERN PetscErrorCode PetscCDAppendID(PetscCoarsenData*,PetscInt,PetscInt);
PETSC_EXTERN PetscErrorCode PetscCDAppendRemove(PetscCoarsenData*,PetscInt,PetscInt);
PETSC_EXTERN PetscErrorCode PetscCDAppendNode(PetscCoarsenData*,PetscInt,PetscCDIntNd*);
PETSC_EXTERN PetscErrorCode PetscCDRemoveNextNode(PetscCoarsenData*,PetscInt,PetscCDIntNd*);
PETSC_EXTERN PetscErrorCode PetscCDRemoveAllAt(PetscCoarsenData*,PetscInt);
PETSC_EXTERN PetscErrorCode PetscCDSizeAt(const PetscCoarsenData*,PetscInt,PetscInt*);
PETSC_EXTERN PetscErrorCode PetscCDEmptyAt(const PetscCoarsenData*,PetscInt,PetscBool*);
PETSC_EXTERN PetscErrorCode PetscCDSetChuckSize(PetscCoarsenData*,PetscInt);
PETSC_EXTERN PetscErrorCode PetscCDPrint(const PetscCoarsenData*,MPI_Comm);
PETSC_EXTERN PetscErrorCode PetscCDGetMIS(PetscCoarsenData*,IS*);
PETSC_EXTERN PetscErrorCode PetscCDGetMat(const PetscCoarsenData*,Mat*);
PETSC_EXTERN PetscErrorCode PetscCDSetMat(PetscCoarsenData*,Mat);
typedef PetscCDIntNd *PetscCDPos;
PETSC_EXTERN PetscErrorCode PetscCDGetHeadPos(const PetscCoarsenData*,PetscInt,PetscCDPos*);
PETSC_EXTERN PetscErrorCode PetscCDGetNextPos(const PetscCoarsenData*,PetscInt,PetscCDPos*);
PETSC_EXTERN PetscErrorCode PetscCDGetASMBlocks(const PetscCoarsenData*,const PetscInt,PetscInt*,IS**);
/* PetscErrorCode PetscCDSetRemovedIS( PetscCoarsenData *ail, MPI_Comm, const PetscInt, PetscInt[] ); */
/* PetscErrorCode PetscCDGetRemovedIS( PetscCoarsenData *ail, IS * ); */
/*
MatFDColoring is used to compute Jacobian matrices efficiently
via coloring. The data structure is explained below in an example.
Color = 0 1 0 2 | 2 3 0
---------------------------------------------------
00 01 | 05
10 11 | 14 15 Processor 0
22 23 | 25
32 33 |
===================================================
| 44 45 46
50 | 55 Processor 1
| 64 66
---------------------------------------------------
ncolors = 4;
ncolumns = {2,1,1,0}
columns = {{0,2},{1},{3},{}}
nrows = {4,2,3,3}
rows = {{0,1,2,3},{0,1},{1,2,3},{0,1,2}}
vwscale = {dx(0),dx(1),dx(2),dx(3)} MPI Vec
vscale = {dx(0),dx(1),dx(2),dx(3),dx(4),dx(5)} Seq Vec
ncolumns = {1,0,1,1}
columns = {{6},{},{4},{5}}
nrows = {3,0,2,2}
rows = {{0,1,2},{},{1,2},{1,2}}
vwscale = {dx(4),dx(5),dx(6)} MPI Vec
vscale = {dx(0),dx(4),dx(5),dx(6)} Seq Vec
See the routine MatFDColoringApply() for how this data is used
to compute the Jacobian.
*/
typedef struct {
PetscInt row;
PetscInt col;
PetscScalar *valaddr; /* address of value */
} MatEntry;
typedef struct {
PetscInt row;
PetscScalar *valaddr; /* address of value */
} MatEntry2;
struct _p_MatFDColoring{
PETSCHEADER(int);
PetscInt M,N,m; /* total rows, columns; local rows */
PetscInt rstart; /* first row owned by local processor */
PetscInt ncolors; /* number of colors */
PetscInt *ncolumns; /* number of local columns for a color */
PetscInt **columns; /* lists the local columns of each color (using global column numbering) */
PetscInt *nrows; /* number of local rows for each color */
MatEntry *matentry; /* holds (row, column, address of value) for Jacobian matrix entry */
MatEntry2 *matentry2; /* holds (row, address of value) for Jacobian matrix entry */
PetscScalar *dy; /* store a block of F(x+dx)-F(x) when J is in BAIJ format */
PetscReal error_rel; /* square root of relative error in computing function */
PetscReal umin; /* minimum allowable u'dx value */
Vec w1,w2,w3; /* work vectors used in computing Jacobian */
PetscBool fset; /* indicates that the initial function value F(X) is set */
PetscErrorCode (*f)(void); /* function that defines Jacobian */
void *fctx; /* optional user-defined context for use by the function f */
Vec vscale; /* holds FD scaling, i.e. 1/dx for each perturbed column */
PetscInt currentcolor; /* color for which function evaluation is being done now */
const char *htype; /* "wp" or "ds" */
ISColoringType ctype; /* IS_COLORING_GLOBAL or IS_COLORING_GHOSTED */
PetscInt brows,bcols; /* number of block rows or columns for speedup inserting the dense matrix into sparse Jacobian */
PetscBool setupcalled; /* true if setup has been called */
void (*ftn_func_pointer)(void),*ftn_func_cntx; /* serve the same purpose as *fortran_func_pointers in PETSc objects */
};
typedef struct _MatColoringOps *MatColoringOps;
struct _MatColoringOps {
PetscErrorCode (*destroy)(MatColoring);
PetscErrorCode (*setfromoptions)(PetscOptionItems*,MatColoring);
PetscErrorCode (*view)(MatColoring,PetscViewer);
PetscErrorCode (*apply)(MatColoring,ISColoring*);
PetscErrorCode (*weights)(MatColoring,PetscReal**,PetscInt**);
};
struct _p_MatColoring {
PETSCHEADER(struct _MatColoringOps);
Mat mat;
PetscInt dist; /* distance of the coloring */
PetscInt maxcolors; /* the maximum number of colors returned, maxcolors=1 for MIS */
void *data; /* inner context */
PetscBool valid; /* check to see if what is produced is a valid coloring */
MatColoringWeightType weight_type; /* type of weight computation to be performed */
PetscReal *user_weights; /* custom weights and permutation */
PetscInt *user_lperm;
};
struct _p_MatTransposeColoring{
PETSCHEADER(int);
PetscInt M,N,m; /* total rows, columns; local rows */
PetscInt rstart; /* first row owned by local processor */
PetscInt ncolors; /* number of colors */
PetscInt *ncolumns; /* number of local columns for a color */
PetscInt *nrows; /* number of local rows for each color */
PetscInt currentcolor; /* color for which function evaluation is being done now */
ISColoringType ctype; /* IS_COLORING_GLOBAL or IS_COLORING_GHOSTED */
PetscInt *colorforrow,*colorforcol; /* pointer to rows and columns */
PetscInt *rows; /* lists the local rows for each color (using the local row numbering) */
PetscInt *den2sp; /* maps (row,color) in the dense matrix to index of sparse matrix array a->a */
PetscInt *columns; /* lists the local columns of each color (using global column numbering) */
PetscInt brows; /* number of rows for efficient implementation of MatTransColoringApplyDenToSp() */
PetscInt *lstart; /* array used for loop over row blocks of Csparse */
};
/*
Null space context for preconditioner/operators
*/
struct _p_MatNullSpace {
PETSCHEADER(int);
PetscBool has_cnst;
PetscInt n;
Vec* vecs;
PetscScalar* alpha; /* for projections */
PetscErrorCode (*remove)(MatNullSpace,Vec,void*); /* for user provided removal function */
void* rmctx; /* context for remove() function */
};
/*
Checking zero pivot for LU, ILU preconditioners.
*/
typedef struct {
PetscInt nshift,nshift_max;
PetscReal shift_amount,shift_lo,shift_hi,shift_top,shift_fraction;
PetscBool newshift;
PetscReal rs; /* active row sum of abs(offdiagonals) */
PetscScalar pv; /* pivot of the active row */
} FactorShiftCtx;
PETSC_EXTERN PetscErrorCode MatFactorDumpMatrix(Mat);
PETSC_INTERN PetscErrorCode MatShift_Basic(Mat,PetscScalar);
#undef __FUNCT__
#define __FUNCT__ "MatPivotCheck_nz"
PETSC_STATIC_INLINE PetscErrorCode MatPivotCheck_nz(Mat mat,const MatFactorInfo *info,FactorShiftCtx *sctx,PetscInt row)
{
PetscReal _rs = sctx->rs;
PetscReal _zero = info->zeropivot*_rs;
PetscFunctionBegin;
if (PetscAbsScalar(sctx->pv) <= _zero && !PetscIsNanScalar(sctx->pv)){
/* force |diag| > zeropivot*rs */
if (!sctx->nshift) sctx->shift_amount = info->shiftamount;
else sctx->shift_amount *= 2.0;
sctx->newshift = PETSC_TRUE;
(sctx->nshift)++;
} else {
sctx->newshift = PETSC_FALSE;
}
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "MatPivotCheck_pd"
PETSC_STATIC_INLINE PetscErrorCode MatPivotCheck_pd(Mat mat,const MatFactorInfo *info,FactorShiftCtx *sctx,PetscInt row)
{
PetscReal _rs = sctx->rs;
PetscReal _zero = info->zeropivot*_rs;
PetscFunctionBegin;
if (PetscRealPart(sctx->pv) <= _zero && !PetscIsNanScalar(sctx->pv)){
/* force matfactor to be diagonally dominant */
if (sctx->nshift == sctx->nshift_max) {
sctx->shift_fraction = sctx->shift_hi;
} else {
sctx->shift_lo = sctx->shift_fraction;
sctx->shift_fraction = (sctx->shift_hi+sctx->shift_lo)/2.;
}
sctx->shift_amount = sctx->shift_fraction * sctx->shift_top;
sctx->nshift++;
sctx->newshift = PETSC_TRUE;
} else {
sctx->newshift = PETSC_FALSE;
}
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "MatPivotCheck_inblocks"
PETSC_STATIC_INLINE PetscErrorCode MatPivotCheck_inblocks(Mat mat,const MatFactorInfo *info,FactorShiftCtx *sctx,PetscInt row)
{
PetscReal _zero = info->zeropivot;
PetscFunctionBegin;
if (PetscAbsScalar(sctx->pv) <= _zero && !PetscIsNanScalar(sctx->pv)){
sctx->pv += info->shiftamount;
sctx->shift_amount = 0.0;
sctx->nshift++;
}
sctx->newshift = PETSC_FALSE;
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "MatPivotCheck_none"
PETSC_STATIC_INLINE PetscErrorCode MatPivotCheck_none(Mat fact,Mat mat,const MatFactorInfo *info,FactorShiftCtx *sctx,PetscInt row)
{
PetscReal _zero = info->zeropivot;
PetscErrorCode ierr;
PetscFunctionBegin;
sctx->newshift = PETSC_FALSE;
if (PetscAbsScalar(sctx->pv) <= _zero && !PetscIsNanScalar(sctx->pv)) {
if (!mat->erroriffailure) {
ierr = PetscInfo3(mat,"Detected zero pivot in factorization in row %D value %g tolerance %g",row,(double)PetscAbsScalar(sctx->pv),(double)_zero);CHKERRQ(ierr);
fact->errortype = MAT_FACTOR_NUMERIC_ZEROPIVOT;
} else SETERRQ3(PETSC_COMM_SELF,PETSC_ERR_MAT_LU_ZRPVT,"Zero pivot row %D value %g tolerance %g",row,(double)PetscAbsScalar(sctx->pv),(double)_zero);
}
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "MatPivotCheck"
PETSC_STATIC_INLINE PetscErrorCode MatPivotCheck(Mat fact,Mat mat,const MatFactorInfo *info,FactorShiftCtx *sctx,PetscInt row)
{
PetscErrorCode ierr;
PetscFunctionBegin;
if (info->shifttype == (PetscReal) MAT_SHIFT_NONZERO){
ierr = MatPivotCheck_nz(mat,info,sctx,row);CHKERRQ(ierr);
} else if (info->shifttype == (PetscReal) MAT_SHIFT_POSITIVE_DEFINITE){
ierr = MatPivotCheck_pd(mat,info,sctx,row);CHKERRQ(ierr);
} else if (info->shifttype == (PetscReal) MAT_SHIFT_INBLOCKS){
ierr = MatPivotCheck_inblocks(mat,info,sctx,row);CHKERRQ(ierr);
} else {
ierr = MatPivotCheck_none(fact,mat,info,sctx,row);CHKERRQ(ierr);
}
PetscFunctionReturn(0);
}
/*
Create and initialize a linked list
Input Parameters:
idx_start - starting index of the list
lnk_max - max value of lnk indicating the end of the list
nlnk - max length of the list
Output Parameters:
lnk - list initialized
bt - PetscBT (bitarray) with all bits set to false
lnk_empty - flg indicating the list is empty
*/
#define PetscLLCreate(idx_start,lnk_max,nlnk,lnk,bt) \
(PetscMalloc1(nlnk,&lnk) || PetscBTCreate(nlnk,&(bt)) || (lnk[idx_start] = lnk_max,0))
#define PetscLLCreate_new(idx_start,lnk_max,nlnk,lnk,bt,lnk_empty)\
(PetscMalloc1(nlnk,&lnk) || PetscBTCreate(nlnk,&(bt)) || (lnk_empty = PETSC_TRUE,0) ||(lnk[idx_start] = lnk_max,0))
/*
Add an index set into a sorted linked list
Input Parameters:
nidx - number of input indices
indices - interger array
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
nlnk - number of newly added indices
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from indices
bt - updated PetscBT (bitarray)
*/
#define PetscLLAdd(nidx,indices,idx_start,nlnk,lnk,bt) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_entry = indices[_k];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
/* start from the beginning if _entry < previous _entry */\
if (_k && _entry < _lnkdata) _lnkdata = idx_start;\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here if next_entry > _entry */\
}\
}\
}
/*
Add a permuted index set into a sorted linked list
Input Parameters:
nidx - number of input indices
indices - interger array
perm - permutation of indices
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
nlnk - number of newly added indices
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from indices
bt - updated PetscBT (bitarray)
*/
#define PetscLLAddPerm(nidx,indices,perm,idx_start,nlnk,lnk,bt) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_entry = perm[indices[_k]];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
/* start from the beginning if _entry < previous _entry */\
if (_k && _entry < _lnkdata) _lnkdata = idx_start;\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here if next_entry > _entry */\
}\
}\
}
/*
Add a SORTED ascending index set into a sorted linked list - same as PetscLLAdd() bus skip 'if (_k && _entry < _lnkdata) _lnkdata = idx_start;'
Input Parameters:
nidx - number of input indices
indices - sorted interger array
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
nlnk - number of newly added indices
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from indices
bt - updated PetscBT (bitarray)
*/
#define PetscLLAddSorted(nidx,indices,idx_start,nlnk,lnk,bt) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_entry = indices[_k];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here */\
}\
}\
}
#define PetscLLAddSorted_new(nidx,indices,idx_start,lnk_empty,nlnk,lnk,bt) 0; \
{\
PetscInt _k,_entry,_location,_lnkdata;\
if (lnk_empty){\
_lnkdata = idx_start; \
for (_k=0; _k<nidx; _k++){ \
_entry = indices[_k]; \
PetscBTSet(bt,_entry); /* mark the new entry */ \
_location = _lnkdata; \
_lnkdata = lnk[_location]; \
/* insertion location is found, add entry into lnk */ \
lnk[_location] = _entry; \
lnk[_entry] = _lnkdata; \
_lnkdata = _entry; /* next search starts from here */ \
} \
/*\
lnk[indices[nidx-1]] = lnk[idx_start];\
lnk[idx_start] = indices[0];\
PetscBTSet(bt,indices[0]); \
for (_k=1; _k<nidx; _k++){ \
PetscBTSet(bt,indices[_k]); \
lnk[indices[_k-1]] = indices[_k]; \
} \
*/\
nlnk = nidx;\
lnk_empty = PETSC_FALSE;\
} else {\
nlnk = 0; \
_lnkdata = idx_start; \
for (_k=0; _k<nidx; _k++){ \
_entry = indices[_k]; \
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */ \
/* search for insertion location */ \
do { \
_location = _lnkdata; \
_lnkdata = lnk[_location]; \
} while (_entry > _lnkdata); \
/* insertion location is found, add entry into lnk */ \
lnk[_location] = _entry; \
lnk[_entry] = _lnkdata; \
nlnk++; \
_lnkdata = _entry; /* next search starts from here */ \
} \
} \
} \
}
/*
Add a SORTED index set into a sorted linked list used for LUFactorSymbolic()
Same as PetscLLAddSorted() with an additional operation:
count the number of input indices that are no larger than 'diag'
Input Parameters:
indices - sorted interger array
idx_start - starting index of the list, index of pivot row
lnk - linked list(an integer array) that is created
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
diag - index of the active row in LUFactorSymbolic
nzbd - number of input indices with indices <= idx_start
im - im[idx_start] is initialized as num of nonzero entries in row=idx_start
output Parameters:
nlnk - number of newly added indices
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from indices
bt - updated PetscBT (bitarray)
im - im[idx_start]: unchanged if diag is not an entry
: num of entries with indices <= diag if diag is an entry
*/
#define PetscLLAddSortedLU(indices,idx_start,nlnk,lnk,bt,diag,nzbd,im) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata,_nidx;\
nlnk = 0;\
_lnkdata = idx_start;\
_nidx = im[idx_start] - nzbd; /* num of entries with idx_start < index <= diag */\
for (_k=0; _k<_nidx; _k++){\
_entry = indices[_k];\
nzbd++;\
if ( _entry== diag) im[idx_start] = nzbd;\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here */\
}\
}\
}
/*
Copy data on the list into an array, then initialize the list
Input Parameters:
idx_start - starting index of the list
lnk_max - max value of lnk indicating the end of the list
nlnk - number of data on the list to be copied
lnk - linked list
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
indices - array that contains the copied data
lnk - linked list that is cleaned and initialize
bt - PetscBT (bitarray) with all bits set to false
*/
#define PetscLLClean(idx_start,lnk_max,nlnk,lnk,indices,bt) 0;\
{\
PetscInt _j,_idx=idx_start;\
for (_j=0; _j<nlnk; _j++){\
_idx = lnk[_idx];\
indices[_j] = _idx;\
ierr = PetscBTClear(bt,_idx);CHKERRQ(ierr);\
}\
lnk[idx_start] = lnk_max;\
}
/*
Free memories used by the list
*/
#define PetscLLDestroy(lnk,bt) (PetscFree(lnk) || PetscBTDestroy(&(bt)))
/* Routines below are used for incomplete matrix factorization */
/*
Create and initialize a linked list and its levels
Input Parameters:
idx_start - starting index of the list
lnk_max - max value of lnk indicating the end of the list
nlnk - max length of the list
Output Parameters:
lnk - list initialized
lnk_lvl - array of size nlnk for storing levels of lnk
bt - PetscBT (bitarray) with all bits set to false
*/
#define PetscIncompleteLLCreate(idx_start,lnk_max,nlnk,lnk,lnk_lvl,bt)\
(PetscIntMultError(2,nlnk,NULL) || PetscMalloc1(2*nlnk,&lnk) || PetscBTCreate(nlnk,&(bt)) || (lnk[idx_start] = lnk_max,lnk_lvl = lnk + nlnk,0))
/*
Initialize a sorted linked list used for ILU and ICC
Input Parameters:
nidx - number of input idx
idx - interger array used for storing column indices
idx_start - starting index of the list
perm - indices of an IS
lnk - linked list(an integer array) that is created
lnklvl - levels of lnk
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
nlnk - number of newly added idx
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from idx
lnklvl - levels of lnk
bt - updated PetscBT (bitarray)
*/
#define PetscIncompleteLLInit(nidx,idx,idx_start,perm,nlnk,lnk,lnklvl,bt) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_entry = perm[idx[_k]];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
if (_k && _entry < _lnkdata) _lnkdata = idx_start;\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
lnklvl[_entry] = 0;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here if next_entry > _entry */\
}\
}\
}
/*
Add a SORTED index set into a sorted linked list for ILU
Input Parameters:
nidx - number of input indices
idx - sorted interger array used for storing column indices
level - level of fill, e.g., ICC(level)
idxlvl - level of idx
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
lnklvl - levels of lnk
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
prow - the row number of idx
output Parameters:
nlnk - number of newly added idx
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from idx
lnklvl - levels of lnk
bt - updated PetscBT (bitarray)
Note: the level of factor(i,j) is set as lvl(i,j) = min{ lvl(i,j), lvl(i,prow)+lvl(prow,j)+1)
where idx = non-zero columns of U(prow,prow+1:n-1), prow<i
*/
#define PetscILULLAddSorted(nidx,idx,level,idxlvl,idx_start,nlnk,lnk,lnklvl,bt,lnklvl_prow) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata,_incrlev,_lnklvl_prow=lnklvl[prow];\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_incrlev = idxlvl[_k] + _lnklvl_prow + 1;\
if (_incrlev > level) continue;\
_entry = idx[_k];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
lnklvl[_entry] = _incrlev;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here if next_entry > _entry */\
} else { /* existing entry: update lnklvl */\
if (lnklvl[_entry] > _incrlev) lnklvl[_entry] = _incrlev;\
}\
}\
}
/*
Add a index set into a sorted linked list
Input Parameters:
nidx - number of input idx
idx - interger array used for storing column indices
level - level of fill, e.g., ICC(level)
idxlvl - level of idx
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
lnklvl - levels of lnk
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
nlnk - number of newly added idx
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from idx
lnklvl - levels of lnk
bt - updated PetscBT (bitarray)
*/
#define PetscIncompleteLLAdd(nidx,idx,level,idxlvl,idx_start,nlnk,lnk,lnklvl,bt) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata,_incrlev;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_incrlev = idxlvl[_k] + 1;\
if (_incrlev > level) continue;\
_entry = idx[_k];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
if (_k && _entry < _lnkdata) _lnkdata = idx_start;\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
lnklvl[_entry] = _incrlev;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here if next_entry > _entry */\
} else { /* existing entry: update lnklvl */\
if (lnklvl[_entry] > _incrlev) lnklvl[_entry] = _incrlev;\
}\
}\
}
/*
Add a SORTED index set into a sorted linked list
Input Parameters:
nidx - number of input indices
idx - sorted interger array used for storing column indices
level - level of fill, e.g., ICC(level)
idxlvl - level of idx
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
lnklvl - levels of lnk
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
nlnk - number of newly added idx
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from idx
lnklvl - levels of lnk
bt - updated PetscBT (bitarray)
*/
#define PetscIncompleteLLAddSorted(nidx,idx,level,idxlvl,idx_start,nlnk,lnk,lnklvl,bt) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata,_incrlev;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_incrlev = idxlvl[_k] + 1;\
if (_incrlev > level) continue;\
_entry = idx[_k];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
lnklvl[_entry] = _incrlev;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here */\
} else { /* existing entry: update lnklvl */\
if (lnklvl[_entry] > _incrlev) lnklvl[_entry] = _incrlev;\
}\
}\
}
/*
Add a SORTED index set into a sorted linked list for ICC
Input Parameters:
nidx - number of input indices
idx - sorted interger array used for storing column indices
level - level of fill, e.g., ICC(level)
idxlvl - level of idx
idx_start - starting index of the list
lnk - linked list(an integer array) that is created
lnklvl - levels of lnk
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
idxlvl_prow - idxlvl[prow], where prow is the row number of the idx
output Parameters:
nlnk - number of newly added indices
lnk - the sorted(increasing order) linked list containing new and non-redundate entries from idx
lnklvl - levels of lnk
bt - updated PetscBT (bitarray)
Note: the level of U(i,j) is set as lvl(i,j) = min{ lvl(i,j), lvl(prow,i)+lvl(prow,j)+1)
where idx = non-zero columns of U(prow,prow+1:n-1), prow<i
*/
#define PetscICCLLAddSorted(nidx,idx,level,idxlvl,idx_start,nlnk,lnk,lnklvl,bt,idxlvl_prow) 0;\
{\
PetscInt _k,_entry,_location,_lnkdata,_incrlev;\
nlnk = 0;\
_lnkdata = idx_start;\
for (_k=0; _k<nidx; _k++){\
_incrlev = idxlvl[_k] + idxlvl_prow + 1;\
if (_incrlev > level) continue;\
_entry = idx[_k];\
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */\
/* search for insertion location */\
do {\
_location = _lnkdata;\
_lnkdata = lnk[_location];\
} while (_entry > _lnkdata);\
/* insertion location is found, add entry into lnk */\
lnk[_location] = _entry;\
lnk[_entry] = _lnkdata;\
lnklvl[_entry] = _incrlev;\
nlnk++;\
_lnkdata = _entry; /* next search starts from here */\
} else { /* existing entry: update lnklvl */\
if (lnklvl[_entry] > _incrlev) lnklvl[_entry] = _incrlev;\
}\
}\
}
/*
Copy data on the list into an array, then initialize the list
Input Parameters:
idx_start - starting index of the list
lnk_max - max value of lnk indicating the end of the list
nlnk - number of data on the list to be copied
lnk - linked list
lnklvl - level of lnk
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
indices - array that contains the copied data
lnk - linked list that is cleaned and initialize
lnklvl - level of lnk that is reinitialized
bt - PetscBT (bitarray) with all bits set to false
*/
#define PetscIncompleteLLClean(idx_start,lnk_max,nlnk,lnk,lnklvl,indices,indiceslvl,bt) 0;\
{\
PetscInt _j,_idx=idx_start;\
for (_j=0; _j<nlnk; _j++){\
_idx = lnk[_idx];\
*(indices+_j) = _idx;\
*(indiceslvl+_j) = lnklvl[_idx];\
lnklvl[_idx] = -1;\
ierr = PetscBTClear(bt,_idx);CHKERRQ(ierr);\
}\
lnk[idx_start] = lnk_max;\
}
/*
Free memories used by the list
*/
#define PetscIncompleteLLDestroy(lnk,bt) (PetscFree(lnk) || PetscBTDestroy(&(bt)))
/* -------------------------------------------------------------------------------------------------------*/
#include <petscbt.h>
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedCreate"
/*
Create and initialize a condensed linked list -
same as PetscLLCreate(), but uses a scalable array 'lnk' with size of max number of entries, not O(N).
Barry suggested this approach (Dec. 6, 2011):
I've thought of an alternative way of representing a linked list that is efficient but doesn't have the O(N) scaling issue
(it may be faster than the O(N) even sequentially due to less crazy memory access).
Instead of having some like a 2 -> 4 -> 11 -> 22 list that uses slot 2 4 11 and 22 in a big array use a small array with two slots
for each entry for example [ 2 1 | 4 3 | 22 -1 | 11 2] so the first number (of the pair) is the value while the second tells you where
in the list the next entry is. Inserting a new link means just append another pair at the end. For example say we want to insert 13 into the
list it would then become [2 1 | 4 3 | 22 -1 | 11 4 | 13 2 ] you just add a pair at the end and fix the point for the one that points to it.
That is 11 use to point to the 2 slot, after the change 11 points to the 4th slot which has the value 13. Note that values are always next
to each other so memory access is much better than using the big array.
Example:
nlnk_max=5, lnk_max=36:
Initial list: [0, 0 | 36, 2 | 0, 0 | 0, 0 | 0, 0 | 0, 0 | 0, 0]
here, head_node has index 2 with value lnk[2]=lnk_max=36,
0-th entry is used to store the number of entries in the list,
The initial lnk represents head -> tail(marked by 36) with number of entries = lnk[0]=0.
Now adding a sorted set {2,4}, the list becomes
[2, 0 | 36, 4 |2, 6 | 4, 2 | 0, 0 | 0, 0 | 0, 0 ]
represents head -> 2 -> 4 -> tail with number of entries = lnk[0]=2.
Then adding a sorted set {0,3,35}, the list
[5, 0 | 36, 8 | 2, 10 | 4, 12 | 0, 4 | 3, 6 | 35, 2 ]
represents head -> 0 -> 2 -> 3 -> 4 -> 35 -> tail with number of entries = lnk[0]=5.
Input Parameters:
nlnk_max - max length of the list
lnk_max - max value of the entries
Output Parameters:
lnk - list created and initialized
bt - PetscBT (bitarray) with all bits set to false. Note: bt has size lnk_max, not nln_max!
*/
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedCreate(PetscInt nlnk_max,PetscInt lnk_max,PetscInt **lnk,PetscBT *bt)
{
PetscErrorCode ierr;
PetscInt *llnk,lsize = 0;
PetscFunctionBegin;
ierr = PetscIntMultError(2,nlnk_max+2,&lsize);CHKERRQ(ierr);
ierr = PetscMalloc1(lsize,lnk);CHKERRQ(ierr);
ierr = PetscBTCreate(lnk_max,bt);CHKERRQ(ierr);
llnk = *lnk;
llnk[0] = 0; /* number of entries on the list */
llnk[2] = lnk_max; /* value in the head node */
llnk[3] = 2; /* next for the head node */
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedAddSorted"
/*
Add a SORTED ascending index set into a sorted linked list. See PetscLLCondensedCreate() for detailed description.
Input Parameters:
nidx - number of input indices
indices - sorted interger array
lnk - condensed linked list(an integer array) that is created
bt - PetscBT (bitarray), bt[idx]=true marks idx is in lnk
output Parameters:
lnk - the sorted(increasing order) linked list containing previous and newly added non-redundate indices
bt - updated PetscBT (bitarray)
*/
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedAddSorted(PetscInt nidx,const PetscInt indices[],PetscInt lnk[],PetscBT bt)
{
PetscInt _k,_entry,_location,_next,_lnkdata,_nlnk,_newnode;
PetscFunctionBegin;
_nlnk = lnk[0]; /* num of entries on the input lnk */
_location = 2; /* head */
for (_k=0; _k<nidx; _k++){
_entry = indices[_k];
if (!PetscBTLookupSet(bt,_entry)){ /* new entry */
/* search for insertion location */
do {
_next = _location + 1; /* link from previous node to next node */
_location = lnk[_next]; /* idx of next node */
_lnkdata = lnk[_location];/* value of next node */
} while (_entry > _lnkdata);
/* insertion location is found, add entry into lnk */
_newnode = 2*(_nlnk+2); /* index for this new node */
lnk[_next] = _newnode; /* connect previous node to the new node */
lnk[_newnode] = _entry; /* set value of the new node */
lnk[_newnode+1] = _location; /* connect new node to next node */
_location = _newnode; /* next search starts from the new node */
_nlnk++;
} \
}\
lnk[0] = _nlnk; /* number of entries in the list */
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedClean"
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedClean(PetscInt lnk_max,PetscInt nidx,PetscInt *indices,PetscInt lnk[],PetscBT bt)
{
PetscErrorCode ierr;
PetscInt _k,_next,_nlnk;
PetscFunctionBegin;
_next = lnk[3]; /* head node */
_nlnk = lnk[0]; /* num of entries on the list */
for (_k=0; _k<_nlnk; _k++){
indices[_k] = lnk[_next];
_next = lnk[_next + 1];
ierr = PetscBTClear(bt,indices[_k]);CHKERRQ(ierr);
}
lnk[0] = 0; /* num of entries on the list */
lnk[2] = lnk_max; /* initialize head node */
lnk[3] = 2; /* head node */
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedView"
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedView(PetscInt *lnk)
{
PetscErrorCode ierr;
PetscInt k;
PetscFunctionBegin;
ierr = PetscPrintf(PETSC_COMM_SELF,"LLCondensed of size %D, (val, next)\n",lnk[0]);CHKERRQ(ierr);
for (k=2; k< lnk[0]+2; k++){
ierr = PetscPrintf(PETSC_COMM_SELF," %D: (%D, %D)\n",2*k,lnk[2*k],lnk[2*k+1]);CHKERRQ(ierr);
}
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedDestroy"
/*
Free memories used by the list
*/
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedDestroy(PetscInt *lnk,PetscBT bt)
{
PetscErrorCode ierr;
PetscFunctionBegin;
ierr = PetscFree(lnk);CHKERRQ(ierr);
ierr = PetscBTDestroy(&bt);CHKERRQ(ierr);
PetscFunctionReturn(0);
}
/* -------------------------------------------------------------------------------------------------------*/
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedCreate_Scalable"
/*
Same as PetscLLCondensedCreate(), but does not use non-scalable O(lnk_max) bitarray
Input Parameters:
nlnk_max - max length of the list
Output Parameters:
lnk - list created and initialized
*/
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedCreate_Scalable(PetscInt nlnk_max,PetscInt **lnk)
{
PetscErrorCode ierr;
PetscInt *llnk,lsize = 0;
PetscFunctionBegin;
ierr = PetscIntMultError(2,nlnk_max+2,&lsize);CHKERRQ(ierr);
ierr = PetscMalloc1(lsize,lnk);CHKERRQ(ierr);
llnk = *lnk;
llnk[0] = 0; /* number of entries on the list */
llnk[2] = PETSC_MAX_INT; /* value in the head node */
llnk[3] = 2; /* next for the head node */
PetscFunctionReturn(0);
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedAddSorted_Scalable"
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedAddSorted_Scalable(PetscInt nidx,const PetscInt indices[],PetscInt lnk[])
{
PetscInt _k,_entry,_location,_next,_lnkdata,_nlnk,_newnode;
_nlnk = lnk[0]; /* num of entries on the input lnk */
_location = 2; /* head */ \
for (_k=0; _k<nidx; _k++){
_entry = indices[_k];
/* search for insertion location */
do {
_next = _location + 1; /* link from previous node to next node */
_location = lnk[_next]; /* idx of next node */
_lnkdata = lnk[_location];/* value of next node */
} while (_entry > _lnkdata);
if (_entry < _lnkdata) {
/* insertion location is found, add entry into lnk */
_newnode = 2*(_nlnk+2); /* index for this new node */
lnk[_next] = _newnode; /* connect previous node to the new node */
lnk[_newnode] = _entry; /* set value of the new node */
lnk[_newnode+1] = _location; /* connect new node to next node */
_location = _newnode; /* next search starts from the new node */
_nlnk++;
}
}
lnk[0] = _nlnk; /* number of entries in the list */
return 0;
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedClean_Scalable"
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedClean_Scalable(PetscInt nidx,PetscInt *indices,PetscInt *lnk)
{
PetscInt _k,_next,_nlnk;
_next = lnk[3]; /* head node */
_nlnk = lnk[0];
for (_k=0; _k<_nlnk; _k++){
indices[_k] = lnk[_next];
_next = lnk[_next + 1];
}
lnk[0] = 0; /* num of entries on the list */
lnk[3] = 2; /* head node */
return 0;
}
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedDestroy_Scalable"
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedDestroy_Scalable(PetscInt *lnk)
{
return PetscFree(lnk);
}
/* -------------------------------------------------------------------------------------------------------*/
/*
lnk[0] number of links
lnk[1] number of entries
lnk[3n] value
lnk[3n+1] len
lnk[3n+2] link to next value
The next three are always the first link
lnk[3] PETSC_MIN_INT+1
lnk[4] 1
lnk[5] link to first real entry
The next three are always the last link
lnk[6] PETSC_MAX_INT - 1
lnk[7] 1
lnk[8] next valid link (this is the same as lnk[0] but without the decreases)
*/
#undef __FUNCT__
#define __FUNCT__ "PetscLLCondensedCreate_fast"
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedCreate_fast(PetscInt nlnk_max,PetscInt **lnk)
{
PetscErrorCode ierr;
PetscInt *llnk,lsize = 0;
PetscFunctionBegin;
ierr = PetscIntMultError(3,nlnk_max+3,&lsize);CHKERRQ(ierr);
ierr = PetscMalloc1(lsize,lnk);CHKERRQ(ierr);
llnk = *lnk;
llnk[0] = 0; /* nlnk: number of entries on the list */
llnk[1] = 0; /* number of integer entries represented in list */
llnk[3] = PETSC_MIN_INT+1; /* value in the first node */
llnk[4] = 1; /* count for the first node */
llnk[5] = 6; /* next for the first node */
llnk[6] = PETSC_MAX_INT-1; /* value in the last node */
llnk[7] = 1; /* count for the last node */
llnk[8] = 0; /* next valid node to be used */
PetscFunctionReturn(0);
}
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedAddSorted_fast(PetscInt nidx,const PetscInt indices[],PetscInt lnk[])
{
PetscInt k,entry,prev,next;
prev = 3; /* first value */
next = lnk[prev+2];
for (k=0; k<nidx; k++){
entry = indices[k];
/* search for insertion location */
while (entry >= lnk[next]) {
prev = next;
next = lnk[next+2];
}
/* entry is in range of previous list */
if (entry < lnk[prev]+lnk[prev+1]) continue;
lnk[1]++;
/* entry is right after previous list */
if (entry == lnk[prev]+lnk[prev+1]) {
lnk[prev+1]++;
if (lnk[next] == entry+1) { /* combine two contiquous strings */
lnk[prev+1] += lnk[next+1];
lnk[prev+2] = lnk[next+2];
next = lnk[next+2];
lnk[0]--;
}
continue;
}
/* entry is right before next list */
if (entry == lnk[next]-1) {
lnk[next]--;
lnk[next+1]++;
prev = next;
next = lnk[prev+2];
continue;
}
/* add entry into lnk */
lnk[prev+2] = 3*((lnk[8]++)+3); /* connect previous node to the new node */
prev = lnk[prev+2];
lnk[prev] = entry; /* set value of the new node */
lnk[prev+1] = 1; /* number of values in contiquous string is one to start */
lnk[prev+2] = next; /* connect new node to next node */
lnk[0]++;
}
return 0;
}
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedClean_fast(PetscInt nidx,PetscInt *indices,PetscInt *lnk)
{
PetscInt _k,_next,_nlnk,cnt,j;
_next = lnk[5]; /* first node */
_nlnk = lnk[0];
cnt = 0;
for (_k=0; _k<_nlnk; _k++){
for (j=0; j<lnk[_next+1]; j++) {
indices[cnt++] = lnk[_next] + j;
}
_next = lnk[_next + 2];
}
lnk[0] = 0; /* nlnk: number of links */
lnk[1] = 0; /* number of integer entries represented in list */
lnk[3] = PETSC_MIN_INT+1; /* value in the first node */
lnk[4] = 1; /* count for the first node */
lnk[5] = 6; /* next for the first node */
lnk[6] = PETSC_MAX_INT-1; /* value in the last node */
lnk[7] = 1; /* count for the last node */
lnk[8] = 0; /* next valid location to make link */
return 0;
}
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedView_fast(PetscInt *lnk)
{
PetscInt k,next,nlnk;
next = lnk[5]; /* first node */
nlnk = lnk[0];
for (k=0; k<nlnk; k++){
#if 0 /* Debugging code */
printf("%d value %d len %d next %d\n",next,lnk[next],lnk[next+1],lnk[next+2]);
#endif
next = lnk[next + 2];
}
return 0;
}
PETSC_STATIC_INLINE PetscErrorCode PetscLLCondensedDestroy_fast(PetscInt *lnk)
{
return PetscFree(lnk);
}
/* alias PetscSortIntWithScalarArray while MatScalar == PetscScalar */
PETSC_STATIC_INLINE PetscErrorCode PetscSortIntWithMatScalarArray(PetscInt n,PetscInt *idx,PetscScalar *val)
{
#if !defined(PETSC_USE_REAL_MAT_SINGLE)
return PetscSortIntWithScalarArray(n,idx,val);
#else
{
MatScalar mtmp;
return PetscSortIntWithDataArray(n,idx,val,sizeof(MatScalar),&mtmp);
}
#endif
}
PETSC_EXTERN PetscLogEvent MAT_Mult, MAT_MultMatrixFree, MAT_Mults, MAT_MultConstrained, MAT_MultAdd, MAT_MultTranspose;
PETSC_EXTERN PetscLogEvent MAT_MultTransposeConstrained, MAT_MultTransposeAdd, MAT_Solve, MAT_Solves, MAT_SolveAdd, MAT_SolveTranspose;
PETSC_EXTERN PetscLogEvent MAT_SolveTransposeAdd, MAT_SOR, MAT_ForwardSolve, MAT_BackwardSolve, MAT_LUFactor, MAT_LUFactorSymbolic;
PETSC_EXTERN PetscLogEvent MAT_LUFactorNumeric, MAT_CholeskyFactor, MAT_CholeskyFactorSymbolic, MAT_CholeskyFactorNumeric, MAT_ILUFactor;
PETSC_EXTERN PetscLogEvent MAT_ILUFactorSymbolic, MAT_ICCFactorSymbolic, MAT_Copy, MAT_Convert, MAT_Scale, MAT_AssemblyBegin;
PETSC_EXTERN PetscLogEvent MAT_AssemblyEnd, MAT_SetValues, MAT_GetValues, MAT_GetRow, MAT_GetRowIJ, MAT_GetSubMatrices, MAT_GetColoring, MAT_GetOrdering, MAT_RedundantMat;
PETSC_EXTERN PetscLogEvent MAT_IncreaseOverlap, MAT_Partitioning, MAT_Coarsen, MAT_ZeroEntries, MAT_Load, MAT_View, MAT_AXPY, MAT_FDColoringCreate, MAT_TransposeColoringCreate;
PETSC_EXTERN PetscLogEvent MAT_FDColoringSetUp, MAT_FDColoringApply, MAT_Transpose, MAT_FDColoringFunction,MAT_GetSubMatrix;
PETSC_EXTERN PetscLogEvent MAT_MatMult, MAT_MatSolve,MAT_MatMultSymbolic, MAT_MatMultNumeric,MAT_Getlocalmatcondensed,MAT_GetBrowsOfAcols,MAT_GetBrowsOfAocols;
PETSC_EXTERN PetscLogEvent MAT_PtAP, MAT_PtAPSymbolic, MAT_PtAPNumeric,MAT_Seqstompinum,MAT_Seqstompisym,MAT_Seqstompi,MAT_Getlocalmat;
PETSC_EXTERN PetscLogEvent MAT_RARt, MAT_RARtSymbolic, MAT_RARtNumeric;
PETSC_EXTERN PetscLogEvent MAT_MatTransposeMult, MAT_MatTransposeMultSymbolic, MAT_MatTransposeMultNumeric;
PETSC_EXTERN PetscLogEvent MAT_TransposeMatMult, MAT_TransposeMatMultSymbolic, MAT_TransposeMatMultNumeric;
PETSC_EXTERN PetscLogEvent MAT_MatMatMult, MAT_MatMatMultSymbolic, MAT_MatMatMultNumeric;
PETSC_EXTERN PetscLogEvent MAT_Applypapt, MAT_Applypapt_symbolic, MAT_Applypapt_numeric;
PETSC_EXTERN PetscLogEvent MAT_Getsymtranspose, MAT_Transpose_SeqAIJ, MAT_Getsymtransreduced,MAT_GetSequentialNonzeroStructure;
PETSC_EXTERN PetscLogEvent MATMFFD_Mult;
PETSC_EXTERN PetscLogEvent MAT_GetMultiProcBlock;
PETSC_EXTERN PetscLogEvent MAT_CUSPCopyToGPU, MAT_CUSPARSECopyToGPU, MAT_SetValuesBatch, MAT_SetValuesBatchI, MAT_SetValuesBatchII, MAT_SetValuesBatchIII, MAT_SetValuesBatchIV;
PETSC_EXTERN PetscLogEvent MAT_ViennaCLCopyToGPU;
PETSC_EXTERN PetscLogEvent MAT_Merge,MAT_Residual;
PETSC_EXTERN PetscLogEvent Mat_Coloring_Apply,Mat_Coloring_Comm,Mat_Coloring_Local,Mat_Coloring_ISCreate,Mat_Coloring_SetUp,Mat_Coloring_Weights;
#endif
|