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