aboutsummaryrefslogtreecommitdiffstats
path: root/test/monniaux/int_mat_run.c
blob: 9d5c0c5756c2a223c4c5f82e3d125d01fb292d19 (plain)
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
#include <stdbool.h>
#include <stdlib.h>
#include <stdio.h>
#include <inttypes.h>
#include "modint.h"

typedef uint64_t cycle_t;

#ifdef __K1C__
#include <mppa_bare_runtime/k1c/registers.h>
static inline void cycle_count_config(void)
{
        /* config pmc for cycle count */
        uint64_t pmc_value = __builtin_k1_get(K1_SFR_PMC);

        pmc_value &= ~(0xfULL);
        __builtin_k1_set(K1_SFR_PMC, pmc_value);
}

static inline uint64_t get_cycle(void)
{
        return __builtin_k1_get(K1_SFR_PM0);
}
#else
static inline void cycle_count_config(void) { }
#ifdef  __x86_64__
#include <x86intrin.h>
static inline cycle_t get_cycle(void) { return __rdtsc(); }
#else
static inline cycle_t get_cycle(void) { return 0; }
#endif
#endif

int main() {
  const unsigned m = 40, n = 21, p = 30;
  cycle_count_config();
  modint *a = malloc(sizeof(modint) * m * n);
  modint_mat_random(m, n, a, n);
  modint *b = malloc(sizeof(modint) * n * p);
  modint_mat_random(n, p, b, p);
  
  modint *c1 = malloc(sizeof(modint) * m * p);
  cycle_t c1_time = get_cycle();
  modint_mat_mul1(m, n, p, c1, p, a, n, b, p);
  c1_time = get_cycle()-c1_time;
  
  modint *c2 = malloc(sizeof(modint) * m * p);
  cycle_t c2_time = get_cycle();
  modint_mat_mul2(m, n, p, c2, p, a, n, b, p);
  c2_time = get_cycle()-c2_time;
  
  modint *c3 = malloc(sizeof(modint) * m * p);
  cycle_t c3_time = get_cycle();
  modint_mat_mul3(m, n, p, c3, p, a, n, b, p);
  c3_time = get_cycle()-c3_time;
  
  modint *c4 = malloc(sizeof(modint) * m * p);
  cycle_t c4_time = get_cycle();
  modint_mat_mul4(m, n, p, c4, p, a, n, b, p);
  c4_time = get_cycle()-c4_time;
  
  modint *c5 = malloc(sizeof(modint) * m * p);
  cycle_t c5_time = get_cycle();
  modint_mat_mul5(m, n, p, c5, p, a, n, b, p);
  c5_time = get_cycle()-c5_time;
  
  printf("c1==c2: %s\n"
	 "c1==c3: %s\n"
	 "c1==c4: %s\n"
	 "c1==c5: %s\n"
	 "c1_time = %" PRIu64 "\n"
	 "c2_time = %" PRIu64 "\n"
	 "c3_time = %" PRIu64 "\n"
	 "c4_time = %" PRIu64 "\n"
	 "c5_time = %" PRIu64 "\n",
	 modint_mat_equal(m, n, c1, p, c2, p)?"true":"false",
	 modint_mat_equal(m, n, c1, p, c3, p)?"true":"false",
	 modint_mat_equal(m, n, c1, p, c4, p)?"true":"false",
	 modint_mat_equal(m, n, c1, p, c5, p)?"true":"false",
	 c1_time,
	 c2_time,
	 c3_time,
	 c4_time,
	 c5_time);
  
  free(a);
  free(b);
  free(c1);
  free(c2);
  free(c3);
  free(c4);
  free(c5);
  return 0;
}