Return-Path: Received: (majordomo@vger.kernel.org) by vger.kernel.org via listexpand id S1755647AbYFZG7w (ORCPT ); Thu, 26 Jun 2008 02:59:52 -0400 Received: (majordomo@vger.kernel.org) by vger.kernel.org id S1753548AbYFZG7p (ORCPT ); Thu, 26 Jun 2008 02:59:45 -0400 Received: from sh.osrg.net ([192.16.179.4]:49239 "EHLO sh.osrg.net" rhost-flags-OK-OK-OK-OK) by vger.kernel.org with ESMTP id S1753127AbYFZG7o (ORCPT ); Thu, 26 Jun 2008 02:59:44 -0400 Date: Thu, 26 Jun 2008 15:58:24 +0900 To: jens.axboe@oracle.com Cc: fujita.tomonori@lab.ntt.co.jp, stern@rowland.harvard.edu, andi@firstfloor.org, linux-kernel@vger.kernel.org, antonio.lin@alcormicro.com, david.vrabel@csr.com Subject: Re: Scatter-gather list constraints From: FUJITA Tomonori In-Reply-To: <20080626063559.GJ20851@kernel.dk> References: <20080626110615U.fujita.tomonori@lab.ntt.co.jp> <20080626143928P.fujita.tomonori@lab.ntt.co.jp> <20080626063559.GJ20851@kernel.dk> Mime-Version: 1.0 Content-Type: Text/Plain; charset=us-ascii Content-Transfer-Encoding: 7bit Message-Id: <20080626155834I.fujita.tomonori@lab.ntt.co.jp> Sender: linux-kernel-owner@vger.kernel.org List-ID: X-Mailing-List: linux-kernel@vger.kernel.org Content-Length: 3043 Lines: 63 On Thu, 26 Jun 2008 08:35:59 +0200 Jens Axboe wrote: > On Thu, Jun 26 2008, FUJITA Tomonori wrote: > > On Thu, 26 Jun 2008 11:06:03 +0900 > > FUJITA Tomonori wrote: > > > > > On Wed, 25 Jun 2008 10:23:00 -0400 (EDT) > > > Alan Stern wrote: > > > > > > > On Wed, 25 Jun 2008, FUJITA Tomonori wrote: > > > > > > > > > > For example, suppose an I/O request starts out with two S-G elements > > > > > > of 1536 bytes and 2048 bytes respectively, and the DMA requirement is > > > > > > that all elements except the last must have length divisible by 1024. > > > > > > Then the request could be broken up into three requests of 1024, 512, > > > > > > and 2048 bytes. > > > > > > > > > > I can't say that it's easy to implement a clean mechanism to break up > > > > > a request into multiple requests until I see a patch. > > > > > > > > And I can't write a patch without learning a lot more about how the > > > > block core works. > > > > > > > > > What I said is that you think that this is about extending something > > > > > in the block layer but it's about adding a new concept to the block > > > > > layer. > > > > > > > > Is it? What does the block layer do when it receives an I/O request > > > > that don't satisfy the other constraints (max_sectors or > > > > dma_alignment_mask, for example)? > > > > > > As I explained, you need something new. > > > > > > I don't think that max_sectors works as you expect. > > > > The block layer looks at max_sectors when merging two things (or add > > one to another). So the test fails, it doesn't merge them. > > > > > > > dma_alignment_mask is not used in the FS path. And I think that > > > dma_alignment_mask doens't solve your problems. > > > > If dma_alignment_mask test fails, the block layer allocates temporary > > buffers and does memory copies. > > I don't think adding anything in the general IO path makes a lot of > sense, this is a really screwy case. I don't mind adding work-arounds to > the block layer to cater for hardware weirdness, but this is getting a > little silly. We could provide a helper function for 'bouncing' this > request and thus reuse the block bounce buffer for this, but I'm not > even sure how to simply express this generically. As it is likely of no > use outside of this specific case, putting it in the driver (or usb > layer, if you expect more of these similar cases) is the best option. Yeah, agreed, as I wrote in the first mail: http://marc.info/?l=linux-kernel&m=121430416329618&w=2 I guess that a generic mechanism reserving some buffers in the block layer might work for them. I also need such a mechnism to convert sg and st to use the block layer (yeah, it's overdue but still on my todo list). -- 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/