explains how folly benchmark decides how many iterations to run and h…

…ow to tune it (#2348)

Summary:

I spent some time to figure this out and it should be beneficial to mention that in the doc

Differential Revision: D66708725

folly/docs/Benchmark.md

@@ -61,8 +61,11 @@ about it. Sometimes the function itself would want to do that
 iteration---for example how about inserting `n` elements instead of
 100 elements? To do the iteration internally, use `BENCHMARK` with two
 parameters. The second parameter is the number of iterations and is
-passed by the framework down to the function. The type of the count is
-implicitly `unsigned`. Consider a slightly reworked example:
+passed by the framework down to the function (folly benchmark runs as many as
+iterations until the time spent exceeds 0.1ms ([code pointer](https://github.com/facebook/folly/blob/main/folly/Benchmark.cpp#L196)).
+To increase iterations, especially for high-latency methods, adjust the `bm_min_usec` flag ([code pointer](https://github.com/facebook/folly/blob/main/folly/Benchmark.cpp#L179))
+and `bm_max_secs` flag([code pointer](https://github.com/facebook/folly/blob/main/folly/Benchmark.cpp#L106))) to allow higher time budget).
+The type of the count is implicitly `unsigned`. Consider a slightly reworked example:
 
 ``` Cpp
     #include <folly/Benchmark.h>