-
Notifications
You must be signed in to change notification settings - Fork 1
/
ellspmv.c
1909 lines (1793 loc) · 62.3 KB
/
ellspmv.c
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
/*
* Benchmark program for ELLPACK SpMV
*
* Copyright (C) 2023 James D. Trotter
*
* This program is free software: you can redistribute it and/or
* modify it under the terms of the GNU General Public License as
* published by the Free Software Foundation, either version 3 of the
* License, or (at your option) any later version.
*
* This program is distributed in the hope that it will be useful, but
* WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see
* <https://www.gnu.org/licenses/>.
*
* Benchmarking program for sparse matrix-vector multiplication (SpMV)
* with matrices in ELLPACK format.
*
* Authors:
* James D. Trotter <[email protected]>
* Sergej Breiter <[email protected]>
*
*
* History:
*
* 1.8 - 2023-05-30:
*
* - add option for performing warmup iterations
*
* 1.7 - 2023-05-06:
*
* - add an option for sorting nonzeros within each row by column
*
* 1.6 - 2023-05-04:
*
* - enable A64FX sector cache before the loop that repeatedly
* performs SpMV.
*
* 1.4 - 2023-04-15:
*
* - add support for performance monitoring using PAPI
*
* - minor fixes to A64FX sector cache configuration
*
* 1.3 - 2023-03-01:
*
* - add option for reading gzip-compressed Matrix Market files
*
* - add compile-time option for selecting 32- or 64-bit integers
* for row/column offsets
*
* - allow matrices and vectors with integer and pattern fields by
* converting integers to doubles or by setting the double
* precision floating-point matrix/vector values equal to one.
*
* - align allocations to page boundaries if HAVE_ALIGNED_ALLOC is
* defined.
*
* 1.2 — 2023-02-10:
*
* - add option for separating diagonal and off-diagonal entries
*
* 1.1 — 2022-10-23:
*
* - add cache partitioning for A64FX
*
* 1.0 — 2022-05-16:
*
* - initial version
*/
#ifdef HAVE_PAPI
#include "papi_util.h"
#include <papi.h>
#endif
#include <errno.h>
#ifdef _OPENMP
#include <omp.h>
#endif
#ifdef HAVE_LIBZ
#include <zlib.h>
#endif
#include <unistd.h>
#include <float.h>
#include <inttypes.h>
#include <limits.h>
#include <locale.h>
#include <math.h>
#include <stdbool.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <time.h>
#ifndef IDXTYPEWIDTH
typedef int idx_t;
#define PRIdx "d"
#define IDX_T_MIN INT_MIN
#define IDX_T_MAX INT_MAX
#define parse_idx_t parse_int
#elif IDXTYPEWIDTH == 32
typedef int32_t idx_t;
#define PRIdx PRId32
#define IDX_T_MIN INT32_MIN
#define IDX_T_MAX INT32_MAX
#define parse_idx_t parse_int32_t
#elif IDXTYPEWIDTH == 64
typedef int64_t idx_t;
#define PRIdx PRId64
#define IDX_T_MIN INT64_MIN
#define IDX_T_MAX INT64_MAX
#define parse_idx_t parse_int64_t
#endif
#ifdef USE_A64FX_SECTOR_CACHE
#ifndef A64FX_SECTOR_CACHE_L2_WAYS
#define A64FX_SECTOR_CACHE_L2_WAYS 4
#endif
#endif
const char * program_name = "ellspmv";
const char * program_version = "1.8";
const char * program_copyright =
"Copyright (C) 2023 James D. Trotter";
const char * program_license =
"License GPLv3+: GNU GPL version 3 or later <https://gnu.org/licenses/gpl.html>\n"
"This is free software: you are free to change and redistribute it.\n"
"There is NO WARRANTY, to the extent permitted by law.";
const char * program_invocation_name;
const char * program_invocation_short_name;
/**
* ‘program_options’ contains data to related program options.
*/
struct program_options
{
char * Apath;
char * xpath;
char * ypath;
#ifdef HAVE_LIBZ
int gzip;
#endif
bool separate_diagonal;
bool sort_rows;
int repeat;
int warmup;
int verbose;
int quiet;
#ifdef HAVE_PAPI
char * papi_event_file;
int papi_event_format;
bool papi_event_per_thread;
bool papi_event_summary;
#endif
};
/**
* ‘program_options_init()’ configures the default program options.
*/
static int program_options_init(
struct program_options * args)
{
args->Apath = NULL;
args->xpath = NULL;
args->ypath = NULL;
#ifdef HAVE_LIBZ
args->gzip = 0;
#endif
args->separate_diagonal = false;
args->sort_rows = false;
args->repeat = 1;
args->warmup = 0;
args->quiet = 0;
args->verbose = 0;
#ifdef HAVE_PAPI
args->papi_event_file = NULL;
args->papi_event_format = 0;
args->papi_event_per_thread = false;
args->papi_event_summary = false;
#endif
return 0;
}
/**
* ‘program_options_free()’ frees memory and other resources
* associated with parsing program options.
*/
static void program_options_free(
struct program_options * args)
{
#ifdef HAVE_PAPI
if (args->papi_event_file) free(args->papi_event_file);
#endif
if (args->ypath) free(args->ypath);
if (args->xpath) free(args->xpath);
if (args->Apath) free(args->Apath);
}
/**
* ‘program_options_print_usage()’ prints a usage text.
*/
static void program_options_print_usage(
FILE * f)
{
fprintf(f, "Usage: %s [OPTION..] A [x] [y]\n", program_name);
}
/**
* ‘program_options_print_help()’ prints a help text.
*/
static void program_options_print_help(
FILE * f)
{
program_options_print_usage(f);
fprintf(f, "\n");
fprintf(f, " Multiply a matrix by a vector.\n");
fprintf(f, "\n");
fprintf(f, " The operation performed is ‘y := A*x + y’, where\n");
fprintf(f, " ‘A’ is a matrix, and ‘x’ and ‘y’ are vectors.\n");
fprintf(f, "\n");
fprintf(f, " Positional arguments are:\n");
fprintf(f, " A path to Matrix Market file for the matrix A\n");
fprintf(f, " x optional path to Matrix Market file for the vector x\n");
fprintf(f, " y optional path for to Matrix Market file for the vector y\n");
fprintf(f, "\n");
fprintf(f, " Other options are:\n");
#ifdef HAVE_LIBZ
fprintf(f, " -z, --gzip, --gunzip, --ungzip filter files through gzip\n");
#endif
fprintf(f, " --separate-diagonal store diagonal nonzeros separately\n");
fprintf(f, " --sort-rows sort nonzeros by column within each row\n");
fprintf(f, " --repeat=N repeat matrix-vector multiplication N times\n");
fprintf(f, " --warmup=N perform N additional warmup iterations\n");
fprintf(f, " -q, --quiet do not print Matrix Market output\n");
fprintf(f, " -v, --verbose be more verbose\n");
fprintf(f, "\n");
#ifdef HAVE_PAPI
fprintf(f, " Options for performance monitoring (PAPI) are:\n");
fprintf(f, " --papi-event-file=FILE file describing which events to monitor\n");
fprintf(f, " --papi-event-format=FMT output format for events: plain or csv. [plain]\n");
fprintf(f, " --papi-event-per-thread display events per thread\n");
fprintf(f, " --papi-event-summary display summary of performance monitoring\n");
fprintf(f, "\n");
#endif
fprintf(f, " -h, --help display this help and exit\n");
fprintf(f, " --version display version information and exit\n");
fprintf(f, "\n");
fprintf(f, "Report bugs to: <[email protected]>\n");
}
/**
* ‘program_options_print_version()’ prints version information.
*/
static void program_options_print_version(
FILE * f)
{
fprintf(f, "%s %s\n", program_name, program_version);
fprintf(f, "row/column offsets: %ld-bit\n", sizeof(idx_t)*CHAR_BIT);
#ifdef HAVE_ALIGNED_ALLOC
fprintf(f, "page-aligned allocations: yes (page size: %ld)\n", sysconf(_SC_PAGESIZE));
#else
fprintf(f, "page-aligned allocations: no\n");
#endif
#ifdef _OPENMP
fprintf(f, "OpenMP: yes (%d)\n", _OPENMP);
#else
fprintf(f, "OpenMP: no\n");
#endif
#ifdef HAVE_LIBZ
fprintf(f, "zlib: yes ("ZLIB_VERSION")\n");
#else
fprintf(f, "zlib: no\n");
#endif
#ifdef HAVE_PAPI
fprintf(f, "PAPI: yes (%d.%d.%d.%d)\n", PAPI_VERSION_MAJOR(PAPI_VERSION), PAPI_VERSION_MINOR(PAPI_VERSION), PAPI_VERSION_REVISION(PAPI_VERSION), PAPI_VERSION_INCREMENT(PAPI_VERSION));
#else
fprintf(f, "PAPI: no\n");
#endif
#if defined(__FCC_version__)
fprintf(f, "Fujitsu compiler version: %s\n", __FCC_version__);
#if defined(USE_A64FX_SECTOR_CACHE)
fprintf(f, "Fujitsu A64FX sector cache support enabled (L1 ways: ");
#ifndef A64FX_SECTOR_CACHE_L1_WAYS
fprintf(f, "disabled");
#else
fprintf(f, "%d", A64FX_SECTOR_CACHE_L1_WAYS);
#endif
fprintf(f, ", L2 ways: %d)\n", A64FX_SECTOR_CACHE_L2_WAYS);
#endif
#endif
fprintf(f, "\n");
fprintf(f, "%s\n", program_copyright);
fprintf(f, "%s\n", program_license);
}
/**
* ‘parse_long_long_int()’ parses a string to produce a number that
* may be represented with the type ‘long long int’.
*/
static int parse_long_long_int(
const char * s,
char ** outendptr,
int base,
long long int * out_number,
int64_t * bytes_read)
{
errno = 0;
char * endptr;
long long int number = strtoll(s, &endptr, base);
if ((errno == ERANGE && (number == LLONG_MAX || number == LLONG_MIN)) ||
(errno != 0 && number == 0))
return errno;
if (outendptr) *outendptr = endptr;
if (bytes_read) *bytes_read += endptr - s;
*out_number = number;
return 0;
}
/**
* ‘parse_int()’ parses a string to produce a number that may be
* represented as an integer.
*
* The number is parsed using ‘strtoll()’, following the conventions
* documented in the man page for that function. In addition, some
* further error checking is performed to ensure that the number is
* parsed correctly. The parsed number is stored in ‘x’.
*
* If ‘endptr’ is not ‘NULL’, the address stored in ‘endptr’ points to
* the first character beyond the characters that were consumed during
* parsing.
*
* On success, ‘0’ is returned. Otherwise, if the input contained
* invalid characters, ‘EINVAL’ is returned. If the resulting number
* cannot be represented as a signed integer, ‘ERANGE’ is returned.
*/
int parse_int(
int * x,
const char * s,
char ** endptr,
int64_t * bytes_read)
{
long long int y;
int err = parse_long_long_int(s, endptr, 10, &y, bytes_read);
if (err) return err;
if (y < INT_MIN || y > INT_MAX) return ERANGE;
*x = y;
return 0;
}
/**
* ‘parse_int32_t()’ parses a string to produce a number that may be
* represented as a signed, 32-bit integer.
*
* The number is parsed using ‘strtoll()’, following the conventions
* documented in the man page for that function. In addition, some
* further error checking is performed to ensure that the number is
* parsed correctly. The parsed number is stored in ‘x’.
*
* If ‘endptr’ is not ‘NULL’, the address stored in ‘endptr’ points to
* the first character beyond the characters that were consumed during
* parsing.
*
* On success, ‘0’ is returned. Otherwise, if the input contained
* invalid characters, ‘EINVAL’ is returned. If the resulting number
* cannot be represented as a signed integer, ‘ERANGE’ is returned.
*/
int parse_int32_t(
int32_t * x,
const char * s,
char ** endptr,
int64_t * bytes_read)
{
long long int y;
int err = parse_long_long_int(s, endptr, 10, &y, bytes_read);
if (err) return err;
if (y < INT32_MIN || y > INT32_MAX) return ERANGE;
*x = y;
return 0;
}
/**
* ‘parse_int64_t()’ parses a string to produce a number that may be
* represented as a signed, 64-bit integer.
*
* The number is parsed using ‘strtoll()’, following the conventions
* documented in the man page for that function. In addition, some
* further error checking is performed to ensure that the number is
* parsed correctly. The parsed number is stored in ‘x’.
*
* If ‘endptr’ is not ‘NULL’, the address stored in ‘endptr’ points to
* the first character beyond the characters that were consumed during
* parsing.
*
* On success, ‘0’ is returned. Otherwise, if the input contained
* invalid characters, ‘EINVAL’ is returned. If the resulting number
* cannot be represented as a signed integer, ‘ERANGE’ is returned.
*/
int parse_int64_t(
int64_t * x,
const char * s,
char ** endptr,
int64_t * bytes_read)
{
long long int y;
int err = parse_long_long_int(s, endptr, 10, &y, bytes_read);
if (err) return err;
if (y < INT64_MIN || y > INT64_MAX) return ERANGE;
*x = y;
return 0;
}
/**
* ‘parse_double()’ parses a string to produce a number that may be
* represented as ‘double’.
*
* The number is parsed using ‘strtod()’, following the conventions
* documented in the man page for that function. In addition, some
* further error checking is performed to ensure that the number is
* parsed correctly. The parsed number is stored in ‘number’.
*
* If ‘endptr’ is not ‘NULL’, the address stored in ‘endptr’ points to
* the first character beyond the characters that were consumed during
* parsing.
*
* On success, ‘0’ is returned. Otherwise, if the input contained
* invalid characters, ‘EINVAL’ is returned. If the resulting number
* cannot be represented as a double, ‘ERANGE’ is returned.
*/
int parse_double(
double * x,
const char * s,
char ** outendptr,
int64_t * bytes_read)
{
errno = 0;
char * endptr;
*x = strtod(s, &endptr);
if ((errno == ERANGE && (*x == HUGE_VAL || *x == -HUGE_VAL)) ||
(errno != 0 && x == 0)) { return errno; }
if (outendptr) *outendptr = endptr;
if (bytes_read) *bytes_read += endptr - s;
return 0;
}
/**
* ‘parse_program_options()’ parses program options.
*/
static int parse_program_options(
int argc,
char ** argv,
struct program_options * args,
int * nargs)
{
int err;
*nargs = 0;
(*nargs)++; argv++;
/* Set default program options. */
err = program_options_init(args);
if (err) return err;
/* Parse program options. */
int num_positional_arguments_consumed = 0;
while (*nargs < argc) {
if (strcmp(argv[0], "--separate-diagonal") == 0) {
args->separate_diagonal = true;
(*nargs)++; argv++; continue;
}
if (strcmp(argv[0], "--sort-rows") == 0) {
args->sort_rows = true;
(*nargs)++; argv++; continue;
}
if (strcmp(argv[0], "--repeat") == 0) {
if (argc - *nargs < 2) { program_options_free(args); return EINVAL; }
(*nargs)++; argv++;
err = parse_int(&args->repeat, argv[0], NULL, NULL);
if (err) { program_options_free(args); return err; }
(*nargs)++; argv++; continue;
} else if (strstr(argv[0], "--repeat=") == argv[0]) {
err = parse_int(
&args->repeat, argv[0] + strlen("--repeat="), NULL, NULL);
if (err) { program_options_free(args); return err; }
(*nargs)++; argv++; continue;
}
if (strstr(argv[0], "--warmup") == argv[0]) {
int n = strlen("--warmup");
const char * s = &argv[0][n];
if (*s == '=') { s++; }
else if (*s == '\0' && argc-*nargs > 1) { (*nargs)++; argv++; s=argv[0]; }
else { program_options_free(args); return EINVAL; }
err = parse_int(&args->warmup, s, (char **) &s, NULL);
if (err || *s != '\0') { program_options_free(args); return EINVAL; }
(*nargs)++; argv++; continue;
}
#ifdef HAVE_LIBZ
if (strcmp(argv[0], "-z") == 0 ||
strcmp(argv[0], "--gzip") == 0 ||
strcmp(argv[0], "--gunzip") == 0 ||
strcmp(argv[0], "--ungzip") == 0)
{
args->gzip = 1;
(*nargs)++; argv++; continue;
}
#endif
if (strcmp(argv[0], "-q") == 0 || strcmp(argv[0], "--quiet") == 0) {
args->quiet = 1;
(*nargs)++; argv++; continue;
}
if (strcmp(argv[0], "-v") == 0 || strcmp(argv[0], "--verbose") == 0) {
args->verbose++;
(*nargs)++; argv++; continue;
}
#ifdef HAVE_PAPI
if (strstr(argv[0], "--papi-event-file") == argv[0]) {
int n = strlen("--papi-event-file");
const char * s = &argv[0][n];
if (*s == '=') { s++; }
else if (*s == '\0' && argc-*nargs > 1) { (*nargs)++; argv++; s=argv[0]; }
else { program_options_free(args); return EINVAL; }
free(args->papi_event_file);
args->papi_event_file = strdup(s);
if (!args->papi_event_file) { program_options_free(args); return errno; }
(*nargs)++; argv++; continue;
}
if (strstr(argv[0], "--papi-event-format") == argv[0]) {
int n = strlen("--papi-event-format");
const char * s = &argv[0][n];
if (*s == '=') { s++; }
else if (*s == '\0' && argc-*nargs > 1) { (*nargs)++; argv++; s=argv[0]; }
else { program_options_free(args); return EINVAL; }
if (strcmp(s, "csv") == 0) args->papi_event_format = 1;
else if (strcmp(s, "plain") == 0) args->papi_event_format = 0;
else { program_options_free(args); return EINVAL; }
(*nargs)++; argv++; continue;
}
if (strcmp(argv[0], "--papi-event-per-thread") == 0) {
args->papi_event_per_thread = true;
(*nargs)++; argv++; continue;
}
if (strcmp(argv[0], "--papi-event-summary") == 0) {
args->papi_event_summary = true;
(*nargs)++; argv++; continue;
}
#endif
/* If requested, print program help text. */
if (strcmp(argv[0], "-h") == 0 || strcmp(argv[0], "--help") == 0) {
program_options_free(args);
program_options_print_help(stdout);
exit(EXIT_SUCCESS);
}
/* If requested, print program version information. */
if (strcmp(argv[0], "--version") == 0) {
program_options_free(args);
program_options_print_version(stdout);
exit(EXIT_SUCCESS);
}
/* Stop parsing options after '--'. */
if (strcmp(argv[0], "--") == 0) {
(*nargs)++; argv++;
break;
}
/*
* Parse positional arguments.
*/
if (num_positional_arguments_consumed == 0) {
args->Apath = strdup(argv[0]);
if (!args->Apath) { program_options_free(args); return errno; }
} else if (num_positional_arguments_consumed == 1) {
args->xpath = strdup(argv[0]);
if (!args->xpath) { program_options_free(args); return errno; }
} else if (num_positional_arguments_consumed == 2) {
args->ypath = strdup(argv[0]);
if (!args->ypath) { program_options_free(args); return errno; }
} else { program_options_free(args); return EINVAL; }
num_positional_arguments_consumed++;
(*nargs)++; argv++;
}
if (num_positional_arguments_consumed < 1) {
program_options_free(args);
program_options_print_usage(stdout);
exit(EXIT_FAILURE);
}
return 0;
}
/**
* `timespec_duration()` is the duration, in seconds, elapsed between
* two given time points.
*/
static double timespec_duration(
struct timespec t0,
struct timespec t1)
{
return (t1.tv_sec - t0.tv_sec) +
(t1.tv_nsec - t0.tv_nsec) * 1e-9;
}
enum streamtype
{
stream_stdio,
#ifdef HAVE_LIBZ
stream_zlib,
#endif
};
union stream
{
FILE * f;
#ifdef HAVE_LIBZ
gzFile gzf;
#endif
};
void stream_close(
enum streamtype streamtype,
union stream s)
{
if (streamtype == stream_stdio) {
fclose(s.f);
#ifdef HAVE_LIBZ
} else if (streamtype == stream_zlib) {
gzclose(s.gzf);
#endif
}
}
/**
* ‘freadline()’ reads a single line from a stream.
*/
static int freadline(
char * linebuf,
size_t line_max,
enum streamtype streamtype,
union stream stream)
{
if (streamtype == stream_stdio) {
char * s = fgets(linebuf, line_max+1, stream.f);
if (!s && feof(stream.f)) return -1;
else if (!s) return errno;
int n = strlen(s);
if (n > 0 && n == line_max && s[n-1] != '\n') return EOVERFLOW;
return 0;
#ifdef HAVE_LIBZ
} else if (streamtype == stream_zlib) {
char * s = gzgets(stream.gzf, linebuf, line_max+1);
if (!s && gzeof(stream.gzf)) return -1;
else if (!s) return errno;
int n = strlen(s);
if (n > 0 && n == line_max && s[n-1] != '\n') return EOVERFLOW;
return 0;
#endif
} else { return EINVAL; }
}
enum mtxobject
{
mtxmatrix,
mtxvector,
};
enum mtxformat
{
mtxarray,
mtxcoordinate,
};
enum mtxfield
{
mtxreal,
mtxinteger,
mtxpattern,
};
enum mtxsymmetry
{
mtxgeneral,
mtxsymmetric,
};
static int mtxfile_fread_header(
enum mtxobject * object,
enum mtxformat * format,
enum mtxfield * field,
enum mtxsymmetry * symmetry,
idx_t * num_rows,
idx_t * num_columns,
int64_t * num_nonzeros,
enum streamtype streamtype,
union stream stream,
int64_t * lines_read,
int64_t * bytes_read)
{
int line_max = sysconf(_SC_LINE_MAX);
char * linebuf = malloc(line_max+1);
if (!linebuf) return errno;
/* read and parse header line */
int err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
char * s = linebuf;
char * t = s;
if (strncmp("%%MatrixMarket ", t, strlen("%%MatrixMarket ")) == 0) {
t += strlen("%%MatrixMarket ");
} else { free(linebuf); return EINVAL; }
if (bytes_read) *bytes_read += t-s;
s = t;
if (strncmp("matrix ", t, strlen("matrix ")) == 0) {
t += strlen("matrix ");
*object = mtxmatrix;
} else if (strncmp("vector ", t, strlen("vector ")) == 0) {
t += strlen("vector ");
*object = mtxvector;
} else { free(linebuf); return EINVAL; }
if (bytes_read) *bytes_read += t-s;
s = t;
if (strncmp("array ", t, strlen("array ")) == 0) {
t += strlen("array ");
*format = mtxarray;
} else if (strncmp("coordinate ", t, strlen("coordinate ")) == 0) {
t += strlen("coordinate ");
*format = mtxcoordinate;
} else { free(linebuf); return EINVAL; }
if (bytes_read) *bytes_read += t-s;
s = t;
if (strncmp("real ", t, strlen("real ")) == 0) {
t += strlen("real ");
*field = mtxreal;
} else if (strncmp("integer ", t, strlen("integer ")) == 0) {
t += strlen("integer ");
*field = mtxinteger;
} else if (strncmp("pattern ", t, strlen("pattern ")) == 0) {
t += strlen("pattern ");
*field = mtxpattern;
} else { free(linebuf); return EINVAL; }
if (bytes_read) *bytes_read += t-s;
s = t;
if (strncmp("general", t, strlen("general")) == 0) {
t += strlen("general");
*symmetry = mtxgeneral;
} else if (strncmp("symmetric", t, strlen("symmetric")) == 0) {
t += strlen("symmetric");
*symmetry = mtxsymmetric;
} else { free(linebuf); return EINVAL; }
if (bytes_read) *bytes_read += t-s;
s = t;
/* skip lines starting with '%' */
do {
if (lines_read) (*lines_read)++;
err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
s = t = linebuf;
} while (linebuf[0] == '%');
/* parse size line */
if (*object == mtxmatrix && *format == mtxcoordinate) {
err = parse_idx_t(num_rows, s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
err = parse_idx_t(num_columns, s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
err = parse_int64_t(num_nonzeros, s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
if (lines_read) (*lines_read)++;
} else if (*object == mtxvector && *format == mtxarray) {
err = parse_idx_t(num_rows, s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
if (lines_read) (*lines_read)++;
} else { free(linebuf); return EINVAL; }
free(linebuf);
return 0;
}
static int mtxfile_fread_matrix_coordinate(
enum mtxfield field,
idx_t num_rows,
idx_t num_columns,
int64_t num_nonzeros,
idx_t * rowidx,
idx_t * colidx,
double * a,
enum streamtype streamtype,
union stream stream,
int64_t * lines_read,
int64_t * bytes_read)
{
int line_max = sysconf(_SC_LINE_MAX);
char * linebuf = malloc(line_max+1);
if (!linebuf) return errno;
if (field == mtxreal || field == mtxinteger) {
for (int64_t i = 0; i < num_nonzeros; i++) {
int err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
char * s = linebuf;
char * t = s;
err = parse_idx_t(&rowidx[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
err = parse_idx_t(&colidx[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
err = parse_double(&a[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
if (lines_read) (*lines_read)++;
}
} else if (field == mtxinteger) {
for (int64_t i = 0; i < num_nonzeros; i++) {
int err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
char * s = linebuf;
char * t = s;
err = parse_idx_t(&rowidx[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
err = parse_idx_t(&colidx[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
int x;
err = parse_int(&x, s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
a[i] = x;
if (lines_read) (*lines_read)++;
}
} else if (field == mtxpattern) {
for (int64_t i = 0; i < num_nonzeros; i++) {
int err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
char * s = linebuf;
char * t = s;
err = parse_idx_t(&rowidx[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t || *t != ' ') { free(linebuf); return EINVAL; }
if (bytes_read) (*bytes_read)++;
s = t+1;
err = parse_idx_t(&colidx[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
a[i] = 1;
if (lines_read) (*lines_read)++;
}
} else { free(linebuf); return EINVAL; }
free(linebuf);
return 0;
}
static int mtxfile_fread_vector_array(
enum mtxfield field,
idx_t num_rows,
double * x,
enum streamtype streamtype,
union stream stream,
int64_t * lines_read,
int64_t * bytes_read)
{
int line_max = sysconf(_SC_LINE_MAX);
char * linebuf = malloc(line_max+1);
if (!linebuf) return errno;
if (field == mtxreal) {
for (idx_t i = 0; i < num_rows; i++) {
int err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
char * s = linebuf;
char * t = s;
err = parse_double(&x[i], s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
if (lines_read) (*lines_read)++;
}
} else if (field == mtxinteger) {
for (idx_t i = 0; i < num_rows; i++) {
int err = freadline(linebuf, line_max, streamtype, stream);
if (err) { free(linebuf); return err; }
char * s = linebuf;
char * t = s;
int y;
err = parse_int(&y, s, &t, bytes_read);
if (err) { free(linebuf); return err; }
if (s == t) { free(linebuf); return EINVAL; }
x[i] = y;
if (lines_read) (*lines_read)++;
}
} else { free(linebuf); return EINVAL; }
free(linebuf);
return 0;
}
static int ell_from_coo_size(
idx_t num_rows,
idx_t num_columns,
int64_t num_nonzeros,
const idx_t * rowidx,
const idx_t * colidx,
const double * a,
int64_t * rowptr,
int64_t * ellsize,
idx_t * rowsize,
idx_t * diagsize,
bool separate_diagonal)
{
idx_t rowmax = 0;
for (idx_t i = 0; i <= num_rows; i++) rowptr[i] = 0;
for (int64_t k = 0; k < num_nonzeros; k++) {
if (!separate_diagonal || rowidx[k] != colidx[k])
rowptr[rowidx[k]]++;
}
for (idx_t i = 1; i <= num_rows; i++) {
rowmax = rowmax >= rowptr[i] ? rowmax : rowptr[i];
rowptr[i] += rowptr[i-1];
}
*rowsize = rowmax;
*ellsize = num_rows * (*rowsize);
*diagsize = num_rows < num_columns ? num_rows : num_columns;
return 0;
}
static int rowsort(
idx_t num_rows,
idx_t num_columns,
int64_t * __restrict rowptr,
idx_t rowsizemax,
idx_t * __restrict colidx,
double * __restrict a)
{
idx_t threshold = 1 << 4;
/* sort short rows using insertion sort */
#pragma omp parallel for
for (idx_t i = 0; i < num_rows; i++) {
idx_t rowlen = rowptr[i+1]-rowptr[i];
if (rowlen > threshold) continue;
for (int64_t k = rowptr[i]+1; k < rowptr[i+1]; k++) {
idx_t j = colidx[k];
double b = a[k];
int64_t l = k-1;
while (l >= rowptr[i] && colidx[l] > j) {
colidx[l+1] = colidx[l];
a[l+1] = a[l];
l--;
}
colidx[l+1] = j;
a[l+1] = b;
}
}
if (rowsizemax <= threshold) return 0;
/* sort long rows using a hybrid sort that first uses insertion
* sort to sort blocks of size 'threshold', and then switches to a
* bottom-up merge sort. */
idx_t * tmpcolidx = malloc(rowsizemax * sizeof(idx_t));
if (!tmpcolidx) return errno;
double * tmpa = malloc(rowsizemax * sizeof(double));
if (!tmpa) { free(tmpcolidx); return errno; }
#pragma omp parallel
for (idx_t i = 0; i < num_rows; i++) {
idx_t rowlen = rowptr[i+1]-rowptr[i];
if (rowlen <= threshold) continue;
/* #pragma omp single */
/* fprintf(stderr, "i=%d, rowlen=%d\n", i, rowlen); */
idx_t p = threshold;
#pragma omp for
for (idx_t q = 0; q < rowlen-1; q += p) {