
973b983 Merge branch 'release-2.0.0' into develop 255dd23 Make spinlock functions take const argument 6e23bab Fix bitmask reallocation 338c189 Rename and clean up slavelag filter 3ea8f28 Fix possible NULL pointer dereference bfe6738 MXS-830: Add module information to logged messages 1fad962 Fix strncat usage d38997a Adjust log throttling policy 0be4e4b Add hashtable_item_strcasecmp 726100e Take hashtable convenience functions into use 5e7744a Fix typo in maxadmin.md c5778c8 Merge branch 'release-2.0.0' into develop b5762af Move from tmpnam to mkstemp d6f2c71 Add convenience functions to hashtable 359058a MXS-825: Add support for --execdir 636347c Enable runtime reconfiguration of log throttling ef9fba9 Improve log throttling documentation aef917a Implement log throttling e3a5349 Remove shardrouter.c 8051e80 Remove custom qc_sqlite allocation functions fd34d60 Initial implementation of the learning firewall a8752a8 Removed "filestem option" from example 1ef2519 Removed "filestem option" from example 0815cc8 Cleanup spinlock.h ab4dc99 Clean up hashtable.h ef2c078 Add prototypes for hashtable copy and free functions fb5cfaf Add 'log_throttling' configuration entry 300d823 Add proper prototypes for hashtable hash and cmp functions 1c649aa qc_mysqlembedded: Include skygw_...h without path. d276160 Add missing RPM scripts e70e644 Fix HTTPAuth installation 1b2b389 Combine utils into the server directory 3ff9913 Add missing utils headers to devel package 407efb2 Fix minor packaging problems 99aa6ad Split MaxScale into core, experimental and devel packages 1290386 Merge branch 'develop' of ssh://github.com/mariadb-corporation/maxscale-new into develop e59f148 Make scripts POSIX sh compatible 7319266 Fixed SHOW SLAVE STATUS in bonlog router f8d760a Update Binlogrouter.md 0a904ed Update Replication-Proxy-Binlog-Router-Tutorial.md 75d4202 Update Replication-Proxy-Binlog-Router-Tutorial.md b8651fc Add missing newline in listmanager.h c7ad047 Add note about user data caches to release notes 70ccc2b Merge branch 'release-2.0.0' into develop 575d1b6 Mistake - dummy session needs list markers set. 8364508 Merge branch 'develop' into binlog_server_semisync 868b902 Update MaxScale limitations 2c8b327 Store listener caches in separate directories 6e183ec Create unique user data caches for each listeners f643685 Don't free orphaned tee filter sessions 4179afa Allow binlogrouter to be used without a listener 7ad79af Add function for freeing a listener 677a0a2 Move authentication data from services to listeners 4f12af7 Merge remote-tracking branch 'origin/MXS-677' into develop 1419b81 Semi-Sync support to binlog server: code review updtate 0ea0f01 Semi-Sync support to binlog server: added missing routine 4aad909 Semi-Sync support to binlog server b824e1e Add authenticator support to httpd.c 705a688 Change tabs to spaces d0c419e Change method of adding list fields to e.g. DCB 25504fc Document the changed routing priority of hints 41666d1 Remove use_ssl_if_enabled global option a3584e9 Make routing hints have highest priority 34a1d24 Updated document with new binlog router option 01eedc5 Updated documentation with SSL usage 8a4c0f6 Update Replication-Proxy-Binlog-Router-Tutorial.md 4e374aa Update Replication-Proxy-Binlog-Router-Tutorial.md f3f3c57 Update Replication-Proxy-Binlog-Router-Tutorial.md 617b79f Binlog Server: error messages typo fix fa8dfae Binlog Server: error messages review 1b8819c Fix freeing of schemarouter session memory 07f49e1 MXS-788: new code review fix 1fd3b09 MXS-788: show services now displays SSL info 6ca2584 MXS-788 code review fix ae6a7d0 MXS-788 code review 43d3474 Master server SSL connection 90b2377 Use correct variable in listmanager pre-allocation 9a5b238 Fix listmanager pre-allocation 9c78625 Fix a memory leak when backend authentication fails e59a966 Fix hang in list_find_free ff30223 Fix freeing of shared data in schemarouter fc8f9d3 Add missing include in luafilter ecf7f53 Add missing NULL value to filter parameter array 636d849 Update memory allocation approach f0d1d38 Add new allocation functions 97d00a0 Fix writing of uninitialized data to logs e72c9b2 Merge branch 'release-2.0.0' into develop cf2b712 Merge branch 'release-2.0.0' into develop 8917c5c Change the logic behind valid list entry checks c10deff Improve documentation about version_string f59f1f7 Merge branch 'develop' of ssh://github.com/mariadb-corporation/maxscale-new into develop c88edb3 Backend authentication failure improvement abd5bee Revert "Backend authentication failure improvement" 5bb3107 Backend authentication failure improvement b7f434a Add new allocation functions 3f022fa Fix stupid mistake 99c4317 Merge remote-tracking branch 'origin/MXS-677' into develop 3c1ded6 Added connection/authentication failure error reporting in SHOW SLAVE STATUS 0a60f7b Tidy up and deal with review points. ba103ff blr_slave.c: Update strncpy usage 467331e blr_master.c: Strncpy usage updates d2b7c0c Merge remote-tracking branch 'origin/develop-nullauth-merge' into develop 5a8c1d0 qc: Measure execution time at the right place. bccdb93 Merge branch 'NullAuthDeny' into develop 2e6511c Add 5.5.5 prefix to all version strings that lack it 314655a Improve DCB and session initialization and list handling e1c43f0 MXS-655: Make MaxScale logging logrotate(8) compatible ce36afd MXS-626: Don't log a header unless maxlog enabled dcd47a7 blr_file.c: Replace uses of strncpy 6b8f576 bls_slave.c: Replace strncpy with memcpy 68a0039 Add list preallocation, tidy up, simplify init. cb37d1b Fix copyright etc headers. 11a400d Tidy; comment; fix bad copies and mistakes. 7e36ec4 Add list manager files. c4794e3 Initial code for list manager. 1b42e25 Merge remote-tracking branch 'origin/MXS-765' into develop d50f617 Fix problems, extend tests, respond to review. dcb4a91 Filter test folder removed 0b60dbe Add a couple of comments. 83cdba0 Fix overwriting problem. ba5d353 Fix overwriting problem. 53671cb Small fixes in response to review. 173d049 blr.c: Review strncpy usage 4ff6ef2 binlog_common.c: Replace strncpy with memcpy f238e03 maxbinlogcheck.s: Replace strncpy 9807f8d harness: Replace unnecessary use of strncpy 8c7fe6a avro: Modify strncpy usage 9b8008e Small improvements. b7f784f Fix mistakes in testqueuemanager.c cc26962 Restore missing poll.c code; add testqueuemanager.c. 2e91806 Format the filter harness 22059e6 Initial implementation connection queueing. c604dc2 readwritesplit.c: Improve COM_INIT_DB handling 454d920 schemarouter.c: Replace strncpy with strcpy 8e85d66 sharding_common.c: Too long a database name handled explicitly 77f4446 Astyle schemarouter 491f7c2 maxinfo.c: Replace strncpy with memcpy 6b98105 maxinfo: Reformat with astyle c1dbf08 Handle oversize user and database names 5fa4a0f Merge branch 'develop' of ssh://github.com/mariadb-corporation/maxscale-new into develop 706963b BLR_DBUSERS_TAIL new var in blr.h d75b9af Tweak comments, remove trailing blanks. ab2400a Optimise statistics gathering by inline & simpler fns. fb59ddc Remove unnecessary strncpy/strncat usage in Binlog Server bdcd551 resultset.c: Change strncpy to memcpy c6b1c5e Reject rather than cut too long a path 6d8f112 Remove unnecessary strncpy/strncat usage 18bf5ed Remove unnecessary strncpy usage dc0e2db Make maxpasswd more userfriendly c9c8695 Fix calculation of padded_len in encryptPassword 2cfd2c6 dbusers.c: Check strncpy usage 7ab9342 Make more thorough checks in secrets_readKeys be7d593 Format cli.c debugcli.c testroute.c webserver.c 1ee5efb config.c: Check usage of strncpy 3043b12 gq_utils.c: Unnecessary use of strncpy removed 77874ac Add help to maxkeys 38392a3 Update secrets_writeKeys documentation 2d1325c Make SSL optional in MaxScale's own communication bda00da Fix avro build failures b2cb31a Add more OOM macros 41ccf17 Fix strdup usage a48f732 Fix realloc calls 20771f6 Add forgotten extern "C" block 8faf35a Add maxscale allocation functions bb47890 Add macros for OOM logging afea388 Fix silly mistakes. 6dafd22 Make deny default for null auth; move code from common to auth.
469 lines
19 KiB
C
469 lines
19 KiB
C
/*
|
|
* Copyright (c) 2016 MariaDB Corporation Ab
|
|
*
|
|
* Use of this software is governed by the Business Source License included
|
|
* in the LICENSE.TXT file and at www.mariadb.com/bsl.
|
|
*
|
|
* Change Date: 2019-07-01
|
|
*
|
|
* On the date above, in accordance with the Business Source License, use
|
|
* of this software will be governed by version 2 or later of the General
|
|
* Public License.
|
|
*/
|
|
|
|
/**
|
|
*
|
|
* @verbatim
|
|
* Revision History
|
|
*
|
|
* Date Who Description
|
|
* 29-08-2014 Martin Brampton Initial implementation
|
|
*
|
|
* @endverbatim
|
|
*/
|
|
|
|
// To ensure that ss_info_assert asserts also when building in non-debug mode.
|
|
#if !defined(SS_DEBUG)
|
|
#define SS_DEBUG
|
|
#endif
|
|
#if defined(NDEBUG)
|
|
#undef NDEBUG
|
|
#endif
|
|
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <string.h>
|
|
|
|
#include <maxscale/alloc.h>
|
|
#include <buffer.h>
|
|
#include <hint.h>
|
|
|
|
/**
|
|
* Generate predefined test data
|
|
*
|
|
* @param count Number of bytes to generate
|
|
* @return Pointer to @c count bytes of data
|
|
*/
|
|
uint8_t* generate_data(size_t count)
|
|
{
|
|
uint8_t* data = MXS_MALLOC(count);
|
|
MXS_ABORT_IF_NULL(data);
|
|
|
|
srand(0);
|
|
|
|
for (size_t i = 0; i < count; i++)
|
|
{
|
|
data[i] = rand() % 256;
|
|
}
|
|
|
|
return data;
|
|
}
|
|
|
|
size_t buffers[] =
|
|
{
|
|
2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67,
|
|
71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149
|
|
};
|
|
|
|
const int n_buffers = sizeof(buffers) / sizeof(size_t);
|
|
|
|
GWBUF* create_test_buffer()
|
|
{
|
|
GWBUF* head = NULL;
|
|
size_t total = 0;
|
|
|
|
for (int i = 0; i < n_buffers; i++)
|
|
{
|
|
total += buffers[i];
|
|
}
|
|
|
|
uint8_t* data = generate_data(total);
|
|
total = 0;
|
|
|
|
for (int i = 0; i < sizeof(buffers) / sizeof(size_t); i++)
|
|
{
|
|
head = gwbuf_append(head, gwbuf_alloc_and_load(buffers[i], data + total));
|
|
total += buffers[i];
|
|
}
|
|
|
|
return head;
|
|
}
|
|
|
|
int get_length_at(int n)
|
|
{
|
|
int total = 0;
|
|
|
|
for (int i = 0; i < n_buffers && i <= n; i++)
|
|
{
|
|
total += buffers[i];
|
|
}
|
|
|
|
return total;
|
|
}
|
|
|
|
void split_buffer(int n, int offset)
|
|
{
|
|
int cutoff = get_length_at(n) + offset;
|
|
GWBUF* buffer = create_test_buffer();
|
|
int len = gwbuf_length(buffer);
|
|
GWBUF* newbuf = gwbuf_split(&buffer, cutoff);
|
|
|
|
ss_info_dassert(buffer && newbuf, "Both buffers should be non-NULL");
|
|
ss_info_dassert(gwbuf_length(newbuf) == cutoff, "New buffer should be have correct length");
|
|
ss_info_dassert(gwbuf_length(buffer) == len - cutoff, "Old buffer should be have correct length");
|
|
gwbuf_free(buffer);
|
|
gwbuf_free(newbuf);
|
|
}
|
|
|
|
|
|
void consume_buffer(int n, int offset)
|
|
{
|
|
int cutoff = get_length_at(n) + offset;
|
|
GWBUF* buffer = create_test_buffer();
|
|
int len = gwbuf_length(buffer);
|
|
buffer = gwbuf_consume(buffer, cutoff);
|
|
|
|
ss_info_dassert(buffer, "Buffer should be non-NULL");
|
|
ss_info_dassert(gwbuf_length(buffer) == len - cutoff, "Buffer should be have correct length");
|
|
gwbuf_free(buffer);
|
|
}
|
|
|
|
void copy_buffer(int n, int offset)
|
|
{
|
|
int cutoff = get_length_at(n) + offset;
|
|
uint8_t* data = generate_data(cutoff);
|
|
GWBUF* buffer = create_test_buffer();
|
|
int len = gwbuf_length(buffer);
|
|
uint8_t dest[cutoff];
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(buffer, 0, cutoff, dest) == cutoff, "All bytes should be read");
|
|
ss_info_dassert(memcmp(data, dest, sizeof(dest)) == 0, "Data should be OK");
|
|
gwbuf_free(buffer);
|
|
}
|
|
|
|
/** gwbuf_split test - These tests assume allocation will always succeed */
|
|
void test_split()
|
|
{
|
|
size_t headsize = 10;
|
|
GWBUF* head = gwbuf_alloc(headsize);
|
|
size_t tailsize = 20;
|
|
GWBUF* tail = gwbuf_alloc(tailsize);
|
|
|
|
GWBUF* oldchain = gwbuf_append(gwbuf_alloc(headsize), gwbuf_alloc(tailsize));
|
|
ss_info_dassert(gwbuf_length(oldchain) == headsize + tailsize, "Allocated buffer should be 30 bytes");
|
|
GWBUF* newchain = gwbuf_split(&oldchain, headsize + 5);
|
|
ss_info_dassert(newchain && oldchain, "Both chains should be non-NULL");
|
|
ss_info_dassert(gwbuf_length(newchain) == headsize + 5, "New chain should be 15 bytes long");
|
|
ss_info_dassert(GWBUF_LENGTH(newchain) == headsize && GWBUF_LENGTH(newchain->next) == 5,
|
|
"The new chain should have a 10 byte buffer and a 5 byte buffer");
|
|
ss_info_dassert(gwbuf_length(oldchain) == tailsize - 5, "Old chain should be 15 bytes long");
|
|
ss_info_dassert(GWBUF_LENGTH(oldchain) == tailsize - 5 && oldchain->next == NULL,
|
|
"The old chain should have a 15 byte buffer and no next buffer");
|
|
gwbuf_free(oldchain);
|
|
gwbuf_free(newchain);
|
|
|
|
oldchain = gwbuf_append(gwbuf_alloc(headsize), gwbuf_alloc(tailsize));
|
|
newchain = gwbuf_split(&oldchain, headsize);
|
|
ss_info_dassert(gwbuf_length(newchain) == headsize, "New chain should be 10 bytes long");
|
|
ss_info_dassert(gwbuf_length(oldchain) == tailsize, "Old chain should be 20 bytes long");
|
|
ss_info_dassert(oldchain->tail == oldchain, "Old chain tail should point to old chain");
|
|
ss_info_dassert(oldchain->next == NULL, "Old chain should not have next buffer");
|
|
ss_info_dassert(newchain->tail == newchain, "Old chain tail should point to old chain");
|
|
ss_info_dassert(newchain->next == NULL, "new chain should not have next buffer");
|
|
gwbuf_free(oldchain);
|
|
gwbuf_free(newchain);
|
|
|
|
oldchain = gwbuf_append(gwbuf_alloc(headsize), gwbuf_alloc(tailsize));
|
|
newchain = gwbuf_split(&oldchain, headsize + tailsize);
|
|
ss_info_dassert(newchain, "New chain should be non-NULL");
|
|
ss_info_dassert(gwbuf_length(newchain) == headsize + tailsize, "New chain should be 30 bytes long");
|
|
ss_info_dassert(oldchain == NULL, "Old chain should be NULL");
|
|
|
|
/** Splitting of contiguous memory */
|
|
GWBUF* buffer = gwbuf_alloc(10);
|
|
GWBUF* newbuf = gwbuf_split(&buffer, 5);
|
|
ss_info_dassert(buffer != newbuf, "gwbuf_split should return different pointers");
|
|
ss_info_dassert(gwbuf_length(buffer) == 5 && GWBUF_LENGTH(buffer) == 5, "Old buffer should be 5 bytes");
|
|
ss_info_dassert(gwbuf_length(newbuf) == 5 && GWBUF_LENGTH(newbuf) == 5, "New buffer should be 5 bytes");
|
|
ss_info_dassert(buffer->tail == buffer, "Old buffer's tail should point to itself");
|
|
ss_info_dassert(newbuf->tail == newbuf, "New buffer's tail should point to itself");
|
|
ss_info_dassert(buffer->next == NULL, "Old buffer's next pointer should be NULL");
|
|
ss_info_dassert(newbuf->next == NULL, "New buffer's next pointer should be NULL");
|
|
|
|
/** Bad parameter tests */
|
|
GWBUF* ptr = NULL;
|
|
ss_info_dassert(gwbuf_split(NULL, 0) == NULL, "gwbuf_split with NULL parameter should return NULL");
|
|
ss_info_dassert(gwbuf_split(&ptr, 0) == NULL, "gwbuf_split with pointer to a NULL value should return NULL");
|
|
buffer = gwbuf_alloc(10);
|
|
ss_info_dassert(gwbuf_split(&buffer, 0) == NULL, "gwbuf_split with length of 0 should return NULL");
|
|
ss_info_dassert(gwbuf_length(buffer) == 10, "Buffer should be 10 bytes");
|
|
gwbuf_free(buffer);
|
|
gwbuf_free(newbuf);
|
|
|
|
/** Splitting near buffer boudaries */
|
|
for (int i = 0; i < n_buffers - 1; i++)
|
|
{
|
|
split_buffer(i, -1);
|
|
split_buffer(i, 0);
|
|
split_buffer(i, 1);
|
|
}
|
|
|
|
/** Split near last buffer's end */
|
|
split_buffer(n_buffers - 1, -1);
|
|
}
|
|
|
|
/** gwbuf_alloc_and_load and gwbuf_copy_data tests */
|
|
void test_load_and_copy()
|
|
{
|
|
uint8_t data[] = {1, 2, 3, 4, 5, 6, 7, 8};
|
|
uint8_t dest[8];
|
|
GWBUF* head = gwbuf_alloc_and_load(4, data);
|
|
GWBUF* tail = gwbuf_alloc_and_load(4, data + 4);
|
|
|
|
ss_info_dassert(memcmp(GWBUF_DATA(head), data, 4) == 0, "Loading 4 bytes should succeed");
|
|
ss_info_dassert(memcmp(GWBUF_DATA(tail), data + 4, 4) == 0, "Loading 4 bytes should succeed");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 0, 4, dest) == 4, "Copying 4 bytes should succeed");
|
|
ss_info_dassert(memcmp(dest, data, 4) == 0, "Copied data should be from 1 to 4");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(tail, 0, 4, dest) == 4, "Copying 4 bytes should succeed");
|
|
ss_info_dassert(memcmp(dest, data + 4, 4) == 0, "Copied data should be from 5 to 8");
|
|
head = gwbuf_append(head, tail);
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 0, 8, dest) == 8, "Copying 8 bytes should succeed");
|
|
ss_info_dassert(memcmp(dest, data, 8) == 0, "Copied data should be from 1 to 8");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 4, 4, dest) == 4, "Copying 4 bytes at offset 4 should succeed");
|
|
ss_info_dassert(memcmp(dest, data + 4, 4) == 0, "Copied data should be from 5 to 8");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 2, 4, dest) == 4, "Copying 4 bytes at offset 2 should succeed");
|
|
ss_info_dassert(memcmp(dest, data + 2, 4) == 0, "Copied data should be from 5 to 8");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 0, 10, dest) == 8, "Copying 10 bytes should only copy 8 bytes");
|
|
ss_info_dassert(memcmp(dest, data, 8) == 0, "Copied data should be from 1 to 8");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 0, 0, dest) == 0, "Copying 0 bytes should not copy any bytes");
|
|
|
|
memset(dest, 0, sizeof(dest));
|
|
ss_info_dassert(gwbuf_copy_data(head, 0, -1, dest) == sizeof(data),
|
|
"Copying -1 bytes should copy all available data (cast to unsigned)");
|
|
ss_info_dassert(memcmp(dest, data, 8) == 0, "Copied data should be from 1 to 8");
|
|
|
|
ss_info_dassert(gwbuf_copy_data(head, -1, -1, dest) == 0,
|
|
"Copying -1 bytes at an offset of -1 should not copy any bytes");
|
|
ss_info_dassert(gwbuf_copy_data(head, -1, 0, dest) == 0,
|
|
"Copying 0 bytes at an offset of -1 should not copy any bytes");
|
|
gwbuf_free(head);
|
|
|
|
/** Copying near buffer boudaries */
|
|
for (int i = 0; i < n_buffers - 1; i++)
|
|
{
|
|
copy_buffer(i, -1);
|
|
copy_buffer(i, 0);
|
|
copy_buffer(i, 1);
|
|
}
|
|
|
|
/** Copy near last buffer's end */
|
|
copy_buffer(n_buffers - 1, -1);
|
|
}
|
|
|
|
void test_consume()
|
|
{
|
|
uint8_t data[] = {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
|
|
GWBUF* buffer = gwbuf_append(gwbuf_alloc_and_load(5, data),
|
|
gwbuf_alloc_and_load(5, data + 5));
|
|
|
|
ss_info_dassert(gwbuf_consume(buffer, 0) == buffer,
|
|
"Consuming 0 bytes from a buffer should return original buffer");
|
|
ss_info_dassert(gwbuf_length(buffer) == 10, "Buffer should be 10 bytes after consuming 0 bytes");
|
|
|
|
buffer = gwbuf_consume(buffer, 1);
|
|
ss_info_dassert(GWBUF_LENGTH(buffer) == 4, "First buffer should be 4 bytes long");
|
|
ss_info_dassert(buffer->next, "Buffer should have next pointer set");
|
|
ss_info_dassert(GWBUF_LENGTH(buffer->next) == 5, "Next buffer should be 5 bytes long");
|
|
ss_info_dassert(gwbuf_length(buffer) == 9, "Buffer should be 9 bytes after consuming 1 bytes");
|
|
ss_info_dassert(*((uint8_t*)buffer->start) == 2, "First byte should be 2");
|
|
|
|
buffer = gwbuf_consume(buffer, 5);
|
|
ss_info_dassert(buffer->next == NULL, "Buffer should not have the next pointer set");
|
|
ss_info_dassert(GWBUF_LENGTH(buffer) == 4, "Buffer should be 4 bytes after consuming 6 bytes");
|
|
ss_info_dassert(gwbuf_length(buffer) == 4, "Buffer should be 4 bytes after consuming 6 bytes");
|
|
ss_info_dassert(*((uint8_t*)buffer->start) == 7, "First byte should be 7");
|
|
ss_info_dassert(gwbuf_consume(buffer, 4) == NULL, "Consuming all bytes should return NULL");
|
|
|
|
buffer = gwbuf_append(gwbuf_alloc_and_load(5, data),
|
|
gwbuf_alloc_and_load(5, data + 5));
|
|
ss_info_dassert(gwbuf_consume(buffer, 100) == NULL,
|
|
"Consuming more bytes than are available should return NULL");
|
|
|
|
|
|
/** Consuming near buffer boudaries */
|
|
for (int i = 0; i < n_buffers - 1; i++)
|
|
{
|
|
consume_buffer(i, -1);
|
|
consume_buffer(i, 0);
|
|
consume_buffer(i, 1);
|
|
}
|
|
|
|
/** Consume near last buffer's end */
|
|
consume_buffer(n_buffers - 1, -1);
|
|
}
|
|
|
|
/**
|
|
* test1 Allocate a buffer and do lots of things
|
|
*
|
|
*/
|
|
static int
|
|
test1()
|
|
{
|
|
GWBUF *buffer, *extra, *clone, *partclone, *transform;
|
|
HINT *hint;
|
|
int size = 100;
|
|
int bite1 = 35;
|
|
int bite2 = 60;
|
|
int bite3 = 10;
|
|
int buflen;
|
|
|
|
/* Single buffer tests */
|
|
ss_dfprintf(stderr,
|
|
"testbuffer : creating buffer with data size %d bytes",
|
|
size);
|
|
buffer = gwbuf_alloc(size);
|
|
ss_dfprintf(stderr, "\t..done\nAllocated buffer of size %d.", size);
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "\nBuffer length is now %d", buflen);
|
|
ss_info_dassert(size == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(0 == GWBUF_EMPTY(buffer), "Buffer should not be empty");
|
|
ss_info_dassert(GWBUF_IS_TYPE_UNDEFINED(buffer), "Buffer type should be undefined");
|
|
ss_dfprintf(stderr, "\t..done\nSet a hint for the buffer");
|
|
hint = hint_create_parameter(NULL, "name", "value");
|
|
gwbuf_add_hint(buffer, hint);
|
|
ss_info_dassert(hint == buffer->hint, "Buffer should point to first and only hint");
|
|
ss_dfprintf(stderr, "\t..done\nSet a property for the buffer");
|
|
gwbuf_add_property(buffer, "name", "value");
|
|
ss_info_dassert(0 == strcmp("value", gwbuf_get_property(buffer, "name")), "Should now have correct property");
|
|
strcpy(GWBUF_DATA(buffer), "The quick brown fox jumps over the lazy dog");
|
|
ss_dfprintf(stderr, "\t..done\nLoad some data into the buffer");
|
|
ss_info_dassert('q' == GWBUF_DATA_CHAR(buffer, 4), "Fourth character of buffer must be 'q'");
|
|
ss_info_dassert(-1 == GWBUF_DATA_CHAR(buffer, 105), "Hundred and fifth character of buffer must return -1");
|
|
ss_info_dassert(0 == GWBUF_IS_SQL(buffer), "Must say buffer is not SQL, as it does not have marker");
|
|
strcpy(GWBUF_DATA(buffer), "1234\x03SELECT * FROM sometable");
|
|
ss_dfprintf(stderr, "\t..done\nLoad SQL data into the buffer");
|
|
ss_info_dassert(1 == GWBUF_IS_SQL(buffer), "Must say buffer is SQL, as it does have marker");
|
|
transform = gwbuf_clone_transform(buffer, GWBUF_TYPE_PLAINSQL);
|
|
ss_dfprintf(stderr, "\t..done\nAttempt to transform buffer to plain SQL - should fail");
|
|
ss_info_dassert(NULL == transform, "Buffer cannot be transformed to plain SQL");
|
|
gwbuf_set_type(buffer, GWBUF_TYPE_MYSQL);
|
|
ss_dfprintf(stderr, "\t..done\nChanged buffer type to MySQL");
|
|
ss_info_dassert(GWBUF_IS_TYPE_MYSQL(buffer), "Buffer type changed to MySQL");
|
|
transform = gwbuf_clone_transform(buffer, GWBUF_TYPE_PLAINSQL);
|
|
ss_dfprintf(stderr, "\t..done\nAttempt to transform buffer to plain SQL - should succeed");
|
|
ss_info_dassert((NULL != transform) &&
|
|
(GWBUF_IS_TYPE_PLAINSQL(transform)), "Transformed buffer is plain SQL");
|
|
clone = gwbuf_clone(buffer);
|
|
ss_dfprintf(stderr, "\t..done\nCloned buffer");
|
|
buflen = GWBUF_LENGTH(clone);
|
|
ss_dfprintf(stderr, "\nCloned buffer length is now %d", buflen);
|
|
ss_info_dassert(size == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(0 == GWBUF_EMPTY(clone), "Cloned buffer should not be empty");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
gwbuf_free(clone);
|
|
ss_dfprintf(stderr, "Freed cloned buffer");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
partclone = gwbuf_clone_portion(buffer, 25, 50);
|
|
buflen = GWBUF_LENGTH(partclone);
|
|
ss_dfprintf(stderr, "Part cloned buffer length is now %d", buflen);
|
|
ss_info_dassert(50 == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(0 == GWBUF_EMPTY(partclone), "Part cloned buffer should not be empty");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
gwbuf_free(partclone);
|
|
ss_dfprintf(stderr, "Freed part cloned buffer");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
buffer = gwbuf_consume(buffer, bite1);
|
|
ss_info_dassert(NULL != buffer, "Buffer should not be null");
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "Consumed %d bytes, now have %d, should have %d", bite1, buflen, size - bite1);
|
|
ss_info_dassert((size - bite1) == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(0 == GWBUF_EMPTY(buffer), "Buffer should not be empty");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
buffer = gwbuf_consume(buffer, bite2);
|
|
ss_info_dassert(NULL != buffer, "Buffer should not be null");
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "Consumed %d bytes, now have %d, should have %d", bite2, buflen, size - bite1 - bite2);
|
|
ss_info_dassert((size - bite1 - bite2) == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(0 == GWBUF_EMPTY(buffer), "Buffer should not be empty");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
buffer = gwbuf_consume(buffer, bite3);
|
|
ss_dfprintf(stderr, "Consumed %d bytes, should have null buffer", bite3);
|
|
ss_info_dassert(NULL == buffer, "Buffer should be null");
|
|
|
|
/* Buffer list tests */
|
|
size = 100000;
|
|
buffer = gwbuf_alloc(size);
|
|
ss_dfprintf(stderr, "\t..done\nAllocated buffer of size %d.", size);
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "\nBuffer length is now %d", buflen);
|
|
ss_info_dassert(size == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(0 == GWBUF_EMPTY(buffer), "Buffer should not be empty");
|
|
ss_info_dassert(GWBUF_IS_TYPE_UNDEFINED(buffer), "Buffer type should be undefined");
|
|
extra = gwbuf_alloc(size);
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "\t..done\nAllocated extra buffer of size %d.", size);
|
|
ss_info_dassert(size == buflen, "Incorrect buffer size");
|
|
buffer = gwbuf_append(buffer, extra);
|
|
buflen = gwbuf_length(buffer);
|
|
ss_dfprintf(stderr, "\t..done\nAppended extra buffer to original buffer to create list of size %d", buflen);
|
|
ss_info_dassert((size * 2) == gwbuf_length(buffer), "Incorrect size for set of buffers");
|
|
buffer = gwbuf_rtrim(buffer, 60000);
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "\t..done\nTrimmed 60 bytes from buffer, now size is %d.", buflen);
|
|
ss_info_dassert((size - 60000) == buflen, "Incorrect buffer size");
|
|
buffer = gwbuf_rtrim(buffer, 60000);
|
|
buflen = GWBUF_LENGTH(buffer);
|
|
ss_dfprintf(stderr, "\t..done\nTrimmed another 60 bytes from buffer, now size is %d.", buflen);
|
|
ss_info_dassert(100000 == buflen, "Incorrect buffer size");
|
|
ss_info_dassert(buffer == extra, "The buffer pointer should now point to the extra buffer");
|
|
ss_dfprintf(stderr, "\t..done\n");
|
|
|
|
/** gwbuf_clone_all test */
|
|
size_t headsize = 10;
|
|
GWBUF* head = gwbuf_alloc(headsize);
|
|
size_t tailsize = 20;
|
|
GWBUF* tail = gwbuf_alloc(tailsize);
|
|
|
|
ss_info_dassert(head && tail, "Head and tail buffers should both be non-NULL");
|
|
GWBUF* append = gwbuf_append(head, tail);
|
|
ss_info_dassert(append == head, "gwbuf_append should return head");
|
|
ss_info_dassert(append->next == tail, "After append tail should be in the next pointer of head");
|
|
ss_info_dassert(append->tail == tail, "After append tail should be in the tail pointer of head");
|
|
GWBUF* all_clones = gwbuf_clone_all(head);
|
|
ss_info_dassert(all_clones && all_clones->next, "Cloning all should work");
|
|
ss_info_dassert(GWBUF_LENGTH(all_clones) == headsize, "First buffer should be 10 bytes");
|
|
ss_info_dassert(GWBUF_LENGTH(all_clones->next) == tailsize, "Second buffer should be 20 bytes");
|
|
ss_info_dassert(gwbuf_length(all_clones) == headsize + tailsize, "Total buffer length should be 30 bytes");
|
|
|
|
test_split();
|
|
test_load_and_copy();
|
|
test_consume();
|
|
|
|
return 0;
|
|
}
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int result = 0;
|
|
|
|
result += test1();
|
|
|
|
exit(result);
|
|
}
|
|
|
|
|