From mboxrd@z Thu Jan 1 00:00:00 1970 Return-Path: Subject: Re: [PATCH v2 00/10] Copy Offload in NVMe Fabrics with P2P PCI Memory From: Benjamin Herrenschmidt Reply-To: benh@au1.ibm.com To: Logan Gunthorpe , Dan Williams Cc: Jens Axboe , Keith Busch , Oliver OHalloran , Alex Williamson , linux-nvdimm , linux-rdma , linux-pci@vger.kernel.org, Linux Kernel Mailing List , linux-nvme@lists.infradead.org, linux-block@vger.kernel.org, =?ISO-8859-1?Q?J=E9r=F4me?= Glisse , Jason Gunthorpe , Bjorn Helgaas , Max Gurtovoy , Christoph Hellwig Date: Fri, 02 Mar 2018 10:00:04 +1100 In-Reply-To: <43ba615f-a6e1-9444-65e1-494169cb415d@deltatee.com> References: <20180228234006.21093-1-logang@deltatee.com> <1519876489.4592.3.camel@kernel.crashing.org> <1519876569.4592.4.camel@au1.ibm.com> <1519936477.4592.23.camel@au1.ibm.com> <2079ba48-5ae5-5b44-cce1-8175712dd395@deltatee.com> <43ba615f-a6e1-9444-65e1-494169cb415d@deltatee.com> Content-Type: text/plain; charset="UTF-8" Mime-Version: 1.0 Message-Id: <1519945204.4592.45.camel@au1.ibm.com> List-ID: On Thu, 2018-03-01 at 14:57 -0700, Logan Gunthorpe wrote: > > On 01/03/18 02:45 PM, Logan Gunthorpe wrote: > > It handles it fine for many situations. But when you try to map > > something that is at the end of the physical address space then the > > spares-vmemmap needs virtual address space that's the size of the > > physical address space divided by PAGE_SIZE which may be a little bit > > too large... > > Though, considering this more, maybe this shouldn't be a problem... > > Lets say you have 56bits of address space. We use only 52 in practice but yes. > That's 64PB. If you use need > a sparse vmemmap for the entire space it will take 16TB which leaves you > with 63.98PB of address space left. (Similar calculations for other > numbers of address bits.) We only have 52 bits of virtual space for the kernel with the radix MMU. > So I'm not sure what the problem with this is. > > We still have to ensure all the arches map the memory with the right > cache bits but that should be relatively easy to solve. > > Logan