On 2019-06-28 11:29 a.m., Jason Gunthorpe wrote: > On Fri, Jun 28, 2019 at 10:22:06AM -0600, Logan Gunthorpe wrote: > >>> Why not? If we have a 'bar info' structure that could have data >>> transfer op callbacks, infact, I think we might already have similar >>> callbacks for migrating to/from DEVICE_PRIVATE memory with DMA.. >> >> Well it could, in theory be done, but It just seems wrong to setup and >> wait for more DMA requests while we are in mid-progress setting up >> another DMA request. Especially when the block layer has historically >> had issues with stack sizes. It's also possible you might have multiple >> bio_vec's that have to each do a migration and with a hook here they'd >> have to be done serially. > > *shrug* this is just standard bounce buffering stuff... I don't know of any "standard" bounce buffering stuff that uses random other device's DMA engines where appropriate. >>> I think the best reason to prefer a uniform phys_addr_t is that it >>> does give us the option to copy the data to/from CPU memory. That >>> option goes away as soon as the bio sometimes provides a dma_addr_t. >> >> Not really. phys_addr_t alone doesn't give us a way to copy data. You >> need a lookup table on that address and a couple of hooks. > > Yes, I'm not sure how you envision using phys_addr_t without a > lookup.. At the end of the day we must get the src and target 'struct > device' in the dma_map area (at the minimum to compute the offset to > translate phys_addr_t to dma_addr_t) and the only way to do that from > phys_addr_t is via lookup?? I thought my other email to Christoph laid it out pretty cleanly... >>> At least for RDMA, we do have some cases (like siw/rxe, hfi) where >>> they sometimes need to do that copy. I suspect the block stack is >>> similar, in the general case. >> >> But the whole point of the use cases I'm trying to serve is to avoid the >> root complex. > > Well, I think this is sort of a seperate issue. Generically I think > the dma layer should continue to work largely transparently, and if I > feed in BAR memory that can't be P2P'd it should bounce, just like > all the other DMA limitations it already supports. That is pretty much > its whole purpose in life. I disagree. It's one thing for the DMA layer to work around architecture limitations like HighMem/LowMem and just do a memcpy when it can't handle it -- it's whole different thing for the DMA layer to know about the varieties of memory on different peripheral device's and the nuances of how and when to transfer between them. I think the submitting driver has the best information of when to do these transfers. IMO the bouncing in the DMA layer isn't a desirable thing, it was a necessary addition to work around various legacy platform issues and have existing code still work correctly. It's always better for a driver to allocate memory appropriate for the DMA than to just use random memory and rely on it being bounced by the lower layer. For P2P, we don't have existing code to worry about so I don't think a magic automatic bouncing design is appropriate. > The issue of having the caller optimize what it sends is kind of > separate - yes you definately still need the egress DMA device to > drive CMB buffer selection, and DEVICE_PRIVATE also needs it to decide > if it should migrate or not. Yes, but my contention is that I don't want to have to make these decisions twice: once before I submit it to the block layer, then again at mapping time. > What I see as the question is how to layout the BIO. > > If we agree the bio should only have phys_addr_t then we need some > 'bar info' (ie at least the offset) in the dma map and some 'bar info' > (ie the DMA device) during the bio construciton. Per my other email, it was phys_addr_t plus hints on how to map the memory (bus address, dma_map_resource, or regular). This requires exactly two flag bits in the bio_vec and no interval tree or hash table. I don't want to have to pass bar info, other hooks, or anything like that to the block layer. > What you are trying to do is optimize the passing of that 'bar info' > with a limited number of bits in the BIO. > > A single flag means an interval tree, 4-8 bits could build a probably > O(1) hash lookup, 64 bits could store a pointer, etc. Well, an interval tree can get you the backing device for a given phys_addr_t; however, for P2PDMA, we need a second lookup based on the mapping device. This is because exactly how you map the data depends on both devices. Currently I'm working on this for the existing implementation and struct page gets me the backing device but I need another xarray cache based on the mapping device to figure out exactly how to map the memory. But none of this mess is required if we can just pass the mapping hints through the block layer as flags (per my other email) because the submitting driver should already know ahead of time what it's trying to do. > If we can spare 4-8 bits in the bio then I suggest a 'perfect hash > table'. Assign each registered P2P 'bar info' a small 4 bit id and > hash on that. It should be fast enough to not worry about the double > lookup. This feels like it's just setting us up to run into nasty limits based on the number of bits we actually have. The number of bits in a bio_vec will always be a precious resource. If I have a server chassis that exist today with 24 NVMe devices, and each device has a CMB, I'm already using up 6 of those bits. Then we might have DEVICE_PRIVATE and other uses on top of that. Logan
