File tree Expand file tree Collapse file tree 1 file changed +2
-11
lines changed Expand file tree Collapse file tree 1 file changed +2
-11
lines changed Original file line number Diff line number Diff line change @@ -670,8 +670,7 @@ struct dict_v_col_t{
670
670
ulint v_pos;
671
671
672
672
/* * Virtual index list, and column position in the index,
673
- the allocated memory is not from table->heap, nor it is
674
- tracked by dict_sys->size */
673
+ the allocated memory is not from table->heap */
675
674
dict_v_idx_list* v_indexes;
676
675
677
676
};
@@ -1418,15 +1417,7 @@ struct dict_table_t {
1418
1417
/* * Hash chain node. */
1419
1418
hash_node_t name_hash;
1420
1419
1421
- /* * Memory heap. If you allocate from this heap after the table has
1422
- been created then be sure to account the allocation into
1423
- dict_sys->size. When closing the table we do something like
1424
- dict_sys->size -= mem_heap_get_size(table->heap) and if that is going
1425
- to become negative then we would assert. Something like this should do:
1426
- old_size = mem_heap_get_size()
1427
- mem_heap_alloc()
1428
- new_size = mem_heap_get_size()
1429
- dict_sys->size += new_size - old_size. */
1420
+ /* * Memory heap */
1430
1421
mem_heap_t * heap;
1431
1422
1432
1423
/* * NULL or the directory path specified by DATA DIRECTORY. */
You can’t perform that action at this time.
0 commit comments