-
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…
-
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…
-
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…
-
Level-triggered versus edge-triggered events – Create Your Own Event Queue
In a perfect world, we wouldn’t need to discuss this, but when working with epoll, it’s almost impossible to avoid having to know about the difference. It’s not obvious by reading the documentation, especially not if you haven’t had previous experience with these terms before. The interesting part of this is that it allows us…
-
WHAT DOES #[REPR(PACKED)] DO? – Create Your Own Event Queue
The #[repr(packed)] annotation is new to us. Usually, a struct will have padding either between fields or at the end of the struct. This happens even when we’ve specified #[repr(C)]. The reason has to do with efficient access to the data stored in the struct by not having to make multiple fetches to get the…
-
The ffi module – Create Your Own Event Queue-1
Note The reason for doing file I/O in a thread pool is that there have historically been poor cross-platform APIs for non-blocking file I/O. While it’s true that many runtimes choose to relegate this task to a thread pool making blocking calls to the OS, it might not be true in the future as the…
-
MIO – Create Your Own Event Queue-2
We’ll also use the std::io::Result type as our own Result type. It’s convenient since most errors will stem from one of our calls into the operating system, and an operating system error can be mapped to an io::Error type. There are two main abstractions over epoll. One is a structure called Poll and the other…
-
THE DELAY SERVER – Create Your Own Event Queue
This example relies on calls made to a server that delays the response for a configurable duration. In the repository, there is a project named delayserver in the root folder. You can set up the server by simply entering the folder in a separate console window and writing cargo run. Just leave the server running…
-
Technical requirements – Create Your Own Event Queue
In this chapter, we’ll create a simple version of an event queue using epoll. We’ll take inspiration from mio (https://github.com/tokio-rs/mio), a low-level I/O library written in Rust that underpins much of the Rust async ecosystem. Taking inspiration from mio has the added benefit of making it easier to dive into their code base if you…
