message_set_test.c

Go to the documentation of this file.

/*
 * message_set_test.c   Tests for message sets
 *
 * Version:     $Id: ad2272f781d674ebb18581b236d1048e7b4fd85d $
 *
 *   This program is free software; you can redistribute it and/or modify
 *   it under the terms of the GNU General Public License as published by
 *   the Free Software Foundation; either version 2 of the License, or
 *   (at your option) any later version.
 *
 *   This program is distributed in the hope that it will be useful,
 *   but WITHOUT ANY WARRANTY; without even the implied warranty of
 *   MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
 *   GNU General Public License for more details.
 *
 *   You should have received a copy of the GNU General Public License
 *   along with this program; if not, write to the Free Software
 *   Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301, USA
 *
 * @copyright 2016 Alan DeKok (aland@freeradius.org)
 */
 
RCSID("$Id: ad2272f781d674ebb18581b236d1048e7b4fd85d $")
 
#include <freeradius-devel/io/message.h>
#include <freeradius-devel/util/debug.h>
#include <freeradius-devel/util/hash.h>
#include <freeradius-devel/util/syserror.h>
#include <freeradius-devel/util/talloc.h>
 
#include <string.h>
#include <sys/time.h>
 
#ifdef HAVE_GETOPT_H
#  include <getopt.h>
#endif
 
#define MPRINT1 if (debug_lvl) printf
#define MPRINT2 if (debug_lvl > 1) printf
 
#define ALLOC_SIZE (8)
#define ARRAY_SIZE (4 * ALLOC_SIZE)
#define MY_ARRAY_SIZE (16 * ARRAY_SIZE)
 
typedef struct {
        fr_message_t    m;
        int             foo;
        int             bar;
} fr_test_t;
 
static size_t           used = 0;
static size_t           array[MY_ARRAY_SIZE];
static fr_test_t        *messages[MY_ARRAY_SIZE];
static int              my_alloc_size = ALLOC_SIZE;
 
static int              debug_lvl = 0;
static bool             touch_memory = false;
 
static char const       *seed_string = "foo";
static size_t           seed_string_len = 3;
 
static size_t           reserve_size = 2048;
static size_t           allocation_mask = 0x3ff;
 
/**********************************************************************/
typedef struct request_s request_t;
request_t *request_alloc(UNUSED TALLOC_CTX *ctx, UNUSED request_init_args_t const *args);
void request_verify(UNUSED char const *file, UNUSED int line, UNUSED request_t *request);
 
request_t *request_alloc(UNUSED TALLOC_CTX *ctx, UNUSED request_init_args_t const *args)
{
        return NULL;
}
 
void request_verify(UNUSED char const *file, UNUSED int line, UNUSED request_t *request)
{
}
 
/**********************************************************************/
 
 
static void  alloc_blocks(fr_message_set_t *ms, uint32_t *seed, UNUSED int *start, int *end)
{
        int i;
        uint32_t hash;
 
        /*
         *      We can't allocated the entire array, and we can't
         *      over-fill the array.
         */
        fr_assert((size_t) my_alloc_size < MY_ARRAY_SIZE);
 
        MPRINT2("BLOCK ALLOC %d\n", my_alloc_size);
 
        for (i = 0; i < my_alloc_size; i++) {
                int index;
                fr_message_t *m;
 
                index = (*end + i) & (MY_ARRAY_SIZE - 1);
 
                hash = fr_hash_update(seed_string, seed_string_len, *seed);
                *seed = hash;
 
                hash &= allocation_mask;
                hash++;                 /* can't have it zero... */
 
                array[index] = hash;
 
                m = fr_message_reserve(ms, reserve_size);
                fr_assert(m != NULL);
 
                messages[index] = (fr_test_t *) fr_message_alloc(ms, m, hash);
                fr_assert(messages[index] == (void *) m);
 
                if (touch_memory) {
                        size_t j;
                        size_t k = 0;
 
                        for (j = 0; j < m->data_size; j++) {
                                k += m->data[j];
                        }
 
                        m->data[0] = k;
                }
 
                if (debug_lvl > 1) printf("%08x\t", hash);
 
                fr_assert(m->status == FR_MESSAGE_USED);
 
                used += hash;
//              fr_assert(fr_ring_buffer_used(rb) == used);
        }
 
        *end += my_alloc_size;
}
 
static void  free_blocks(UNUSED fr_message_set_t *ms, UNUSED uint32_t *seed, int *start, int *end)
{
        int i;
 
        fr_assert(my_alloc_size < MY_ARRAY_SIZE);
 
        MPRINT2("BLOCK FREE %d\n", my_alloc_size);
 
        for (i = 0; i < my_alloc_size; i++) {
                int index;
                int ret;
                fr_message_t *m;
 
                index = (*start + i) & (MY_ARRAY_SIZE - 1);
 
                m = &messages[index]->m;
 
                fr_assert(m->status == FR_MESSAGE_USED);
 
                ret = fr_message_done(m);
#ifndef NDEBUG
                fr_assert(ret == 0);
#else
                if (ret != 0) fr_exit_now(EXIT_FAILURE);
#endif
 
                used -= array[index];
 
                array[index] = 0;
                messages[index] = NULL;
        }
 
        *start += my_alloc_size;
        if (*start > MY_ARRAY_SIZE) {
                *start -= MY_ARRAY_SIZE;
                *end -= MY_ARRAY_SIZE;
                fr_assert(*start <= *end);
                fr_assert(*start < MY_ARRAY_SIZE);
        }
}
 
static NEVER_RETURNS void usage(void)
{
        fprintf(stderr, "usage: message_set_test [OPTS]\n");
        fprintf(stderr, "  -s <string>            Set random seed to <string>.\n");
        fprintf(stderr, "  -t                     Touch 'packet' memory.\n");
        fprintf(stderr, "  -x                     Debugging mode.\n");
 
        fr_exit_now(EXIT_SUCCESS);
}
 
int main(int argc, char *argv[])
{
        int                     c;
        int                     i, start, end, ret;
        fr_message_set_t        *ms;
        uint32_t                seed;
 
        TALLOC_CTX              *autofree = talloc_autofree_context();
 
        memset(array, 0, sizeof(array));
        memset(messages, 0, sizeof(messages));
 
        while ((c = getopt(argc, argv, "hs:tx")) != -1) switch (c) {
                case 's':
                        seed_string = optarg;
                        seed_string_len = strlen(optarg);
                        break;
 
                case 't':
                        touch_memory = true;
                        break;
 
                case 'x':
                        debug_lvl++;
                        break;
 
                case 'h':
                default:
                        usage();
        }
#if 0
        argc -= (optind - 1);
        argv += (optind - 1);
#endif
 
        ms = fr_message_set_create(autofree, ARRAY_SIZE, sizeof(fr_message_t), ARRAY_SIZE * 1024);
        if (!ms) {
                fprintf(stderr, "Failed creating message set\n");
                fr_exit_now(EXIT_FAILURE);
        }
 
        seed = 0xabcdef;
        start = 0;
        end = 0;
        my_alloc_size = ALLOC_SIZE;
 
        /*
         *      Allocate the first set of blocks.
         */
        alloc_blocks(ms, &seed, &start, &end);
 
        /*
         *      Do 1000 rounds of alloc / free.
         */
        for (i = 0; i < 4; i++) {
                MPRINT2("Loop %d (used %zu) \n", i, used);
                alloc_blocks(ms, &seed, &start, &end);
 
                free_blocks(ms, &seed, &start, &end);
        }
 
        MPRINT1("TEST 1 used %d (%zu)\n", fr_message_set_messages_used(ms), used);
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
 
        /*
         *      Double the size of the allocations
         */
        reserve_size <<= 1;
 
        allocation_mask <<= 1;
        allocation_mask |= 1;
 
        /*
         *      Do another 1000 rounds of alloc / free.
         */
        for (i = 0; i < 1000; i++) {
                MPRINT2("Second loop %d (used %zu) \n", i, used);
                alloc_blocks(ms, &seed, &start, &end);
 
                free_blocks(ms, &seed, &start, &end);
        }
 
        MPRINT1("TEST 2 used %d\n", fr_message_set_messages_used(ms));
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
        /*
         *      Double the size of the allocations
         */
        reserve_size <<= 1;
 
        allocation_mask <<= 1;
        allocation_mask |= 1;
 
        /*
         *      Do another 1000 rounds of alloc / free.
         */
        for (i = 0; i < 1000; i++) {
                MPRINT2("Third loop %d (used %zu) \n", i, used);
                alloc_blocks(ms, &seed, &start, &end);
 
                free_blocks(ms, &seed, &start, &end);
        }
 
        /*
         *      Double the number of the allocations,
         *      but decrease the allocation size back to 1K
         */
        my_alloc_size *= 2;
        reserve_size = 2048;
        allocation_mask = (reserve_size - 1) >> 1;
 
        MPRINT1("TEST 3 used %d\n", fr_message_set_messages_used(ms));
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
 
        /*
         *      Do another 1000 rounds of alloc / free.
         */
        for (i = 0; i < 1000; i++) {
                MPRINT2("Fourth loop %d (used %zu) \n", i, used);
                alloc_blocks(ms, &seed, &start, &end);
 
                free_blocks(ms, &seed, &start, &end);
        }
 
        MPRINT1("TEST 4 used %d\n", fr_message_set_messages_used(ms));
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
 
#if 0
 
        /*
         *      Double the number of the allocations again,
         *      leaving the allocation size alone.
         */
        my_alloc_size *= 2;
 
        /*
         *      Do another 10000 rounds of alloc / free.
         */
        for (i = 0; i < 10000; i++) {
                MPRINT2("fifth loop %d (used %zu) \n", i, used);
                alloc_blocks(ms, &seed, &start, &end);
 
                free_blocks(ms, &seed, &start, &end);
        }
 
        MPRINT1("TEST 5 used %d\n", fr_message_set_messages_used(ms));
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
 
        /*
         *      Double the number of the allocations again,
         *      leaving the allocation size alone.
         */
        my_alloc_size *= 2;
 
        /*
         *      Do another 10000 rounds of alloc / free.
         */
        for (i = 0; i < 10000; i++) {
                MPRINT2("sixth loop %d (used %zu) \n", i, used);
                alloc_blocks(ms, &seed, &start, &end);
 
                free_blocks(ms, &seed, &start, &end);
        }
 
        MPRINT1("TEST 6 used %d\n", fr_message_set_messages_used(ms));
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
#endif
 
        my_alloc_size = end - start;
        free_blocks(ms, &seed, &start, &end);
 
        fr_assert(used == 0);
 
        for (i = 0; i < MY_ARRAY_SIZE; i++) {
                fr_assert(messages[i] == NULL);
        }
 
        if (debug_lvl) {
                fr_time_t start_t, end_t;
 
                start_t = fr_time();
 
                /*
                 *      Do another 10000 rounds of alloc / free.
                 */
                my_alloc_size = 100;
 
                for (i = 0; i < 10000; i++) {
                        alloc_blocks(ms, &seed, &start, &end);
 
                        free_blocks(ms, &seed, &start, &end);
                }
 
                end_t = fr_time();
 
                printf("\nELAPSED %d.%06d seconds, %d allocation / free cycles\n\n",
                       (int) (end_t - start_t) / NSEC, (int) ((end_t - start_t) % NSEC),
                       my_alloc_size * 10000);
        }
 
        /*
         *      Force all messages to be garbage collected
         */
        MPRINT1("GC\n");
        fr_message_set_gc(ms);
 
        if (debug_lvl) fr_message_set_debug(ms, stdout);
 
        /*
         *      After the garbage collection, all messages marked "done" MUST also be marked "free".
         */
        ret = fr_message_set_messages_used(ms);
        fr_assert(ret == 0);
 
        return ret;
}