[erlang-questions] overhead of lists:dropwhile/2

[Tuncer Ayaz]

While reviewing BjornG's compiler optimization in master, I've
noticed one pattern of optimization which at least to me isn't
as evident.

I've reviewed the implementation of lists:dropwhile/2, and the
only difference I can see is that a call to the predicate fun is
avoided. Is that the - now removed - speed bump, or am I missing
something? If so, does it have to be a speed bump?

https://github.com/erlang/otp/commit/8470558
https://github.com/erlang/otp/commit/93ad33d
https://github.com/erlang/otp/commit/08708c8