aboutsummaryrefslogtreecommitdiff
path: root/src/solvers/distribution.h
blob: a996e3db66154a317436eaccc8b7e424037d400d (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
95
96
97
98
99
100
101
#define ENTRIES_PER_BYTE(k) (UINT64_C(8) / (uint64_t)(k))
#define TABLE_SHIFT(i, k)   ((uint8_t)(k) * (uint8_t)((i) % ENTRIES_PER_BYTE(k)))
#define TABLE_MASK(i, k)    ((UINT8_BIT(k) - UINT8_C(1)) << TABLE_SHIFT(i, k))

typedef struct {
	uint64_t min;
	uint64_t max;
	uint8_t bits;
	uint64_t *distr;
	const unsigned char *table;
} getdistribution_data_t;

STATIC wrapthread_return_t getdistribution_runthread(void *);
STATIC void getdistribution(const unsigned char *,
    uint64_t [SIZE(INFO_DISTRIBUTION_LEN)], const tableinfo_t [NON_NULL]);
STATIC bool distribution_equal(const uint64_t [SIZE(INFO_DISTRIBUTION_LEN)],
    const uint64_t [SIZE(INFO_DISTRIBUTION_LEN)], uint8_t);

STATIC wrapthread_return_t
getdistribution_runthread(void *arg)
{
	getdistribution_data_t *data = (getdistribution_data_t *)arg;
	const unsigned char *table;
	uint8_t j, k, m;
	uint64_t i;

	memset(data->distr, 0, INFO_DISTRIBUTION_LEN * sizeof(uint64_t));

	k = data->bits;
	table = data->table;
	m = TABLE_MASK(0, k);
	for (i = data->min; i < data->max; i++)
		for (j = 0; j < ENTRIES_PER_BYTE(k); j++)
			data->distr[(table[i] & (m << (j*k))) >> (j*k)]++;

	return wrapthread_return_val;
}

STATIC void
getdistribution(
	const unsigned char *table,
	uint64_t distr[SIZE(INFO_DISTRIBUTION_LEN)],
	const tableinfo_t info[NON_NULL]
) {
	getdistribution_data_t targ[THREADS];
	wrapthread_define_var_thread_t(thread[THREADS]);
	uint8_t pval, k;
	uint64_t local_distr[THREADS][INFO_DISTRIBUTION_LEN];
	uint64_t i, j, nbytes, sz, epb;

	k = info->bits;
	epb = ENTRIES_PER_BYTE(k);
	nbytes = info->entries / epb;
	sz = nbytes / THREADS;
	for (i = 0; i < THREADS; i++) {
		targ[i] = (getdistribution_data_t) {
			.min = i * sz,
			.max = i == THREADS - 1 ? nbytes : (i+1) * sz,
			.bits = k,
			.distr = local_distr[i],
			.table = table,
		};
		wrapthread_create(&thread[i],
		    getdistribution_runthread, &targ[i]);
	}

	for (i = 0; i < THREADS; i++)
		wrapthread_join(thread[i]);

	memset(distr, 0, INFO_DISTRIBUTION_LEN * sizeof(uint64_t));
	for (i = 0; i < THREADS; i++)
		for (j = 0; j < INFO_DISTRIBUTION_LEN; j++)
			distr[j] += local_distr[i][j];

	for (i = nbytes * epb; i < info->entries; i++) {
		pval = (table[i/epb] & TABLE_MASK(i, k)) >> TABLE_SHIFT(i, k);
		distr[pval]++;
	}
}

STATIC bool
distribution_equal(
	const uint64_t expected[SIZE(INFO_DISTRIBUTION_LEN)],
	const uint64_t actual[SIZE(INFO_DISTRIBUTION_LEN)],
	uint8_t maxvalue
)
{
	int wrong;
	uint8_t i;

	for (i = 0, wrong = 0; i <= MIN(maxvalue, 20); i++) {
		if (expected[i] != actual[i]) {
			wrong++;
			LOG("[checkdata] Value for depth %" PRIu8
			    ": expected %" PRIu64 ", found %" PRIu64 "\n",
			    i, expected[i], actual[i]);
		}
	}

	return wrong == 0;
}

Generated with cgit - Back to sebastiano.tronto.net