/*--------------------------------------------------------------------------- * * marks a new set of sectors as reconstructed. All the possible * mergings get complicated. To simplify matters, the approach I take * is to just dump something into the list, and then clean it up * (i.e. merge elements and eliminate redundant ones) in a second pass * over the list (compact_stat_entry()). Not 100% efficient, since a * structure can be allocated and then immediately freed, but it keeps * this code from becoming (more of) a nightmare of special cases. * The only thing that compact_stat_entry() assumes is that the list * is sorted by startSector, and so this is the only condition I * maintain here. (MCH) * * This code now uses a pool instead of the previous malloc/free * stuff. *-------------------------------------------------------------------------*/