Lines Matching refs:item
55 lws_cache_ttl_item_heap_t *item)
58 (const char *)&item[1] + item->size);
60 lws_dll2_remove(&item->list_expiry);
61 lws_dll2_remove(&item->list_lru);
63 cache->cache.current_footprint -= item->size;
68 cache->cache.info.cb((void *)((uint8_t *)&item[1]), item->size);
70 lws_free(item);
75 lws_cache_ttl_item_heap_t *item, int parent_too)
78 const char *tag = ((const char *)&item[1]) + item->size;
81 * We're destroying a normal item?
93 * include this normal item, and if any, invalidate the meta-results
102 const char *iname = ((const char *)&item[1]) + item->size;
103 uint8_t *pay = (uint8_t *)&item[1], *end = pay + item->size;
109 * If the item about to be destroyed makes an
111 * the meta result item to force recalc next time
121 * Sanity check that the item tag is
123 * item
137 * Sanity check that the item tag really isn't a match
138 * for that meta results item
149 _lws_cache_heap_item_destroy(cache, item);
180 lws_cache_ttl_item_heap_t *item;
182 item = lws_container_of(cache->items_expiry.head,
185 if (item->expiry > now)
188 lws_cache_heap_item_destroy(cache, item, 1);
199 lws_cache_ttl_item_heap_t *item;
204 item = lws_container_of(cache->items_expiry.head,
207 *pearliest = item->expiry;
220 /* figure out the next soonest expiring item */
238 lws_cache_ttl_item_heap_t *item = lws_container_of(d,
241 const char *iname = ((const char *)&item[1]) + item->size;
244 return item;
266 lws_cache_ttl_item_heap_t *item = lws_container_of(d,
269 const char *iname = ((const char *)&item[1]) + item->size;
328 lws_cache_ttl_item_heap_t *item, *ei;
353 * If the item about to be added would match any cached
368 * caching a single large item even if it is above the limits
382 item = lws_fi(&_c->info.cx->fic, "cache_write_oom") ? NULL :
383 lws_malloc(sizeof(*item) + kl + 1u + size, __func__);
384 if (!item)
387 cache->cache.current_footprint += item->size;
389 /* only need to zero down our item object */
390 memset(item, 0, sizeof(*item));
392 p = (char *)&item[1];
403 item->expiry = expiry;
404 item->key_len = kl;
405 item->size = size;
409 lws_dll2_add_sorted(&item->list_expiry, &cache->items_expiry,
419 lws_dll2_add_head(&item->list_lru, &cache->items_lru);
429 lws_cache_ttl_item_heap_t *item;
431 item = lws_cache_heap_specific(cache, specific_key);
432 if (!item)
436 lws_dll2_remove(&item->list_lru);
437 lws_dll2_add_head(&item->list_lru, &cache->items_lru);
440 *pdata = (const void *)&item[1];
441 *psize = item->size;
452 lws_cache_ttl_item_heap_t *item;
462 item = (lws_cache_ttl_item_heap_t *)(((uint8_t *)user) - sizeof(*item));
478 * If the item about to be added would match any cached
491 lws_cache_heap_item_destroy(cache, item, 0);
523 lws_cache_ttl_item_heap_t *item =
526 lws_cache_heap_item_destroy(cache, item, 0);
561 lws_cache_ttl_item_heap_t *item =
565 (const char *)&item[1] + item->size,
566 (int)item->size, (unsigned long long)item->expiry);
568 lwsl_hexdump_cache((const char *)&item[1], item->size);
578 lws_cache_ttl_item_heap_t *item = NULL;
583 item = lws_container_of(d, lws_cache_ttl_item_heap_t,
588 item ? (unsigned long long)item->expiry : 0ull);