?  search:
summary | log | graphiclog1 | graphiclog2 | commit | commitdiff | tree | refs | edit | fork
blame | history | raw | HEAD
usb: don't use 'Yoda conditions'
[qemu/ar7.git] / memory.c
blobdbe66755896ccd7ef3e43b627ffc043baa4e2dd3
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 static unsigned memory_region_transaction_depth;
32 static bool memory_region_update_pending;
33 static bool ioeventfd_update_pending;
34 static bool global_dirty_log = false;
35
36 /* flat_view_mutex is taken around reading as->current_map; the critical
37 * section is extremely short, so I'm using a single mutex for every AS.
38 * We could also RCU for the read-side.
39 *
40 * The BQL is taken around transaction commits, hence both locks are taken
41 * while writing to as->current_map (with the BQL taken outside).
42 */
43 static QemuMutex flat_view_mutex;
44
45 static QTAILQ_HEAD(memory_listeners, MemoryListener) memory_listeners
46 = QTAILQ_HEAD_INITIALIZER(memory_listeners);
47
48 static QTAILQ_HEAD(, AddressSpace) address_spaces
49 = QTAILQ_HEAD_INITIALIZER(address_spaces);
50
51 static void memory_init(void)
52 {
53 qemu_mutex_init(&flat_view_mutex);
54 }
55
56 typedef struct AddrRange AddrRange;
57
58 /*
59 * Note that signed integers are needed for negative offsetting in aliases
60 * (large MemoryRegion::alias_offset).
61 */
62 struct AddrRange {
63 Int128 start;
64 Int128 size;
65 };
66
67 static AddrRange addrrange_make(Int128 start, Int128 size)
68 {
69 return (AddrRange) { start, size };
70 }
71
72 static bool addrrange_equal(AddrRange r1, AddrRange r2)
73 {
74 return int128_eq(r1.start, r2.start) && int128_eq(r1.size, r2.size);
75 }
76
77 static Int128 addrrange_end(AddrRange r)
78 {
79 return int128_add(r.start, r.size);
80 }
81
82 static AddrRange addrrange_shift(AddrRange range, Int128 delta)
83 {
84 int128_addto(&range.start, delta);
85 return range;
86 }
87
88 static bool addrrange_contains(AddrRange range, Int128 addr)
89 {
90 return int128_ge(addr, range.start)
91 && int128_lt(addr, addrrange_end(range));
92 }
93
94 static bool addrrange_intersects(AddrRange r1, AddrRange r2)
95 {
96 return addrrange_contains(r1, r2.start)
97 || addrrange_contains(r2, r1.start);
98 }
99
100 static 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
107 enum ListenerDirection { Forward, Reverse };
108
109 static 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
179 struct CoalescedMemoryRange {
180 AddrRange addr;
181 QTAILQ_ENTRY(CoalescedMemoryRange) link;
182 };
183
184 struct MemoryRegionIoeventfd {
185 AddrRange addr;
186 bool match_data;
187 uint64_t data;
188 EventNotifier *e;
189 };
190
191 static 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
221 static 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
228 typedef struct FlatRange FlatRange;
229 typedef struct FlatView FlatView;
230
231 /* Range of memory in the global map. Addresses are absolute. */
232 struct 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 */
244 struct FlatView {
245 unsigned ref;
246 FlatRange *ranges;
247 unsigned nr;
248 unsigned nr_allocated;
249 };
250
251 typedef struct AddressSpaceOps AddressSpaceOps;
252
253 #define FOR_EACH_FLAT_RANGE(var, view) \
254 for (var = (view)->ranges; var < (view)->ranges + (view)->nr; ++var)
255
256 static 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
265 static 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 */
276 static 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
290 static 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
301 static void flatview_ref(FlatView *view)
302 {
303 atomic_inc(&view->ref);
304 }
305
306 static void flatview_unref(FlatView *view)
307 {
308 if (atomic_fetch_dec(&view->ref) == 1) {
309 flatview_destroy(view);
310 }
311 }
312
313 static 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 */
326 static 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
345 static 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
354 static 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
363 static 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
384 static 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
398 static 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
415 static 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
429 static 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
446 static 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
485 static 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 */
503 static 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. */
588 static 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
604 static 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
653 static 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
664 static 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
698 static 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
761 static 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
785 void memory_region_transaction_begin(void)
786 {
787 qemu_flush_coalesced_mmio_buffer();
788 ++memory_region_transaction_depth;
789 }
790
791 static void memory_region_clear_pending(void)
792 {
793 memory_region_update_pending = false;
794 ioeventfd_update_pending = false;
795 }
796
797 void 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
821 static void memory_region_destructor_none(MemoryRegion *mr)
822 {
823 }
824
825 static void memory_region_destructor_ram(MemoryRegion *mr)
826 {
827 qemu_ram_free(mr->ram_addr);
828 }
829
830 static void memory_region_destructor_alias(MemoryRegion *mr)
831 {
832 memory_region_unref(mr->alias);
833 }
834
835 static void memory_region_destructor_ram_from_ptr(MemoryRegion *mr)
836 {
837 qemu_ram_free_from_ptr(mr->ram_addr);
838 }
839
840 static void memory_region_destructor_rom_device(MemoryRegion *mr)
841 {
842 qemu_ram_free(mr->ram_addr & TARGET_PAGE_MASK);
843 }
844
845 static bool memory_region_need_escape(char c)
846 {
847 return c == '/' || c == '[' || c == '\\' || c == ']';
848 }
849
850 static 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
879 static 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
903 void memory_region_init(MemoryRegion *mr,
904 Object *owner,
905 const char *name,
906 uint64_t size)
907 {
908 if (!owner) {
909 owner = qdev_get_machine();
910 }
911
912 object_initialize(mr, sizeof(*mr), TYPE_MEMORY_REGION);
913 mr->size = int128_make64(size);
914 if (size == UINT64_MAX) {
915 mr->size = int128_2_64();
916 }
917 mr->name = g_strdup(name);
918
919 if (name) {
920 object_property_add_child_array(owner, name, OBJECT(mr));
921 object_unref(OBJECT(mr));
922 }
923 }
924
925 static void memory_region_get_addr(Object *obj, Visitor *v, void *opaque,
926 const char *name, Error **errp)
927 {
928 MemoryRegion *mr = MEMORY_REGION(obj);
929 uint64_t value = mr->addr;
930
931 visit_type_uint64(v, &value, name, errp);
932 }
933
934 static void memory_region_get_container(Object *obj, Visitor *v, void *opaque,
935 const char *name, Error **errp)
936 {
937 MemoryRegion *mr = MEMORY_REGION(obj);
938 gchar *path = (gchar *)"";
939
940 if (mr->container) {
941 path = object_get_canonical_path(OBJECT(mr->container));
942 }
943 visit_type_str(v, &path, name, errp);
944 if (mr->container) {
945 g_free(path);
946 }
947 }
948
949 static Object *memory_region_resolve_container(Object *obj, void *opaque,
950 const char *part)
951 {
952 MemoryRegion *mr = MEMORY_REGION(obj);
953
954 return OBJECT(mr->container);
955 }
956
957 static void memory_region_get_priority(Object *obj, Visitor *v, void *opaque,
958 const char *name, Error **errp)
959 {
960 MemoryRegion *mr = MEMORY_REGION(obj);
961 int32_t value = mr->priority;
962
963 visit_type_int32(v, &value, name, errp);
964 }
965
966 static bool memory_region_get_may_overlap(Object *obj, Error **errp)
967 {
968 MemoryRegion *mr = MEMORY_REGION(obj);
969
970 return mr->may_overlap;
971 }
972
973 static void memory_region_get_size(Object *obj, Visitor *v, void *opaque,
974 const char *name, Error **errp)
975 {
976 MemoryRegion *mr = MEMORY_REGION(obj);
977 uint64_t value = memory_region_size(mr);
978
979 visit_type_uint64(v, &value, name, errp);
980 }
981
982 static void memory_region_initfn(Object *obj)
983 {
984 MemoryRegion *mr = MEMORY_REGION(obj);
985 ObjectProperty *op;
986
987 mr->ops = &unassigned_mem_ops;
988 mr->enabled = true;
989 mr->romd_mode = true;
990 mr->destructor = memory_region_destructor_none;
991 QTAILQ_INIT(&mr->subregions);
992 QTAILQ_INIT(&mr->coalesced);
993
994 op = object_property_add(OBJECT(mr), "container",
995 "link<" TYPE_MEMORY_REGION ">",
996 memory_region_get_container,
997 NULL, /* memory_region_set_container */
998 NULL, NULL, &error_abort);
999 op->resolve = memory_region_resolve_container;
1000
1001 object_property_add(OBJECT(mr), "addr", "uint64",
1002 memory_region_get_addr,
1003 NULL, /* memory_region_set_addr */
1004 NULL, NULL, &error_abort);
1005 object_property_add(OBJECT(mr), "priority", "uint32",
1006 memory_region_get_priority,
1007 NULL, /* memory_region_set_priority */
1008 NULL, NULL, &error_abort);
1009 object_property_add_bool(OBJECT(mr), "may-overlap",
1010 memory_region_get_may_overlap,
1011 NULL, /* memory_region_set_may_overlap */
1012 &error_abort);
1013 object_property_add(OBJECT(mr), "size", "uint64",
1014 memory_region_get_size,
1015 NULL, /* memory_region_set_size, */
1016 NULL, NULL, &error_abort);
1017 }
1018
1019 static uint64_t unassigned_mem_read(void *opaque, hwaddr addr,
1020 unsigned size)
1021 {
1022 #ifdef DEBUG_UNASSIGNED
1023 printf("Unassigned mem read " TARGET_FMT_plx "\n", addr);
1024 #endif
1025 if (current_cpu != NULL) {
1026 cpu_unassigned_access(current_cpu, addr, false, false, 0, size);
1027 }
1028 return 0;
1029 }
1030
1031 static void unassigned_mem_write(void *opaque, hwaddr addr,
1032 uint64_t val, unsigned size)
1033 {
1034 #ifdef DEBUG_UNASSIGNED
1035 printf("Unassigned mem write " TARGET_FMT_plx " = 0x%"PRIx64"\n", addr, val);
1036 #endif
1037 if (current_cpu != NULL) {
1038 cpu_unassigned_access(current_cpu, addr, true, false, 0, size);
1039 }
1040 }
1041
1042 static bool unassigned_mem_accepts(void *opaque, hwaddr addr,
1043 unsigned size, bool is_write)
1044 {
1045 return false;
1046 }
1047
1048 const MemoryRegionOps unassigned_mem_ops = {
1049 .valid.accepts = unassigned_mem_accepts,
1050 .endianness = DEVICE_NATIVE_ENDIAN,
1051 };
1052
1053 bool memory_region_access_valid(MemoryRegion *mr,
1054 hwaddr addr,
1055 unsigned size,
1056 bool is_write)
1057 {
1058 int access_size_min, access_size_max;
1059 int access_size, i;
1060
1061 if (!mr->ops->valid.unaligned && (addr & (size - 1))) {
1062 return false;
1063 }
1064
1065 if (!mr->ops->valid.accepts) {
1066 return true;
1067 }
1068
1069 access_size_min = mr->ops->valid.min_access_size;
1070 if (!mr->ops->valid.min_access_size) {
1071 access_size_min = 1;
1072 }
1073
1074 access_size_max = mr->ops->valid.max_access_size;
1075 if (!mr->ops->valid.max_access_size) {
1076 access_size_max = 4;
1077 }
1078
1079 access_size = MAX(MIN(size, access_size_max), access_size_min);
1080 for (i = 0; i < size; i += access_size) {
1081 if (!mr->ops->valid.accepts(mr->opaque, addr + i, access_size,
1082 is_write)) {
1083 return false;
1084 }
1085 }
1086
1087 return true;
1088 }
1089
1090 static uint64_t memory_region_dispatch_read1(MemoryRegion *mr,
1091 hwaddr addr,
1092 unsigned size)
1093 {
1094 uint64_t data = 0;
1095
1096 if (mr->ops->read) {
1097 access_with_adjusted_size(addr, &data, size,
1098 mr->ops->impl.min_access_size,
1099 mr->ops->impl.max_access_size,
1100 memory_region_read_accessor, mr);
1101 } else {
1102 access_with_adjusted_size(addr, &data, size, 1, 4,
1103 memory_region_oldmmio_read_accessor, mr);
1104 }
1105
1106 return data;
1107 }
1108
1109 static bool memory_region_dispatch_read(MemoryRegion *mr,
1110 hwaddr addr,
1111 uint64_t *pval,
1112 unsigned size)
1113 {
1114 if (!memory_region_access_valid(mr, addr, size, false)) {
1115 *pval = unassigned_mem_read(mr, addr, size);
1116 return true;
1117 }
1118
1119 *pval = memory_region_dispatch_read1(mr, addr, size);
1120 adjust_endianness(mr, pval, size);
1121 return false;
1122 }
1123
1124 static bool memory_region_dispatch_write(MemoryRegion *mr,
1125 hwaddr addr,
1126 uint64_t data,
1127 unsigned size)
1128 {
1129 if (!memory_region_access_valid(mr, addr, size, true)) {
1130 unassigned_mem_write(mr, addr, data, size);
1131 return true;
1132 }
1133
1134 adjust_endianness(mr, &data, size);
1135
1136 if (mr->ops->write) {
1137 access_with_adjusted_size(addr, &data, size,
1138 mr->ops->impl.min_access_size,
1139 mr->ops->impl.max_access_size,
1140 memory_region_write_accessor, mr);
1141 } else {
1142 access_with_adjusted_size(addr, &data, size, 1, 4,
1143 memory_region_oldmmio_write_accessor, mr);
1144 }
1145 return false;
1146 }
1147
1148 void memory_region_init_io(MemoryRegion *mr,
1149 Object *owner,
1150 const MemoryRegionOps *ops,
1151 void *opaque,
1152 const char *name,
1153 uint64_t size)
1154 {
1155 memory_region_init(mr, owner, name, size);
1156 mr->ops = ops;
1157 mr->opaque = opaque;
1158 mr->terminates = true;
1159 mr->ram_addr = ~(ram_addr_t)0;
1160 }
1161
1162 void memory_region_init_ram(MemoryRegion *mr,
1163 Object *owner,
1164 const char *name,
1165 uint64_t size)
1166 {
1167 memory_region_init(mr, owner, name, size);
1168 mr->ram = true;
1169 mr->terminates = true;
1170 mr->destructor = memory_region_destructor_ram;
1171 mr->ram_addr = qemu_ram_alloc(size, mr);
1172 }
1173
1174 #ifdef __linux__
1175 void memory_region_init_ram_from_file(MemoryRegion *mr,
1176 struct Object *owner,
1177 const char *name,
1178 uint64_t size,
1179 bool share,
1180 const char *path,
1181 Error **errp)
1182 {
1183 memory_region_init(mr, owner, name, size);
1184 mr->ram = true;
1185 mr->terminates = true;
1186 mr->destructor = memory_region_destructor_ram;
1187 mr->ram_addr = qemu_ram_alloc_from_file(size, mr, share, path, errp);
1188 }
1189 #endif
1190
1191 void memory_region_init_ram_ptr(MemoryRegion *mr,
1192 Object *owner,
1193 const char *name,
1194 uint64_t size,
1195 void *ptr)
1196 {
1197 memory_region_init(mr, owner, name, size);
1198 mr->ram = true;
1199 mr->terminates = true;
1200 mr->destructor = memory_region_destructor_ram_from_ptr;
1201 mr->ram_addr = qemu_ram_alloc_from_ptr(size, ptr, mr);
1202 }
1203
1204 void memory_region_init_alias(MemoryRegion *mr,
1205 Object *owner,
1206 const char *name,
1207 MemoryRegion *orig,
1208 hwaddr offset,
1209 uint64_t size)
1210 {
1211 memory_region_init(mr, owner, name, size);
1212 memory_region_ref(orig);
1213 mr->destructor = memory_region_destructor_alias;
1214 mr->alias = orig;
1215 mr->alias_offset = offset;
1216 }
1217
1218 void memory_region_init_rom_device(MemoryRegion *mr,
1219 Object *owner,
1220 const MemoryRegionOps *ops,
1221 void *opaque,
1222 const char *name,
1223 uint64_t size)
1224 {
1225 memory_region_init(mr, owner, name, size);
1226 mr->ops = ops;
1227 mr->opaque = opaque;
1228 mr->terminates = true;
1229 mr->rom_device = true;
1230 mr->destructor = memory_region_destructor_rom_device;
1231 mr->ram_addr = qemu_ram_alloc(size, mr);
1232 }
1233
1234 void memory_region_init_iommu(MemoryRegion *mr,
1235 Object *owner,
1236 const MemoryRegionIOMMUOps *ops,
1237 const char *name,
1238 uint64_t size)
1239 {
1240 memory_region_init(mr, owner, name, size);
1241 mr->iommu_ops = ops,
1242 mr->terminates = true; /* then re-forwards */
1243 notifier_list_init(&mr->iommu_notify);
1244 }
1245
1246 void memory_region_init_reservation(MemoryRegion *mr,
1247 Object *owner,
1248 const char *name,
1249 uint64_t size)
1250 {
1251 memory_region_init_io(mr, owner, &unassigned_mem_ops, mr, name, size);
1252 }
1253
1254 static void memory_region_finalize(Object *obj)
1255 {
1256 MemoryRegion *mr = MEMORY_REGION(obj);
1257
1258 assert(QTAILQ_EMPTY(&mr->subregions));
1259 assert(memory_region_transaction_depth == 0);
1260 mr->destructor(mr);
1261 memory_region_clear_coalescing(mr);
1262 g_free((char *)mr->name);
1263 g_free(mr->ioeventfds);
1264 }
1265
1266 void memory_region_destroy(MemoryRegion *mr)
1267 {
1268 object_unparent(OBJECT(mr));
1269 }
1270
1271
1272 Object *memory_region_owner(MemoryRegion *mr)
1273 {
1274 Object *obj = OBJECT(mr);
1275 return obj->parent;
1276 }
1277
1278 void memory_region_ref(MemoryRegion *mr)
1279 {
1280 /* MMIO callbacks most likely will access data that belongs
1281 * to the owner, hence the need to ref/unref the owner whenever
1282 * the memory region is in use.
1283 *
1284 * The memory region is a child of its owner. As long as the
1285 * owner doesn't call unparent itself on the memory region,
1286 * ref-ing the owner will also keep the memory region alive.
1287 * Memory regions without an owner are supposed to never go away,
1288 * but we still ref/unref them for debugging purposes.
1289 */
1290 Object *obj = OBJECT(mr);
1291 if (obj && obj->parent) {
1292 object_ref(obj->parent);
1293 } else {
1294 object_ref(obj);
1295 }
1296 }
1297
1298 void memory_region_unref(MemoryRegion *mr)
1299 {
1300 Object *obj = OBJECT(mr);
1301 if (obj && obj->parent) {
1302 object_unref(obj->parent);
1303 } else {
1304 object_unref(obj);
1305 }
1306 }
1307
1308 uint64_t memory_region_size(MemoryRegion *mr)
1309 {
1310 if (int128_eq(mr->size, int128_2_64())) {
1311 return UINT64_MAX;
1312 }
1313 return int128_get64(mr->size);
1314 }
1315
1316 const char *memory_region_name(MemoryRegion *mr)
1317 {
1318 return mr->name;
1319 }
1320
1321 bool memory_region_is_ram(MemoryRegion *mr)
1322 {
1323 return mr->ram;
1324 }
1325
1326 bool memory_region_is_logging(MemoryRegion *mr)
1327 {
1328 return mr->dirty_log_mask;
1329 }
1330
1331 bool memory_region_is_rom(MemoryRegion *mr)
1332 {
1333 return mr->ram && mr->readonly;
1334 }
1335
1336 bool memory_region_is_iommu(MemoryRegion *mr)
1337 {
1338 return mr->iommu_ops;
1339 }
1340
1341 void memory_region_register_iommu_notifier(MemoryRegion *mr, Notifier *n)
1342 {
1343 notifier_list_add(&mr->iommu_notify, n);
1344 }
1345
1346 void memory_region_unregister_iommu_notifier(Notifier *n)
1347 {
1348 notifier_remove(n);
1349 }
1350
1351 void memory_region_notify_iommu(MemoryRegion *mr,
1352 IOMMUTLBEntry entry)
1353 {
1354 assert(memory_region_is_iommu(mr));
1355 notifier_list_notify(&mr->iommu_notify, &entry);
1356 }
1357
1358 void memory_region_set_log(MemoryRegion *mr, bool log, unsigned client)
1359 {
1360 uint8_t mask = 1 << client;
1361
1362 memory_region_transaction_begin();
1363 mr->dirty_log_mask = (mr->dirty_log_mask & ~mask) | (log * mask);
1364 memory_region_update_pending |= mr->enabled;
1365 memory_region_transaction_commit();
1366 }
1367
1368 bool memory_region_get_dirty(MemoryRegion *mr, hwaddr addr,
1369 hwaddr size, unsigned client)
1370 {
1371 assert(mr->terminates);
1372 return cpu_physical_memory_get_dirty(mr->ram_addr + addr, size, client);
1373 }
1374
1375 void memory_region_set_dirty(MemoryRegion *mr, hwaddr addr,
1376 hwaddr size)
1377 {
1378 assert(mr->terminates);
1379 cpu_physical_memory_set_dirty_range(mr->ram_addr + addr, size);
1380 }
1381
1382 bool memory_region_test_and_clear_dirty(MemoryRegion *mr, hwaddr addr,
1383 hwaddr size, unsigned client)
1384 {
1385 bool ret;
1386 assert(mr->terminates);
1387 ret = cpu_physical_memory_get_dirty(mr->ram_addr + addr, size, client);
1388 if (ret) {
1389 cpu_physical_memory_reset_dirty(mr->ram_addr + addr, size, client);
1390 }
1391 return ret;
1392 }
1393
1394
1395 void memory_region_sync_dirty_bitmap(MemoryRegion *mr)
1396 {
1397 AddressSpace *as;
1398 FlatRange *fr;
1399
1400 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1401 FlatView *view = address_space_get_flatview(as);
1402 FOR_EACH_FLAT_RANGE(fr, view) {
1403 if (fr->mr == mr) {
1404 MEMORY_LISTENER_UPDATE_REGION(fr, as, Forward, log_sync);
1405 }
1406 }
1407 flatview_unref(view);
1408 }
1409 }
1410
1411 void memory_region_set_readonly(MemoryRegion *mr, bool readonly)
1412 {
1413 if (mr->readonly != readonly) {
1414 memory_region_transaction_begin();
1415 mr->readonly = readonly;
1416 memory_region_update_pending |= mr->enabled;
1417 memory_region_transaction_commit();
1418 }
1419 }
1420
1421 void memory_region_rom_device_set_romd(MemoryRegion *mr, bool romd_mode)
1422 {
1423 if (mr->romd_mode != romd_mode) {
1424 memory_region_transaction_begin();
1425 mr->romd_mode = romd_mode;
1426 memory_region_update_pending |= mr->enabled;
1427 memory_region_transaction_commit();
1428 }
1429 }
1430
1431 void memory_region_reset_dirty(MemoryRegion *mr, hwaddr addr,
1432 hwaddr size, unsigned client)
1433 {
1434 assert(mr->terminates);
1435 cpu_physical_memory_reset_dirty(mr->ram_addr + addr, size, client);
1436 }
1437
1438 int memory_region_get_fd(MemoryRegion *mr)
1439 {
1440 if (mr->alias) {
1441 return memory_region_get_fd(mr->alias);
1442 }
1443
1444 assert(mr->terminates);
1445
1446 return qemu_get_ram_fd(mr->ram_addr & TARGET_PAGE_MASK);
1447 }
1448
1449 void *memory_region_get_ram_ptr(MemoryRegion *mr)
1450 {
1451 if (mr->alias) {
1452 return memory_region_get_ram_ptr(mr->alias) + mr->alias_offset;
1453 }
1454
1455 assert(mr->terminates);
1456
1457 return qemu_get_ram_ptr(mr->ram_addr & TARGET_PAGE_MASK);
1458 }
1459
1460 static void memory_region_update_coalesced_range_as(MemoryRegion *mr, AddressSpace *as)
1461 {
1462 FlatView *view;
1463 FlatRange *fr;
1464 CoalescedMemoryRange *cmr;
1465 AddrRange tmp;
1466 MemoryRegionSection section;
1467
1468 view = address_space_get_flatview(as);
1469 FOR_EACH_FLAT_RANGE(fr, view) {
1470 if (fr->mr == mr) {
1471 section = (MemoryRegionSection) {
1472 .address_space = as,
1473 .offset_within_address_space = int128_get64(fr->addr.start),
1474 .size = fr->addr.size,
1475 };
1476
1477 MEMORY_LISTENER_CALL(coalesced_mmio_del, Reverse, &section,
1478 int128_get64(fr->addr.start),
1479 int128_get64(fr->addr.size));
1480 QTAILQ_FOREACH(cmr, &mr->coalesced, link) {
1481 tmp = addrrange_shift(cmr->addr,
1482 int128_sub(fr->addr.start,
1483 int128_make64(fr->offset_in_region)));
1484 if (!addrrange_intersects(tmp, fr->addr)) {
1485 continue;
1486 }
1487 tmp = addrrange_intersection(tmp, fr->addr);
1488 MEMORY_LISTENER_CALL(coalesced_mmio_add, Forward, &section,
1489 int128_get64(tmp.start),
1490 int128_get64(tmp.size));
1491 }
1492 }
1493 }
1494 flatview_unref(view);
1495 }
1496
1497 static void memory_region_update_coalesced_range(MemoryRegion *mr)
1498 {
1499 AddressSpace *as;
1500
1501 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1502 memory_region_update_coalesced_range_as(mr, as);
1503 }
1504 }
1505
1506 void memory_region_set_coalescing(MemoryRegion *mr)
1507 {
1508 memory_region_clear_coalescing(mr);
1509 memory_region_add_coalescing(mr, 0, int128_get64(mr->size));
1510 }
1511
1512 void memory_region_add_coalescing(MemoryRegion *mr,
1513 hwaddr offset,
1514 uint64_t size)
1515 {
1516 CoalescedMemoryRange *cmr = g_malloc(sizeof(*cmr));
1517
1518 cmr->addr = addrrange_make(int128_make64(offset), int128_make64(size));
1519 QTAILQ_INSERT_TAIL(&mr->coalesced, cmr, link);
1520 memory_region_update_coalesced_range(mr);
1521 memory_region_set_flush_coalesced(mr);
1522 }
1523
1524 void memory_region_clear_coalescing(MemoryRegion *mr)
1525 {
1526 CoalescedMemoryRange *cmr;
1527 bool updated = false;
1528
1529 qemu_flush_coalesced_mmio_buffer();
1530 mr->flush_coalesced_mmio = false;
1531
1532 while (!QTAILQ_EMPTY(&mr->coalesced)) {
1533 cmr = QTAILQ_FIRST(&mr->coalesced);
1534 QTAILQ_REMOVE(&mr->coalesced, cmr, link);
1535 g_free(cmr);
1536 updated = true;
1537 }
1538
1539 if (updated) {
1540 memory_region_update_coalesced_range(mr);
1541 }
1542 }
1543
1544 void memory_region_set_flush_coalesced(MemoryRegion *mr)
1545 {
1546 mr->flush_coalesced_mmio = true;
1547 }
1548
1549 void memory_region_clear_flush_coalesced(MemoryRegion *mr)
1550 {
1551 qemu_flush_coalesced_mmio_buffer();
1552 if (QTAILQ_EMPTY(&mr->coalesced)) {
1553 mr->flush_coalesced_mmio = false;
1554 }
1555 }
1556
1557 void memory_region_add_eventfd(MemoryRegion *mr,
1558 hwaddr addr,
1559 unsigned size,
1560 bool match_data,
1561 uint64_t data,
1562 EventNotifier *e)
1563 {
1564 MemoryRegionIoeventfd mrfd = {
1565 .addr.start = int128_make64(addr),
1566 .addr.size = int128_make64(size),
1567 .match_data = match_data,
1568 .data = data,
1569 .e = e,
1570 };
1571 unsigned i;
1572
1573 adjust_endianness(mr, &mrfd.data, size);
1574 memory_region_transaction_begin();
1575 for (i = 0; i < mr->ioeventfd_nb; ++i) {
1576 if (memory_region_ioeventfd_before(mrfd, mr->ioeventfds[i])) {
1577 break;
1578 }
1579 }
1580 ++mr->ioeventfd_nb;
1581 mr->ioeventfds = g_realloc(mr->ioeventfds,
1582 sizeof(*mr->ioeventfds) * mr->ioeventfd_nb);
1583 memmove(&mr->ioeventfds[i+1], &mr->ioeventfds[i],
1584 sizeof(*mr->ioeventfds) * (mr->ioeventfd_nb-1 - i));
1585 mr->ioeventfds[i] = mrfd;
1586 ioeventfd_update_pending |= mr->enabled;
1587 memory_region_transaction_commit();
1588 }
1589
1590 void memory_region_del_eventfd(MemoryRegion *mr,
1591 hwaddr addr,
1592 unsigned size,
1593 bool match_data,
1594 uint64_t data,
1595 EventNotifier *e)
1596 {
1597 MemoryRegionIoeventfd mrfd = {
1598 .addr.start = int128_make64(addr),
1599 .addr.size = int128_make64(size),
1600 .match_data = match_data,
1601 .data = data,
1602 .e = e,
1603 };
1604 unsigned i;
1605
1606 adjust_endianness(mr, &mrfd.data, size);
1607 memory_region_transaction_begin();
1608 for (i = 0; i < mr->ioeventfd_nb; ++i) {
1609 if (memory_region_ioeventfd_equal(mrfd, mr->ioeventfds[i])) {
1610 break;
1611 }
1612 }
1613 assert(i != mr->ioeventfd_nb);
1614 memmove(&mr->ioeventfds[i], &mr->ioeventfds[i+1],
1615 sizeof(*mr->ioeventfds) * (mr->ioeventfd_nb - (i+1)));
1616 --mr->ioeventfd_nb;
1617 mr->ioeventfds = g_realloc(mr->ioeventfds,
1618 sizeof(*mr->ioeventfds)*mr->ioeventfd_nb + 1);
1619 ioeventfd_update_pending |= mr->enabled;
1620 memory_region_transaction_commit();
1621 }
1622
1623 static void memory_region_update_container_subregions(MemoryRegion *subregion)
1624 {
1625 hwaddr offset = subregion->addr;
1626 MemoryRegion *mr = subregion->container;
1627 MemoryRegion *other;
1628
1629 memory_region_transaction_begin();
1630
1631 memory_region_ref(subregion);
1632 QTAILQ_FOREACH(other, &mr->subregions, subregions_link) {
1633 if (subregion->may_overlap || other->may_overlap) {
1634 continue;
1635 }
1636 if (int128_ge(int128_make64(offset),
1637 int128_add(int128_make64(other->addr), other->size))
1638 || int128_le(int128_add(int128_make64(offset), subregion->size),
1639 int128_make64(other->addr))) {
1640 continue;
1641 }
1642 #if 0
1643 printf("warning: subregion collision %llx/%llx (%s) "
1644 "vs %llx/%llx (%s)\n",
1645 (unsigned long long)offset,
1646 (unsigned long long)int128_get64(subregion->size),
1647 subregion->name,
1648 (unsigned long long)other->addr,
1649 (unsigned long long)int128_get64(other->size),
1650 other->name);
1651 #endif
1652 }
1653 QTAILQ_FOREACH(other, &mr->subregions, subregions_link) {
1654 if (subregion->priority >= other->priority) {
1655 QTAILQ_INSERT_BEFORE(other, subregion, subregions_link);
1656 goto done;
1657 }
1658 }
1659 QTAILQ_INSERT_TAIL(&mr->subregions, subregion, subregions_link);
1660 done:
1661 memory_region_update_pending |= mr->enabled && subregion->enabled;
1662 memory_region_transaction_commit();
1663 }
1664
1665 static void memory_region_add_subregion_common(MemoryRegion *mr,
1666 hwaddr offset,
1667 MemoryRegion *subregion)
1668 {
1669 assert(!subregion->container);
1670 subregion->container = mr;
1671 subregion->addr = offset;
1672 memory_region_update_container_subregions(subregion);
1673 }
1674
1675 void memory_region_add_subregion(MemoryRegion *mr,
1676 hwaddr offset,
1677 MemoryRegion *subregion)
1678 {
1679 subregion->may_overlap = false;
1680 subregion->priority = 0;
1681 memory_region_add_subregion_common(mr, offset, subregion);
1682 }
1683
1684 void memory_region_add_subregion_overlap(MemoryRegion *mr,
1685 hwaddr offset,
1686 MemoryRegion *subregion,
1687 int priority)
1688 {
1689 subregion->may_overlap = true;
1690 subregion->priority = priority;
1691 memory_region_add_subregion_common(mr, offset, subregion);
1692 }
1693
1694 void memory_region_del_subregion(MemoryRegion *mr,
1695 MemoryRegion *subregion)
1696 {
1697 memory_region_transaction_begin();
1698 assert(subregion->container == mr);
1699 subregion->container = NULL;
1700 QTAILQ_REMOVE(&mr->subregions, subregion, subregions_link);
1701 memory_region_unref(subregion);
1702 memory_region_update_pending |= mr->enabled && subregion->enabled;
1703 memory_region_transaction_commit();
1704 }
1705
1706 void memory_region_set_enabled(MemoryRegion *mr, bool enabled)
1707 {
1708 if (enabled == mr->enabled) {
1709 return;
1710 }
1711 memory_region_transaction_begin();
1712 mr->enabled = enabled;
1713 memory_region_update_pending = true;
1714 memory_region_transaction_commit();
1715 }
1716
1717 static void memory_region_readd_subregion(MemoryRegion *mr)
1718 {
1719 MemoryRegion *container = mr->container;
1720
1721 if (container) {
1722 memory_region_transaction_begin();
1723 memory_region_ref(mr);
1724 memory_region_del_subregion(container, mr);
1725 mr->container = container;
1726 memory_region_update_container_subregions(mr);
1727 memory_region_unref(mr);
1728 memory_region_transaction_commit();
1729 }
1730 }
1731
1732 void memory_region_set_address(MemoryRegion *mr, hwaddr addr)
1733 {
1734 if (addr != mr->addr) {
1735 mr->addr = addr;
1736 memory_region_readd_subregion(mr);
1737 }
1738 }
1739
1740 void memory_region_set_alias_offset(MemoryRegion *mr, hwaddr offset)
1741 {
1742 assert(mr->alias);
1743
1744 if (offset == mr->alias_offset) {
1745 return;
1746 }
1747
1748 memory_region_transaction_begin();
1749 mr->alias_offset = offset;
1750 memory_region_update_pending |= mr->enabled;
1751 memory_region_transaction_commit();
1752 }
1753
1754 ram_addr_t memory_region_get_ram_addr(MemoryRegion *mr)
1755 {
1756 return mr->ram_addr;
1757 }
1758
1759 static int cmp_flatrange_addr(const void *addr_, const void *fr_)
1760 {
1761 const AddrRange *addr = addr_;
1762 const FlatRange *fr = fr_;
1763
1764 if (int128_le(addrrange_end(*addr), fr->addr.start)) {
1765 return -1;
1766 } else if (int128_ge(addr->start, addrrange_end(fr->addr))) {
1767 return 1;
1768 }
1769 return 0;
1770 }
1771
1772 static FlatRange *flatview_lookup(FlatView *view, AddrRange addr)
1773 {
1774 return bsearch(&addr, view->ranges, view->nr,
1775 sizeof(FlatRange), cmp_flatrange_addr);
1776 }
1777
1778 bool memory_region_present(MemoryRegion *container, hwaddr addr)
1779 {
1780 MemoryRegion *mr = memory_region_find(container, addr, 1).mr;
1781 if (!mr || (mr == container)) {
1782 return false;
1783 }
1784 memory_region_unref(mr);
1785 return true;
1786 }
1787
1788 bool memory_region_is_mapped(MemoryRegion *mr)
1789 {
1790 return mr->container ? true : false;
1791 }
1792
1793 MemoryRegionSection memory_region_find(MemoryRegion *mr,
1794 hwaddr addr, uint64_t size)
1795 {
1796 MemoryRegionSection ret = { .mr = NULL };
1797 MemoryRegion *root;
1798 AddressSpace *as;
1799 AddrRange range;
1800 FlatView *view;
1801 FlatRange *fr;
1802
1803 addr += mr->addr;
1804 for (root = mr; root->container; ) {
1805 root = root->container;
1806 addr += root->addr;
1807 }
1808
1809 as = memory_region_to_address_space(root);
1810 if (!as) {
1811 return ret;
1812 }
1813 range = addrrange_make(int128_make64(addr), int128_make64(size));
1814
1815 view = address_space_get_flatview(as);
1816 fr = flatview_lookup(view, range);
1817 if (!fr) {
1818 flatview_unref(view);
1819 return ret;
1820 }
1821
1822 while (fr > view->ranges && addrrange_intersects(fr[-1].addr, range)) {
1823 --fr;
1824 }
1825
1826 ret.mr = fr->mr;
1827 ret.address_space = as;
1828 range = addrrange_intersection(range, fr->addr);
1829 ret.offset_within_region = fr->offset_in_region;
1830 ret.offset_within_region += int128_get64(int128_sub(range.start,
1831 fr->addr.start));
1832 ret.size = range.size;
1833 ret.offset_within_address_space = int128_get64(range.start);
1834 ret.readonly = fr->readonly;
1835 memory_region_ref(ret.mr);
1836
1837 flatview_unref(view);
1838 return ret;
1839 }
1840
1841 void address_space_sync_dirty_bitmap(AddressSpace *as)
1842 {
1843 FlatView *view;
1844 FlatRange *fr;
1845
1846 view = address_space_get_flatview(as);
1847 FOR_EACH_FLAT_RANGE(fr, view) {
1848 MEMORY_LISTENER_UPDATE_REGION(fr, as, Forward, log_sync);
1849 }
1850 flatview_unref(view);
1851 }
1852
1853 void memory_global_dirty_log_start(void)
1854 {
1855 global_dirty_log = true;
1856 MEMORY_LISTENER_CALL_GLOBAL(log_global_start, Forward);
1857 }
1858
1859 void memory_global_dirty_log_stop(void)
1860 {
1861 global_dirty_log = false;
1862 MEMORY_LISTENER_CALL_GLOBAL(log_global_stop, Reverse);
1863 }
1864
1865 static void listener_add_address_space(MemoryListener *listener,
1866 AddressSpace *as)
1867 {
1868 FlatView *view;
1869 FlatRange *fr;
1870
1871 if (listener->address_space_filter
1872 && listener->address_space_filter != as) {
1873 return;
1874 }
1875
1876 if (global_dirty_log) {
1877 if (listener->log_global_start) {
1878 listener->log_global_start(listener);
1879 }
1880 }
1881
1882 view = address_space_get_flatview(as);
1883 FOR_EACH_FLAT_RANGE(fr, view) {
1884 MemoryRegionSection section = {
1885 .mr = fr->mr,
1886 .address_space = as,
1887 .offset_within_region = fr->offset_in_region,
1888 .size = fr->addr.size,
1889 .offset_within_address_space = int128_get64(fr->addr.start),
1890 .readonly = fr->readonly,
1891 };
1892 if (listener->region_add) {
1893 listener->region_add(listener, &section);
1894 }
1895 }
1896 flatview_unref(view);
1897 }
1898
1899 void memory_listener_register(MemoryListener *listener, AddressSpace *filter)
1900 {
1901 MemoryListener *other = NULL;
1902 AddressSpace *as;
1903
1904 listener->address_space_filter = filter;
1905 if (QTAILQ_EMPTY(&memory_listeners)
1906 || listener->priority >= QTAILQ_LAST(&memory_listeners,
1907 memory_listeners)->priority) {
1908 QTAILQ_INSERT_TAIL(&memory_listeners, listener, link);
1909 } else {
1910 QTAILQ_FOREACH(other, &memory_listeners, link) {
1911 if (listener->priority < other->priority) {
1912 break;
1913 }
1914 }
1915 QTAILQ_INSERT_BEFORE(other, listener, link);
1916 }
1917
1918 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
1919 listener_add_address_space(listener, as);
1920 }
1921 }
1922
1923 void memory_listener_unregister(MemoryListener *listener)
1924 {
1925 QTAILQ_REMOVE(&memory_listeners, listener, link);
1926 }
1927
1928 void address_space_init(AddressSpace *as, MemoryRegion *root, const char *name)
1929 {
1930 if (QTAILQ_EMPTY(&address_spaces)) {
1931 memory_init();
1932 }
1933
1934 memory_region_transaction_begin();
1935 as->root = root;
1936 as->current_map = g_new(FlatView, 1);
1937 flatview_init(as->current_map);
1938 as->ioeventfd_nb = 0;
1939 as->ioeventfds = NULL;
1940 QTAILQ_INSERT_TAIL(&address_spaces, as, address_spaces_link);
1941 as->name = g_strdup(name ? name : "anonymous");
1942 address_space_init_dispatch(as);
1943 memory_region_update_pending |= root->enabled;
1944 memory_region_transaction_commit();
1945 }
1946
1947 void address_space_destroy(AddressSpace *as)
1948 {
1949 MemoryListener *listener;
1950
1951 /* Flush out anything from MemoryListeners listening in on this */
1952 memory_region_transaction_begin();
1953 as->root = NULL;
1954 memory_region_transaction_commit();
1955 QTAILQ_REMOVE(&address_spaces, as, address_spaces_link);
1956 address_space_destroy_dispatch(as);
1957
1958 QTAILQ_FOREACH(listener, &memory_listeners, link) {
1959 assert(listener->address_space_filter != as);
1960 }
1961
1962 flatview_unref(as->current_map);
1963 g_free(as->name);
1964 g_free(as->ioeventfds);
1965 }
1966
1967 bool io_mem_read(MemoryRegion *mr, hwaddr addr, uint64_t *pval, unsigned size)
1968 {
1969 return memory_region_dispatch_read(mr, addr, pval, size);
1970 }
1971
1972 bool io_mem_write(MemoryRegion *mr, hwaddr addr,
1973 uint64_t val, unsigned size)
1974 {
1975 return memory_region_dispatch_write(mr, addr, val, size);
1976 }
1977
1978 typedef struct MemoryRegionList MemoryRegionList;
1979
1980 struct MemoryRegionList {
1981 const MemoryRegion *mr;
1982 bool printed;
1983 QTAILQ_ENTRY(MemoryRegionList) queue;
1984 };
1985
1986 typedef QTAILQ_HEAD(queue, MemoryRegionList) MemoryRegionListHead;
1987
1988 static void mtree_print_mr(fprintf_function mon_printf, void *f,
1989 const MemoryRegion *mr, unsigned int level,
1990 hwaddr base,
1991 MemoryRegionListHead *alias_print_queue)
1992 {
1993 MemoryRegionList *new_ml, *ml, *next_ml;
1994 MemoryRegionListHead submr_print_queue;
1995 const MemoryRegion *submr;
1996 unsigned int i;
1997
1998 if (!mr || !mr->enabled) {
1999 return;
2000 }
2001
2002 for (i = 0; i < level; i++) {
2003 mon_printf(f, " ");
2004 }
2005
2006 if (mr->alias) {
2007 MemoryRegionList *ml;
2008 bool found = false;
2009
2010 /* check if the alias is already in the queue */
2011 QTAILQ_FOREACH(ml, alias_print_queue, queue) {
2012 if (ml->mr == mr->alias && !ml->printed) {
2013 found = true;
2014 }
2015 }
2016
2017 if (!found) {
2018 ml = g_new(MemoryRegionList, 1);
2019 ml->mr = mr->alias;
2020 ml->printed = false;
2021 QTAILQ_INSERT_TAIL(alias_print_queue, ml, queue);
2022 }
2023 mon_printf(f, TARGET_FMT_plx "-" TARGET_FMT_plx
2024 " (prio %d, %c%c): alias %s @%s " TARGET_FMT_plx
2025 "-" TARGET_FMT_plx "\n",
2026 base + mr->addr,
2027 base + mr->addr
2028 + (int128_nz(mr->size) ?
2029 (hwaddr)int128_get64(int128_sub(mr->size,
2030 int128_one())) : 0),
2031 mr->priority,
2032 mr->romd_mode ? 'R' : '-',
2033 !mr->readonly && !(mr->rom_device && mr->romd_mode) ? 'W'
2034 : '-',
2035 mr->name,
2036 mr->alias->name,
2037 mr->alias_offset,
2038 mr->alias_offset
2039 + (int128_nz(mr->size) ?
2040 (hwaddr)int128_get64(int128_sub(mr->size,
2041 int128_one())) : 0));
2042 } else {
2043 mon_printf(f,
2044 TARGET_FMT_plx "-" TARGET_FMT_plx " (prio %d, %c%c): %s\n",
2045 base + mr->addr,
2046 base + mr->addr
2047 + (int128_nz(mr->size) ?
2048 (hwaddr)int128_get64(int128_sub(mr->size,
2049 int128_one())) : 0),
2050 mr->priority,
2051 mr->romd_mode ? 'R' : '-',
2052 !mr->readonly && !(mr->rom_device && mr->romd_mode) ? 'W'
2053 : '-',
2054 mr->name);
2055 }
2056
2057 QTAILQ_INIT(&submr_print_queue);
2058
2059 QTAILQ_FOREACH(submr, &mr->subregions, subregions_link) {
2060 new_ml = g_new(MemoryRegionList, 1);
2061 new_ml->mr = submr;
2062 QTAILQ_FOREACH(ml, &submr_print_queue, queue) {
2063 if (new_ml->mr->addr < ml->mr->addr ||
2064 (new_ml->mr->addr == ml->mr->addr &&
2065 new_ml->mr->priority > ml->mr->priority)) {
2066 QTAILQ_INSERT_BEFORE(ml, new_ml, queue);
2067 new_ml = NULL;
2068 break;
2069 }
2070 }
2071 if (new_ml) {
2072 QTAILQ_INSERT_TAIL(&submr_print_queue, new_ml, queue);
2073 }
2074 }
2075
2076 QTAILQ_FOREACH(ml, &submr_print_queue, queue) {
2077 mtree_print_mr(mon_printf, f, ml->mr, level + 1, base + mr->addr,
2078 alias_print_queue);
2079 }
2080
2081 QTAILQ_FOREACH_SAFE(ml, &submr_print_queue, queue, next_ml) {
2082 g_free(ml);
2083 }
2084 }
2085
2086 void mtree_info(fprintf_function mon_printf, void *f)
2087 {
2088 MemoryRegionListHead ml_head;
2089 MemoryRegionList *ml, *ml2;
2090 AddressSpace *as;
2091
2092 QTAILQ_INIT(&ml_head);
2093
2094 QTAILQ_FOREACH(as, &address_spaces, address_spaces_link) {
2095 mon_printf(f, "%s\n", as->name);
2096 mtree_print_mr(mon_printf, f, as->root, 0, 0, &ml_head);
2097 }
2098
2099 mon_printf(f, "aliases\n");
2100 /* print aliased regions */
2101 QTAILQ_FOREACH(ml, &ml_head, queue) {
2102 if (!ml->printed) {
2103 mon_printf(f, "%s\n", ml->mr->name);
2104 mtree_print_mr(mon_printf, f, ml->mr, 0, 0, &ml_head);
2105 }
2106 }
2107
2108 QTAILQ_FOREACH_SAFE(ml, &ml_head, queue, ml2) {
2109 g_free(ml);
2110 }
2111 }
2112
2113 static const TypeInfo memory_region_info = {
2114 .parent = TYPE_OBJECT,
2115 .name = TYPE_MEMORY_REGION,
2116 .instance_size = sizeof(MemoryRegion),
2117 .instance_init = memory_region_initfn,
2118 .instance_finalize = memory_region_finalize,
2119 };
2120
2121 static void memory_register_types(void)
2122 {
2123 type_register_static(&memory_region_info);
2124 }
2125
2126 type_init(memory_register_types)
AR7 emulation for QEMU