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
|
function [flops mwork] = flopcount (M,Mask_complement,A,B) ;
%FLOPCOUNT cumulative sum of flop counts for A*B, C<M>=A*B, C<!M>=A*B
%
% flops = flopcount (M,Mask_complementA,B) ;
%
% flops(j) is the flops to compute A*B(1:j-1), and flops(n+1) is the total
% flopcount, if B is m-by-n.
%
% Each 'flop' counted is actually a multiply-add. M can be [ ]. The
% flopcount m-file returns the same thing as GB_AxB_saxpy3_flopcount. Also
% included in flops(j) is the work needed to access the mask M(:,j).
% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2022, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0
n = size (B,2) ;
flops = zeros (1,n) ;
mwork = 0 ;
if (isempty (M))
% C = A*B
for j = 1:n
brows = find (B (:,j)) ;
brows = brows (:)' ;
for k = brows
flops (j) = flops (j) + nnz (A (:,k)) ;
end
end
else
% C<M>=A*B and C<!M>=A*B
mask_is_M = (~Mask_complement) ; % true for C<M>=A*B
mask_is_dense = (nnz (M) == prod (size (M))) ;
for j = 1:n
brows = find (B (:,j)) ;
if (isempty (brows))
continue ;
end
if (~mask_is_dense)
mrows = find (M (:,j)) ;
mjnz = length (mrows) ;
if (mask_is_M & mjnz == 0)
continue ;
end
flops (j) = flops (j) + mjnz ;
mwork = mwork + mjnz ;
end
brows = brows (:)' ;
for k = brows
flops (j) = flops (j) + nnz (A (:,k)) ;
end
end
end
flops = cumsum ([0 flops]) ;
|
