Home
last modified time | relevance | path

Searched refs:item (Results 1 – 14 of 14) sorted by relevance

/memcached-1.4.29/
H A Dthread.c276 item[i - 1].next = &item[i]; in cqi_new()
407 conn *c = conn_new(item->sfd, item->init_state, item->event_flags, in thread_libevent_process()
571 int item_link(item *item) { in item_link() argument
575 hv = hash(ITEM_key(item), item->nkey); in item_link()
586 void item_remove(item *item) { in item_remove() argument
588 hv = hash(ITEM_key(item), item->nkey); in item_remove()
607 void item_unlink(item *item) { in item_unlink() argument
609 hv = hash(ITEM_key(item), item->nkey); in item_unlink()
618 void item_update(item *item) { in item_update() argument
620 hv = hash(ITEM_key(item), item->nkey); in item_update()
[all …]
H A Ditems.h6 void item_free(item *it);
10 void do_item_unlink(item *it, const uint32_t hv);
11 void do_item_unlink_nolock(item *it, const uint32_t hv);
12 void do_item_remove(item *it);
13 void do_item_update(item *it); /** update LRU time to current and reposition */
14 void do_item_update_nolock(item *it);
15 int do_item_replace(item *it, item *new_it, const uint32_t hv);
17 int item_is_flushed(item *it);
28 void item_stats_sizes_add(item *it);
29 void item_stats_sizes_remove(item *it);
[all …]
H A Dmemcached.h102 #define ITEM_key(item) (((char*)&((item)->data)) \ argument
105 #define ITEM_suffix(item) ((char*) &((item)->data) + (item)->nkey + 1 \ argument
108 #define ITEM_data(item) ((char*) &((item)->data) + (item)->nkey + 1 \ argument
109 + (item)->nsuffix \
112 #define ITEM_ntotal(item) (sizeof(struct _stritem) + (item)->nkey + 1 \ argument
113 + (item)->nsuffix + (item)->nbytes \
116 #define ITEM_clsid(item) ((item)->slabs_clsid & ~(3<<6)) argument
420 } item; typedef
526 item **icurr;
638 int item_replace(item *it, item *new_it, const uint32_t hv);
[all …]
H A Dassoc.c42 static item** primary_hashtable = 0;
48 static item** old_hashtable = 0;
78 item *assoc_find(const char *key, const size_t nkey, const uint32_t hv) { in assoc_find()
79 item *it; in assoc_find()
90 item *ret = NULL; in assoc_find()
107 static item** _hashitem_before (const char *key, const size_t nkey, const uint32_t hv) { in _hashitem_before()
108 item **pos; in _hashitem_before()
156 int assoc_insert(item *it, const uint32_t hv) { in assoc_insert()
183 item **before = _hashitem_before(key, nkey, hv); in assoc_delete()
186 item *nxt; in assoc_delete()
[all …]
H A Ditems.c163 item *it = NULL; in do_item_alloc()
275 void item_free(item *it) { in item_free()
307 item **head, **tail; in do_item_link_q()
331 item **head, **tail; in do_item_unlink_q()
453 int do_item_replace(item *it, item *new_it, const uint32_t hv) { in do_item_replace()
474 item *it; in item_cachedump()
844 item *it = NULL; in lru_pull_tail()
851 item *search; in lru_pull_tail()
852 item *next_it; in lru_pull_tail()
1198 item **head, **tail; in crawler_link_q()
[all …]
H A Dassoc.h3 item *assoc_find(const char *key, const size_t nkey, const uint32_t hv);
4 int assoc_insert(item *item, const uint32_t hv);
H A Dsizes.c17 display("Item (no cas)", sizeof(item)); in main()
18 display("Item (cas)", sizeof(item) + sizeof(uint64_t)); in main()
H A Dslabs.c251 item *it = NULL; in do_slabs_alloc_chunked()
266 it = (item *)p->slots; in do_slabs_alloc_chunked()
271 it->h_next = (item *)p->slots; in do_slabs_alloc_chunked()
311 item *it = NULL; in do_slabs_alloc()
332 it = (item *)p->slots; in do_slabs_alloc()
373 it->next = (item *) chunk->next; in do_slabs_free_chunked()
407 item *it; in do_slabs_free()
416 it = (item *)ptr; in do_slabs_free()
715 item *new_it = NULL; in slab_rebalance_alloc()
793 item *it = slab_rebal.slab_pos; in slab_rebalance_move()
[all …]
H A Dmemcached.c1008 item *it = c->item; in complete_nread_ascii()
1246 item *it; in complete_incr_bin()
1349 item *it = c->item; in complete_update_bin()
1435 item *it; in process_bin_get_or_touch()
1897 memcpy(mech, ITEM_key((item*)c->item), nkey); in process_bin_complete_sasl_auth()
2175 item *it; in process_bin_update()
2274 item *it; in process_bin_append_prepend()
2361 item *it; in process_bin_delete()
2532 static void _store_item_copy_data(int comm, item *old_it, item *new_it, item *add_it) { in _store_item_copy_data()
3147 item *it; in process_get_command()
[all …]
H A Dlogger.c602 static void _logger_log_evictions(logentry *e, item *it) { in _logger_log_evictions()
682 _logger_log_evictions(e, (item *)entry); in logger_log()
H A DChangeLog72 * New stat: Last accessed time for last evicted item per slab class.
107 * Add per-item-class tracking of evictions and OOM errors (dormando)
572 * big bug fix: item exptime 0 meant expire immediately, not never
/memcached-1.4.29/doc/
H A Dthreads.txt14 - A secondary small hash table of locks is used to lock an item by its hash
15 value. This prevents multiple threads from acting on the same item at the
20 - atomic refcounts per item are used to manage garbage collection and
23 - When pulling an item off of the LRU tail for eviction or re-allocation, the
24 system must attempt to lock the item's bucket, which is done with a trylock
26 walk up the LRU a little in an attempt to fetch a non-busy item.
33 - item_lock must be held while modifying an item.
34 - slabs_lock must be held while modifying the ITEM_SLABBED flag bit within an item.
35 - ITEM_LINKED must not be set before an item has a key copied into it.
50 item or lru locks.
H A Dprotocol.txt67 data block with the item's data; this continues until the server
226 Each item sent by the server looks like this:
231 - <key> is the key for the item being sent
239 this specific item.
241 - <data block> is the data for this item.
294 - <key> is the key of the item the client wishes to change
756 The following item values are defined as of writing.
766 age Age of the oldest item in the LRU.
795 tails to find memory for a new item.
819 'size' is an approximate size of the item, within 32 bytes.
[all …]
H A Dnew_lru.txt28 item reads, only during sets and from the background thread. Also the