Mirror/aicodix___code
1
0
Fork 0
mirror of https://github.com/aicodix/code.git synced 2026-04-27 22:35:44 +00:00
Code Issues Projects Releases Packages Wiki Activity

reduce only at the last addition

Browse source
This commit is contained in:
Ahmet Inan 2024-03-25 12:00:10 +01:00
commit b5fc0ae664
1 changed files with 8 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

13
cauchy_reed_solomon_erasure_coding2.hh
View file

@ -59,14 +59,17 @@ struct CauchyReedSolomonErasureCoding2
#endif #endif
} }
__attribute__((flatten)) __attribute__((flatten))
static inline void multiply_accumulate(PF *c, const PF *a, PF b, int len, bool init) static inline void multiply_accumulate(PF *c, const PF *a, PF b, int len, bool first, bool last)
{ {
if (init) { if (first) {
for (int i = 0; i < len; i++) for (int i = 0; i < len; i++)
c[i] = b * a[i]; c[i] = b * a[i];
} else if (last) {
for (int i = 0; i < len; i++)
c[i] = reduce(add(c[i], b * a[i]));
} else { } else {
for (int i = 0; i < len; i++) for (int i = 0; i < len; i++)
c[i] += b * a[i]; c[i] = add(c[i], b * a[i]);
} }
} }
void encode(const PF *data, PF *block, int block_id, int block_len, int block_cnt) void encode(const PF *data, PF *block, int block_id, int block_len, int block_cnt)
@ -74,14 +77,14 @@ struct CauchyReedSolomonErasureCoding2
assert(block_id >= block_cnt && block_id < int(PF::P) / 2); assert(block_id >= block_cnt && block_id < int(PF::P) / 2);
for (int k = 0; k < block_cnt; k++) { for (int k = 0; k < block_cnt; k++) {
PF a_ik = cauchy_matrix(block_id, k); PF a_ik = cauchy_matrix(block_id, k);
multiply_accumulate(block, data + block_len * k, a_ik, block_len, !k); multiply_accumulate(block, data + block_len * k, a_ik, block_len, !k, k == block_cnt - 1);
} }
} }
void decode(PF *data, const PF *blocks, const PF *block_ids, int block_idx, int block_len, int block_cnt) void decode(PF *data, const PF *blocks, const PF *block_ids, int block_idx, int block_len, int block_cnt)
{ {
for (int k = 0; k < block_cnt; k++) { for (int k = 0; k < block_cnt; k++) {
PF b_ik = inverse_cauchy_matrix(block_ids, block_idx, k, block_cnt); PF b_ik = inverse_cauchy_matrix(block_ids, block_idx, k, block_cnt);
multiply_accumulate(data, blocks + block_len * k, b_ik, block_len, !k); multiply_accumulate(data, blocks + block_len * k, b_ik, block_len, !k, k == block_cnt - 1);
} }
} }
}; };