raptorQ/Symbol.cpp at master · foxsen/raptorQ · GitHub

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
#include "StdAfx.h"
#include <iostream>
#include <fstream>

#include "Symbol.h"
#include "Tables.h"
#include "Generators.h"

using namespace std;

Symbol::Symbol(void)
{
	nbytes = 0;
	data = NULL;
	sbn = -1;
	esi = -1;
}

Symbol::Symbol(unsigned int size)
{
	if (size % sizeof(int) != 0) {
		cout << "size must be a multiple of " << sizeof(int) << " bytes" << endl;
	}

	data = new int[size/sizeof(int)];
	memset(data, 0, size);
	nbytes = size;
}

Symbol::~Symbol(void)
{
	if (data) delete[] data;
	nbytes = 0;
}

void Symbol::init(int size)
{
	if (nbytes != size) {
		if (data) delete[] data;
		if (size % sizeof(int) != 0) {
			cout << "size must be a multiple of " << sizeof(int) << " bytes" << endl;
		}
		nbytes = size;
		data = new int[size/sizeof(int)];
	}
	memset(data, 0, size);
}

void Symbol::fillData(char *src, int size)
{
	if (nbytes != size) {
		if (data) delete[] data;
		nbytes = size;
		data = new int[size/sizeof(int)];
	}
	memcpy(data, src, size);
}

void Symbol::print(void)
{
	int i;

	for (i=0; i< nbytes/sizeof(int); i++)
	{
		cout << data[i] << " ";
	}
	cout << endl;

}

Symbol& Symbol::operator=(const Symbol &s)
{
	if (nbytes != s.nbytes) {
	  if (data) delete[] data;
	  nbytes = s.nbytes;
	  data = new int[nbytes/sizeof(int)];
	}
	memcpy(data, s.data, s.nbytes);

	return *this;
}

Symbol& Symbol::operator^(const Symbol &s)
{
	int i;

    if (nbytes != s.nbytes)
		cout << "Error! try to xor symbols with unmatched size" << endl;

	for (i=0;i<nbytes/4; i++)
		data[i] = data[i] ^ s.data[i];

	return *this;
}

void Symbol::xxor(Symbol *s)
{
	int i;

    if (nbytes != s->nbytes)
		cout << "Error! try to xor symbols with unmatched size" << endl;

	for (i=0;i<nbytes/4; i++)
		data[i] = data[i] ^ s->data[i];

}

void Symbol::mul(unsigned char u)
{
	int i;
	unsigned char *p = (unsigned char*)data;
	const unsigned char *mul_row = OCT_MUL[u];

	for (i=0;i<nbytes; i++)
		p[i] = mul_row[p[i]];
}

void Symbol::div(unsigned char u)
{
	int i;
	unsigned char *p = (unsigned char*)data;

	if (u == 1) return;
	/* compute multiplicative inverse: u^(-1) = exp(255 - log(u)) */
	unsigned char inv = OCT_EXP[255 - OCT_LOG[u]];
	const unsigned char *mul_row = OCT_MUL[inv];

	for (i=0;i<nbytes; i++)
		p[i] = mul_row[p[i]];
}

void Symbol::muladd(Symbol *s, unsigned char u)
{
	int i;

	if (nbytes != s->nbytes)
		cout << "Error! try to muladd symbols with unmatched size" << endl;

	if (u == 1) {
		/* XOR path: process 4 bytes at a time */
		for (i = 0; i < nbytes/4; i++)
			data[i] ^= s->data[i];
	} else {
		unsigned char *p = (unsigned char*)data;
		unsigned char *p1 = (unsigned char*)s->data;
		const unsigned char *mul_row = OCT_MUL[u];
		for (i = 0; i < nbytes; i++)
			p[i] ^= mul_row[p1[i]];
	}
}