Unfortunately, that's what the sparc64 code wanted to do, this
transformation in the sparc64 sg chaining patch is not equilavent:
- struct scatterlist *sg_end = sg + nelems;
+ struct scatterlist *sg_end = sg_last(sg, nelems);
...
- while (sg < sg_end &&
+ while (sg != sg_end &&
No, that's not what the code was doing. The while loop
has to process the last entry in the list,
We really needed "sg_end" to be "one past the last element",
rather than "the last element".
Since you say that sg_next() on the last entry is illegal,
and that's what this code would have done to try and reach
loop termination (it doesn't actually derefrence that
"end plus one" scatterlist entry) I'll try to code this up
some other way.
Besides, sg_last() is so absurdly expensive, it has to walk the entire
chain in the chaining case. So better to implement this without it.
I would suggest that other sg_last() uses be audited for the same bug.
-
