similar to: [PATCH][RFC]Remove lock on first guest table walk

Is there any trouble with mailing list? I didn''t see my mail sent back after almost 8hrs. :-( Thanks, Kevin -----Original Message----- From: Tian, Kevin Sent: 2008年2月22日 10:33 To: ''Tim Deegan'' Cc: xen-devel@lists.xensource.com Subject: [PATCH][UPDATE]Remove lock on guest table walk >From: Tim Deegan >Sent: 2008年2月21日 22:13 >Hi, > >So, the idea seems

1: correct LDT checks 2: add address validity check to guest_map_l1e() 3: use {rd,wr}{fs,gs}base when available 4: check for canonical address before doing page walks Signed-off-by: Jan Beulich <jbeulich@suse.com>

Hello, I''m new to Xen and especially to the hypervisor code. I''m working off a 3.0.4.1 base and have the following questions regarding the memory management code for an x86, 32-bit platform (capable of supporting PAE). I''m doing some research into providing grant table hypercall support from a Windows 2003 HVM. I have made all the necessary changes to allow the

From: Zhang Xiantao <xiantao.zhang@intel.com> With virtual EPT support, L1 hyerpvisor can use EPT hardware for L2 guest''s memory virtualization. In this way, L2 guest''s performance can be improved sharply. According to our testing, some benchmarks can show > 5x performance gain. Signed-off-by: Zhang Xiantao <xiantao.zhang@intel.com> Zhang Xiantao (11):

ging_prep ensures that an mfn is backing the paged-out gfn, and transitions to the next state in the paging state machine for this page. Foreign mappings of the gfn will now succeed. This is the key idea, as it allows the pager to now map the gfn and fill in its contents. Unfortunately, it also allows any other foreign mapper to map the gfn and read its contents. This is particularly dangerous

The following two patches allow the parallel use of memsharing, xenpaging and xen-access by using an independent ring buffer for each feature. Please review. v2: - update mem_event_check_ring arguments, check domain rather than domain_id - check ring_full first because its value was just evaluated - check if ring buffer is initialized before calling mem_access_domctl/mem_paging_domctl

Hi all, Can Xen hypervisor modify HVM domU's Shadow page table, under the dom0's context, like trapped from dom0's hypercall? I think it have to call 2 functions at least: guest_walk_tables() and flush_tlb_all(). Can these 2 functions called in dom0's context? In my test, if hypervisor tries to modify HVM's shadow page table, it will bring down the whole system. I am not

Hello Han, I am pleased you approve of the design and implementation of the XI shadow mechanism. And I appreciate the time and care you''ve taken in reviewing this substantial body of new code. You asked about performance statistics. With the current XI patch, we are seeing the following: - page faults times for XI are about 4 times faster than non-XI: 10.56 (non-XI) vs 2.43

We have found a critical problem with the XEN 3.1 release (for those who are running 15-20 VMs on a single server). We are using the official XEN 3.1 release on a rackable server (Dual-Core AMD Opteron, 8GB RAM). The problem we are seeing is that intermittently vifs fail to work properly in VMs after we create around 15-17 VMs on our server (all running at the same time, created one by

I would like to know approximately the overall execution flow when the guest O/S page fault - how is the page fault transfer to a page fault in the host O/S? Thanks. _______________________________________________ Xen-devel mailing list Xen-devel@lists.xensource.com http://lists.xensource.com/xen-devel

Hi. When I compiled xen-3.3-testing with DEBUG_TRACE_DUMP in xen/include/xen/lib.h turned on, I got some errors at SHADOW_PRINTK. The following patch will fix the arguments passed to SHADOW_PRINTK in xen/arch/x86/mm/shadow/common.c and xen/arch/x86/mm/shadow/multi.c. Although I haven''t tested, it is the same for xen-unstable.hg Thanks, Yoshi Signed-off-by: Yoshi Tamura

There has been some progress, but still no joy. Definitely not intended for inclusion at this point. Tim, Wei, I added a Xen command line toggle to disable IOMMU and P2M table sharing. Tim, I verified that changes to p2m-pt.c don''t break shadow mode (64bit hypervisor and Win 7 guest). Hongkaixing, I incorporated your suggestion in patch 2, so I should add your Signed-off-by eventually.

Hi, I''m doing my master research and I need to adapt remus code. Now... I wanna get the checkpoint size (memory + disk) on each period. Does someone know what function does this? I think some *fd *object''s function in remus code could just get the memory size. Does someone help me? Thanks _______________________________________________ Xen-devel mailing list

These two patches were originally part of the XSM series that I have posted, and remain prerequisites for that series. However, they are independent of the XSM changes and are a useful simplification regardless of the use of XSM. The Acked-bys on these patches were provided before rebasing them over the copyback changes in 26268:1b72138bddda, which had minor conflicts that I resolved. [PATCH

Hi, When I read the code of do_update_va_mapping, I find that it update the pte entry in the line page table by looking up the line page table via guest_map_l1e() : 2998 <http://lxr.xensource.com/lxr/source/xen/arch/x86/mm.c?a=x86_64#L2998> int do_update_va_mapping <http://lxr.xensource.com/lxr/ident?a=x86_64;i=do_update_va_mapping>(unsigned long va, u64

Hello everybody! With a HTB qdisc: # tc qdisc add dev eth0 root handle 99: htb How can I change the "final qdisc" of the default walk-throught class? # tc qdisc add dev eth0 parent 99:0 handle 88: sfq results in: "RTNETLINK answers: Invalid argument" CBQ automatically creates a xx:0 root class where I can attach final qdiscs... - If there is a root class in htb, how is it

Hi everybody, I am trying to generate two random walks with an specific correlation, for example, two random walks of 200 time steps with a correlation 0.7. I built the random walks with: x<-cumsum(rnorm(200, mean=0,sd=1)) y<-cumsum(rnorm(200, mean=0,sd=1)) but I don't know how to fix the correlation between them. With white noise is easy to fix the correlation using the function

Dear expeRts, recently I asked for a nice way to re-program a problem without using control constructs such as "for" or "sapply(1:length(x), ...". Is there a way to program a random walk with a reflecting boundary without resorting to such constructs? A working solution is ranwalk <- function(length, bound) { k <- cumsum(sample(c(-1, 1), length, replace=TRUE))

Following is my code, can some one help on the error at the bottom? > mh<-function(iterations,alpha,beta){ + data<-read.table("epidemic.txt",header = TRUE) + attach(data, warn.conflicts = F) + k<-97 + d <- (sqrt((x-x[k])^2 + (y-y[k])^2)) + p <- 1-exp(-alpha*d^(-beta)) + p.alpha<-1 - exp(-3*d^(-beta)) + p.beta <- 1 - exp(alpha*d^(-2)) +

This patch adds useful APIs for walking over the private data area. It is a prerequisite for the new event API stuff (specifically for the language bindings for that). Rich. -- Richard Jones, Virtualization Group, Red Hat http://people.redhat.com/~rjones virt-p2v converts physical machines to virtual machines. Boot with a live CD or over the network (PXE) and turn machines into Xen guests.