2 * User emulator execution
4 * Copyright (c) 2003-2005 Fabrice Bellard
6 * This library is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU Lesser General Public
8 * License as published by the Free Software Foundation; either
9 * version 2.1 of the License, or (at your option) any later version.
11 * This library is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * Lesser General Public License for more details.
16 * You should have received a copy of the GNU Lesser General Public
17 * License along with this library; if not, see <http://www.gnu.org/licenses/>.
19 #include "qemu/osdep.h"
20 #include "hw/core/tcg-cpu-ops.h"
21 #include "disas/disas.h"
22 #include "exec/exec-all.h"
24 #include "qemu/bitops.h"
26 #include "exec/cpu_ldst.h"
27 #include "exec/translate-all.h"
28 #include "exec/helper-proto.h"
29 #include "qemu/atomic128.h"
30 #include "trace/trace-root.h"
31 #include "tcg/tcg-ldst.h"
34 __thread
uintptr_t helper_retaddr
;
36 //#define DEBUG_SIGNAL
39 * Adjust the pc to pass to cpu_restore_state; return the memop type.
41 MMUAccessType
adjust_signal_pc(uintptr_t *pc
, bool is_write
)
43 switch (helper_retaddr
) {
46 * Fault during host memory operation within a helper function.
47 * The helper's host return address, saved here, gives us a
48 * pointer into the generated code that will unwind to the
56 * Fault during host memory operation within generated code.
57 * (Or, a unrelated bug within qemu, but we can't tell from here).
59 * We take the host pc from the signal frame. However, we cannot
60 * use that value directly. Within cpu_restore_state_from_tb, we
61 * assume PC comes from GETPC(), as used by the helper functions,
62 * so we adjust the address by -GETPC_ADJ to form an address that
63 * is within the call insn, so that the address does not accidentally
64 * match the beginning of the next guest insn. However, when the
65 * pc comes from the signal frame it points to the actual faulting
66 * host memory insn and not the return from a call insn.
68 * Therefore, adjust to compensate for what will be done later
69 * by cpu_restore_state_from_tb.
76 * Fault during host read for translation, or loosely, "execution".
78 * The guest pc is already pointing to the start of the TB for which
79 * code is being generated. If the guest translator manages the
80 * page crossings correctly, this is exactly the correct address
81 * (and if the translator doesn't handle page boundaries correctly
82 * there's little we can do about that here). Therefore, do not
83 * trigger the unwinder.
86 return MMU_INST_FETCH
;
89 return is_write
? MMU_DATA_STORE
: MMU_DATA_LOAD
;
93 * handle_sigsegv_accerr_write:
94 * @cpu: the cpu context
95 * @old_set: the sigset_t from the signal ucontext_t
96 * @host_pc: the host pc, adjusted for the signal
97 * @guest_addr: the guest address of the fault
99 * Return true if the write fault has been handled, and should be re-tried.
101 * Note that it is important that we don't call page_unprotect() unless
102 * this is really a "write to nonwritable page" fault, because
103 * page_unprotect() assumes that if it is called for an access to
104 * a page that's writable this means we had two threads racing and
105 * another thread got there first and already made the page writable;
106 * so we will retry the access. If we were to call page_unprotect()
107 * for some other kind of fault that should really be passed to the
108 * guest, we'd end up in an infinite loop of retrying the faulting access.
110 bool handle_sigsegv_accerr_write(CPUState
*cpu
, sigset_t
*old_set
,
111 uintptr_t host_pc
, abi_ptr guest_addr
)
113 switch (page_unprotect(guest_addr
, host_pc
)) {
116 * Fault not caused by a page marked unwritable to protect
117 * cached translations, must be the guest binary's problem.
122 * Fault caused by protection of cached translation; TBs
123 * invalidated, so resume execution.
128 * Fault caused by protection of cached translation, and the
129 * currently executing TB was modified and must be exited immediately.
131 sigprocmask(SIG_SETMASK
, old_set
, NULL
);
132 cpu_loop_exit_noexc(cpu
);
135 g_assert_not_reached();
139 typedef struct PageFlagsNode
{
141 IntervalTreeNode itree
;
145 static IntervalTreeRoot pageflags_root
;
147 static PageFlagsNode
*pageflags_find(target_ulong start
, target_long last
)
151 n
= interval_tree_iter_first(&pageflags_root
, start
, last
);
152 return n
? container_of(n
, PageFlagsNode
, itree
) : NULL
;
155 static PageFlagsNode
*pageflags_next(PageFlagsNode
*p
, target_ulong start
,
160 n
= interval_tree_iter_next(&p
->itree
, start
, last
);
161 return n
? container_of(n
, PageFlagsNode
, itree
) : NULL
;
164 int walk_memory_regions(void *priv
, walk_memory_regions_fn fn
)
170 for (n
= interval_tree_iter_first(&pageflags_root
, 0, -1);
172 n
= interval_tree_iter_next(n
, 0, -1)) {
173 PageFlagsNode
*p
= container_of(n
, PageFlagsNode
, itree
);
175 rc
= fn(priv
, n
->start
, n
->last
+ 1, p
->flags
);
185 static int dump_region(void *priv
, target_ulong start
,
186 target_ulong end
, unsigned long prot
)
188 FILE *f
= (FILE *)priv
;
190 fprintf(f
, TARGET_FMT_lx
"-"TARGET_FMT_lx
" "TARGET_FMT_lx
" %c%c%c\n",
191 start
, end
, end
- start
,
192 ((prot
& PAGE_READ
) ? 'r' : '-'),
193 ((prot
& PAGE_WRITE
) ? 'w' : '-'),
194 ((prot
& PAGE_EXEC
) ? 'x' : '-'));
198 /* dump memory mappings */
199 void page_dump(FILE *f
)
201 const int length
= sizeof(target_ulong
) * 2;
203 fprintf(f
, "%-*s %-*s %-*s %s\n",
204 length
, "start", length
, "end", length
, "size", "prot");
205 walk_memory_regions(f
, dump_region
);
208 int page_get_flags(target_ulong address
)
210 PageFlagsNode
*p
= pageflags_find(address
, address
);
213 * See util/interval-tree.c re lockless lookups: no false positives but
214 * there are false negatives. If we find nothing, retry with the mmap
220 if (have_mmap_lock()) {
225 p
= pageflags_find(address
, address
);
227 return p
? p
->flags
: 0;
230 /* A subroutine of page_set_flags: insert a new node for [start,last]. */
231 static void pageflags_create(target_ulong start
, target_ulong last
, int flags
)
233 PageFlagsNode
*p
= g_new(PageFlagsNode
, 1);
235 p
->itree
.start
= start
;
236 p
->itree
.last
= last
;
238 interval_tree_insert(&p
->itree
, &pageflags_root
);
241 /* A subroutine of page_set_flags: remove everything in [start,last]. */
242 static bool pageflags_unset(target_ulong start
, target_ulong last
)
244 bool inval_tb
= false;
247 PageFlagsNode
*p
= pageflags_find(start
, last
);
254 if (p
->flags
& PAGE_EXEC
) {
258 interval_tree_remove(&p
->itree
, &pageflags_root
);
259 p_last
= p
->itree
.last
;
261 if (p
->itree
.start
< start
) {
262 /* Truncate the node from the end, or split out the middle. */
263 p
->itree
.last
= start
- 1;
264 interval_tree_insert(&p
->itree
, &pageflags_root
);
266 pageflags_create(last
+ 1, p_last
, p
->flags
);
269 } else if (p_last
<= last
) {
270 /* Range completely covers node -- remove it. */
273 /* Truncate the node from the start. */
274 p
->itree
.start
= last
+ 1;
275 interval_tree_insert(&p
->itree
, &pageflags_root
);
284 * A subroutine of page_set_flags: nothing overlaps [start,last],
285 * but check adjacent mappings and maybe merge into a single range.
287 static void pageflags_create_merge(target_ulong start
, target_ulong last
,
290 PageFlagsNode
*next
= NULL
, *prev
= NULL
;
293 prev
= pageflags_find(start
- 1, start
- 1);
295 if (prev
->flags
== flags
) {
296 interval_tree_remove(&prev
->itree
, &pageflags_root
);
303 next
= pageflags_find(last
+ 1, last
+ 1);
305 if (next
->flags
== flags
) {
306 interval_tree_remove(&next
->itree
, &pageflags_root
);
315 prev
->itree
.last
= next
->itree
.last
;
316 g_free_rcu(next
, rcu
);
318 prev
->itree
.last
= last
;
320 interval_tree_insert(&prev
->itree
, &pageflags_root
);
322 next
->itree
.start
= start
;
323 interval_tree_insert(&next
->itree
, &pageflags_root
);
325 pageflags_create(start
, last
, flags
);
330 * Allow the target to decide if PAGE_TARGET_[12] may be reset.
331 * By default, they are not kept.
333 #ifndef PAGE_TARGET_STICKY
334 #define PAGE_TARGET_STICKY 0
336 #define PAGE_STICKY (PAGE_ANON | PAGE_PASSTHROUGH | PAGE_TARGET_STICKY)
338 /* A subroutine of page_set_flags: add flags to [start,last]. */
339 static bool pageflags_set_clear(target_ulong start
, target_ulong last
,
340 int set_flags
, int clear_flags
)
343 target_ulong p_start
, p_last
;
344 int p_flags
, merge_flags
;
345 bool inval_tb
= false;
348 p
= pageflags_find(start
, last
);
351 pageflags_create_merge(start
, last
, set_flags
);
356 p_start
= p
->itree
.start
;
357 p_last
= p
->itree
.last
;
359 /* Using mprotect on a page does not change sticky bits. */
360 merge_flags
= (p_flags
& ~clear_flags
) | set_flags
;
363 * Need to flush if an overlapping executable region
364 * removes exec, or adds write.
366 if ((p_flags
& PAGE_EXEC
)
367 && (!(merge_flags
& PAGE_EXEC
)
368 || (merge_flags
& ~p_flags
& PAGE_WRITE
))) {
373 * If there is an exact range match, update and return without
374 * attempting to merge with adjacent regions.
376 if (start
== p_start
&& last
== p_last
) {
378 p
->flags
= merge_flags
;
380 interval_tree_remove(&p
->itree
, &pageflags_root
);
387 * If sticky bits affect the original mapping, then we must be more
388 * careful about the existing intervals and the separate flags.
390 if (set_flags
!= merge_flags
) {
391 if (p_start
< start
) {
392 interval_tree_remove(&p
->itree
, &pageflags_root
);
393 p
->itree
.last
= start
- 1;
394 interval_tree_insert(&p
->itree
, &pageflags_root
);
398 pageflags_create(start
, last
, merge_flags
);
400 pageflags_create(last
+ 1, p_last
, p_flags
);
403 pageflags_create(start
, p_last
, merge_flags
);
411 if (start
< p_start
&& set_flags
) {
412 pageflags_create(start
, p_start
- 1, set_flags
);
415 interval_tree_remove(&p
->itree
, &pageflags_root
);
416 p
->itree
.start
= last
+ 1;
417 interval_tree_insert(&p
->itree
, &pageflags_root
);
419 pageflags_create(start
, last
, merge_flags
);
423 p
->flags
= merge_flags
;
425 interval_tree_remove(&p
->itree
, &pageflags_root
);
437 /* If flags are not changing for this range, incorporate it. */
438 if (set_flags
== p_flags
) {
439 if (start
< p_start
) {
440 interval_tree_remove(&p
->itree
, &pageflags_root
);
441 p
->itree
.start
= start
;
442 interval_tree_insert(&p
->itree
, &pageflags_root
);
451 /* Maybe split out head and/or tail ranges with the original flags. */
452 interval_tree_remove(&p
->itree
, &pageflags_root
);
453 if (p_start
< start
) {
454 p
->itree
.last
= start
- 1;
455 interval_tree_insert(&p
->itree
, &pageflags_root
);
461 pageflags_create(last
+ 1, p_last
, p_flags
);
463 } else if (last
< p_last
) {
464 p
->itree
.start
= last
+ 1;
465 interval_tree_insert(&p
->itree
, &pageflags_root
);
471 pageflags_create(start
, last
, set_flags
);
479 * Modify the flags of a page and invalidate the code if necessary.
480 * The flag PAGE_WRITE_ORG is positioned automatically depending
481 * on PAGE_WRITE. The mmap_lock should already be held.
483 void page_set_flags(target_ulong start
, target_ulong end
, int flags
)
487 bool inval_tb
= false;
489 /* This function should never be called with addresses outside the
490 guest address space. If this assert fires, it probably indicates
491 a missing call to h2g_valid. */
493 assert(end
- 1 <= GUEST_ADDR_MAX
);
494 /* Only set PAGE_ANON with new mappings. */
495 assert(!(flags
& PAGE_ANON
) || (flags
& PAGE_RESET
));
496 assert_memory_lock();
498 start
= start
& TARGET_PAGE_MASK
;
499 end
= TARGET_PAGE_ALIGN(end
);
502 if (!(flags
& PAGE_VALID
)) {
505 reset
= flags
& PAGE_RESET
;
506 flags
&= ~PAGE_RESET
;
507 if (flags
& PAGE_WRITE
) {
508 flags
|= PAGE_WRITE_ORG
;
512 if (!flags
|| reset
) {
513 page_reset_target_data(start
, end
);
514 inval_tb
|= pageflags_unset(start
, last
);
517 inval_tb
|= pageflags_set_clear(start
, last
, flags
,
518 ~(reset
? 0 : PAGE_STICKY
));
521 tb_invalidate_phys_range(start
, end
);
525 int page_check_range(target_ulong start
, target_ulong len
, int flags
)
528 int locked
; /* tri-state: =0: unlocked, +1: global, -1: local */
532 return 0; /* trivial length */
535 last
= start
+ len
- 1;
537 return -1; /* wrap around */
540 locked
= have_mmap_lock();
542 PageFlagsNode
*p
= pageflags_find(start
, last
);
548 * Lockless lookups have false negatives.
549 * Retry with the lock held.
553 p
= pageflags_find(start
, last
);
556 ret
= -1; /* entire region invalid */
560 if (start
< p
->itree
.start
) {
561 ret
= -1; /* initial bytes invalid */
565 missing
= flags
& ~p
->flags
;
566 if (missing
& PAGE_READ
) {
567 ret
= -1; /* page not readable */
570 if (missing
& PAGE_WRITE
) {
571 if (!(p
->flags
& PAGE_WRITE_ORG
)) {
572 ret
= -1; /* page not writable */
575 /* Asking about writable, but has been protected: undo. */
576 if (!page_unprotect(start
, 0)) {
580 /* TODO: page_unprotect should take a range, not a single page. */
581 if (last
- start
< TARGET_PAGE_SIZE
) {
585 start
+= TARGET_PAGE_SIZE
;
589 if (last
<= p
->itree
.last
) {
593 start
= p
->itree
.last
+ 1;
596 /* Release the lock if acquired locally. */
603 void page_protect(tb_page_addr_t address
)
606 target_ulong start
, last
;
609 assert_memory_lock();
611 if (qemu_host_page_size
<= TARGET_PAGE_SIZE
) {
612 start
= address
& TARGET_PAGE_MASK
;
613 last
= start
+ TARGET_PAGE_SIZE
- 1;
615 start
= address
& qemu_host_page_mask
;
616 last
= start
+ qemu_host_page_size
- 1;
619 p
= pageflags_find(start
, last
);
625 if (unlikely(p
->itree
.last
< last
)) {
626 /* More than one protection region covers the one host page. */
627 assert(TARGET_PAGE_SIZE
< qemu_host_page_size
);
628 while ((p
= pageflags_next(p
, start
, last
)) != NULL
) {
633 if (prot
& PAGE_WRITE
) {
634 pageflags_set_clear(start
, last
, 0, PAGE_WRITE
);
635 mprotect(g2h_untagged(start
), qemu_host_page_size
,
636 prot
& (PAGE_READ
| PAGE_EXEC
) ? PROT_READ
: PROT_NONE
);
641 * Called from signal handler: invalidate the code and unprotect the
642 * page. Return 0 if the fault was not handled, 1 if it was handled,
643 * and 2 if it was handled but the caller must cause the TB to be
644 * immediately exited. (We can only return 2 if the 'pc' argument is
647 int page_unprotect(target_ulong address
, uintptr_t pc
)
650 bool current_tb_invalidated
;
653 * Technically this isn't safe inside a signal handler. However we
654 * know this only ever happens in a synchronous SEGV handler, so in
655 * practice it seems to be ok.
659 p
= pageflags_find(address
, address
);
661 /* If this address was not really writable, nothing to do. */
662 if (!p
|| !(p
->flags
& PAGE_WRITE_ORG
)) {
667 current_tb_invalidated
= false;
668 if (p
->flags
& PAGE_WRITE
) {
670 * If the page is actually marked WRITE then assume this is because
671 * this thread raced with another one which got here first and
672 * set the page to PAGE_WRITE and did the TB invalidate for us.
674 #ifdef TARGET_HAS_PRECISE_SMC
675 TranslationBlock
*current_tb
= tcg_tb_lookup(pc
);
677 current_tb_invalidated
= tb_cflags(current_tb
) & CF_INVALID
;
681 target_ulong start
, len
, i
;
684 if (qemu_host_page_size
<= TARGET_PAGE_SIZE
) {
685 start
= address
& TARGET_PAGE_MASK
;
686 len
= TARGET_PAGE_SIZE
;
687 prot
= p
->flags
| PAGE_WRITE
;
688 pageflags_set_clear(start
, start
+ len
- 1, PAGE_WRITE
, 0);
689 current_tb_invalidated
= tb_invalidate_phys_page_unwind(start
, pc
);
691 start
= address
& qemu_host_page_mask
;
692 len
= qemu_host_page_size
;
695 for (i
= 0; i
< len
; i
+= TARGET_PAGE_SIZE
) {
696 target_ulong addr
= start
+ i
;
698 p
= pageflags_find(addr
, addr
);
701 if (p
->flags
& PAGE_WRITE_ORG
) {
703 pageflags_set_clear(addr
, addr
+ TARGET_PAGE_SIZE
- 1,
708 * Since the content will be modified, we must invalidate
709 * the corresponding translated code.
711 current_tb_invalidated
|=
712 tb_invalidate_phys_page_unwind(addr
, pc
);
715 if (prot
& PAGE_EXEC
) {
716 prot
= (prot
& ~PAGE_EXEC
) | PAGE_READ
;
718 mprotect((void *)g2h_untagged(start
), len
, prot
& PAGE_BITS
);
722 /* If current TB was invalidated return to main loop */
723 return current_tb_invalidated
? 2 : 1;
726 static int probe_access_internal(CPUArchState
*env
, target_ulong addr
,
727 int fault_size
, MMUAccessType access_type
,
728 bool nonfault
, uintptr_t ra
)
733 switch (access_type
) {
735 acc_flag
= PAGE_WRITE_ORG
;
738 acc_flag
= PAGE_READ
;
741 acc_flag
= PAGE_EXEC
;
744 g_assert_not_reached();
747 if (guest_addr_valid_untagged(addr
)) {
748 int page_flags
= page_get_flags(addr
);
749 if (page_flags
& acc_flag
) {
750 return 0; /* success */
752 maperr
= !(page_flags
& PAGE_VALID
);
758 return TLB_INVALID_MASK
;
761 cpu_loop_exit_sigsegv(env_cpu(env
), addr
, access_type
, maperr
, ra
);
764 int probe_access_flags(CPUArchState
*env
, target_ulong addr
,
765 MMUAccessType access_type
, int mmu_idx
,
766 bool nonfault
, void **phost
, uintptr_t ra
)
770 flags
= probe_access_internal(env
, addr
, 0, access_type
, nonfault
, ra
);
771 *phost
= flags
? NULL
: g2h(env_cpu(env
), addr
);
775 void *probe_access(CPUArchState
*env
, target_ulong addr
, int size
,
776 MMUAccessType access_type
, int mmu_idx
, uintptr_t ra
)
780 g_assert(-(addr
| TARGET_PAGE_MASK
) >= size
);
781 flags
= probe_access_internal(env
, addr
, size
, access_type
, false, ra
);
782 g_assert(flags
== 0);
784 return size
? g2h(env_cpu(env
), addr
) : NULL
;
787 tb_page_addr_t
get_page_addr_code_hostp(CPUArchState
*env
, target_ulong addr
,
792 flags
= probe_access_internal(env
, addr
, 1, MMU_INST_FETCH
, false, 0);
793 g_assert(flags
== 0);
796 *hostp
= g2h_untagged(addr
);
801 #ifdef TARGET_PAGE_DATA_SIZE
803 * Allocate chunks of target data together. For the only current user,
804 * if we allocate one hunk per page, we have overhead of 40/128 or 40%.
805 * Therefore, allocate memory for 64 pages at a time for overhead < 1%.
808 #define TBD_MASK (TARGET_PAGE_MASK * TPD_PAGES)
810 typedef struct TargetPageDataNode
{
812 IntervalTreeNode itree
;
813 char data
[TPD_PAGES
][TARGET_PAGE_DATA_SIZE
] __attribute__((aligned
));
814 } TargetPageDataNode
;
816 static IntervalTreeRoot targetdata_root
;
818 void page_reset_target_data(target_ulong start
, target_ulong end
)
820 IntervalTreeNode
*n
, *next
;
823 assert_memory_lock();
825 start
= start
& TARGET_PAGE_MASK
;
826 last
= TARGET_PAGE_ALIGN(end
) - 1;
828 for (n
= interval_tree_iter_first(&targetdata_root
, start
, last
),
829 next
= n
? interval_tree_iter_next(n
, start
, last
) : NULL
;
832 next
= next
? interval_tree_iter_next(n
, start
, last
) : NULL
) {
833 target_ulong n_start
, n_last
, p_ofs
, p_len
;
834 TargetPageDataNode
*t
= container_of(n
, TargetPageDataNode
, itree
);
836 if (n
->start
>= start
&& n
->last
<= last
) {
837 interval_tree_remove(n
, &targetdata_root
);
842 if (n
->start
< start
) {
844 p_ofs
= (start
- n
->start
) >> TARGET_PAGE_BITS
;
849 n_last
= MIN(last
, n
->last
);
850 p_len
= (n_last
+ 1 - n_start
) >> TARGET_PAGE_BITS
;
852 memset(t
->data
[p_ofs
], 0, p_len
* TARGET_PAGE_DATA_SIZE
);
856 void *page_get_target_data(target_ulong address
)
859 TargetPageDataNode
*t
;
860 target_ulong page
, region
;
862 page
= address
& TARGET_PAGE_MASK
;
863 region
= address
& TBD_MASK
;
865 n
= interval_tree_iter_first(&targetdata_root
, page
, page
);
868 * See util/interval-tree.c re lockless lookups: no false positives
869 * but there are false negatives. If we find nothing, retry with
870 * the mmap lock acquired. We also need the lock for the
871 * allocation + insert.
874 n
= interval_tree_iter_first(&targetdata_root
, page
, page
);
876 t
= g_new0(TargetPageDataNode
, 1);
879 n
->last
= region
| ~TBD_MASK
;
880 interval_tree_insert(n
, &targetdata_root
);
885 t
= container_of(n
, TargetPageDataNode
, itree
);
886 return t
->data
[(page
- region
) >> TARGET_PAGE_BITS
];
889 void page_reset_target_data(target_ulong start
, target_ulong end
) { }
890 #endif /* TARGET_PAGE_DATA_SIZE */
892 /* The softmmu versions of these helpers are in cputlb.c. */
895 * Verify that we have passed the correct MemOp to the correct function.
897 * We could present one function to target code, and dispatch based on
898 * the MemOp, but so far we have worked hard to avoid an indirect function
899 * call along the memory path.
901 static void validate_memop(MemOpIdx oi
, MemOp expected
)
903 #ifdef CONFIG_DEBUG_TCG
904 MemOp have
= get_memop(oi
) & (MO_SIZE
| MO_BSWAP
);
905 assert(have
== expected
);
909 void helper_unaligned_ld(CPUArchState
*env
, target_ulong addr
)
911 cpu_loop_exit_sigbus(env_cpu(env
), addr
, MMU_DATA_LOAD
, GETPC());
914 void helper_unaligned_st(CPUArchState
*env
, target_ulong addr
)
916 cpu_loop_exit_sigbus(env_cpu(env
), addr
, MMU_DATA_STORE
, GETPC());
919 static void *cpu_mmu_lookup(CPUArchState
*env
, target_ulong addr
,
920 MemOpIdx oi
, uintptr_t ra
, MMUAccessType type
)
922 MemOp mop
= get_memop(oi
);
923 int a_bits
= get_alignment_bits(mop
);
926 /* Enforce guest required alignment. */
927 if (unlikely(addr
& ((1 << a_bits
) - 1))) {
928 cpu_loop_exit_sigbus(env_cpu(env
), addr
, type
, ra
);
931 ret
= g2h(env_cpu(env
), addr
);
932 set_helper_retaddr(ra
);
936 uint8_t cpu_ldb_mmu(CPUArchState
*env
, abi_ptr addr
,
937 MemOpIdx oi
, uintptr_t ra
)
942 validate_memop(oi
, MO_UB
);
943 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
945 clear_helper_retaddr();
946 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
950 uint16_t cpu_ldw_be_mmu(CPUArchState
*env
, abi_ptr addr
,
951 MemOpIdx oi
, uintptr_t ra
)
956 validate_memop(oi
, MO_BEUW
);
957 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
958 ret
= lduw_be_p(haddr
);
959 clear_helper_retaddr();
960 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
964 uint32_t cpu_ldl_be_mmu(CPUArchState
*env
, abi_ptr addr
,
965 MemOpIdx oi
, uintptr_t ra
)
970 validate_memop(oi
, MO_BEUL
);
971 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
972 ret
= ldl_be_p(haddr
);
973 clear_helper_retaddr();
974 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
978 uint64_t cpu_ldq_be_mmu(CPUArchState
*env
, abi_ptr addr
,
979 MemOpIdx oi
, uintptr_t ra
)
984 validate_memop(oi
, MO_BEUQ
);
985 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
986 ret
= ldq_be_p(haddr
);
987 clear_helper_retaddr();
988 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
992 uint16_t cpu_ldw_le_mmu(CPUArchState
*env
, abi_ptr addr
,
993 MemOpIdx oi
, uintptr_t ra
)
998 validate_memop(oi
, MO_LEUW
);
999 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
1000 ret
= lduw_le_p(haddr
);
1001 clear_helper_retaddr();
1002 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
1006 uint32_t cpu_ldl_le_mmu(CPUArchState
*env
, abi_ptr addr
,
1007 MemOpIdx oi
, uintptr_t ra
)
1012 validate_memop(oi
, MO_LEUL
);
1013 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
1014 ret
= ldl_le_p(haddr
);
1015 clear_helper_retaddr();
1016 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
1020 uint64_t cpu_ldq_le_mmu(CPUArchState
*env
, abi_ptr addr
,
1021 MemOpIdx oi
, uintptr_t ra
)
1026 validate_memop(oi
, MO_LEUQ
);
1027 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_LOAD
);
1028 ret
= ldq_le_p(haddr
);
1029 clear_helper_retaddr();
1030 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_R
);
1034 void cpu_stb_mmu(CPUArchState
*env
, abi_ptr addr
, uint8_t val
,
1035 MemOpIdx oi
, uintptr_t ra
)
1039 validate_memop(oi
, MO_UB
);
1040 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1042 clear_helper_retaddr();
1043 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1046 void cpu_stw_be_mmu(CPUArchState
*env
, abi_ptr addr
, uint16_t val
,
1047 MemOpIdx oi
, uintptr_t ra
)
1051 validate_memop(oi
, MO_BEUW
);
1052 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1053 stw_be_p(haddr
, val
);
1054 clear_helper_retaddr();
1055 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1058 void cpu_stl_be_mmu(CPUArchState
*env
, abi_ptr addr
, uint32_t val
,
1059 MemOpIdx oi
, uintptr_t ra
)
1063 validate_memop(oi
, MO_BEUL
);
1064 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1065 stl_be_p(haddr
, val
);
1066 clear_helper_retaddr();
1067 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1070 void cpu_stq_be_mmu(CPUArchState
*env
, abi_ptr addr
, uint64_t val
,
1071 MemOpIdx oi
, uintptr_t ra
)
1075 validate_memop(oi
, MO_BEUQ
);
1076 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1077 stq_be_p(haddr
, val
);
1078 clear_helper_retaddr();
1079 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1082 void cpu_stw_le_mmu(CPUArchState
*env
, abi_ptr addr
, uint16_t val
,
1083 MemOpIdx oi
, uintptr_t ra
)
1087 validate_memop(oi
, MO_LEUW
);
1088 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1089 stw_le_p(haddr
, val
);
1090 clear_helper_retaddr();
1091 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1094 void cpu_stl_le_mmu(CPUArchState
*env
, abi_ptr addr
, uint32_t val
,
1095 MemOpIdx oi
, uintptr_t ra
)
1099 validate_memop(oi
, MO_LEUL
);
1100 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1101 stl_le_p(haddr
, val
);
1102 clear_helper_retaddr();
1103 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1106 void cpu_stq_le_mmu(CPUArchState
*env
, abi_ptr addr
, uint64_t val
,
1107 MemOpIdx oi
, uintptr_t ra
)
1111 validate_memop(oi
, MO_LEUQ
);
1112 haddr
= cpu_mmu_lookup(env
, addr
, oi
, ra
, MMU_DATA_STORE
);
1113 stq_le_p(haddr
, val
);
1114 clear_helper_retaddr();
1115 qemu_plugin_vcpu_mem_cb(env_cpu(env
), addr
, oi
, QEMU_PLUGIN_MEM_W
);
1118 uint32_t cpu_ldub_code(CPUArchState
*env
, abi_ptr ptr
)
1122 set_helper_retaddr(1);
1123 ret
= ldub_p(g2h_untagged(ptr
));
1124 clear_helper_retaddr();
1128 uint32_t cpu_lduw_code(CPUArchState
*env
, abi_ptr ptr
)
1132 set_helper_retaddr(1);
1133 ret
= lduw_p(g2h_untagged(ptr
));
1134 clear_helper_retaddr();
1138 uint32_t cpu_ldl_code(CPUArchState
*env
, abi_ptr ptr
)
1142 set_helper_retaddr(1);
1143 ret
= ldl_p(g2h_untagged(ptr
));
1144 clear_helper_retaddr();
1148 uint64_t cpu_ldq_code(CPUArchState
*env
, abi_ptr ptr
)
1152 set_helper_retaddr(1);
1153 ret
= ldq_p(g2h_untagged(ptr
));
1154 clear_helper_retaddr();
1158 #include "ldst_common.c.inc"
1161 * Do not allow unaligned operations to proceed. Return the host address.
1163 * @prot may be PAGE_READ, PAGE_WRITE, or PAGE_READ|PAGE_WRITE.
1165 static void *atomic_mmu_lookup(CPUArchState
*env
, target_ulong addr
,
1166 MemOpIdx oi
, int size
, int prot
,
1169 MemOp mop
= get_memop(oi
);
1170 int a_bits
= get_alignment_bits(mop
);
1173 /* Enforce guest required alignment. */
1174 if (unlikely(addr
& ((1 << a_bits
) - 1))) {
1175 MMUAccessType t
= prot
== PAGE_READ
? MMU_DATA_LOAD
: MMU_DATA_STORE
;
1176 cpu_loop_exit_sigbus(env_cpu(env
), addr
, t
, retaddr
);
1179 /* Enforce qemu required alignment. */
1180 if (unlikely(addr
& (size
- 1))) {
1181 cpu_loop_exit_atomic(env_cpu(env
), retaddr
);
1184 ret
= g2h(env_cpu(env
), addr
);
1185 set_helper_retaddr(retaddr
);
1189 #include "atomic_common.c.inc"
1192 * First set of functions passes in OI and RETADDR.
1193 * This makes them callable from other helpers.
1196 #define ATOMIC_NAME(X) \
1197 glue(glue(glue(cpu_atomic_ ## X, SUFFIX), END), _mmu)
1198 #define ATOMIC_MMU_CLEANUP do { clear_helper_retaddr(); } while (0)
1201 #include "atomic_template.h"
1204 #include "atomic_template.h"
1207 #include "atomic_template.h"
1209 #ifdef CONFIG_ATOMIC64
1211 #include "atomic_template.h"
1214 #if HAVE_ATOMIC128 || HAVE_CMPXCHG128
1215 #define DATA_SIZE 16
1216 #include "atomic_template.h"