-
Notifications
You must be signed in to change notification settings - Fork 1
/
DataParse.c
127 lines (79 loc) · 2.19 KB
/
DataParse.c
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
#include <stdio.h>
#include <stdlib.h>
#include "DataParse.h"
relation* get_relation(char* name, int size){
char* line = NULL;
size_t length;
FILE* file = fopen(name, "r");
if (file==NULL)
{
fprintf(stderr, "get_relation:fopen()\n");
exit(-1);
}
relation* rel = malloc(sizeof(relation));
rel->num_tuples = (uint32_t ) size;
rel->tuples = malloc(rel->num_tuples * sizeof(tuple));
for(int i=0; i<rel->num_tuples; i++){
getline(&line, &length, file);
rel->tuples[i].key = i;
rel->tuples[i].payload = (int32_t) atoi(line);
}
free(line);
line = NULL;
fclose(file);
return rel;
}
int* create_histogram(relation* rel){
int i, buckets, pos;
int suffix = RADIX_N;
buckets = power_of_2(suffix);
int* histogram = malloc(buckets * sizeof(int));
for(i=0; i<buckets; i++){
histogram[i] = 0;
}
for(i=0; i<rel->num_tuples; i++){
pos = rel->tuples[i].payload % buckets;
histogram[pos]++;
}
return histogram;
}
int power_of_2(int power){
int sum=1;
for(int i=0; i<power; i++){
sum *= 2;
}
return sum;
}
int* create_psum(int* histogram, int size) {
int i, sum = 0;
int* psum = malloc(size * sizeof(int));
for(i=0; i<size; i++){
psum[i] = sum;
sum += histogram[i];
}
return psum;
}
relation *create_relation_new(relation *rel, int *psum, int buckets) {
int i, pos;
relation* relation_new = malloc(sizeof(relation));
relation_new->num_tuples = rel->num_tuples;
relation_new->tuples = malloc(rel->num_tuples * sizeof(tuple));
for(i=0; i<relation_new->num_tuples; i++){
pos = psum[rel->tuples[i].payload % buckets];
relation_new->tuples[pos].key = rel->tuples[i].key;
relation_new->tuples[pos].payload = rel->tuples[i].payload;
psum[rel->tuples[i].payload % buckets]++;
}
return relation_new;
}
void freeRelation(relation *rel)
{
free(rel->tuples);
free(rel);
}
int *initializeHistogram(int size) {
int* histogram = malloc(size * sizeof(int));
for(int i=0; i<size; i++)
histogram[i] = 0;
return histogram;
}