Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1751080Ab2BLHKl (ORCPT ); Sun, 12 Feb 2012 02:10:41 -0500 Received: from mail-pz0-f46.google.com ([209.85.210.46]:33760 "EHLO mail-pz0-f46.google.com" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1750895Ab2BLHKj (ORCPT ); Sun, 12 Feb 2012 02:10:39 -0500 Date: Sun, 12 Feb 2012 16:10:34 +0900 From: Takuya Yoshikawa To: Avi Kivity Cc: Alexander Graf , Anthony Liguori , KVM list , linux-kernel , qemu-devel , kvm-ppc Subject: Re: [Qemu-devel] [RFC] Next gen kvm api Message-Id: <20120212161034.9d8f68df72f6c28298cdcd33@gmail.com> In-Reply-To: <4F313354.4080401@redhat.com> References: <4F2AB552.2070909@redhat.com> <4F2B41D6.8020603@codemonkey.ws> <51470503-DEE0-478D-8D01-020834AF6E8C@suse.de> <4F3117E5.6000105@redhat.com> <4F31241C.70404@redhat.com> <4F313354.4080401@redhat.com> X-Mailer: Sylpheed 3.2.0beta3 (GTK+ 2.24.6; x86_64-pc-linux-gnu) Mime-Version: 1.0 Content-Type: text/plain; charset=US-ASCII Content-Transfer-Encoding: 7bit Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 1840 Lines: 35 Avi Kivity wrote: > > > Slot searching is quite fast since there's a small number of slots, and we sort the larger ones to be in the front, so positive lookups are fast. We cache negative lookups in the shadow page tables (an spte can be either "not mapped", "mapped to RAM", or "not mapped and known to be mmio") so we rarely need to walk the entire list. > > > > Well, we don't always have shadow page tables. Having hints for unmapped guest memory like this is pretty tricky. > > We're currently running into issues with device assignment though, where we get a lot of small slots mapped to real hardware. I'm sure that will hit us on x86 sooner or later too. > > For x86 that's not a problem, since once you map a page, it stays mapped > (on modern hardware). > I was once thinking about how to search a slot reasonably fast for every case, even when we do not have mmio-spte cache. One possible way I thought up was to sort slots according to their base_gfn. Then the problem would become: "find the first slot whose base_gfn + npages is greater than this gfn." Since we can do binary search, the search cost is O(log(# of slots)). But I guess that most of the time was wasted on reading many memslots just to know their base_gfn and npages. So the most practically effective thing is to make a separate array which holds just their base_gfn. This will make the task a simple, and cache friendly, search on an integer array: probably faster than using *-tree data structure. If needed, we should make cmp_memslot() architecture specific in the end? Takuya -- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/