Lines Matching defs:block
57 struct block {
80 int reserved_block; /* block next up for reclaim */
81 int current_block; /* block to write to */
88 struct block *blocks;
95 struct block *block = &part->blocks[block_no];
98 block->offset = part->block_size * block_no;
101 block->state = BLOCK_UNUSED;
105 block->state = BLOCK_OK;
116 block->free_sectors++;
139 part->sector_map[entry] = block->offset +
142 block->used_sectors++;
145 if (block->free_sectors == part->data_sectors_per_block)
164 /* each erase block has three bytes header, followed by the map */
188 part->blocks = kcalloc(part->total_blocks, sizeof(struct block),
271 static int erase_block(struct partition *part, int block)
280 erase->addr = part->blocks[block].offset;
283 part->blocks[block].state = BLOCK_ERASING;
284 part->blocks[block].free_sectors = 0;
291 part->blocks[block].state = BLOCK_FAILED;
292 part->blocks[block].free_sectors = 0;
293 part->blocks[block].used_sectors = 0;
298 part->blocks[block].state = BLOCK_ERASED;
299 part->blocks[block].free_sectors = part->data_sectors_per_block;
300 part->blocks[block].used_sectors = 0;
301 part->blocks[block].erases++;
303 rc = mtd_write(part->mbd.mtd, part->blocks[block].offset,
310 part->mbd.mtd->name, part->blocks[block].offset);
311 part->blocks[block].state = BLOCK_FAILED;
313 part->blocks[block].state = BLOCK_OK;
412 int block, best_block, score, old_sector_block;
425 for (block=0; block<part->total_blocks; block++) {
428 if (block == part->reserved_block)
436 if (part->blocks[block].free_sectors)
439 this_score = part->blocks[block].used_sectors;
441 if (block == old_sector_block)
444 /* no point in moving a full block */
445 if (part->blocks[block].used_sectors ==
450 this_score += part->blocks[block].erases;
453 best_block = block;
464 pr_debug("reclaim_block: reclaiming block #%d with %d used "
478 * IMPROVE: It would be best to choose the block with the most deleted sectors,
484 int block, stop;
486 block = part->current_block == -1 ?
488 stop = block;
491 if (part->blocks[block].free_sectors &&
492 block != part->reserved_block)
493 return block;
495 if (part->blocks[block].state == BLOCK_UNUSED)
496 erase_block(part, block);
498 if (++block >= part->total_blocks)
499 block = 0;
501 } while (block != stop);
508 int rc, block;
511 block = find_free_block(part);
513 if (block == -1) {
519 block = find_free_block(part);
522 if (block == -1) {
528 rc = mtd_read(part->mbd.mtd, part->blocks[block].offset,
538 part->blocks[block].offset);
542 part->current_block = block;
550 int block, offset, rc;
555 block = old_addr / part->block_size;
559 addr = part->blocks[block].offset +
572 if (block == part->current_block)
575 part->blocks[block].used_sectors--;
577 if (!part->blocks[block].used_sectors &&
578 !part->blocks[block].free_sectors)
579 rc = erase_block(part, block);
585 static int find_free_sector(const struct partition *part, const struct block *block)
589 i = stop = part->data_sectors_per_block - block->free_sectors;
607 struct block *block;
622 block = &part->blocks[part->current_block];
624 i = find_free_sector(part, block);
632 block->offset;
651 addr = block->offset + (HEADER_MAP_OFFSET + i) * sizeof(u16);
663 block->used_sectors++;
664 block->free_sectors--;