42     int                     table_size;  member
51     return (uint8_t *) c->table_array + (size_t) table * c->table_size;  in qcow2_cache_get_table_addr()
57     int idx = table_offset / c->table_size;  in qcow2_cache_get_table_idx()
58     assert(idx >= 0 && idx < c->size && table_offset % c->table_size == 0);  in qcow2_cache_get_table_idx()
80     size_t mem_size = (size_t) c->table_size * num_tables;  in qcow2_cache_table_release()
124                                unsigned table_size)  in qcow2_cache_create()  argument
130     assert(is_power_of_2(table_size));  in qcow2_cache_create()
131     assert(table_size >= (1 << MIN_CLUSTER_BITS));  in qcow2_cache_create()
132     assert(table_size <= s->cluster_size);  in qcow2_cache_create()
136     c->table_size = table_size;  in qcow2_cache_create()
139                                          (size_t) num_tables * c->table_size);  in qcow2_cache_create()
210                 c->entries[i].offset, c->table_size, false);  in qcow2_cache_entry_flush()
213                 c->entries[i].offset, c->table_size, false);  in qcow2_cache_entry_flush()
216                 c->entries[i].offset, c->table_size, false);  in qcow2_cache_entry_flush()
229     ret = bdrv_pwrite(bs->file, c->entries[i].offset, c->table_size,  in qcow2_cache_entry_flush()
339     if (!QEMU_IS_ALIGNED(offset, c->table_size)) {  in qcow2_cache_do_get()
347     i = lookup_index = (offset / c->table_size * 4) % c->size;  in qcow2_cache_do_get()
386         ret = bdrv_pread(bs->file, offset, c->table_size,  in qcow2_cache_do_get()