treeMap = new TreeMap<>();
26 |
27 | Random random = new Random();
28 | for (int i = 0; i < numThreads*numUpdatesPerThread; i++) {
29 | pool.submit( () -> {
30 | treeMap.put(random.nextInt(10000), random.nextInt(10000));
31 | });
32 | }
33 |
34 | pool.shutdown();
35 | pool.awaitTermination(1, TimeUnit.DAYS);
36 | }
37 |
38 | }
39 |
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/ExploringTreeMap.java:
--------------------------------------------------------------------------------
1 | import java.lang.reflect.Field;
2 | import java.util.Arrays;
3 | import java.util.TreeMap;
4 |
5 | public class ExploringTreeMap {
6 |
7 | /**
8 | * In order to run you need to add these JVM args:
9 | *
10 | * --add-opens java.base/java.util=ALL-UNNAMED
11 | *
12 | * @param args
13 | */
14 | public static void main(String[] args) throws Exception {
15 |
16 | TreeMap treeMap = new TreeMap<>();
17 | for (int i = 0; i < 10; i++) {
18 | treeMap.put(i, i);
19 | }
20 |
21 | TreeMapExplorer treeMapExplorer = new TreeMapExplorer(treeMap);
22 | treeMapExplorer.print();
23 | }
24 |
25 |
26 | }
27 |
28 |
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/GrpcRepro.java:
--------------------------------------------------------------------------------
1 | import java.util.ArrayList;
2 | import java.util.List;
3 | import java.util.Random;
4 | import java.util.TreeMap;
5 | import java.util.concurrent.TimeUnit;
6 |
7 | import com.google.common.util.concurrent.ListenableFuture;
8 | import io.grpc.ManagedChannel;
9 | import io.grpc.ManagedChannelBuilder;
10 | import io.grpc.Server;
11 | import io.grpc.ServerBuilder;
12 | import io.grpc.stub.StreamObserver;
13 |
14 | /**
15 | * Reproduces the corrupted TreeMap issues through Grpc rather than directly through threads.
16 | *
17 | * Demonstrates that the simplified 2 thread reproduce code isn't that unrealistic. Exceptionsm
18 | * get accidentally swallowed all the time especially if there are RuntimeExceptions like NPEs.
19 | */
20 | public class GrpcRepro {
21 | public static void main(String[] args) throws Exception {
22 | final Server server = ServerBuilder.forPort(0)
23 | .addService(new ReceiptProcessorServiceImpl())
24 | .build()
25 | .start();
26 | Runtime.getRuntime().addShutdownHook(new Thread(() -> {
27 | server.shutdownNow();
28 | }));
29 |
30 | final int port = server.getPort();
31 | System.out.println("Server started, listening on " + port);
32 |
33 | final ManagedChannel channel = ManagedChannelBuilder.forAddress("localhost", port)
34 | .usePlaintext()
35 | .build();
36 | final ReceiptProcessorServiceGrpc.ReceiptProcessorServiceFutureStub futureStub = ReceiptProcessorServiceGrpc.newFutureStub(channel);
37 |
38 | List> futures = new ArrayList<>();
39 | Random random = new Random();
40 | for (int i = 0; i < 100_000; i++) {
41 | ReceiptProcessorServiceOuterClass.AddReceiptRequest request = ReceiptProcessorServiceOuterClass.AddReceiptRequest.newBuilder()
42 | .setTimestamp(random.nextInt(10_000))
43 | .setTotalPrice(random.nextInt(10_000))
44 | .build();
45 | futures.add(futureStub.addReceipt(request));
46 | }
47 |
48 | for (ListenableFuture future : futures) {
49 | future.get();
50 | }
51 |
52 | server.shutdown();
53 | server.awaitTermination(1, TimeUnit.DAYS);
54 | }
55 | }
56 |
57 | class ReceiptProcessorServiceImpl extends ReceiptProcessorServiceGrpc.ReceiptProcessorServiceImplBase {
58 | private final TreeMap receipts = new TreeMap<>();
59 |
60 | @Override
61 | public void addReceipt(
62 | ReceiptProcessorServiceOuterClass.AddReceiptRequest req,
63 | StreamObserver responseObserver
64 | ) {
65 | int timestamp = req.getTimestamp();
66 | int totalPrice = req.getTotalPrice();
67 | receipts.put(timestamp, totalPrice);
68 | ReceiptProcessorServiceOuterClass.AddReceiptResponse response = ReceiptProcessorServiceOuterClass.AddReceiptResponse.newBuilder().build();
69 | responseObserver.onNext(response);
70 | responseObserver.onCompleted();
71 | }
72 | }
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/GrpcThrowNPE.java:
--------------------------------------------------------------------------------
1 | import java.util.ArrayList;
2 | import java.util.List;
3 | import java.util.Random;
4 | import java.util.TreeMap;
5 | import java.util.concurrent.TimeUnit;
6 |
7 | import com.google.common.util.concurrent.ListenableFuture;
8 | import io.grpc.ManagedChannel;
9 | import io.grpc.ManagedChannelBuilder;
10 | import io.grpc.Server;
11 | import io.grpc.ServerBuilder;
12 | import io.grpc.stub.StreamObserver;
13 |
14 | public class GrpcThrowNPE {
15 | public static void main(String[] args) throws Exception {
16 | final Server server = ServerBuilder.forPort(0)
17 | .addService(new ReceiptProcessorThrowNPEImpl())
18 | .build()
19 | .start();
20 | Runtime.getRuntime().addShutdownHook(new Thread(() -> {
21 | server.shutdownNow();
22 | }));
23 |
24 | final int port = server.getPort();
25 | System.out.println("Server started, listening on " + port);
26 |
27 | final ManagedChannel channel = ManagedChannelBuilder.forAddress("localhost", port)
28 | .usePlaintext()
29 | .build();
30 | final ReceiptProcessorServiceGrpc.ReceiptProcessorServiceFutureStub futureStub = ReceiptProcessorServiceGrpc.newFutureStub(channel);
31 |
32 | List> futures = new ArrayList<>();
33 | Random random = new Random();
34 | for (int i = 0; i < 100; i++) {
35 | ReceiptProcessorServiceOuterClass.AddReceiptRequest request = ReceiptProcessorServiceOuterClass.AddReceiptRequest.newBuilder()
36 | .setTimestamp(random.nextInt(10_000))
37 | .setTotalPrice(random.nextInt(10_000))
38 | .build();
39 | futures.add(futureStub.addReceipt(request));
40 | }
41 |
42 | for (ListenableFuture future : futures) {
43 | future.get();
44 | }
45 |
46 | server.shutdown();
47 | server.awaitTermination(1, TimeUnit.DAYS);
48 | }
49 | }
50 |
51 | class ReceiptProcessorThrowNPEImpl extends ReceiptProcessorServiceGrpc.ReceiptProcessorServiceImplBase {
52 | @Override
53 | public void addReceipt(
54 | ReceiptProcessorServiceOuterClass.AddReceiptRequest req,
55 | StreamObserver responseObserver
56 | ) {
57 | throw new NullPointerException();
58 | }
59 | }
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/ProtectedSimpleRepro.java:
--------------------------------------------------------------------------------
1 | import java.util.*;
2 |
3 | public class ProtectedSimpleRepro {
4 |
5 | public static void main(String[] args) throws Exception {
6 |
7 | final int numThreads;
8 | if (args.length >= 1) {
9 | numThreads = Integer.parseInt(args[0]);
10 | } else {
11 | numThreads = 5;
12 | }
13 |
14 | final int numUpdates;
15 | if (args.length >= 2) {
16 | numUpdates = Integer.parseInt(args[1]);
17 | } else {
18 | numUpdates = 1000;
19 | }
20 |
21 | final ProtectedTreeMap treeMap = new ProtectedTreeMap<>();
22 |
23 | List threads = new ArrayList<>();
24 | for (int i = 0; i < numThreads; i++) {
25 | threads.add(new Thread(() -> {
26 | Random random = new Random();
27 | for(int j = 0; j < numUpdates; j++) {
28 | try {
29 | treeMap.put(random.nextInt(1000), random.nextInt(1000));
30 | } catch (NullPointerException e) {
31 | // let it keep going so we can reproduce the issue.
32 | }
33 | }
34 | }));
35 | }
36 |
37 | for (Thread thread : threads) {
38 | thread.start();
39 | }
40 |
41 | for (Thread thread : threads) {
42 | thread.join();
43 | }
44 |
45 | }
46 |
47 | }
48 |
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/ReproDetectDump.java:
--------------------------------------------------------------------------------
1 | import java.lang.reflect.Field;
2 | import java.util.ArrayList;
3 | import java.util.Arrays;
4 | import java.util.HashSet;
5 | import java.util.IdentityHashMap;
6 | import java.util.List;
7 | import java.util.Random;
8 | import java.util.Set;
9 | import java.util.TreeMap;
10 |
11 | /**
12 | * In order to run on jdk11+ you need to add these JVM args:
13 | *
14 | * --add-opens java.base/java.util=ALL-UNNAMED
15 | *
16 | *
17 | * Need to run many experiments in order to reproduce the issue with so few entries.
18 | */
19 | public class ReproDetectDump {
20 |
21 |
22 | public static void main(String[] args) throws Exception {
23 |
24 | final int numThreads;
25 | if (args.length >= 1) {
26 | numThreads = Integer.parseInt(args[0]);
27 | } else {
28 | numThreads = 3;
29 | }
30 |
31 | final int numUpdates;
32 | if (args.length >= 2) {
33 | numUpdates = Integer.parseInt(args[1]);
34 | } else {
35 | numUpdates = 4;
36 | }
37 |
38 | final int maxVal;
39 | if (args.length >= 3) {
40 | maxVal = Integer.parseInt(args[2]);
41 | } else {
42 | maxVal = 30;
43 | }
44 |
45 | final int numExperiments;
46 | if (args.length >= 4) {
47 | numExperiments = Integer.parseInt(args[3]);
48 | } else {
49 | numExperiments = 1000;
50 | }
51 |
52 | for (int experiment = 1; experiment <= numExperiments; experiment++) {
53 | final TreeMap treeMap = new TreeMap<>();
54 |
55 |
56 | List threads = new ArrayList<>();
57 | for (int i = 0; i < numThreads; i++) {
58 | threads.add(new Thread(() -> {
59 | Random random = new Random();
60 | for (int j = 0; j < numUpdates; j++) {
61 | try {
62 | treeMap.put(random.nextInt(maxVal), random.nextInt(1000));
63 | } catch (NullPointerException e) {
64 | // let it keep going so we can reproduce the issue.
65 | }
66 | }
67 | }));
68 | }
69 |
70 | DetectorThread detectorThread = new DetectorThread(treeMap, threads);
71 |
72 | for (Thread thread : threads) {
73 | thread.start();
74 | }
75 | detectorThread.start();
76 |
77 | for (Thread thread : threads) {
78 | thread.join();
79 | }
80 |
81 | detectorThread.interrupt();
82 | }
83 | }
84 |
85 | }
86 |
87 | class DetectorThread extends Thread {
88 | private final TreeMap treeMap;
89 | private final List threadsToStop;
90 | private static final Field treeMapRootField;
91 | private static final Field treeMapEntryLeft;
92 | private static final Field treeMapEntryRight;
93 | private static final Field treeMapEntryKey;
94 |
95 | static {
96 | try {
97 | treeMapRootField = TreeMap.class.getDeclaredField("root");
98 | treeMapRootField.setAccessible(true);
99 |
100 | Class treeMapEntryClass = Arrays.stream(TreeMap.class.getDeclaredClasses())
101 | .filter(clazz -> "java.util.TreeMap$Entry".equals(clazz.getName()))
102 | .findAny()
103 | .get();
104 |
105 | treeMapEntryLeft = treeMapEntryClass.getDeclaredField("left");
106 | treeMapEntryLeft.setAccessible(true);
107 | treeMapEntryRight = treeMapEntryClass.getDeclaredField("right");
108 | treeMapEntryRight.setAccessible(true);
109 | treeMapEntryKey = treeMapEntryClass.getDeclaredField("key");
110 | treeMapEntryKey.setAccessible(true);
111 |
112 | } catch (NoSuchFieldException e) {
113 | throw new RuntimeException(e);
114 | }
115 | }
116 |
117 | public DetectorThread(
118 | TreeMap treeMap,
119 | List threadsToStop
120 | ) {
121 | this.treeMap = treeMap;
122 | this.threadsToStop = threadsToStop;
123 | }
124 |
125 | private boolean isLoopDetected() throws Exception {
126 | return isLoopDetected(treeMapRootField.get(treeMap), new IdentityHashMap<>());
127 | }
128 |
129 | /**
130 | * DFS to detect loop
131 | */
132 | private boolean isLoopDetected(Object treeMapEntry, IdentityHashMap visited) throws Exception {
133 | if (treeMapEntry == null) {
134 | return false;
135 | }
136 |
137 | if (visited.containsKey(treeMapEntry)) {
138 | return true;
139 | }
140 |
141 | visited.put(treeMapEntry, treeMapEntry);
142 |
143 |
144 | Object left = treeMapEntryLeft.get(treeMapEntry);
145 | Object right = treeMapEntryRight.get(treeMapEntry);
146 | return isLoopDetected(left, visited)
147 | || isLoopDetected(right, visited);
148 | }
149 |
150 | @Override
151 | public void run() {
152 | try {
153 | while (!isLoopDetected()) {
154 | if (this.isInterrupted()) {
155 | return;
156 | }
157 | }
158 | System.out.println("Loop detected");
159 | new TreeMapExplorer(treeMap).print();
160 | for (Thread thread : threadsToStop) {
161 | thread.stop();
162 | }
163 | } catch (Exception e) {
164 | e.printStackTrace();
165 | }
166 | }
167 | }
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/SimpleRepro.java:
--------------------------------------------------------------------------------
1 | import java.util.*;
2 |
3 | public class SimpleRepro {
4 |
5 | public static void main(String[] args) throws Exception {
6 |
7 | final int numThreads;
8 | if (args.length >= 1) {
9 | numThreads = Integer.parseInt(args[0]);
10 | } else {
11 | numThreads = 5;
12 | }
13 |
14 | final int numUpdates;
15 | if (args.length >= 2) {
16 | numUpdates = Integer.parseInt(args[1]);
17 | } else {
18 | numUpdates = 1000;
19 | }
20 |
21 | final TreeMap treeMap = new TreeMap<>();
22 |
23 | List threads = new ArrayList<>();
24 | for (int i = 0; i < numThreads; i++) {
25 | threads.add(new Thread(() -> {
26 | Random random = new Random();
27 | for(int j = 0; j < numUpdates; j++) {
28 | try {
29 | treeMap.put(random.nextInt(1000), random.nextInt(1000));
30 | } catch (NullPointerException e) {
31 | // let it keep going so we can reproduce the issue.
32 | }
33 | }
34 | }));
35 | }
36 |
37 | for (Thread thread : threads) {
38 | thread.start();
39 | }
40 |
41 | for (Thread thread : threads) {
42 | thread.join();
43 | }
44 |
45 | }
46 |
47 | }
48 |
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/java/TreeMapExplorer.java:
--------------------------------------------------------------------------------
1 | import java.lang.reflect.Field;
2 | import java.util.Arrays;
3 | import java.util.IdentityHashMap;
4 | import java.util.TreeMap;
5 |
6 | class TreeMapExplorer {
7 | private final TreeMap treeMap;
8 | private static final Field treeMapRootField;
9 | private static final Field treeMapEntryLeft;
10 | private static final Field treeMapEntryRight;
11 | private static final Field treeMapEntryKey;
12 | private static final Field treeMapEntryColor;
13 |
14 | static {
15 | try {
16 | treeMapRootField = TreeMap.class.getDeclaredField("root");
17 | treeMapRootField.setAccessible(true);
18 |
19 | Class treeMapEntryClass = Arrays.stream(TreeMap.class.getDeclaredClasses())
20 | .filter(clazz -> "java.util.TreeMap$Entry".equals(clazz.getName()))
21 | .findAny()
22 | .get();
23 |
24 | treeMapEntryLeft = treeMapEntryClass.getDeclaredField("left");
25 | treeMapEntryLeft.setAccessible(true);
26 | treeMapEntryRight = treeMapEntryClass.getDeclaredField("right");
27 | treeMapEntryRight.setAccessible(true);
28 | treeMapEntryKey = treeMapEntryClass.getDeclaredField("key");
29 | treeMapEntryKey.setAccessible(true);
30 | treeMapEntryColor = treeMapEntryClass.getDeclaredField("color");
31 | treeMapEntryColor.setAccessible(true);
32 |
33 | } catch (NoSuchFieldException e) {
34 | throw new RuntimeException(e);
35 | }
36 | }
37 |
38 | public TreeMapExplorer(TreeMap treeMap) {
39 | this.treeMap = treeMap;
40 | }
41 |
42 | public void print() throws Exception {
43 | print(treeMapRootField.get(treeMap), "", new IdentityHashMap<>());
44 | }
45 |
46 | private void print(
47 | Object treeMapEntry, String tabs, IdentityHashMap visited
48 | ) throws Exception {
49 | if (treeMapEntry != null && !visited.containsKey(treeMapEntry)) {
50 | // in order traversal
51 | visited.put(treeMapEntry, treeMapEntry);
52 | print(treeMapEntryLeft.get(treeMapEntry), tabs + " ", visited);
53 | System.out.println(tabs + treeMapEntryKey.get(treeMapEntry) + ":"
54 | + (treeMapEntryColor.getBoolean(treeMapEntry) ? "BLACK" : "RED"));
55 | print(treeMapEntryRight.get(treeMapEntry), tabs + " ", visited);
56 | } else if (treeMapEntry != null && visited.containsKey(treeMapEntry)) {
57 | System.out.println(tabs + treeMapEntryKey.get(treeMapEntry) + ":"
58 | + (treeMapEntryColor.getBoolean(treeMapEntry) ? "BLACK" : "RED")
59 | + " CYCLE"
60 | );
61 | }
62 | }
63 | }
64 |
--------------------------------------------------------------------------------
/tree_map_corruption/java/src/main/protobuf/ReceiptProcessorService.proto:
--------------------------------------------------------------------------------
1 | syntax = "proto3";
2 |
3 | message AddReceiptRequest {
4 | int32 timestamp = 1;
5 | int32 totalPrice = 2;
6 | }
7 |
8 | message AddReceiptResponse {
9 | }
10 |
11 | service ReceiptProcessorService {
12 | rpc AddReceipt(AddReceiptRequest) returns (AddReceiptResponse);
13 | }
--------------------------------------------------------------------------------
/tree_map_corruption/ruby/README.md:
--------------------------------------------------------------------------------
1 |
2 | # Results
3 |
4 | Even after trying all the following, I still wasn't able to reproduce the issue:
5 | 1. adding barrier
6 | 2. flushing output to stdout
7 | 3. increasing the amount of work per thread to 1,000,000
8 | 4. increasing the number of threads to 10
9 |
10 | I believe it might not be able to reproduce the problem due to the Global Interpreter Lock (GIL),
11 | and how it limits when threads can switch preventing such an interleaving of threads that cause an infinite loop.
12 |
13 | ```
14 | ruby % ruby simple_repo.rb
15 | 1: waiting for other threads to start
16 | 2: waiting for other threads to start
17 | 3: waiting for other threads to start
18 | 4: waiting for other threads to start
19 | 5: waiting for other threads to start
20 | 6: waiting for other threads to start
21 | 7: waiting for other threads to start
22 | 8: waiting for other threads to start
23 | 9: waiting for other threads to start
24 | 10: waiting for other threads to start
25 | 10: started
26 | 1: started
27 | 2: started
28 | 3: started
29 | 4: started
30 | 5: started
31 | 6: started
32 | 7: started
33 | 8: started
34 | 9: started
35 | 1: finished
36 | 10: finished
37 | 2: finished
38 | 3: finished
39 | 4: finished
40 | 5: finished
41 | 7: finished
42 | 6: finished
43 | 8: finished
44 | 9: finished
45 | Done
46 |
47 | ```
48 |
49 | # Running
50 |
51 | ## Using macports
52 |
53 | ```
54 | sudo port install ruby
55 | sudo port install ruby34
56 | sudo port select --set ruby ruby34
57 | ruby --version
58 | ruby 2.6.10p210 (2022-04-12 revision 67958) [universal.x86_64-darwin20]
59 | # reopen terminal
60 | ruby --version
61 | ruby 3.4.1 (2024-12-25 revision 48d4efcb85) +PRISM [x86_64-darwin20]
62 |
63 |
64 | sudo gem install kanwei-algorithms
65 | sudo gem install concurrent-ruby
66 | ```
67 |
68 | ## Using Mac's ruby doesn't work:
69 | ```
70 | sudo gem install kanwei-algorithms
71 |
72 |
73 | Fetching kanwei-algorithms-0.2.0.gem
74 | Building native extensions. This could take a while...
75 | ERROR: Error installing kanwei-algorithms:
76 | ERROR: Failed to build gem native extension.
77 |
78 | current directory:
79 | /Library/Ruby/Gems/2.6.0/gems/kanwei-algorithms-0.2.0/ext/containers/deque
80 | /System/Library/Frameworks/Ruby.framework/Versions/2.6/usr/bin/ruby -I
81 | /System/Library/Frameworks/Ruby.framework/Versions/2.6/usr/lib/ruby/2.6.0 -r
82 | ./siteconf20250202-72756-eu9zss.rb extconf.rb
83 | creating Makefile
84 |
85 | current directory:
86 | /Library/Ruby/Gems/2.6.0/gems/kanwei-algorithms-0.2.0/ext/containers/deque
87 | make "DESTDIR=" clean
88 |
89 | current directory:
90 | /Library/Ruby/Gems/2.6.0/gems/kanwei-algorithms-0.2.0/ext/containers/deque
91 | make "DESTDIR="
92 | make: *** No rule to make target
93 | `/Library/Developer/CommandLineTools/SDKs/MacOSX.sdk/System/Library/Frameworks/Ruby.framework/Versions/2.6/usr/include/ruby-2.6.0/universal-darwin20/ruby/config.h',
94 | needed by `deque.o'. Stop.
95 |
96 | make failed, exit code 2
97 |
98 | Gem files will remain installed in
99 | /Library/Ruby/Gems/2.6.0/gems/kanwei-algorithms-0.2.0 for inspection.
100 | Results logged to
101 | /Library/Ruby/Gems/2.6.0/extensions/universal-darwin-20/2.6.0/kanwei-algorithms-0.2.0/gem_make.out
102 |
103 | ```
104 |
105 | >
106 | https://github.com/github-linguist/linguist/issues/5147
107 |
108 |
--------------------------------------------------------------------------------
/tree_map_corruption/ruby/simple_repo.rb:
--------------------------------------------------------------------------------
1 | require 'algorithms'
2 | require 'concurrent'
3 | require 'thread'
4 |
5 | include Containers
6 |
7 | num_threads = (ARGV[0] || 10).to_i
8 | num_updates = (ARGV[1] || 10000000).to_i
9 | barrier = Concurrent::CyclicBarrier.new(num_threads)
10 |
11 | tree_map = RBTreeMap.new
12 |
13 | threads = []
14 |
15 | for thread_id in 1..num_threads
16 | thread = Thread.new(thread_id) do |my_thread_id|
17 | puts "#{my_thread_id}: waiting for other threads to start"
18 | $stdout.flush
19 | barrier.wait
20 | puts "#{my_thread_id}: started"
21 | $stdout.flush
22 | random = Random.new
23 | for update_num in 1..num_updates do
24 | begin
25 | tree_map[random.rand(1000)] = random.rand(1000)
26 | rescue => e
27 | puts "Exception: #{e.message}"
28 | $stdout.flush
29 | end
30 | end
31 | puts "#{my_thread_id}: finished"
32 | $stdout.flush
33 | end
34 | threads.push(thread)
35 | end
36 |
37 | for thread in threads do
38 | thread.join
39 | end
40 |
41 | puts "Done"
42 |
--------------------------------------------------------------------------------
/tree_map_corruption/rust/.gitignore:
--------------------------------------------------------------------------------
1 | /target/
2 |
--------------------------------------------------------------------------------
/tree_map_corruption/rust/Cargo.lock:
--------------------------------------------------------------------------------
1 | # This file is automatically @generated by Cargo.
2 | # It is not intended for manual editing.
3 | version = 4
4 |
5 | [[package]]
6 | name = "byteorder"
7 | version = "1.5.0"
8 | source = "registry+https://github.com/rust-lang/crates.io-index"
9 | checksum = "1fd0f2584146f6f2ef48085050886acf353beff7305ebd1ae69500e27c67f64b"
10 |
11 | [[package]]
12 | name = "cfg-if"
13 | version = "1.0.0"
14 | source = "registry+https://github.com/rust-lang/crates.io-index"
15 | checksum = "baf1de4339761588bc0619e3cbc0120ee582ebb74b53b4efbf79117bd2da40fd"
16 |
17 | [[package]]
18 | name = "getrandom"
19 | version = "0.2.15"
20 | source = "registry+https://github.com/rust-lang/crates.io-index"
21 | checksum = "c4567c8db10ae91089c99af84c68c38da3ec2f087c3f82960bcdbf3656b6f4d7"
22 | dependencies = [
23 | "cfg-if",
24 | "libc",
25 | "wasi",
26 | ]
27 |
28 | [[package]]
29 | name = "libc"
30 | version = "0.2.169"
31 | source = "registry+https://github.com/rust-lang/crates.io-index"
32 | checksum = "b5aba8db14291edd000dfcc4d620c7ebfb122c613afb886ca8803fa4e128a20a"
33 |
34 | [[package]]
35 | name = "ppv-lite86"
36 | version = "0.2.20"
37 | source = "registry+https://github.com/rust-lang/crates.io-index"
38 | checksum = "77957b295656769bb8ad2b6a6b09d897d94f05c41b069aede1fcdaa675eaea04"
39 | dependencies = [
40 | "zerocopy",
41 | ]
42 |
43 | [[package]]
44 | name = "proc-macro2"
45 | version = "1.0.93"
46 | source = "registry+https://github.com/rust-lang/crates.io-index"
47 | checksum = "60946a68e5f9d28b0dc1c21bb8a97ee7d018a8b322fa57838ba31cc878e22d99"
48 | dependencies = [
49 | "unicode-ident",
50 | ]
51 |
52 | [[package]]
53 | name = "quote"
54 | version = "1.0.38"
55 | source = "registry+https://github.com/rust-lang/crates.io-index"
56 | checksum = "0e4dccaaaf89514f546c693ddc140f729f958c247918a13380cccc6078391acc"
57 | dependencies = [
58 | "proc-macro2",
59 | ]
60 |
61 | [[package]]
62 | name = "rand"
63 | version = "0.8.5"
64 | source = "registry+https://github.com/rust-lang/crates.io-index"
65 | checksum = "34af8d1a0e25924bc5b7c43c079c942339d8f0a8b57c39049bef581b46327404"
66 | dependencies = [
67 | "libc",
68 | "rand_chacha",
69 | "rand_core",
70 | ]
71 |
72 | [[package]]
73 | name = "rand_chacha"
74 | version = "0.3.1"
75 | source = "registry+https://github.com/rust-lang/crates.io-index"
76 | checksum = "e6c10a63a0fa32252be49d21e7709d4d4baf8d231c2dbce1eaa8141b9b127d88"
77 | dependencies = [
78 | "ppv-lite86",
79 | "rand_core",
80 | ]
81 |
82 | [[package]]
83 | name = "rand_core"
84 | version = "0.6.4"
85 | source = "registry+https://github.com/rust-lang/crates.io-index"
86 | checksum = "ec0be4795e2f6a28069bec0b5ff3e2ac9bafc99e6a9a7dc3547996c5c816922c"
87 | dependencies = [
88 | "getrandom",
89 | ]
90 |
91 | [[package]]
92 | name = "rbtree"
93 | version = "0.2.0"
94 | source = "registry+https://github.com/rust-lang/crates.io-index"
95 | checksum = "014d09f9f4dbb178240d78610a8ddbc18c57120b62f182fa859e0dd02b03708c"
96 |
97 | [[package]]
98 | name = "rust"
99 | version = "0.1.0"
100 | dependencies = [
101 | "rand",
102 | "rbtree",
103 | ]
104 |
105 | [[package]]
106 | name = "syn"
107 | version = "2.0.98"
108 | source = "registry+https://github.com/rust-lang/crates.io-index"
109 | checksum = "36147f1a48ae0ec2b5b3bc5b537d267457555a10dc06f3dbc8cb11ba3006d3b1"
110 | dependencies = [
111 | "proc-macro2",
112 | "quote",
113 | "unicode-ident",
114 | ]
115 |
116 | [[package]]
117 | name = "unicode-ident"
118 | version = "1.0.16"
119 | source = "registry+https://github.com/rust-lang/crates.io-index"
120 | checksum = "a210d160f08b701c8721ba1c726c11662f877ea6b7094007e1ca9a1041945034"
121 |
122 | [[package]]
123 | name = "wasi"
124 | version = "0.11.0+wasi-snapshot-preview1"
125 | source = "registry+https://github.com/rust-lang/crates.io-index"
126 | checksum = "9c8d87e72b64a3b4db28d11ce29237c246188f4f51057d65a7eab63b7987e423"
127 |
128 | [[package]]
129 | name = "zerocopy"
130 | version = "0.7.35"
131 | source = "registry+https://github.com/rust-lang/crates.io-index"
132 | checksum = "1b9b4fd18abc82b8136838da5d50bae7bdea537c574d8dc1a34ed098d6c166f0"
133 | dependencies = [
134 | "byteorder",
135 | "zerocopy-derive",
136 | ]
137 |
138 | [[package]]
139 | name = "zerocopy-derive"
140 | version = "0.7.35"
141 | source = "registry+https://github.com/rust-lang/crates.io-index"
142 | checksum = "fa4f8080344d4671fb4e831a13ad1e68092748387dfc4f55e356242fae12ce3e"
143 | dependencies = [
144 | "proc-macro2",
145 | "quote",
146 | "syn",
147 | ]
148 |
--------------------------------------------------------------------------------
/tree_map_corruption/rust/Cargo.toml:
--------------------------------------------------------------------------------
1 | [package]
2 | name = "rust"
3 | version = "0.1.0"
4 | edition = "2021"
5 |
6 | [dependencies]
7 | rbtree = "0.2.0"
8 | rand = "0.8"
9 |
--------------------------------------------------------------------------------
/tree_map_corruption/rust/README.md:
--------------------------------------------------------------------------------
1 |
2 |
3 |
4 |
5 | ```
6 | error[E0596]: cannot borrow data in an `Arc` as mutable
7 | --> src/main.rs:32:17
8 | |
9 | 32 | tree.insert(key, value);
10 | | ^^^^ cannot borrow as mutable
11 |
12 | ```
13 |
--------------------------------------------------------------------------------
/tree_map_corruption/rust/src/main.rs:
--------------------------------------------------------------------------------
1 | use rbtree::RBTree;
2 | use std::sync::Arc;
3 | use std::thread;
4 | use rand::Rng;
5 |
6 | fn main() {
7 | let args: Vec = std::env::args().collect();
8 |
9 | let num_threads = if args.len() >= 2 {
10 | args[1].parse::().unwrap()
11 | } else {
12 | 5
13 | };
14 |
15 | let num_updates = if args.len() >= 3 {
16 | args[2].parse::().unwrap()
17 | } else {
18 | 1000
19 | };
20 |
21 | let tree = Arc::new(RBTree::new());
22 |
23 | let mut handles = vec![];
24 |
25 | for _ in 0..num_threads {
26 | let tree = Arc::clone(&tree);
27 | let handle = thread::spawn(move || {
28 | let mut rng = rand::thread_rng();
29 | for _ in 0..num_updates {
30 | let key = rng.gen_range(0..1000);
31 | let value = rng.gen_range(0..1000);
32 | tree.insert(key, value);
33 | }
34 | });
35 | handles.push(handle);
36 | }
37 |
38 | for handle in handles {
39 | handle.join().unwrap();
40 | }
41 | }
42 |
--------------------------------------------------------------------------------