Based on the timings alone, it looks to be linear(ish) in the number of buffers and (um) log.quadratic in the number of records?

That sounds consistent with what the wikipedia article says about in place merge sorting: O(Nlog^2(N)), but with a "reference needed" note, so it might be empirical or folklore.