2
0

memory.c 57 KB

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