Re: [PATCH][RT] 2.6.24-rc2-rt1 drivers/dma/ioat_dma.c compile fix



On Nov 16, 2007 3:57 AM, Sven-Thorsten Dietrich <sdietrich@xxxxxxxxxx>
wrote:
Compile fix for new code in -rc2.

I'm not positive about the insertion point...

Subject: compile error fix (needs review)

RT changes __list_splice to require prev and next pointers.

This changes the use in the new code to list_splice_tail,
but the optimal insertion point needs to be analyzed.

Signed-off-by: Sven-Thorsten Dietrich <sdietrich@xxxxxxx>

---
drivers/dma/ioat_dma.c | 2 +-
1 file changed, 1 insertion(+), 1 deletion(-)

Index: linux-2.6.23/drivers/dma/ioat_dma.c
===================================================================
--- linux-2.6.23.orig/drivers/dma/ioat_dma.c
+++ linux-2.6.23/drivers/dma/ioat_dma.c
@@ -244,7 +244,7 @@ static dma_cookie_t ioat_tx_submit(struc
/* write address into NextDescriptor field of last desc in
chain */
to_ioat_desc(ioat_chan->used_desc.prev)->hw->next =

first->async_tx.phys;
- __list_splice(&new_chain, ioat_chan->used_desc.prev);
+ list_splice_tail(&new_chain, ioat_chan->used_desc.prev);


NAK.

These functions do insertions differently. The 'prev' is pointing to
the last valid descriptor in the queue and you really want to get the
new_chain stuck on after this. Your list_splice_tail() will insert the
new_chain just before it which will muck up the order of the DMA
requests.

You might have more success with
list_splice_tail(&new_chain, ioat_chan->used_desc);
where used_desc points to the whole list, rather than using the .prev
pointer to a specific node.

Please copy me on future ioatdma related comments.

Thanks,
sln
--
======================================================================
Mr. Shannon Nelson LAN Access Division, Intel Corp.
Shannon.Nelson@xxxxxxxxx I don't speak for Intel
(503) 712-7659 Parents can't afford to be squeamish.
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@xxxxxxxxxxxxxxx
More majordomo info at http://vger.kernel.org/majordomo-info.html
Please read the FAQ at http://www.tux.org/lkml/



Relevant Pages

  • [PATCH][RT] 2.6.24-rc2-rt1 drivers/dma/ioat_dma.c compile fix
    ... I'm not positive about the insertion point... ... compile error fix (needs review) ... RT changes __list_splice to require prev and next pointers. ...
    (Linux-Kernel)
  • Re: Author of Visual C++ 2005 STL ???
    ... smart pointers would be the way to go here. ... allocation overhead will kill you. ... time on a vector would be Ofor each insertion to maintain the bsearch order. ... splitting the array into two pieces with an "out of band" cell for the insertion. ...
    (microsoft.public.vc.mfc)
  • Re: Naming curiosity
    ... void *head; ... I don't use a recursive structure using pointers to the structure itself ... struct sList *prev; ... misunderstand the real purpose of the head field. ...
    (comp.lang.c)
  • Re: deques, deques, and dequeues
    ... array of pointers to constant-sized arrays. ... have Oinsertion on either end, Odeletion from ... either end, Orandom access, Stable references under insertion ... iterators under insertion and deletion. ...
    (rec.games.roguelike.development)
  • Re: Naming curiosity
    ... Lorenzo Villari wrote: ... The structure is just as recursive even if you lie about ... the types of the pointers. ...
    (comp.lang.c)