HomeSort by relevance Sort by last modified time
    Searched refs:l1_size (Results 1 - 7 of 7) sorted by null

  /external/qemu/block/
qcow2-snapshot.c 33 uint32_t l1_size; member in struct:QCowSnapshotHeader
87 sn->l1_size = be32_to_cpu(h.l1_size);
150 h.l1_size = cpu_to_be32(sn->l1_size);
265 ret = qcow2_update_snapshot_refcount(bs, s->l1_table_offset, s->l1_size, 1);
270 l1_table_offset = qcow2_alloc_clusters(bs, s->l1_size * sizeof(uint64_t));
276 sn->l1_size = s->l1_size;
278 if (s->l1_size != 0)
    [all...]
qcow2.h 62 uint32_t l1_size; /* XXX: save number of clusters instead ? */ member in struct:QCowHeader
72 uint32_t l1_size; member in struct:QCowSnapshot
88 int l1_size; member in struct:BDRVQcowState
186 int64_t l1_table_offset, int l1_size, int addend);
vmdk.c 69 unsigned int l1_size; member in struct:BDRVVmdkState
366 int l1_size, i; local
379 s->l1_size = 1 << 6;
395 s->l1_size = (bs->total_sectors + s->l1_entry_sectors - 1)
410 l1_size = s->l1_size * sizeof(uint32_t);
411 s->l1_table = qemu_malloc(l1_size);
412 if (bdrv_pread(bs->file, s->l1_table_offset, s->l1_table, l1_size) != l1_size)
414 for(i = 0; i < s->l1_size; i++)
    [all...]
qcow2-refcount.c 746 int64_t l1_table_offset, int l1_size, int addend)
758 l1_size2 = l1_size * sizeof(uint64_t);
769 for(i = 0;i < l1_size; i++)
772 assert(l1_size == s->l1_size);
780 for(i = 0; i < l1_size; i++) {
851 for(i = 0; i < l1_size; i++)
856 for(i = 0; i < l1_size; i++)
    [all...]
qcow2.c 156 be32_to_cpus(&header.l1_size);
189 s->l1_size = header.l1_size;
193 if (s->l1_size < s->l1_vm_state_index)
196 if (s->l1_size > 0) {
198 align_offset(s->l1_size * sizeof(uint64_t), 512));
199 if (bdrv_pread(bs->file, s->l1_table_offset, s->l1_table, s->l1_size * sizeof(uint64_t)) !=
200 s->l1_size * sizeof(uint64_t))
202 for(i = 0;i < s->l1_size; i++) {
850 int fd, header_size, backing_filename_len, l1_size, i, shift, l2_bits local
    [all...]
qcow.c 63 int l1_size; member in struct:BDRVQcowState
129 s->l1_size = (header.size + (1LL << shift) - 1) >> shift;
132 s->l1_table = qemu_malloc(s->l1_size * sizeof(uint64_t));
135 if (bdrv_pread(bs->file, s->l1_table_offset, s->l1_table, s->l1_size * sizeof(uint64_t)) !=
136 s->l1_size * sizeof(uint64_t))
138 for(i = 0;i < s->l1_size; i++) {
744 int fd, header_size, backing_filename_len, l1_size, i, shift; local
792 l1_size = ((total_size * 512) + (1LL << shift) - 1) >> shift;
818 for(i = 0;i < l1_size; i++) {
835 uint32_t l1_length = s->l1_size * sizeof(uint64_t)
    [all...]
qcow2-cluster.c 39 new_l1_size = s->l1_size;
49 printf("grow l1_table from %d to %d\n", s->l1_size, new_l1_size);
54 memcpy(new_l1_table, s->l1_table, s->l1_size * sizeof(uint64_t));
65 for(i = 0; i < s->l1_size; i++)
70 for(i = 0; i < s->l1_size; i++)
77 ret = bdrv_pwrite_sync(bs->file, offsetof(QCowHeader, l1_size), data,sizeof(data));
82 qcow2_free_clusters(bs, s->l1_table_offset, s->l1_size * sizeof(uint64_t));
85 s->l1_size = new_l1_size;
475 if (l1_index >= s->l1_size)
544 if (l1_index >= s->l1_size) {
    [all...]

Completed in 66 milliseconds