@@ -272,7 +272,7 @@ Partition Partition::singleRegion(SILLocation loc, ArrayRef<Element> indices,
272
272
// region takes.
273
273
Element repElement = *std::min_element (indices.begin (), indices.end ());
274
274
Region repElementRegion = Region (repElement);
275
- p.fresh_label = Region (repElementRegion + 1 );
275
+ p.freshLabel = Region (repElementRegion + 1 );
276
276
277
277
// Place all of the operations until end of scope into one history
278
278
// sequence.
@@ -311,7 +311,7 @@ Partition Partition::separateRegions(SILLocation loc, ArrayRef<Element> indices,
311
311
p.pushNewElementRegion (index);
312
312
maxIndex = Element (std::max (maxIndex, index));
313
313
}
314
- p.fresh_label = Region (maxIndex + 1 );
314
+ p.freshLabel = Region (maxIndex + 1 );
315
315
assert (p.is_canonical_correct ());
316
316
return p;
317
317
}
@@ -321,10 +321,10 @@ void Partition::markTransferred(Element val,
321
321
// First see if our val is tracked. If it is not tracked, insert it and mark
322
322
// its new region as transferred.
323
323
if (!isTrackingElement (val)) {
324
- elementToRegionMap.insert_or_assign (val, fresh_label );
324
+ elementToRegionMap.insert_or_assign (val, freshLabel );
325
325
pushNewElementRegion (val);
326
- regionToTransferredOpMap.insert ({fresh_label , transferredOperandSet});
327
- fresh_label = Region (fresh_label + 1 );
326
+ regionToTransferredOpMap.insert ({freshLabel , transferredOperandSet});
327
+ freshLabel = Region (freshLabel + 1 );
328
328
canonical = false ;
329
329
return ;
330
330
}
@@ -346,9 +346,9 @@ void Partition::markTransferred(Element val,
346
346
bool Partition::undoTransfer (Element val) {
347
347
// First see if our val is tracked. If it is not tracked, insert it.
348
348
if (!isTrackingElement (val)) {
349
- elementToRegionMap.insert_or_assign (val, fresh_label );
349
+ elementToRegionMap.insert_or_assign (val, freshLabel );
350
350
pushNewElementRegion (val);
351
- fresh_label = Region (fresh_label + 1 );
351
+ freshLabel = Region (freshLabel + 1 );
352
352
canonical = false ;
353
353
return true ;
354
354
}
@@ -364,7 +364,7 @@ void Partition::trackNewElement(Element newElt, bool updateHistory) {
364
364
SWIFT_DEFER { validateRegionToTransferredOpMapRegions (); };
365
365
366
366
// First try to emplace newElt with fresh_label.
367
- auto iter = elementToRegionMap.try_emplace (newElt, fresh_label );
367
+ auto iter = elementToRegionMap.try_emplace (newElt, freshLabel );
368
368
369
369
// If we did insert, then we know that the value is completely new. We can
370
370
// just update the fresh_label, set canonical to false, and return.
@@ -375,7 +375,7 @@ void Partition::trackNewElement(Element newElt, bool updateHistory) {
375
375
pushNewElementRegion (newElt);
376
376
377
377
// Increment the fresh label so it remains fresh.
378
- fresh_label = Region (fresh_label + 1 );
378
+ freshLabel = Region (freshLabel + 1 );
379
379
canonical = false ;
380
380
return ;
381
381
}
@@ -391,7 +391,7 @@ void Partition::trackNewElement(Element newElt, bool updateHistory) {
391
391
// This is important to ensure that every region in the transferredOpMap is
392
392
// also in elementToRegionMap.
393
393
auto oldRegion = iter.first ->second ;
394
- iter.first ->second = fresh_label ;
394
+ iter.first ->second = freshLabel ;
395
395
396
396
auto getValueFromOtherRegion = [&]() -> std::optional<Element> {
397
397
for (auto pair : elementToRegionMap) {
@@ -414,7 +414,7 @@ void Partition::trackNewElement(Element newElt, bool updateHistory) {
414
414
pushNewElementRegion (newElt);
415
415
416
416
// Increment the fresh label so it remains fresh.
417
- fresh_label = Region (fresh_label + 1 );
417
+ freshLabel = Region (freshLabel + 1 );
418
418
canonical = false ;
419
419
}
420
420
@@ -558,8 +558,8 @@ Partition Partition::join(const Partition &fst, Partition &mutableSnd) {
558
558
result.pushMergeElementRegions (sndEltNumber, Element (sndRegionNumber));
559
559
// We want fresh_label to always be one element larger than our
560
560
// maximum element.
561
- if (result.fresh_label <= Region (sndEltNumber))
562
- result.fresh_label = Region (sndEltNumber + 1 );
561
+ if (result.freshLabel <= Region (sndEltNumber))
562
+ result.freshLabel = Region (sndEltNumber + 1 );
563
563
continue ;
564
564
}
565
565
}
@@ -580,8 +580,8 @@ Partition Partition::join(const Partition &fst, Partition &mutableSnd) {
580
580
fstIter.first ->getSecond () =
581
581
fstIter.first ->second ->merge (sndIter->second );
582
582
}
583
- if (result.fresh_label <= sndRegionNumber)
584
- result.fresh_label = Region (sndEltNumber + 1 );
583
+ if (result.freshLabel <= sndRegionNumber)
584
+ result.freshLabel = Region (sndEltNumber + 1 );
585
585
}
586
586
587
587
// We should have preserved canonicality during the computation above. It
@@ -769,7 +769,7 @@ bool Partition::is_canonical_correct() const {
769
769
770
770
for (auto &[eltNo, regionNo] : elementToRegionMap) {
771
771
// Labels should not exceed fresh_label.
772
- if (regionNo >= fresh_label )
772
+ if (regionNo >= freshLabel )
773
773
return fail (eltNo, 0 );
774
774
775
775
// The label of a region should be at most as large as each index in it.
@@ -857,7 +857,7 @@ void Partition::canonicalize() {
857
857
858
858
// The maximum index iterated over will be used here to appropriately
859
859
// set fresh_label.
860
- fresh_label = Region (eltNo + 1 );
860
+ freshLabel = Region (eltNo + 1 );
861
861
}
862
862
863
863
// Then relabel our regionToTransferredInst map if we need to by swapping
0 commit comments