-
How to use the repository alongside the book – Creating Our Own Fibers
The recommended way to read this chapter is to have the repository open alongside the book. In the repository, you’ll find three different folders that correspond to the examples we go through in this chapter: In addition, you will get two more examples that I refer to in the book but that should be explored…
-
Technical requirements – Creating Our Own Fibers
In this chapter, we take a deep dive into a very popular way of handling concurrency. There is no better way of getting a fundamental understanding of the subject than doing it yourself. Fortunately, even though the topic is a little complex, we only need around 200 lines of code to get a fully working…
-
Summary – Create Your Own Event Queue
The concept of epoll, kqueue, and IOCP is pretty simple at a high level, but the devil is in the details. It’s just not that easy to understand and get it working correctly. Even programmers who work on these things will often specialize in one platform (epoll/kqueue or Windows). It’s rare that one person will…
-
BE CAREFUL WITH USING TCPSTREAM::READ_TO_END – Create Your Own Event Queue
You should be careful with using TcpStream::read_to_end or any other function that fully drains the buffer for you when using non-blocking buffers. If you get an error of the io::WouldBlock type, it will report that as an error even though you had several successful reads before you got that error. You have no way of…
-
TCPSTREAM IN RUST AND NAGLE’S ALGORITHM – Create Your Own Event Queue-2
The last part of main is simply to write FINISHED to the console to let us know we exited main at that point. The last bit of code in this chapter is the handle_events function. This function takes two arguments, a slice of Event structs and a mutable slice of TcpStream objects. Let’s take a…
-
TCPSTREAM IN RUST AND NAGLE’S ALGORITHM – Create Your Own Event Queue-1
Here is a little fact for you (I originally intended to call it a “fun fact,” but realized that’s stretching the concept of “fun” just a little too far!). In Rust’s TcpStream, and, more importantly, most APIs that aim to mimic the standard library’s TcpStream such as mio or Tokio, the stream is created with…
-
NOTE – Create Your Own Event Queue
For simplicity, we use the index the event will have in the streams collection as its ID. This ID will be the same as the i variable in our loop. For example, in the first loop, i will be 0; it will also be the first stream to be pushed to our streams collection, so…
-
The main program – Create Your Own Event Queue
Let’s see how it all works in practice. Make sure that delayserver is up and running, because we’ll need it for these examples to work. The goal is to send a set of requests to delayserver with varying delays and then use epoll to wait for the responses. Therefore, we’ll only use epoll to track…
-
NOTE – Create Your Own Event Queue
We would get a value of 0 if a timeout elapses before an event has happened. The last thing we do is to make an unsafe call to events.set_len(res as usize). This function is unsafe since we could potentially set the length so that we would access memory that’s not been initialized yet in safe…
-
WHAT ABOUT WAITING ON EPOLL_WAIT IN MULTIPLE THREADS? – Create Your Own Event Queue
As long as we only have one Poll instance, we avoid the problems and subtleties of having multiple threads calling epoll_wait on the same epoll instance. Using level-triggered events will wake up all threads that are waiting in the epoll_wait call, causing all of them to try to handle the event (this is often referred…
