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