3 #define BUFFER_OVERFLOW_EOF "EOF"
5 static inline void buffer_overflow_init(BUFFER *b)
7 b->buffer[b->size] = '\0';
8 strcpy(&b->buffer[b->size + 1], BUFFER_OVERFLOW_EOF);
11 #ifdef NETDATA_INTERNAL_CHECKS
12 #define buffer_overflow_check(b) _buffer_overflow_check(b, __FILE__, __FUNCTION__, __LINE__)
14 #define buffer_overflow_check(b)
17 static inline void _buffer_overflow_check(BUFFER *b, const char *file, const char *function, const unsigned long line)
19 if(b->len > b->size) {
20 error("BUFFER: length %zu is above size %zu, at line %lu, at function %s() of file '%s'.", b->len, b->size, line, function, file);
24 if(b->buffer[b->size] != '\0' || strcmp(&b->buffer[b->size + 1], BUFFER_OVERFLOW_EOF)) {
25 error("BUFFER: detected overflow at line %lu, at function %s() of file '%s'.", line, function, file);
26 buffer_overflow_init(b);
31 void buffer_reset(BUFFER *wb)
35 wb->contenttype = CT_TEXT_PLAIN;
40 buffer_overflow_check(wb);
43 const char *buffer_tostring(BUFFER *wb)
45 buffer_need_bytes(wb, 1);
46 wb->buffer[wb->len] = '\0';
48 buffer_overflow_check(wb);
53 void buffer_char_replace(BUFFER *wb, char from, char to)
55 char *s = wb->buffer, *end = &wb->buffer[wb->len];
58 if(*s == from) *s = to;
62 buffer_overflow_check(wb);
65 // This trick seems to give an 80% speed increase in 32bit systems
66 // print_calculated_number_llu_r() will just print the digits up to the
67 // point the remaining value fits in 32 bits, and then calls
68 // print_calculated_number_lu_r() to print the rest with 32 bit arithmetic.
70 inline char *print_number_lu_r(char *str, unsigned long uvalue) {
74 do *wstr++ = (char)('0' + (uvalue % 10)); while(uvalue /= 10);
78 inline char *print_number_llu_r(char *str, unsigned long long uvalue) {
82 do *wstr++ = (char)('0' + (uvalue % 10)); while((uvalue /= 10) && uvalue > (unsigned long long)0xffffffff);
83 if(uvalue) return print_number_lu_r(wstr, uvalue);
87 void buffer_print_llu(BUFFER *wb, unsigned long long uvalue)
89 buffer_need_bytes(wb, 50);
91 char *str = &wb->buffer[wb->len];
95 if(uvalue > (unsigned long long)0xffffffff)
96 wstr = print_number_llu_r(wstr, uvalue);
98 wstr = print_number_lu_r(wstr, uvalue);
100 do *wstr++ = (char)('0' + (uvalue % 10)); while(uvalue /= 10);
107 char *begin = str, *end = wstr - 1, aux;
108 while (end > begin) aux = *end, *end-- = *begin, *begin++ = aux;
110 // return the buffer length
111 wb->len += wstr - str;
114 void buffer_strcat(BUFFER *wb, const char *txt)
116 if(unlikely(!txt || !*txt)) return;
118 buffer_need_bytes(wb, 1);
120 char *s = &wb->buffer[wb->len], *start, *end = &wb->buffer[wb->size];
121 size_t len = wb->len;
124 while(*txt && s != end)
130 buffer_overflow_check(wb);
133 debug(D_WEB_BUFFER, "strcat(): increasing web_buffer at position %zu, size = %zu\n", wb->len, wb->size);
135 buffer_increase(wb, len);
136 buffer_strcat(wb, txt);
139 // terminate the string
140 // without increasing the length
141 buffer_need_bytes(wb, (size_t)1);
142 wb->buffer[wb->len] = '\0';
146 void buffer_strcat_htmlescape(BUFFER *wb, const char *txt)
148 char b[2] = { [0] = '\0', [1] = '\0' };
152 case '&': buffer_strcat(wb, "&"); break;
153 case '<': buffer_strcat(wb, "<"); break;
154 case '>': buffer_strcat(wb, ">"); break;
155 case '"': buffer_strcat(wb, """); break;
156 case '/': buffer_strcat(wb, "/"); break;
157 case '\'': buffer_strcat(wb, "'"); break;
160 buffer_strcat(wb, b);
167 void buffer_snprintf(BUFFER *wb, size_t len, const char *fmt, ...)
169 if(unlikely(!fmt || !*fmt)) return;
171 buffer_need_bytes(wb, len + 1);
175 wb->len += vsnprintfz(&wb->buffer[wb->len], len, fmt, args);
178 buffer_overflow_check(wb);
180 // the buffer is \0 terminated by vsnprintfz
183 void buffer_vsprintf(BUFFER *wb, const char *fmt, va_list args)
185 if(unlikely(!fmt || !*fmt)) return;
187 buffer_need_bytes(wb, 2);
189 size_t len = wb->size - wb->len - 1;
191 wb->len += vsnprintfz(&wb->buffer[wb->len], len, fmt, args);
193 buffer_overflow_check(wb);
195 // the buffer is \0 terminated by vsnprintfz
198 void buffer_sprintf(BUFFER *wb, const char *fmt, ...)
200 if(unlikely(!fmt || !*fmt)) return;
202 buffer_need_bytes(wb, 2);
204 size_t len = wb->size - wb->len - 1;
209 wrote = (size_t) vsnprintfz(&wb->buffer[wb->len], len, fmt, args);
212 if(unlikely(wrote >= len)) {
214 buffer_overflow_check(wb);
216 debug(D_WEB_BUFFER, "web_buffer_sprintf(): increasing web_buffer at position %zu, size = %zu\n", wb->len, wb->size);
217 buffer_need_bytes(wb, len + WEB_DATA_LENGTH_INCREASE_STEP);
220 buffer_vsprintf(wb, fmt, args);
226 // the buffer is \0 terminated by vsnprintf
230 void buffer_rrd_value(BUFFER *wb, calculated_number value)
232 buffer_need_bytes(wb, 50);
234 if(isnan(value) || isinf(value)) {
235 buffer_strcat(wb, "null");
239 wb->len += print_calculated_number(&wb->buffer[wb->len], value);
242 buffer_need_bytes(wb, 1);
243 wb->buffer[wb->len] = '\0';
245 buffer_overflow_check(wb);
248 // generate a javascript date, the fastest possible way...
249 void buffer_jsdate(BUFFER *wb, int year, int month, int day, int hours, int minutes, int seconds)
252 // 01234567890123456789012345678901234
253 // Date(2014,04,01,03,28,20)
255 buffer_need_bytes(wb, 30);
257 char *b = &wb->buffer[wb->len], *p;
258 unsigned int *q = (unsigned int *)b;
260 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
261 *q++ = 0x65746144; // "Date" backwards.
263 *q++ = 0x44617465; // "Date"
268 *p++ = '0' + year / 1000; year %= 1000;
269 *p++ = '0' + year / 100; year %= 100;
270 *p++ = '0' + year / 10;
271 *p++ = '0' + year % 10;
273 *p = '0' + month / 10; if (*p != '0') p++;
274 *p++ = '0' + month % 10;
276 *p = '0' + day / 10; if (*p != '0') p++;
277 *p++ = '0' + day % 10;
279 *p = '0' + hours / 10; if (*p != '0') p++;
280 *p++ = '0' + hours % 10;
282 *p = '0' + minutes / 10; if (*p != '0') p++;
283 *p++ = '0' + minutes % 10;
285 *p = '0' + seconds / 10; if (*p != '0') p++;
286 *p++ = '0' + seconds % 10;
288 unsigned short *r = (unsigned short *)p;
290 #if __BYTE_ORDER__ == __ORDER_LITTLE_ENDIAN__
291 *r++ = 0x0029; // ")\0" backwards.
293 *r++ = 0x2900; // ")\0"
296 wb->len += (size_t)((char *)r - b - 1);
299 wb->buffer[wb->len] = '\0';
300 buffer_overflow_check(wb);
303 // generate a date, the fastest possible way...
304 void buffer_date(BUFFER *wb, int year, int month, int day, int hours, int minutes, int seconds)
307 // 01234567890123456789012345678901234
308 // 2014-04-01 03:28:20
310 buffer_need_bytes(wb, 36);
312 char *b = &wb->buffer[wb->len];
315 *p++ = '0' + year / 1000; year %= 1000;
316 *p++ = '0' + year / 100; year %= 100;
317 *p++ = '0' + year / 10;
318 *p++ = '0' + year % 10;
320 *p++ = '0' + month / 10;
321 *p++ = '0' + month % 10;
323 *p++ = '0' + day / 10;
324 *p++ = '0' + day % 10;
326 *p++ = '0' + hours / 10;
327 *p++ = '0' + hours % 10;
329 *p++ = '0' + minutes / 10;
330 *p++ = '0' + minutes % 10;
332 *p++ = '0' + seconds / 10;
333 *p++ = '0' + seconds % 10;
336 wb->len += (size_t)(p - b);
339 wb->buffer[wb->len] = '\0';
340 buffer_overflow_check(wb);
343 BUFFER *buffer_create(size_t size)
347 debug(D_WEB_BUFFER, "Creating new web buffer of size %zu.", size);
349 b = callocz(1, sizeof(BUFFER));
350 b->buffer = mallocz(size + sizeof(BUFFER_OVERFLOW_EOF) + 2);
353 b->contenttype = CT_TEXT_PLAIN;
354 buffer_overflow_init(b);
355 buffer_overflow_check(b);
360 void buffer_free(BUFFER *b)
362 buffer_overflow_check(b);
364 debug(D_WEB_BUFFER, "Freeing web buffer of size %zu.", b->size);
370 void buffer_increase(BUFFER *b, size_t free_size_required)
372 buffer_overflow_check(b);
374 size_t left = b->size - b->len;
376 if(left >= free_size_required) return;
378 size_t increase = free_size_required - left;
379 if(increase < WEB_DATA_LENGTH_INCREASE_STEP) increase = WEB_DATA_LENGTH_INCREASE_STEP;
381 debug(D_WEB_BUFFER, "Increasing data buffer from size %zu to %zu.", b->size, b->size + increase);
383 b->buffer = reallocz(b->buffer, b->size + increase + sizeof(BUFFER_OVERFLOW_EOF) + 2);
386 buffer_overflow_init(b);
387 buffer_overflow_check(b);