加入 Gitee
与超过 1200万 开发者一起发现、参与优秀开源项目,私有仓库也完全免费 :)
免费加入
文件
该仓库未声明开源许可证文件(LICENSE),使用请关注具体项目描述及其代码上游依赖。
克隆/下载
0021-refactor-event-if-ring-is-full-the-node-is-added-to-.patch 950 Bytes
一键复制 编辑 原始数据 按行查看 历史
From b7faf0800631668d4d23cb497f1ceeb5948e4a41 Mon Sep 17 00:00:00 2001
From: jiangheng <jiangheng12@huawei.com>
Date: Tue, 15 Mar 2022 19:22:22 +0800
Subject: [PATCH] refactor event, if ring is full, the node is added to list
---
src/include/lwipsock.h | 4 ++++
1 file changed, 4 insertions(+)
diff --git a/src/include/lwipsock.h b/src/include/lwipsock.h
index 355bf47..36bcaed 100644
--- a/src/include/lwipsock.h
+++ b/src/include/lwipsock.h
@@ -104,12 +104,16 @@ struct lwip_sock {
struct pbuf *send_lastdata; /* unread data in one pbuf */
void *send_ring;
int32_t recv_flags;
+ int32_t send_flags;
bool wait_close;
int32_t attach_fd;
struct lwip_sock *shadowed_sock;
struct list_node attach_list;
struct list_node listen_list;
struct list_node recv_list;
+ struct list_node event_list;
+ struct list_node wakeup_list;
+ struct list_node send_list;
int32_t nextfd; /* listenfd list */
#endif
};
--
1.8.3.1
马建仓 AI 助手
尝试更多
代码解读
代码找茬
代码优化