mtd: bcm47xxpart: simplify size calculation to one loop

	 * Assume that partitions end at the beginning of the one they are

	 * Assume that partitions end at the beginning of the one they are

	 * followed by.

	 * followed by.

	 */

	 */

	for (i = 0; i < curr_part - 1; i++)

	for (i = 0; i < curr_part; i++) {

		parts[i].size = parts[i + 1].offset - parts[i].offset;

		u64 next_part_offset = (i < curr_part - 1) ?

	if (curr_part > 0)

				       parts[i + 1].offset : master->size;

		parts[curr_part - 1].size =

				master->size - parts[curr_part - 1].offset;

		parts[i].size = next_part_offset - parts[i].offset;

	}

	*pparts = parts;

	*pparts = parts;

	return curr_part;

	return curr_part;