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
|
#include <sys/types.h>
#include <stdio.h>
#include <stdlib.h>
#include "dbm_solver.h"
#include "generic_tree.h"
#include "dbm_kaztree_compare.h"
typedef struct
{
dict_t * kaz_tree;
fcs_meta_compact_allocator_t meta_alloc;
#ifndef FCS_LIBAVL_STORE_WHOLE_KEYS
fcs_compact_allocator_t allocator;
#endif
} dbm_t;
void fc_solve_dbm_store_init(fcs_dbm_store_t * store, const char * path)
{
dbm_t * db;
db = malloc(sizeof(*db));
fc_solve_meta_compact_allocator_init(
&(db->meta_alloc)
);
db->kaz_tree =
fc_solve_kaz_tree_create(compare_records, NULL, &(db->meta_alloc));
#ifndef FCS_LIBAVL_STORE_WHOLE_KEYS
fc_solve_compact_allocator_init(
&(db->allocator), &(db->meta_alloc)
);
#endif
*store = (fcs_dbm_store_t)db;
return;
}
/*
* Returns TRUE if the key was added (it didn't already exist.)
* */
const unsigned char * fc_solve_dbm_store_insert_key_value(
fcs_dbm_store_t store,
const fcs_encoded_state_buffer_t * key,
fcs_encoded_state_buffer_t * parent
)
{
dbm_t * db;
fcs_dbm_record_t * to_check;
fcs_bool_t ret;
#ifdef FCS_LIBAVL_STORE_WHOLE_KEYS
fcs_dbm_record_t record_on_stack;
#endif
db = (dbm_t *)store;
#ifdef FCS_LIBAVL_STORE_WHOLE_KEYS
to_check = &record_on_stack;
#else
to_check = (fcs_dbm_record_t *)fcs_compact_alloc_ptr(&(db->allocator), sizeof(*to_check));
#endif
#ifdef FCS_DBM_RECORD_POINTER_REPR
to_check->key = *key;
{
fcs_dbm_record_t parent_to_check;
parent_to_check.key = *parent;
to_check->parent_ptr = (fcs_dbm_record_t *)fc_solve_kaz_tree_lookup_value(((dbm_t *)store)->kaz_tree, &parent_to_check);
}
#else
to_check->key = *key;
to_check->parent = *parent;
#endif
ret = (fc_solve_kaz_tree_alloc_insert(db->kaz_tree, to_check) == NULL);
#ifndef FCS_LIBAVL_STORE_WHOLE_KEYS
if (! ret)
{
fcs_compact_alloc_release(&(db->allocator));
}
#endif
if (ret)
{
return (unsigned char *)&(((fcs_dbm_record_t *)(fc_solve_kaz_tree_lookup_value(db->kaz_tree, to_check)))->key);
}
else
{
return NULL;
}
}
fcs_bool_t fc_solve_dbm_store_lookup_parent(
fcs_dbm_store_t store,
const unsigned char * key,
unsigned char * parent
)
{
dict_key_t existing;
fcs_dbm_record_t to_check;
to_check.key = *(const fcs_encoded_state_buffer_t *)key;
existing = fc_solve_kaz_tree_lookup_value(((dbm_t *)store)->kaz_tree, &to_check);
if (! existing)
{
return FALSE;
}
else
{
#ifdef FCS_DBM_RECORD_POINTER_REPR
fcs_dbm_record_t * p = (((fcs_dbm_record_t *)existing)->parent_ptr);
if (p)
{
*(fcs_encoded_state_buffer_t *)parent
= p->key;
}
else
{
fcs_init_encoded_state((fcs_encoded_state_buffer_t *)parent);
}
#else
*(fcs_encoded_state_buffer_t *)parent
= ((fcs_dbm_record_t *)existing)->parent;
#endif
return TRUE;
}
}
extern void fc_solve_dbm_store_destroy(fcs_dbm_store_t store)
{
dbm_t * db;
db = (dbm_t *)store;
fc_solve_kaz_tree_destroy( db->kaz_tree );
#ifndef FCS_LIBAVL_STORE_WHOLE_KEYS
fc_solve_compact_allocator_finish( &(db->allocator) );
#endif
fc_solve_meta_compact_allocator_finish( &(db->meta_alloc) );
free(db);
}
|
