independant
a->erasesize;
I'm still reluctant to change size to a 64-bit value. There's a vague
recolection of early conversations on the list that there would be little
acceptance for that. And that probably has to do with the ongoing
conversation about ABI changes. What I could do to eliminate the
multiplication is introduce the same concept that the NAND layer uses,
shift values. After all, erasesize should always be a power of 2, making
that a power of 2 multiplication which can be done via shifts. By
changing erasesize to erasesize_shift, I'd get something like this:
return a->num_eraseblocks == 0 ? a->size : a->num_eraseblocks <<
a->erasesize_shift
How would that suit you?
Bruce
--