Searched refs:free (Results 1 - 25 of 58) sorted by relevance

123

/tldk/lib/libtle_memtank/
H A Dtle_memtank_pub.h37 void *free[]; member in struct:tle_memtank
78 _copy_objs(obj, t->free + len, n);
95 _copy_objs(t->free + len, obj, n);
106 void *free[num]; local
108 k = tle_memtank_chunk_alloc(t, free, RTE_DIM(free), flags);
109 n = _put_free(t, free, k);
111 tle_memtank_chunk_free(t, free + n, k - n, 0);
122 /* not enough free objects, try to allocate via memchunks */
126 /* refill *free* tan
[all...]
H A Dmemtank.h39 uint32_t nb_free; /* number of free object in the chunk */
40 void *free[]; /* array of free objects */ member in struct:memchunk
52 MC_FULL, /* all memchunk objs are free */
H A Dtle_memtank.h34 * Same a s mempool it allows to alloc/free objects of fixed size
40 * - different alloc/free policies
62 /** min number of free objs in the ring (grow threshold). */
64 uint32_t max_free; /**< max number of free objs (empty threshold) */
72 /** user provided function to free chunk of memory */
73 void (*free)(void *, void *); member in struct:tle_memtank_prm
76 void *udata; /**< opaque user data for alloc/free/init */
94 * Destroy the memtank and free all memory referenced by the memtank.
132 * Note that this function bypasses *free* cache(s) and tries to allocate
152 /** free flag
[all...]
H A Dmemtank.c29 sz = sizeof(*mt) + nb_free * sizeof(mt->pub.free[0]);
40 sz = sizeof(*ch) + nb_obj * sizeof(ch->free[0]);
92 ch->free[i] = (void *)p;
100 mt->prm.init(ch->free, n, mt->prm.udata);
118 _copy_objs(ch->free + n, obj, num);
164 mt->prm.free(ch[i]->raw, mt->prm.udata);
316 _copy_objs(obj + n, ch->free + l, k);
405 /* try to grow and refill the *free* */
425 /* how many chunks we need to free */
428 /* free u
[all...]
/tldk/app/nginx/src/os/win32/
H A Dngx_alloc.h19 #define ngx_free free
/tldk/lib/libtle_l4p/
H A Devent.c46 TAILQ_INIT(&evq->free);
50 TAILQ_INSERT_TAIL(&evq->free, evq->events + i, ql);
76 h = TAILQ_FIRST(&evq->free);
78 TAILQ_REMOVE(&evq->free, h, ql);
101 TAILQ_INSERT_HEAD(&q->free, ev, ql);
H A Dstream.h61 for (i = 0, p = STAILQ_FIRST(&ctx->streams.free);
67 /* we retrieved all free entries */
68 STAILQ_INIT(&ctx->streams.free);
70 STAILQ_FIRST(&ctx->streams.free) = p;
96 STAILQ_INSERT_HEAD(&ctx->streams.free, s, link);
98 STAILQ_INSERT_TAIL(&ctx->streams.free, s, link);
H A Dctx.h56 uint32_t nb_free; /* number of free streams. */
57 STAILQ_HEAD(, tle_stream) free; member in struct:tle_ctx::__anon2
/tldk/app/nginx/src/os/unix/
H A Dngx_alloc.h19 #define ngx_free free
/tldk/test/memtank/
H A Dtest_memtank.c49 } free; member in struct:memstat
69 } free; member in struct:memtank_stat
150 uint32_t wrk_free_thrsh; /* wrk free thresh % (0-100) */
151 int32_t mem_func; /* memory subsystem to use for alloc/free */
177 return free(p);
209 rte_atomic64_inc(&ms->free.nb_call);
211 rte_atomic64_inc(&ms->free.nb_fail);
224 nb_alloc -= rte_atomic64_read(&ms->free.nb_call) -
225 rte_atomic64_read(&ms->free.nb_fail);
244 rte_atomic64_read(&ms->free
[all...]
/tldk/app/nginx/src/core/
H A Dngx_buf.c156 ngx_chain_get_free_buf(ngx_pool_t *p, ngx_chain_t **free) argument
160 if (*free) {
161 cl = *free;
162 *free = cl->next;
184 ngx_chain_update_chains(ngx_pool_t *p, ngx_chain_t **free, ngx_chain_t **busy, argument
219 cl->next = *free;
220 *free = cl;
H A Dngx_radix_tree.c27 tree->free = NULL;
214 node->right = tree->free;
215 tree->free = node;
402 node->right = tree->free;
403 tree->free = node;
468 if (tree->free) {
469 p = tree->free;
470 tree->free = tree->free->right;
H A Dngx_md5.c33 size_t used, free; local
39 free = 64 - used;
41 if (size < free) {
46 ngx_memcpy(&ctx->buffer[used], data, free);
47 data = (u_char *) data + free;
48 size -= free;
64 size_t used, free; local
70 free = 64 - used;
72 if (free < 8) {
73 ngx_memzero(&ctx->buffer[used], free);
[all...]
H A Dngx_buf.h81 ngx_chain_t *free; member in struct:ngx_output_chain_ctx_s
162 ngx_chain_t *ngx_chain_get_free_buf(ngx_pool_t *p, ngx_chain_t **free);
163 void ngx_chain_update_chains(ngx_pool_t *p, ngx_chain_t **free,
H A Dngx_sha1.c35 size_t used, free; local
41 free = 64 - used;
43 if (size < free) {
48 ngx_memcpy(&ctx->buffer[used], data, free);
49 data = (u_char *) data + free;
50 size -= free;
66 size_t used, free; local
72 free = 64 - used;
74 if (free < 8) {
75 ngx_memzero(&ctx->buffer[used], free);
[all...]
H A Dngx_radix_tree.h31 ngx_radix_node_t *free; member in struct:__anon48
H A Dngx_slab.h42 ngx_slab_page_t free; member in struct:__anon67
/tldk/app/nginx/src/http/v2/
H A Dngx_http_v2_table.c189 h2c->hpack.free = NGX_HTTP_V2_TABLE_SIZE;
199 h2c->hpack.free);
296 "http2 hpack table account: %uz free:%uz",
297 size, h2c->hpack.free);
299 if (size <= h2c->hpack.free) {
300 h2c->hpack.free -= size;
306 h2c->hpack.free = h2c->hpack.size;
312 h2c->hpack.free += 32 + entry->name.len + entry->value.len;
313 } while (size > h2c->hpack.free);
315 h2c->hpack.free
[all...]
/tldk/lib/libtle_timer/
H A Dtimer.c74 struct tle_timer_list free; /** free timers to be used */ member in struct:tle_timer_wheel
188 LIST_INIT(&tw->free.head);
193 put_timer(&tw->free, e);
203 /** free the tle timer wheel */
226 if (tw->free.num == 0) {
251 e = get_timer(&tw->free);
263 e = get_timer(&tw->free);
281 put_timer(&tw->free, e);
361 put_timers(&tw->free,
[all...]
/tldk/app/nginx/src/http/modules/
H A Dngx_http_upstream_keepalive_module.c17 ngx_queue_t free; member in struct:__anon243
144 /* allocate cache items and add to free queue */
153 ngx_queue_init(&kcf->free);
156 ngx_queue_insert_head(&kcf->free, &cached[i].queue);
190 kp->original_free_peer = r->upstream->peer.free;
194 r->upstream->peer.free = ngx_http_upstream_free_keepalive_peer;
244 ngx_queue_insert_head(&kp->conf->free, q);
283 "free keepalive peer");
318 "free keepalive peer: saving connection %p", c);
320 if (ngx_queue_empty(&kp->conf->free)) {
[all...]
H A Dngx_http_chunked_filter_module.c14 ngx_chain_t *free; member in struct:__anon118
151 tl = ngx_chain_get_free_buf(r->pool, &ctx->free);
182 tl = ngx_chain_get_free_buf(r->pool, &ctx->free);
205 tl = ngx_chain_get_free_buf(r->pool, &ctx->free);
226 ngx_chain_update_chains(r->pool, &ctx->free, &ctx->busy, &out,
H A Dngx_http_ssi_filter_module.h56 ngx_chain_t *free; member in struct:__anon228
/tldk/app/nginx/src/event/
H A Dngx_event_connect.h47 ngx_event_free_peer_pt free; member in struct:ngx_peer_connection_s
H A Dngx_event_pipe.h36 ngx_chain_t *free; member in struct:ngx_event_pipe_s
/tldk/app/nginx/src/tldk/
H A Dtldk_sock.h79 struct tldk_sock_list free; member in struct:tldk_stbl

Completed in 14 milliseconds

123