2015-08-21 07:04:50 +00:00
|
|
|
/*
|
|
|
|
* Declarations for cpu physical memory functions
|
|
|
|
*
|
|
|
|
* Copyright 2011 Red Hat, Inc. and/or its affiliates
|
|
|
|
*
|
|
|
|
* Authors:
|
|
|
|
* Avi Kivity <avi@redhat.com>
|
|
|
|
*
|
|
|
|
* This work is licensed under the terms of the GNU GPL, version 2 or
|
|
|
|
* later. See the COPYING file in the top-level directory.
|
|
|
|
*
|
|
|
|
*/
|
|
|
|
|
|
|
|
/*
|
|
|
|
* This header is for use by exec.c and memory.c ONLY. Do not include it.
|
|
|
|
* The functions declared here will be removed soon.
|
|
|
|
*/
|
|
|
|
|
|
|
|
#ifndef RAM_ADDR_H
|
|
|
|
#define RAM_ADDR_H
|
|
|
|
|
|
|
|
#include "uc_priv.h"
|
|
|
|
|
|
|
|
#ifndef CONFIG_USER_ONLY
|
|
|
|
|
|
|
|
ram_addr_t qemu_ram_alloc_from_ptr(ram_addr_t size, void *host,
|
|
|
|
MemoryRegion *mr, Error **errp);
|
|
|
|
ram_addr_t qemu_ram_alloc(ram_addr_t size, MemoryRegion *mr, Error **errp);
|
|
|
|
int qemu_get_ram_fd(struct uc_struct *uc, ram_addr_t addr);
|
|
|
|
void *qemu_get_ram_block_host_ptr(struct uc_struct *uc, ram_addr_t addr);
|
|
|
|
void *qemu_get_ram_ptr(struct uc_struct *uc, ram_addr_t addr);
|
|
|
|
void qemu_ram_free(struct uc_struct *c, ram_addr_t addr);
|
|
|
|
void qemu_ram_free_from_ptr(struct uc_struct *uc, ram_addr_t addr);
|
|
|
|
|
2018-02-13 14:30:20 +00:00
|
|
|
#define DIRTY_CLIENTS_ALL ((1 << DIRTY_MEMORY_NUM) - 1)
|
|
|
|
#define DIRTY_CLIENTS_NOCODE (DIRTY_CLIENTS_ALL & ~(1 << DIRTY_MEMORY_CODE))
|
|
|
|
|
2015-08-21 07:04:50 +00:00
|
|
|
static inline bool cpu_physical_memory_get_dirty(struct uc_struct *uc, ram_addr_t start,
|
|
|
|
ram_addr_t length,
|
|
|
|
unsigned client)
|
|
|
|
{
|
|
|
|
unsigned long end, page, next;
|
|
|
|
|
|
|
|
assert(client < DIRTY_MEMORY_NUM);
|
|
|
|
|
|
|
|
end = TARGET_PAGE_ALIGN(start + length) >> TARGET_PAGE_BITS;
|
|
|
|
page = start >> TARGET_PAGE_BITS;
|
|
|
|
next = find_next_bit(uc->ram_list.dirty_memory[client], end, page);
|
|
|
|
|
|
|
|
return next < end;
|
|
|
|
}
|
|
|
|
|
2018-02-13 14:30:20 +00:00
|
|
|
static inline bool cpu_physical_memory_all_dirty(struct uc_struct *uc, ram_addr_t start,
|
2015-08-21 07:04:50 +00:00
|
|
|
ram_addr_t length,
|
|
|
|
unsigned client)
|
|
|
|
{
|
|
|
|
unsigned long end, page, next;
|
|
|
|
|
|
|
|
assert(client < DIRTY_MEMORY_NUM);
|
|
|
|
|
|
|
|
end = TARGET_PAGE_ALIGN(start + length) >> TARGET_PAGE_BITS;
|
|
|
|
page = start >> TARGET_PAGE_BITS;
|
|
|
|
next = find_next_zero_bit(uc->ram_list.dirty_memory[client], end, page);
|
|
|
|
|
2018-02-13 14:30:20 +00:00
|
|
|
return next >= end;
|
2015-08-21 07:04:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool cpu_physical_memory_get_dirty_flag(struct uc_struct *uc, ram_addr_t addr,
|
|
|
|
unsigned client)
|
|
|
|
{
|
|
|
|
return cpu_physical_memory_get_dirty(uc, addr, 1, client);
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool cpu_physical_memory_is_clean(struct uc_struct *uc, ram_addr_t addr)
|
|
|
|
{
|
2017-01-20 09:03:39 +00:00
|
|
|
return !cpu_physical_memory_get_dirty_flag(uc, addr, DIRTY_MEMORY_CODE);
|
2015-08-21 07:04:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline bool cpu_physical_memory_range_includes_clean(struct uc_struct *uc, ram_addr_t start,
|
2018-02-13 16:00:32 +00:00
|
|
|
ram_addr_t length, uint8_t mask)
|
2015-08-21 07:04:50 +00:00
|
|
|
{
|
2018-02-13 16:00:32 +00:00
|
|
|
uint8_t ret = 0;
|
|
|
|
|
|
|
|
if (mask & (1 << DIRTY_MEMORY_CODE) &&
|
|
|
|
!cpu_physical_memory_all_dirty(uc, start, length, DIRTY_MEMORY_CODE)) {
|
|
|
|
ret |= (1 << DIRTY_MEMORY_CODE);
|
|
|
|
}
|
|
|
|
return ret;
|
2015-08-21 07:04:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void cpu_physical_memory_set_dirty_flag(struct uc_struct *uc, ram_addr_t addr,
|
|
|
|
unsigned client)
|
|
|
|
{
|
|
|
|
assert(client < DIRTY_MEMORY_NUM);
|
2018-02-13 16:06:45 +00:00
|
|
|
set_bit_atomic(addr >> TARGET_PAGE_BITS, uc->ram_list.dirty_memory[client]);
|
2015-08-21 07:04:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
static inline void cpu_physical_memory_set_dirty_range(struct uc_struct *uc, ram_addr_t start,
|
2018-02-13 14:30:20 +00:00
|
|
|
ram_addr_t length,
|
|
|
|
uint8_t mask)
|
2015-08-21 07:04:50 +00:00
|
|
|
{
|
|
|
|
unsigned long end, page;
|
2018-02-13 16:06:45 +00:00
|
|
|
unsigned long **d = uc->ram_list.dirty_memory;
|
2015-08-21 07:04:50 +00:00
|
|
|
|
|
|
|
end = TARGET_PAGE_ALIGN(start + length) >> TARGET_PAGE_BITS;
|
|
|
|
page = start >> TARGET_PAGE_BITS;
|
2018-02-13 14:30:20 +00:00
|
|
|
if (unlikely(mask & (1 << DIRTY_MEMORY_CODE))) {
|
2018-02-13 16:06:45 +00:00
|
|
|
bitmap_set_atomic(d[DIRTY_MEMORY_CODE], page, end - page);
|
2018-02-13 14:30:20 +00:00
|
|
|
}
|
|
|
|
|
2015-08-21 07:04:50 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
#if !defined(_WIN32)
|
|
|
|
static inline void cpu_physical_memory_set_dirty_lebitmap(struct uc_struct *uc, unsigned long *bitmap,
|
|
|
|
ram_addr_t start,
|
|
|
|
ram_addr_t pages)
|
|
|
|
{
|
|
|
|
unsigned long i, j;
|
|
|
|
unsigned long page_number, c;
|
|
|
|
hwaddr addr;
|
|
|
|
ram_addr_t ram_addr;
|
|
|
|
unsigned long len = (pages + HOST_LONG_BITS - 1) / HOST_LONG_BITS;
|
|
|
|
unsigned long hpratio = getpagesize() / TARGET_PAGE_SIZE;
|
|
|
|
unsigned long page = BIT_WORD(start >> TARGET_PAGE_BITS);
|
|
|
|
|
|
|
|
/* start address is aligned at the start of a word? */
|
|
|
|
if ((((page * BITS_PER_LONG) << TARGET_PAGE_BITS) == start) &&
|
|
|
|
(hpratio == 1)) {
|
|
|
|
long k;
|
|
|
|
long nr = BITS_TO_LONGS(pages);
|
|
|
|
|
|
|
|
for (k = 0; k < nr; k++) {
|
|
|
|
if (bitmap[k]) {
|
|
|
|
unsigned long temp = leul_to_cpu(bitmap[k]);
|
2018-02-13 16:06:45 +00:00
|
|
|
unsigned long **d = uc->ram_list.dirty_memory;
|
|
|
|
|
2018-02-13 15:46:27 +00:00
|
|
|
if (tcg_enabled(uc)) {
|
2018-02-13 16:06:45 +00:00
|
|
|
atomic_or(&d[DIRTY_MEMORY_CODE][page + k], temp);
|
2018-02-13 15:46:27 +00:00
|
|
|
}
|
2015-08-21 07:04:50 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
} else {
|
2018-02-13 15:46:27 +00:00
|
|
|
uint8_t clients = tcg_enabled(uc) ? DIRTY_CLIENTS_ALL : DIRTY_CLIENTS_NOCODE;
|
2015-08-21 07:04:50 +00:00
|
|
|
/*
|
|
|
|
* bitmap-traveling is faster than memory-traveling (for addr...)
|
|
|
|
* especially when most of the memory is not dirty.
|
|
|
|
*/
|
|
|
|
for (i = 0; i < len; i++) {
|
|
|
|
if (bitmap[i] != 0) {
|
|
|
|
c = leul_to_cpu(bitmap[i]);
|
|
|
|
do {
|
|
|
|
j = ctzl(c);
|
|
|
|
c &= ~(1ul << j);
|
|
|
|
page_number = (i * HOST_LONG_BITS + j) * hpratio;
|
|
|
|
addr = page_number * TARGET_PAGE_SIZE;
|
|
|
|
ram_addr = start + addr;
|
|
|
|
cpu_physical_memory_set_dirty_range(uc, ram_addr,
|
2018-02-13 15:46:27 +00:00
|
|
|
TARGET_PAGE_SIZE * hpratio, clients);
|
2015-08-21 07:04:50 +00:00
|
|
|
} while (c != 0);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif /* not _WIN32 */
|
|
|
|
|
|
|
|
static inline void cpu_physical_memory_clear_dirty_range(struct uc_struct *uc, ram_addr_t start,
|
|
|
|
ram_addr_t length,
|
|
|
|
unsigned client)
|
|
|
|
{
|
|
|
|
unsigned long end, page;
|
|
|
|
|
|
|
|
assert(client < DIRTY_MEMORY_NUM);
|
|
|
|
end = TARGET_PAGE_ALIGN(start + length) >> TARGET_PAGE_BITS;
|
|
|
|
page = start >> TARGET_PAGE_BITS;
|
|
|
|
bitmap_clear(uc->ram_list.dirty_memory[client], page, end - page);
|
|
|
|
}
|
|
|
|
|
|
|
|
void cpu_physical_memory_reset_dirty(struct uc_struct *uc,
|
|
|
|
ram_addr_t start, ram_addr_t length, unsigned client);
|
|
|
|
|
|
|
|
#endif
|
|
|
|
#endif
|