Lines Matching refs:erased
145 be erased. */
168 /* Given ERASED_BLOCKS, a list of blocks that will be erased with
171 that will be erased but not rewritten (e.g. padding within a block
183 /* Look at each erased memory_write_request in turn, and
186 This implementation is O(length(erased) * length(written)). If
194 struct memory_write_request erased = erased_iter;
204 if (written->end <= erased.begin)
213 if (written->begin >= erased.end)
215 result.push_back (erased);
220 the next erased region. */
221 if (written->begin <= erased.begin
222 && written->end >= erased.end)
230 if (written->begin > erased.begin)
232 result.emplace_back (erased.begin, written->begin);
233 erased.begin = written->begin;
241 if (written->end < erased.end)
243 erased.begin = written->end;
250 ERASED, then that means it's really erased. */
251 result.push_back (erased);
268 std::vector<memory_write_request> erased, garbled;
291 erased = blocks_to_erase (flash);
293 /* Find what flash regions will be erased, and not overwritten; then
295 garbled = compute_garbled_blocks (erased, flash);
350 if (!erased.empty ())
353 for (const memory_write_request &iter : erased)