uint64_t qcow2_alloc_cluster_offset(BlockDriverState *bs,

                                    uint64_t offset,

                                    int n_start, int n_end,

                                    int *num, QCowL2Meta *m)

{

    BDRVQcowState *s = bs->opaque;

    int l2_index, ret;

    uint64_t l2_offset, *l2_table, cluster_offset;

    int nb_clusters, i = 0;

    QCowL2Meta *old_alloc;



    ret = get_cluster_table(bs, offset, &l2_table, &l2_offset, &l2_index);

    if (ret == 0)

        return 0;



    nb_clusters = size_to_clusters(s, n_end << 9);



    nb_clusters = MIN(nb_clusters, s->l2_size - l2_index);



    cluster_offset = be64_to_cpu(l2_table[l2_index]);



    /* We keep all QCOW_OFLAG_COPIED clusters */



    if (cluster_offset & QCOW_OFLAG_COPIED) {

        nb_clusters = count_contiguous_clusters(nb_clusters, s->cluster_size,

                &l2_table[l2_index], 0, 0);



        cluster_offset &= ~QCOW_OFLAG_COPIED;

        m->nb_clusters = 0;



        goto out;

    }



    /* for the moment, multiple compressed clusters are not managed */



    if (cluster_offset & QCOW_OFLAG_COMPRESSED)

        nb_clusters = 1;



    /* how many available clusters ? */



    while (i < nb_clusters) {

        i += count_contiguous_clusters(nb_clusters - i, s->cluster_size,

                &l2_table[l2_index], i, 0);



        if(be64_to_cpu(l2_table[l2_index + i]))

            break;



        i += count_contiguous_free_clusters(nb_clusters - i,

                &l2_table[l2_index + i]);



        cluster_offset = be64_to_cpu(l2_table[l2_index + i]);



        if ((cluster_offset & QCOW_OFLAG_COPIED) ||

                (cluster_offset & QCOW_OFLAG_COMPRESSED))

            break;

    }

    nb_clusters = i;



    /*

     * Check if there already is an AIO write request in flight which allocates

     * the same cluster. In this case we need to wait until the previous

     * request has completed and updated the L2 table accordingly.

     */

    LIST_FOREACH(old_alloc, &s->cluster_allocs, next_in_flight) {



        uint64_t end_offset = offset + nb_clusters * s->cluster_size;

        uint64_t old_offset = old_alloc->offset;

        uint64_t old_end_offset = old_alloc->offset +

            old_alloc->nb_clusters * s->cluster_size;



        if (end_offset < old_offset || offset > old_end_offset) {

            /* No intersection */

        } else {

            if (offset < old_offset) {

                /* Stop at the start of a running allocation */

                nb_clusters = (old_offset - offset) >> s->cluster_bits;

            } else {

                nb_clusters = 0;

            }



            if (nb_clusters == 0) {

                /* Set dependency and wait for a callback */

                m->depends_on = old_alloc;

                m->nb_clusters = 0;

                *num = 0;

                return 0;

            }

        }

    }



    if (!nb_clusters) {

        abort();

    }



    LIST_INSERT_HEAD(&s->cluster_allocs, m, next_in_flight);



    /* allocate a new cluster */



    cluster_offset = qcow2_alloc_clusters(bs, nb_clusters * s->cluster_size);



    /* save info needed for meta data update */

    m->offset = offset;

    m->n_start = n_start;

    m->nb_clusters = nb_clusters;



out:

    m->nb_available = MIN(nb_clusters << (s->cluster_bits - 9), n_end);



    *num = m->nb_available - n_start;



    return cluster_offset;

}

uint64_t qcow2_alloc_cluster_offset(BlockDriverState *bs,

                                    uint64_t offset,

                                    int n_start, int n_end,

                                    int *num, QCowL2Meta *m)

{

    BDRVQcowState *s = bs->opaque;

    int l2_index, ret;

    uint64_t l2_offset, *l2_table, cluster_offset;

    int nb_clusters, i = 0;

    QCowL2Meta *old_alloc;



    ret = get_cluster_table(bs, offset, &l2_table, &l2_offset, &l2_index);

    if (ret == 0)

        return 0;



    nb_clusters = size_to_clusters(s, n_end << 9);



    nb_clusters = MIN(nb_clusters, s->l2_size - l2_index);



    cluster_offset = be64_to_cpu(l2_table[l2_index]);



    



    if (cluster_offset & QCOW_OFLAG_COPIED) {

        nb_clusters = count_contiguous_clusters(nb_clusters, s->cluster_size,

                &l2_table[l2_index], 0, 0);



        cluster_offset &= ~QCOW_OFLAG_COPIED;

        m->nb_clusters = 0;



        goto out;

    }



    



    if (cluster_offset & QCOW_OFLAG_COMPRESSED)

        nb_clusters = 1;



    



    while (i < nb_clusters) {

        i += count_contiguous_clusters(nb_clusters - i, s->cluster_size,

                &l2_table[l2_index], i, 0);



        if(be64_to_cpu(l2_table[l2_index + i]))

            break;



        i += count_contiguous_free_clusters(nb_clusters - i,

                &l2_table[l2_index + i]);



        cluster_offset = be64_to_cpu(l2_table[l2_index + i]);



        if ((cluster_offset & QCOW_OFLAG_COPIED) ||

                (cluster_offset & QCOW_OFLAG_COMPRESSED))

            break;

    }

    nb_clusters = i;



    









    LIST_FOREACH(old_alloc, &s->cluster_allocs, next_in_flight) {



        uint64_t end_offset = offset + nb_clusters * s->cluster_size;

        uint64_t old_offset = old_alloc->offset;

        uint64_t old_end_offset = old_alloc->offset +

            old_alloc->nb_clusters * s->cluster_size;



        if (end_offset < old_offset || offset > old_end_offset) {

            

        } else {

            if (offset < old_offset) {

                

                nb_clusters = (old_offset - offset) >> s->cluster_bits;

            } else {

                nb_clusters = 0;

            }



            if (nb_clusters == 0) {

                

                m->depends_on = old_alloc;

                m->nb_clusters = 0;

                *num = 0;

                return 0;

            }

        }

    }



    if (!nb_clusters) {

        abort();

    }



    LIST_INSERT_HEAD(&s->cluster_allocs, m, next_in_flight);



    



    cluster_offset = qcow2_alloc_clusters(bs, nb_clusters * s->cluster_size);



    

    m->offset = offset;

    m->n_start = n_start;

    m->nb_clusters = nb_clusters;



out:

    m->nb_available = MIN(nb_clusters << (s->cluster_bits - 9), n_end);



    *num = m->nb_available - n_start;



    return cluster_offset;

}

uint64_t FUNC_0(BlockDriverState *bs,

                                    uint64_t offset,

                                    int n_start, int n_end,

                                    int *num, QCowL2Meta *m)

{

    BDRVQcowState *s = bs->opaque;

    int VAR_0, VAR_1;

    uint64_t l2_offset, *l2_table, cluster_offset;

    int VAR_2, VAR_3 = 0;

    QCowL2Meta *old_alloc;



    VAR_1 = get_cluster_table(bs, offset, &l2_table, &l2_offset, &VAR_0);

    if (VAR_1 == 0)

        return 0;



    VAR_2 = size_to_clusters(s, n_end << 9);



    VAR_2 = MIN(VAR_2, s->l2_size - VAR_0);



    cluster_offset = be64_to_cpu(l2_table[VAR_0]);



    



    if (cluster_offset & QCOW_OFLAG_COPIED) {

        VAR_2 = count_contiguous_clusters(VAR_2, s->cluster_size,

                &l2_table[VAR_0], 0, 0);



        cluster_offset &= ~QCOW_OFLAG_COPIED;

        m->VAR_2 = 0;



        goto out;

    }



    



    if (cluster_offset & QCOW_OFLAG_COMPRESSED)

        VAR_2 = 1;



    



    while (VAR_3 < VAR_2) {

        VAR_3 += count_contiguous_clusters(VAR_2 - VAR_3, s->cluster_size,

                &l2_table[VAR_0], VAR_3, 0);



        if(be64_to_cpu(l2_table[VAR_0 + VAR_3]))

            break;



        VAR_3 += count_contiguous_free_clusters(VAR_2 - VAR_3,

                &l2_table[VAR_0 + VAR_3]);



        cluster_offset = be64_to_cpu(l2_table[VAR_0 + VAR_3]);



        if ((cluster_offset & QCOW_OFLAG_COPIED) ||

                (cluster_offset & QCOW_OFLAG_COMPRESSED))

            break;

    }

    VAR_2 = VAR_3;



    









    LIST_FOREACH(old_alloc, &s->cluster_allocs, next_in_flight) {



        uint64_t end_offset = offset + VAR_2 * s->cluster_size;

        uint64_t old_offset = old_alloc->offset;

        uint64_t old_end_offset = old_alloc->offset +

            old_alloc->VAR_2 * s->cluster_size;



        if (end_offset < old_offset || offset > old_end_offset) {

            

        } else {

            if (offset < old_offset) {

                

                VAR_2 = (old_offset - offset) >> s->cluster_bits;

            } else {

                VAR_2 = 0;

            }



            if (VAR_2 == 0) {

                

                m->depends_on = old_alloc;

                m->VAR_2 = 0;

                *num = 0;

                return 0;

            }

        }

    }



    if (!VAR_2) {

        abort();

    }



    LIST_INSERT_HEAD(&s->cluster_allocs, m, next_in_flight);



    



    cluster_offset = qcow2_alloc_clusters(bs, VAR_2 * s->cluster_size);



    

    m->offset = offset;

    m->n_start = n_start;

    m->VAR_2 = VAR_2;



out:

    m->nb_available = MIN(VAR_2 << (s->cluster_bits - 9), n_end);



    *num = m->nb_available - n_start;



    return cluster_offset;

}

uint64_t FUNC_0(BlockDriverState *bs,
uint64_t offset,
int n_start, int n_end,
int *num, QCowL2Meta *m)
{ BDRVQcowState *s = bs->opaque; int VAR_0, VAR_1; uint64_t l2_offset, *l2_table, cluster_offset; int VAR_2, VAR_3 = 0; QCowL2Meta *old_alloc; VAR_1 = get_cluster_table(bs, offset, &l2_table, &l2_offset, &VAR_0); if (VAR_1 == 0)
return 0; VAR_2 = size_to_clusters(s, n_end << 9); VAR_2 = MIN(VAR_2, s->l2_size - VAR_0); cluster_offset = be64_to_cpu(l2_table[VAR_0]); if (cluster_offset & QCOW_OFLAG_COPIED) { VAR_2 = count_contiguous_clusters(VAR_2, s->cluster_size,
&l2_table[VAR_0], 0, 0); cluster_offset &= ~QCOW_OFLAG_COPIED; m->VAR_2 = 0; goto out; } if (cluster_offset & QCOW_OFLAG_COMPRESSED)
VAR_2 = 1; while (VAR_3 < VAR_2) { VAR_3 += count_contiguous_clusters(VAR_2 - VAR_3, s->cluster_size,
&l2_table[VAR_0], VAR_3, 0); if(be64_to_cpu(l2_table[VAR_0 + VAR_3]))
break; VAR_3 += count_contiguous_free_clusters(VAR_2 - VAR_3,
&l2_table[VAR_0 + VAR_3]); cluster_offset = be64_to_cpu(l2_table[VAR_0 + VAR_3]); if ((cluster_offset & QCOW_OFLAG_COPIED) ||
(cluster_offset & QCOW_OFLAG_COMPRESSED))
break; } VAR_2 = VAR_3; LIST_FOREACH(old_alloc, &s->cluster_allocs, next_in_flight) { uint64_t end_offset = offset + VAR_2 * s->cluster_size; uint64_t old_offset = old_alloc->offset; uint64_t old_end_offset = old_alloc->offset +
old_alloc->VAR_2 * s->cluster_size; if (end_offset < old_offset || offset > old_end_offset) { } else { if (offset < old_offset) { VAR_2 = (old_offset - offset) >> s->cluster_bits; } else { VAR_2 = 0; } if (VAR_2 == 0) { m->depends_on = old_alloc; m->VAR_2 = 0; *num = 0; return 0; } } } if (!VAR_2) { abort(); } LIST_INSERT_HEAD(&s->cluster_allocs, m, next_in_flight); cluster_offset = qcow2_alloc_clusters(bs, VAR_2 * s->cluster_size); m->offset = offset; m->n_start = n_start; m->VAR_2 = VAR_2; out:
m->nb_available = MIN(VAR_2 << (s->cluster_bits - 9), n_end); *num = m->nb_available - n_start; return cluster_offset; }