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
|
.. meta::
:description: rocSPARSE documentation and API reference library
:keywords: rocSPARSE, ROCm, API, documentation
.. _rocsparse_docs:
********************************************************************
rocSPARSE user guide
********************************************************************
HIP Device Management
=====================
Before starting a HIP kernel you can call :cpp:func:`hipSetDevice` to set the device to run the kernel on, for example device 2. Unless you explicitly specify a different device HIP kernels always run on device 0. This is a HIP (and CUDA) device management approach and is not specific to the rocSPARSE library. rocSPARSE honors this approach and assumes you have set the preferred device before a rocSPARSE routine call.
Once you set the device, you can create a handle with :ref:`rocsparse_create_handle_`. Subsequent rocSPARSE routines take this handle as an input parameter. rocSPARSE ONLY queries (by :cpp:func:`hipGetDevice`) the user's device; rocSPARSE does NOT set the device for users. If rocSPARSE does not see a valid device, it returns an error message. It is your responsibility to provide a valid device to rocSPARSE and ensure the device safety.
The handle should be destroyed at the end using :ref:`rocsparse_destroy_handle_` to release the resources consumed by the rocSPARSE library. You CANNOT switch devices between :ref:`rocsparse_create_handle_` and :ref:`rocsparse_destroy_handle_`. If you want to change the device, you must destroy the current handle and create another rocSPARSE handle on a new device.
.. note::
:cpp:func:`hipSetDevice` and :cpp:func:`hipGetDevice` are NOT part of the rocSPARSE API. They are part of the `HIP Runtime API - Device Management <https://rocm.docs.amd.com/projects/HIP/en/latest/doxygen/html/group___device.html>`_.
HIP Stream Management
=====================
HIP kernels are always launched in a queue (also known as a stream). If you do not explicitly specify a stream, the system provides and maintains a default stream. You cannot create or destroy the default stream. However, you can freely create new streams (with :cpp:func:`hipStreamCreate`) and bind it to a rocSPARSE handle using :ref:`rocsparse_set_stream_`. HIP kernels are invoked in rocSPARSE routines. The rocSPARSE handle is always associated with a stream, and rocSPARSE passes its stream to the kernels inside the routine. One rocSPARSE routine only takes one stream in a single invocation. If you create a stream, you are responsible for destroying it. Refer to `HIP Runtime API - Stream Management <https://rocm.docs.amd.com/projects/HIP/en/latest/doxygen/html/group___stream.html>`_ for more information.
Asynchronous Execution
======================
All rocSPARSE library functions are non-blocking and executed asynchronously with respect to the host, except functions having memory allocation inside preventing asynchronicity. The function may return immediately, or before the actual computation has finished. To force synchronization, use either :cpp:func:`hipDeviceSynchronize` or :cpp:func:`hipStreamSynchronize`. This will ensure that all previously executed rocSPARSE functions on the device, or in the particular stream, have completed.
Multiple Streams and Multiple Devices
=====================================
If a system has multiple HIP devices, you can run multiple rocSPARSE handles concurrently. However, you can NOT run a single rocSPARSE handle concurrently on multiple discrete devices. Each handle can only be associated with a single device, and a new handle should be created for each additional device.
Graph Support for rocSPARSE
===========================
Many of the rocSPARSE functions can be captured into a graph node via Graph Management HIP APIs. See :ref:`Functions Supported with Graph Capture` to determine
whether a rocSPARSE routine is supported or not. For a list of graph related HIP APIs, refer to `Graph Management HIP API <https://rocm.docs.amd.com/projects/HIP/en/latest/doxygen/html/group___graph.html#graph-management>`_.
.. code-block:: c++
CHECK_HIP_ERROR((hipStreamBeginCapture(stream, hipStreamCaptureModeGlobal));
rocsparse_<function>(<arguments>);
CHECK_HIP_ERROR(hipStreamEndCapture(stream, &graph));
The above code will create a graph with ``rocsparse_function()`` as graph node. The captured graph can be launched as shown below:
.. code-block:: c++
CHECK_HIP_ERROR(hipGraphInstantiate(&instance, graph, NULL, NULL, 0));
CHECK_HIP_ERROR(hipGraphLaunch(instance, stream));
Graph support requires Asynchronous HIP APIs.
.. _Functions Supported with Graph Capture:
Functions Supported with Graph Capture
========================================
Sparse Level 1 Functions
------------------------
================================================= === ==
Function name yes no
================================================= === ==
:cpp:func:`rocsparse_Xaxpyi() <rocsparse_saxpyi>` x
:cpp:func:`rocsparse_Xdoti() <rocsparse_sdoti>` x
:cpp:func:`rocsparse_Xdotci() <rocsparse_cdotci>` x
:cpp:func:`rocsparse_Xgthr() <rocsparse_sgthr>` x
:cpp:func:`rocsparse_Xgthrz() <rocsparse_sgthrz>` x
:cpp:func:`rocsparse_Xroti() <rocsparse_sroti>` x
:cpp:func:`rocsparse_Xsctr() <rocsparse_ssctr>` x
================================================= === ==
Sparse Level 2 Functions
------------------------
============================================================================= === ==
Function name yes no
============================================================================= === ==
:cpp:func:`rocsparse_Xbsrmv_ex_analysis() <rocsparse_sbsrmv_ex_analysis>` x
:cpp:func:`rocsparse_bsrmv_ex_clear` x
:cpp:func:`rocsparse_Xbsrmv_ex() <rocsparse_sbsrmv_ex>` x
:cpp:func:`rocsparse_Xbsrmv() <rocsparse_sbsrmv>` x
:cpp:func:`rocsparse_Xbsrxmv() <rocsparse_sbsrxmv>` x
:cpp:func:`rocsparse_Xbsrsv_buffer_size() <rocsparse_sbsrsv_buffer_size>` x
:cpp:func:`rocsparse_Xbsrsv_analysis() <rocsparse_sbsrsv_analysis>` x
:cpp:func:`rocsparse_bsrsv_zero_pivot` x
:cpp:func:`rocsparse_bsrsv_clear`
:cpp:func:`rocsparse_Xbsrsv_solve() <rocsparse_sbsrsv_solve>` x
:cpp:func:`rocsparse_Xcoomv() <rocsparse_scoomv>` x
:cpp:func:`rocsparse_Xcsrmv_analysis() <rocsparse_scsrmv_analysis>` x
:cpp:func:`rocsparse_Xcsrmv() <rocsparse_scsrmv>` x
:cpp:func:`rocsparse_csrmv_clear` x
:cpp:func:`rocsparse_Xcsrsv_buffer_size() <rocsparse_scsrsv_buffer_size>` x
:cpp:func:`rocsparse_Xcsrsv_analysis() <rocsparse_scsrsv_analysis>` x
:cpp:func:`rocsparse_csrsv_zero_pivot` x
:cpp:func:`rocsparse_csrsv_clear` x
:cpp:func:`rocsparse_Xcsrsv_solve() <rocsparse_scsrsv_solve>` x
:cpp:func:`rocsparse_Xcsritsv_buffer_size() <rocsparse_scsritsv_buffer_size>` x
:cpp:func:`rocsparse_Xcsritsv_analysis() <rocsparse_scsritsv_analysis>` x
:cpp:func:`rocsparse_csritsv_zero_pivot` x
:cpp:func:`rocsparse_csritsv_clear` x
:cpp:func:`rocsparse_Xcsritsv_solve() <rocsparse_scsritsv_solve>` x
:cpp:func:`rocsparse_Xcsritsv_solve() <rocsparse_scsritsvx_solve>` x
:cpp:func:`rocsparse_Xellmv() <rocsparse_sellmv>` x
:cpp:func:`rocsparse_Xgebsrmv() <rocsparse_sgebsrmv>` x
:cpp:func:`rocsparse_Xgemvi_buffer_size() <rocsparse_sgemvi_buffer_size>` x
:cpp:func:`rocsparse_Xgemvi() <rocsparse_sgemvi>` x
:cpp:func:`rocsparse_Xhybmv() <rocsparse_shybmv>` x
============================================================================= === ==
Sparse Level 3 Functions
------------------------
========================================================================= === ==
Function name yes no
========================================================================= === ==
:cpp:func:`rocsparse_Xcsrmm() <rocsparse_scsrmm>` x
:cpp:func:`rocsparse_Xcsrsm_buffer_size() <rocsparse_scsrsm_buffer_size>` x
:cpp:func:`rocsparse_Xcsrsm_analysis() <rocsparse_scsrsm_analysis>` x
:cpp:func:`rocsparse_csrsm_zero_pivot` x
:cpp:func:`rocsparse_csrsm_clear` x
:cpp:func:`rocsparse_Xcsrsm_solve() <rocsparse_scsrsm_solve>` x
:cpp:func:`rocsparse_Xbsrmm() <rocsparse_sbsrmm>` x
:cpp:func:`rocsparse_Xbsrsm_buffer_size() <rocsparse_sbsrsm_buffer_size>` x
:cpp:func:`rocsparse_Xbsrsm_analysis() <rocsparse_sbsrsm_analysis>` x
:cpp:func:`rocsparse_bsrsm_zero_pivot` x
:cpp:func:`rocsparse_bsrsm_clear` x
:cpp:func:`rocsparse_Xbsrsm_solve() <rocsparse_sbsrsm_solve>` x
:cpp:func:`rocsparse_Xgebsrmm() <rocsparse_sgebsrmm>` x
:cpp:func:`rocsparse_Xgemmi() <rocsparse_sgemmi>` x
========================================================================= === ==
Sparse Extra Functions
----------------------
============================================================================= === ==
Function name yes no
============================================================================= === ==
:cpp:func:`rocsparse_bsrgeam_nnzb` x
:cpp:func:`rocsparse_Xbsrgeam() <rocsparse_sbsrgeam>` x
:cpp:func:`rocsparse_Xbsrgemm_buffer_size() <rocsparse_sbsrgemm_buffer_size>` x
:cpp:func:`rocsparse_bsrgemm_nnzb` x
:cpp:func:`rocsparse_Xbsrgemm() <rocsparse_sbsrgemm>` x
:cpp:func:`rocsparse_csrgeam_nnz` x
:cpp:func:`rocsparse_Xcsrgeam() <rocsparse_scsrgeam>` x
:cpp:func:`rocsparse_Xcsrgemm_buffer_size() <rocsparse_scsrgemm_buffer_size>` x
:cpp:func:`rocsparse_csrgemm_nnz` x
:cpp:func:`rocsparse_csrgemm_symbolic` x
:cpp:func:`rocsparse_Xcsrgemm() <rocsparse_scsrgemm>` x
:cpp:func:`rocsparse_Xcsrgemm_numeric() <rocsparse_scsrgemm_numeric>` x
============================================================================= === ==
Preconditioner Functions
------------------------
===================================================================================================================== === ==
Function name yes no
===================================================================================================================== === ==
:cpp:func:`rocsparse_Xbsric0_buffer_size() <rocsparse_sbsric0_buffer_size>` x
:cpp:func:`rocsparse_Xbsric0_analysis() <rocsparse_sbsric0_analysis>` x
:cpp:func:`rocsparse_bsric0_zero_pivot` x
:cpp:func:`rocsparse_bsric0_clear` x
:cpp:func:`rocsparse_Xbsric0() <rocsparse_sbsric0>` x
:cpp:func:`rocsparse_Xbsrilu0_buffer_size() <rocsparse_sbsrilu0_buffer_size>` x
:cpp:func:`rocsparse_Xbsrilu0_analysis() <rocsparse_sbsrilu0_analysis>` x
:cpp:func:`rocsparse_bsrilu0_zero_pivot` x
:cpp:func:`rocsparse_Xbsrilu0_numeric_boost() <rocsparse_sbsrilu0_numeric_boost>` x
:cpp:func:`rocsparse_bsrilu0_clear` x
:cpp:func:`rocsparse_Xbsrilu0() <rocsparse_sbsrilu0>` x
:cpp:func:`rocsparse_Xcsric0_buffer_size() <rocsparse_scsric0_buffer_size>` x
:cpp:func:`rocsparse_Xcsric0_analysis() <rocsparse_scsric0_analysis>` x
:cpp:func:`rocsparse_csric0_zero_pivot` x
:cpp:func:`rocsparse_csric0_clear` x
:cpp:func:`rocsparse_Xcsric0() <rocsparse_scsric0>` x
:cpp:func:`rocsparse_Xcsrilu0_buffer_size() <rocsparse_scsrilu0_buffer_size>` x
:cpp:func:`rocsparse_Xcsrilu0_numeric_boost() <rocsparse_scsrilu0_numeric_boost>` x
:cpp:func:`rocsparse_Xcsrilu0_analysis() <rocsparse_scsrilu0_analysis>` x
:cpp:func:`rocsparse_csrilu0_zero_pivot` x
:cpp:func:`rocsparse_csrilu0_clear` x
:cpp:func:`rocsparse_Xcsrilu0() <rocsparse_scsrilu0>` x
:cpp:func:`rocsparse_csritilu0_buffer_size` x
:cpp:func:`rocsparse_csritilu0_preprocess` x
:cpp:func:`rocsparse_Xcsritilu0_compute() <rocsparse_scsritilu0_compute>` x
:cpp:func:`rocsparse_Xcsritilu0_compute_ex() <rocsparse_scsritilu0_compute_ex>` x
:cpp:func:`rocsparse_Xcsritilu0_history() <rocsparse_scsritilu0_history>` x
:cpp:func:`rocsparse_Xgtsv_buffer_size() <rocsparse_sgtsv_buffer_size>` x
:cpp:func:`rocsparse_Xgtsv() <rocsparse_sgtsv>` x
:cpp:func:`rocsparse_Xgtsv_no_pivot_buffer_size() <rocsparse_sgtsv_no_pivot_buffer_size>` x
:cpp:func:`rocsparse_Xgtsv_no_pivot() <rocsparse_sgtsv_no_pivot>` x
:cpp:func:`rocsparse_Xgtsv_no_pivot_strided_batch_buffer_size() <rocsparse_sgtsv_no_pivot_strided_batch_buffer_size>` x
:cpp:func:`rocsparse_Xgtsv_no_pivot_strided_batch() <rocsparse_sgtsv_no_pivot_strided_batch>` x
:cpp:func:`rocsparse_Xgtsv_interleaved_batch_buffer_size() <rocsparse_sgtsv_interleaved_batch_buffer_size>` x
:cpp:func:`rocsparse_Xgtsv_interleaved_batch() <rocsparse_sgtsv_interleaved_batch>` x
:cpp:func:`rocsparse_Xgpsv_interleaved_batch_buffer_size() <rocsparse_sgpsv_interleaved_batch_buffer_size>` x
:cpp:func:`rocsparse_Xgpsv_interleaved_batch() <rocsparse_sgpsv_interleaved_batch>` x
===================================================================================================================== === ==
Conversion Functions
--------------------
========================================================================================================================= === ==
Function name yes no
========================================================================================================================= === ==
:cpp:func:`rocsparse_csr2coo` x
:cpp:func:`rocsparse_csr2csc_buffer_size` x
:cpp:func:`rocsparse_Xcsr2csc() <rocsparse_scsr2csc>` x
:cpp:func:`rocsparse_Xgebsr2gebsc_buffer_size() <rocsparse_sgebsr2gebsc_buffer_size>` x
:cpp:func:`rocsparse_Xgebsr2gebsc() <rocsparse_sgebsr2gebsc>` x
:cpp:func:`rocsparse_csr2ell_width` x
:cpp:func:`rocsparse_Xcsr2ell() <rocsparse_scsr2ell>` x
:cpp:func:`rocsparse_Xcsr2hyb() <rocsparse_scsr2hyb>` x
:cpp:func:`rocsparse_csr2bsr_nnz` x
:cpp:func:`rocsparse_Xcsr2bsr() <rocsparse_scsr2bsr>` x
:cpp:func:`rocsparse_csr2gebsr_nnz` x
:cpp:func:`rocsparse_Xcsr2gebsr_buffer_size() <rocsparse_scsr2gebsr_buffer_size>` x
:cpp:func:`rocsparse_Xcsr2gebsr() <rocsparse_scsr2gebsr>` x
:cpp:func:`rocsparse_coo2csr` x
:cpp:func:`rocsparse_ell2csr_nnz` x
:cpp:func:`rocsparse_Xell2csr() <rocsparse_sell2csr>` x
:cpp:func:`rocsparse_hyb2csr_buffer_size` x
:cpp:func:`rocsparse_Xhyb2csr() <rocsparse_shyb2csr>` x
:cpp:func:`rocsparse_Xbsr2csr() <rocsparse_sbsr2csr>` x
:cpp:func:`rocsparse_Xgebsr2csr() <rocsparse_sgebsr2csr>` x
:cpp:func:`rocsparse_Xgebsr2gebsr_buffer_size() <rocsparse_sgebsr2gebsr_buffer_size>` x
:cpp:func:`rocsparse_gebsr2gebsr_nnz()` x
:cpp:func:`rocsparse_Xgebsr2gebsr() <rocsparse_sgebsr2gebsr>` x
:cpp:func:`rocsparse_Xcsr2csr_compress() <rocsparse_scsr2csr_compress>` x
:cpp:func:`rocsparse_create_identity_permutation` x
:cpp:func:`rocsparse_inverse_permutation` x
:cpp:func:`rocsparse_cscsort_buffer_size` x
:cpp:func:`rocsparse_cscsort` x
:cpp:func:`rocsparse_csrsort_buffer_size` x
:cpp:func:`rocsparse_csrsort` x
:cpp:func:`rocsparse_coosort_buffer_size` x
:cpp:func:`rocsparse_coosort_by_row` x
:cpp:func:`rocsparse_coosort_by_column` x
:cpp:func:`rocsparse_Xdense2csr() <rocsparse_sdense2csr>` x
:cpp:func:`rocsparse_Xdense2csc() <rocsparse_sdense2csc>` x
:cpp:func:`rocsparse_Xdense2coo() <rocsparse_sdense2coo>` x
:cpp:func:`rocsparse_Xcsr2dense() <rocsparse_scsr2dense>` x
:cpp:func:`rocsparse_Xcsc2dense() <rocsparse_scsc2dense>` x
:cpp:func:`rocsparse_Xcoo2dense() <rocsparse_scoo2dense>` x
:cpp:func:`rocsparse_Xnnz_compress() <rocsparse_snnz_compress>` x
:cpp:func:`rocsparse_Xnnz() <rocsparse_snnz>` x
:cpp:func:`rocsparse_Xprune_dense2csr_buffer_size() <rocsparse_sprune_dense2csr_buffer_size>` x
:cpp:func:`rocsparse_Xprune_dense2csr_nnz() <rocsparse_sprune_dense2csr_nnz>` x
:cpp:func:`rocsparse_Xprune_dense2csr() <rocsparse_sprune_dense2csr>` x
:cpp:func:`rocsparse_Xprune_csr2csr_buffer_size() <rocsparse_sprune_csr2csr_buffer_size>` x
:cpp:func:`rocsparse_Xprune_csr2csr_nnz() <rocsparse_sprune_csr2csr_nnz>` x
:cpp:func:`rocsparse_Xprune_csr2csr() <rocsparse_sprune_csr2csr>` x
:cpp:func:`rocsparse_Xprune_dense2csr_by_percentage_buffer_size() <rocsparse_sprune_dense2csr_by_percentage_buffer_size>` x
:cpp:func:`rocsparse_Xprune_dense2csr_nnz_by_percentage() <rocsparse_sprune_dense2csr_nnz_by_percentage>` x
:cpp:func:`rocsparse_Xprune_dense2csr_by_percentage() <rocsparse_sprune_dense2csr_by_percentage>` x
:cpp:func:`rocsparse_Xprune_csr2csr_by_percentage_buffer_size() <rocsparse_sprune_csr2csr_by_percentage_buffer_size>` x
:cpp:func:`rocsparse_Xprune_csr2csr_nnz_by_percentage() <rocsparse_sprune_csr2csr_nnz_by_percentage>` x
:cpp:func:`rocsparse_Xprune_csr2csr_by_percentage() <rocsparse_sprune_csr2csr_by_percentage>` x
:cpp:func:`rocsparse_Xbsrpad_value() <rocsparse_sbsrpad_value>` x
========================================================================================================================= === ==
Reordering Functions
--------------------
======================================================= === ==
Function name yes no
======================================================= === ==
:cpp:func:`rocsparse_Xcsrcolor() <rocsparse_scsrcolor>` x
======================================================= === ==
Utility Functions
-----------------
=================================================================================================== === ==
Function name yes no
=================================================================================================== === ==
:cpp:func:`rocsparse_Xcheck_matrix_csr_buffer_size() <rocsparse_scheck_matrix_csr_buffer_size>` x
:cpp:func:`rocsparse_Xcheck_matrix_csr() <rocsparse_scheck_matrix_csr>` x
:cpp:func:`rocsparse_Xcheck_matrix_csc_buffer_size() <rocsparse_scheck_matrix_csc_buffer_size>` x
:cpp:func:`rocsparse_Xcheck_matrix_csc() <rocsparse_scheck_matrix_csc>` x
:cpp:func:`rocsparse_Xcheck_matrix_coo_buffer_size() <rocsparse_scheck_matrix_coo_buffer_size>` x
:cpp:func:`rocsparse_Xcheck_matrix_coo() <rocsparse_scheck_matrix_coo>` x
:cpp:func:`rocsparse_Xcheck_matrix_gebsr_buffer_size() <rocsparse_scheck_matrix_gebsr_buffer_size>` x
:cpp:func:`rocsparse_Xcheck_matrix_gebsr() <rocsparse_scheck_matrix_gebsr>` x
:cpp:func:`rocsparse_Xcheck_matrix_gebsc_buffer_size() <rocsparse_scheck_matrix_gebsc_buffer_size>` x
:cpp:func:`rocsparse_Xcheck_matrix_gebsc() <rocsparse_scheck_matrix_gebsc>` x
:cpp:func:`rocsparse_Xcheck_matrix_ell_buffer_size() <rocsparse_scheck_matrix_ell_buffer_size>` x
:cpp:func:`rocsparse_Xcheck_matrix_ell() <rocsparse_scheck_matrix_ell>` x
:cpp:func:`rocsparse_check_matrix_hyb_buffer_size() <rocsparse_check_matrix_hyb_buffer_size>` x
:cpp:func:`rocsparse_check_matrix_hyb() <rocsparse_check_matrix_hyb>` x
=================================================================================================== === ==
Sparse Generic Functions
------------------------
==================================================== === ==
Function name yes no
==================================================== === ==
:cpp:func:`rocsparse_axpby()` x
:cpp:func:`rocsparse_gather()` x
:cpp:func:`rocsparse_scatter()` x
:cpp:func:`rocsparse_rot()` x
:cpp:func:`rocsparse_spvv()` x
:cpp:func:`rocsparse_sparse_to_dense()` x
:cpp:func:`rocsparse_dense_to_sparse()` x
:cpp:func:`rocsparse_spgemm()` x
:cpp:func:`rocsparse_sddmm_buffer_size()` x
:cpp:func:`rocsparse_sddmm_preprocess()` x
:cpp:func:`rocsparse_sparse_to_sparse_buffer_size()` x
:cpp:func:`rocsparse_sparse_to_sparse()` x
:cpp:func:`rocsparse_extract_buffer_size()` x
:cpp:func:`rocsparse_extract_nnz()` x
:cpp:func:`rocsparse_extract()` x
==================================================== === ==
For :cpp:func:`rocsparse_spmv()`, :cpp:func:`rocsparse_spmm()`, :cpp:func:`rocsparse_spsv()`, and :cpp:func:`rocsparse_spsm()`
hipGraph is supported when passing buffer size or compute stages but is not supported when passing the preprocess stage.
For :cpp:func:`rocsparse_sddmm()` hipGraph is supported only when using the default algorithm.
Storage Formats
===============
The following describes supported matrix storage formats.
.. note::
The different storage formats support indexing from a base of 0 or 1 as described in :ref:`index_base`.
COO storage format
------------------
The Coordinate (COO) storage format represents a :math:`m \times n` matrix by
=========== ==================================================================
m number of rows (integer).
n number of columns (integer).
nnz number of non-zero elements (integer).
coo_val array of ``nnz`` elements containing the data (floating point).
coo_row_ind array of ``nnz`` elements containing the row indices (integer).
coo_col_ind array of ``nnz`` elements containing the column indices (integer).
=========== ==================================================================
The COO matrix is expected to be sorted by row indices and column indices per row. Furthermore, each pair of indices should appear only once.
Consider the following :math:`3 \times 5` matrix and the corresponding COO structures, with :math:`m = 3, n = 5` and :math:`\text{nnz} = 8` using zero based indexing:
.. math::
A = \begin{pmatrix}
1.0 & 2.0 & 0.0 & 3.0 & 0.0 \\
0.0 & 4.0 & 5.0 & 0.0 & 0.0 \\
6.0 & 0.0 & 0.0 & 7.0 & 8.0 \\
\end{pmatrix}
where
.. math::
\begin{array}{ll}
\text{coo_val}[8] & = \{1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0\} \\
\text{coo_row_ind}[8] & = \{0, 0, 0, 1, 1, 2, 2, 2\} \\
\text{coo_col_ind}[8] & = \{0, 1, 3, 1, 2, 0, 3, 4\}
\end{array}
COO (AoS) storage format
------------------------
The Coordinate (COO) Array of Structure (AoS) storage format represents a :math:`m \times n` matrix by
======= ==========================================================================================
m number of rows (integer).
n number of columns (integer).
nnz number of non-zero elements (integer).
coo_val array of ``nnz`` elements containing the data (floating point).
coo_ind array of ``2 * nnz`` elements containing alternating row and column indices (integer).
======= ==========================================================================================
The COO (AoS) matrix is expected to be sorted by row indices and column indices per row. Furthermore, each pair of indices should appear only once.
Consider the following :math:`3 \times 5` matrix and the corresponding COO (AoS) structures, with :math:`m = 3, n = 5` and :math:`\text{nnz} = 8` using zero based indexing:
.. math::
A = \begin{pmatrix}
1.0 & 2.0 & 0.0 & 3.0 & 0.0 \\
0.0 & 4.0 & 5.0 & 0.0 & 0.0 \\
6.0 & 0.0 & 0.0 & 7.0 & 8.0 \\
\end{pmatrix}
where
.. math::
\begin{array}{ll}
\text{coo_val}[8] & = \{1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0\} \\
\text{coo_ind}[16] & = \{0, 0, 0, 1, 0, 3, 1, 1, 1, 2, 2, 0, 2, 3, 2, 4\} \\
\end{array}
CSR storage format
------------------
The Compressed Sparse Row (CSR) storage format represents a :math:`m \times n` matrix by
=========== =========================================================================
m number of rows (integer).
n number of columns (integer).
nnz number of non-zero elements (integer).
csr_val array of ``nnz`` elements containing the data (floating point).
csr_row_ptr array of ``m+1`` elements that point to the start of every row (integer).
csr_col_ind array of ``nnz`` elements containing the column indices (integer).
=========== =========================================================================
The CSR matrix is expected to be sorted by column indices within each row. Furthermore, each pair of indices should appear only once.
Consider the following :math:`3 \times 5` matrix and the corresponding CSR structures, with :math:`m = 3, n = 5` and :math:`\text{nnz} = 8` using one based indexing:
.. math::
A = \begin{pmatrix}
1.0 & 2.0 & 0.0 & 3.0 & 0.0 \\
0.0 & 4.0 & 5.0 & 0.0 & 0.0 \\
6.0 & 0.0 & 0.0 & 7.0 & 8.0 \\
\end{pmatrix}
where
.. math::
\begin{array}{ll}
\text{csr_val}[8] & = \{1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0\} \\
\text{csr_row_ptr}[4] & = \{1, 4, 6, 9\} \\
\text{csr_col_ind}[8] & = \{1, 2, 4, 2, 3, 1, 4, 5\}
\end{array}
CSC storage format
------------------
The Compressed Sparse Column (CSC) storage format represents a :math:`m \times n` matrix by
=========== =========================================================================
m number of rows (integer).
n number of columns (integer).
nnz number of non-zero elements (integer).
csc_val array of ``nnz`` elements containing the data (floating point).
csc_col_ptr array of ``n+1`` elements that point to the start of every column (integer).
csc_row_ind array of ``nnz`` elements containing the row indices (integer).
=========== =========================================================================
The CSC matrix is expected to be sorted by row indices within each column. Furthermore, each pair of indices should appear only once.
Consider the following :math:`3 \times 5` matrix and the corresponding CSC structures, with :math:`m = 3, n = 5` and :math:`\text{nnz} = 8` using one based indexing:
.. math::
A = \begin{pmatrix}
1.0 & 2.0 & 0.0 & 3.0 & 0.0 \\
0.0 & 4.0 & 5.0 & 0.0 & 0.0 \\
6.0 & 0.0 & 0.0 & 7.0 & 8.0 \\
\end{pmatrix}
where
.. math::
\begin{array}{ll}
\text{csc_val}[8] & = \{1.0, 6.0, 2.0, 4.0, 5.0, 3.0, 7.0, 8.0\} \\
\text{csc_col_ptr}[6] & = \{1, 3, 5, 6, 8, 9\} \\
\text{csc_row_ind}[8] & = \{1, 3, 1, 2, 2, 1, 3, 3\}
\end{array}
BSR storage format
------------------
The Block Compressed Sparse Row (BSR) storage format represents a :math:`(mb \cdot \text{bsr_dim}) \times (nb \cdot \text{bsr_dim})` matrix by
=========== ====================================================================================================================================
mb number of block rows (integer)
nb number of block columns (integer)
nnzb number of non-zero blocks (integer)
bsr_val array of ``nnzb * bsr_dim * bsr_dim`` elements containing the data (floating point). Blocks can be stored column-major or row-major.
bsr_row_ptr array of ``mb+1`` elements that point to the start of every block row (integer).
bsr_col_ind array of ``nnzb`` elements containing the block column indices (integer).
bsr_dim dimension of each block (integer).
=========== ====================================================================================================================================
The BSR matrix is expected to be sorted by column indices within each row. If :math:`m` or :math:`n` are not evenly divisible by the block dimension, then zeros are padded to the matrix, such that :math:`mb = (m + \text{bsr_dim} - 1) / \text{bsr_dim}` and :math:`nb = (n + \text{bsr_dim} - 1) / \text{bsr_dim}`.
Consider the following :math:`4 \times 3` matrix and the corresponding BSR structures, with :math:`\text{bsr_dim} = 2, mb = 2, nb = 2` and :math:`\text{nnzb} = 4` using zero based indexing and column-major storage:
.. math::
A = \begin{pmatrix}
1.0 & 0.0 & 2.0 \\
3.0 & 0.0 & 4.0 \\
5.0 & 6.0 & 0.0 \\
7.0 & 0.0 & 8.0 \\
\end{pmatrix}
with the blocks :math:`A_{ij}`
.. math::
A_{00} = \begin{pmatrix}
1.0 & 0.0 \\
3.0 & 0.0 \\
\end{pmatrix},
A_{01} = \begin{pmatrix}
2.0 & 0.0 \\
4.0 & 0.0 \\
\end{pmatrix},
A_{10} = \begin{pmatrix}
5.0 & 6.0 \\
7.0 & 0.0 \\
\end{pmatrix},
A_{11} = \begin{pmatrix}
0.0 & 0.0 \\
8.0 & 0.0 \\
\end{pmatrix}
such that
.. math::
A = \begin{pmatrix}
A_{00} & A_{01} \\
A_{10} & A_{11} \\
\end{pmatrix}
with arrays representation
.. math::
\begin{array}{ll}
\text{bsr_val}[16] & = \{1.0, 3.0, 0.0, 0.0, 2.0, 4.0, 0.0, 0.0, 5.0, 7.0, 6.0, 0.0, 0.0, 8.0, 0.0, 0.0\} \\
\text{bsr_row_ptr}[3] & = \{0, 2, 4\} \\
\text{bsr_col_ind}[4] & = \{0, 1, 0, 1\}
\end{array}
GEBSR storage format
--------------------
The General Block Compressed Sparse Row (GEBSR) storage format represents a :math:`(mb \cdot \text{bsr_row_dim}) \times (nb \cdot \text{bsr_col_dim})` matrix by
=========== ====================================================================================================================================
mb number of block rows (integer)
nb number of block columns (integer)
nnzb number of non-zero blocks (integer)
bsr_val array of ``nnzb * bsr_row_dim * bsr_col_dim`` elements containing the data (floating point). Blocks can be stored column-major or row-major.
bsr_row_ptr array of ``mb+1`` elements that point to the start of every block row (integer).
bsr_col_ind array of ``nnzb`` elements containing the block column indices (integer).
bsr_row_dim row dimension of each block (integer).
bsr_col_dim column dimension of each block (integer).
=========== ====================================================================================================================================
The GEBSR matrix is expected to be sorted by column indices within each row. If :math:`m` is not evenly divisible by the row block dimension or :math:`n` is not evenly
divisible by the column block dimension, then zeros are padded to the matrix, such that :math:`mb = (m + \text{bsr_row_dim} - 1) / \text{bsr_row_dim}` and
:math:`nb = (n + \text{bsr_col_dim} - 1) / \text{bsr_col_dim}`. Consider the following :math:`4 \times 5` matrix and the corresponding GEBSR structures,
with :math:`\text{bsr_row_dim} = 2`, :math:`\text{bsr_col_dim} = 3`, mb = 2, nb = 2` and :math:`\text{nnzb} = 4` using zero based indexing and column-major storage:
.. math::
A = \begin{pmatrix}
1.0 & 0.0 & 0.0 & 2.0 & 0.0 \\
3.0 & 0.0 & 4.0 & 0.0 & 0.0 \\
5.0 & 6.0 & 0.0 & 7.0 & 0.0 \\
0.0 & 0.0 & 8.0 & 0.0 & 9.0 \\
\end{pmatrix}
with the blocks :math:`A_{ij}`
.. math::
A_{00} = \begin{pmatrix}
1.0 & 0.0 & 0.0 \\
3.0 & 0.0 & 4.0 \\
\end{pmatrix},
A_{01} = \begin{pmatrix}
2.0 & 0.0 & 0.0 \\
0.0 & 0.0 & 0.0 \\
\end{pmatrix},
A_{10} = \begin{pmatrix}
5.0 & 6.0 & 0.0 \\
0.0 & 0.0 & 8.0 \\
\end{pmatrix},
A_{11} = \begin{pmatrix}
7.0 & 0.0 & 0.0 \\
0.0 & 9.0 & 0.0 \\
\end{pmatrix}
such that
.. math::
A = \begin{pmatrix}
A_{00} & A_{01} \\
A_{10} & A_{11} \\
\end{pmatrix}
with arrays representation
.. math::
\begin{array}{ll}
\text{bsr_val}[24] & = \{1.0, 3.0, 0.0, 0.0, 0.0, 4.0, 2.0, 0.0, 0.0, 0.0, 0.0, 0.0, 5.0, 0.0, 6.0, 0.0, 0.0, 8.0, 7.0, 0.0, 0.0, 9.0, 0.0, 0.0\} \\
\text{bsr_row_ptr}[3] & = \{0, 2, 4\} \\
\text{bsr_col_ind}[4] & = \{0, 1, 0, 1\}
\end{array}
ELL storage format
------------------
The Ellpack-Itpack (ELL) storage format represents a :math:`m \times n` matrix by
=========== ================================================================================
m number of rows (integer).
n number of columns (integer).
ell_width maximum number of non-zero elements per row (integer)
ell_val array of ``m * ell_width`` elements containing the data (floating point).
ell_col_ind array of ``m * ell_width`` elements containing the column indices (integer).
=========== ================================================================================
The ELL matrix is assumed to be stored in column-major format. Rows with less than ``ell_width`` non-zero elements are padded with zeros (``ell_val``) and :math:`-1` (``ell_col_ind``).
Consider the following :math:`3 \times 5` matrix and the corresponding ELL structures, with :math:`m = 3, n = 5` and :math:`\text{ell_width} = 3` using zero based indexing:
.. math::
A = \begin{pmatrix}
1.0 & 2.0 & 0.0 & 3.0 & 0.0 \\
0.0 & 4.0 & 5.0 & 0.0 & 0.0 \\
6.0 & 0.0 & 0.0 & 7.0 & 8.0 \\
\end{pmatrix}
where
.. math::
\begin{array}{ll}
\text{ell_val}[9] & = \{1.0, 4.0, 6.0, 2.0, 5.0, 7.0, 3.0, 0.0, 8.0\} \\
\text{ell_col_ind}[9] & = \{0, 1, 0, 1, 2, 3, 3, -1, 4\}
\end{array}
.. _HYB storage format:
HYB storage format
------------------
The Hybrid (HYB) storage format represents a :math:`m \times n` matrix by
=========== =========================================================================================
m number of rows (integer).
n number of columns (integer).
nnz number of non-zero elements of the COO part (integer)
ell_width maximum number of non-zero elements per row of the ELL part (integer)
ell_val array of ``m * ell_width`` elements containing the ELL part data (floating point).
ell_col_ind array of ``m * ell_width`` elements containing the ELL part column indices (integer).
coo_val array of ``nnz`` elements containing the COO part data (floating point).
coo_row_ind array of ``nnz`` elements containing the COO part row indices (integer).
coo_col_ind array of ``nnz`` elements containing the COO part column indices (integer).
=========== =========================================================================================
The HYB format is a combination of the ELL and COO sparse matrix formats. Typically, the regular part of the matrix is stored in
ELL storage format, and the irregular part of the matrix is stored in COO storage format. Three different partitioning schemes can
be applied when converting a CSR matrix to a matrix in HYB storage format. For further details on the partitioning schemes,
see :ref:`rocsparse_hyb_partition_`.
.. _index_base:
Storage schemes and indexing base
=================================
rocSPARSE supports 0 and 1 based indexing.
The index base is selected by the :cpp:enum:`rocsparse_index_base` type which is either passed as standalone parameter or as part of the :cpp:type:`rocsparse_mat_descr` type.
Furthermore, dense vectors are represented with a 1D array, stored linearly in memory.
Sparse vectors are represented by a 1D data array stored linearly in memory that hold all non-zero elements and a 1D indexing array stored linearly in memory that hold the positions of the corresponding non-zero elements.
Pointer mode
============
The auxiliary functions :cpp:func:`rocsparse_set_pointer_mode` and :cpp:func:`rocsparse_get_pointer_mode` are used to set and get the value of the state variable :cpp:enum:`rocsparse_pointer_mode`.
If :cpp:enum:`rocsparse_pointer_mode` is equal to :cpp:enumerator:`rocsparse_pointer_mode_host`, then scalar parameters must be allocated on the host.
If :cpp:enum:`rocsparse_pointer_mode` is equal to :cpp:enumerator:`rocsparse_pointer_mode_device`, then scalar parameters must be allocated on the device.
There are two types of scalar parameter:
1. Scaling parameters, such as `alpha` and `beta` used for example in :cpp:func:`rocsparse_scsrmv` and :cpp:func:`rocsparse_scoomv`
2. Scalar results from functions such as :cpp:func:`rocsparse_sdoti` or :cpp:func:`rocsparse_cdotci`
For scalar parameters such as alpha and beta, memory can be allocated on the host heap or stack, when :cpp:enum:`rocsparse_pointer_mode` is equal to :cpp:enumerator:`rocsparse_pointer_mode_host`.
The kernel launch is asynchronous, and if the scalar parameter is on the heap, it can be freed after the return from the kernel launch.
When :cpp:enum:`rocsparse_pointer_mode` is equal to :cpp:enumerator:`rocsparse_pointer_mode_device`, the scalar parameter must not be changed till the kernel completes.
For scalar results, when :cpp:enum:`rocsparse_pointer_mode` is equal to :cpp:enumerator:`rocsparse_pointer_mode_host`, the function blocks the CPU till the GPU has copied the result back to the host.
Using :cpp:enum:`rocsparse_pointer_mode` equal to :cpp:enumerator:`rocsparse_pointer_mode_device`, the function will return after the asynchronous launch.
Similarly to vector and matrix results, the scalar result is only available when the kernel has completed execution.
.. _rocsparse_logging:
Activity Logging
================
Four different environment variables can be set to enable logging in rocSPARSE: ``ROCSPARSE_LAYER``, ``ROCSPARSE_LOG_TRACE_PATH``, ``ROCSPARSE_LOG_BENCH_PATH`` and ``ROCSPARSE_LOG_DEBUG_PATH``.
``ROCSPARSE_LAYER`` is a bit mask that enables logging, and where several logging modes (:ref:`rocsparse_layer_mode_`) can be specified as follows:
================================ =============================================================
``ROCSPARSE_LAYER`` unset logging is disabled.
``ROCSPARSE_LAYER`` set to ``1`` trace logging is enabled.
``ROCSPARSE_LAYER`` set to ``2`` bench logging is enabled.
``ROCSPARSE_LAYER`` set to ``3`` trace logging and bench logging are enabled.
``ROCSPARSE_LAYER`` set to ``4`` debug logging is enabled.
``ROCSPARSE_LAYER`` set to ``5`` trace logging and debug logging are enabled.
``ROCSPARSE_LAYER`` set to ``6`` bench logging and debug logging are enabled.
``ROCSPARSE_LAYER`` set to ``7`` trace logging and bench logging and debug logging are enabled.
================================ =============================================================
When logging is enabled, each rocSPARSE function call will write the function name and function arguments to the logging stream. The default logging output is streamed to ``stderr``.
.. note::
Performance will degrade when logging is enabled. By default, the environment variable ``ROCSPARSE_LAYER`` is unset and logging is disabled.
To capture activity logging in a file set the following environment variables as needed:
* ``ROCSPARSE_LOG_TRACE_PATH`` specifies a path and file name to capture trace logging streamed to that file
* ``ROCSPARSE_LOG_BENCH_PATH`` specifies a path and file name to capture bench logging
* ``ROCSPARSE_LOG_DEBUG_PATH`` specifies a path and file name to capture debug logging
.. note::
If the file cannot be opened, logging output is streamed to ``stderr``.
hipSPARSE
=========
hipSPARSE is a SPARSE marshalling library, with multiple supported backends. It sits between the application and a `worker`
SPARSE library, marshalling inputs into the backend library and marshalling results back to the application. hipSPARSE exports
an interface that does not require the client to change, regardless of the chosen backend.
hipSPARSE supports rocSPARSE and cuSPARSE as backends.
hipSPARSE focuses on convenience and portability.
If performance outweighs these factors, then using rocSPARSE itself is highly recommended.
hipSPARSE can be found on `GitHub <https://github.com/ROCm/hipSPARSE/>`_.
|