| 1 |
/*************************************************************************** |
/* SPDX-License-Identifier: GPL-3.0-or-later */ |
| 2 |
test_memory_pool.c - description |
/* |
| 3 |
------------------- |
* test_memory_pool |
| 4 |
copyright : (C) 2004-2025 by Leaflet |
* - tester for memory pool |
| 5 |
email : leaflet@leafok.com |
* |
| 6 |
***************************************************************************/ |
* Copyright (C) 2004-2025 Leaflet <leaflet@leafok.com> |
| 7 |
|
*/ |
|
/*************************************************************************** |
|
|
* * |
|
|
* 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 3 of the License, or * |
|
|
* (at your option) any later version. * |
|
|
* * |
|
|
***************************************************************************/ |
|
| 8 |
|
|
|
#include "memory_pool.h" |
|
| 9 |
#include "log.h" |
#include "log.h" |
| 10 |
|
#include "memory_pool.h" |
| 11 |
#include <stdio.h> |
#include <stdio.h> |
|
#include <unistd.h> |
|
| 12 |
#include <string.h> |
#include <string.h> |
| 13 |
|
#include <unistd.h> |
| 14 |
|
|
| 15 |
#define NODE_SIZE 1023 |
#define NODE_SIZE 1023 |
| 16 |
#define NODE_PER_CHUNK 1000 |
#define NODE_PER_CHUNK 1000 |
| 76 |
{ |
{ |
| 77 |
for (k = (int)sizeof(void *); k < NODE_SIZE; k++) |
for (k = (int)sizeof(void *); k < NODE_SIZE; k++) |
| 78 |
{ |
{ |
| 79 |
if ((*(char *)(p_nodes[i] + k)) != 'A' + j - 1) |
if ((*((char *)p_nodes[i] + k)) != 'A' + j - 1) |
| 80 |
{ |
{ |
| 81 |
printf("Value of node[%d] at offset %d not equal to value set %c\n", |
printf("Value of node[%d] at offset %d not equal to value set %c\n", |
| 82 |
i, k, 'A' + j - 1); |
i, k, 'A' + j - 1); |