| 188 | } |
| 189 | |
| 190 | void pack_geometry_split(struct pack_geometry *geometry) |
| 191 | { |
| 192 | geometry->split = compute_pack_geometry_split(geometry->pack, geometry->pack_nr, |
| 193 | geometry->split_factor); |
| 194 | geometry->promisor_split = compute_pack_geometry_split(geometry->promisor_pack, |
| 195 | geometry->promisor_pack_nr, |
| 196 | geometry->split_factor); |
| 197 | for (uint32_t i = 0; i < geometry->split; i++) { |
| 198 | struct packed_git *p = geometry->pack[i]; |
| 199 | /* |
| 200 | * During incremental MIDX/bitmap repacking, any packs |
| 201 | * included in the rollup are either (a) not MIDX'd, or |
| 202 | * (b) contained in the tip layer iff it has at least |
| 203 | * the threshold number of packs. |
| 204 | * |
| 205 | * In the latter case, we can safely conclude that the |
| 206 | * tip of the MIDX chain will be rewritten. |
| 207 | */ |
| 208 | if (p->multi_pack_index) |
| 209 | geometry->midx_tip_rewritten = true; |
| 210 | } |
| 211 | } |
| 212 | |
| 213 | struct packed_git *pack_geometry_preferred_pack(struct pack_geometry *geometry) |
| 214 | { |
no test coverage detected