]> git.proxmox.com Git - mirror_qemu.git/blame_incremental - memory.c
projects / mirror_qemu.git / blame_incremental
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (non-incremental) | history | HEAD
memory: MemoryRegion: QOMify
[mirror_qemu.git] / memory.c
... / ...
CommitLineData
1/*
2 * Physical memory management
3 *
4 * Copyright 2011 Red Hat, Inc. and/or its affiliates
5 *
6 * Authors:
7 * Avi Kivity <avi@redhat.com>
8 *
9 * This work is licensed under the terms of the GNU GPL, version 2. See
10 * the COPYING file in the top-level directory.
11 *
12 * Contributions after 2012-01-13 are licensed under the terms of the
13 * GNU GPL, version 2 or (at your option) any later version.
14 */
15
16#include "exec/memory.h"
17#include "exec/address-spaces.h"
18#include "exec/ioport.h"
19#include "qemu/bitops.h"
20#include "qom/object.h"
21#include "trace.h"
22#include <assert.h>
23
24#include "exec/memory-internal.h"
25#include "exec/ram_addr.h"
26#include "sysemu/sysemu.h"
27
28//#define DEBUG_UNASSIGNED
29
30static unsigned memory_region_transaction_depth;
31static bool memory_region_update_pending;
32static bool ioeventfd_update_pending;
33static bool global_dirty_log = false;
34
35/* flat_view_mutex is taken around reading as->current_map; the critical
36 * section is extremely short, so I'm using a single mutex for every AS.
37 * We could also RCU for the read-side.
38 *
39 * The BQL is taken around transaction commits, hence both locks are taken
40 * while writing to as->current_map (with the BQL taken outside).
41 */
42static QemuMutex flat_view_mutex;
43
44static QTAILQ_HEAD(memory_listeners, MemoryListener) memory_listeners
45 = QTAILQ_HEAD_INITIALIZER(memory_listeners);
46
47static QTAILQ_HEAD(, AddressSpace) address_spaces
48 = QTAILQ_HEAD_INITIALIZER(address_spaces);
49
50static void memory_init(void)
51{
52 qemu_mutex_init(&flat_view_mutex);
53}
54
55typedef struct AddrRange AddrRange;
56
57/*
58 * Note using signed integers limits us to physical addresses at most
59 * 63 bits wide. They are needed for negative offsetting in aliases
60 * (large MemoryRegion::alias_offset).
61 */
62struct AddrRange {
63 Int128 start;
64 Int128 size;
65};
66
67static AddrRange addrrange_make(Int128 start, Int128 size)
68{
69 return (AddrRange) { start, size };
70}
71
72static bool addrrange_equal(AddrRange r1, AddrRange r2)
73{
74 return int128_eq(r1.start, r2.start) && int128_eq(r1.size, r2.size);
75}
76
77static Int128 addrrange_end(AddrRange r)
78{
79 return int128_add(r.start, r.size);
80}
81
82static AddrRange addrrange_shift(AddrRange range, Int128 delta)
83{
84 int128_addto(&range.start, delta);
85 return range;
86}
87
88static bool addrrange_contains(AddrRange range, Int128 addr)
89{
90 return int128_ge(addr, range.start)
91 && int128_lt(addr, addrrange_end(range));
92}
93
94static bool addrrange_intersects(AddrRange r1, AddrRange r2)
95{
96 return addrrange_contains(r1, r2.start)
97 || addrrange_contains(r2, r1.start);
98}
99
100static AddrRange addrrange_intersection(AddrRange r1, AddrRange r2)
101{
102 Int128 start = int128_max(r1.start, r2.start);
103 Int128 end = int128_min(addrrange_end(r1), addrrange_end(r2));
104 return addrrange_make(start, int128_sub(end, start));
105}
106
107enum ListenerDirection { Forward, Reverse };
108
109static bool memory_listener_match(MemoryListener *listener,
110 MemoryRegionSection *section)
111{
112 return !listener->address_space_filter
113 || listener->address_space_filter == section->address_space;
114}
115
116#define MEMORY_LISTENER_CALL_GLOBAL(_callback, _direction, _args...) \
117 do { \
118 MemoryListener *_listener; \
119 \
120 switch (_direction) { \
121 case Forward: \
122 QTAILQ_FOREACH(_listener, &memory_listeners, link) { \
123 if (_listener->_callback) { \
124 _listener->_callback(_listener, ##_args); \
125 } \
126 } \
127 break; \
128 case Reverse: \
129 QTAILQ_FOREACH_REVERSE(_listener, &memory_listeners, \
130 memory_listeners, link) { \
131 if (_listener->_callback) { \
132 _listener->_callback(_listener, ##_args); \
133 } \
134 } \
135 break; \
136 default: \
137 abort(); \
138 } \
139 } while (0)
140
141#define MEMORY_LISTENER_CALL(_callback, _direction, _section, _args...) \
142 do { \
143 MemoryListener *_listener; \
144 \
145 switch (_direction) { \
146 case Forward: \
147 QTAILQ_FOREACH(_listener, &memory_listeners, link) { \
148 if (_listener->_callback \
149 && memory_listener_match(_listener, _section)) { \
150 _listener->_callback(_listener, _section, ##_args); \
151 } \
152 } \
153 break; \
154 case Reverse: \
155 QTAILQ_FOREACH_REVERSE(_listener, &memory_listeners, \
156 memory_listeners, link) { \
157 if (_listener->_callback \
158 && memory_listener_match(_listener, _section)) { \
159 _listener->_callback(_listener, _section, ##_args); \
160 } \
161 } \
162 break; \
163 default: \
164 abort(); \
165 } \
166 } while (0)
167
168/* No need to ref/unref .mr, the FlatRange keeps it alive. */
169#define MEMORY_LISTENER_UPDATE_REGION(fr, as, dir, callback) \
170 MEMORY_LISTENER_CALL(callback, dir, (&(MemoryRegionSection) { \
171 .mr = (fr)->mr, \
172 .address_space = (as), \
173 .offset_within_region = (fr)->offset_in_region, \
174 .size = (fr)->addr.size, \
175 .offset_within_address_space = int128_get64((fr)->addr.start), \
176 .readonly = (fr)->readonly, \
177 }))
178
179struct CoalescedMemoryRange {
180 AddrRange addr;
181 QTAILQ_ENTRY(CoalescedMemoryRange) link;
182};
183
184struct MemoryRegionIoeventfd {
185 AddrRange addr;
186 bool match_data;
187 uint64_t data;
188 EventNotifier *e;
189};
190
191static bool memory_region_ioeventfd_before(MemoryRegionIoeventfd a,
192 MemoryRegionIoeventfd b)
193{
194 if (int128_lt(a.addr.start, b.addr.start)) {
195 return true;
196 } else if (int128_gt(a.addr.start, b.addr.start)) {
197 return false;
198 } else if (int128_lt(a.addr.size, b.addr.size)) {
199 return true;
200 } else if (int128_gt(a.addr.size, b.addr.size)) {
201 return false;
202 } else if (a.match_data < b.match_data) {
203 return true;
204 } else if (a.match_data > b.match_data) {
205 return false;
206 } else if (a.match_data) {
207 if (a.data < b.data) {
208 return true;
209 } else if (a.data > b.data) {
210 return false;
211 }
212 }
213 if (a.e < b.e) {
214 return true;
215 } else if (a.e > b.e) {
216 return false;
217 }
218 return false;
219}
220
221static bool memory_region_ioeventfd_equal(MemoryRegionIoeventfd a,
222 MemoryRegionIoeventfd b)
223{
224 return !memory_region_ioeventfd_before(a, b)
225 && !memory_region_ioeventfd_before(b, a);
226}
227
228typedef struct FlatRange FlatRange;
229typedef struct FlatView FlatView;
230
231/* Range of memory in the global map. Addresses are absolute. */
232struct FlatRange {
233 MemoryRegion *mr;
234 hwaddr offset_in_region;
235 AddrRange addr;
236 uint8_t dirty_log_mask;
237 bool romd_mode;
238 bool readonly;
239};
240
241/* Flattened global view of current active memory hierarchy. Kept in sorted
242 * order.
243 */
244struct FlatView {
245 unsigned ref;
246 FlatRange *ranges;
247 unsigned nr;
248 unsigned nr_allocated;
249};
250
251typedef struct AddressSpaceOps AddressSpaceOps;
252
253#define FOR_EACH_FLAT_RANGE(var, view) \
254 for (var = (view)->ranges; var < (view)->ranges + (view)->nr; ++var)
255
256static bool flatrange_equal(FlatRange *a, FlatRange *b)
257{
258 return a->mr == b->mr
259 && addrrange_equal(a->addr, b->addr)
260 && a->offset_in_region == b->offset_in_region
261 && a->romd_mode == b->romd_mode
262 && a->readonly == b->readonly;
263}
264
265static void flatview_init(FlatView *view)
266{
267 view->ref = 1;
268 view->ranges = NULL;
269 view->nr = 0;
270 view->nr_allocated = 0;
271}
272
273/* Insert a range into a given position. Caller is responsible for maintaining
274 * sorting order.
275 */
276static void flatview_insert(FlatView *view, unsigned pos, FlatRange *range)
277{
278 if (view->nr == view->nr_allocated) {
279 view->nr_allocated = MAX(2 * view->nr, 10);
280 view->ranges = g_realloc(view->ranges,
281 view->nr_allocated * sizeof(*view->ranges));
282 }
283 memmove(view->ranges + pos + 1, view->ranges + pos,
284 (view->nr - pos) * sizeof(FlatRange));
285 view->ranges[pos] = *range;
286 memory_region_ref(range->mr);
287 ++view->nr;
288}
289
290static void flatview_destroy(FlatView *view)
291{
292 int i;
293
294 for (i = 0; i < view->nr; i++) {
295 memory_region_unref(view->ranges[i].mr);
296 }
297 g_free(view->ranges);
298 g_free(view);
299}
300
301static void flatview_ref(FlatView *view)
302{
303 atomic_inc(&view->ref);
304}
305
306static void flatview_unref(FlatView *view)
307{
308 if (atomic_fetch_dec(&view->ref) == 1) {
309 flatview_destroy(view);
310 }
311}
312
313static bool can_merge(FlatRange *r1, FlatRange *r2)
314{
315 return int128_eq(addrrange_end(r1->addr), r2->addr.start)
316 && r1->mr == r2->mr
317 && int128_eq(int128_add(int128_make64(r1->offset_in_region),
318 r1->addr.size),
319 int128_make64(r2->offset_in_region))
320 && r1->dirty_log_mask == r2->dirty_log_mask
321 && r1->romd_mode == r2->romd_mode
322 && r1->readonly == r2->readonly;
323}
324
325/* Attempt to simplify a view by merging adjacent ranges */
326static void flatview_simplify(FlatView *view)
327{
328 unsigned i, j;
329
330 i = 0;
331 while (i < view->nr) {
332 j = i + 1;
333 while (j < view->nr
334 && can_merge(&view->ranges[j-1], &view->ranges[j])) {
335 int128_addto(&view->ranges[i].addr.size, view->ranges[j].addr.size);
336 ++j;
337 }
338 ++i;
339 memmove(&view->ranges[i], &view->ranges[j],
340 (view->nr - j) * sizeof(view->ranges[j]));
341 view->nr -= j - i;
342 }
343}
344
345static bool memory_region_big_endian(MemoryRegion *mr)
346{
347#ifdef TARGET_WORDS_BIGENDIAN
348 return mr->ops->endianness != DEVICE_LITTLE_ENDIAN;
349#else
350 return mr->ops->endianness == DEVICE_BIG_ENDIAN;
351#endif
352}
353
354static bool memory_region_wrong_endianness(MemoryRegion *mr)
355{
356#ifdef TARGET_WORDS_BIGENDIAN
357 return mr->ops->endianness == DEVICE_LITTLE_ENDIAN;
358#else
359 return mr->ops->endianness == DEVICE_BIG_ENDIAN;
360#endif
361}
362
363static void adjust_endianness(MemoryRegion *mr, uint64_t *data, unsigned size)
364{
365 if (memory_region_wrong_endianness(mr)) {
366 switch (size) {
367 case 1:
368 break;
369 case 2:
370 *data = bswap16(*data);
371 break;
372 case 4:
373 *data = bswap32(*data);
374 break;
375 case 8:
376 *data = bswap64(*data);
377 break;
378 default:
379 abort();
380 }
381 }
382}
383
384static void memory_region_oldmmio_read_accessor(MemoryRegion *mr,
385 hwaddr addr,
386 uint64_t *value,
387 unsigned size,
388 unsigned shift,
389 uint64_t mask)
390{
391 uint64_t tmp;
392
393 tmp = mr->ops->old_mmio.read[ctz32(size)](mr->opaque, addr);
394 trace_memory_region_ops_read(mr, addr, tmp, size);
395 *value |= (tmp & mask) << shift;
396}
397
398static void memory_region_read_accessor(MemoryRegion *mr,
399 hwaddr addr,
400 uint64_t *value,
401 unsigned size,
402 unsigned shift,
403 uint64_t mask)
404{
405 uint64_t tmp;
406
407 if (mr->flush_coalesced_mmio) {
408 qemu_flush_coalesced_mmio_buffer();
409 }
410 tmp = mr->ops->read(mr->opaque, addr, size);
411 trace_memory_region_ops_read(mr, addr, tmp, size);
412 *value |= (tmp & mask) << shift;
413}
414
415static void memory_region_oldmmio_write_accessor(MemoryRegion *mr,
416 hwaddr addr,
417 uint64_t *value,
418 unsigned size,
419 unsigned shift,
420 uint64_t mask)
421{
422 uint64_t tmp;
423
424 tmp = (*value >> shift) & mask;
425 trace_memory_region_ops_write(mr, addr, tmp, size);
426 mr->ops->old_mmio.write[ctz32(size)](mr->opaque, addr, tmp);
427}
428
429static void memory_region_write_accessor(MemoryRegion *mr,
430 hwaddr addr,
431 uint64_t *value,
432 unsigned size,
433 unsigned shift,
434 uint64_t mask)
435{
436 uint64_t tmp;
437
438 if (mr->flush_coalesced_mmio) {
439 qemu_flush_coalesced_mmio_buffer();
440 }
441 tmp = (*value >> shift) & mask;
442 trace_memory_region_ops_write(mr, addr, tmp, size);
443 mr->ops->write(mr->opaque, addr, tmp, size);
444}
445
446static void access_with_adjusted_size(hwaddr addr,
447 uint64_t *value,
448 unsigned size,
449 unsigned access_size_min,
450 unsigned access_size_max,
451 void (*access)(MemoryRegion *mr,
452 hwaddr addr,
453 uint64_t *value,
454 unsigned size,
455 unsigned shift,
456 uint64_t mask),
457 MemoryRegion *mr)
458{
459 uint64_t access_mask;
460 unsigned access_size;
461 unsigned i;
462
463 if (!access_size_min) {
464 access_size_min = 1;
465 }
466 if (!access_size_max) {
467 access_size_max = 4;
468 }
469
470 /* FIXME: support unaligned access? */
471 access_size = MAX(MIN(size, access_size_max), access_size_min);
472 access_mask = -1ULL >> (64 - access_size * 8);
473 if (memory_region_big_endian(mr)) {
474 for (i = 0; i < size; i += access_size) {
475 access(mr, addr + i, value, access_size,
476 (size - access_size - i) * 8, access_mask);
477 }
478 } else {
479 for (i = 0; i < size; i += access_size) {
480 access(mr, addr + i, value, access_size, i * 8, access_mask);
481 }
482 }
483}
484
485static AddressSpace *memory_region_to_address_space(MemoryRegion *mr)
486{
487 AddressSpace *as;
488
489 while (mr->container) {
490 mr = mr->container;
491 }
492 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
493 if (mr == as->root) {
494 return as;
495 }
496 }
497 return NULL;
498}
499
500/* Render a memory region into the global view. Ranges in @view obscure
501 * ranges in @mr.
502 */
503static void render_memory_region(FlatView *view,
504 MemoryRegion *mr,
505 Int128 base,
506 AddrRange clip,
507 bool readonly)
508{
509 MemoryRegion *subregion;
510 unsigned i;
511 hwaddr offset_in_region;
512 Int128 remain;
513 Int128 now;
514 FlatRange fr;
515 AddrRange tmp;
516
517 if (!mr->enabled) {
518 return;
519 }
520
521 int128_addto(&base, int128_make64(mr->addr));
522 readonly |= mr->readonly;
523
524 tmp = addrrange_make(base, mr->size);
525
526 if (!addrrange_intersects(tmp, clip)) {
527 return;
528 }
529
530 clip = addrrange_intersection(tmp, clip);
531
532 if (mr->alias) {
533 int128_subfrom(&base, int128_make64(mr->alias->addr));
534 int128_subfrom(&base, int128_make64(mr->alias_offset));
535 render_memory_region(view, mr->alias, base, clip, readonly);
536 return;
537 }
538
539 /* Render subregions in priority order. */
540 QTAILQ_FOREACH(subregion, &mr->subregions, subregions_link) {
541 render_memory_region(view, subregion, base, clip, readonly);
542 }
543
544 if (!mr->terminates) {
545 return;
546 }
547
548 offset_in_region = int128_get64(int128_sub(clip.start, base));
549 base = clip.start;
550 remain = clip.size;
551
552 fr.mr = mr;
553 fr.dirty_log_mask = mr->dirty_log_mask;
554 fr.romd_mode = mr->romd_mode;
555 fr.readonly = readonly;
556
557 /* Render the region itself into any gaps left by the current view. */
558 for (i = 0; i < view->nr && int128_nz(remain); ++i) {
559 if (int128_ge(base, addrrange_end(view->ranges[i].addr))) {
560 continue;
561 }
562 if (int128_lt(base, view->ranges[i].addr.start)) {
563 now = int128_min(remain,
564 int128_sub(view->ranges[i].addr.start, base));
565 fr.offset_in_region = offset_in_region;
566 fr.addr = addrrange_make(base, now);
567 flatview_insert(view, i, &fr);
568 ++i;
569 int128_addto(&base, now);
570 offset_in_region += int128_get64(now);
571 int128_subfrom(&remain, now);
572 }
573 now = int128_sub(int128_min(int128_add(base, remain),
574 addrrange_end(view->ranges[i].addr)),
575 base);
576 int128_addto(&base, now);
577 offset_in_region += int128_get64(now);
578 int128_subfrom(&remain, now);
579 }
580 if (int128_nz(remain)) {
581 fr.offset_in_region = offset_in_region;
582 fr.addr = addrrange_make(base, remain);
583 flatview_insert(view, i, &fr);
584 }
585}
586
587/* Render a memory topology into a list of disjoint absolute ranges. */
588static FlatView *generate_memory_topology(MemoryRegion *mr)
589{
590 FlatView *view;
591
592 view = g_new(FlatView, 1);
593 flatview_init(view);
594
595 if (mr) {
596 render_memory_region(view, mr, int128_zero(),
597 addrrange_make(int128_zero(), int128_2_64()), false);
598 }
599 flatview_simplify(view);
600
601 return view;
602}
603
604static void address_space_add_del_ioeventfds(AddressSpace *as,
605 MemoryRegionIoeventfd *fds_new,
606 unsigned fds_new_nb,
607 MemoryRegionIoeventfd *fds_old,
608 unsigned fds_old_nb)
609{
610 unsigned iold, inew;
611 MemoryRegionIoeventfd *fd;
612 MemoryRegionSection section;
613
614 /* Generate a symmetric difference of the old and new fd sets, adding
615 * and deleting as necessary.
616 */
617
618 iold = inew = 0;
619 while (iold < fds_old_nb || inew < fds_new_nb) {
620 if (iold < fds_old_nb
621 && (inew == fds_new_nb
622 || memory_region_ioeventfd_before(fds_old[iold],
623 fds_new[inew]))) {
624 fd = &fds_old[iold];
625 section = (MemoryRegionSection) {
626 .address_space = as,
627 .offset_within_address_space = int128_get64(fd->addr.start),
628 .size = fd->addr.size,
629 };
630 MEMORY_LISTENER_CALL(eventfd_del, Forward, &section,
631 fd->match_data, fd->data, fd->e);
632 ++iold;
633 } else if (inew < fds_new_nb
634 && (iold == fds_old_nb
635 || memory_region_ioeventfd_before(fds_new[inew],
636 fds_old[iold]))) {
637 fd = &fds_new[inew];
638 section = (MemoryRegionSection) {
639 .address_space = as,
640 .offset_within_address_space = int128_get64(fd->addr.start),
641 .size = fd->addr.size,
642 };
643 MEMORY_LISTENER_CALL(eventfd_add, Reverse, &section,
644 fd->match_data, fd->data, fd->e);
645 ++inew;
646 } else {
647 ++iold;
648 ++inew;
649 }
650 }
651}
652
653static FlatView *address_space_get_flatview(AddressSpace *as)
654{
655 FlatView *view;
656
657 qemu_mutex_lock(&flat_view_mutex);
658 view = as->current_map;
659 flatview_ref(view);
660 qemu_mutex_unlock(&flat_view_mutex);
661 return view;
662}
663
664static void address_space_update_ioeventfds(AddressSpace *as)
665{
666 FlatView *view;
667 FlatRange *fr;
668 unsigned ioeventfd_nb = 0;
669 MemoryRegionIoeventfd *ioeventfds = NULL;
670 AddrRange tmp;
671 unsigned i;
672
673 view = address_space_get_flatview(as);
674 FOR_EACH_FLAT_RANGE(fr, view) {
675 for (i = 0; i < fr->mr->ioeventfd_nb; ++i) {
676 tmp = addrrange_shift(fr->mr->ioeventfds[i].addr,
677 int128_sub(fr->addr.start,
678 int128_make64(fr->offset_in_region)));
679 if (addrrange_intersects(fr->addr, tmp)) {
680 ++ioeventfd_nb;
681 ioeventfds = g_realloc(ioeventfds,
682 ioeventfd_nb * sizeof(*ioeventfds));
683 ioeventfds[ioeventfd_nb-1] = fr->mr->ioeventfds[i];
684 ioeventfds[ioeventfd_nb-1].addr = tmp;
685 }
686 }
687 }
688
689 address_space_add_del_ioeventfds(as, ioeventfds, ioeventfd_nb,
690 as->ioeventfds, as->ioeventfd_nb);
691
692 g_free(as->ioeventfds);
693 as->ioeventfds = ioeventfds;
694 as->ioeventfd_nb = ioeventfd_nb;
695 flatview_unref(view);
696}
697
698static void address_space_update_topology_pass(AddressSpace *as,
699 const FlatView *old_view,
700 const FlatView *new_view,
701 bool adding)
702{
703 unsigned iold, inew;
704 FlatRange *frold, *frnew;
705
706 /* Generate a symmetric difference of the old and new memory maps.
707 * Kill ranges in the old map, and instantiate ranges in the new map.
708 */
709 iold = inew = 0;
710 while (iold < old_view->nr || inew < new_view->nr) {
711 if (iold < old_view->nr) {
712 frold = &old_view->ranges[iold];
713 } else {
714 frold = NULL;
715 }
716 if (inew < new_view->nr) {
717 frnew = &new_view->ranges[inew];
718 } else {
719 frnew = NULL;
720 }
721
722 if (frold
723 && (!frnew
724 || int128_lt(frold->addr.start, frnew->addr.start)
725 || (int128_eq(frold->addr.start, frnew->addr.start)
726 && !flatrange_equal(frold, frnew)))) {
727 /* In old but not in new, or in both but attributes changed. */
728
729 if (!adding) {
730 MEMORY_LISTENER_UPDATE_REGION(frold, as, Reverse, region_del);
731 }
732
733 ++iold;
734 } else if (frold && frnew && flatrange_equal(frold, frnew)) {
735 /* In both and unchanged (except logging may have changed) */
736
737 if (adding) {
738 MEMORY_LISTENER_UPDATE_REGION(frnew, as, Forward, region_nop);
739 if (frold->dirty_log_mask && !frnew->dirty_log_mask) {
740 MEMORY_LISTENER_UPDATE_REGION(frnew, as, Reverse, log_stop);
741 } else if (frnew->dirty_log_mask && !frold->dirty_log_mask) {
742 MEMORY_LISTENER_UPDATE_REGION(frnew, as, Forward, log_start);
743 }
744 }
745
746 ++iold;
747 ++inew;
748 } else {
749 /* In new */
750
751 if (adding) {
752 MEMORY_LISTENER_UPDATE_REGION(frnew, as, Forward, region_add);
753 }
754
755 ++inew;
756 }
757 }
758}
759
760
761static void address_space_update_topology(AddressSpace *as)
762{
763 FlatView *old_view = address_space_get_flatview(as);
764 FlatView *new_view = generate_memory_topology(as->root);
765
766 address_space_update_topology_pass(as, old_view, new_view, false);
767 address_space_update_topology_pass(as, old_view, new_view, true);
768
769 qemu_mutex_lock(&flat_view_mutex);
770 flatview_unref(as->current_map);
771 as->current_map = new_view;
772 qemu_mutex_unlock(&flat_view_mutex);
773
774 /* Note that all the old MemoryRegions are still alive up to this
775 * point. This relieves most MemoryListeners from the need to
776 * ref/unref the MemoryRegions they get---unless they use them
777 * outside the iothread mutex, in which case precise reference
778 * counting is necessary.
779 */
780 flatview_unref(old_view);
781
782 address_space_update_ioeventfds(as);
783}
784
785void memory_region_transaction_begin(void)
786{
787 qemu_flush_coalesced_mmio_buffer();
788 ++memory_region_transaction_depth;
789}
790
791static void memory_region_clear_pending(void)
792{
793 memory_region_update_pending = false;
794 ioeventfd_update_pending = false;
795}
796
797void memory_region_transaction_commit(void)
798{
799 AddressSpace *as;
800
801 assert(memory_region_transaction_depth);
802 --memory_region_transaction_depth;
803 if (!memory_region_transaction_depth) {
804 if (memory_region_update_pending) {
805 MEMORY_LISTENER_CALL_GLOBAL(begin, Forward);
806
807 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
808 address_space_update_topology(as);
809 }
810
811 MEMORY_LISTENER_CALL_GLOBAL(commit, Forward);
812 } else if (ioeventfd_update_pending) {
813 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
814 address_space_update_ioeventfds(as);
815 }
816 }
817 memory_region_clear_pending();
818 }
819}
820
821static void memory_region_destructor_none(MemoryRegion *mr)
822{
823}
824
825static void memory_region_destructor_ram(MemoryRegion *mr)
826{
827 qemu_ram_free(mr->ram_addr);
828}
829
830static void memory_region_destructor_alias(MemoryRegion *mr)
831{
832 memory_region_unref(mr->alias);
833}
834
835static void memory_region_destructor_ram_from_ptr(MemoryRegion *mr)
836{
837 qemu_ram_free_from_ptr(mr->ram_addr);
838}
839
840static void memory_region_destructor_rom_device(MemoryRegion *mr)
841{
842 qemu_ram_free(mr->ram_addr & TARGET_PAGE_MASK);
843}
844
845static bool memory_region_need_escape(char c)
846{
847 return c == '/' || c == '[' || c == '\\' || c == ']';
848}
849
850static char *memory_region_escape_name(const char *name)
851{
852 const char *p;
853 char *escaped, *q;
854 uint8_t c;
855 size_t bytes = 0;
856
857 for (p = name; *p; p++) {
858 bytes += memory_region_need_escape(*p) ? 4 : 1;
859 }
860 if (bytes == p - name) {
861 return g_memdup(name, bytes + 1);
862 }
863
864 escaped = g_malloc(bytes + 1);
865 for (p = name, q = escaped; *p; p++) {
866 c = *p;
867 if (unlikely(memory_region_need_escape(c))) {
868 *q++ = '\\';
869 *q++ = 'x';
870 *q++ = "0123456789abcdef"[c >> 4];
871 c = "0123456789abcdef"[c & 15];
872 }
873 *q++ = c;
874 }
875 *q = 0;
876 return escaped;
877}
878
879static void object_property_add_child_array(Object *owner,
880 const char *name,
881 Object *child)
882{
883 int i;
884 char *base_name = memory_region_escape_name(name);
885
886 for (i = 0; ; i++) {
887 char *full_name = g_strdup_printf("%s[%d]", base_name, i);
888 Error *local_err = NULL;
889
890 object_property_add_child(owner, full_name, child, &local_err);
891 g_free(full_name);
892 if (!local_err) {
893 break;
894 }
895
896 error_free(local_err);
897 }
898
899 g_free(base_name);
900}
901
902
903void memory_region_init(MemoryRegion *mr,
904 Object *owner,
905 const char *name,
906 uint64_t size)
907{
908 object_initialize(mr, sizeof(*mr), TYPE_MEMORY_REGION);
909
910 mr->owner = owner ? owner : qdev_get_machine();
911 mr->size = int128_make64(size);
912 if (size == UINT64_MAX) {
913 mr->size = int128_2_64();
914 }
915 mr->name = g_strdup(name);
916
917 if (name) {
918 object_property_add_child_array(mr->owner, name, OBJECT(mr));
919 object_unref(OBJECT(mr));
920 }
921}
922
923static void memory_region_initfn(Object *obj)
924{
925 MemoryRegion *mr = MEMORY_REGION(obj);
926
927 mr->ops = &unassigned_mem_ops;
928 mr->enabled = true;
929 mr->romd_mode = true;
930 mr->destructor = memory_region_destructor_none;
931 QTAILQ_INIT(&mr->subregions);
932 QTAILQ_INIT(&mr->coalesced);
933}
934
935static uint64_t unassigned_mem_read(void *opaque, hwaddr addr,
936 unsigned size)
937{
938#ifdef DEBUG_UNASSIGNED
939 printf("Unassigned mem read " TARGET_FMT_plx "\n", addr);
940#endif
941 if (current_cpu != NULL) {
942 cpu_unassigned_access(current_cpu, addr, false, false, 0, size);
943 }
944 return 0;
945}
946
947static void unassigned_mem_write(void *opaque, hwaddr addr,
948 uint64_t val, unsigned size)
949{
950#ifdef DEBUG_UNASSIGNED
951 printf("Unassigned mem write " TARGET_FMT_plx " = 0x%"PRIx64"\n", addr, val);
952#endif
953 if (current_cpu != NULL) {
954 cpu_unassigned_access(current_cpu, addr, true, false, 0, size);
955 }
956}
957
958static bool unassigned_mem_accepts(void *opaque, hwaddr addr,
959 unsigned size, bool is_write)
960{
961 return false;
962}
963
964const MemoryRegionOps unassigned_mem_ops = {
965 .valid.accepts = unassigned_mem_accepts,
966 .endianness = DEVICE_NATIVE_ENDIAN,
967};
968
969bool memory_region_access_valid(MemoryRegion *mr,
970 hwaddr addr,
971 unsigned size,
972 bool is_write)
973{
974 int access_size_min, access_size_max;
975 int access_size, i;
976
977 if (!mr->ops->valid.unaligned && (addr & (size - 1))) {
978 return false;
979 }
980
981 if (!mr->ops->valid.accepts) {
982 return true;
983 }
984
985 access_size_min = mr->ops->valid.min_access_size;
986 if (!mr->ops->valid.min_access_size) {
987 access_size_min = 1;
988 }
989
990 access_size_max = mr->ops->valid.max_access_size;
991 if (!mr->ops->valid.max_access_size) {
992 access_size_max = 4;
993 }
994
995 access_size = MAX(MIN(size, access_size_max), access_size_min);
996 for (i = 0; i < size; i += access_size) {
997 if (!mr->ops->valid.accepts(mr->opaque, addr + i, access_size,
998 is_write)) {
999 return false;
1000 }
1001 }
1002
1003 return true;
1004}
1005
1006static uint64_t memory_region_dispatch_read1(MemoryRegion *mr,
1007 hwaddr addr,
1008 unsigned size)
1009{
1010 uint64_t data = 0;
1011
1012 if (mr->ops->read) {
1013 access_with_adjusted_size(addr, &data, size,
1014 mr->ops->impl.min_access_size,
1015 mr->ops->impl.max_access_size,
1016 memory_region_read_accessor, mr);
1017 } else {
1018 access_with_adjusted_size(addr, &data, size, 1, 4,
1019 memory_region_oldmmio_read_accessor, mr);
1020 }
1021
1022 return data;
1023}
1024
1025static bool memory_region_dispatch_read(MemoryRegion *mr,
1026 hwaddr addr,
1027 uint64_t *pval,
1028 unsigned size)
1029{
1030 if (!memory_region_access_valid(mr, addr, size, false)) {
1031 *pval = unassigned_mem_read(mr, addr, size);
1032 return true;
1033 }
1034
1035 *pval = memory_region_dispatch_read1(mr, addr, size);
1036 adjust_endianness(mr, pval, size);
1037 return false;
1038}
1039
1040static bool memory_region_dispatch_write(MemoryRegion *mr,
1041 hwaddr addr,
1042 uint64_t data,
1043 unsigned size)
1044{
1045 if (!memory_region_access_valid(mr, addr, size, true)) {
1046 unassigned_mem_write(mr, addr, data, size);
1047 return true;
1048 }
1049
1050 adjust_endianness(mr, &data, size);
1051
1052 if (mr->ops->write) {
1053 access_with_adjusted_size(addr, &data, size,
1054 mr->ops->impl.min_access_size,
1055 mr->ops->impl.max_access_size,
1056 memory_region_write_accessor, mr);
1057 } else {
1058 access_with_adjusted_size(addr, &data, size, 1, 4,
1059 memory_region_oldmmio_write_accessor, mr);
1060 }
1061 return false;
1062}
1063
1064void memory_region_init_io(MemoryRegion *mr,
1065 Object *owner,
1066 const MemoryRegionOps *ops,
1067 void *opaque,
1068 const char *name,
1069 uint64_t size)
1070{
1071 memory_region_init(mr, owner, name, size);
1072 mr->ops = ops;
1073 mr->opaque = opaque;
1074 mr->terminates = true;
1075 mr->ram_addr = ~(ram_addr_t)0;
1076}
1077
1078void memory_region_init_ram(MemoryRegion *mr,
1079 Object *owner,
1080 const char *name,
1081 uint64_t size)
1082{
1083 memory_region_init(mr, owner, name, size);
1084 mr->ram = true;
1085 mr->terminates = true;
1086 mr->destructor = memory_region_destructor_ram;
1087 mr->ram_addr = qemu_ram_alloc(size, mr);
1088}
1089
1090#ifdef __linux__
1091void memory_region_init_ram_from_file(MemoryRegion *mr,
1092 struct Object *owner,
1093 const char *name,
1094 uint64_t size,
1095 bool share,
1096 const char *path,
1097 Error **errp)
1098{
1099 memory_region_init(mr, owner, name, size);
1100 mr->ram = true;
1101 mr->terminates = true;
1102 mr->destructor = memory_region_destructor_ram;
1103 mr->ram_addr = qemu_ram_alloc_from_file(size, mr, share, path, errp);
1104}
1105#endif
1106
1107void memory_region_init_ram_ptr(MemoryRegion *mr,
1108 Object *owner,
1109 const char *name,
1110 uint64_t size,
1111 void *ptr)
1112{
1113 memory_region_init(mr, owner, name, size);
1114 mr->ram = true;
1115 mr->terminates = true;
1116 mr->destructor = memory_region_destructor_ram_from_ptr;
1117 mr->ram_addr = qemu_ram_alloc_from_ptr(size, ptr, mr);
1118}
1119
1120void memory_region_init_alias(MemoryRegion *mr,
1121 Object *owner,
1122 const char *name,
1123 MemoryRegion *orig,
1124 hwaddr offset,
1125 uint64_t size)
1126{
1127 memory_region_init(mr, owner, name, size);
1128 memory_region_ref(orig);
1129 mr->destructor = memory_region_destructor_alias;
1130 mr->alias = orig;
1131 mr->alias_offset = offset;
1132}
1133
1134void memory_region_init_rom_device(MemoryRegion *mr,
1135 Object *owner,
1136 const MemoryRegionOps *ops,
1137 void *opaque,
1138 const char *name,
1139 uint64_t size)
1140{
1141 memory_region_init(mr, owner, name, size);
1142 mr->ops = ops;
1143 mr->opaque = opaque;
1144 mr->terminates = true;
1145 mr->rom_device = true;
1146 mr->destructor = memory_region_destructor_rom_device;
1147 mr->ram_addr = qemu_ram_alloc(size, mr);
1148}
1149
1150void memory_region_init_iommu(MemoryRegion *mr,
1151 Object *owner,
1152 const MemoryRegionIOMMUOps *ops,
1153 const char *name,
1154 uint64_t size)
1155{
1156 memory_region_init(mr, owner, name, size);
1157 mr->iommu_ops = ops,
1158 mr->terminates = true; /* then re-forwards */
1159 notifier_list_init(&mr->iommu_notify);
1160}
1161
1162void memory_region_init_reservation(MemoryRegion *mr,
1163 Object *owner,
1164 const char *name,
1165 uint64_t size)
1166{
1167 memory_region_init_io(mr, owner, &unassigned_mem_ops, mr, name, size);
1168}
1169
1170static void memory_region_finalize(Object *obj)
1171{
1172 MemoryRegion *mr = MEMORY_REGION(obj);
1173
1174 assert(QTAILQ_EMPTY(&mr->subregions));
1175 assert(memory_region_transaction_depth == 0);
1176 mr->destructor(mr);
1177 memory_region_clear_coalescing(mr);
1178 g_free((char *)mr->name);
1179 g_free(mr->ioeventfds);
1180}
1181
1182void memory_region_destroy(MemoryRegion *mr)
1183{
1184 object_unparent(OBJECT(mr));
1185}
1186
1187
1188Object *memory_region_owner(MemoryRegion *mr)
1189{
1190 return mr->owner;
1191}
1192
1193void memory_region_ref(MemoryRegion *mr)
1194{
1195 if (mr && mr->owner) {
1196 object_ref(mr->owner);
1197 } else {
1198 object_ref(OBJECT(mr));
1199 }
1200}
1201
1202void memory_region_unref(MemoryRegion *mr)
1203{
1204 if (mr && mr->owner) {
1205 object_unref(mr->owner);
1206 } else {
1207 object_unref(OBJECT(mr));
1208 }
1209}
1210
1211uint64_t memory_region_size(MemoryRegion *mr)
1212{
1213 if (int128_eq(mr->size, int128_2_64())) {
1214 return UINT64_MAX;
1215 }
1216 return int128_get64(mr->size);
1217}
1218
1219const char *memory_region_name(MemoryRegion *mr)
1220{
1221 return mr->name;
1222}
1223
1224bool memory_region_is_ram(MemoryRegion *mr)
1225{
1226 return mr->ram;
1227}
1228
1229bool memory_region_is_logging(MemoryRegion *mr)
1230{
1231 return mr->dirty_log_mask;
1232}
1233
1234bool memory_region_is_rom(MemoryRegion *mr)
1235{
1236 return mr->ram && mr->readonly;
1237}
1238
1239bool memory_region_is_iommu(MemoryRegion *mr)
1240{
1241 return mr->iommu_ops;
1242}
1243
1244void memory_region_register_iommu_notifier(MemoryRegion *mr, Notifier *n)
1245{
1246 notifier_list_add(&mr->iommu_notify, n);
1247}
1248
1249void memory_region_unregister_iommu_notifier(Notifier *n)
1250{
1251 notifier_remove(n);
1252}
1253
1254void memory_region_notify_iommu(MemoryRegion *mr,
1255 IOMMUTLBEntry entry)
1256{
1257 assert(memory_region_is_iommu(mr));
1258 notifier_list_notify(&mr->iommu_notify, &entry);
1259}
1260
1261void memory_region_set_log(MemoryRegion *mr, bool log, unsigned client)
1262{
1263 uint8_t mask = 1 << client;
1264
1265 memory_region_transaction_begin();
1266 mr->dirty_log_mask = (mr->dirty_log_mask & ~mask) | (log * mask);
1267 memory_region_update_pending |= mr->enabled;
1268 memory_region_transaction_commit();
1269}
1270
1271bool memory_region_get_dirty(MemoryRegion *mr, hwaddr addr,
1272 hwaddr size, unsigned client)
1273{
1274 assert(mr->terminates);
1275 return cpu_physical_memory_get_dirty(mr->ram_addr + addr, size, client);
1276}
1277
1278void memory_region_set_dirty(MemoryRegion *mr, hwaddr addr,
1279 hwaddr size)
1280{
1281 assert(mr->terminates);
1282 cpu_physical_memory_set_dirty_range(mr->ram_addr + addr, size);
1283}
1284
1285bool memory_region_test_and_clear_dirty(MemoryRegion *mr, hwaddr addr,
1286 hwaddr size, unsigned client)
1287{
1288 bool ret;
1289 assert(mr->terminates);
1290 ret = cpu_physical_memory_get_dirty(mr->ram_addr + addr, size, client);
1291 if (ret) {
1292 cpu_physical_memory_reset_dirty(mr->ram_addr + addr, size, client);
1293 }
1294 return ret;
1295}
1296
1297
1298void memory_region_sync_dirty_bitmap(MemoryRegion *mr)
1299{
1300 AddressSpace *as;
1301 FlatRange *fr;
1302
1303 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1304 FlatView *view = address_space_get_flatview(as);
1305 FOR_EACH_FLAT_RANGE(fr, view) {
1306 if (fr->mr == mr) {
1307 MEMORY_LISTENER_UPDATE_REGION(fr, as, Forward, log_sync);
1308 }
1309 }
1310 flatview_unref(view);
1311 }
1312}
1313
1314void memory_region_set_readonly(MemoryRegion *mr, bool readonly)
1315{
1316 if (mr->readonly != readonly) {
1317 memory_region_transaction_begin();
1318 mr->readonly = readonly;
1319 memory_region_update_pending |= mr->enabled;
1320 memory_region_transaction_commit();
1321 }
1322}
1323
1324void memory_region_rom_device_set_romd(MemoryRegion *mr, bool romd_mode)
1325{
1326 if (mr->romd_mode != romd_mode) {
1327 memory_region_transaction_begin();
1328 mr->romd_mode = romd_mode;
1329 memory_region_update_pending |= mr->enabled;
1330 memory_region_transaction_commit();
1331 }
1332}
1333
1334void memory_region_reset_dirty(MemoryRegion *mr, hwaddr addr,
1335 hwaddr size, unsigned client)
1336{
1337 assert(mr->terminates);
1338 cpu_physical_memory_reset_dirty(mr->ram_addr + addr, size, client);
1339}
1340
1341int memory_region_get_fd(MemoryRegion *mr)
1342{
1343 if (mr->alias) {
1344 return memory_region_get_fd(mr->alias);
1345 }
1346
1347 assert(mr->terminates);
1348
1349 return qemu_get_ram_fd(mr->ram_addr & TARGET_PAGE_MASK);
1350}
1351
1352void *memory_region_get_ram_ptr(MemoryRegion *mr)
1353{
1354 if (mr->alias) {
1355 return memory_region_get_ram_ptr(mr->alias) + mr->alias_offset;
1356 }
1357
1358 assert(mr->terminates);
1359
1360 return qemu_get_ram_ptr(mr->ram_addr & TARGET_PAGE_MASK);
1361}
1362
1363static void memory_region_update_coalesced_range_as(MemoryRegion *mr, AddressSpace *as)
1364{
1365 FlatView *view;
1366 FlatRange *fr;
1367 CoalescedMemoryRange *cmr;
1368 AddrRange tmp;
1369 MemoryRegionSection section;
1370
1371 view = address_space_get_flatview(as);
1372 FOR_EACH_FLAT_RANGE(fr, view) {
1373 if (fr->mr == mr) {
1374 section = (MemoryRegionSection) {
1375 .address_space = as,
1376 .offset_within_address_space = int128_get64(fr->addr.start),
1377 .size = fr->addr.size,
1378 };
1379
1380 MEMORY_LISTENER_CALL(coalesced_mmio_del, Reverse, &section,
1381 int128_get64(fr->addr.start),
1382 int128_get64(fr->addr.size));
1383 QTAILQ_FOREACH(cmr, &mr->coalesced, link) {
1384 tmp = addrrange_shift(cmr->addr,
1385 int128_sub(fr->addr.start,
1386 int128_make64(fr->offset_in_region)));
1387 if (!addrrange_intersects(tmp, fr->addr)) {
1388 continue;
1389 }
1390 tmp = addrrange_intersection(tmp, fr->addr);
1391 MEMORY_LISTENER_CALL(coalesced_mmio_add, Forward, &section,
1392 int128_get64(tmp.start),
1393 int128_get64(tmp.size));
1394 }
1395 }
1396 }
1397 flatview_unref(view);
1398}
1399
1400static void memory_region_update_coalesced_range(MemoryRegion *mr)
1401{
1402 AddressSpace *as;
1403
1404 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1405 memory_region_update_coalesced_range_as(mr, as);
1406 }
1407}
1408
1409void memory_region_set_coalescing(MemoryRegion *mr)
1410{
1411 memory_region_clear_coalescing(mr);
1412 memory_region_add_coalescing(mr, 0, int128_get64(mr->size));
1413}
1414
1415void memory_region_add_coalescing(MemoryRegion *mr,
1416 hwaddr offset,
1417 uint64_t size)
1418{
1419 CoalescedMemoryRange *cmr = g_malloc(sizeof(*cmr));
1420
1421 cmr->addr = addrrange_make(int128_make64(offset), int128_make64(size));
1422 QTAILQ_INSERT_TAIL(&mr->coalesced, cmr, link);
1423 memory_region_update_coalesced_range(mr);
1424 memory_region_set_flush_coalesced(mr);
1425}
1426
1427void memory_region_clear_coalescing(MemoryRegion *mr)
1428{
1429 CoalescedMemoryRange *cmr;
1430 bool updated = false;
1431
1432 qemu_flush_coalesced_mmio_buffer();
1433 mr->flush_coalesced_mmio = false;
1434
1435 while (!QTAILQ_EMPTY(&mr->coalesced)) {
1436 cmr = QTAILQ_FIRST(&mr->coalesced);
1437 QTAILQ_REMOVE(&mr->coalesced, cmr, link);
1438 g_free(cmr);
1439 updated = true;
1440 }
1441
1442 if (updated) {
1443 memory_region_update_coalesced_range(mr);
1444 }
1445}
1446
1447void memory_region_set_flush_coalesced(MemoryRegion *mr)
1448{
1449 mr->flush_coalesced_mmio = true;
1450}
1451
1452void memory_region_clear_flush_coalesced(MemoryRegion *mr)
1453{
1454 qemu_flush_coalesced_mmio_buffer();
1455 if (QTAILQ_EMPTY(&mr->coalesced)) {
1456 mr->flush_coalesced_mmio = false;
1457 }
1458}
1459
1460void memory_region_add_eventfd(MemoryRegion *mr,
1461 hwaddr addr,
1462 unsigned size,
1463 bool match_data,
1464 uint64_t data,
1465 EventNotifier *e)
1466{
1467 MemoryRegionIoeventfd mrfd = {
1468 .addr.start = int128_make64(addr),
1469 .addr.size = int128_make64(size),
1470 .match_data = match_data,
1471 .data = data,
1472 .e = e,
1473 };
1474 unsigned i;
1475
1476 adjust_endianness(mr, &mrfd.data, size);
1477 memory_region_transaction_begin();
1478 for (i = 0; i < mr->ioeventfd_nb; ++i) {
1479 if (memory_region_ioeventfd_before(mrfd, mr->ioeventfds[i])) {
1480 break;
1481 }
1482 }
1483 ++mr->ioeventfd_nb;
1484 mr->ioeventfds = g_realloc(mr->ioeventfds,
1485 sizeof(*mr->ioeventfds) * mr->ioeventfd_nb);
1486 memmove(&mr->ioeventfds[i+1], &mr->ioeventfds[i],
1487 sizeof(*mr->ioeventfds) * (mr->ioeventfd_nb-1 - i));
1488 mr->ioeventfds[i] = mrfd;
1489 ioeventfd_update_pending |= mr->enabled;
1490 memory_region_transaction_commit();
1491}
1492
1493void memory_region_del_eventfd(MemoryRegion *mr,
1494 hwaddr addr,
1495 unsigned size,
1496 bool match_data,
1497 uint64_t data,
1498 EventNotifier *e)
1499{
1500 MemoryRegionIoeventfd mrfd = {
1501 .addr.start = int128_make64(addr),
1502 .addr.size = int128_make64(size),
1503 .match_data = match_data,
1504 .data = data,
1505 .e = e,
1506 };
1507 unsigned i;
1508
1509 adjust_endianness(mr, &mrfd.data, size);
1510 memory_region_transaction_begin();
1511 for (i = 0; i < mr->ioeventfd_nb; ++i) {
1512 if (memory_region_ioeventfd_equal(mrfd, mr->ioeventfds[i])) {
1513 break;
1514 }
1515 }
1516 assert(i != mr->ioeventfd_nb);
1517 memmove(&mr->ioeventfds[i], &mr->ioeventfds[i+1],
1518 sizeof(*mr->ioeventfds) * (mr->ioeventfd_nb - (i+1)));
1519 --mr->ioeventfd_nb;
1520 mr->ioeventfds = g_realloc(mr->ioeventfds,
1521 sizeof(*mr->ioeventfds)*mr->ioeventfd_nb + 1);
1522 ioeventfd_update_pending |= mr->enabled;
1523 memory_region_transaction_commit();
1524}
1525
1526static void memory_region_update_container_subregions(MemoryRegion *subregion)
1527{
1528 hwaddr offset = subregion->addr;
1529 MemoryRegion *mr = subregion->container;
1530 MemoryRegion *other;
1531
1532 memory_region_transaction_begin();
1533
1534 memory_region_ref(subregion);
1535 QTAILQ_FOREACH(other, &mr->subregions, subregions_link) {
1536 if (subregion->may_overlap || other->may_overlap) {
1537 continue;
1538 }
1539 if (int128_ge(int128_make64(offset),
1540 int128_add(int128_make64(other->addr), other->size))
1541 || int128_le(int128_add(int128_make64(offset), subregion->size),
1542 int128_make64(other->addr))) {
1543 continue;
1544 }
1545#if 0
1546 printf("warning: subregion collision %llx/%llx (%s) "
1547 "vs %llx/%llx (%s)\n",
1548 (unsigned long long)offset,
1549 (unsigned long long)int128_get64(subregion->size),
1550 subregion->name,
1551 (unsigned long long)other->addr,
1552 (unsigned long long)int128_get64(other->size),
1553 other->name);
1554#endif
1555 }
1556 QTAILQ_FOREACH(other, &mr->subregions, subregions_link) {
1557 if (subregion->priority >= other->priority) {
1558 QTAILQ_INSERT_BEFORE(other, subregion, subregions_link);
1559 goto done;
1560 }
1561 }
1562 QTAILQ_INSERT_TAIL(&mr->subregions, subregion, subregions_link);
1563done:
1564 memory_region_update_pending |= mr->enabled && subregion->enabled;
1565 memory_region_transaction_commit();
1566}
1567
1568static void memory_region_add_subregion_common(MemoryRegion *mr,
1569 hwaddr offset,
1570 MemoryRegion *subregion)
1571{
1572 assert(!subregion->container);
1573 subregion->container = mr;
1574 subregion->addr = offset;
1575 memory_region_update_container_subregions(subregion);
1576}
1577
1578void memory_region_add_subregion(MemoryRegion *mr,
1579 hwaddr offset,
1580 MemoryRegion *subregion)
1581{
1582 subregion->may_overlap = false;
1583 subregion->priority = 0;
1584 memory_region_add_subregion_common(mr, offset, subregion);
1585}
1586
1587void memory_region_add_subregion_overlap(MemoryRegion *mr,
1588 hwaddr offset,
1589 MemoryRegion *subregion,
1590 int priority)
1591{
1592 subregion->may_overlap = true;
1593 subregion->priority = priority;
1594 memory_region_add_subregion_common(mr, offset, subregion);
1595}
1596
1597void memory_region_del_subregion(MemoryRegion *mr,
1598 MemoryRegion *subregion)
1599{
1600 memory_region_transaction_begin();
1601 assert(subregion->container == mr);
1602 subregion->container = NULL;
1603 QTAILQ_REMOVE(&mr->subregions, subregion, subregions_link);
1604 memory_region_unref(subregion);
1605 memory_region_update_pending |= mr->enabled && subregion->enabled;
1606 memory_region_transaction_commit();
1607}
1608
1609void memory_region_set_enabled(MemoryRegion *mr, bool enabled)
1610{
1611 if (enabled == mr->enabled) {
1612 return;
1613 }
1614 memory_region_transaction_begin();
1615 mr->enabled = enabled;
1616 memory_region_update_pending = true;
1617 memory_region_transaction_commit();
1618}
1619
1620static void memory_region_readd_subregion(MemoryRegion *mr)
1621{
1622 MemoryRegion *container = mr->container;
1623
1624 if (container) {
1625 memory_region_transaction_begin();
1626 memory_region_ref(mr);
1627 memory_region_del_subregion(container, mr);
1628 mr->container = container;
1629 memory_region_update_container_subregions(mr);
1630 memory_region_unref(mr);
1631 memory_region_transaction_commit();
1632 }
1633}
1634
1635void memory_region_set_address(MemoryRegion *mr, hwaddr addr)
1636{
1637 if (addr != mr->addr) {
1638 mr->addr = addr;
1639 memory_region_readd_subregion(mr);
1640 }
1641}
1642
1643void memory_region_set_alias_offset(MemoryRegion *mr, hwaddr offset)
1644{
1645 assert(mr->alias);
1646
1647 if (offset == mr->alias_offset) {
1648 return;
1649 }
1650
1651 memory_region_transaction_begin();
1652 mr->alias_offset = offset;
1653 memory_region_update_pending |= mr->enabled;
1654 memory_region_transaction_commit();
1655}
1656
1657ram_addr_t memory_region_get_ram_addr(MemoryRegion *mr)
1658{
1659 return mr->ram_addr;
1660}
1661
1662static int cmp_flatrange_addr(const void *addr_, const void *fr_)
1663{
1664 const AddrRange *addr = addr_;
1665 const FlatRange *fr = fr_;
1666
1667 if (int128_le(addrrange_end(*addr), fr->addr.start)) {
1668 return -1;
1669 } else if (int128_ge(addr->start, addrrange_end(fr->addr))) {
1670 return 1;
1671 }
1672 return 0;
1673}
1674
1675static FlatRange *flatview_lookup(FlatView *view, AddrRange addr)
1676{
1677 return bsearch(&addr, view->ranges, view->nr,
1678 sizeof(FlatRange), cmp_flatrange_addr);
1679}
1680
1681bool memory_region_present(MemoryRegion *container, hwaddr addr)
1682{
1683 MemoryRegion *mr = memory_region_find(container, addr, 1).mr;
1684 if (!mr || (mr == container)) {
1685 return false;
1686 }
1687 memory_region_unref(mr);
1688 return true;
1689}
1690
1691bool memory_region_is_mapped(MemoryRegion *mr)
1692{
1693 return mr->container ? true : false;
1694}
1695
1696MemoryRegionSection memory_region_find(MemoryRegion *mr,
1697 hwaddr addr, uint64_t size)
1698{
1699 MemoryRegionSection ret = { .mr = NULL };
1700 MemoryRegion *root;
1701 AddressSpace *as;
1702 AddrRange range;
1703 FlatView *view;
1704 FlatRange *fr;
1705
1706 addr += mr->addr;
1707 for (root = mr; root->container; ) {
1708 root = root->container;
1709 addr += root->addr;
1710 }
1711
1712 as = memory_region_to_address_space(root);
1713 if (!as) {
1714 return ret;
1715 }
1716 range = addrrange_make(int128_make64(addr), int128_make64(size));
1717
1718 view = address_space_get_flatview(as);
1719 fr = flatview_lookup(view, range);
1720 if (!fr) {
1721 flatview_unref(view);
1722 return ret;
1723 }
1724
1725 while (fr > view->ranges && addrrange_intersects(fr[-1].addr, range)) {
1726 --fr;
1727 }
1728
1729 ret.mr = fr->mr;
1730 ret.address_space = as;
1731 range = addrrange_intersection(range, fr->addr);
1732 ret.offset_within_region = fr->offset_in_region;
1733 ret.offset_within_region += int128_get64(int128_sub(range.start,
1734 fr->addr.start));
1735 ret.size = range.size;
1736 ret.offset_within_address_space = int128_get64(range.start);
1737 ret.readonly = fr->readonly;
1738 memory_region_ref(ret.mr);
1739
1740 flatview_unref(view);
1741 return ret;
1742}
1743
1744void address_space_sync_dirty_bitmap(AddressSpace *as)
1745{
1746 FlatView *view;
1747 FlatRange *fr;
1748
1749 view = address_space_get_flatview(as);
1750 FOR_EACH_FLAT_RANGE(fr, view) {
1751 MEMORY_LISTENER_UPDATE_REGION(fr, as, Forward, log_sync);
1752 }
1753 flatview_unref(view);
1754}
1755
1756void memory_global_dirty_log_start(void)
1757{
1758 global_dirty_log = true;
1759 MEMORY_LISTENER_CALL_GLOBAL(log_global_start, Forward);
1760}
1761
1762void memory_global_dirty_log_stop(void)
1763{
1764 global_dirty_log = false;
1765 MEMORY_LISTENER_CALL_GLOBAL(log_global_stop, Reverse);
1766}
1767
1768static void listener_add_address_space(MemoryListener *listener,
1769 AddressSpace *as)
1770{
1771 FlatView *view;
1772 FlatRange *fr;
1773
1774 if (listener->address_space_filter
1775 && listener->address_space_filter != as) {
1776 return;
1777 }
1778
1779 if (global_dirty_log) {
1780 if (listener->log_global_start) {
1781 listener->log_global_start(listener);
1782 }
1783 }
1784
1785 view = address_space_get_flatview(as);
1786 FOR_EACH_FLAT_RANGE(fr, view) {
1787 MemoryRegionSection section = {
1788 .mr = fr->mr,
1789 .address_space = as,
1790 .offset_within_region = fr->offset_in_region,
1791 .size = fr->addr.size,
1792 .offset_within_address_space = int128_get64(fr->addr.start),
1793 .readonly = fr->readonly,
1794 };
1795 if (listener->region_add) {
1796 listener->region_add(listener, &section);
1797 }
1798 }
1799 flatview_unref(view);
1800}
1801
1802void memory_listener_register(MemoryListener *listener, AddressSpace *filter)
1803{
1804 MemoryListener *other = NULL;
1805 AddressSpace *as;
1806
1807 listener->address_space_filter = filter;
1808 if (QTAILQ_EMPTY(&memory_listeners)
1809 || listener->priority >= QTAILQ_LAST(&memory_listeners,
1810 memory_listeners)->priority) {
1811 QTAILQ_INSERT_TAIL(&memory_listeners, listener, link);
1812 } else {
1813 QTAILQ_FOREACH(other, &memory_listeners, link) {
1814 if (listener->priority < other->priority) {
1815 break;
1816 }
1817 }
1818 QTAILQ_INSERT_BEFORE(other, listener, link);
1819 }
1820
1821 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1822 listener_add_address_space(listener, as);
1823 }
1824}
1825
1826void memory_listener_unregister(MemoryListener *listener)
1827{
1828 QTAILQ_REMOVE(&memory_listeners, listener, link);
1829}
1830
1831void address_space_init(AddressSpace *as, MemoryRegion *root, const char *name)
1832{
1833 if (QTAILQ_EMPTY(&address_spaces)) {
1834 memory_init();
1835 }
1836
1837 memory_region_transaction_begin();
1838 as->root = root;
1839 as->current_map = g_new(FlatView, 1);
1840 flatview_init(as->current_map);
1841 as->ioeventfd_nb = 0;
1842 as->ioeventfds = NULL;
1843 QTAILQ_INSERT_TAIL(&address_spaces, as, address_spaces_link);
1844 as->name = g_strdup(name ? name : "anonymous");
1845 address_space_init_dispatch(as);
1846 memory_region_update_pending |= root->enabled;
1847 memory_region_transaction_commit();
1848}
1849
1850void address_space_destroy(AddressSpace *as)
1851{
1852 MemoryListener *listener;
1853
1854 /* Flush out anything from MemoryListeners listening in on this */
1855 memory_region_transaction_begin();
1856 as->root = NULL;
1857 memory_region_transaction_commit();
1858 QTAILQ_REMOVE(&address_spaces, as, address_spaces_link);
1859 address_space_destroy_dispatch(as);
1860
1861 QTAILQ_FOREACH(listener, &memory_listeners, link) {
1862 assert(listener->address_space_filter != as);
1863 }
1864
1865 flatview_unref(as->current_map);
1866 g_free(as->name);
1867 g_free(as->ioeventfds);
1868}
1869
1870bool io_mem_read(MemoryRegion *mr, hwaddr addr, uint64_t *pval, unsigned size)
1871{
1872 return memory_region_dispatch_read(mr, addr, pval, size);
1873}
1874
1875bool io_mem_write(MemoryRegion *mr, hwaddr addr,
1876 uint64_t val, unsigned size)
1877{
1878 return memory_region_dispatch_write(mr, addr, val, size);
1879}
1880
1881typedef struct MemoryRegionList MemoryRegionList;
1882
1883struct MemoryRegionList {
1884 const MemoryRegion *mr;
1885 bool printed;
1886 QTAILQ_ENTRY(MemoryRegionList) queue;
1887};
1888
1889typedef QTAILQ_HEAD(queue, MemoryRegionList) MemoryRegionListHead;
1890
1891static void mtree_print_mr(fprintf_function mon_printf, void *f,
1892 const MemoryRegion *mr, unsigned int level,
1893 hwaddr base,
1894 MemoryRegionListHead *alias_print_queue)
1895{
1896 MemoryRegionList *new_ml, *ml, *next_ml;
1897 MemoryRegionListHead submr_print_queue;
1898 const MemoryRegion *submr;
1899 unsigned int i;
1900
1901 if (!mr || !mr->enabled) {
1902 return;
1903 }
1904
1905 for (i = 0; i < level; i++) {
1906 mon_printf(f, " ");
1907 }
1908
1909 if (mr->alias) {
1910 MemoryRegionList *ml;
1911 bool found = false;
1912
1913 /* check if the alias is already in the queue */
1914 QTAILQ_FOREACH(ml, alias_print_queue, queue) {
1915 if (ml->mr == mr->alias && !ml->printed) {
1916 found = true;
1917 }
1918 }
1919
1920 if (!found) {
1921 ml = g_new(MemoryRegionList, 1);
1922 ml->mr = mr->alias;
1923 ml->printed = false;
1924 QTAILQ_INSERT_TAIL(alias_print_queue, ml, queue);
1925 }
1926 mon_printf(f, TARGET_FMT_plx "-" TARGET_FMT_plx
1927 " (prio %d, %c%c): alias %s @%s " TARGET_FMT_plx
1928 "-" TARGET_FMT_plx "\n",
1929 base + mr->addr,
1930 base + mr->addr
1931 + (int128_nz(mr->size) ?
1932 (hwaddr)int128_get64(int128_sub(mr->size,
1933 int128_one())) : 0),
1934 mr->priority,
1935 mr->romd_mode ? 'R' : '-',
1936 !mr->readonly && !(mr->rom_device && mr->romd_mode) ? 'W'
1937 : '-',
1938 mr->name,
1939 mr->alias->name,
1940 mr->alias_offset,
1941 mr->alias_offset
1942 + (int128_nz(mr->size) ?
1943 (hwaddr)int128_get64(int128_sub(mr->size,
1944 int128_one())) : 0));
1945 } else {
1946 mon_printf(f,
1947 TARGET_FMT_plx "-" TARGET_FMT_plx " (prio %d, %c%c): %s\n",
1948 base + mr->addr,
1949 base + mr->addr
1950 + (int128_nz(mr->size) ?
1951 (hwaddr)int128_get64(int128_sub(mr->size,
1952 int128_one())) : 0),
1953 mr->priority,
1954 mr->romd_mode ? 'R' : '-',
1955 !mr->readonly && !(mr->rom_device && mr->romd_mode) ? 'W'
1956 : '-',
1957 mr->name);
1958 }
1959
1960 QTAILQ_INIT(&submr_print_queue);
1961
1962 QTAILQ_FOREACH(submr, &mr->subregions, subregions_link) {
1963 new_ml = g_new(MemoryRegionList, 1);
1964 new_ml->mr = submr;
1965 QTAILQ_FOREACH(ml, &submr_print_queue, queue) {
1966 if (new_ml->mr->addr < ml->mr->addr ||
1967 (new_ml->mr->addr == ml->mr->addr &&
1968 new_ml->mr->priority > ml->mr->priority)) {
1969 QTAILQ_INSERT_BEFORE(ml, new_ml, queue);
1970 new_ml = NULL;
1971 break;
1972 }
1973 }
1974 if (new_ml) {
1975 QTAILQ_INSERT_TAIL(&submr_print_queue, new_ml, queue);
1976 }
1977 }
1978
1979 QTAILQ_FOREACH(ml, &submr_print_queue, queue) {
1980 mtree_print_mr(mon_printf, f, ml->mr, level + 1, base + mr->addr,
1981 alias_print_queue);
1982 }
1983
1984 QTAILQ_FOREACH_SAFE(ml, &submr_print_queue, queue, next_ml) {
1985 g_free(ml);
1986 }
1987}
1988
1989void mtree_info(fprintf_function mon_printf, void *f)
1990{
1991 MemoryRegionListHead ml_head;
1992 MemoryRegionList *ml, *ml2;
1993 AddressSpace *as;
1994
1995 QTAILQ_INIT(&ml_head);
1996
1997 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1998 mon_printf(f, "%s\n", as->name);
1999 mtree_print_mr(mon_printf, f, as->root, 0, 0, &ml_head);
2000 }
2001
2002 mon_printf(f, "aliases\n");
2003 /* print aliased regions */
2004 QTAILQ_FOREACH(ml, &ml_head, queue) {
2005 if (!ml->printed) {
2006 mon_printf(f, "%s\n", ml->mr->name);
2007 mtree_print_mr(mon_printf, f, ml->mr, 0, 0, &ml_head);
2008 }
2009 }
2010
2011 QTAILQ_FOREACH_SAFE(ml, &ml_head, queue, ml2) {
2012 g_free(ml);
2013 }
2014}
2015
2016static const TypeInfo memory_region_info = {
2017 .parent = TYPE_OBJECT,
2018 .name = TYPE_MEMORY_REGION,
2019 .instance_size = sizeof(MemoryRegion),
2020 .instance_init = memory_region_initfn,
2021 .instance_finalize = memory_region_finalize,
2022};
2023
2024static void memory_register_types(void)
2025{
2026 type_register_static(&memory_region_info);
2027}
2028
2029type_init(memory_register_types)
QEMU mirror