Home
last modified time | relevance | path

Searched refs:item (Results 1 - 25 of 421) sorted by relevance

12345678910>>...17

/5.5.2/godeps/src/github.com/couchbase/gocb/
H A Dbucket_multi.go37 for _, item := range ops {
38 item.execute(b, signal)
42 case item := <-signal:
45 item.cancel()
48 for _, item := range ops {
49 if !item.cancel() {
57 item.markError(ErrTimeout)
76 func (item *GetOp) markError(err error) {
77 item.Err = err
80 func (item *GetO
[all...]
/5.5.2/kv_engine/engines/ep/src/
H A Dsystemevent.cc23 #include "item.h"
33 auto item = std::make_unique<Item>(DocKey(key, DocNamespace::System), in make() local
40 item->setBySeqno(seqno.value()); in make()
43 return item; in make()
54 auto item = std::make_unique<Item>(key, in make() local
60 return item; in make()
87 ProcessStatus SystemEventFlush::process(const queued_item& item) { in process() argument
88 if (item->getOperation() != queue_op::system_event) { in process()
92 switch (SystemEvent(item->getFlags())) { in process()
94 saveCollectionsManifestItem(item); // Update in process()
118 saveCollectionsManifestItem(const queued_item& item) saveCollectionsManifestItem() argument
128 process(const Item& item) process() argument
150 make( uint32_t opaque, const queued_item& item) make() argument
[all...]
/5.5.2/forestdb/src/
H A Dwal.cc108 return __wal_cmp_bykey(aa->item->header, bb->item->header, aux); in _merge_cmp_bykey()
151 return __wal_cmp_byseq(aa->item, bb->item); in _merge_cmp_byseq()
216 DBG("wal item size %ld\n", sizeof(struct wal_item)); in wal_init()
288 * No snapshot exists (First item for a given kv store is inserted)
299 if (!open_snapshot || // if first WAL item inserted for KV store in _wal_fetch_snapshot()
386 if (!_shandle || // No item exist in WAL for this KV Store in wal_snapshot_open()
431 if (covering_item) { // stop until the covering item's snapshot is found in _wal_can_discard()
445 } else { // item' in _wal_can_discard()
514 struct wal_item *item; _wal_insert() local
823 _wal_item_partially_committed(fdb_txn *global_txn, struct list *active_txn_list, fdb_txn *current_txn, struct wal_item *item) _wal_item_partially_committed() argument
859 struct wal_item *item; _wal_get_snap_item() local
913 struct wal_item item_query, *item = NULL; _wal_find() local
1086 _wal_free_item(struct wal_item *item, struct wal *_wal) _wal_free_item() argument
1123 struct wal_item *item; wal_txn_migration() local
1245 struct wal_item *item, *_item; wal_commit() local
1411 _wal_release_item(struct filemgr *file, size_t shard_num, fdb_kvs_id_t kv_id, struct wal_item *item) _wal_release_item() argument
1437 _wal_release_items(struct filemgr *file, size_t shard_num, struct wal_item *item) _wal_release_items() argument
1516 struct wal_item *item; wal_release_flushed_items() local
1566 _wal_do_flush(struct wal_item *item, wal_flush_func *flush_func, void *dbhandle, struct avl_tree *stale_seqnum_list, struct avl_tree *kvs_delta_stats) _wal_do_flush() argument
1641 struct wal_item *item; _wal_flush() local
1850 struct wal_item *item; wal_snap_insert() local
1916 struct wal_item *item; wal_copyto_snapshot() local
1990 struct wal_item query, *item; _wal_snap_find() local
2053 struct wal_item *item = _get_entry(a, struct wal_item, avl_keysnap); wal_snapshot_close() local
2143 struct wal_item *item = NULL; _wal_itr_search_greater_bykey() local
2198 struct wal_item *item = NULL, *_item; _wal_itr_search_greater_byseq() local
2281 struct wal_item *item = NULL; _wal_itr_search_smaller_bykey() local
2336 struct wal_item *item = NULL, *_item; _wal_itr_search_smaller_byseq() local
2421 struct wal_item *item = NULL; _wal_itr_next_bykey() local
2468 struct wal_item *item = NULL, *_item; _wal_itr_next_byseq() local
2561 struct wal_item *item = NULL; _wal_itr_prev_bykey() local
2608 struct wal_item *item = NULL, *_item; _wal_itr_prev_byseq() local
2806 struct wal_item *item; wal_discard() local
2876 struct wal_item *item; _wal_close() local
[all...]
H A Dblockcache.cc137 struct bcache_item *item; member
148 return _CMP_U64(aa->item->bid , bb->item->bid); in _dirty_cmp()
151 if (aa->item->bid < bb->item->bid) return -1; in _dirty_cmp()
152 else if (aa->item->bid > bb->item->bid) return 1; in _dirty_cmp()
160 struct fnamedic_item *item; in _fname_hash() local
161 item = _get_entry(e, struct fnamedic_item, hash_elem); in _fname_hash()
162 return item in _fname_hash()
186 struct bcache_item *item = _get_entry(e, struct bcache_item, hash_elem); _bcache_hash() local
295 struct bcache_item *item; _bcache_alloc_freeblock() local
311 _bcache_release_freeblock(struct bcache_item *item) _bcache_release_freeblock() argument
667 struct bcache_item *item; _bcache_evict() local
899 _bcache_set_score(struct bcache_item *item) _bcache_set_score() argument
918 struct bcache_item *item; bcache_read() local
984 struct bcache_item *item; bcache_invalidate_block() local
1053 struct bcache_item *item; bcache_write() local
1176 struct bcache_item *item; bcache_write_partial() local
1303 struct bcache_item *item; bcache_remove_clean_blocks() local
1392 struct bcache_item *item; bcache_init() local
1482 struct bcache_item *item; bcache_print_items() local
1582 struct bcache_item *item = _get_entry(h, struct bcache_item, hash_elem); _bcache_free_bcache_item() local
1591 struct fnamedic_item *item; _bcache_free_fnamedic() local
1608 struct bcache_item *item; bcache_shutdown() local
[all...]
H A Dstaleblock.cc64 struct stale_info_commit *item, query; in fdb_add_inmem_stale_info() local
72 item = _get_entry(a, struct stale_info_commit, avl); in fdb_add_inmem_stale_info()
75 item = (struct stale_info_commit *)calloc(1, sizeof(struct stale_info_commit)); in fdb_add_inmem_stale_info()
76 item->revnum = revnum; in fdb_add_inmem_stale_info()
77 list_init(&item->doc_list); in fdb_add_inmem_stale_info()
78 avl_insert(&file->stale_info_tree, &item->avl, _inmem_stale_cmp); in fdb_add_inmem_stale_info()
99 // 'item' is allocated in this function call. in fdb_add_inmem_stale_info()
100 avl_remove(&file->stale_info_tree, &item->avl); in fdb_add_inmem_stale_info()
101 free(item); in fdb_add_inmem_stale_info()
129 list_push_back(&item in fdb_add_inmem_stale_info()
239 struct stale_data *item; fdb_gather_stale_blocks() local
446 struct stale_data query, *item; _insert_n_merge() local
580 struct stale_data *item; fdb_get_reusable_block() local
[all...]
/5.5.2/kv_engine/engines/ep/tests/module_tests/
H A Ditem_test.cc22 #include "item.h"
33 SingleThreadedRCPtr<Item> item; member in ItemNoValuePruneTest
35 item = std::make_unique<Item>(makeStoredDocKey("key"), in SetUp()
46 item->pruneValueAndOrXattrs(includeValue, includeXattrs); in TEST_P()
48 auto datatype = item->getDataType(); in TEST_P()
54 EXPECT_EQ(0, item->getNBytes()); in TEST_P()
68 SingleThreadedRCPtr<Item> item; member in ItemTest
80 item = std::make_unique<Item>( in SetUp()
92 item = std::make_unique<Item>( in TEST_F()
101 EXPECT_EQ(PROTOCOL_BINARY_RAW_BYTES, item in TEST_F()
[all...]
H A Devp_store_test.cc104 // Store then eject an item. Note we cannot forcefully evict as we have in TEST_P()
125 << "Expected to get key stats on evicted item"; in TEST_P()
130 // item is no longer resident). As we arn't running the full EPEngine in TEST_P()
135 << "Expected to need to go to disk to get key stats on fully evicted item"; in TEST_P()
138 // item, and re-schedule the bgfetch. in TEST_P()
140 << "Expected to need to go to disk to get key stats on fully evicted item (try 2)"; in TEST_P()
147 << "Expected to get key stats on evicted item after notify_IO_complete"; in TEST_P()
159 // Store then eject an item. in TEST_P()
167 auto item = make_item(vbid, makeStoredDocKey("key"), "value2"); in TEST_P()
168 return store->replace(item, cooki in TEST_P()
201 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
238 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
279 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
329 auto item = make_item(vbid, key, "deleted value"); TEST_P() local
371 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
556 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
611 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
746 auto item = make_item(vbid, dockey, "deletedvalue"); TEST_P() local
796 auto item = make_item(vbid, TEST_P() local
841 auto item = make_item(vbid, key, "value2"); TEST_P() local
917 auto item = make_item(vbid, test.key, "new_value"); TEST_P() local
946 auto item = make_item(vbid, testData[i].key, "new_value"); TEST_P() local
974 auto item = make_item(vbid, key, "value2"); TEST_P() local
[all...]
H A Dkv_bucket_test.cc120 auto item = make_item(vbid, key, value, exptime, datatype); in store_item() local
121 auto returnCode = store->set(item, cookie); in store_item()
126 return item; in store_item()
142 auto item = make_item(vbid, keyii, value, exptime, datatype); in store_items() local
143 auto err = store->set(item, cookie); in store_items()
359 << "Expected to get key stats on existing item"; in TEST_P()
364 // Create then delete an item, checking we get keyStats reporting the item as
381 // Should get success (and item flagged as deleted) if we ask for deleted in TEST_P()
411 auto item in TEST_P() local
421 auto item = make_item(vbid, makeStoredDocKey("key"), "value2"); TEST_P() local
427 auto item = make_item(vbid + 1, makeStoredDocKey("key"), "value2"); TEST_P() local
434 auto item = make_item(vbid, makeStoredDocKey("key"), "value2"); TEST_P() local
443 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
455 auto item = make_item(vbid, key, "value"); TEST_P() local
507 auto item = make_item(vbid, key, "deletedvalue"); TEST_P() local
571 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
577 auto item = make_item(vbid + 1, makeStoredDocKey("key"), "value2"); TEST_P() local
585 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
600 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
617 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
656 auto item = make_item(vbid, key, "value"); TEST_P() local
705 auto item = make_item(vbid, makeStoredDocKey("key"), "value"); TEST_P() local
762 auto item = make_item(vbid, makeStoredDocKey("key1"), "value"); TEST_P() local
828 Item item = store_item(vbid, storeAndDeleteItem() local
1058 Item item = store_item(0, TEST_P() local
1139 Item item = store_item(vbid, key, value, 0, {cb::engine_errc::success}, TEST_P() local
1254 auto item = make_item(vbid, {"key", DocNamespace::DefaultCollection}, "value", 0, 0); TEST_F() local
1297 Item item = store_item( TEST_F() local
[all...]
/5.5.2/platform/src/
H A DcJSON.cc112 * the provided item.
128 static const char *parse_number(cJSON *item, const char *num) in parse_number() argument
137 item->type = cJSON_Number; in parse_number()
138 item->valueint = int64_t(std::stoull(num, &pos)); in parse_number()
144 item->valuedouble = std::stod(num, &pos); in parse_number()
145 item->type = cJSON_Double; in parse_number()
151 /* Render the number nicely from the given item into a string. */
152 static char *print_number(const cJSON *item) in print_number() argument
156 sprintf(str, "%" PRId64, item->valueint); in print_number()
160 /* Render the number nicely from the given item int
161 print_double(const cJSON *item) print_double() argument
179 parse_string(cJSON *item, const char *str) parse_string() argument
323 print_string(const cJSON *item) print_string() argument
368 cJSON_Print(const cJSON *item) cJSON_Print() argument
373 cJSON_PrintUnformatted(const cJSON *item) cJSON_PrintUnformatted() argument
384 parse_value(cJSON *item, const char *value) parse_value() argument
419 print_value(const cJSON *item, int depth, int fmt) print_value() argument
455 parse_array(cJSON *item, const char *value) parse_array() argument
498 print_array(const cJSON *item, int depth, int fmt) print_array() argument
590 parse_object(cJSON *item, const char *value) parse_object() argument
649 print_object(const cJSON *item, int depth, int fmt) print_object() argument
785 cJSON_GetArrayItem(cJSON *array, int item) cJSON_GetArrayItem() argument
804 suffix_object(cJSON *prev, cJSON *item) suffix_object() argument
811 create_reference(cJSON *item) create_reference() argument
822 cJSON_AddItemToArray(cJSON *array, cJSON *item) cJSON_AddItemToArray() argument
835 cJSON_AddItemToObject(cJSON *object, const char *string, cJSON *item) cJSON_AddItemToObject() argument
844 cJSON_AddItemReferenceToArray(cJSON *array, cJSON *item) cJSON_AddItemReferenceToArray() argument
849 cJSON_AddItemReferenceToObject(cJSON *object, const char *string, cJSON *item) cJSON_AddItemReferenceToObject() argument
939 cJSON *item = cJSON_New_Item(); cJSON_CreateNull() local
946 cJSON *item = cJSON_New_Item(); cJSON_CreateTrue() local
953 cJSON *item = cJSON_New_Item(); cJSON_CreateFalse() local
960 cJSON *item = cJSON_New_Item(); cJSON_CreateNumber() local
968 cJSON *item = cJSON_New_Item(); cJSON_CreateDouble() local
976 cJSON *item = cJSON_New_Item(); cJSON_CreateString() local
984 cJSON *item = cJSON_New_Item(); cJSON_CreateArray() local
991 cJSON *item = cJSON_New_Item(); cJSON_CreateObject() local
[all...]
/5.5.2/forestdb/utils/
H A Dmemleak.cc136 struct memleak_item *item; in memleak_end() local
150 item = _get_entry(a, struct memleak_item, avl); in memleak_end()
152 avl_remove(&tree_index, &item->avl); in memleak_end()
158 if (item->freed) { in memleak_end()
160 addr = (uint8_t*)item->addr; in memleak_end()
161 for (i=0;i<item->size;++i){ in memleak_end()
166 (unsigned long)item->addr, item->file, in memleak_end()
167 item->line, item in memleak_end()
205 struct memleak_item *item = (struct memleak_item *)malloc(sizeof(struct memleak_item)); _memleak_add_to_index() local
311 struct memleak_item *item, query; memleak_aligned_free() local
355 struct memleak_item *item, query; memleak_realloc() local
382 struct memleak_item *item, query; memleak_free() local
[all...]
/5.5.2/query-ui/query-ui/ui-current/data_display/
H A Dqw-json-datatable.directive.js484 function createHTMLforValue(item,fieldData,path) {
485 //console.log("Making html for value: " + JSON.stringify(item) /*+ ", field: " + JSON.stringify(fieldData,null,4)*/);
487 return('<span class="' + defaultClass + ' cursor-pointer">NO FIELD ' + JSON.stringify(item) + '</span>');
490 if (_.isArray(item) || _.isPlainObject(item)) // use a different cell type for arrays and objects
501 if (_.isNumber(item)|| _.isBoolean(item))
502 html += item.toString();
504 else if (_.isString(item))
505 html += mySanitize(item);
[all...]
H A Dqw-json-table-editor.directive.js511 var item = tdata[row].data[key];
514 var childHTML = (item || item === 0 || item === "" || item === false) ?
515 makeHTMLtable(item,'[' + row + '].data[\''+ key + '\']', childSize, disabled) : '&nbsp;';
606 function getColumnWidth(item) {
610 if (_.isArray(item)) { // arrays will list vertically, find max width of any element
611 //console.log("Getting width for array: " + JSON.stringify(item));
614 for (var i=0; i < item
[all...]
H A Dqw-json-table.directive.js107 _.forEach(object, function (item, index) {
108 if (_.isPlainObject(item)) {
110 _.forIn(item, function (value, key) {
114 else if (_.isArray(item))
127 _.forEach(object, function (item,index) {
129 makeHTMLtable(item, prefix + '[' + index + ']') + '</td>'
150 _.forEach(object, function (item, index) {
151 // if the item is an object
152 if (_.isPlainObject(item[onlyField])) {
153 _.forIn(item[onlyFiel
[all...]
/5.5.2/ns_server/priv/public/ui/app/components/
H A Dmn_alerts.js38 function isNewAlert(item) {
39 var findedItem = _.find(alertsHistory, item);
43 function startTimer(item, timeout) {
45 removeItem(item);
49 function removeItem(item) {
50 var index = _.indexOf(alerts, item);
51 item.timeout && $timeout.cancel(item.timeout);
56 var item = {
73 alerts.push(item);
[all...]
/5.5.2/moxi/src/
H A Dmemcached.h91 #define ITEM_key(item) (((char*)&((item)->end[0])) \
92 + (((item)->it_flags & ITEM_CAS) ? sizeof(uint64_t) : 0))
94 #define ITEM_suffix(item) ((char*) &((item)->end[0]) + (item)->nkey + 1 \
95 + (((item)->it_flags & ITEM_CAS) ? sizeof(uint64_t) : 0))
97 #define ITEM_data(item) ((char*) &((item)->end[0]) + (item)
345 } item; global() typedef
423 void *item; /* for commands set/add/replace */ global() member
[all...]
H A Ditems.c12 static void item_link_q(item *it);
13 static void item_unlink_q(item *it);
30 static item *heads[LARGEST_ID];
31 static item *tails[LARGEST_ID];
52 /* Get the next CAS id for a new item. */
61 moxi_log_write("item %x refcnt(%c) %d %c%c%c\n", \
85 return sizeof(item) + nkey + *nsuffix + nbytes; in item_make_header()
89 item *do_item_alloc(char *key, const size_t nkey, const int flags, const rel_time_t exptime, const int nbytes) { in do_item_alloc()
98 item *itx = malloc(ntotal); in do_item_alloc()
122 item *i in do_item_alloc()
[all...]
/5.5.2/kv_engine/engines/default_engine/
H A Ditems.cc75 const hash_item *item) { in ITEM_ntotal()
76 size_t ret = sizeof(*item) + hash_key_get_alloc_size(item_get_key(item)) + item->nbytes; in ITEM_ntotal()
80 /* Get the next CAS id for a new item. */
89 fprintf(stderr, "item %p refcnt(%c) %d %c%c\n", \
132 * the item to avoid to grab the slab mutex twice ;-) in do_item_alloc()
141 /* Initialize the item block: */ in do_item_alloc()
151 ** Could not find an expired item at the tail, and memory allocation in do_item_alloc()
168 * search up from tail an item wit in do_item_alloc()
74 ITEM_ntotal(struct default_engine *engine, const hash_item *item) ITEM_ntotal() argument
717 item_release(struct default_engine *engine, hash_item *item) item_release() argument
726 item_unlink(struct default_engine *engine, hash_item *item) item_unlink() argument
743 store_item(struct default_engine *engine, hash_item *item, uint64_t *cas, ENGINE_STORE_OPERATION operation, const void *cookie, const DocumentState document_state) store_item() argument
769 hash_item* item = do_item_get(engine, hkey, DocStateFilter::Alive); do_item_get_locked() local
884 hash_item* item = do_item_get(engine, hkey, DocStateFilter::Alive); do_item_unlock() local
953 hash_item* item = do_item_get(engine, hkey, DocStateFilter::Alive); do_item_get_and_touch() local
1137 item_scrub(struct default_engine *engine, hash_item *item, void *cookie) item_scrub() argument
[all...]
/5.5.2/forestdb/tests/unit/
H A Dhash_test.cc27 struct item { struct
34 struct item *item = _get_entry(e, struct item, e); in hash_func() local
35 return item->val % hash->nbuckets; in hash_func()
40 struct item *aa, *bb; in hash_cmp()
41 aa = _get_entry(a, struct item, e); in hash_cmp()
42 bb = _get_entry(b, struct item, e); in hash_cmp()
53 struct item item[1 in basic_test() local
[all...]
/5.5.2/goproj/src/github.com/couchbase/query/execution/
H A Dproject_initial.go52 func (this *InitialProject) processItem(item value.AnnotatedValue, context *Context) bool {
57 return this.processTerms(item, context)
61 return this.sendItem(item)
71 if item.Type() == value.OBJECT {
72 return this.sendItem(item)
78 v, err := expr.Evaluate(item, context)
84 sv := value.NewScopeValue(make(map[string]interface{}, 1), item)
89 av.SetAnnotations(item)
94 return this.processTerms(item, context)
98 func (this *InitialProject) processTerms(item valu
[all...]
H A Djoin_base.go46 func (this *joinBase) joinEnbatch(item value.AnnotatedJoinPair, b batcher, context *Context) bool {
47 if (len(item.Keys)+this.joinKeyCount > cap(this.joinBatch)) || len(this.joinBatch) >= cap(this.joinBatch) {
57 this.joinBatch = append(this.joinBatch, item)
58 this.joinKeyCount += len(item.Keys)
68 for _, item := range this.joinBatch {
69 for _, key := range item.Keys {
95 for _, item := range this.joinBatch {
98 for _, key := range item.Keys {
107 for _, key := range item.Keys {
115 joined = value.NewAnnotatedValue(item
[all...]
/5.5.2/goproj/src/github.com/couchbase/query/algebra/
H A Dagg_util.go24 Add input item to the cumulative set. Get the set. If
25 no errors enountered add the item to the set and return
27 with capacity _OBJECT_CAP and add the item. Return the
30 func setAdd(item, cumulative value.Value) (value.AnnotatedValue, error) {
38 set.Add(item)
43 set.Add(item)
88 func getSet(item value.Value) (*value.Set, error) {
89 switch item := item.(type) {
91 ps := item
[all...]
/5.5.2/goproj/src/github.com/couchbase/query/expression/
H A Dcomp_between.go19 the input item and the low and high expressions.
25 func NewBetween(item, low, high Expression) Function {
27 *NewTernaryFunctionBase("between", item, low, high),
43 func (this *Between) Evaluate(item value.Value, context Context) (value.Value, error) {
44 return this.TernaryEval(this, item, context)
58 func (this *Between) Apply(context Context, item, low, high value.Value) (value.Value, error) {
59 lowCmp := item.Compare(low)
64 highCmp := item.Compare(high)
92 func NewNotBetween(item, low, high Expression) Expression {
93 return NewNot(NewBetween(item, lo
[all...]
/5.5.2/kv_engine/engines/ep/src/collections/
H A Dvbucket_filter.cc88 bool Collections::VB::Filter::checkAndUpdateSlow(const Item& item) { in checkAndUpdateSlow() argument
90 if (item.getKey().getDocNamespace() == DocNamespace::Collections && in checkAndUpdateSlow()
93 const auto cKey = Collections::DocKey::make(item.getKey(), separator); in checkAndUpdateSlow()
95 } else if (item.getKey().getDocNamespace() == DocNamespace::System) { in checkAndUpdateSlow()
96 allowed = allowSystemEvent(item); in checkAndUpdateSlow()
98 if (item.isDeleted()) { in checkAndUpdateSlow()
99 remove(item); in checkAndUpdateSlow()
105 void Collections::VB::Filter::remove(const Item& item) { in remove() argument
110 const auto cKey = Collections::DocKey::make(item.getKey()); in remove()
122 bool Collections::VB::Filter::allowSystemEvent(const Item& item) cons
[all...]
/5.5.2/couchstore/src/
H A Dcouch_latency.cc62 CouchLatencyItem* CouchLatency::addItem(CouchLatencyItem* item) { in addItem() argument
64 // Once an item is registered, they will run in a lock-free manner. in addItem()
66 auto itr = itemsMap.object.find(item->statName); in addItem()
72 itemsMap.object.insert( std::make_pair(item->statName, item) ); in addItem()
73 item->changeRegisterStatus(true); in addItem()
74 return item; in addItem()
82 CouchLatencyItem *item = itr.second; in getLatencyInfo() local
83 if (!item->latencySum) { in getLatencyInfo()
86 int ret = cb_func(item in getLatencyInfo()
[all...]
/5.5.2/kv_engine/include/memcached/
H A Dengine.h110 typedef std::unique_ptr<item, ItemDeleter> unique_item_ptr;
179 * Allocate an item.
183 * @param output variable that will receive the item
184 * @param key the item's key
186 * value of this item.
187 * @param flags the item's flags
188 * @param exptime the maximum lifetime of this item
203 * Allocate an item.
207 * @param key the item's key
209 * value of this item
623 operator ()(item* item) operator ()() argument
[all...]

Completed in 82 milliseconds

12345678910>>...17