-
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…
-
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…
-
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…
-
Is all I/O blocking? – Create Your Own Event Queue
Finally, a question that’s easy to answer. The answer is a big, resounding… maybe. The thing is that not all I/O operations will block in the sense that the operating system will park the calling thread and it will be more efficient to switch to another task. The reason for this is that the operating…
-
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…
