当前位置： 首页 > wzjs >正文

有什么教做维c甜品的网站河西苏州网站建设

wzjs 2025/9/15 13:44:43
有什么教做维c甜品的网站,河西苏州网站建设,产品画册设计怎么做,百度站长工具后台目录 1.设计用户态网络缓冲区的原因 2.代码实现(chainbuff)不需要腾挪数据 自由扩缩容的用户态网络缓冲区 3.总结 网络缓冲区分为内核缓冲区和用户态网络缓冲区 我们重点要实现用户态网络缓冲区 1.设计用户态网络缓冲区的原因 ①.生产者和消费者的速度不匹配问题&#xff…

目录

1.设计用户态网络缓冲区的原因

2.代码实现(chainbuff)不需要腾挪数据 自由扩缩容的用户态网络缓冲区

3.总结

网络缓冲区分为内核缓冲区和用户态网络缓冲区

我们重点要实现用户态网络缓冲区

1.设计用户态网络缓冲区的原因

①.生产者和消费者的速度不匹配问题，

需要缓存数据。

②.粘包处理问题，

不能确保一次系统调用读取或写入完整数据包。

2.代码实现(chainbuff)不需要腾挪数据 自由扩缩容的用户态网络缓冲区

①.c文件


#include <string.h>
#include <stdbool.h>
#include <string.h>
#include <stdlib.h>
#include "buffer.h"struct buf_chain_s {struct buf_chain_s *next;uint32_t buffer_len;uint32_t misalign;//有效数据的起始指针uint32_t off;//有效数据的长度uint8_t *buffer;
};struct buffer_s {buf_chain_t *first;buf_chain_t *last;buf_chain_t **last_with_datap;uint32_t total_len;uint32_t last_read_pos; // for sep read
};#define CHAIN_SPACE_LEN(ch) ((ch)->buffer_len - ((ch)->misalign + (ch)->off))
#define MIN_BUFFER_SIZE 1024
#define MAX_TO_COPY_IN_EXPAND 4096
#define BUFFER_CHAIN_MAX_AUTO_SIZE 4096
#define MAX_TO_REALIGN_IN_EXPAND 2048
#define BUFFER_CHAIN_MAX 16*1024*1024  // 16M
#define BUFFER_CHAIN_EXTRA(t, c) (t *)((buf_chain_t *)(c) + 1)
#define BUFFER_CHAIN_SIZE sizeof(buf_chain_t)uint32_t
buffer_len(buffer_t *buf) {return buf->total_len;
}buffer_t *
buffer_new(uint32_t sz) {(void)sz;buffer_t * buf = (buffer_t *) malloc(sizeof(buffer_t));if (!buf) {return NULL;}memset(buf, 0, sizeof(*buf));buf->last_with_datap = &buf->first;return buf;
}static buf_chain_t *
buf_chain_new(uint32_t size) {buf_chain_t *chain;uint32_t to_alloc;if (size > BUFFER_CHAIN_MAX - BUFFER_CHAIN_SIZE)return (NULL);size += BUFFER_CHAIN_SIZE;if (size < BUFFER_CHAIN_MAX / 2) {to_alloc = MIN_BUFFER_SIZE;while (to_alloc < size) {to_alloc <<= 1;}} else {to_alloc = size;}if ((chain = malloc(to_alloc)) == NULL)return (NULL);memset(chain, 0, BUFFER_CHAIN_SIZE);chain->buffer_len = to_alloc - BUFFER_CHAIN_SIZE;chain->buffer = BUFFER_CHAIN_EXTRA(uint8_t, chain);return (chain);
}static void 
buf_chain_free_all(buf_chain_t *chain) {buf_chain_t *next;for (; chain; chain = next) {next = chain->next;free(chain);}
}void
buffer_free(buffer_t *buf) {buf_chain_free_all(buf->first);
}static buf_chain_t **
free_empty_chains(buffer_t *buf) {buf_chain_t **ch = buf->last_with_datap;while ((*ch) && (*ch)->off != 0)ch = &(*ch)->next;if (*ch) {buf_chain_free_all(*ch);*ch = NULL;}return ch;
}static void
buf_chain_insert(buffer_t *buf, buf_chain_t *chain) {if (*buf->last_with_datap == NULL) {buf->first = buf->last = chain;} else {buf_chain_t **chp;chp = free_empty_chains(buf);*chp = chain;if (chain->off)buf->last_with_datap = chp;buf->last = chain;}buf->total_len += chain->off;
}static inline buf_chain_t *
buf_chain_insert_new(buffer_t *buf, uint32_t datlen) {buf_chain_t *chain;if ((chain = buf_chain_new(datlen)) == NULL)return NULL;buf_chain_insert(buf, chain);return chain;
}static int
buf_chain_should_realign(buf_chain_t *chain, uint32_t datlen)
{return chain->buffer_len - chain->off >= datlen &&(chain->off < chain->buffer_len / 2) &&(chain->off <= MAX_TO_REALIGN_IN_EXPAND);
}static void
buf_chain_align(buf_chain_t *chain) {memmove(chain->buffer, chain->buffer + chain->misalign, chain->off);chain->misalign = 0;
}int buffer_add(buffer_t *buf, const void *data_in, uint32_t datlen) {buf_chain_t *chain, *tmp;const uint8_t *data = data_in;uint32_t remain, to_alloc;int result = -1;if (datlen > BUFFER_CHAIN_MAX - buf->total_len) {goto done;}if (*buf->last_with_datap == NULL) {chain = buf->last;} else {chain = *buf->last_with_datap;}if (chain == NULL) {chain = buf_chain_insert_new(buf, datlen);if (!chain)goto done;}remain = chain->buffer_len - chain->misalign - chain->off;if (remain >= datlen) {memcpy(chain->buffer + chain->misalign + chain->off, data, datlen);chain->off += datlen;buf->total_len += datlen;// buf->n_add_for_cb += datlen;goto out;} else if (buf_chain_should_realign(chain, datlen)) {buf_chain_align(chain);memcpy(chain->buffer + chain->off, data, datlen);chain->off += datlen;buf->total_len += datlen;// buf->n_add_for_cb += datlen;goto out;}to_alloc = chain->buffer_len;if (to_alloc <= BUFFER_CHAIN_MAX_AUTO_SIZE/2)to_alloc <<= 1;if (datlen > to_alloc)to_alloc = datlen;tmp = buf_chain_new(to_alloc);if (tmp == NULL)goto done;if (remain) {memcpy(chain->buffer + chain->misalign + chain->off, data, remain);chain->off += remain;buf->total_len += remain;// buf->n_add_for_cb += remain;}data += remain;datlen -= remain;memcpy(tmp->buffer, data, datlen);tmp->off = datlen;buf_chain_insert(buf, tmp);// buf->n_add_for_cb += datlen;
out:result = 0;
done:return result;
}static uint32_t
buf_copyout(buffer_t *buf, void *data_out, uint32_t datlen) {buf_chain_t *chain;char *data = data_out;uint32_t nread;chain = buf->first;if (datlen > buf->total_len)datlen = buf->total_len;if (datlen == 0)return 0;nread = datlen;while (datlen && datlen >= chain->off) {uint32_t copylen = chain->off;memcpy(data,chain->buffer + chain->misalign,copylen);data += copylen;datlen -= copylen;chain = chain->next;}if (datlen) {memcpy(data, chain->buffer + chain->misalign, datlen);}return nread;
}static inline void
ZERO_CHAIN(buffer_t *dst) {dst->first = NULL;dst->last = NULL;dst->last_with_datap = &(dst)->first;dst->total_len = 0;
}int buffer_drain(buffer_t *buf, uint32_t len) {buf_chain_t *chain, *next;uint32_t remaining, old_len;old_len = buf->total_len;if (old_len == 0)return 0;if (len >= old_len) {len = old_len;for (chain = buf->first; chain != NULL; chain = next) {next = chain->next;free(chain);}ZERO_CHAIN(buf);} else {buf->total_len -= len;remaining = len;for (chain = buf->first; remaining >= chain->off; chain = next) {next = chain->next;remaining -= chain->off;if (chain == *buf->last_with_datap) {buf->last_with_datap = &buf->first;}if (&chain->next == buf->last_with_datap)buf->last_with_datap = &buf->first;free(chain);}buf->first = chain;chain->misalign += remaining;chain->off -= remaining;}// buf->n_del_for_cb += len;return len;
}int buffer_remove(buffer_t *buf, void *data_out, uint32_t datlen) {uint32_t n = buf_copyout(buf, data_out, datlen);if (n > 0) {if (buffer_drain(buf, n) < 0)n = -1;}return (int)n;
}static bool
check_sep(buf_chain_t * chain, int from, const char *sep, int seplen) {for (;;) {int sz = chain->off - from;if (sz >= seplen) {return memcmp(chain->buffer + chain->misalign + from, sep, seplen) == 0;}if (sz > 0) {if (memcmp(chain->buffer + chain->misalign + from, sep, sz)) {return false;}}chain = chain->next;sep += sz;seplen -= sz;from = 0;}
}int buffer_search(buffer_t *buf, const char* sep, const int seplen) {buf_chain_t *chain;int i;chain = buf->first;if (chain == NULL)return 0;int bytes = chain->off;while (bytes <= buf->last_read_pos) {chain = chain->next;if (chain == NULL)return 0;bytes += chain->off;}bytes -= buf->last_read_pos;int from = chain->off - bytes;for (i = buf->last_read_pos; i <= buf->total_len - seplen; i++) {if (check_sep(chain, from, sep, seplen)) {buf->last_read_pos = 0;return i+seplen;}++from;--bytes;if (bytes == 0) {chain = chain->next;from = 0;if (chain == NULL)break;bytes = chain->off;}}buf->last_read_pos = i;return 0;
}uint8_t * buffer_write_atmost(buffer_t *p) {buf_chain_t *chain, *next, *tmp, *last_with_data;uint8_t *buffer;uint32_t remaining;int removed_last_with_data = 0;int removed_last_with_datap = 0;chain = p->first;uint32_t size = p->total_len;if (chain->off >= size) {return chain->buffer + chain->misalign;}remaining = size - chain->off;for (tmp=chain->next; tmp; tmp=tmp->next) {if (tmp->off >= (size_t)remaining)break;remaining -= tmp->off;}if (chain->buffer_len - chain->misalign >= (size_t)size) {/* already have enough space in the first chain */size_t old_off = chain->off;buffer = chain->buffer + chain->misalign + chain->off;tmp = chain;tmp->off = size;size -= old_off;chain = chain->next;} else {if ((tmp = buf_chain_new(size)) == NULL) {return NULL;}buffer = tmp->buffer;tmp->off = size;p->first = tmp;}last_with_data = *p->last_with_datap;for (; chain != NULL && (size_t)size >= chain->off; chain = next) {next = chain->next;if (chain->buffer) {memcpy(buffer, chain->buffer + chain->misalign, chain->off);size -= chain->off;buffer += chain->off;}if (chain == last_with_data)removed_last_with_data = 1;if (&chain->next == p->last_with_datap)removed_last_with_datap = 1;free(chain);}if (chain != NULL) {memcpy(buffer, chain->buffer + chain->misalign, size);chain->misalign += size;chain->off -= size;} else {p->last = tmp;}tmp->next = chain;if (removed_last_with_data) {p->last_with_datap = &p->first;} else if (removed_last_with_datap) {if (p->first->next && p->first->next->off)p->last_with_datap = &p->first->next;elsep->last_with_datap = &p->first;}return tmp->buffer + tmp->misalign;
}

②.h接口文件

#ifndef _chain_buffer_h
#define _chain_buffer_h
#include <stdint.h>typedef struct buf_chain_s buf_chain_t;
typedef struct buffer_s buffer_t;// struct buf_chain_s {
//     struct buf_chain_s *next;
//     uint32_t buffer_len;
//     uint32_t misalign;
//     uint32_t off;
//     uint8_t *buffer;
// };// struct buffer_s {
//     buf_chain_t *first;
//     buf_chain_t *last;
//     buf_chain_t **last_with_datap;
//     uint32_t total_len;
//     uint32_t last_read_pos; // for sep read
// };buffer_t * buffer_new(uint32_t sz);uint32_t buffer_len(buffer_t *buf);int buffer_add(buffer_t *buf, const void *data, uint32_t datlen);int buffer_remove(buffer_t *buf, void *data, uint32_t datlen);int buffer_drain(buffer_t *buf, uint32_t len);void buffer_free(buffer_t *buf);int buffer_search(buffer_t *buf, const char* sep, const int seplen);uint8_t * buffer_write_atmost(buffer_t *p);#endif
3.总结

用户态网络缓冲区通过减少内核与用户空间之间的交互、避免内存复制、提高数据处理效率，成为高性能网络应用中的关键技术。它被广泛应用于低延迟、高吞吐量的场景，如高频交易、网络虚拟化和流媒体等。不过，使用用户态网络缓冲区也带来了一些挑战，如内存管理和安全性问题，需要开发人员在设计时谨慎处理。


文章转载自：

http://TUluv7wr.hmqjj.cn
http://77wdlGCZ.hmqjj.cn
http://f09Fu3Pe.hmqjj.cn
http://RIGSSaBM.hmqjj.cn
http://H2SDyFwD.hmqjj.cn
http://LNLoroPE.hmqjj.cn
http://Z4Z3rb1M.hmqjj.cn
http://iU40IPid.hmqjj.cn
http://0t1AEuAt.hmqjj.cn
http://eA9gPkjK.hmqjj.cn
http://0BKP2Ssy.hmqjj.cn
http://JHgRPpSQ.hmqjj.cn
http://ELyCEyNM.hmqjj.cn
http://h2TGTm2K.hmqjj.cn
http://p6EuFWSU.hmqjj.cn
http://cLklOYNc.hmqjj.cn
http://zYZKUdWL.hmqjj.cn
http://vUsc9tiR.hmqjj.cn
http://uSOFx8Z9.hmqjj.cn
http://7xZYUGsG.hmqjj.cn
http://XVOTjlsw.hmqjj.cn
http://v6eOsMgo.hmqjj.cn
http://Qk209g5W.hmqjj.cn
http://C76Fb3sK.hmqjj.cn
http://vtTGbPfP.hmqjj.cn
http://ssniu1cW.hmqjj.cn
http://WP1tzTFx.hmqjj.cn
http://YStnZrd3.hmqjj.cn
http://IGtdCblY.hmqjj.cn
http://PFBduWoo.hmqjj.cn
http://www.dtcms.com/wzjs/742850.html

相关文章：

  • 安庆网站建设公司简中铁建设集团有限公司总部在哪
  • 网站建设产品分类网站开发模板下载
  • 丽水北京网站建设自由空间网站建设
  • 南京外贸网站建设案例开发网站网络公司排行
  • 衡阳企业网站建设老铁seo外链工具
  • 嘉峪关网站seo杭州g20网站建设公司
  • 山东省住房和城乡建设厅定额站子网站wordpress软件无法登陆
  • 六站合一的应用场景汕头seo优化流程
  • 网站建设素材图片江津网站建设怎么样
  • 怎么选择合适的网站开发公司阿里云商业网站建设视频
  • 杭州网站建站模板做好宣传信息网推广工作
  • 工行网站如何做理财风险评估wordpress 网易相册
  • 云计算存储网站建设安全佛山网上注册公司流程
  • 教育培训网站模板宁波网络营销外包推广
  • 电子商务网站建设文案公司建站详细步骤
  • 怎么做网站访问被拒绝wordpress天气插件
  • 网站备案需要资料学校网站建设钉钉
  • 公司的网站费怎样做会计分录全国知名十大计算机培训学校
  • 1元建站确定网站风格
  • jsp网站建设作业深圳网站建设小程序
  • 网站建设需求表格桐庐网站制作
  • 网站建设朋友圈广告语个人博客网站备案吗
  • 比较好的源码网站网站备案查询工信部app
  • 3合1网站建设网站前期准备
  • 广州网站设计公司vi设计公司wordpress关键词在哪里
  • 陈晓佳 中信建设有限责任公司优化网站排名茂名厂商
  • 营口化工网站建设百度网盟推广多少钱
  • 企业网站收录专业网站设计联系电话
  • 建设网站翻译英文翻译青岛 php 网站建设
  • 网站建站公司费用学校网站建设的难点