Archipelago » qemu

QEDTable *qed_alloc_table(BDRVQEDState *s)

{

    /* Honor O_DIRECT memory alignment requirements */

    return qemu_blockalign(s->bs,

                           s->header.cluster_size * s->header.table_size);

}

    s->l1_table = qed_alloc_table(s);

    qed_init_l2_cache(&s->l2_cache);

    ret = qed_read_l1_table_sync(s);

    if (ret) {

        qed_free_l2_cache(&s->l2_cache);

        qemu_vfree(s->l1_table);

    }

    BDRVQEDState *s = bs->opaque;

    qed_free_l2_cache(&s->l2_cache);

    qemu_vfree(s->l1_table);

typedef struct {

    int is_allocated;

    int *pnum;

} QEDIsAllocatedCB;

static void qed_is_allocated_cb(void *opaque, int ret, uint64_t offset, size_t len)

{

    QEDIsAllocatedCB *cb = opaque;

    *cb->pnum = len / BDRV_SECTOR_SIZE;

    cb->is_allocated = ret == QED_CLUSTER_FOUND;

}

    BDRVQEDState *s = bs->opaque;

    uint64_t pos = (uint64_t)sector_num * BDRV_SECTOR_SIZE;

    size_t len = (size_t)nb_sectors * BDRV_SECTOR_SIZE;

    QEDIsAllocatedCB cb = {

        .is_allocated = -1,

        .pnum = pnum,

    };

    QEDRequest request = { .l2_table = NULL };

    async_context_push();

    qed_find_cluster(s, &request, pos, len, qed_is_allocated_cb, &cb);

    while (cb.is_allocated == -1) {

        qemu_aio_wait();

    }

    async_context_pop();

    qed_unref_l2_cache_entry(request.l2_table);

    return cb.is_allocated;