14%
28.07.2025
[i] + b[i];
}
When the number of cycles is known at compile time, a loop can be fully unrolled:
c[0] = a[0] + b[0];
c[1] = a[1] + b[1];
c[2] = a[2] + b[2];
c[3] = a[3] + b[3];
However, it remains
14%
30.11.2025
.33
164.69
0.75
rand_mat_stat
3.37
39.34
11.64
54.54
22.07
8.12
rand_mat_mul
1.00
1.18
0.70
1.65
8
14%
30.11.2025
Type yum
10 Arch noarch
11 Sync Schedule 10 0 * * *
12 Packages 10
13 Files 0
14 Distributions None
15 Publish True
16 Clones
14%
30.11.2025
------- ------ ----- ----- ----- ------ -- -----------
03 81 9 2392 3076 76 0.12 3996 AmIcoSinglun64
04 74 9 1464 2568 42 0.09 2172 armsvc
05 195 10 2380 2984 62 0
13%
30.11.2025
interval="0" timeout="60"
05 op stop interval="0" timeout="60"
06 op monitor start-delay="0" interval="1200"
07 meta resource-stickiness="0" failure-timeout="180"
08
09 primitive stonith_bob stonith
