|
static ha_storage_t * | ha_storage_create (ulint initial_heap_bytes, ulint initial_hash_cells) |
| Creates a hash storage. More...
|
|
const void * | ha_storage_put_memlim (ha_storage_t *storage, const void *data, ulint data_len, ulint memlim) |
| Copies data into the storage and returns a pointer to the copy. More...
|
|
static const void * | ha_storage_put (ha_storage_t *storage, const void *data, ulint data_len) |
| Same as ha_storage_put_memlim() but without memory limit. More...
|
|
static const char * | ha_storage_put_str (ha_storage_t *storage, const char *str) |
| Copies string into the storage and returns a pointer to the copy. More...
|
|
static const char * | ha_storage_put_str_memlim (ha_storage_t *storage, const char *str, ulint memlim) |
| Copies string into the storage and returns a pointer to the copy obeying a memory limit. More...
|
|
static void | ha_storage_empty (ha_storage_t **storage) |
| Empties a hash storage, freeing memory occupied by data chunks. More...
|
|
static void | ha_storage_free (ha_storage_t *storage) |
| Frees a hash storage and everything it contains, it cannot be used after this call. More...
|
|
static ulint | ha_storage_get_size (const ha_storage_t *storage) |
| Gets the size of the memory used by a storage. More...
|
|
Hash storage.
Provides a data structure that stores chunks of data in its own storage, avoiding duplicates.
Created September 22, 2007 Vasil Dimov
const void * ha_storage_put_memlim |
( |
ha_storage_t * |
storage, |
|
|
const void * |
data, |
|
|
ulint |
data_len, |
|
|
ulint |
memlim |
|
) |
| |
Copies data into the storage and returns a pointer to the copy.
If the same data chunk is already present, then pointer to it is returned. Data chunks are considered to be equal if len1 == len2 and memcmp(data1, data2, len1) == 0. If "data" is not present (and thus data_len bytes need to be allocated) and the size of storage is going to become more than "memlim" then "data" is not added and NULL is returned. To disable this behavior "memlim" can be set to 0, which stands for "no limit".
- Returns
- pointer to the copy in: memory limit to obey
If the same data chunk is already present, then pointer to it is returned. Data chunks are considered to be equal if len1 == len2 and memcmp(data1, data2, len1) == 0. If "data" is not present (and thus data_len bytes need to be allocated) and the size of storage is going to become more than "memlim" then "data" is not added and NULL is returned. To disable this behavior "memlim" can be set to 0, which stands for "no limit".
- Parameters
-
storage | in/out: hash storage |
data | in: data to store |
data_len | in: data length |
memlim | in: memory limit to obey |