--- /dev/null	2019-06-04 22:44:10.544000000 +0000
+++ new/test/micro/org/openjdk/bench/java/util/TreeMapUpdate.java	2019-07-15 10:39:09.129001000 +0000
@@ -0,0 +1,149 @@
+/*
+ * Copyright (c) 2019, Oracle and/or its affiliates. All rights reserved.
+ * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
+ *
+ * This code is free software; you can redistribute it and/or modify it
+ * under the terms of the GNU General Public License version 2 only, as
+ * published by the Free Software Foundation.
+ *
+ * This code is distributed in the hope that it will be useful, but WITHOUT
+ * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
+ * FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
+ * version 2 for more details (a copy is included in the LICENSE file that
+ * accompanied this code).
+ *
+ * You should have received a copy of the GNU General Public License version
+ * 2 along with this work; if not, write to the Free Software Foundation,
+ * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
+ *
+ * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
+ * or visit www.oracle.com if you need additional information or have any
+ * questions.
+ */
+package org.openjdk.bench.java.util;
+
+import org.openjdk.jmh.annotations.Benchmark;
+import org.openjdk.jmh.annotations.BenchmarkMode;
+import org.openjdk.jmh.annotations.Fork;
+import org.openjdk.jmh.annotations.Measurement;
+import org.openjdk.jmh.annotations.Mode;
+import org.openjdk.jmh.annotations.OutputTimeUnit;
+import org.openjdk.jmh.annotations.Param;
+import org.openjdk.jmh.annotations.Scope;
+import org.openjdk.jmh.annotations.Setup;
+import org.openjdk.jmh.annotations.State;
+import org.openjdk.jmh.annotations.Warmup;
+import org.openjdk.jmh.infra.Blackhole;
+
+import java.util.Comparator;
+import java.util.Map;
+import java.util.TreeMap;
+import java.util.concurrent.TimeUnit;
+import java.util.function.Supplier;
+
+@BenchmarkMode(Mode.AverageTime)
+@OutputTimeUnit(TimeUnit.NANOSECONDS)
+@Warmup(iterations = 5, time = 500, timeUnit = TimeUnit.MILLISECONDS)
+@Measurement(iterations = 10, time = 500, timeUnit = TimeUnit.MILLISECONDS)
+@Fork(3)
+@State(Scope.Thread)
+public class TreeMapUpdate {
+    @Param({"10", "1000", "100000"})
+    public int size;
+
+    @Param({"true", "false"})
+    public boolean shuffled;
+
+    @Param({"true", "false"})
+    public boolean comparator;
+
+    private Supplier<Map<Integer, Integer>> supplier;
+
+    @Setup
+    public void setUp() {
+        supplier = comparator ? () -> new TreeMap<>(Comparator.reverseOrder()) : TreeMap::new;
+    }
+
+    private int nextKey(int prevKey) {
+        return shuffled ? prevKey + 1 : prevKey + 987_654_321;
+    }
+
+    @Benchmark
+    public Map<Integer, Integer> put(Blackhole bh) {
+        int s = size;
+        Map<Integer, Integer> map = supplier.get();
+        int key = 0;
+        for (int i = 0; i < s; i++) {
+            bh.consume(map.put(key, key));
+            bh.consume(map.put(key, key));
+            key = nextKey(key);
+        }
+        return map;
+    }
+
+    @Benchmark
+    public Map<Integer, Integer> putIfAbsent(Blackhole bh) {
+        int s = size;
+        Map<Integer, Integer> map = supplier.get();
+        int key = 0;
+        for (int i = 0; i < s; i++) {
+            bh.consume(map.putIfAbsent(key, key));
+            bh.consume(map.putIfAbsent(key, key));
+            key = nextKey(key);
+        }
+        return map;
+    }
+
+    @Benchmark
+    public Map<Integer, Integer> computeIfAbsent(Blackhole bh) {
+        int s = size;
+        Map<Integer, Integer> map = supplier.get();
+        int key = 0;
+        for (int i = 0; i < s; i++) {
+            bh.consume(map.computeIfAbsent(key, k -> k));
+            bh.consume(map.computeIfAbsent(key, k -> k));
+            key = nextKey(key);
+        }
+        return map;
+    }
+
+    @Benchmark
+    public Map<Integer, Integer> compute(Blackhole bh) {
+        int s = size;
+        Map<Integer, Integer> map = supplier.get();
+        int key = 0;
+        for (int i = 0; i < s; i++) {
+            bh.consume(map.compute(key, (k, old) -> k * 2));
+            bh.consume(map.compute(key, (k, old) -> k * 2));
+            key = nextKey(key);
+        }
+        return map;
+    }
+
+    @Benchmark
+    public Map<Integer, Integer> computeIfPresent(Blackhole bh) {
+        int s = size;
+        Map<Integer, Integer> map = supplier.get();
+        int key = 0;
+        for (int i = 0; i < s; i++) {
+            bh.consume(map.computeIfPresent(key, (k, old) -> old * 2));
+            map.put(key, key);
+            bh.consume(map.computeIfPresent(key, (k, old) -> old * 2));
+            key = nextKey(key);
+        }
+        return map;
+    }
+
+    @Benchmark
+    public Map<Integer, Integer> merge(Blackhole bh) {
+        int s = size;
+        Map<Integer, Integer> map = supplier.get();
+        int key = 0;
+        for (int i = 0; i < s; i++) {
+            bh.consume(map.merge(key, key, Integer::sum));
+            bh.consume(map.merge(key, key, Integer::sum));
+            key = nextKey(key);
+        }
+        return map;
+    }
+}