1 // Rust-101, Part 12: Concurrency (WIP)
4 use std::io::prelude::*;
5 use std::{io, fs, thread};
6 use std::sync::mpsc::{sync_channel, SyncSender, Receiver};
9 //@ This part is introducing the concurrency features of Rust. We are going to write our own small version of "grep",
10 //@ called *rgrep*, and it is going to make use of multiple cores: One thread reads the input files, one thread does
11 //@ the actual matching, and one thread writes the output.
13 // Before we come to the actual code, we define a data-structure `Options` to store all the information we need
14 // to complete the job: Which files to work on, which pattern to look for, and how to output. <br/>
15 // Besides just printing all the matching lines, we will also offer to count them, or alternatively to sort them.
22 use self::OutputMode::*;
27 output_mode: OutputMode,
30 //@ Now we can write three functions to do the actual job of reading, matching, and printing, respectively.
31 //@ To get the data from one thread to the next, we will use *message passing*: We will establish communication
32 //@ channels between the threads, with one thread *sending* data, and the other one receiving it. `SyncSender<T>`
33 //@ is the type of the sending end of a synchronous channel transmitting data of type `T`. *Synchronous* here
34 //@ means that the `send` operation could block, waiting for the other side to make progress. We don't want to
35 //@ end up with the entire files being stored in the buffer of the channels, and the output not being fast enough
36 //@ to keep up with the speed of input.
38 //@ We also need all the threads to have access to the options of the job they are supposed to do. Since it would
39 //@ be rather unnecessary to actually copy these options around, we will use reference-counting to share them between
40 //@ all threads. `Arc` is the thread-safe version of `Rc, using atomic operations to keep the reference count up-to-date.
41 //@ You can also think of this as saying that *all* threads own the `Options` "a bit" - and since there could be other
42 //@ owners, `Arc` (just like `Rc`) only permits read-only access to its content. That's good enough for the options, though.
44 // The first functions reads the files, and sends every line over the `out_channel`.
45 fn read_files(options: Arc<Options>, out_channel: SyncSender<String>) {
46 for file in options.files.iter() {
47 // First, we open the file, ignoring any errors.
48 let file = fs::File::open(file).unwrap();
49 // Then we obtain a `BufReader` for it, which provides the `lines` function.
50 let file = io::BufReader::new(file);
51 for line in file.lines() {
52 let line = line.unwrap();
53 // Now we send the line over the channel, ignoring the possibility of `send` failing.
54 out_channel.send(line).unwrap();
57 // When we drop the `out_channel`, it will be closed, which the other end can notice.
60 // The second function filters the lines it receives through `in_channel` with the pattern, and sends
61 // matches via `out_channel`.
62 fn filter_lines(options: Arc<Options>, in_channel: Receiver<String>, out_channel: SyncSender<String>) {
63 // We can simply iterate over the channel, which will stop when the channel is closed.
64 for line in in_channel.iter() {
65 // `contains` works on lots of types of patterns, but in particular, we can use it to test whether
66 // one string is contained in another.
67 if line.contains(&options.pattern) {
68 out_channel.send(line).unwrap(); /*@*/
73 // The third function performs the output operations, receiving the relevant lines on its `in_channel`.
74 fn output_lines(options: Arc<Options>, in_channel: Receiver<String>) {
75 match options.output_mode {
77 // Here, we just print every line we see.
78 for line in in_channel.iter() {
79 println!("{}", line); /*@*/
83 // We are supposed to count the number of matching lines. There's a convenient iterator adapter that
84 // we can use for this job.
85 let count = in_channel.iter().count(); /*@*/
86 println!("{} hits for {}.", count, options.pattern); /*@*/
89 // We are asked to sort the matching lines before printing. So let's collect them all in a local vector...
90 let data: Vec<String> = in_channel.iter().collect();
91 // ...and implement the actual sorting later.
97 // With the operations of the three threads defined, we can now implement a function that performs grepping according
98 // to some given options.
99 fn run(options: Options) {
100 // We move the `options` into an `Arc`, as that's what the thread workers expect.
101 let options = Arc::new(options);
103 // Set up the channels. Use `sync_channel` with buffer-size of 16 to avoid needlessly filling RAM.
104 let (line_sender, line_receiver) = sync_channel(16);
105 let (filtered_sender, filtered_receiver) = sync_channel(16);
107 // Spawn the read thread: `thread::spawn` takes a closure that is run in a new thread.
108 //@ The `move` keyword again tells Rust that we want ownership of captured variables to be moved into the
109 //@ closure. This means we need to do the `clone` *first*, otherwise we would lose our `options` to the
111 let options1 = options.clone();
112 let handle1 = thread::spawn(move || read_files(options1, line_sender));
114 // Same with the filter thread.
115 let options2 = options.clone();
116 let handle2 = thread::spawn(move || filter_lines(options2, line_receiver, filtered_sender));
118 // And the output thread.
119 let options3 = options.clone();
120 let handle3 = thread::spawn(move || output_lines(options3, filtered_receiver));
122 // Finally, wait until all three threads did their job.
123 handle1.join().unwrap();
124 handle2.join().unwrap();
125 handle3.join().unwrap();
128 // Now we have all the pieces together for testing our `rgrep` with some hard-coded options.
129 //@ We need to call `to_string` on string literals to convert them to a fully-owned `String`.
131 let options = Options {
132 files: vec!["src/part10.rs".to_string(), "src/part11.rs".to_string(), "src/part12.rs".to_string()],
133 pattern: "let".to_string(),
139 // **Exercise 12.1**: Change `rgrep` such that it prints now only the matching lines, but also the name of the file
140 // and the number of the line in the file. You will have to change the type of the channels from `String` to something
141 // that records this extra information.
143 //@ ## Ownership, Borrowing, and Concurrency
144 //@ The little demo above showed that concurrency in Rust has a fairly simple API. However, considering Rust has closures,
145 //@ that should not be entirely surprising. However, as I mentioned in the beginning, Rust ensures that well-typed programs
146 //@ do not have data races. How can that be? A data race is typically defined as having two concurrent, unsynchronized
147 //@ accesses to the same memory location, at least one of which is a write. In other words, a data race is mutation in
148 //@ the presence of aliasing, which Rust reliably rules out! It turns out that the same mechanism that makes our single-threaded
149 //@ programs memory safe, and that prevents us from invalidating iterators, also helps secure our multi-threaded code against
150 //@ data races. For example, notice how `read_files` sends a `String` to `filter_lines`. At run-time, only the pointer to
151 //@ the string will actually be moved around (just like when a `String` is passed to a function with full ownership). However,
152 //@ `read_files` has to *give up* ownership of the string to perform `send`, to it is impossible for an outstanding borrow to
153 //@ still be around. After it sent the string to the other side, `read_files` has no way to race on the data with someone else.
155 //@ However, there is more to this. Remember the `'static` bound we had to add to `register` in the previous part, to make
156 //@ sure that the callbacks to not reference any pointers that might become invalid? This is just as crucial for spawning
157 //@ a thread: In general, that thread could last for much longer than the current stack frame. Thus, it must not use
158 //@ any pointers to data in that stack frame. This is achieved by requiring the `FnOnce` closure passed to `thread::spawn`
159 //@ to be valid for lifetime `'static`, as you can see in [its documentation](http://doc.rust-lang.org/stable/std/thread/fn.spawn.html).
160 //@ This avoids another kind of data race, where the thread's access races with the callee deallocating its stack frame.
163 //@ However, the story goes further. I said above that `Arc` is a thread-safe version of `Rc`, which uses atomic operations
164 //@ to manipulate the reference count. It is thus crucial that we don't use `Rc` above, or the reference count may become invalid.
165 //@ And indeed, if you replace `Arc` by `Rc` (and add the appropriate imports), Rust will tell you that something is wrong.
166 //@ That's great, of course, but how did it do that?
168 //@ The answer is already hinted at in the error: It will say something about `Send`. You may have noticed that the closure in
169 //@ `thread::spawn` does not just have a `'static` bound, but also has to satisfy `Send`. `Send` is a trait, and just like `Copy`,
170 //@ it's just a marker - there are no functions provided by `Send` What the trait says is that types which are `Send`, can be
171 //@ safely sent to another thread without causing trouble. Of course, all the primitive data-types are `Send`. So is `Arc`,
172 //@ which is why Rust accepted our code. But `Rc` is not `Send`, and for a good reason!
174 //@ Now, `Send` as a trait is fairly special. It has a so-called *default implementation*. This means that *every type* implements
175 //@ `Send`, unless it opts out. Opting out is viral: If your type contains a type that opted out, then you don't have `Send`, either.
176 //@ So if the environment of your closure contains an `Rc`, it won't be `Send`, preventing it from causing trouble. If however every
177 //@ captured variable *is* `Send`, then so is the entire environment, and you are good.
179 //@ [index](main.html) | [previous](part11.html) | [next](main.html)