When a node splits that contains key-level locks, the key-level locks must be updated for the old node and the new node. This affects the abort node list. There was a loop that repeatedly attempted to update the abort node list, once for each key-level lock in the node. However, this can be accomplished in a single call. This reduces the contention on the mutex that controls the abort node list. This keyword reverts to the previous approach for testing.
Note: This is intended for internal FairCom testing only.