blob: e0db429c0c642f98b4c4e0805863044feaccf217 [file] [log] [blame]
Willy Tarreauc7e42382012-08-24 19:22:53 +02001/*
2 * Buffer management functions.
3 *
4 * Copyright 2000-2012 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 */
12
William Lallemandbe0efd82012-11-22 18:01:40 +010013#include <ctype.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020014#include <stdio.h>
15#include <string.h>
16
Willy Tarreau4c7e4b72020-05-27 12:58:42 +020017#include <haproxy/api.h>
Willy Tarreau2741c8c2020-06-02 11:28:02 +020018#include <haproxy/dynbuf.h>
19#include <haproxy/list.h>
Willy Tarreaud0ef4392020-06-02 09:38:52 +020020#include <haproxy/pool.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020021
Willy Tarreauf268ee82020-06-04 17:05:57 +020022#include <haproxy/global.h>
Willy Tarreauc7e42382012-08-24 19:22:53 +020023
Willy Tarreaubafbe012017-11-24 17:34:44 +010024struct pool_head *pool_head_buffer;
Willy Tarreau9b28e032012-10-12 23:49:43 +020025
Christopher Fauleta73e59b2016-12-09 17:30:18 +010026/* list of objects waiting for at least one buffer */
Willy Tarreau21046592020-02-26 10:39:36 +010027struct mt_list buffer_wq = LIST_HEAD_INIT(buffer_wq);
Willy Tarreau86abe442018-11-25 20:12:18 +010028__decl_aligned_spinlock(buffer_wq_lock);
Christopher Fauleta73e59b2016-12-09 17:30:18 +010029
Willy Tarreau9b28e032012-10-12 23:49:43 +020030/* perform minimal intializations, report 0 in case of error, 1 if OK. */
31int init_buffer()
32{
Willy Tarreaua24adf02014-11-27 01:11:56 +010033 void *buffer;
34
Willy Tarreauc9fa0482018-07-10 17:43:27 +020035 pool_head_buffer = create_pool("buffer", global.tune.bufsize, MEM_F_SHARED|MEM_F_EXACT);
Willy Tarreaubafbe012017-11-24 17:34:44 +010036 if (!pool_head_buffer)
Willy Tarreaua24adf02014-11-27 01:11:56 +010037 return 0;
38
39 /* The reserved buffer is what we leave behind us. Thus we always need
40 * at least one extra buffer in minavail otherwise we'll end up waking
41 * up tasks with no memory available, causing a lot of useless wakeups.
42 * That means that we always want to have at least 3 buffers available
43 * (2 for current session, one for next session that might be needed to
44 * release a server connection).
45 */
Willy Tarreaubafbe012017-11-24 17:34:44 +010046 pool_head_buffer->minavail = MAX(global.tune.reserved_bufs, 3);
Willy Tarreau33cb0652014-12-23 22:52:37 +010047 if (global.tune.buf_limit)
Willy Tarreaubafbe012017-11-24 17:34:44 +010048 pool_head_buffer->limit = global.tune.buf_limit;
Willy Tarreaua24adf02014-11-27 01:11:56 +010049
Willy Tarreaubafbe012017-11-24 17:34:44 +010050 buffer = pool_refill_alloc(pool_head_buffer, pool_head_buffer->minavail - 1);
Willy Tarreaua24adf02014-11-27 01:11:56 +010051 if (!buffer)
52 return 0;
53
Willy Tarreaubafbe012017-11-24 17:34:44 +010054 pool_free(pool_head_buffer, buffer);
Willy Tarreaua24adf02014-11-27 01:11:56 +010055 return 1;
Willy Tarreau9b28e032012-10-12 23:49:43 +020056}
57
Willy Tarreauaf819352012-08-27 22:08:00 +020058/*
Willy Tarreauc7e42382012-08-24 19:22:53 +020059 * Dumps part or all of a buffer.
60 */
61void buffer_dump(FILE *o, struct buffer *b, int from, int to)
62{
63 fprintf(o, "Dumping buffer %p\n", b);
Willy Tarreau81521ed2018-06-19 07:48:13 +020064 fprintf(o, " orig=%p size=%u head=%u tail=%u data=%u\n",
65 b_orig(b), (unsigned int)b_size(b), (unsigned int)b_head_ofs(b), (unsigned int)b_tail_ofs(b), (unsigned int)b_data(b));
Willy Tarreauc7e42382012-08-24 19:22:53 +020066
67 fprintf(o, "Dumping contents from byte %d to byte %d\n", from, to);
William Lallemandbe0efd82012-11-22 18:01:40 +010068 fprintf(o, " 0 1 2 3 4 5 6 7 8 9 a b c d e f\n");
69 /* dump hexa */
70 while (from < to) {
71 int i;
72
73 fprintf(o, " %04x: ", from);
74 for (i = 0; ((from + i) < to) && (i < 16) ; i++) {
Willy Tarreau81521ed2018-06-19 07:48:13 +020075 fprintf(o, "%02x ", (unsigned char)b_orig(b)[from + i]);
William Lallemandbe0efd82012-11-22 18:01:40 +010076 if (((from + i) & 15) == 7)
77 fprintf(o, "- ");
78 }
Godbachc08057c2013-11-14 10:15:20 +080079 if (to - from < 16) {
Godbachc3916a72013-11-21 10:21:22 +080080 int j = 0;
81
Godbachc08057c2013-11-14 10:15:20 +080082 for (j = 0; j < from + 16 - to; j++)
83 fprintf(o, " ");
Godbachc3916a72013-11-21 10:21:22 +080084 if (j > 8)
85 fprintf(o, " ");
Godbachc08057c2013-11-14 10:15:20 +080086 }
William Lallemandbe0efd82012-11-22 18:01:40 +010087 fprintf(o, " ");
88 for (i = 0; (from + i < to) && (i < 16) ; i++) {
Willy Tarreau90807112020-02-25 08:16:33 +010089 fprintf(o, "%c", isprint((unsigned char)b_orig(b)[from + i]) ? b_orig(b)[from + i] : '.') ;
William Lallemandbe0efd82012-11-22 18:01:40 +010090 if ((((from + i) & 15) == 15) && ((from + i) != to-1))
91 fprintf(o, "\n");
92 }
93 from += i;
Willy Tarreauc7e42382012-08-24 19:22:53 +020094 }
95 fprintf(o, "\n--\n");
William Lallemandbe0efd82012-11-22 18:01:40 +010096 fflush(o);
Willy Tarreauc7e42382012-08-24 19:22:53 +020097}
98
Willy Tarreauc41b3e82018-03-02 10:27:12 +010099/* see offer_buffer() for details */
Christopher Fauleta73e59b2016-12-09 17:30:18 +0100100void __offer_buffer(void *from, unsigned int threshold)
101{
Willy Tarreau21046592020-02-26 10:39:36 +0100102 struct buffer_wait *wait;
103 struct mt_list *elt1, elt2;
Christopher Fauleta73e59b2016-12-09 17:30:18 +0100104 int avail;
105
106 /* For now, we consider that all objects need 1 buffer, so we can stop
107 * waking up them once we have enough of them to eat all the available
108 * buffers. Note that we don't really know if they are streams or just
109 * other tasks, but that's a rough estimate. Similarly, for each cached
110 * event we'll need 1 buffer. If no buffer is currently used, always
111 * wake up the number of tasks we can offer a buffer based on what is
112 * allocated, and in any case at least one task per two reserved
113 * buffers.
114 */
Willy Tarreaubafbe012017-11-24 17:34:44 +0100115 avail = pool_head_buffer->allocated - pool_head_buffer->used - global.tune.reserved_bufs / 2;
Christopher Fauleta73e59b2016-12-09 17:30:18 +0100116
Willy Tarreau21046592020-02-26 10:39:36 +0100117 mt_list_for_each_entry_safe(wait, &buffer_wq, list, elt1, elt2) {
Christopher Fauleta73e59b2016-12-09 17:30:18 +0100118 if (avail <= threshold)
119 break;
120
121 if (wait->target == from || !wait->wakeup_cb(wait->target))
122 continue;
123
Olivier Houchard6c96fc12020-03-10 17:39:21 +0100124 MT_LIST_DEL_SAFE(elt1);
Christopher Fauleta73e59b2016-12-09 17:30:18 +0100125 avail--;
126 }
127}
Willy Tarreauc7e42382012-08-24 19:22:53 +0200128
129/*
130 * Local variables:
131 * c-indent-level: 8
132 * c-basic-offset: 8
133 * End:
134 */