mirror of
https://github.com/shadowsocks/shadowsocks-libev.git
synced 2026-10-25 18:23:42 +00:00
Refine buffer handling
This commit is contained in:
+64
-65
@@ -34,14 +34,14 @@
|
||||
#endif
|
||||
|
||||
/** Creates a new cache object
|
||||
|
||||
@param dst
|
||||
Where the newly allocated cache object will be stored in
|
||||
|
||||
@param capacity
|
||||
The maximum number of elements this cache object can hold
|
||||
|
||||
@return EINVAL if dst is NULL, ENOMEM if malloc fails, 0 otherwise
|
||||
*
|
||||
* @param dst
|
||||
* Where the newly allocated cache object will be stored in
|
||||
*
|
||||
* @param capacity
|
||||
* The maximum number of elements this cache object can hold
|
||||
*
|
||||
* @return EINVAL if dst is NULL, ENOMEM if malloc fails, 0 otherwise
|
||||
*/
|
||||
int cache_create(struct cache **dst, const size_t capacity,
|
||||
void (*free_cb)(void *element))
|
||||
@@ -57,22 +57,21 @@ int cache_create(struct cache **dst, const size_t capacity,
|
||||
}
|
||||
|
||||
new->max_entries = capacity;
|
||||
new->entries = NULL;
|
||||
new->free_cb = free_cb;
|
||||
*dst = new;
|
||||
new->entries = NULL;
|
||||
new->free_cb = free_cb;
|
||||
*dst = new;
|
||||
return 0;
|
||||
|
||||
}
|
||||
|
||||
/** Frees an allocated cache object
|
||||
|
||||
@param cache
|
||||
The cache object to free
|
||||
|
||||
@param keep_data
|
||||
Whether to free contained data or just delete references to it
|
||||
|
||||
@return EINVAL if cache is NULL, 0 otherwise
|
||||
*
|
||||
* @param cache
|
||||
* The cache object to free
|
||||
*
|
||||
* @param keep_data
|
||||
* Whether to free contained data or just delete references to it
|
||||
*
|
||||
* @return EINVAL if cache is NULL, 0 otherwise
|
||||
*/
|
||||
int cache_delete(struct cache *cache, int keep_data)
|
||||
{
|
||||
@@ -103,17 +102,17 @@ int cache_delete(struct cache *cache, int keep_data)
|
||||
}
|
||||
|
||||
/** Removes a cache entry
|
||||
|
||||
@param cache
|
||||
The cache object
|
||||
|
||||
@param key
|
||||
The key of the entry to remove
|
||||
|
||||
@param key_len
|
||||
The length of key
|
||||
|
||||
@return EINVAL if cache is NULL, 0 otherwise
|
||||
*
|
||||
* @param cache
|
||||
* The cache object
|
||||
*
|
||||
* @param key
|
||||
* The key of the entry to remove
|
||||
*
|
||||
* @param key_len
|
||||
* The length of key
|
||||
*
|
||||
* @return EINVAL if cache is NULL, 0 otherwise
|
||||
*/
|
||||
int cache_remove(struct cache *cache, char *key, size_t key_len)
|
||||
{
|
||||
@@ -142,29 +141,29 @@ int cache_remove(struct cache *cache, char *key, size_t key_len)
|
||||
}
|
||||
|
||||
/** Checks if a given key is in the cache
|
||||
|
||||
@param cache
|
||||
The cache object
|
||||
|
||||
@param key
|
||||
The key to look-up
|
||||
|
||||
@param key_len
|
||||
The length of key
|
||||
|
||||
@param result
|
||||
Where to store the result if key is found.
|
||||
|
||||
A warning: Even though result is just a pointer,
|
||||
you have to call this function with a **ptr,
|
||||
otherwise this will blow up in your face.
|
||||
|
||||
@return EINVAL if cache is NULL, 0 otherwise
|
||||
*
|
||||
* @param cache
|
||||
* The cache object
|
||||
*
|
||||
* @param key
|
||||
* The key to look-up
|
||||
*
|
||||
* @param key_len
|
||||
* The length of key
|
||||
*
|
||||
* @param result
|
||||
* Where to store the result if key is found.
|
||||
*
|
||||
* A warning: Even though result is just a pointer,
|
||||
* you have to call this function with a **ptr,
|
||||
* otherwise this will blow up in your face.
|
||||
*
|
||||
* @return EINVAL if cache is NULL, 0 otherwise
|
||||
*/
|
||||
int cache_lookup(struct cache *cache, char *key, size_t key_len, void *result)
|
||||
{
|
||||
struct cache_entry *tmp = NULL;
|
||||
char **dirty_hack = result;
|
||||
char **dirty_hack = result;
|
||||
|
||||
if (!cache || !key || !result) {
|
||||
return EINVAL;
|
||||
@@ -203,24 +202,24 @@ int cache_key_exist(struct cache *cache, char *key, size_t key_len)
|
||||
}
|
||||
|
||||
/** Inserts a given <key, value> pair into the cache
|
||||
|
||||
@param cache
|
||||
The cache object
|
||||
|
||||
@param key
|
||||
The key that identifies <value>
|
||||
|
||||
@param key_len
|
||||
The length of key
|
||||
|
||||
@param data
|
||||
Data associated with <key>
|
||||
|
||||
@return EINVAL if cache is NULL, ENOMEM if malloc fails, 0 otherwise
|
||||
*
|
||||
* @param cache
|
||||
* The cache object
|
||||
*
|
||||
* @param key
|
||||
* The key that identifies <value>
|
||||
*
|
||||
* @param key_len
|
||||
* The length of key
|
||||
*
|
||||
* @param data
|
||||
* Data associated with <key>
|
||||
*
|
||||
* @return EINVAL if cache is NULL, ENOMEM if malloc fails, 0 otherwise
|
||||
*/
|
||||
int cache_insert(struct cache *cache, char *key, size_t key_len, void *data)
|
||||
{
|
||||
struct cache_entry *entry = NULL;
|
||||
struct cache_entry *entry = NULL;
|
||||
struct cache_entry *tmp_entry = NULL;
|
||||
|
||||
if (!cache) {
|
||||
|
||||
Reference in New Issue
Block a user