2
0
mirror of https://gitlab.isc.org/isc-projects/bind9 synced 2025-08-27 12:38:24 +00:00
bind/bin/tests/mempool_test.c

120 lines
2.5 KiB
C
Raw Normal View History

1999-06-08 02:37:12 +00:00
/*
* Copyright (C) 1999-2001, 2004, 2007, 2016 Internet Systems Consortium, Inc. ("ISC")
*
* This Source Code Form is subject to the terms of the Mozilla Public
* License, v. 2.0. If a copy of the MPL was not distributed with this
* file, You can obtain one at http://mozilla.org/MPL/2.0/.
1999-06-08 02:37:12 +00:00
*/
2007-06-19 23:47:24 +00:00
/* $Id: mempool_test.c,v 1.17 2007/06/19 23:46:59 tbox Exp $ */
2000-06-22 22:00:42 +00:00
1999-06-08 02:37:12 +00:00
#include <config.h>
#include <isc/mem.h>
2000-04-28 02:12:16 +00:00
#include <isc/util.h>
1999-06-08 02:37:12 +00:00
isc_mem_t *mctx;
int
main(int argc, char *argv[]) {
1999-06-08 02:37:12 +00:00
void *items1[50];
void *items2[50];
void *tmp;
isc_mempool_t *mp1, *mp2;
unsigned int i, j;
1999-09-15 17:47:44 +00:00
isc_mutex_t lock;
1999-06-08 02:37:12 +00:00
UNUSED(argc);
UNUSED(argv);
1999-06-16 21:04:30 +00:00
isc_mem_debugging = ISC_MEM_DEBUGRECORD;
2000-07-26 19:07:36 +00:00
1999-09-15 17:47:44 +00:00
RUNTIME_CHECK(isc_mutex_init(&lock) == ISC_R_SUCCESS);
1999-06-08 02:37:12 +00:00
mctx = NULL;
RUNTIME_CHECK(isc_mem_create(0, 0, &mctx) == ISC_R_SUCCESS);
mp1 = NULL;
RUNTIME_CHECK(isc_mempool_create(mctx, 24, &mp1) == ISC_R_SUCCESS);
mp2 = NULL;
RUNTIME_CHECK(isc_mempool_create(mctx, 31, &mp2) == ISC_R_SUCCESS);
1999-09-15 17:47:44 +00:00
isc_mempool_associatelock(mp1, &lock);
isc_mempool_associatelock(mp2, &lock);
1999-06-08 02:37:12 +00:00
isc_mem_stats(mctx, stderr);
isc_mempool_setfreemax(mp1, 10);
isc_mempool_setfillcount(mp1, 10);
isc_mempool_setmaxalloc(mp1, 30);
/*
* Allocate 30 items from the pool. This is our max.
*/
for (i = 0; i < 30; i++) {
1999-06-08 02:37:12 +00:00
items1[i] = isc_mempool_get(mp1);
RUNTIME_CHECK(items1[i] != NULL);
}
/*
* Try to allocate one more. This should fail.
*/
tmp = isc_mempool_get(mp1);
RUNTIME_CHECK(tmp == NULL);
/*
* Free the first 11 items. Verify that there are 10 free items on
* the free list (which is our max).
*/
for (i = 0; i < 11; i++) {
1999-06-08 02:37:12 +00:00
isc_mempool_put(mp1, items1[i]);
items1[i] = NULL;
}
RUNTIME_CHECK(isc_mempool_getfreecount(mp1) == 10);
RUNTIME_CHECK(isc_mempool_getallocated(mp1) == 19);
isc_mem_stats(mctx, stderr);
/*
* Now, beat up on mp2 for a while. Allocate 50 items, then free
* them, then allocate 50 more, etc.
*/
isc_mempool_setfreemax(mp2, 25);
isc_mempool_setfillcount(mp2, 25);
for (j = 0; j < 5000; j++) {
for (i = 0; i < 50; i++) {
1999-06-08 02:37:12 +00:00
items2[i] = isc_mempool_get(mp2);
RUNTIME_CHECK(items2[i] != NULL);
}
for (i = 0; i < 50; i++) {
1999-06-08 02:37:12 +00:00
isc_mempool_put(mp2, items2[i]);
items2[i] = NULL;
}
}
/*
* Free all the other items and blow away this pool.
*/
for (i = 11; i < 30; i++) {
1999-06-08 02:37:12 +00:00
isc_mempool_put(mp1, items1[i]);
items1[i] = NULL;
}
1999-06-08 02:37:12 +00:00
isc_mempool_destroy(&mp1);
isc_mem_stats(mctx, stderr);
isc_mempool_destroy(&mp2);
isc_mem_stats(mctx, stderr);
isc_mem_destroy(&mctx);
2000-08-30 01:35:42 +00:00
DESTROYLOCK(&lock);
1999-09-15 17:47:44 +00:00
1999-06-08 02:37:12 +00:00
return (0);
}