File: test_saxpy3.m

package info (click to toggle)
suitesparse 1%3A7.10.1%2Bdfsg-1
  • links: PTS, VCS
  • area: main
  • in suites: forky, trixie
  • size: 254,920 kB
  • sloc: ansic: 1,134,743; cpp: 46,133; makefile: 4,875; fortran: 2,087; java: 1,826; sh: 996; ruby: 725; python: 495; asm: 371; sed: 166; awk: 44
file content (39 lines) | stat: -rw-r--r-- 1,063 bytes parent folder | download | duplicates (2)
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
%TEST_SAXPY3 test integer overflow in GB_AxB_saxpy3_cumsum.c
%
% This test creates successively larger matrices, eventually triggering
% integer overflow when Cp is 32-bit and the matrix has more the 2^32 entries.
% It does not need to set the global hack flag to trigger the condition
% artificially.  However, this test is costly and can only be done on a
% large system, so it is not part of the testall.m script.  See test296.m.

% SuiteSparse:GraphBLAS, Timothy A. Davis, (c) 2017-2025, All Rights Reserved.
% SPDX-License-Identifier: Apache-2.0

rng ('default') ;
clear all
clear mex
n = 10e6 ;
nz = 1 ;
range = int8 ([0 128]) ;
GrB.threads (32) ;
% GrB.burble (1) ;
e = 1 ;

while (e < 4.2e9)

    nz = 1.25*nz ;
    d = nz / n^2 ;
    tic ;
    C = GrB.random (n, n, d, 'range', range) ;
    t = toc ;
    e = GrB.entries (C) ;
    fprintf ('\ncreate: %g sec, nvals %g million\n', t, e / 1e6) ;
    tic ;
    C = C^2 ;
    t = toc ;
    e = GrB.entries (C) ;
    fprintf ('mxm: %g sec, nvals: %g million\n', t, e/1e6) ;
%   disp (C, 1) ;
    clear C

end