#endif
-// Set to 1 if CR3 reload with same value shall not
-// force a shadow page table flush
-// It makes windows loading MUCH faster.
-// Note that this optimization appears to fail with a 2.6 linux kernel
-#define CR3_RELOAD_OPTIMIZATION 0
-
-
-
-
-
-
-
// First Attempt = 494 lines
// current = 106 lines
int handle_cr0_write(struct guest_info * info) {
struct cr0_32 *real_cr0 = (struct cr0_32*)&(info->ctrl_regs.cr0);
struct cr0_32 *new_cr0= (struct cr0_32 *)(dec_instr.src_operand.operand);
- PrintDebug("OperandVal = %x, length=%d\n", *new_cr0, dec_instr_src_operand.size);
+ PrintDebug("OperandVal = %x, length=%d\n", *new_cr0, dec_instr.src_operand.size);
PrintDebug("Old CR0=%x\n", *real_cr0);
-// First Attemp = 256 lines
+// First Attempt = 256 lines
// current = 65 lines
int handle_cr3_write(struct guest_info * info) {
int ret;
struct cr3_32 * new_cr3 = (struct cr3_32 *)(dec_instr.src_operand.operand);
struct cr3_32 * guest_cr3 = (struct cr3_32 *)&(info->shdw_pg_state.guest_cr3);
struct cr3_32 * shadow_cr3 = (struct cr3_32 *)&(info->shdw_pg_state.shadow_cr3);
+ int cached = 0;
+
PrintDebug("Old Shadow CR3=%x; Old Guest CR3=%x\n",
*(uint_t*)shadow_cr3, *(uint_t*)guest_cr3);
- if (!CR3_RELOAD_OPTIMIZATION || !CR3_32_SAME_BASE(new_cr3, guest_cr3)) {
- addr_t shadow_pt;
+ cached = cache_page_tables32(info, CR3_TO_PDE32(*(addr_t *)new_cr3));
+
+ if (cached == -1) {
+ PrintError("CR3 Cache failed\n");
+ return -1;
+ } else if (cached == 0) {
+ addr_t shadow_pt;
PrintDebug("New CR3 is different - flushing shadow page table\n");
shadow_pt = create_new_shadow_pt32();
shadow_cr3->pdt_base_addr = PD32_BASE_ADDR(shadow_pt);
- }
+ } else {
+ PrintDebug("Reusing cached shadow Page table\n");
+ }
shadow_cr3->pwt = new_cr3->pwt;
shadow_cr3->pcd = new_cr3->pcd;
return -1;
}
-
info->rip += dec_instr.instr_length;
return 0;