memory.c 54 KB

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