/
main.c
91 lines (76 loc) · 2.6 KB
/
main.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
/**
* @file main.c
* @version 7.0.0
*
* @section License
* Copyright (C) 2014-2016, Erik Moqvist
*
* This library is free software; you can redistribute it and/or
* modify it under the terms of the GNU Lesser General Public
* License as published by the Free Software Foundation; either
* version 2.1 of the License, or (at your option) any later version.
*
* This library is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* This file is part of the Simba project.
*/
#include "simba.h"
static int hash(long key)
{
return (0);
}
int test_add_get_remove(struct harness_t *harness)
{
struct hash_map_t map;
struct hash_map_bucket_t buckets[8];
struct hash_map_entry_t entries[4];
hash_map_init(&map,
buckets,
membersof(buckets),
entries,
membersof(entries),
hash);
/* Add three entries. */
BTASSERT(hash_map_add(&map, 37, (void *)34) == 0);
BTASSERT(hash_map_add(&map, 38, (void *)35) == 0);
BTASSERT(hash_map_add(&map, 39, (void *)36) == 0);
BTASSERT(hash_map_add(&map, 39, (void *)36) == 0);
/* Get them. */
BTASSERT(hash_map_get(&map, 38) == (void *)35);
BTASSERT(hash_map_get(&map, 39) == (void *)36);
BTASSERT(hash_map_get(&map, 37) == (void *)34);
/* Remove first two. */
BTASSERT(hash_map_remove(&map, 37) == 0);
BTASSERT(hash_map_remove(&map, 38) == 0);
BTASSERT(hash_map_remove(&map, 38) == -1);
/* Get removed entries. */
BTASSERT(hash_map_get(&map, 37) == NULL);
BTASSERT(hash_map_get(&map, 38) == NULL);
/* Get, remove and get last entry. */
BTASSERT(hash_map_get(&map, 39) == (void *)36);
BTASSERT(hash_map_remove(&map, 39) == 0);
BTASSERT(hash_map_remove(&map, 39) == -1);
BTASSERT(hash_map_get(&map, 39) == NULL);
/* Add one entry over limit. */
BTASSERT(hash_map_add(&map, 37, (void *)4) == 0);
BTASSERT(hash_map_add(&map, 39, (void *)5) == 0);
BTASSERT(hash_map_add(&map, 41, (void *)6) == 0);
BTASSERT(hash_map_add(&map, 43, (void *)7) == 0);
BTASSERT(hash_map_add(&map, 45, (void *)8) == -ENOMEM);
return (0);
}
int main()
{
struct harness_t harness;
struct harness_testcase_t harness_testcases[] = {
{ test_add_get_remove, "test_add_get_remove" },
{ NULL, NULL }
};
sys_start();
harness_init(&harness);
harness_run(&harness, harness_testcases);
return (0);
}