char * myhtml_string_realloc(mchar_async_t *mchar, size_t node_id, myhtml_string_t *str, size_t new_size)
{
if(str == NULL)
return 0;
char *tmp;
if(str->data) {
tmp = mchar_async_realloc(str->mchar, str->node_idx, str->data, str->length, new_size);
}
else {
tmp = mchar_async_malloc(mchar, node_id, new_size);
str->mchar = mchar;
str->node_idx = node_id;
}
if(tmp) {
str->size = new_size;
str->data = tmp;
}
else
return NULL;
return str->data;
}
myhtml_tag_id_t myhtml_tag_add(myhtml_tag_t* tags, const char* key, size_t key_size,
enum myhtml_tokenizer_state data_parser, bool to_lcase)
{
char* cache = mchar_async_malloc(tags->mchar, tags->mchar_node, (key_size + 1));
if(to_lcase) {
size_t i;
for(i = 0; i < key_size; i++) {
cache[i] = key[i] > 0x40 && key[i] < 0x5b ? (key[i]|0x60) : key[i];
}
cache[i] = '\0';
}
else {
strncpy(cache, key, key_size);
cache[key_size] = '\0';
}
// add tags
myhtml_tag_context_t *tag_ctx = mcsimple_malloc(tags->mcsimple_context);
mctree_insert(tags->tree, cache, key_size, (void *)tag_ctx, NULL);
tag_ctx->id = tags->tags_count;
tag_ctx->name = cache;
tag_ctx->name_length = key_size;
tag_ctx->data_parser = data_parser;
tags->tags_count++;
memset(tag_ctx->cats, 0, sizeof(enum myhtml_tag_categories) * MyHTML_NAMESPACE_LAST_ENTRY);
return tag_ctx->id;
}
/////////////////////////////////////////////////////////
//// Init, Clean, Destroy
////
/////////////////////////////////////////////////////////
char * mycore_string_init(mchar_async_t *mchar, size_t node_idx, mycore_string_t* str, size_t size)
{
str->data = mchar_async_malloc(mchar, node_idx, size);
str->size = size;
str->node_idx = node_idx;
str->mchar = mchar;
mycore_string_clean(str);
return str->data;
}
char * mchar_async_realloc(mchar_async_t *mchar_async, size_t node_idx, char *data, size_t data_len, size_t new_size)
{
if(data == NULL)
return NULL;
size_t curr_size = *((size_t*)(data - sizeof(size_t)));
if(curr_size >= new_size)
return data;
mchar_async_node_t *node = &mchar_async->nodes[node_idx];
if(node->chunk->length >= curr_size &&
&node->chunk->begin[ (node->chunk->length - curr_size) ] == data)
{
size_t next_size = (node->chunk->length - curr_size) + new_size;
if(next_size <= node->chunk->size) {
/* it`s Magic */
*((size_t*)(&node->chunk->begin[ ((node->chunk->length - curr_size) - sizeof(size_t)) ])) = new_size;
node->chunk->length = next_size;
return data;
}
// else {
// size_t re_size = next_size - node->chunk->length;
//
// /* a little Magic ;) */
// *((size_t*)(&node->chunk->begin[ ((node->chunk->length - curr_size) - sizeof(size_t)) ])) = re_size;
//
// curr_size = re_size;
// }
}
char *tmp = mchar_async_malloc(mchar_async, node_idx, new_size);
if(tmp) {
memcpy(tmp, data, sizeof(char) * data_len);
mchar_async_cache_add(&node->cache, data, curr_size);
}
return tmp;
}
/////////////////////////////////////////////////////////
//// Basic API
////
/////////////////////////////////////////////////////////
char * mycore_string_data_alloc(mchar_async_t *mchar, size_t node_id, size_t size)
{
return mchar_async_malloc(mchar, node_id, size);
}
