void numa_set_mem_node_id(ram_addr_t addr, uint64_t size, uint32_t node)

{

    struct numa_addr_range *range = g_malloc0(sizeof(*range));



    /*

     * Memory-less nodes can come here with 0 size in which case,

     * there is nothing to do.

     */

    if (!size) {

        return;

    }



    range->mem_start = addr;

    range->mem_end = addr + size - 1;

    QLIST_INSERT_HEAD(&numa_info[node].addr, range, entry);

}

void numa_set_mem_node_id(ram_addr_t addr, uint64_t size, uint32_t node)

{

    struct numa_addr_range *range = g_malloc0(sizeof(*range));



    







    if (!size) {

        return;

    }



    range->mem_start = addr;

    range->mem_end = addr + size - 1;

    QLIST_INSERT_HEAD(&numa_info[node].addr, range, entry);

}

    struct numa_addr_range *range = g_malloc0(sizeof(*range));
void FUNC_0(ram_addr_t VAR_0, uint64_t VAR_1, uint32_t VAR_2)

{

    struct numa_addr_range *VAR_3 = g_malloc0(sizeof(*VAR_3));



    







    if (!VAR_1) {

        return;

    }



    VAR_3->mem_start = VAR_0;

    VAR_3->mem_end = VAR_0 + VAR_1 - 1;

    QLIST_INSERT_HEAD(&numa_info[VAR_2].VAR_0, VAR_3, entry);

}

void FUNC_0(ram_addr_t VAR_0, uint64_t VAR_1, uint32_t VAR_2)
{ struct numa_addr_range *VAR_3 = g_malloc0(sizeof(*VAR_3)); if (!VAR_1) { return; } VAR_3->mem_start = VAR_0; VAR_3->mem_end = VAR_0 + VAR_1 - 1; QLIST_INSERT_HEAD(&numa_info[VAR_2].VAR_0, VAR_3, entry); }