Changeset View
Changeset View
Standalone View
Standalone View
sys/riscv/riscv/minidump_machdep.c
| Show First 20 Lines • Show All 149 Lines • ▼ Show 20 Lines | blk_write(struct dumperinfo *di, char *ptr, vm_paddr_t pa, size_t sz) | ||||
| } | } | ||||
| return (0); | return (0); | ||||
| } | } | ||||
| int | int | ||||
| cpu_minidumpsys(struct dumperinfo *di, struct minidumpstate *state) | cpu_minidumpsys(struct dumperinfo *di, struct minidumpstate *state) | ||||
| { | { | ||||
| pd_entry_t *l1, *l2; | pd_entry_t *l1, *l2, l2e; | ||||
| pt_entry_t *l3; | pt_entry_t *l3, l3e; | ||||
| struct minidumphdr mdhdr; | struct minidumphdr mdhdr; | ||||
| uint32_t pmapsize; | uint32_t pmapsize; | ||||
| vm_offset_t va; | vm_offset_t va; | ||||
| vm_paddr_t pa; | vm_paddr_t pa; | ||||
| int error; | int error; | ||||
| int i; | int i; | ||||
| int retry_count; | int retry_count; | ||||
| retry_count = 0; | retry_count = 0; | ||||
| retry: | retry: | ||||
| retry_count++; | retry_count++; | ||||
| error = 0; | error = 0; | ||||
| pmapsize = 0; | pmapsize = 0; | ||||
| /* Build set of dumpable pages from kernel pmap */ | /* Snapshot the KVA upper bound in case it grows. */ | ||||
| kva_max = kernel_vm_end; | |||||
| /* | |||||
| * Walk the kernel page table pages, setting the active entries in the | |||||
| * dump bitmap. | |||||
| * | |||||
| * NB: for a live dump, we may be racing with updates to the page | |||||
| * tables, so care must be taken to read each entry only once. | |||||
| */ | |||||
| for (va = VM_MIN_KERNEL_ADDRESS; va < kernel_vm_end; va += L2_SIZE) { | for (va = VM_MIN_KERNEL_ADDRESS; va < kernel_vm_end; va += L2_SIZE) { | ||||
| pmapsize += PAGE_SIZE; | pmapsize += PAGE_SIZE; | ||||
| if (!pmap_get_tables(pmap_kernel(), va, &l1, &l2, &l3)) | if (!pmap_get_tables(pmap_kernel(), va, &l1, &l2, &l3)) | ||||
| continue; | continue; | ||||
| /* We should always be using the l2 table for kvm */ | /* We should always be using the l2 table for kvm */ | ||||
| if (l2 == NULL) | if (l2 == NULL) | ||||
| continue; | continue; | ||||
| /* l2 may be a superpage */ | /* l2 may be a superpage */ | ||||
| if ((*l2 & PTE_RWX) != 0) { | l2e = *l2; | ||||
| pa = (*l2 >> PTE_PPN1_S) << L2_SHIFT; | if ((l2e & PTE_RWX) != 0) { | ||||
| pa = (l2e >> PTE_PPN1_S) << L2_SHIFT; | |||||
| for (i = 0; i < Ln_ENTRIES; i++, pa += PAGE_SIZE) { | for (i = 0; i < Ln_ENTRIES; i++, pa += PAGE_SIZE) { | ||||
| if (dump_page_is_dumpable(pa)) | if (dump_page_is_dumpable(pa)) | ||||
| dump_add_page(pa); | dump_add_page(pa); | ||||
| } | } | ||||
| } else { | } else { | ||||
| for (i = 0; i < Ln_ENTRIES; i++) { | for (i = 0; i < Ln_ENTRIES; i++) { | ||||
| if ((l3[i] & PTE_V) == 0) | l3e = l3[i]; | ||||
| if ((l3e & PTE_V) == 0) | |||||
| continue; | continue; | ||||
| pa = (l3[i] >> PTE_PPN0_S) * PAGE_SIZE; | pa = (l3e >> PTE_PPN0_S) * PAGE_SIZE; | ||||
| if (dump_page_is_dumpable(pa)) | if (dump_page_is_dumpable(pa)) | ||||
| dump_add_page(pa); | dump_add_page(pa); | ||||
| } | } | ||||
| } | } | ||||
| } | } | ||||
| /* Calculate dump size */ | /* Calculate dump size */ | ||||
| dumpsize = pmapsize; | dumpsize = pmapsize; | ||||
| ▲ Show 20 Lines • Show All 69 Lines • ▼ Show 20 Lines | if (!pmap_get_tables(pmap_kernel(), va, &l1, &l2, &l3)) { | ||||
| /* We always write a page, even if it is zero */ | /* We always write a page, even if it is zero */ | ||||
| error = blk_write(di, (char *)&tmpbuffer, 0, PAGE_SIZE); | error = blk_write(di, (char *)&tmpbuffer, 0, PAGE_SIZE); | ||||
| if (error) | if (error) | ||||
| goto fail; | goto fail; | ||||
| /* Flush, in case we reuse tmpbuffer in the same block */ | /* Flush, in case we reuse tmpbuffer in the same block */ | ||||
| error = blk_flush(di); | error = blk_flush(di); | ||||
| if (error) | if (error) | ||||
| goto fail; | goto fail; | ||||
| } else if ((*l2 & PTE_RWX) != 0) { | continue; | ||||
| } | |||||
| l2e = *l2; | |||||
| if ((l2e & PTE_RWX) != 0) { | |||||
| /* Generate fake l3 entries based on the l2 superpage */ | /* Generate fake l3 entries based on the l2 superpage */ | ||||
| for (i = 0; i < Ln_ENTRIES; i++) { | for (i = 0; i < Ln_ENTRIES; i++) { | ||||
| tmpbuffer[i] = (*l2 | (i << PTE_PPN0_S)); | tmpbuffer[i] = (l2e | (i << PTE_PPN0_S)); | ||||
| } | } | ||||
| /* We always write a page, even if it is zero */ | /* We always write a page, even if it is zero */ | ||||
| error = blk_write(di, (char *)&tmpbuffer, 0, PAGE_SIZE); | error = blk_write(di, (char *)&tmpbuffer, 0, PAGE_SIZE); | ||||
| if (error) | if (error) | ||||
| goto fail; | goto fail; | ||||
| /* Flush, in case we reuse tmpbuffer in the same block */ | /* Flush, in case we reuse tmpbuffer in the same block */ | ||||
| error = blk_flush(di); | error = blk_flush(di); | ||||
| if (error) | if (error) | ||||
| goto fail; | goto fail; | ||||
| bzero(&tmpbuffer, sizeof(tmpbuffer)); | bzero(&tmpbuffer, sizeof(tmpbuffer)); | ||||
| } else { | } else { | ||||
| pa = (*l2 >> PTE_PPN0_S) * PAGE_SIZE; | pa = (l2e >> PTE_PPN0_S) * PAGE_SIZE; | ||||
| /* We always write a page, even if it is zero */ | /* We always write a page, even if it is zero */ | ||||
| error = blk_write(di, NULL, pa, PAGE_SIZE); | error = blk_write(di, NULL, pa, PAGE_SIZE); | ||||
| if (error) | if (error) | ||||
| goto fail; | goto fail; | ||||
| } | } | ||||
| } | } | ||||
| ▲ Show 20 Lines • Show All 41 Lines • Show Last 20 Lines | |||||