Michael J Gruber [off-list ref] writes:
Implementation note:
We compute the number of parents only when we limit by that, so there
is no performance impact when there are no limiters.
Only about 16% of the commits in git.git (and 7% in the kernel) are two
parent merges and the rest are mostly single strand of pearls, so even the
cost of counting all the parents in a loop that does not exit early when
it reaches max-parents limit should be negligible, and checking against
max-parents in each iteration would probably costs even more.
So I think this is a good to go.
Thanks.