Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 1 | /* |
| 2 | * Memory management functions. |
| 3 | * |
| 4 | * Copyright 2000-2007 Willy Tarreau <w@1wt.eu> |
| 5 | * |
| 6 | * This program is free software; you can redistribute it and/or |
| 7 | * modify it under the terms of the GNU General Public License |
| 8 | * as published by the Free Software Foundation; either version |
| 9 | * 2 of the License, or (at your option) any later version. |
| 10 | * |
| 11 | */ |
Willy Tarreau | 7107c8b | 2018-11-26 11:44:35 +0100 | [diff] [blame] | 12 | #include <errno.h> |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 13 | |
Willy Tarreau | 4c7e4b7 | 2020-05-27 12:58:42 +0200 | [diff] [blame] | 14 | #include <haproxy/api.h> |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 15 | #include <types/applet.h> |
| 16 | #include <types/cli.h> |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 17 | #include <types/global.h> |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 18 | #include <types/stats.h> |
| 19 | |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 20 | #include <common/cfgparse.h> |
Willy Tarreau | 3f567e4 | 2020-05-28 15:29:19 +0200 | [diff] [blame] | 21 | #include <haproxy/thread.h> |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 22 | #include <common/memory.h> |
Willy Tarreau | 853b297 | 2020-05-27 18:01:47 +0200 | [diff] [blame] | 23 | #include <haproxy/list.h> |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 24 | #include <common/standard.h> |
| 25 | |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 26 | #include <types/activity.h> |
| 27 | |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 28 | #include <proto/applet.h> |
| 29 | #include <proto/cli.h> |
| 30 | #include <proto/channel.h> |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 31 | #include <proto/log.h> |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 32 | #include <proto/stream_interface.h> |
| 33 | #include <proto/stats.h> |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 34 | |
Willy Tarreau | 0a93b64 | 2018-10-16 07:58:39 +0200 | [diff] [blame] | 35 | /* These are the most common pools, expected to be initialized first. These |
| 36 | * ones are allocated from an array, allowing to map them to an index. |
| 37 | */ |
| 38 | struct pool_head pool_base_start[MAX_BASE_POOLS] = { }; |
| 39 | unsigned int pool_base_count = 0; |
| 40 | |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 41 | /* These ones are initialized per-thread on startup by init_pools() */ |
| 42 | struct pool_cache_head pool_cache[MAX_THREADS][MAX_BASE_POOLS]; |
| 43 | static struct list pool_lru_head[MAX_THREADS]; /* oldest objects */ |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 44 | THREAD_LOCAL size_t pool_cache_bytes = 0; /* total cache size */ |
| 45 | THREAD_LOCAL size_t pool_cache_count = 0; /* #cache objects */ |
| 46 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 47 | static struct list pools = LIST_HEAD_INIT(pools); |
Willy Tarreau | 067ac9f | 2015-10-08 14:12:13 +0200 | [diff] [blame] | 48 | int mem_poison_byte = -1; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 49 | |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 50 | #ifdef DEBUG_FAIL_ALLOC |
| 51 | static int mem_fail_rate = 0; |
| 52 | static int mem_should_fail(const struct pool_head *); |
| 53 | #endif |
| 54 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 55 | /* Try to find an existing shared pool with the same characteristics and |
| 56 | * returns it, otherwise creates this one. NULL is returned if no memory |
Willy Tarreau | 581bf81 | 2016-01-25 02:19:13 +0100 | [diff] [blame] | 57 | * is available for a new creation. Two flags are supported : |
| 58 | * - MEM_F_SHARED to indicate that the pool may be shared with other users |
| 59 | * - MEM_F_EXACT to indicate that the size must not be rounded up |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 60 | */ |
| 61 | struct pool_head *create_pool(char *name, unsigned int size, unsigned int flags) |
| 62 | { |
| 63 | struct pool_head *pool; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 64 | struct pool_head *entry; |
| 65 | struct list *start; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 66 | unsigned int align; |
Christopher Faulet | 2f6d3c0 | 2019-06-25 21:45:59 +0200 | [diff] [blame] | 67 | int thr, idx; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 68 | |
Willy Tarreau | ac42111 | 2015-10-28 15:09:29 +0100 | [diff] [blame] | 69 | /* We need to store a (void *) at the end of the chunks. Since we know |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 70 | * that the malloc() function will never return such a small size, |
| 71 | * let's round the size up to something slightly bigger, in order to |
| 72 | * ease merging of entries. Note that the rounding is a power of two. |
Willy Tarreau | ac42111 | 2015-10-28 15:09:29 +0100 | [diff] [blame] | 73 | * This extra (void *) is not accounted for in the size computation |
| 74 | * so that the visible parts outside are not affected. |
Willy Tarreau | 30f931e | 2018-10-23 14:40:23 +0200 | [diff] [blame] | 75 | * |
| 76 | * Note: for the LRU cache, we need to store 2 doubly-linked lists. |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 77 | */ |
| 78 | |
Willy Tarreau | 581bf81 | 2016-01-25 02:19:13 +0100 | [diff] [blame] | 79 | if (!(flags & MEM_F_EXACT)) { |
Willy Tarreau | 30f931e | 2018-10-23 14:40:23 +0200 | [diff] [blame] | 80 | align = 4 * sizeof(void *); // 2 lists = 4 pointers min |
Willy Tarreau | 581bf81 | 2016-01-25 02:19:13 +0100 | [diff] [blame] | 81 | size = ((size + POOL_EXTRA + align - 1) & -align) - POOL_EXTRA; |
| 82 | } |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 83 | |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 84 | /* TODO: thread: we do not lock pool list for now because all pools are |
| 85 | * created during HAProxy startup (so before threads creation) */ |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 86 | start = &pools; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 87 | pool = NULL; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 88 | |
| 89 | list_for_each_entry(entry, &pools, list) { |
| 90 | if (entry->size == size) { |
| 91 | /* either we can share this place and we take it, or |
| 92 | * we look for a sharable one or for the next position |
| 93 | * before which we will insert a new one. |
| 94 | */ |
| 95 | if (flags & entry->flags & MEM_F_SHARED) { |
| 96 | /* we can share this one */ |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 97 | pool = entry; |
Krzysztof Piotr Oledzki | a643baf | 2008-05-29 23:53:44 +0200 | [diff] [blame] | 98 | DPRINTF(stderr, "Sharing %s with %s\n", name, pool->name); |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 99 | break; |
| 100 | } |
| 101 | } |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 102 | else if (entry->size > size) { |
| 103 | /* insert before this one */ |
| 104 | start = &entry->list; |
| 105 | break; |
| 106 | } |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 107 | } |
| 108 | |
| 109 | if (!pool) { |
Willy Tarreau | 0a93b64 | 2018-10-16 07:58:39 +0200 | [diff] [blame] | 110 | if (pool_base_count < MAX_BASE_POOLS) |
| 111 | pool = &pool_base_start[pool_base_count++]; |
| 112 | |
| 113 | if (!pool) { |
| 114 | /* look for a freed entry */ |
| 115 | for (entry = pool_base_start; entry != pool_base_start + MAX_BASE_POOLS; entry++) { |
| 116 | if (!entry->size) { |
| 117 | pool = entry; |
| 118 | break; |
| 119 | } |
| 120 | } |
| 121 | } |
| 122 | |
| 123 | if (!pool) |
| 124 | pool = calloc(1, sizeof(*pool)); |
| 125 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 126 | if (!pool) |
| 127 | return NULL; |
| 128 | if (name) |
| 129 | strlcpy2(pool->name, name, sizeof(pool->name)); |
| 130 | pool->size = size; |
| 131 | pool->flags = flags; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 132 | LIST_ADDQ(start, &pool->list); |
Christopher Faulet | 2f6d3c0 | 2019-06-25 21:45:59 +0200 | [diff] [blame] | 133 | |
| 134 | /* update per-thread pool cache if necessary */ |
| 135 | idx = pool_get_index(pool); |
| 136 | if (idx >= 0) { |
| 137 | for (thr = 0; thr < MAX_THREADS; thr++) |
| 138 | pool_cache[thr][idx].size = size; |
| 139 | } |
Olivier Houchard | 8af97eb | 2020-02-01 17:45:32 +0100 | [diff] [blame] | 140 | HA_SPIN_INIT(&pool->lock); |
Olivier Houchard | 8af97eb | 2020-02-01 17:45:32 +0100 | [diff] [blame] | 141 | } |
| 142 | pool->users++; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 143 | return pool; |
| 144 | } |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 145 | |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 146 | #ifdef CONFIG_HAP_LOCKLESS_POOLS |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 147 | /* Allocates new entries for pool <pool> until there are at least <avail> + 1 |
| 148 | * available, then returns the last one for immediate use, so that at least |
| 149 | * <avail> are left available in the pool upon return. NULL is returned if the |
| 150 | * last entry could not be allocated. It's important to note that at least one |
| 151 | * allocation is always performed even if there are enough entries in the pool. |
| 152 | * A call to the garbage collector is performed at most once in case malloc() |
| 153 | * returns an error, before returning NULL. |
| 154 | */ |
| 155 | void *__pool_refill_alloc(struct pool_head *pool, unsigned int avail) |
| 156 | { |
Olivier Houchard | 8b2c8a7 | 2018-10-21 01:52:59 +0200 | [diff] [blame] | 157 | void *ptr = NULL, **free_list; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 158 | int failed = 0; |
| 159 | int size = pool->size; |
| 160 | int limit = pool->limit; |
| 161 | int allocated = pool->allocated, allocated_orig = allocated; |
| 162 | |
| 163 | /* stop point */ |
| 164 | avail += pool->used; |
| 165 | |
| 166 | while (1) { |
| 167 | if (limit && allocated >= limit) { |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 168 | _HA_ATOMIC_ADD(&pool->allocated, allocated - allocated_orig); |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 169 | activity[tid].pool_fail++; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 170 | return NULL; |
| 171 | } |
| 172 | |
Willy Tarreau | a1e4f8c | 2020-05-08 08:31:56 +0200 | [diff] [blame] | 173 | pool_avg_bump(&pool->needed_avg, pool->allocated); |
| 174 | |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 175 | ptr = malloc(size + POOL_EXTRA); |
| 176 | if (!ptr) { |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 177 | _HA_ATOMIC_ADD(&pool->failed, 1); |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 178 | if (failed) { |
| 179 | activity[tid].pool_fail++; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 180 | return NULL; |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 181 | } |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 182 | failed++; |
| 183 | pool_gc(pool); |
| 184 | continue; |
| 185 | } |
| 186 | if (++allocated > avail) |
| 187 | break; |
| 188 | |
| 189 | free_list = pool->free_list; |
| 190 | do { |
| 191 | *POOL_LINK(pool, ptr) = free_list; |
| 192 | __ha_barrier_store(); |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 193 | } while (_HA_ATOMIC_CAS(&pool->free_list, &free_list, ptr) == 0); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 194 | } |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 195 | __ha_barrier_atomic_store(); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 196 | |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 197 | _HA_ATOMIC_ADD(&pool->allocated, allocated - allocated_orig); |
| 198 | _HA_ATOMIC_ADD(&pool->used, 1); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 199 | |
| 200 | #ifdef DEBUG_MEMORY_POOLS |
| 201 | /* keep track of where the element was allocated from */ |
| 202 | *POOL_LINK(pool, ptr) = (void *)pool; |
| 203 | #endif |
| 204 | return ptr; |
| 205 | } |
| 206 | void *pool_refill_alloc(struct pool_head *pool, unsigned int avail) |
| 207 | { |
| 208 | void *ptr; |
| 209 | |
| 210 | ptr = __pool_refill_alloc(pool, avail); |
| 211 | return ptr; |
| 212 | } |
| 213 | /* |
| 214 | * This function frees whatever can be freed in pool <pool>. |
| 215 | */ |
| 216 | void pool_flush(struct pool_head *pool) |
| 217 | { |
Olivier Houchard | b6fa08b | 2020-02-01 17:37:22 +0100 | [diff] [blame] | 218 | struct pool_free_list cmp, new; |
Olivier Houchard | 8b2c8a7 | 2018-10-21 01:52:59 +0200 | [diff] [blame] | 219 | void **next, *temp; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 220 | int removed = 0; |
| 221 | |
| 222 | if (!pool) |
| 223 | return; |
Willy Tarreau | 21072b9 | 2020-05-29 17:23:05 +0200 | [diff] [blame] | 224 | HA_SPIN_LOCK(POOL_LOCK, &pool->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 225 | do { |
Olivier Houchard | b6fa08b | 2020-02-01 17:37:22 +0100 | [diff] [blame] | 226 | cmp.free_list = pool->free_list; |
| 227 | cmp.seq = pool->seq; |
| 228 | new.free_list = NULL; |
| 229 | new.seq = cmp.seq + 1; |
| 230 | } while (!_HA_ATOMIC_DWCAS(&pool->free_list, &cmp, &new)); |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 231 | __ha_barrier_atomic_store(); |
Willy Tarreau | 21072b9 | 2020-05-29 17:23:05 +0200 | [diff] [blame] | 232 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
Olivier Houchard | b6fa08b | 2020-02-01 17:37:22 +0100 | [diff] [blame] | 233 | next = cmp.free_list; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 234 | while (next) { |
| 235 | temp = next; |
| 236 | next = *POOL_LINK(pool, temp); |
| 237 | removed++; |
| 238 | free(temp); |
| 239 | } |
| 240 | pool->free_list = next; |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 241 | _HA_ATOMIC_SUB(&pool->allocated, removed); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 242 | /* here, we should have pool->allocate == pool->used */ |
| 243 | } |
| 244 | |
| 245 | /* |
| 246 | * This function frees whatever can be freed in all pools, but respecting |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 247 | * the minimum thresholds imposed by owners. It makes sure to be alone to |
| 248 | * run by using thread_isolate(). <pool_ctx> is unused. |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 249 | */ |
| 250 | void pool_gc(struct pool_head *pool_ctx) |
| 251 | { |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 252 | struct pool_head *entry; |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 253 | int isolated = thread_isolated(); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 254 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 255 | if (!isolated) |
| 256 | thread_isolate(); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 257 | |
| 258 | list_for_each_entry(entry, &pools, list) { |
| 259 | while ((int)((volatile int)entry->allocated - (volatile int)entry->used) > (int)entry->minavail) { |
| 260 | struct pool_free_list cmp, new; |
| 261 | |
| 262 | cmp.seq = entry->seq; |
| 263 | __ha_barrier_load(); |
| 264 | cmp.free_list = entry->free_list; |
| 265 | __ha_barrier_load(); |
| 266 | if (cmp.free_list == NULL) |
| 267 | break; |
| 268 | new.free_list = *POOL_LINK(entry, cmp.free_list); |
| 269 | new.seq = cmp.seq + 1; |
Willy Tarreau | 6a38b32 | 2019-05-11 18:04:24 +0200 | [diff] [blame] | 270 | if (HA_ATOMIC_DWCAS(&entry->free_list, &cmp, &new) == 0) |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 271 | continue; |
| 272 | free(cmp.free_list); |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 273 | _HA_ATOMIC_SUB(&entry->allocated, 1); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 274 | } |
| 275 | } |
| 276 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 277 | if (!isolated) |
| 278 | thread_release(); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 279 | } |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 280 | |
| 281 | /* frees an object to the local cache, possibly pushing oldest objects to the |
| 282 | * global pool. Must not be called directly. |
| 283 | */ |
| 284 | void __pool_put_to_cache(struct pool_head *pool, void *ptr, ssize_t idx) |
| 285 | { |
| 286 | struct pool_cache_item *item = (struct pool_cache_item *)ptr; |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 287 | struct pool_cache_head *ph = &pool_cache[tid][idx]; |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 288 | |
| 289 | LIST_ADD(&ph->list, &item->by_pool); |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 290 | LIST_ADD(&pool_lru_head[tid], &item->by_lru); |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 291 | ph->count++; |
| 292 | pool_cache_count++; |
| 293 | pool_cache_bytes += ph->size; |
| 294 | |
| 295 | if (pool_cache_bytes <= CONFIG_HAP_POOL_CACHE_SIZE) |
| 296 | return; |
| 297 | |
| 298 | do { |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 299 | item = LIST_PREV(&pool_lru_head[tid], struct pool_cache_item *, by_lru); |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 300 | /* note: by definition we remove oldest objects so they also are the |
| 301 | * oldest in their own pools, thus their next is the pool's head. |
| 302 | */ |
| 303 | ph = LIST_NEXT(&item->by_pool, struct pool_cache_head *, list); |
| 304 | LIST_DEL(&item->by_pool); |
| 305 | LIST_DEL(&item->by_lru); |
| 306 | ph->count--; |
| 307 | pool_cache_count--; |
| 308 | pool_cache_bytes -= ph->size; |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 309 | __pool_free(pool_base_start + (ph - pool_cache[tid]), item); |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 310 | } while (pool_cache_bytes > CONFIG_HAP_POOL_CACHE_SIZE * 7 / 8); |
| 311 | } |
| 312 | |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 313 | #else /* CONFIG_HAP_LOCKLESS_POOLS */ |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 314 | |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 315 | /* Allocates new entries for pool <pool> until there are at least <avail> + 1 |
| 316 | * available, then returns the last one for immediate use, so that at least |
| 317 | * <avail> are left available in the pool upon return. NULL is returned if the |
| 318 | * last entry could not be allocated. It's important to note that at least one |
| 319 | * allocation is always performed even if there are enough entries in the pool. |
| 320 | * A call to the garbage collector is performed at most once in case malloc() |
| 321 | * returns an error, before returning NULL. |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 322 | */ |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 323 | void *__pool_refill_alloc(struct pool_head *pool, unsigned int avail) |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 324 | { |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 325 | void *ptr = NULL; |
| 326 | int failed = 0; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 327 | |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 328 | #ifdef DEBUG_FAIL_ALLOC |
| 329 | if (mem_should_fail(pool)) |
| 330 | return NULL; |
| 331 | #endif |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 332 | /* stop point */ |
| 333 | avail += pool->used; |
| 334 | |
| 335 | while (1) { |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 336 | if (pool->limit && pool->allocated >= pool->limit) { |
| 337 | activity[tid].pool_fail++; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 338 | return NULL; |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 339 | } |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 340 | |
Willy Tarreau | a1e4f8c | 2020-05-08 08:31:56 +0200 | [diff] [blame] | 341 | pool_avg_bump(&pool->needed_avg, pool->allocated); |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 342 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
Willy Tarreau | f13322e | 2017-11-22 10:50:54 +0100 | [diff] [blame] | 343 | ptr = pool_alloc_area(pool->size + POOL_EXTRA); |
Willy Tarreau | 8286754 | 2019-07-04 11:48:16 +0200 | [diff] [blame] | 344 | #ifdef DEBUG_MEMORY_POOLS |
| 345 | /* keep track of where the element was allocated from. This |
| 346 | * is done out of the lock so that the system really allocates |
| 347 | * the data without harming other threads waiting on the lock. |
| 348 | */ |
| 349 | if (ptr) |
| 350 | *POOL_LINK(pool, ptr) = (void *)pool; |
| 351 | #endif |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 352 | HA_SPIN_LOCK(POOL_LOCK, &pool->lock); |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 353 | if (!ptr) { |
Willy Tarreau | 58102cf | 2015-10-28 16:24:21 +0100 | [diff] [blame] | 354 | pool->failed++; |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 355 | if (failed) { |
| 356 | activity[tid].pool_fail++; |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 357 | return NULL; |
Willy Tarreau | a8b2ce0 | 2019-05-28 17:04:16 +0200 | [diff] [blame] | 358 | } |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 359 | failed++; |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 360 | pool_gc(pool); |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 361 | continue; |
| 362 | } |
| 363 | if (++pool->allocated > avail) |
| 364 | break; |
| 365 | |
Willy Tarreau | ac42111 | 2015-10-28 15:09:29 +0100 | [diff] [blame] | 366 | *POOL_LINK(pool, ptr) = (void *)pool->free_list; |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 367 | pool->free_list = ptr; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 368 | } |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 369 | pool->used++; |
Willy Tarreau | a885f6d | 2014-12-03 15:25:28 +0100 | [diff] [blame] | 370 | return ptr; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 371 | } |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 372 | void *pool_refill_alloc(struct pool_head *pool, unsigned int avail) |
| 373 | { |
| 374 | void *ptr; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 375 | |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 376 | HA_SPIN_LOCK(POOL_LOCK, &pool->lock); |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 377 | ptr = __pool_refill_alloc(pool, avail); |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 378 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 379 | return ptr; |
| 380 | } |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 381 | /* |
| 382 | * This function frees whatever can be freed in pool <pool>. |
| 383 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 384 | void pool_flush(struct pool_head *pool) |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 385 | { |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 386 | void *temp; |
| 387 | |
Willy Tarreau | 4d2d098 | 2007-05-14 00:39:29 +0200 | [diff] [blame] | 388 | if (!pool) |
| 389 | return; |
| 390 | |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 391 | while (1) { |
| 392 | HA_SPIN_LOCK(POOL_LOCK, &pool->lock); |
| 393 | temp = pool->free_list; |
| 394 | if (!temp) { |
| 395 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
| 396 | break; |
| 397 | } |
| 398 | pool->free_list = *POOL_LINK(pool, temp); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 399 | pool->allocated--; |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 400 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
Willy Tarreau | f13322e | 2017-11-22 10:50:54 +0100 | [diff] [blame] | 401 | pool_free_area(temp, pool->size + POOL_EXTRA); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 402 | } |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 403 | /* here, we should have pool->allocated == pool->used */ |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 404 | } |
| 405 | |
| 406 | /* |
| 407 | * This function frees whatever can be freed in all pools, but respecting |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 408 | * the minimum thresholds imposed by owners. It makes sure to be alone to |
| 409 | * run by using thread_isolate(). <pool_ctx> is unused. |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 410 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 411 | void pool_gc(struct pool_head *pool_ctx) |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 412 | { |
| 413 | struct pool_head *entry; |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 414 | int isolated = thread_isolated(); |
Willy Tarreau | b7f9d12 | 2009-04-21 02:17:45 +0200 | [diff] [blame] | 415 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 416 | if (!isolated) |
| 417 | thread_isolate(); |
Willy Tarreau | b7f9d12 | 2009-04-21 02:17:45 +0200 | [diff] [blame] | 418 | |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 419 | list_for_each_entry(entry, &pools, list) { |
Olivier Houchard | 51d9339 | 2020-03-12 19:05:39 +0100 | [diff] [blame] | 420 | void *temp; |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 421 | //qfprintf(stderr, "Flushing pool %s\n", entry->name); |
Olivier Houchard | 51d9339 | 2020-03-12 19:05:39 +0100 | [diff] [blame] | 422 | while (entry->free_list && |
Willy Tarreau | 57767b8 | 2014-12-22 21:40:55 +0100 | [diff] [blame] | 423 | (int)(entry->allocated - entry->used) > (int)entry->minavail) { |
Olivier Houchard | 51d9339 | 2020-03-12 19:05:39 +0100 | [diff] [blame] | 424 | temp = entry->free_list; |
| 425 | entry->free_list = *POOL_LINK(entry, temp); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 426 | entry->allocated--; |
Willy Tarreau | f13322e | 2017-11-22 10:50:54 +0100 | [diff] [blame] | 427 | pool_free_area(temp, entry->size + POOL_EXTRA); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 428 | } |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 429 | } |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 430 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 431 | if (!isolated) |
| 432 | thread_release(); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 433 | } |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 434 | #endif |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 435 | |
| 436 | /* |
Willy Tarreau | dae4aa8 | 2007-06-16 23:19:53 +0200 | [diff] [blame] | 437 | * This function destroys a pool by freeing it completely, unless it's still |
| 438 | * in use. This should be called only under extreme circumstances. It always |
| 439 | * returns NULL if the resulting pool is empty, easing the clearing of the old |
| 440 | * pointer, otherwise it returns the pool. |
| 441 | * . |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 442 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 443 | void *pool_destroy(struct pool_head *pool) |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 444 | { |
Willy Tarreau | 4d2d098 | 2007-05-14 00:39:29 +0200 | [diff] [blame] | 445 | if (pool) { |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 446 | pool_flush(pool); |
Willy Tarreau | dae4aa8 | 2007-06-16 23:19:53 +0200 | [diff] [blame] | 447 | if (pool->used) |
| 448 | return pool; |
| 449 | pool->users--; |
| 450 | if (!pool->users) { |
| 451 | LIST_DEL(&pool->list); |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 452 | #ifndef CONFIG_HAP_LOCKLESS_POOLS |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 453 | HA_SPIN_DESTROY(&pool->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 454 | #endif |
Willy Tarreau | 0a93b64 | 2018-10-16 07:58:39 +0200 | [diff] [blame] | 455 | if ((pool - pool_base_start) < MAX_BASE_POOLS) |
| 456 | memset(pool, 0, sizeof(*pool)); |
| 457 | else |
| 458 | free(pool); |
Willy Tarreau | dae4aa8 | 2007-06-16 23:19:53 +0200 | [diff] [blame] | 459 | } |
Willy Tarreau | 4d2d098 | 2007-05-14 00:39:29 +0200 | [diff] [blame] | 460 | } |
| 461 | return NULL; |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 462 | } |
| 463 | |
Willy Tarreau | 2455ceb | 2018-11-26 15:57:34 +0100 | [diff] [blame] | 464 | /* This destroys all pools on exit. It is *not* thread safe. */ |
| 465 | void pool_destroy_all() |
| 466 | { |
| 467 | struct pool_head *entry, *back; |
| 468 | |
| 469 | list_for_each_entry_safe(entry, back, &pools, list) |
| 470 | pool_destroy(entry); |
| 471 | } |
| 472 | |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 473 | /* This function dumps memory usage information into the trash buffer. */ |
| 474 | void dump_pools_to_trash() |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 475 | { |
| 476 | struct pool_head *entry; |
| 477 | unsigned long allocated, used; |
| 478 | int nbpools; |
| 479 | |
| 480 | allocated = used = nbpools = 0; |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 481 | chunk_printf(&trash, "Dumping pools usage. Use SIGQUIT to flush them.\n"); |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 482 | list_for_each_entry(entry, &pools, list) { |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 483 | #ifndef CONFIG_HAP_LOCKLESS_POOLS |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 484 | HA_SPIN_LOCK(POOL_LOCK, &entry->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 485 | #endif |
Willy Tarreau | a1e4f8c | 2020-05-08 08:31:56 +0200 | [diff] [blame] | 486 | chunk_appendf(&trash, " - Pool %s (%u bytes) : %u allocated (%u bytes), %u used, needed_avg %u, %u failures, %u users, @%p=%02d%s\n", |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 487 | entry->name, entry->size, entry->allocated, |
Willy Tarreau | a1e4f8c | 2020-05-08 08:31:56 +0200 | [diff] [blame] | 488 | entry->size * entry->allocated, entry->used, |
| 489 | pool_avg(entry->needed_avg), entry->failed, |
Willy Tarreau | 0a93b64 | 2018-10-16 07:58:39 +0200 | [diff] [blame] | 490 | entry->users, entry, (int)pool_get_index(entry), |
| 491 | (entry->flags & MEM_F_SHARED) ? " [SHARED]" : ""); |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 492 | |
| 493 | allocated += entry->allocated * entry->size; |
| 494 | used += entry->used * entry->size; |
| 495 | nbpools++; |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 496 | #ifndef CONFIG_HAP_LOCKLESS_POOLS |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 497 | HA_SPIN_UNLOCK(POOL_LOCK, &entry->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 498 | #endif |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 499 | } |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 500 | chunk_appendf(&trash, "Total: %d pools, %lu bytes allocated, %lu used.\n", |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 501 | nbpools, allocated, used); |
| 502 | } |
| 503 | |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 504 | /* Dump statistics on pools usage. */ |
| 505 | void dump_pools(void) |
| 506 | { |
| 507 | dump_pools_to_trash(); |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 508 | qfprintf(stderr, "%s", trash.area); |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 509 | } |
| 510 | |
Willy Tarreau | 58102cf | 2015-10-28 16:24:21 +0100 | [diff] [blame] | 511 | /* This function returns the total number of failed pool allocations */ |
| 512 | int pool_total_failures() |
| 513 | { |
| 514 | struct pool_head *entry; |
| 515 | int failed = 0; |
| 516 | |
| 517 | list_for_each_entry(entry, &pools, list) |
| 518 | failed += entry->failed; |
| 519 | return failed; |
| 520 | } |
| 521 | |
| 522 | /* This function returns the total amount of memory allocated in pools (in bytes) */ |
| 523 | unsigned long pool_total_allocated() |
| 524 | { |
| 525 | struct pool_head *entry; |
| 526 | unsigned long allocated = 0; |
| 527 | |
| 528 | list_for_each_entry(entry, &pools, list) |
| 529 | allocated += entry->allocated * entry->size; |
| 530 | return allocated; |
| 531 | } |
| 532 | |
| 533 | /* This function returns the total amount of memory used in pools (in bytes) */ |
| 534 | unsigned long pool_total_used() |
| 535 | { |
| 536 | struct pool_head *entry; |
| 537 | unsigned long used = 0; |
| 538 | |
| 539 | list_for_each_entry(entry, &pools, list) |
| 540 | used += entry->used * entry->size; |
| 541 | return used; |
| 542 | } |
| 543 | |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 544 | /* This function dumps memory usage information onto the stream interface's |
| 545 | * read buffer. It returns 0 as long as it does not complete, non-zero upon |
| 546 | * completion. No state is used. |
| 547 | */ |
| 548 | static int cli_io_handler_dump_pools(struct appctx *appctx) |
| 549 | { |
| 550 | struct stream_interface *si = appctx->owner; |
| 551 | |
| 552 | dump_pools_to_trash(); |
Willy Tarreau | 06d80a9 | 2017-10-19 14:32:15 +0200 | [diff] [blame] | 553 | if (ci_putchk(si_ic(si), &trash) == -1) { |
Willy Tarreau | db39843 | 2018-11-15 11:08:52 +0100 | [diff] [blame] | 554 | si_rx_room_blk(si); |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 555 | return 0; |
| 556 | } |
| 557 | return 1; |
| 558 | } |
| 559 | |
Willy Tarreau | 7107c8b | 2018-11-26 11:44:35 +0100 | [diff] [blame] | 560 | /* callback used to create early pool <name> of size <size> and store the |
| 561 | * resulting pointer into <ptr>. If the allocation fails, it quits with after |
| 562 | * emitting an error message. |
| 563 | */ |
| 564 | void create_pool_callback(struct pool_head **ptr, char *name, unsigned int size) |
| 565 | { |
| 566 | *ptr = create_pool(name, size, MEM_F_SHARED); |
| 567 | if (!*ptr) { |
| 568 | ha_alert("Failed to allocate pool '%s' of size %u : %s. Aborting.\n", |
| 569 | name, size, strerror(errno)); |
| 570 | exit(1); |
| 571 | } |
| 572 | } |
| 573 | |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 574 | /* Initializes all per-thread arrays on startup */ |
| 575 | static void init_pools() |
| 576 | { |
| 577 | int thr, idx; |
| 578 | |
| 579 | for (thr = 0; thr < MAX_THREADS; thr++) { |
| 580 | for (idx = 0; idx < MAX_BASE_POOLS; idx++) { |
| 581 | LIST_INIT(&pool_cache[thr][idx].list); |
| 582 | pool_cache[thr][idx].size = 0; |
| 583 | } |
| 584 | LIST_INIT(&pool_lru_head[thr]); |
| 585 | } |
| 586 | } |
| 587 | |
| 588 | INITCALL0(STG_PREPARE, init_pools); |
Willy Tarreau | 7107c8b | 2018-11-26 11:44:35 +0100 | [diff] [blame] | 589 | |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 590 | /* register cli keywords */ |
| 591 | static struct cli_kw_list cli_kws = {{ },{ |
Willy Tarreau | e9ecec8 | 2016-12-16 18:55:23 +0100 | [diff] [blame] | 592 | { { "show", "pools", NULL }, "show pools : report information about the memory pools usage", NULL, cli_io_handler_dump_pools }, |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 593 | {{},} |
| 594 | }}; |
| 595 | |
Willy Tarreau | 0108d90 | 2018-11-25 19:14:37 +0100 | [diff] [blame] | 596 | INITCALL1(STG_REGISTER, cli_register_kw, &cli_kws); |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 597 | |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 598 | #ifdef DEBUG_FAIL_ALLOC |
| 599 | #define MEM_FAIL_MAX_CHAR 32 |
| 600 | #define MEM_FAIL_MAX_STR 128 |
| 601 | static int mem_fail_cur_idx; |
| 602 | static char mem_fail_str[MEM_FAIL_MAX_CHAR * MEM_FAIL_MAX_STR]; |
Willy Tarreau | af613e8 | 2020-06-05 08:40:51 +0200 | [diff] [blame] | 603 | __decl_thread(static HA_SPINLOCK_T mem_fail_lock); |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 604 | |
| 605 | int mem_should_fail(const struct pool_head *pool) |
| 606 | { |
Olivier Houchard | 9c4f08a | 2019-02-01 16:28:04 +0100 | [diff] [blame] | 607 | int ret = 0; |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 608 | int n; |
| 609 | |
| 610 | if (mem_fail_rate > 0 && !(global.mode & MODE_STARTING)) { |
Willy Tarreau | 52bf839 | 2020-03-08 00:42:37 +0100 | [diff] [blame] | 611 | int randnb = ha_random() % 100; |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 612 | |
| 613 | if (mem_fail_rate > randnb) |
| 614 | ret = 1; |
| 615 | else |
| 616 | ret = 0; |
| 617 | } |
Olivier Houchard | 04f5fe8 | 2020-02-01 17:49:31 +0100 | [diff] [blame] | 618 | HA_SPIN_LOCK(POOL_LOCK, &mem_fail_lock); |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 619 | n = snprintf(&mem_fail_str[mem_fail_cur_idx * MEM_FAIL_MAX_CHAR], |
| 620 | MEM_FAIL_MAX_CHAR - 2, |
| 621 | "%d %.18s %d %d", mem_fail_cur_idx, pool->name, ret, tid); |
| 622 | while (n < MEM_FAIL_MAX_CHAR - 1) |
| 623 | mem_fail_str[mem_fail_cur_idx * MEM_FAIL_MAX_CHAR + n++] = ' '; |
| 624 | if (mem_fail_cur_idx < MEM_FAIL_MAX_STR - 1) |
| 625 | mem_fail_str[mem_fail_cur_idx * MEM_FAIL_MAX_CHAR + n] = '\n'; |
| 626 | else |
| 627 | mem_fail_str[mem_fail_cur_idx * MEM_FAIL_MAX_CHAR + n] = 0; |
| 628 | mem_fail_cur_idx++; |
| 629 | if (mem_fail_cur_idx == MEM_FAIL_MAX_STR) |
| 630 | mem_fail_cur_idx = 0; |
Olivier Houchard | 04f5fe8 | 2020-02-01 17:49:31 +0100 | [diff] [blame] | 631 | HA_SPIN_UNLOCK(POOL_LOCK, &mem_fail_lock); |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 632 | return ret; |
| 633 | |
| 634 | } |
| 635 | |
| 636 | /* config parser for global "tune.fail-alloc" */ |
| 637 | static int mem_parse_global_fail_alloc(char **args, int section_type, struct proxy *curpx, |
| 638 | struct proxy *defpx, const char *file, int line, |
| 639 | char **err) |
| 640 | { |
| 641 | if (too_many_args(1, args, err, NULL)) |
| 642 | return -1; |
| 643 | mem_fail_rate = atoi(args[1]); |
| 644 | if (mem_fail_rate < 0 || mem_fail_rate > 100) { |
| 645 | memprintf(err, "'%s' expects a numeric value between 0 and 100.", args[0]); |
| 646 | return -1; |
| 647 | } |
| 648 | return 0; |
| 649 | } |
| 650 | #endif |
| 651 | |
| 652 | /* register global config keywords */ |
| 653 | static struct cfg_kw_list mem_cfg_kws = {ILH, { |
| 654 | #ifdef DEBUG_FAIL_ALLOC |
| 655 | { CFG_GLOBAL, "tune.fail-alloc", mem_parse_global_fail_alloc }, |
| 656 | #endif |
| 657 | { 0, NULL, NULL } |
| 658 | }}; |
| 659 | |
| 660 | INITCALL1(STG_REGISTER, cfg_register_keywords, &mem_cfg_kws); |
| 661 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 662 | /* |
| 663 | * Local variables: |
| 664 | * c-indent-level: 8 |
| 665 | * c-basic-offset: 8 |
| 666 | * End: |
| 667 | */ |