Commit d06ebd93 authored by Marko Mäkelä's avatar Marko Mäkelä

Remove references to removed dict_sys->size

parent 2565c02c
...@@ -670,8 +670,7 @@ struct dict_v_col_t{ ...@@ -670,8 +670,7 @@ struct dict_v_col_t{
ulint v_pos; ulint v_pos;
/** Virtual index list, and column position in the index, /** Virtual index list, and column position in the index,
the allocated memory is not from table->heap, nor it is the allocated memory is not from table->heap */
tracked by dict_sys->size */
dict_v_idx_list* v_indexes; dict_v_idx_list* v_indexes;
}; };
...@@ -1418,15 +1417,7 @@ struct dict_table_t { ...@@ -1418,15 +1417,7 @@ struct dict_table_t {
/** Hash chain node. */ /** Hash chain node. */
hash_node_t name_hash; hash_node_t name_hash;
/** Memory heap. If you allocate from this heap after the table has /** Memory heap */
been created then be sure to account the allocation into
dict_sys->size. When closing the table we do something like
dict_sys->size -= mem_heap_get_size(table->heap) and if that is going
to become negative then we would assert. Something like this should do:
old_size = mem_heap_get_size()
mem_heap_alloc()
new_size = mem_heap_get_size()
dict_sys->size += new_size - old_size. */
mem_heap_t* heap; mem_heap_t* heap;
/** NULL or the directory path specified by DATA DIRECTORY. */ /** NULL or the directory path specified by DATA DIRECTORY. */
......
Markdown is supported
0%
or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment