react-native-windows 0.81.34 → 0.81.37

package/external/folly/folly/docs/AtomicHashMap.md

@@ -0,0 +1,134 @@
+`folly/AtomicHashmap.h`
+----------------------
+
+`folly/AtomicHashmap.h` introduces a synchronized UnorderedAssociativeContainer
+implementation designed for extreme performance in heavily multithreaded
+environments (about 2-5x faster than tbb::concurrent_hash_map) and good memory
+usage properties.  Find and iteration are wait-free, insert has key-level lock
+granularity, there is minimal memory overhead, and permanent 32-bit ids can be
+used to reference each element.
+
+
+### Limitations
+***
+
+Although it can provide extreme performance, AtomicHashmap has some unique
+limitations as well.
+
+* The space for erased elements cannot be reclaimed (they are tombstoned
+forever) so it's generally not a good idea to use this if you're erasing things
+a lot.
+
+* Only supports 32 or 64 bit keys - this is because they must be atomically
+compare-and-swap'ed.
+
+* Growth beyond initialization reduces performance - if you don't know
+the approximate number of elements you'll be inserting into the map, you
+probably shouldn't use this class.
+
+* Must manage synchronization externally in order to modify values in the map
+after insertion.  Lock pools are a common way to do this, or you may
+consider using `folly::PackedSyncPtr<T>` as your `ValueT`.
+
+* Must define special reserved key values for empty, erased, and locked
+elements.
+
+For a complete list of limitations and departures from the
+UnorderedAssociativeContainer concept, see `folly/AtomicHashMap.h`
+
+
+### Unique Features
+***
+
+* `value_type` references remain valid as long as the map itself.  Note this is
+not true for most other probing hash maps which will move elements when
+rehashing, which is necessary for them to grow.  AtomicHashMap grows by chaining
+additional slabs, so elements never need to be moved.
+
+* Unique 32-bit ids can be used to reference elements in the map via
+`iterator::getIndex()`.  This can be helpful to save memory in the rest of the
+application by replacing 64-bit pointers or keys.
+
+* Iterators are never invalidated.  This means you can iterate through the map
+while simultaneously inserting and erasing.  This is particularly useful for
+non-blocking map serialization.
+
+
+### Usage
+***
+
+Usage is similar to most maps, although note the conspicuous lack of operator[]
+which encourages non thread-safe access patterns.
+
+Below is a synchronized key counter implementation that allows the counter
+values to be incremented in parallel with serializing all the values to a
+string.
+
+```Cpp
+   class Counters {
+    private:
+     AtomicHashMap<int64_t,int64_t> ahm;
+
+    public:
+     explicit Counters(size_t numCounters) : ahm(numCounters) {}
+
+     void increment(int64_t obj_id) {
+       auto ret = ahm.insert(make_pair(obj_id, 1));
+       if (!ret.second) {
+         // obj_id already exists, increment
+         NoBarrier_AtomicIncrement(&ret.first->second, 1);
+       }
+     }
+
+     int64_t getValue(int64_t obj_id) {
+       auto ret = ahm.find(obj_id);
+       return ret != ahm.end() ? ret->second : 0;
+     }
+
+     // Serialize the counters without blocking increments
+     string toString() {
+       string ret = "{\n";
+       ret.reserve(ahm.size() * 32);
+       for (const auto& e : ahm) {
+         ret += folly::to<string>(
+           "  [", e.first, ":", NoBarrier_Load(&e.second), "]\n");
+       }
+       ret += "}\n";
+       return ret;
+     }
+   };
+```
+
+### Implementation
+***
+
+AtomicHashMap is a composition of AtomicHashArray submaps, which implement the
+meat of the functionality.  Only one AHA is created on initialization, and
+additional submaps are appended if the first one gets full.  If the AHM grows,
+there will be multiple submaps that must be probed in series to find a given
+key.  The more growth, the more submaps will be chained, and the slower it will
+get.  If the initial size estimate is good, only one submap will ever be created
+and performance will be optimal.
+
+AtomicHashArray is a fixed-size probing hash map (also referred to as an open
+addressed hash map) where hash collisions are resolved by checking subsequent
+elements.  This means that they can be allocated in slabs as arrays of
+value_type elements, have excellent cache performance, and have no memory
+overhead from storing pointers.
+
+The algorithm is simple - when inserting, the key is hash-mod'ed to an offset,
+and that element-key is atomically compare-and-swap'ed with the locked key
+value.  If successful, the value is written and the element-key is unlocked by
+setting it to the input key value.  If the compare fails, the next element is
+tried until success or the map is full.
+
+Finds are even simpler.  The key is hash-mod'ed to an offset, and the
+element-key is examined.  If it is the same as the input key, the reference is
+returned, if it's the empty key, failure is returned, otherwise the next key is
+tried.  This can be done wait-free without any atomic instructions because the
+elements are always in a valid state.
+
+Erase is done by finding the key, then compare-and-swap'ing the element-key with
+the reserved erased key value.  If the swap succeeds, return success, otherwise
+return failure (the element was erased by a competing thread).  If the key does
+not exist, return failure.

package/external/folly/folly/docs/Benchmark.md

@@ -0,0 +1,310 @@
+`folly/Benchmark.h`
+-----------------
+
+`folly/Benchmark.h` provides a simple framework for writing and
+executing benchmarks. Currently the framework targets only
+single-threaded testing (though you can internally use fork-join
+parallelism and measure total run time).
+
+### Overview
+***
+
+Using `folly/Benchmark.h` is very simple. Here's an example:
+
+``` Cpp
+    #include <folly/Benchmark.h>
+    #include <vector>
+    using namespace std;
+    using namespace folly;
+    BENCHMARK(insertFrontVector) {
+      // Let's insert 100 elements at the front of a vector
+      vector<int> v;
+      for (unsigned int i = 0; i < 100; ++i) {
+        v.insert(v.begin(), i);
+      }
+    }
+    BENCHMARK(insertBackVector) {
+      // Let's insert 100 elements at the back of a vector
+      vector<int> v;
+      for (unsigned int i = 0; i < 100; ++i) {
+        v.insert(v.end(), i);
+      }
+    }
+    int main() {
+      runBenchmarks();
+    }
+```
+
+Compiling and running this code produces to the standard output:
+
+```
+    ===============================================================================
+    test.cpp                                              relative ns/iter  iters/s
+    ===============================================================================
+    insertFrontVector                                                3.84K  260.38K
+    insertBackVector                                                 1.61K  622.75K
+    ===============================================================================
+```
+
+Let's worry about the empty column "relative" later. The table
+contains, for each benchmark, the time spent per call and the converse
+number of calls per second. Numbers are represented in metric notation
+(K for thousands, M for millions etc). As expected, in this example
+the second function is much faster (fewer ns/iter and more iters/s).
+
+The macro `BENCHMARK` introduces a function and also adds it to an
+internal array containing all benchmarks in the system. The defined
+function takes no arguments and returns `void`.
+
+The framework calls the function many times to collect statistics
+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:
+
+``` Cpp
+    #include <folly/Benchmark.h>
+    #include <folly/container/Foreach.h>
+    #include <vector>
+    using namespace std;
+    using namespace folly;
+    BENCHMARK(insertFrontVector, n) {
+      vector<int> v;
+      for (unsigned int i = 0; i < n; ++i) {
+        v.insert(v.begin(), i);
+      }
+    }
+    BENCHMARK(insertBackVector, n) {
+      vector<int> v;
+      for (unsigned int i = 0; i < n; ++i) {
+        v.insert(v.end(), i);
+      }
+    }
+    int main() {
+      runBenchmarks();
+    }
+```
+
+The produced numbers are substantially different:
+
+```
+    ===============================================================================
+    Benchmark                                             relative ns/iter  iters/s
+    ===============================================================================
+    insertFrontVector                                               39.92    25.05M
+    insertBackVector                                                 3.46   288.89M
+    ===============================================================================
+```
+
+Now the numbers indicate the speed of one single insertion because the
+framework assumed the user-defined function used internal iteration
+(which it does). So inserting at the back of a vector is more than 10
+times faster than inserting at the front! Speaking of comparisons...
+
+### Baselines
+***
+
+Choosing one or more good baselines is a crucial activity in any
+measurement. Without a baseline there is little information to derive
+from the sheer numbers. If, for example, you do experimentation with
+algorithms, a good baseline is often an established approach (e.g. the
+built-in `std::sort` for sorting). Essentially all experimental
+numbers should be compared against some baseline.
+
+To support baseline-driven measurements, `folly/Benchmark.h` defines
+`BENCHMARK_RELATIVE`, which works much like `BENCHMARK`, except it
+considers the most recent lexically-occurring `BENCHMARK` a baseline,
+and fills the "relative" column. Say, for example, we want to use
+front insertion for a vector as a baseline and see how back insertion
+compares with it:
+
+``` Cpp
+    #include <folly/Benchmark.h>
+    #include <folly/container/Foreach.h>
+    #include <vector>
+    using namespace std;
+    using namespace folly;
+    BENCHMARK(insertFrontVector, n) {
+      vector<int> v;
+      for (unsigned int i = 0; i < n; ++i) {
+        v.insert(v.begin(), i);
+      }
+    }
+    BENCHMARK_RELATIVE(insertBackVector, n) {
+      vector<int> v;
+      for (unsigned int i = 0; i < n; ++i) {
+        v.insert(v.end(), i);
+      }
+    }
+    int main() {
+      runBenchmarks();
+    }
+```
+
+This program prints something like:
+
+```
+    ===============================================================================
+    Benchmark                                             relative ns/iter  iters/s
+    ===============================================================================
+    insertFrontVector                                               42.65    23.45M
+    insertBackVector                                     1208.24%    3.53   283.30M
+    ===============================================================================
+```
+
+showing the 1208.24% relative speed advantage of inserting at the back
+compared to front. The scale is chosen in such a way that 100% means
+identical speed, numbers smaller than 100% indicate the benchmark is
+slower than the baseline, and numbers greater than 100% indicate the
+benchmark is faster. For example, if you see 42% that means the speed
+of the benchmark is 0.42 of the baseline speed. If you see 123%, it
+means the benchmark is 23% or 1.23 times faster.
+
+To close the current benchmark group and start another, simply use
+`BENCHMARK` again.
+
+### Ars Gratia Artis
+***
+
+If you want to draw a horizontal line of dashes (e.g. at the end of a
+group or for whatever reason), use `BENCHMARK_DRAW_LINE()`. The line
+fulfills a purely aesthetic role; it doesn't interact with
+measurements in any way.
+
+``` Cpp
+    BENCHMARK(foo) {
+      Foo foo;
+      foo.doSomething();
+    }
+
+    BENCHMARK_DRAW_LINE();
+
+    BENCHMARK(bar) {
+      Bar bar;
+      bar.doSomething();
+    }
+```
+
+If you want to print arbitrary text (e.g. a comment or for whatever
+reason), use `BENCHMARK_DRAW_TEXT("your text here")`. The output will
+be the literal value so escape codes like `\n` or `\t` will not work.
+To add multiple lines of output use multiple `BENCHMARK_DRAW_TEXT`
+calls.
+
+``` Cpp
+    BENCHMARK(foo) {
+      Foo foo;
+      foo.doSomething();
+    }
+
+    BENCHMARK_DRAW_TEXT("Note: bar is expected to be 2x more expensive.");
+
+    BENCHMARK(bar) {
+      Bar bar;
+      bar.doSomething();
+    }
+```
+
+### Suspending a benchmark
+***
+
+Sometimes benchmarking code must do some preparation work that is
+physically inside the benchmark function, but should not take part to
+its time budget. To temporarily suspend the benchmark, use the
+pseudo-statement `BENCHMARK_SUSPEND` as follows:
+
+``` Cpp
+    BENCHMARK(insertBackVector, n) {
+      vector<int> v;
+      BENCHMARK_SUSPEND {
+        v.reserve(n);
+      }
+      for (unsigned int i = 0; i < n; ++i) {
+        v.insert(v.end(), i);
+      }
+    }
+```
+
+The preallocation effected with `v.reserve(n)` will not count toward
+the total run time of the benchmark.
+
+Only the main thread should call `BENCHMARK_SUSPEND` (and of course it
+should not call it while other threads are doing actual work). This is
+because the timer is application-global.
+
+If the scope introduced by `BENCHMARK_SUSPEND` is not desired, you may
+want to "manually" use the `BenchmarkSuspender` type. Constructing
+such an object suspends time measurement, and destroying it resumes
+the measurement. If you want to resume time measurement before the
+destructor, call `dismiss` against the `BenchmarkSuspender`
+object. The previous example could have been written like this:
+
+``` Cpp
+    BENCHMARK(insertBackVector, n) {
+      BenchmarkSuspender braces;
+      vector<int> v;
+      v.reserve(n);
+      braces.dismiss();
+      for (unsigned int i = 0; i < n; ++i) {
+        v.insert(v.end(), i);
+      }
+    }
+```
+
+### `doNotOptimizeAway`
+***
+
+Finally, the small utility function `doNotOptimizeAway` prevents
+compiler optimizations that may interfere with benchmarking . Call
+doNotOptimizeAway(var) against variables that you use for
+benchmarking but otherwise are useless. The compiler tends to do a
+good job at eliminating unused variables, and this function fools it
+into thinking a variable is in fact needed. Example:
+
+``` Cpp
+    BENCHMARK(fpOps, n) {
+      double d = 1;
+      FOR_EACH_RANGE (i, 1, n) {
+        d += i;
+        d -= i;
+        d *= i;
+        d /= i;
+      }
+      doNotOptimizeAway(d);
+    }
+```
+
+### A look under the hood
+***
+
+`folly/Benchmark.h` has a simple, systematic approach to collecting
+timings.
+
+First, it organizes measurements in several large epochs, and takes
+the minimum over all epochs. Taking the minimum gives the closest
+result to the real runtime. Benchmark timings are not a regular random
+variable that fluctuates around an average. Instead, the real time
+we're looking for is one to which there's a variety of additive noise
+(i.e. there is no noise that could actually shorten the benchmark time
+below its real value). In theory, taking an infinite amount of samples
+and keeping the minimum is the actual time that needs
+measuring. That's why the accuracy of benchmarking increases with the
+number of epochs.
+
+Clearly, in real functioning there will also be noise and a variety of
+effects caused by the running context. But the noise during the
+benchmark (straight setup, simple looping) is a poor model for the
+noise in the real application. So taking the minimum across several
+epochs is the most informative result.
+
+Inside each epoch, the function measured is iterated an increasing
+number of times until the total runtime is large enough to make noise
+negligible. At that point the time is collected, and the time per
+iteration is computed. As mentioned, the minimum time per iteration
+over all epochs is the final result.
+
+The timer function used is `clock_gettime` with the `CLOCK_REALTIME`
+clock id. Note that you must use a recent Linux kernel (2.6.38 or
+newer), otherwise the resolution of `CLOCK_REALTIME` is inadequate.