mirror of
https://github.com/krgamestudios/Toy.git
synced 2026-04-15 14:54:07 +10:00
Kayne Ruse
4bcf8e84a9
Strings, due to their potentially large size, are stored outside of a routine's code section, in the data section. To access the correct string, you must read the jump index, then the real address from the jump table - and extra layer of indirection will result in more flexible data down the road, I hope. Other changes include: * Added string concat operator .. * Added TOY_STRING_MAX_LENGTH * Strings can't be created or concatenated longer than the max length * The parser will display a warning if the bucket is too small for a string at max length, but it will continue * Added TOY_BUCKET_IDEAL to correspend with max string length * The bucket now allocates an address that is 4-byte aligned * Fixed missing entries in the parser rule table * Corrected some failing TOY_BITNESS tests
90 lines
2.3 KiB
C
90 lines
2.3 KiB
C
#include "toy_bucket.h"
|
|
#include "toy_console_colors.h"
|
|
|
|
#include <stdio.h>
|
|
|
|
int test_buckets() {
|
|
//test initializing and freeing a bucket
|
|
{
|
|
//init
|
|
Toy_Bucket* bucket = Toy_allocateBucket(sizeof(int) * 32);
|
|
|
|
//check
|
|
if (bucket == NULL || bucket->capacity != 32 * sizeof(int)) {
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to initialize 'Toy_Bucket'\n" TOY_CC_RESET);
|
|
return -1;
|
|
}
|
|
|
|
//cleanup
|
|
Toy_freeBucket(&bucket);
|
|
}
|
|
|
|
//test partitioning a bucket, several times
|
|
{
|
|
//init
|
|
Toy_Bucket* bucket = Toy_allocateBucket(sizeof(int) * 32);
|
|
|
|
//grab some memory
|
|
int* a = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* b = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* c = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* d = Toy_partitionBucket(&bucket, sizeof(int));
|
|
|
|
//check
|
|
if (bucket == NULL || bucket->count != 4 * sizeof(int)) {
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to partition 'Toy_Bucket' correctly: count is %d, expected %d\n" TOY_CC_RESET, (int)(bucket->count), (int)(4*sizeof(int)));
|
|
return -1;
|
|
}
|
|
|
|
//cleanup
|
|
Toy_freeBucket(&bucket);
|
|
}
|
|
|
|
//test partitioning a bucket, several times, with an internal expansion
|
|
{
|
|
//init
|
|
Toy_Bucket* bucket = Toy_allocateBucket(sizeof(int) * 4);
|
|
|
|
//grab some memory
|
|
int* a = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* b = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* c = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* d = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* e = Toy_partitionBucket(&bucket, sizeof(int));
|
|
int* f = Toy_partitionBucket(&bucket, sizeof(int));
|
|
|
|
//checks - please note that the top-most bucket is what is being filled - older buckets are further along
|
|
if (
|
|
bucket->capacity != 4 * sizeof(int) ||
|
|
bucket->count != 2 * sizeof(int) ||
|
|
bucket->next == NULL ||
|
|
bucket->next->capacity != 4 * sizeof(int) ||
|
|
bucket->next->count != 4 * sizeof(int))
|
|
{
|
|
fprintf(stderr, TOY_CC_ERROR "ERROR: failed to expand 'Toy_Bucket' correctly\n" TOY_CC_RESET);
|
|
return -1;
|
|
}
|
|
|
|
//cleanup
|
|
Toy_freeBucket(&bucket);
|
|
}
|
|
|
|
return 0;
|
|
}
|
|
|
|
int main() {
|
|
//run each test set, returning the total errors given
|
|
int total = 0, res = 0;
|
|
|
|
{
|
|
res = test_buckets();
|
|
total += res;
|
|
|
|
if (res == 0) {
|
|
printf(TOY_CC_NOTICE "All good\n" TOY_CC_RESET);
|
|
}
|
|
}
|
|
|
|
return total;
|
|
}
|