moonlight-common-c/nanors/rs.c

#include <assert.h>
#include <stdint.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>

#include "oblas_lite.c"
#include "rs.h"

static void axpy(u8 *a, u8 *b, u8 u, int k)
{
    if (u == 0)
        return;

    if (u == 1) {
        register u8 *ap = a, *ae = &a[k], *bp = b;
        for (; ap < ae; ap++, bp++)
            *ap ^= *bp;
    } else {
        obl_axpy(a, b, u, k);
    }
}

static void scal(u8 *a, u8 u, int k)
{
    if (u < 2)
        return;
    obl_scal(a, u, k);
}

static void gemm(u8 *a, u8 **b, u8 **c, int n, int k, int m)
{
    int ci = 0;
    for (int row = 0; row < n; row++, ci++) {
        u8 *ap = a + (row * k);
        memset(c[ci], 0, m);
        for (int idx = 0; idx < k; idx++)
            axpy(c[ci], b[idx], ap[idx], m);
    }
}

static int invert_mat(u8 *src, u8 *wrk, u8 **dst, int V0, int K, int T, u8 *c, u8 *d)
{
    int V0b = V0, W = K - V0;
    u8 u = 0;
    for (int i = 0; i < W; i++) {
        int dr = d[i] * K;
        for (int j = 0; j < W; j++)
            wrk[i * W + j] = src[dr + c[V0 + j]];
    }
    for (; V0 < K; V0++) {
        int dr = d[V0 - V0b] * K;
        for (int row = 0; row < V0b; row++) {
            u = src[dr + c[row]];
            axpy(dst[c[V0]], dst[c[row]], u, T);
        }
    }
    for (int x = 0; x < W; x++) {
        u = GF2_8_INV[wrk[x * W + x]];
        scal(wrk + x * W + x, u, W);
        scal(dst[c[V0b + x]], u, T);
        for (int row = x + 1; row < W; row++) {
            u = wrk[row * W + x];
            axpy(wrk + row * W, wrk + x * W, u, W);
            axpy(dst[c[V0b + row]], dst[c[V0b + x]], u, T);
        }
    }
    for (int x = W - 1; x >= 0; x--) {
        u8 *from = dst[c[V0b + x]];
        for (int row = 0; row < x; row++) {
            u = wrk[row * W + x];
            axpy(dst[c[V0b + row]], from, u, T);
        }
    }
    return 0;
}

void reed_solomon_init(void)
{
}

reed_solomon *reed_solomon_new_static(void *buf, size_t len, int ds, int ps)
{
    reed_solomon *rs = buf;

    if ((ds + ps) > DATA_SHARDS_MAX || ds <= 0 || ps <= 0)
        return NULL;

    if (len < reed_solomon_bufsize(ds, ps))
        return NULL;

    memset(buf, 0, len);

    rs->ds = ds;
    rs->ps = ps;
    rs->ts = ds + ps;

    for (int j = 0; j < rs->ps; j++) {
        u8 *row = rs->p + j * rs->ds;
        for (int i = 0; i < rs->ds; i++)
            row[i] = GF2_8_INV[(rs->ps + i) ^ j];
    }

    return rs;
}

reed_solomon *reed_solomon_new(int ds, int ps)
{
    size_t len = reed_solomon_bufsize(ds, ps);
    void *buf = malloc(len);
    if (!buf)
        return NULL;

    if (reed_solomon_new_static(buf, len, ds, ps) == NULL) {
        free(buf);
        return NULL;
    }

    return buf;
}

void reed_solomon_release(reed_solomon *rs)
{
    if (rs)
        free(rs);
}

int reed_solomon_decode(reed_solomon *rs, u8 **data, u8 *marks, int nr_shards, int bs)
{
    if (nr_shards < rs->ts)
        return -1;

#ifdef _MSC_VER
    u8 *erasures = _alloca(rs->ds);
    u8 *colperm = _alloca(rs->ds);
    u8 *rowperm = _alloca(rs->ds);
#else
    u8 erasures[rs->ds], colperm[rs->ds], rowperm[rs->ds];
#endif


    u8 *wrk = rs->p + 1 * rs->ps * rs->ds;
    u8 gaps = 0;

    for (int i = 0; i < rs->ds; i++)
        if (marks[i])
            erasures[gaps++] = i;
    for (int i = 0, j = 0; i < rs->ds - gaps; i++, j++) {
        while (marks[j])
            j++;
        colperm[i] = j;
    }
    for (int i = 0, j = rs->ds - gaps; i < gaps; i++, j++)
        colperm[j] = erasures[i];

    int i = 0;
    for (int j = rs->ds; i < gaps; i++, j++) {
        while (marks[j])
            j++;
        if (j >= nr_shards)
            break;
        rowperm[i] = j - rs->ds;
        memcpy(data[erasures[i]], data[j], bs);
    }
    if (i < gaps)
        return -1;

    invert_mat(rs->p, wrk, data, rs->ds - gaps, rs->ds, bs, colperm, rowperm);
    return 0;
}

int reed_solomon_encode(reed_solomon *rs, u8 **shards, int nr_shards, int bs)
{
    if (nr_shards < rs->ts)
        return -1;
    gemm(rs->p, shards, shards + rs->ds, rs->ps, rs->ds, bs);
    return 0;
}