Olivier Langlois

I have found a part of the answer. In L2TP RFC 2661, section 8.1, it is written the following: If VJ compression is used, and neither PPP reliable delivery nor...

I still have to dig more the project code to figure out if VJ compression match pcompression or accompression and if the same reasoning applies to both pppd compressions...

check for io_uring_wait_cqe_timeout(). I suspect this is what you need. Concerning your questioning about whether or not the wait functions will also submit the sqes. I did review the code...

> > Userspace fills SQEs, so it should know when it needs to submit anything or not. > > On this point, we can certainly keep track of the number...

I got this error while parsing a JSON string: too big integer near '15726282638479065023' This number is bigger than LLONG_MAX but is smaller than ULLONG_MAX so it would fit into...

I am sure that if the pull request is viable, few more things would need to be added. I just added the bare minimum that I needed to fix my...

Petri, no problem. I understand. At least, I'm happy to see that this jansson limitation starts to become increasingly annoying is under your radar. I'm looking forward how you are...

I think that it is the opposite. Because the original for loop is copying one byte at a time, overlap safety is implied. If number_to_move is bigger than half of...

Also, the other thing to consider is: how big is the average copy? I would think that for most lexers, where token size are pretty small, those copies must be...

On Fri, 2020-03-06 at 18:44 -0800, Rick Price wrote: > Doesn't memcpy already manage overlapping regions? It's been a while, > but I > thought that was the whole point...