kof02guy opened a new issue, #2762: URL: https://github.com/apache/brpc/issues/2762
看实现是类似一个一个MPSC的无锁队列。 多个producer会通过exchange保证调用顺序和WriteRequest的插入顺序是一致的。在single consumer写之前，会找到old_head和new_head之间的WriteRequest进行链表反转，然后往fd里写出这一部分数据。 一般实现是：单纯的单链表，维护一个head和一个tail指针，在producer在head插入新的WriteRequest，而consumer在tail处消费。 请问这样的一般实现和目前的实现相比，目前的实现会有哪些advantage么？ -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. To unsubscribe, e-mail: dev-unsubscr...@brpc.apache.org.apache.org For queries about this service, please contact Infrastructure at: us...@infra.apache.org --------------------------------------------------------------------- To unsubscribe, e-mail: dev-unsubscr...@brpc.apache.org For additional commands, e-mail: dev-h...@brpc.apache.org
