Let’s look at another problem I recently discovered.
I had so much back pain yesterday that I called 119 and went to the emergency room.
Updated: Sun Feb 18 07:35:57 KST 2024
Cim 1.0.0 is released.
The example source code is also attached, so if you are interested, please try it.
Nimf 2024.01.25 is released.
When I checked with the
kqread is displayed in the STATE column.
In the case of
poll(), there is a problem that if n
fds are added, the loop to check the event must repeat n times. However, since
kevent() returns a list of events that have occurred, the loop only needs to iterate as many times as the number of events that have occurred. So I’m expecting that using
kqueue() will improve the performance of Nimf.
This function creates a virtual absolute path.
One thing to consider is that the path does not exceed
If you input a relative path, it will be combined with the result of the
I’m currently writing file monitoring source code.
This is the source code implemented in C.
I plan to integrate this code into
In the future, I plan to apply it to the client side of Nimf and operate it in both a communication-based singleton instance method and a non-communication-based multi-instance method.
The recent malicious behavior reminded me of some malicious behavior I suffered about 5 years ago.