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 | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 14 | #include <haproxy/activity-t.h> |
Willy Tarreau | 4c7e4b7 | 2020-05-27 12:58:42 +0200 | [diff] [blame] | 15 | #include <haproxy/api.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 16 | #include <haproxy/applet-t.h> |
Willy Tarreau | 6be7849 | 2020-06-05 00:00:29 +0200 | [diff] [blame] | 17 | #include <haproxy/cfgparse.h> |
Willy Tarreau | f1d32c4 | 2020-06-04 21:07:02 +0200 | [diff] [blame] | 18 | #include <haproxy/channel.h> |
Willy Tarreau | 83487a8 | 2020-06-04 20:19:54 +0200 | [diff] [blame] | 19 | #include <haproxy/cli.h> |
Willy Tarreau | 36979d9 | 2020-06-05 17:27:29 +0200 | [diff] [blame] | 20 | #include <haproxy/errors.h> |
Willy Tarreau | f268ee8 | 2020-06-04 17:05:57 +0200 | [diff] [blame] | 21 | #include <haproxy/global.h> |
Willy Tarreau | 853b297 | 2020-05-27 18:01:47 +0200 | [diff] [blame] | 22 | #include <haproxy/list.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 23 | #include <haproxy/pool.h> |
Willy Tarreau | 2eec9b5 | 2020-06-04 19:58:55 +0200 | [diff] [blame] | 24 | #include <haproxy/stats-t.h> |
Willy Tarreau | 5e539c9 | 2020-06-04 20:45:39 +0200 | [diff] [blame] | 25 | #include <haproxy/stream_interface.h> |
Willy Tarreau | b255105 | 2020-06-09 09:07:15 +0200 | [diff] [blame] | 26 | #include <haproxy/thread.h> |
Willy Tarreau | 48fbcae | 2020-06-03 18:09:46 +0200 | [diff] [blame] | 27 | #include <haproxy/tools.h> |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 28 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 29 | |
Willy Tarreau | 2d6f628 | 2021-04-15 16:24:00 +0200 | [diff] [blame] | 30 | #ifdef CONFIG_HAP_POOLS |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 31 | /* These ones are initialized per-thread on startup by init_pools() */ |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 32 | THREAD_LOCAL size_t pool_cache_bytes = 0; /* total cache size */ |
| 33 | THREAD_LOCAL size_t pool_cache_count = 0; /* #cache objects */ |
Willy Tarreau | ed891fd | 2020-06-01 19:00:28 +0200 | [diff] [blame] | 34 | #endif |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 35 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 36 | static struct list pools = LIST_HEAD_INIT(pools); |
Willy Tarreau | 067ac9f | 2015-10-08 14:12:13 +0200 | [diff] [blame] | 37 | int mem_poison_byte = -1; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 38 | |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 39 | #ifdef DEBUG_FAIL_ALLOC |
| 40 | static int mem_fail_rate = 0; |
| 41 | static int mem_should_fail(const struct pool_head *); |
| 42 | #endif |
| 43 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 44 | /* Try to find an existing shared pool with the same characteristics and |
| 45 | * returns it, otherwise creates this one. NULL is returned if no memory |
Willy Tarreau | 581bf81 | 2016-01-25 02:19:13 +0100 | [diff] [blame] | 46 | * is available for a new creation. Two flags are supported : |
| 47 | * - MEM_F_SHARED to indicate that the pool may be shared with other users |
| 48 | * - 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] | 49 | */ |
| 50 | struct pool_head *create_pool(char *name, unsigned int size, unsigned int flags) |
| 51 | { |
| 52 | struct pool_head *pool; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 53 | struct pool_head *entry; |
| 54 | struct list *start; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 55 | unsigned int align; |
Willy Tarreau | 9f3129e | 2021-04-17 00:31:38 +0200 | [diff] [blame] | 56 | int thr __maybe_unused; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 57 | |
Willy Tarreau | ac42111 | 2015-10-28 15:09:29 +0100 | [diff] [blame] | 58 | /* 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] | 59 | * that the malloc() function will never return such a small size, |
| 60 | * let's round the size up to something slightly bigger, in order to |
| 61 | * 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] | 62 | * This extra (void *) is not accounted for in the size computation |
| 63 | * so that the visible parts outside are not affected. |
Willy Tarreau | 30f931e | 2018-10-23 14:40:23 +0200 | [diff] [blame] | 64 | * |
| 65 | * 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] | 66 | */ |
| 67 | |
Willy Tarreau | 581bf81 | 2016-01-25 02:19:13 +0100 | [diff] [blame] | 68 | if (!(flags & MEM_F_EXACT)) { |
Willy Tarreau | 30f931e | 2018-10-23 14:40:23 +0200 | [diff] [blame] | 69 | align = 4 * sizeof(void *); // 2 lists = 4 pointers min |
Willy Tarreau | 581bf81 | 2016-01-25 02:19:13 +0100 | [diff] [blame] | 70 | size = ((size + POOL_EXTRA + align - 1) & -align) - POOL_EXTRA; |
| 71 | } |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 72 | |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 73 | /* TODO: thread: we do not lock pool list for now because all pools are |
| 74 | * created during HAProxy startup (so before threads creation) */ |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 75 | start = &pools; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 76 | pool = NULL; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 77 | |
| 78 | list_for_each_entry(entry, &pools, list) { |
| 79 | if (entry->size == size) { |
| 80 | /* either we can share this place and we take it, or |
Ilya Shipitsin | 47d1718 | 2020-06-21 21:42:57 +0500 | [diff] [blame] | 81 | * we look for a shareable one or for the next position |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 82 | * before which we will insert a new one. |
| 83 | */ |
| 84 | if (flags & entry->flags & MEM_F_SHARED) { |
| 85 | /* we can share this one */ |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 86 | pool = entry; |
Krzysztof Piotr Oledzki | a643baf | 2008-05-29 23:53:44 +0200 | [diff] [blame] | 87 | DPRINTF(stderr, "Sharing %s with %s\n", name, pool->name); |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 88 | break; |
| 89 | } |
| 90 | } |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 91 | else if (entry->size > size) { |
| 92 | /* insert before this one */ |
| 93 | start = &entry->list; |
| 94 | break; |
| 95 | } |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 96 | } |
| 97 | |
| 98 | if (!pool) { |
Willy Tarreau | 0a93b64 | 2018-10-16 07:58:39 +0200 | [diff] [blame] | 99 | if (!pool) |
| 100 | pool = calloc(1, sizeof(*pool)); |
| 101 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 102 | if (!pool) |
| 103 | return NULL; |
| 104 | if (name) |
| 105 | strlcpy2(pool->name, name, sizeof(pool->name)); |
| 106 | pool->size = size; |
| 107 | pool->flags = flags; |
Willy Tarreau | 7dcd46d | 2007-05-14 00:16:13 +0200 | [diff] [blame] | 108 | LIST_ADDQ(start, &pool->list); |
Christopher Faulet | 2f6d3c0 | 2019-06-25 21:45:59 +0200 | [diff] [blame] | 109 | |
Willy Tarreau | 2d6f628 | 2021-04-15 16:24:00 +0200 | [diff] [blame] | 110 | #ifdef CONFIG_HAP_POOLS |
Christopher Faulet | 2f6d3c0 | 2019-06-25 21:45:59 +0200 | [diff] [blame] | 111 | /* update per-thread pool cache if necessary */ |
Willy Tarreau | 9f3129e | 2021-04-17 00:31:38 +0200 | [diff] [blame] | 112 | for (thr = 0; thr < MAX_THREADS; thr++) { |
| 113 | LIST_INIT(&pool->cache[thr].list); |
Christopher Faulet | 2f6d3c0 | 2019-06-25 21:45:59 +0200 | [diff] [blame] | 114 | } |
Willy Tarreau | ed891fd | 2020-06-01 19:00:28 +0200 | [diff] [blame] | 115 | #endif |
Olivier Houchard | 8af97eb | 2020-02-01 17:45:32 +0100 | [diff] [blame] | 116 | HA_SPIN_INIT(&pool->lock); |
Olivier Houchard | 8af97eb | 2020-02-01 17:45:32 +0100 | [diff] [blame] | 117 | } |
| 118 | pool->users++; |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 119 | return pool; |
| 120 | } |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 121 | |
Willy Tarreau | 1384364 | 2021-04-17 16:57:25 +0200 | [diff] [blame] | 122 | /* Tries to allocate an object for the pool <pool> using the system's allocator |
| 123 | * and directly returns it. The pool's allocated counter is checked and updated, |
| 124 | * but no other checks are performed. The pool's lock is not used and is not a |
| 125 | * problem either. |
| 126 | */ |
| 127 | void *pool_get_from_os(struct pool_head *pool) |
| 128 | { |
| 129 | if (!pool->limit || pool->allocated < pool->limit) { |
| 130 | void *ptr = pool_alloc_area(pool->size + POOL_EXTRA); |
| 131 | if (ptr) { |
| 132 | _HA_ATOMIC_INC(&pool->allocated); |
| 133 | return ptr; |
| 134 | } |
| 135 | _HA_ATOMIC_INC(&pool->failed); |
| 136 | } |
| 137 | activity[tid].pool_fail++; |
| 138 | return NULL; |
| 139 | |
| 140 | } |
| 141 | |
Willy Tarreau | 45e4e28 | 2021-04-17 17:48:40 +0200 | [diff] [blame] | 142 | /* Releases a pool item back to the operating system and atomically updates |
| 143 | * the allocation counter. |
| 144 | */ |
| 145 | void pool_put_to_os(struct pool_head *pool, void *ptr) |
| 146 | { |
| 147 | pool_free_area(ptr, pool->size + POOL_EXTRA); |
| 148 | _HA_ATOMIC_DEC(&pool->allocated); |
| 149 | } |
| 150 | |
Willy Tarreau | 8fe726f | 2021-04-15 18:20:12 +0200 | [diff] [blame] | 151 | /* Tries to allocate an object for the pool <pool> using the system's allocator |
| 152 | * and directly returns it. The pool's counters are updated but the object is |
| 153 | * never cached, so this is usable with and without local or shared caches. |
| 154 | * This may be called with or without the pool lock held, so it must not use |
| 155 | * the pool's lock. |
| 156 | */ |
| 157 | void *pool_alloc_nocache(struct pool_head *pool) |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 158 | { |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 159 | void *ptr = NULL; |
| 160 | |
Willy Tarreau | 1384364 | 2021-04-17 16:57:25 +0200 | [diff] [blame] | 161 | ptr = pool_get_from_os(pool); |
| 162 | if (!ptr) |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 163 | return NULL; |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 164 | |
Willy Tarreau | 1384364 | 2021-04-17 16:57:25 +0200 | [diff] [blame] | 165 | swrate_add_scaled(&pool->needed_avg, POOL_AVG_SAMPLES, pool->used, POOL_AVG_SAMPLES/4); |
Willy Tarreau | 4781b15 | 2021-04-06 13:53:36 +0200 | [diff] [blame] | 166 | _HA_ATOMIC_INC(&pool->used); |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 167 | |
| 168 | #ifdef DEBUG_MEMORY_POOLS |
| 169 | /* keep track of where the element was allocated from */ |
| 170 | *POOL_LINK(pool, ptr) = (void *)pool; |
| 171 | #endif |
| 172 | return ptr; |
| 173 | } |
| 174 | |
Willy Tarreau | 45e4e28 | 2021-04-17 17:48:40 +0200 | [diff] [blame] | 175 | /* Release a pool item back to the OS and keeps the pool's counters up to date. |
| 176 | * This is always defined even when pools are not enabled (their usage stats |
| 177 | * are maintained). |
| 178 | */ |
| 179 | void pool_free_nocache(struct pool_head *pool, void *ptr) |
| 180 | { |
| 181 | _HA_ATOMIC_DEC(&pool->used); |
| 182 | swrate_add(&pool->needed_avg, POOL_AVG_SAMPLES, pool->used); |
| 183 | pool_put_to_os(pool, ptr); |
| 184 | } |
| 185 | |
Willy Tarreau | b8498e9 | 2021-04-18 10:23:02 +0200 | [diff] [blame] | 186 | |
| 187 | #ifdef CONFIG_HAP_POOLS |
| 188 | |
Willy Tarreau | 8721203 | 2021-04-19 08:14:03 +0200 | [diff] [blame] | 189 | /* Evicts some of the oldest objects from one local cache, until its number of |
| 190 | * objects is no more than 16+1/8 of the total number of locally cached objects |
| 191 | * or the total size of the local cache is no more than 75% of its maximum (i.e. |
| 192 | * we don't want a single cache to use all the cache for itself). For this, the |
| 193 | * list is scanned in reverse. |
| 194 | */ |
| 195 | void pool_evict_from_local_cache(struct pool_head *pool) |
| 196 | { |
| 197 | struct pool_cache_head *ph = &pool->cache[tid]; |
| 198 | struct pool_cache_item *item; |
Willy Tarreau | 8721203 | 2021-04-19 08:14:03 +0200 | [diff] [blame] | 199 | |
| 200 | while (ph->count >= 16 + pool_cache_count / 8 && |
| 201 | pool_cache_bytes > CONFIG_HAP_POOL_CACHE_SIZE * 3 / 4) { |
| 202 | item = LIST_NEXT(&ph->list, typeof(item), by_pool); |
| 203 | ph->count--; |
| 204 | pool_cache_bytes -= pool->size; |
| 205 | pool_cache_count--; |
| 206 | LIST_DEL(&item->by_pool); |
| 207 | LIST_DEL(&item->by_lru); |
| 208 | pool_put_to_shared_cache(pool, item); |
| 209 | } |
| 210 | } |
| 211 | |
Willy Tarreau | b8498e9 | 2021-04-18 10:23:02 +0200 | [diff] [blame] | 212 | /* Evicts some of the oldest objects from the local cache, pushing them to the |
| 213 | * global pool. |
| 214 | */ |
| 215 | void pool_evict_from_local_caches() |
| 216 | { |
| 217 | struct pool_cache_item *item; |
| 218 | struct pool_cache_head *ph; |
| 219 | struct pool_head *pool; |
| 220 | |
| 221 | do { |
| 222 | item = LIST_PREV(&ti->pool_lru_head, struct pool_cache_item *, by_lru); |
| 223 | /* note: by definition we remove oldest objects so they also are the |
| 224 | * oldest in their own pools, thus their next is the pool's head. |
| 225 | */ |
| 226 | ph = LIST_NEXT(&item->by_pool, struct pool_cache_head *, list); |
| 227 | pool = container_of(ph - tid, struct pool_head, cache); |
| 228 | LIST_DEL(&item->by_pool); |
| 229 | LIST_DEL(&item->by_lru); |
| 230 | ph->count--; |
| 231 | pool_cache_count--; |
| 232 | pool_cache_bytes -= pool->size; |
| 233 | pool_put_to_shared_cache(pool, item); |
| 234 | } while (pool_cache_bytes > CONFIG_HAP_POOL_CACHE_SIZE * 7 / 8); |
| 235 | } |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 236 | |
Willy Tarreau | eb3cc29 | 2021-04-15 18:13:13 +0200 | [diff] [blame] | 237 | #if defined(CONFIG_HAP_NO_GLOBAL_POOLS) |
| 238 | |
Willy Tarreau | 0bae075 | 2021-03-02 20:05:09 +0100 | [diff] [blame] | 239 | /* legacy stuff */ |
| 240 | void pool_flush(struct pool_head *pool) |
| 241 | { |
| 242 | } |
| 243 | |
| 244 | /* This function might ask the malloc library to trim its buffers. */ |
| 245 | void pool_gc(struct pool_head *pool_ctx) |
| 246 | { |
| 247 | #if defined(HA_HAVE_MALLOC_TRIM) |
| 248 | malloc_trim(0); |
| 249 | #endif |
| 250 | } |
| 251 | |
| 252 | #elif defined(CONFIG_HAP_LOCKLESS_POOLS) |
| 253 | |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 254 | /* |
| 255 | * This function frees whatever can be freed in pool <pool>. |
| 256 | */ |
| 257 | void pool_flush(struct pool_head *pool) |
| 258 | { |
Olivier Houchard | b6fa08b | 2020-02-01 17:37:22 +0100 | [diff] [blame] | 259 | struct pool_free_list cmp, new; |
Olivier Houchard | 8b2c8a7 | 2018-10-21 01:52:59 +0200 | [diff] [blame] | 260 | void **next, *temp; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 261 | |
| 262 | if (!pool) |
| 263 | return; |
Willy Tarreau | 21072b9 | 2020-05-29 17:23:05 +0200 | [diff] [blame] | 264 | HA_SPIN_LOCK(POOL_LOCK, &pool->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 265 | do { |
Olivier Houchard | b6fa08b | 2020-02-01 17:37:22 +0100 | [diff] [blame] | 266 | cmp.free_list = pool->free_list; |
| 267 | cmp.seq = pool->seq; |
| 268 | new.free_list = NULL; |
| 269 | new.seq = cmp.seq + 1; |
| 270 | } while (!_HA_ATOMIC_DWCAS(&pool->free_list, &cmp, &new)); |
Olivier Houchard | 2087276 | 2019-03-08 18:53:35 +0100 | [diff] [blame] | 271 | __ha_barrier_atomic_store(); |
Willy Tarreau | 21072b9 | 2020-05-29 17:23:05 +0200 | [diff] [blame] | 272 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
Olivier Houchard | b6fa08b | 2020-02-01 17:37:22 +0100 | [diff] [blame] | 273 | next = cmp.free_list; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 274 | while (next) { |
| 275 | temp = next; |
| 276 | next = *POOL_LINK(pool, temp); |
Willy Tarreau | 45e4e28 | 2021-04-17 17:48:40 +0200 | [diff] [blame] | 277 | pool_put_to_os(pool, temp); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 278 | } |
| 279 | pool->free_list = next; |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 280 | /* here, we should have pool->allocate == pool->used */ |
| 281 | } |
| 282 | |
| 283 | /* |
| 284 | * This function frees whatever can be freed in all pools, but respecting |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 285 | * the minimum thresholds imposed by owners. It makes sure to be alone to |
| 286 | * run by using thread_isolate(). <pool_ctx> is unused. |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 287 | */ |
| 288 | void pool_gc(struct pool_head *pool_ctx) |
| 289 | { |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 290 | struct pool_head *entry; |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 291 | int isolated = thread_isolated(); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 292 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 293 | if (!isolated) |
| 294 | thread_isolate(); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 295 | |
| 296 | list_for_each_entry(entry, &pools, list) { |
| 297 | while ((int)((volatile int)entry->allocated - (volatile int)entry->used) > (int)entry->minavail) { |
| 298 | struct pool_free_list cmp, new; |
| 299 | |
| 300 | cmp.seq = entry->seq; |
| 301 | __ha_barrier_load(); |
| 302 | cmp.free_list = entry->free_list; |
| 303 | __ha_barrier_load(); |
| 304 | if (cmp.free_list == NULL) |
| 305 | break; |
| 306 | new.free_list = *POOL_LINK(entry, cmp.free_list); |
| 307 | new.seq = cmp.seq + 1; |
Willy Tarreau | 6a38b32 | 2019-05-11 18:04:24 +0200 | [diff] [blame] | 308 | if (HA_ATOMIC_DWCAS(&entry->free_list, &cmp, &new) == 0) |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 309 | continue; |
Willy Tarreau | 45e4e28 | 2021-04-17 17:48:40 +0200 | [diff] [blame] | 310 | pool_put_to_os(entry, cmp.free_list); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 311 | } |
| 312 | } |
| 313 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 314 | if (!isolated) |
| 315 | thread_release(); |
Willy Tarreau | 88366c2 | 2020-11-03 15:53:34 +0100 | [diff] [blame] | 316 | |
| 317 | #if defined(HA_HAVE_MALLOC_TRIM) |
| 318 | malloc_trim(0); |
| 319 | #endif |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 320 | } |
Willy Tarreau | e18db9e | 2018-10-16 10:28:54 +0200 | [diff] [blame] | 321 | |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 322 | #else /* CONFIG_HAP_LOCKLESS_POOLS */ |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 323 | |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 324 | /* |
| 325 | * This function frees whatever can be freed in pool <pool>. |
| 326 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 327 | void pool_flush(struct pool_head *pool) |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 328 | { |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 329 | void *temp; |
| 330 | |
Willy Tarreau | 4d2d098 | 2007-05-14 00:39:29 +0200 | [diff] [blame] | 331 | if (!pool) |
| 332 | return; |
| 333 | |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 334 | while (1) { |
| 335 | HA_SPIN_LOCK(POOL_LOCK, &pool->lock); |
| 336 | temp = pool->free_list; |
| 337 | if (!temp) { |
| 338 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
| 339 | break; |
| 340 | } |
| 341 | pool->free_list = *POOL_LINK(pool, temp); |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 342 | HA_SPIN_UNLOCK(POOL_LOCK, &pool->lock); |
Willy Tarreau | 45e4e28 | 2021-04-17 17:48:40 +0200 | [diff] [blame] | 343 | pool_put_to_os(pool, temp); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 344 | } |
Willy Tarreau | 3e853ea | 2019-07-04 11:30:00 +0200 | [diff] [blame] | 345 | /* here, we should have pool->allocated == pool->used */ |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 346 | } |
| 347 | |
| 348 | /* |
| 349 | * This function frees whatever can be freed in all pools, but respecting |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 350 | * the minimum thresholds imposed by owners. It makes sure to be alone to |
| 351 | * run by using thread_isolate(). <pool_ctx> is unused. |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 352 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 353 | void pool_gc(struct pool_head *pool_ctx) |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 354 | { |
| 355 | struct pool_head *entry; |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 356 | int isolated = thread_isolated(); |
Willy Tarreau | b7f9d12 | 2009-04-21 02:17:45 +0200 | [diff] [blame] | 357 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 358 | if (!isolated) |
| 359 | thread_isolate(); |
Willy Tarreau | b7f9d12 | 2009-04-21 02:17:45 +0200 | [diff] [blame] | 360 | |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 361 | list_for_each_entry(entry, &pools, list) { |
Olivier Houchard | 51d9339 | 2020-03-12 19:05:39 +0100 | [diff] [blame] | 362 | void *temp; |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 363 | //qfprintf(stderr, "Flushing pool %s\n", entry->name); |
Olivier Houchard | 51d9339 | 2020-03-12 19:05:39 +0100 | [diff] [blame] | 364 | while (entry->free_list && |
Willy Tarreau | 57767b8 | 2014-12-22 21:40:55 +0100 | [diff] [blame] | 365 | (int)(entry->allocated - entry->used) > (int)entry->minavail) { |
Olivier Houchard | 51d9339 | 2020-03-12 19:05:39 +0100 | [diff] [blame] | 366 | temp = entry->free_list; |
| 367 | entry->free_list = *POOL_LINK(entry, temp); |
Willy Tarreau | 45e4e28 | 2021-04-17 17:48:40 +0200 | [diff] [blame] | 368 | pool_put_to_os(entry, temp); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 369 | } |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 370 | } |
Christopher Faulet | b349e48 | 2017-08-29 09:52:38 +0200 | [diff] [blame] | 371 | |
Willy Tarreau | c0e2ff2 | 2020-04-24 06:15:24 +0200 | [diff] [blame] | 372 | if (!isolated) |
| 373 | thread_release(); |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 374 | } |
Willy Tarreau | b8498e9 | 2021-04-18 10:23:02 +0200 | [diff] [blame] | 375 | #endif /* CONFIG_HAP_LOCKLESS_POOLS */ |
| 376 | |
| 377 | #else /* CONFIG_HAP_POOLS */ |
| 378 | |
| 379 | /* legacy stuff */ |
| 380 | void pool_flush(struct pool_head *pool) |
| 381 | { |
| 382 | } |
| 383 | |
| 384 | /* This function might ask the malloc library to trim its buffers. */ |
| 385 | void pool_gc(struct pool_head *pool_ctx) |
| 386 | { |
| 387 | #if defined(HA_HAVE_MALLOC_TRIM) |
| 388 | malloc_trim(0); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 389 | #endif |
Willy Tarreau | b8498e9 | 2021-04-18 10:23:02 +0200 | [diff] [blame] | 390 | } |
| 391 | |
| 392 | #endif /* CONFIG_HAP_POOLS */ |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 393 | |
| 394 | /* |
Willy Tarreau | dae4aa8 | 2007-06-16 23:19:53 +0200 | [diff] [blame] | 395 | * This function destroys a pool by freeing it completely, unless it's still |
| 396 | * in use. This should be called only under extreme circumstances. It always |
| 397 | * returns NULL if the resulting pool is empty, easing the clearing of the old |
| 398 | * pointer, otherwise it returns the pool. |
| 399 | * . |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 400 | */ |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 401 | void *pool_destroy(struct pool_head *pool) |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 402 | { |
Willy Tarreau | 4d2d098 | 2007-05-14 00:39:29 +0200 | [diff] [blame] | 403 | if (pool) { |
Willy Tarreau | bafbe01 | 2017-11-24 17:34:44 +0100 | [diff] [blame] | 404 | pool_flush(pool); |
Willy Tarreau | dae4aa8 | 2007-06-16 23:19:53 +0200 | [diff] [blame] | 405 | if (pool->used) |
| 406 | return pool; |
| 407 | pool->users--; |
| 408 | if (!pool->users) { |
| 409 | LIST_DEL(&pool->list); |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 410 | #ifndef CONFIG_HAP_LOCKLESS_POOLS |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 411 | HA_SPIN_DESTROY(&pool->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 412 | #endif |
Willy Tarreau | 9f3129e | 2021-04-17 00:31:38 +0200 | [diff] [blame] | 413 | /* note that if used == 0, the cache is empty */ |
| 414 | free(pool); |
Willy Tarreau | dae4aa8 | 2007-06-16 23:19:53 +0200 | [diff] [blame] | 415 | } |
Willy Tarreau | 4d2d098 | 2007-05-14 00:39:29 +0200 | [diff] [blame] | 416 | } |
| 417 | return NULL; |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 418 | } |
| 419 | |
Willy Tarreau | 2455ceb | 2018-11-26 15:57:34 +0100 | [diff] [blame] | 420 | /* This destroys all pools on exit. It is *not* thread safe. */ |
| 421 | void pool_destroy_all() |
| 422 | { |
| 423 | struct pool_head *entry, *back; |
| 424 | |
| 425 | list_for_each_entry_safe(entry, back, &pools, list) |
| 426 | pool_destroy(entry); |
| 427 | } |
| 428 | |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 429 | /* This function dumps memory usage information into the trash buffer. */ |
| 430 | void dump_pools_to_trash() |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 431 | { |
| 432 | struct pool_head *entry; |
| 433 | unsigned long allocated, used; |
| 434 | int nbpools; |
| 435 | |
| 436 | allocated = used = nbpools = 0; |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 437 | chunk_printf(&trash, "Dumping pools usage. Use SIGQUIT to flush them.\n"); |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 438 | list_for_each_entry(entry, &pools, list) { |
Willy Tarreau | f161d0f | 2018-02-22 14:05:55 +0100 | [diff] [blame] | 439 | #ifndef CONFIG_HAP_LOCKLESS_POOLS |
Christopher Faulet | 2a944ee | 2017-11-07 10:42:54 +0100 | [diff] [blame] | 440 | HA_SPIN_LOCK(POOL_LOCK, &entry->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 441 | #endif |
Willy Tarreau | 9f3129e | 2021-04-17 00:31:38 +0200 | [diff] [blame] | 442 | chunk_appendf(&trash, " - Pool %s (%u bytes) : %u allocated (%u bytes), %u used, needed_avg %u, %u failures, %u users, @%p%s\n", |
Willy Tarreau | e6ce59d | 2007-05-13 19:38:49 +0200 | [diff] [blame] | 443 | entry->name, entry->size, entry->allocated, |
Willy Tarreau | a1e4f8c | 2020-05-08 08:31:56 +0200 | [diff] [blame] | 444 | entry->size * entry->allocated, entry->used, |
Willy Tarreau | 606135a | 2020-06-01 12:35:03 +0200 | [diff] [blame] | 445 | swrate_avg(entry->needed_avg, POOL_AVG_SAMPLES), entry->failed, |
Willy Tarreau | 9f3129e | 2021-04-17 00:31:38 +0200 | [diff] [blame] | 446 | entry->users, entry, |
Willy Tarreau | 0a93b64 | 2018-10-16 07:58:39 +0200 | [diff] [blame] | 447 | (entry->flags & MEM_F_SHARED) ? " [SHARED]" : ""); |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 448 | |
| 449 | allocated += entry->allocated * entry->size; |
| 450 | used += entry->used * entry->size; |
| 451 | nbpools++; |
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_UNLOCK(POOL_LOCK, &entry->lock); |
Olivier Houchard | cf975d4 | 2018-01-24 18:38:31 +0100 | [diff] [blame] | 454 | #endif |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 455 | } |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 456 | chunk_appendf(&trash, "Total: %d pools, %lu bytes allocated, %lu used.\n", |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 457 | nbpools, allocated, used); |
| 458 | } |
| 459 | |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 460 | /* Dump statistics on pools usage. */ |
| 461 | void dump_pools(void) |
| 462 | { |
| 463 | dump_pools_to_trash(); |
Willy Tarreau | 843b7cb | 2018-07-13 10:54:26 +0200 | [diff] [blame] | 464 | qfprintf(stderr, "%s", trash.area); |
Willy Tarreau | 12833bb | 2014-01-28 16:49:56 +0100 | [diff] [blame] | 465 | } |
| 466 | |
Willy Tarreau | 58102cf | 2015-10-28 16:24:21 +0100 | [diff] [blame] | 467 | /* This function returns the total number of failed pool allocations */ |
| 468 | int pool_total_failures() |
| 469 | { |
| 470 | struct pool_head *entry; |
| 471 | int failed = 0; |
| 472 | |
| 473 | list_for_each_entry(entry, &pools, list) |
| 474 | failed += entry->failed; |
| 475 | return failed; |
| 476 | } |
| 477 | |
| 478 | /* This function returns the total amount of memory allocated in pools (in bytes) */ |
| 479 | unsigned long pool_total_allocated() |
| 480 | { |
| 481 | struct pool_head *entry; |
| 482 | unsigned long allocated = 0; |
| 483 | |
| 484 | list_for_each_entry(entry, &pools, list) |
| 485 | allocated += entry->allocated * entry->size; |
| 486 | return allocated; |
| 487 | } |
| 488 | |
| 489 | /* This function returns the total amount of memory used in pools (in bytes) */ |
| 490 | unsigned long pool_total_used() |
| 491 | { |
| 492 | struct pool_head *entry; |
| 493 | unsigned long used = 0; |
| 494 | |
| 495 | list_for_each_entry(entry, &pools, list) |
| 496 | used += entry->used * entry->size; |
| 497 | return used; |
| 498 | } |
| 499 | |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 500 | /* This function dumps memory usage information onto the stream interface's |
| 501 | * read buffer. It returns 0 as long as it does not complete, non-zero upon |
| 502 | * completion. No state is used. |
| 503 | */ |
| 504 | static int cli_io_handler_dump_pools(struct appctx *appctx) |
| 505 | { |
| 506 | struct stream_interface *si = appctx->owner; |
| 507 | |
| 508 | dump_pools_to_trash(); |
Willy Tarreau | 06d80a9 | 2017-10-19 14:32:15 +0200 | [diff] [blame] | 509 | if (ci_putchk(si_ic(si), &trash) == -1) { |
Willy Tarreau | db39843 | 2018-11-15 11:08:52 +0100 | [diff] [blame] | 510 | si_rx_room_blk(si); |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 511 | return 0; |
| 512 | } |
| 513 | return 1; |
| 514 | } |
| 515 | |
Willy Tarreau | 7107c8b | 2018-11-26 11:44:35 +0100 | [diff] [blame] | 516 | /* callback used to create early pool <name> of size <size> and store the |
| 517 | * resulting pointer into <ptr>. If the allocation fails, it quits with after |
| 518 | * emitting an error message. |
| 519 | */ |
| 520 | void create_pool_callback(struct pool_head **ptr, char *name, unsigned int size) |
| 521 | { |
| 522 | *ptr = create_pool(name, size, MEM_F_SHARED); |
| 523 | if (!*ptr) { |
| 524 | ha_alert("Failed to allocate pool '%s' of size %u : %s. Aborting.\n", |
| 525 | name, size, strerror(errno)); |
| 526 | exit(1); |
| 527 | } |
| 528 | } |
| 529 | |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 530 | /* Initializes all per-thread arrays on startup */ |
| 531 | static void init_pools() |
| 532 | { |
Willy Tarreau | 2d6f628 | 2021-04-15 16:24:00 +0200 | [diff] [blame] | 533 | #ifdef CONFIG_HAP_POOLS |
Willy Tarreau | 9f3129e | 2021-04-17 00:31:38 +0200 | [diff] [blame] | 534 | int thr; |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 535 | |
| 536 | for (thr = 0; thr < MAX_THREADS; thr++) { |
Willy Tarreau | 20dc3cd | 2020-06-28 00:54:27 +0200 | [diff] [blame] | 537 | LIST_INIT(&ha_thread_info[thr].pool_lru_head); |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 538 | } |
Willy Tarreau | ed891fd | 2020-06-01 19:00:28 +0200 | [diff] [blame] | 539 | #endif |
Willy Tarreau | 7f0165e | 2018-11-26 17:09:46 +0100 | [diff] [blame] | 540 | } |
| 541 | |
| 542 | INITCALL0(STG_PREPARE, init_pools); |
Willy Tarreau | 7107c8b | 2018-11-26 11:44:35 +0100 | [diff] [blame] | 543 | |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 544 | /* register cli keywords */ |
| 545 | static struct cli_kw_list cli_kws = {{ },{ |
Willy Tarreau | e9ecec8 | 2016-12-16 18:55:23 +0100 | [diff] [blame] | 546 | { { "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] | 547 | {{},} |
| 548 | }}; |
| 549 | |
Willy Tarreau | 0108d90 | 2018-11-25 19:14:37 +0100 | [diff] [blame] | 550 | INITCALL1(STG_REGISTER, cli_register_kw, &cli_kws); |
William Lallemand | e7ed885 | 2016-11-19 02:25:36 +0100 | [diff] [blame] | 551 | |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 552 | #ifdef DEBUG_FAIL_ALLOC |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 553 | |
| 554 | int mem_should_fail(const struct pool_head *pool) |
| 555 | { |
Olivier Houchard | 9c4f08a | 2019-02-01 16:28:04 +0100 | [diff] [blame] | 556 | int ret = 0; |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 557 | |
| 558 | if (mem_fail_rate > 0 && !(global.mode & MODE_STARTING)) { |
Willy Tarreau | 20f88ab | 2021-04-17 15:50:28 +0200 | [diff] [blame] | 559 | if (mem_fail_rate > statistical_prng_range(100)) |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 560 | ret = 1; |
| 561 | else |
| 562 | ret = 0; |
| 563 | } |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 564 | return ret; |
| 565 | |
| 566 | } |
| 567 | |
| 568 | /* config parser for global "tune.fail-alloc" */ |
| 569 | static int mem_parse_global_fail_alloc(char **args, int section_type, struct proxy *curpx, |
Amaury Denoyelle | 3b1c9a3 | 2021-03-22 11:21:36 +0100 | [diff] [blame] | 570 | const struct proxy *defpx, const char *file, int line, |
| 571 | char **err) |
Olivier Houchard | dc21ff7 | 2019-01-29 15:20:16 +0100 | [diff] [blame] | 572 | { |
| 573 | if (too_many_args(1, args, err, NULL)) |
| 574 | return -1; |
| 575 | mem_fail_rate = atoi(args[1]); |
| 576 | if (mem_fail_rate < 0 || mem_fail_rate > 100) { |
| 577 | memprintf(err, "'%s' expects a numeric value between 0 and 100.", args[0]); |
| 578 | return -1; |
| 579 | } |
| 580 | return 0; |
| 581 | } |
| 582 | #endif |
| 583 | |
| 584 | /* register global config keywords */ |
| 585 | static struct cfg_kw_list mem_cfg_kws = {ILH, { |
| 586 | #ifdef DEBUG_FAIL_ALLOC |
| 587 | { CFG_GLOBAL, "tune.fail-alloc", mem_parse_global_fail_alloc }, |
| 588 | #endif |
| 589 | { 0, NULL, NULL } |
| 590 | }}; |
| 591 | |
| 592 | INITCALL1(STG_REGISTER, cfg_register_keywords, &mem_cfg_kws); |
| 593 | |
Willy Tarreau | 50e608d | 2007-05-13 18:26:08 +0200 | [diff] [blame] | 594 | /* |
| 595 | * Local variables: |
| 596 | * c-indent-level: 8 |
| 597 | * c-basic-offset: 8 |
| 598 | * End: |
| 599 | */ |