1 //------------------------------------------------------------------------------ 2 // GB_Asaxpy3B_noM: hard-coded saxpy3 method for a semiring 3 //------------------------------------------------------------------------------ 4 5 // SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2021, All Rights Reserved. 6 // SPDX-License-Identifier: Apache-2.0 7 8 //------------------------------------------------------------------------------ 9 10 // If this file is in the Generated/ folder, do not edit it (auto-generated). 11 12 #include "GB_AxB_defs__lor_first_bool.h" 13 #ifndef GBCOMPACT 14 15 //------------------------------------------------------------------------------ 16 // C=A*B, C<M>=A*B, C<!M>=A*B: saxpy method (Gustavson + Hash) 17 //------------------------------------------------------------------------------ 18 19 #if ( !GB_DISABLE ) 20 21 #include "GB_AxB_saxpy3_template.h" 22 GB(_Asaxpy3B_noM__lor_first_bool)23 GrB_Info GB (_Asaxpy3B_noM__lor_first_bool) 24 ( 25 GrB_Matrix C, // C=A*B, C sparse or hypersparse 26 const GrB_Matrix A, bool A_is_pattern, 27 const GrB_Matrix B, bool B_is_pattern, 28 GB_saxpy3task_struct *restrict SaxpyTasks, 29 const int ntasks, const int nfine, const int nthreads, 30 const int do_sort, 31 GB_Context Context 32 ) 33 { 34 if (GB_IS_SPARSE (A) && GB_IS_SPARSE (B)) 35 { 36 // both A and B are sparse 37 #define GB_META16 38 #define GB_NO_MASK 1 39 #define GB_MASK_COMP 0 40 #define GB_A_IS_SPARSE 1 41 #define GB_A_IS_HYPER 0 42 #define GB_A_IS_BITMAP 0 43 #define GB_A_IS_FULL 0 44 #define GB_B_IS_SPARSE 1 45 #define GB_B_IS_HYPER 0 46 #define GB_B_IS_BITMAP 0 47 #define GB_B_IS_FULL 0 48 #include "GB_meta16_definitions.h" 49 #include "GB_AxB_saxpy3_template.c" 50 } 51 else 52 { 53 // general case 54 #undef GB_META16 55 #define GB_NO_MASK 1 56 #define GB_MASK_COMP 0 57 #include "GB_meta16_definitions.h" 58 #include "GB_AxB_saxpy3_template.c" 59 } 60 return (GrB_SUCCESS) ; 61 } 62 63 #endif 64 65 #endif 66 67