aboutsummaryrefslogtreecommitdiffstats
path: root/hicn-light/src/hicn/core/nameBitvector.c
blob: 999f7a928c23ae86a8790c0bc0425074551bb3c1 (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
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
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
/*
 * Copyright (c) 2017-2019 Cisco and/or its affiliates.
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at:
 *
 *     http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

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

#include <hicn/core/messageHandler.h>
#include <hicn/core/nameBitvector.h>

#include <hicn/common.h> // hash32
#include <hicn/ctrl/commands.h>

#define DEFAULT_PORT 1234
#define NAME_LEN 2

const uint64_t BV_SIZE = 64;
const uint64_t WIDTH = 128;
const uint64_t ONE = 0x1;

// address b000:0000:0000:0001:c000:0000:0000:0001 is encodend as follow
// [bits[0] uint64_t       ] [bits[1] unit64_t       ]
// ^                       ^ ^                       ^
// 63                      0 127                     64
// [1000 0000 ... 0000 1101] [1000 0000 ... 0000 0011] //binary
//    1                  b     1                  c    //hex

struct name_bitvector {
    uint64_t bits[NAME_LEN];
    uint8_t len;
    uint8_t IPversion;
};

NameBitvector *
nameBitvector_CreateFromInAddr(uint32_t addr, uint8_t len)
{
    NameBitvector *bitvector = malloc(sizeof(NameBitvector));
    assert(bitvector); // XXX TODO error handling

    bitvector->bits[0] = 0;
    bitvector->bits[1] = 0;

    uint8_t addr_1 = (addr & 0xff000000) >> 24;
    uint8_t addr_2 = (addr & 0x00ff0000) >> 16;
    uint8_t addr_3 = (addr & 0x0000ff00) >> 8;
    uint8_t addr_4 = (addr & 0x000000ff);

    bitvector->bits[0] = (bitvector->bits[0] | addr_4) << 8;
    bitvector->bits[0] = (bitvector->bits[0] | addr_3) << 8;
    bitvector->bits[0] = (bitvector->bits[0] | addr_2) << 8;
    bitvector->bits[0] = (bitvector->bits[0] | addr_1);
    bitvector->bits[0] = bitvector->bits[0] << 32;

    bitvector->len = len;

    bitvector->IPversion = IPv4_TYPE;

    return bitvector;
}

NameBitvector *
nameBitvector_CreateFromIn6Addr(struct in6_addr *addr, uint8_t len)
{
    assert(addr);

    NameBitvector *bitvector = malloc(sizeof(NameBitvector));
    assert(bitvector); // XXX TODO error handling

    bitvector->bits[0] = 0;
    bitvector->bits[1] = 0;

    for (int i = 0; i < 8; ++i) {
        bitvector->bits[0] = (bitvector->bits[0] << 8) | addr->s6_addr[i];
    }

    for (int i = 8; i < 16; ++i) {
        bitvector->bits[1] = (bitvector->bits[1] << 8) | addr->s6_addr[i];
    }

    bitvector->len = len;

    bitvector->IPversion = IPv6_TYPE;

    return bitvector;
}

NameBitvector *
nameBitvector_CreateFromAddress(const address_t * address, uint8_t len)
{
    assert(address);

    switch(address_family(address)) {
        case AF_INET:
            return nameBitvector_CreateFromInAddr(address4_ip(address).s_addr, len);
        case AF_INET6:
            return nameBitvector_CreateFromIn6Addr(&address6_ip(address), len);
        default:
            return NULL;
    }
}

NameBitvector *
nameBitvector_Copy(const NameBitvector *original)
{
    assert(original);

    NameBitvector *copy = malloc(sizeof(NameBitvector));
    assert(copy); // XXX TODO error handling

    copy->bits[0] = original->bits[0];
    copy->bits[1] = original->bits[1];
    copy->len = original->len;

    return copy;
}

void
nameBitvector_Destroy(NameBitvector **bitvectorPtr)
{
    assert(bitvectorPtr);
    assert(*bitvectorPtr);

    NameBitvector *bv = *bitvectorPtr;
    free(bv);
    *bitvectorPtr = NULL;
}

uint8_t
nameBitvector_GetLength(const NameBitvector *name)
{
    return name->len;
}

uint32_t
nameBitvector_GetHash32(const NameBitvector *name)
{
    return hash32(&name->bits, 16);
}

bool
nameBitvector_Equals(const NameBitvector *a, const NameBitvector *b)
{
    if (a->bits[0] == b->bits[0] && a->bits[1] == b->bits[1] && a->len == b->len)
        return true;
    return false;
}

int
nameBitvector_Compare(const NameBitvector *a, const NameBitvector *b)
{
    if (a == NULL && b == NULL) {
        return 0;
    }
    if (a == NULL) {
        return -1;
    }
    if (b == NULL) {
        return +1;
    }

    if (a->bits[0] < b->bits[0]) {
        return -1;
    } else if (a->bits[0] > b->bits[0]) {
        return +1;
    } else if (a->bits[1] < b->bits[1]) {
        return -1;
    } else if (a->bits[1] > b->bits[1]) {
        return +1;
    } else if (a->len < b->len) {
        return -1;
    } else if (a->len > b->len) {
        return +1;
    } else {
        return 0;
    }
}

int
nameBitvector_testBit(const NameBitvector *name, uint8_t pos, bool *bit)
{
    if(pos >= name->len  || pos > (WIDTH -1))
        return -1;

    *bit = (name->bits[pos / BV_SIZE] & (ONE << ((BV_SIZE - 1) - (pos % BV_SIZE))));

    return 0;
}

// TODO XXX use ffs(ll)
uint64_t
_diff_bit_log2(uint64_t val)
{
    // base 2 log of an uint64_t. This is the same as get the position of
    // the highest bit set (or most significant bit set, MSB)
    uint64_t result = 0;

    if (val & 0xFFFFFFFF00000000) {
        val = val >> 32;
        result = result | 32;
    }
    if (val & 0xFFFF0000) {
        val = val >> 16;
        result = result | 16;
    }
    if (val & 0xFF00) {
        val = val >> 8;
        result = result | 8;
    }
    if (val & 0xF0) {
        val = val >> 4;
        result = result | 4;
    }
    if (val & 0xC) {
        val = val >> 2;
        result = result | 2;
    }
    if (val & 0x2) {
        val = val >> 1;
        result = result | 1;
    }
    return result;
}

uint32_t
nameBitvector_lpm(const NameBitvector *a, const NameBitvector *b)
{
    uint32_t limit;
    uint32_t prefix_len;
    if (a->len < b->len)
        limit = a->len;
    else
        limit = b->len;

    uint64_t diff = a->bits[0] ^ b->bits[0];
    if(diff){
        prefix_len = (uint32_t)(BV_SIZE - (_diff_bit_log2(diff) + 1));
        //printf("if 1 diff = %lu plen = %d\n", diff, prefix_len);
    }else{
        prefix_len = BV_SIZE;
        diff = a->bits[1] ^ b->bits[1];
        if(diff){
            prefix_len +=  (BV_SIZE - (_diff_bit_log2(diff) + 1));
            //printf("if 2 diff = %lu plen = %d\n", diff, prefix_len);
        }else{
            prefix_len += BV_SIZE;
        }
    }

    if(prefix_len < limit)
        return prefix_len;
    return limit;
}

void
nameBitvector_clear(NameBitvector *a, uint8_t start_from)
{
    for(uint8_t pos = start_from; pos < WIDTH; pos++)
        a->bits[pos / BV_SIZE] &= ~(ONE << ((BV_SIZE - 1) - (pos % BV_SIZE)));
}

int
nameBitvector_ToIPAddress(const NameBitvector *name, ip_prefix_t *prefix)
{
    if (name->IPversion == IPv4_TYPE) {
        struct in_addr *addr = (struct in_addr *)(&prefix->address.v4.buffer);
        prefix->family = AF_INET;
        prefix->len = IPV4_ADDR_LEN_BITS;

        uint32_t tmp_addr = name->bits[0] >> 32ULL;
        uint8_t addr_1 = (tmp_addr & 0xff000000) >> 24;
        uint8_t addr_2 = (tmp_addr & 0x00ff0000) >> 16;
        uint8_t addr_3 = (tmp_addr & 0x0000ff00) >> 8;
        uint8_t addr_4 = (tmp_addr & 0x000000ff);

        addr->s_addr = 0;
        addr->s_addr = (addr->s_addr | addr_4) << 8;
        addr->s_addr = (addr->s_addr | addr_3) << 8;
        addr->s_addr = (addr->s_addr | addr_2) << 8;
        addr->s_addr = (addr->s_addr | addr_1);

    } else {
        struct in6_addr *addr = (struct in6_addr *)(&prefix->address.v6.buffer);
        prefix->family = AF_INET6;
        prefix->len = name->len;  // IPV6_ADDR_LEN_BITS;

        for (int i = 0; i < 8; i++) {
            addr->s6_addr[i] = (uint8_t)((name->bits[0] >> 8 * (7 - i)) & 0xFF);
        }

        int x = 0;
        for (int i = 8; i < 16; ++i) {
            addr->s6_addr[i] = (uint8_t)((name->bits[1] >> 8 * (7 - x)) & 0xFF);
            x++;
        }
    }
    return true;
}

void
nameBitvector_setLen(NameBitvector *name, uint8_t len)
{
    name->len = len;
}

void
nameBitvector_ToAddress(const NameBitvector *name, address_t * address)
{
    if (name->IPversion == IPv4_TYPE) {
        struct sockaddr_in * sin = address4(address);
        sin->sin_family = AF_INET;
        sin->sin_port = htons(DEFAULT_PORT);

        uint32_t tmp_addr = name->bits[0] >> 32ULL;
        uint8_t addr_1 = (tmp_addr & 0xff000000) >> 24;
        uint8_t addr_2 = (tmp_addr & 0x00ff0000) >> 16;
        uint8_t addr_3 = (tmp_addr & 0x0000ff00) >> 8;
        uint8_t addr_4 = (tmp_addr & 0x000000ff);

        sin->sin_addr.s_addr = 0;
        sin->sin_addr.s_addr = (sin->sin_addr.s_addr | addr_4) << 8;
        sin->sin_addr.s_addr = (sin->sin_addr.s_addr | addr_3) << 8;
        sin->sin_addr.s_addr = (sin->sin_addr.s_addr | addr_2) << 8;
        sin->sin_addr.s_addr = (sin->sin_addr.s_addr | addr_1);
    } else {
        struct sockaddr_in6 * sin6 = address6(address);
        sin6->sin6_family = AF_INET6;
        sin6->sin6_port = htons(DEFAULT_PORT);
        sin6->sin6_scope_id = 0;
        sin6->sin6_flowinfo = 0;

        for (int i = 0; i < 8; i++) {
            sin6->sin6_addr.s6_addr[i] =
                (uint8_t)((name->bits[0] >> 8 * (7 - i)) & 0xFF);
        }

        int x = 0;
        for (int i = 8; i < 16; ++i) {
            sin6->sin6_addr.s6_addr[i] =
                (uint8_t)((name->bits[1] >> 8 * (7 - x)) & 0xFF);
            x++;
        }
    }
}

char *
nameBitvector_ToString(const NameBitvector *name) {
    char *output = malloc(WIDTH);

    address_t address;
    nameBitvector_ToAddress(name, &address);

    // XXX TODO
#if 0
    sprintf(output, "prefix: %s len: %u", addressToString(packetAddr), name->len);
#else
    snprintf(output, WIDTH, "%s", "ENOIMPL");
#endif

    return output;
}