mirror of
https://git.proxmox.com/git/mirror_frr
synced 2025-10-31 18:40:52 +00:00
136 lines
3.0 KiB
C
136 lines
3.0 KiB
C
/*
|
|
* Copyright (c) 2021, LabN Consulting, L.L.C
|
|
*
|
|
* 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; see the file COPYING; if not, write to the Free Software
|
|
* Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
|
|
*/
|
|
|
|
#include <zebra.h>
|
|
#include <skiplist.h>
|
|
|
|
static void sl_debug(struct skiplist *l)
|
|
{
|
|
int i;
|
|
|
|
if (!l)
|
|
return;
|
|
|
|
printf("Skiplist %p has max level %d\n", l, l->level);
|
|
for (i = l->level; i >= 0; --i)
|
|
printf(" @%d: %d\n", i, l->level_stats[i]);
|
|
}
|
|
|
|
static void *scramble(int i)
|
|
{
|
|
uintptr_t result;
|
|
|
|
result = (uintptr_t)(i & 0xff) << 24;
|
|
result |= (uintptr_t)i >> 8;
|
|
|
|
return (void *)result;
|
|
}
|
|
#define sampleSize 65536
|
|
static int sl_test(void)
|
|
{
|
|
struct skiplist *l;
|
|
register int i, k;
|
|
void *keys[sampleSize];
|
|
void *v = NULL;
|
|
int errors = 0;
|
|
|
|
l = skiplist_new(SKIPLIST_FLAG_ALLOW_DUPLICATES, NULL, NULL);
|
|
|
|
printf("%s: skiplist_new returned %p\n", __func__, l);
|
|
|
|
for (i = 0; i < 4; i++) {
|
|
|
|
for (k = 0; k < sampleSize; k++) {
|
|
if (!(k % 10000))
|
|
printf("%s: (%d:%d)\n", __func__, i, k);
|
|
/* keys[k] = (void *)random(); */
|
|
keys[k] = scramble(k);
|
|
if (skiplist_insert(l, keys[k], keys[k])) {
|
|
++errors;
|
|
printf("error in insert #%d,#%d\n", i, k);
|
|
}
|
|
}
|
|
|
|
printf("%s: inserts done\n", __func__);
|
|
sl_debug(l);
|
|
|
|
for (k = 0; k < sampleSize; k++) {
|
|
|
|
if (!(k % 10000))
|
|
printf("[%d:%d]\n", i, k);
|
|
/* keys[k] = (void *)random(); */
|
|
if (skiplist_search(l, keys[k], &v)) {
|
|
++errors;
|
|
printf("error in search #%d,#%d\n", i, k);
|
|
}
|
|
|
|
if (v != keys[k]) {
|
|
++errors;
|
|
printf("search returned wrong value\n");
|
|
}
|
|
}
|
|
printf("%s: searches done\n", __func__);
|
|
|
|
|
|
for (k = 0; k < sampleSize; k++) {
|
|
|
|
if (!(k % 10000))
|
|
printf("<%d:%d>\n", i, k);
|
|
/* keys[k] = (void *)random(); */
|
|
if (skiplist_delete(l, keys[k], keys[k])) {
|
|
++errors;
|
|
printf("error in delete\n");
|
|
}
|
|
keys[k] = scramble(k ^ 0xf0f0f0f0);
|
|
if (skiplist_insert(l, keys[k], keys[k])) {
|
|
++errors;
|
|
printf("error in insert #%d,#%d\n", i, k);
|
|
}
|
|
}
|
|
|
|
printf("%s: del+inserts done\n", __func__);
|
|
sl_debug(l);
|
|
|
|
for (k = 0; k < sampleSize; k++) {
|
|
|
|
if (!(k % 10000))
|
|
printf("{%d:%d}\n", i, k);
|
|
/* keys[k] = (void *)random(); */
|
|
if (skiplist_delete_first(l)) {
|
|
++errors;
|
|
printf("error in delete_first\n");
|
|
}
|
|
}
|
|
}
|
|
|
|
sl_debug(l);
|
|
|
|
skiplist_free(l);
|
|
|
|
return errors;
|
|
}
|
|
|
|
int main(int argc, char **argv)
|
|
{
|
|
int errors = sl_test();
|
|
|
|
if (errors)
|
|
return 1;
|
|
return 0;
|
|
}
|