82 lines
No EOL
1.9 KiB
C
82 lines
No EOL
1.9 KiB
C
#include <stdio.h>
|
|
#include <stdlib.h>
|
|
#include <time.h>
|
|
#include "cutil.h"
|
|
#include "list.h"
|
|
#include "array.h"
|
|
#include "bitmap.h"
|
|
|
|
int main()
|
|
{
|
|
cutil_init();
|
|
printf("[list]\n");
|
|
list_t list;
|
|
list_init(&list);
|
|
|
|
srand(time(NULL));
|
|
for (uint i = 0; i < 5; i++)
|
|
{
|
|
uint num = i;//rand();
|
|
list_add(&list, sizeof(uint), &num);
|
|
}
|
|
list_remove(&list, list_at(&list, 2));
|
|
|
|
CU_LIST_FOREACH(&list)
|
|
{
|
|
printf("%p\t%p\t%p\t%d\n", i->prev, i, i->next,
|
|
LIST_NODE_VALUE(i, uint));
|
|
}
|
|
|
|
list_clear(&list);
|
|
|
|
printf("[array]\n");
|
|
array_t array;
|
|
array_init(&array, sizeof(uint), 2);
|
|
printf("%p\t%d\t%d\t%d\n", array.mem,
|
|
array.size, array.count, array.align);
|
|
|
|
for (uint i = 0; i < 5; i++)
|
|
{
|
|
uint num = i;
|
|
array_push(&array, &i);
|
|
}
|
|
uint num = 42;
|
|
array_remove(&array, 0);
|
|
array_insert(&array, 1, &num);
|
|
|
|
CU_ARRAY_FOREACH(&array)
|
|
{
|
|
uint8_t* ptr = array_at(&array, i);
|
|
printf("%p\t%d\n", ptr, *(uint*)ptr);
|
|
}
|
|
|
|
printf("%p\t%d\t%d\t%d\n", array.mem,
|
|
array.size, array.count, array.align);
|
|
array_clear(&array);
|
|
|
|
printf("[cutypes]\n");
|
|
printf("uword\t%u\n", sizeof(uword) * 8);
|
|
printf("uint\t%u\n", sizeof(uint) * 8);
|
|
|
|
printf("[bitmap]\n");
|
|
printf("bit_align2\t%u\n", bit_align2(354, 3));
|
|
printf("bit_log2\t%u\n", bit_log2(34));
|
|
num = 5;
|
|
bit_set(num, 1, 1);
|
|
printf("bit_get\t%u\n", bit_get(num, 0));
|
|
printf("num\t%u\n", num);
|
|
bitmap(m, 128);
|
|
bitmap_set(m, 0, 1);
|
|
bitmap_set(m, 5, 1);
|
|
bitmap_set(m, 64, 1);
|
|
printf("bitmap\t%u\t%u\n", m[0], m[1]);
|
|
printf("bitmap\t%u\t%u\n", bitmap_get(m, 0), bitmap_get(m, 64));
|
|
bitmap_set(m, 5, 0);
|
|
printf("bitmap\t%u\n", bitmap_get(m, 5));
|
|
|
|
printf("[cutil]\n");
|
|
printf("cutil_arch\t%u\n", cutil_arch());
|
|
|
|
cutil_exit();
|
|
return 0;
|
|
} |