1358 	int first = 1;  in get_partition_table_geometry()  local
1370 			if (first) {  in get_partition_table_geometry()
1373 				first = 0;  in get_partition_table_geometry()
1379 	if (!first && !bad) {  in get_partition_table_geometry()
2329 fill_bounds(sector_t *first, sector_t *last)  in fill_bounds()  argument
2338 			first[i] = 0xffffffff;  in fill_bounds()
2341 			first[i] = get_partition_start_from_dev_start(pe);  in fill_bounds()
2342 			last[i] = first[i] + get_nr_sects(p) - 1;  in fill_bounds()
2377 	sector_t first[g_partitions], last[g_partitions];  in verify()  local
2392 	fill_bounds(first, last);  in verify()
2399 			if (get_partition_start_from_dev_start(pe) < first[i])  in verify()
2404 			total += last[i] + 1 - first[i];  in verify()
2406 				if ((first[i] >= first[j] && first[i] <= last[j])  in verify()
2407 				 || ((last[i] <= last[j] && last[i] >= first[j]))) {  in verify()
2410 					total += first[i] >= first[j] ?  in verify()
2411 						first[i] : first[j];  in verify()
2431 			} else if (first[i] < extended_offset || last[i] > e_last) {  in verify()
2460 	sector_t first[g_partitions], last[g_partitions];  in add_partition()  local
2466 	fill_bounds(first, last);  in add_partition()
2474 			first[ext_index] = extended_offset;  in add_partition()
2484 			first[i] = (cround(first[i]) - 1) * units_per_sector;  in add_partition()
2495 			if (start >= first[i] && start <= lastplusoff)  in add_partition()
2534 		if (start < first[i] && limit >= first[i])  in add_partition()
2535 			limit = first[i] - 1;  in add_partition()
2767 	sector_t new, first, nr_sects;  in move_begin()  local
2776 …first = get_partition_start_from_dev_start(pe); /* == pe->offset_from_dev_start + get_start_sect(p…  in move_begin()
2777 	new = read_int(0 /*was:first*/, first, first + nr_sects - 1, first, "New beginning of data");  in move_begin()
2778 	if (new != first) {  in move_begin()