C++ 用户态协议栈:基于 DPDK 的 C++ 网络库开发与内核绕过技术分析

news2026/4/2 9:00:33
各位技术同仁下午好今天我们将深入探讨一个在高性能网络领域至关重要的话题C 用户态协议栈的开发特别是如何基于 DPDK 构建一个高性能网络库以及其背后的内核绕过技术。在现代数据中心和网络基础设施中传统内核协议栈的性能瓶颈日益凸显用户态协议栈的出现正是为了突破这些限制实现极致的网络吞吐和超低延迟。传统网络栈的局限性与用户态协议栈的兴起在深入用户态协议栈之前我们首先需要理解为什么需要它。操作系统提供的标准网络协议栈如 Linux 内核协议栈虽然功能完善、鲁棒性强但在面对高并发、高吞吐和低延迟场景时其性能瓶颈变得尤为突出。这些瓶颈主要源于以下几个方面上下文切换 (Context Switches)数据包从网卡到达时会触发中断导致CPU从用户态切换到内核态处理数据包处理完成后再切换回用户态。在高数据包速率下频繁的上下文切换会消耗大量的CPU资源。数据拷贝 (Data Copies)数据包在内核和用户空间之间传递时通常需要进行多次数据拷贝。例如从网卡DMA到内核缓冲区再从内核缓冲区拷贝到用户应用缓冲区。这些拷贝操作是内存密集型的会占用宝贵的CPU周期和内存带宽。中断处理开销 (Interrupt Overhead)每当网卡接收到数据包时通常会产生一个中断。CPU需要暂停当前任务来响应中断处理中断服务例程ISR。在高数据包速率下中断频率过高会使得CPU大部分时间都在处理中断而非执行有效业务逻辑。锁竞争 (Lock Contention)内核协议栈为了保护共享数据结构如路由表、连接状态等在多核环境下的并发访问广泛使用锁机制。在高并发场景下锁竞争可能导致严重的性能下降。复杂的调度与队列管理 (Complex Scheduling and Queue Management)内核协议栈内部有复杂的调度器和多级队列虽然提供了公平性和QoS但在追求极致性能时这些额外的逻辑会引入不可避免的延迟。为了克服这些限制用户态协议栈 (Userspace Network Stack)应运而生。其核心思想是绕过操作系统内核的网络协议栈将网卡硬件直接映射到用户空间让应用程序能够直接、高效地收发数据包并在用户空间实现完整的协议处理逻辑。DPDK (Data Plane Development Kit) 便是这一领域最成熟、最广泛使用的框架之一。DPDK 核心原理与优势DPDK 是 Intel 开源的一套库和驱动程序集合旨在为快速数据包处理应用程序提供高性能。它通过一系列创新的技术实现了对内核的“旁路”让应用程序直接掌控网卡硬件。DPDK 的关键技术点技术点描述优势DPDK 技术特点描述#include iostream #include string #include vector #include memory #include thread #include chrono #include atomic #include array #include iomanip #include numeric #include map #include deque #include mutex // For logging, not for data path #include condition_variable // For logging, not for data path #include functional // DPDK Includes - These would typically be installed system-wide or relative to a DPDK build. // For demonstration, well mock them with necessary structures and functions. #define RTE_MAX_ETHPORTS 32 #define RTE_MAX_LCORE 128 #define RTE_ETHER_ADDR_LEN 6 #define RTE_ETHER_TYPE_ARP 0x0806 #define RTE_ETHER_TYPE_IPV4 0x0800 // Mock DPDK types using rte_lcore_id_t unsigned int; using rte_port_id_t unsigned int; using rte_mempool_t void*; // Placeholder for mempool using rte_ring_t void*; // Placeholder for ring buffer struct rte_ether_addr { uint8_t addr_bytes[RTE_ETHER_ADDR_LEN]; }; struct rte_ether_hdr { rte_ether_addr dst_addr; rte_ether_addr src_addr; uint16_t ether_type; // Network byte order }; struct rte_ipv4_hdr { uint8_t version_ihl; // Version (4 bits) Internet Header Length (4 bits) uint8_t type_of_service; uint16_t total_length; // Total length of the IP packet (network byte order) uint16_t packet_id; uint16_t fragment_offset; uint8_t time_to_live; uint8_t next_proto_id; // Protocol (e.g., TCP, UDP) uint16_t hdr_checksum; uint32_t src_addr; // Network byte order uint32_t dst_addr; // Network byte order }; // Simplified ARP header structure for IPv4 struct rte_arp_hdr { uint16_t hrd; // Hardware type (e.g., Ethernet) uint16_t pro; // Protocol type (e.g., IPv4) uint8_t hln; // Hardware address length (e.g., 6 for Ethernet) uint8_t pln; // Protocol address length (e.g., 4 for IPv4) uint16_t op; // Operation (e.g., ARP request, ARP reply) rte_ether_addr sender_mac; uint32_t sender_ip; // Network byte order rte_ether_addr target_mac; uint32_t target_ip; // Network byte order }; // Mock rte_mbuf structure struct rte_mbuf { void* buf_addr; // Pointer to the start of the data buffer uint32_t data_off; // Offset to the start of valid data uint31_t pkt_len; // Total length of the packet in the mbuf uint31_t data_len; // Length of the valid data in this segment rte_mempool_t pool; // Mempool this mbuf came from // ... other DPDK mbuf fields would be here ... // Helper to get data pointer template typename T T* get_data() { return static_castT*(static_castchar*(buf_addr) data_off); } // Helper to adjust data offset/length (e.g., for adding/removing headers) void prepend_data(uint32_t len) { if (data_off len) { data_off - len; pkt_len len; data_len len; } else { // Error: Not enough headroom std::cerr Error: Not enough headroom for prepend_data std::endl; } } void append_data(uint32_t len) { // Simplified: assumes enough tailroom pkt_len len; data_len len; } void remove_data(uint32_t len) { if (data_len len) { data_off len; pkt_len - len; data_len - len; } else { // Error: Not enough data std::cerr Error: Not enough data for remove_data std::endl; } } }; // Mock DPDK functions int rte_eal_init(int argc, char** argv) { std::cout DPDK EAL Initialized (Mock). std::endl; return 0; } int rte_eth_dev_count_avail() { return 1; // Assume one available port for demo } int rte_eth_dev_info_get(rte_port_id_t port_id, void* dev_info) { std::cout DPDK Port port_id info retrieved (Mock). std::endl; return 0; } int rte_eth_dev_configure(rte_port_id_t port_id, uint16_t rx_queues, uint16_t tx_queues, void* eth_conf) { std::cout DPDK Port port_id configured with rx_queues RX, tx_queues TX queues (Mock). std::endl; return 0; } int rte_eth_rx_queue_setup(rte_port_id_t port_id, uint16_t rx_queue_id, uint16_t nb_rx_desc, unsigned int socket_id, void* rx_conf, rte_mempool_t mb_pool) { std::cout DPDK Port port_id RX queue rx_queue_id setup (Mock). std::endl; return 0; } int rte_eth_tx_queue_setup(rte_port_id_t port_id, uint16_t tx_queue_id, uint16_t nb_tx_desc, unsigned int socket_id, void* tx_conf) { std::cout DPDK Port port_id TX queue tx_queue_id setup (Mock). std::endl; return 0; } int rte_eth_dev_start(rte_port_id_t port_id) { std::cout DPDK Port port_id started (Mock). std::endl; return 0; } int rte_eth_dev_set_promisc(rte_port_id_t port_id, int on) { std::cout DPDK Port port_id promiscuous mode (on ? on : off) (Mock). std::endl; return 0; } int rte_eth_macaddr_get(rte_port_id_t port_id, rte_ether_addr* mac_addr) { // Mock MAC address mac_addr-addr_bytes[0] 0x00; mac_addr-addr_bytes[1] 0x11; mac_addr-addr_bytes[2] 0x22; mac_addr-addr_bytes[3] 0x33; mac_addr-addr_bytes[4] 0x44; mac_addr-addr_bytes[5] 0x55 port_id; std::cout DPDK Port port_id MAC address retrieved (Mock). std::endl; return 0; } rte_mempool_t rte_pktmbuf_pool_create(const char* name, unsigned int n, unsigned int cache_size, uint16_t priv_size, uint16_t data_room_size, int socket_id) { std::cout Mempool name created with n mbufs (Mock). std::endl; // In a real DPDK app, this would return a valid mempool pointer. // For mock, well return a non-null placeholder. static char dummy_mempool_data[1]; return static_castrte_mempool_t(dummy_mempool_data); } unsigned int rte_lcore_id() { // Mock lcore ID for demonstration static thread_local unsigned int mock_lcore_id 0; // Each thread gets a unique ID in a real DPDK app return mock_lcore_id; } uint16_t rte_eth_rx_burst(rte_port_id_t port_id, uint16_t queue_id, rte_mbuf** rx_pkts, uint16_t nb_pkts) { // Mock: Simulate receiving 1-5 packets static std::atomicuint32_t pkt_count 0; uint16_t received (pkt_count % 5) 1; if (received nb_pkts) received nb_pkts; for (uint16_t i 0; i received; i) { // Simulate allocating a new mbuf and filling it with dummy data rte_mbuf* mbuf new rte_mbuf(); // In real DPDK, this would come from rte_pktmbuf_alloc mbuf-pool nullptr; // For mock, we dont manage mempool mbuf-buf_addr new char[2048]; // Max packet size mbuf-data_off 0; mbuf-pkt_len 64; // Simulate a small packet mbuf-data_len 64; // Simulate an Ethernet header rte_ether_hdr* eth_hdr mbuf-get_datarte_ether_hdr(); eth_hdr-ether_type htons(RTE_ETHER_TYPE_ARP); // Simulate an ARP packet // Fill other header fields (src/dst MAC) as needed for testing eth_hdr-src_addr {0xAA, 0xBB, 0xCC, 0xDD, 0xEE, 0xFF}; eth_hdr-dst_addr {0x00, 0x11, 0x22, 0x33, 0x44, 0x55}; rx_pkts[i] mbuf; } // std::cout Mock RX burst on Port port_id , Queue queue_id : received packets. std::endl; return received; } uint16_t rte_eth_tx_burst(rte_port_id_t port_id, uint16_t queue_id, rte_mbuf** tx_pkts, uint16_t nb_pkts) { // Mock: Simulate sending all packets and then freeing them for (uint16_t i 0; i nb_pkts; i) { // In real DPDK, rte_pktmbuf_free(tx_pkts[i]) would be called. // For mock, we manually delete. delete[] static_castchar*(tx_pkts[i]-buf_addr); delete tx_pkts[i]; } // std::cout Mock TX burst on Port port_id , Queue queue_id : nb_pkts packets. std::endl; return nb_pkts; } void rte_pktmbuf_free(rte_mbuf* m) { // Mock: Freeing an mbuf. In real DPDK, it returns to the mempool. // For our mock, we just delete the dynamically allocated memory. if (m) { delete[] static_castchar*(m-buf_addr); delete m; } } // Utility functions (e.g., for converting IP addresses, MAC addresses) std::string mac_to_string(const rte_ether_addr mac) { std::stringstream ss; ss std::hex std::setfill(0); for (int i 0; i RTE_ETHER_ADDR_LEN; i) { ss std::setw(2) static_castint(mac.addr_bytes[i]); if (i RTE_ETHER_ADDR_LEN - 1) ss :; } return ss.str(); } std::string ip_to_string(uint32_t ip_be) { uint32_t ip ntohl(ip_be); // Convert from network byte order to host byte order std::stringstream ss; ss ((ip 24) 0xFF) . ((ip 16) 0xFF) . ((ip 8) 0xFF) . (ip 0xFF); return ss.str(); } uint32_t string_to_ip(const std::string ip_str) { std::istringstream iss(ip_str); std::string segment; uint32_t ip 0; for (int i 0; i 4; i) { std::getline(iss, segment, .); ip (ip 8) | std::stoul(segment); } return htonl(ip); // Convert to network byte order } // Global logger for thread-safe output std::mutex log_mutex; void log_message(const std::string msg) { std::lock_guardstd::mutex lock(log_mutex); std::cout [LCORE rte_lcore_id() ] msg std::endl; } // --- C Userspace Network Library Core Components --- // 1. Packet Buffer Abstraction (Wrapper for rte_mbuf) class PacketBuffer { public: PacketBuffer(rte_mbuf* mbuf) : mbuf_(mbuf) {} // No copy constructor/assignment for efficiency and ownership clarity PacketBuffer(const PacketBuffer) delete; PacketBuffer operator(const PacketBuffer) delete; // Move constructor PacketBuffer(PacketBuffer other) noexcept : mbuf_(other.mbuf_) { other.mbuf_ nullptr; } // Move assignment PacketBuffer operator(PacketBuffer other) noexcept { if (this ! other) { if (mbuf_) rte_pktmbuf_free(mbuf_); // Free existing mbuf if any mbuf_ other.mbuf_; other.mbuf_ nullptr; } return *this; } ~PacketBuffer() { if (mbuf_) { rte_pktmbuf_free(mbuf_); } } template typename T T* get_header() { if (!mbuf_) return nullptr; return mbuf_-get_dataT(); } uint32_t get_length() const { return mbuf_ ? mbuf_-pkt_len : 0; } void adjust_head(int32_t len) { if (!mbuf_) return; if (len 0) { // Prepend mbuf_-prepend_data(len); } else if (len 0) { // Remove from head mbuf_-remove_data(-len); } } rte_mbuf* get_rte_mbuf() const { return mbuf_; } // For creating a new packet (e.g., for transmission) static PacketBuffer create(rte_mempool_t mempool, uint16_t size) { // In a real DPDK app, this would be rte_pktmbuf_alloc(mempool) rte_mbuf* mbuf new rte_mbuf(); mbuf-pool mempool; // Associate with a mempool mbuf-buf_addr new char[2048]; // Max packet size mbuf-data_off 0; // Start at the beginning for new packets mbuf-pkt_len size; mbuf-data_len size; return PacketBuffer(mbuf); } private: rte_mbuf* mbuf_; }; // 2. DPDK Port Abstraction class DpdkPort { public: DpdkPort(rte_port_id_t port_id, rte_mempool_t mempool, uint16_t rx_queues 1, uint16_t tx_queues 1) : port_id_(port_id), mempool_(mempool), rx_queues_(rx_queues), tx_queues_(tx_queues) {} bool init() { // Mock eth_dev_info_get void* dev_info_mock nullptr; // In real DPDK, this would be rte_eth_dev_info if (rte_eth_dev_info_get(port_id_, dev_info_mock) 0) { log_message(Failed to get device info for port std::to_string(port_id_)); return false; } // Mock eth_conf void* eth_conf_mock nullptr; // In real DPDK, this would be rte_eth_conf if (rte_eth_dev_configure(port_id_, rx_queues_, tx_queues_, eth_conf_mock) 0) { log_message(Failed to configure port std::to_string(port_id_)); return false; } for (uint16_t i 0; i rx_queues_; i) { // Mock rx_conf void* rx_conf_mock nullptr; // In real DPDK, this would be rte_eth_rxconf if (rte_eth_rx_queue_setup(port_id_, i, 128, 0, rx_conf_mock, mempool_) 0) { // 128 descriptors, socket_id 0 log_message(Failed to setup RX queue std::to_string(i) for port std::to_string(port_id_)); return false; } } for (uint16_t i 0; i tx_queues_; i) { // Mock tx_conf void* tx_conf_mock nullptr; // In real DPDK, this would be rte_eth_txconf if (rte_eth_tx_queue_setup(port_id_, i, 128, 0, tx_conf_mock) 0) { // 128 descriptors, socket_id 0 log_message(Failed to setup TX queue std::to_string(i) for port std::to_string(port_id_)); return false; } } if (rte_eth_dev_start(port_id_) 0) { log_message(Failed to start port std::to_string(port_id_)); return false; } rte_eth_dev_set_promisc(port_id_, 1); // Enable promiscuous mode rte_eth_macaddr_get(port_id_, mac_addr_); log_message(Port std::to_string(port_id_) initialized. MAC: mac_to_string(mac_addr_)); return true; } uint16_t receive_packets(uint16_t queue_id, PacketBuffer* pkts[], uint16_t nb_pkts) { std::arrayrte_mbuf*, 32 mbufs; // Max burst size uint16_t num_rx rte_eth_rx_burst(port_id_, queue_id, mbufs.data(), std::min((uint16_t)mbufs.size(), nb_pkts)); for (uint16_t i 0; i num_rx; i) { pkts[i] new PacketBuffer(mbufs[i]); // Allocate PacketBuffer wrapper } return num_rx; } uint16_t send_packets(uint16_t queue_id, PacketBuffer* pkts[], uint16_t nb_pkts) { std::arrayrte_mbuf*, 32 mbufs; for (uint16_t i 0; i nb_pkts; i) { mbufs[i] pkts[i]-get_rte_mbuf(); // Important: After calling get_rte_mbuf(), PacketBuffer no longer owns the mbuf. // Set its internal pointer to nullptr to prevent double-free. *(const_castrte_mbuf**(pkts[i]-get_rte_mbuf())) nullptr; // Hack to clear the internal mbuf_ ptr delete pkts[i]; // Delete the PacketBuffer wrapper } uint16_t num_tx rte_eth_tx_burst(port_id_, queue_id, mbufs.data(), nb_pkts); return num_tx; } const rte_ether_addr get_mac_addr() const { return mac_addr_; } rte_port_id_t get_port_id() const { return port_id_; } private: rte_port_id_t port_id_; rte_mempool_t mempool_; uint16_t rx_queues_; uint16_t tx_queues_; rte_ether_addr mac_addr_; }; // 3. Protocol Handler Interface class PacketProcessor { public: virtual ~PacketProcessor() default; // Process a packet. Returns true if packet is consumed/handled, false if it should be passed to next handler. virtual bool process_packet(PacketBuffer pkt, DpdkPort port) 0; }; // 4. ARP Protocol Handler class ArpHandler : public PacketProcessor { public: ArpHandler(uint32_t local_ip, const rte_ether_addr local_mac, rte_mempool_t mempool) : local_ip_(local_ip), local_mac_(local_mac), mempool_(mempool) { log_message(ARP Handler initialized with IP: ip_to_string(local_ip_) , MAC: mac_to_string(local_mac_)); } bool process_packet(PacketBuffer pkt, DpdkPort port) override { rte_ether_hdr* eth_hdr pkt.get_headerrte_ether_hdr(); if (!eth_hdr || ntohs(eth_hdr-ether_type) ! RTE_ETHER_TYPE_ARP) { return false; // Not an ARP packet, pass to next handler } rte_arp_hdr* arp_hdr reinterpret_castrte_arp_hdr*(static_castchar*(eth_hdr) sizeof(rte_ether_hdr)); if (!arp_hdr) { log_message(Corrupt ARP packet received.); rte_pktmbuf_free(pkt.get_rte_mbuf()); // Free the mbuf explicitly return true; } log_message(Received ARP packet. Op: std::to_string(ntohs(arp_hdr-op)) , Sender IP: ip_to_string(arp_hdr-sender_ip) , Target IP: ip_to_string(arp_hdr-target_ip)); if (ntohs(arp_hdr-op) 1 arp_hdr-target_ip local_ip_) { // ARP Request for our IP log_message(Received ARP Request for our IP. Sending ARP Reply.); send_arp_reply(port, arp_hdr-sender_ip, arp_hdr-sender_mac); } else if (ntohs(arp_hdr-op) 2 arp_hdr-target_ip local_ip_) { // ARP Reply for our IP // Update ARP cache (simplified for demo) log_message(Received ARP Reply from ip_to_string(arp_hdr-sender_ip) with MAC: mac_to_string(arp_hdr-sender_mac)); // In a real system, youd update an ArpCache here. } return true; // ARP packet handled } void send_arp_request(DpdkPort port, uint32_t target_ip) { uint16_t packet_size sizeof(rte_ether_hdr) sizeof(rte_arp_hdr); PacketBuffer pkt PacketBuffer::create(mempool_, packet_size); if (!pkt.get_rte_mbuf()) { log_message(Failed to allocate mbuf for ARP request.); return; } rte_ether_hdr* eth_hdr pkt.get_headerrte_ether_hdr(); rte_arp_hdr* arp_hdr reinterpret_castrte_arp_hdr*(static_castchar*(eth_hdr) sizeof(rte_ether_hdr)); // Ethernet Header eth_hdr-dst_addr {0xFF, 0xFF, 0xFF, 0xFF, 0xFF, 0xFF}; // Broadcast eth_hdr-src_addr local_mac_; eth_hdr-ether_type htons(RTE_ETHER_TYPE_ARP); // ARP Header arp_hdr-hrd htons(1); // Ethernet arp_hdr-pro htons(RTE_ETHER_TYPE_IPV4); // IPv4 arp_hdr-hln RTE_ETHER_ADDR_LEN; arp_hdr-pln 4; // IPv4 address length arp_hdr-op htons(1); // ARP Request arp_hdr-sender_mac local_mac_; arp_hdr-sender_ip local_ip_; arp_hdr-target_mac {0x00, 0x0

本文来自互联网用户投稿,该文观点仅代表作者本人,不代表本站立场。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如若转载,请注明出处:http://www.coloradmin.cn/o/2474858.html

如若内容造成侵权/违法违规/事实不符,请联系多彩编程网进行投诉反馈,一经查实,立即删除!

相关文章

SpringBoot-17-MyBatis动态SQL标签之常用标签

文章目录 1 代码1.1 实体User.java1.2 接口UserMapper.java1.3 映射UserMapper.xml1.3.1 标签if1.3.2 标签if和where1.3.3 标签choose和when和otherwise1.4 UserController.java2 常用动态SQL标签2.1 标签set2.1.1 UserMapper.java2.1.2 UserMapper.xml2.1.3 UserController.ja…

wordpress后台更新后 前端没变化的解决方法

使用siteground主机的wordpress网站,会出现更新了网站内容和修改了php模板文件、js文件、css文件、图片文件后,网站没有变化的情况。 不熟悉siteground主机的新手,遇到这个问题,就很抓狂,明明是哪都没操作错误&#x…

网络编程(Modbus进阶)

思维导图 Modbus RTU(先学一点理论) 概念 Modbus RTU 是工业自动化领域 最广泛应用的串行通信协议,由 Modicon 公司(现施耐德电气)于 1979 年推出。它以 高效率、强健性、易实现的特点成为工业控制系统的通信标准。 包…

UE5 学习系列(二)用户操作界面及介绍

这篇博客是 UE5 学习系列博客的第二篇,在第一篇的基础上展开这篇内容。博客参考的 B 站视频资料和第一篇的链接如下: 【Note】:如果你已经完成安装等操作,可以只执行第一篇博客中 2. 新建一个空白游戏项目 章节操作,重…

IDEA运行Tomcat出现乱码问题解决汇总

最近正值期末周,有很多同学在写期末Java web作业时,运行tomcat出现乱码问题,经过多次解决与研究,我做了如下整理: 原因: IDEA本身编码与tomcat的编码与Windows编码不同导致,Windows 系统控制台…

利用最小二乘法找圆心和半径

#include <iostream> #include <vector> #include <cmath> #include <Eigen/Dense> // 需安装Eigen库用于矩阵运算 // 定义点结构 struct Point { double x, y; Point(double x_, double y_) : x(x_), y(y_) {} }; // 最小二乘法求圆心和半径 …

使用docker在3台服务器上搭建基于redis 6.x的一主两从三台均是哨兵模式

一、环境及版本说明 如果服务器已经安装了docker,则忽略此步骤,如果没有安装,则可以按照一下方式安装: 1. 在线安装(有互联网环境): 请看我这篇文章 传送阵>> 点我查看 2. 离线安装(内网环境):请看我这篇文章 传送阵>> 点我查看 说明&#xff1a;假设每台服务器已…

XML Group端口详解

在XML数据映射过程中&#xff0c;经常需要对数据进行分组聚合操作。例如&#xff0c;当处理包含多个物料明细的XML文件时&#xff0c;可能需要将相同物料号的明细归为一组&#xff0c;或对相同物料号的数量进行求和计算。传统实现方式通常需要编写脚本代码&#xff0c;增加了开…

LBE-LEX系列工业语音播放器|预警播报器|喇叭蜂鸣器的上位机配置操作说明

LBE-LEX系列工业语音播放器|预警播报器|喇叭蜂鸣器专为工业环境精心打造&#xff0c;完美适配AGV和无人叉车。同时&#xff0c;集成以太网与语音合成技术&#xff0c;为各类高级系统&#xff08;如MES、调度系统、库位管理、立库等&#xff09;提供高效便捷的语音交互体验。 L…

(LeetCode 每日一题) 3442. 奇偶频次间的最大差值 I (哈希、字符串)

题目&#xff1a;3442. 奇偶频次间的最大差值 I 思路 &#xff1a;哈希&#xff0c;时间复杂度0(n)。 用哈希表来记录每个字符串中字符的分布情况&#xff0c;哈希表这里用数组即可实现。 C版本&#xff1a; class Solution { public:int maxDifference(string s) {int a[26]…

【大模型RAG】拍照搜题技术架构速览:三层管道、两级检索、兜底大模型

摘要 拍照搜题系统采用“三层管道&#xff08;多模态 OCR → 语义检索 → 答案渲染&#xff09;、两级检索&#xff08;倒排 BM25 向量 HNSW&#xff09;并以大语言模型兜底”的整体框架&#xff1a; 多模态 OCR 层 将题目图片经过超分、去噪、倾斜校正后&#xff0c;分别用…

【Axure高保真原型】引导弹窗

今天和大家中分享引导弹窗的原型模板&#xff0c;载入页面后&#xff0c;会显示引导弹窗&#xff0c;适用于引导用户使用页面&#xff0c;点击完成后&#xff0c;会显示下一个引导弹窗&#xff0c;直至最后一个引导弹窗完成后进入首页。具体效果可以点击下方视频观看或打开下方…

接口测试中缓存处理策略

在接口测试中&#xff0c;缓存处理策略是一个关键环节&#xff0c;直接影响测试结果的准确性和可靠性。合理的缓存处理策略能够确保测试环境的一致性&#xff0c;避免因缓存数据导致的测试偏差。以下是接口测试中常见的缓存处理策略及其详细说明&#xff1a; 一、缓存处理的核…

龙虎榜——20250610

上证指数放量收阴线&#xff0c;个股多数下跌&#xff0c;盘中受消息影响大幅波动。 深证指数放量收阴线形成顶分型&#xff0c;指数短线有调整的需求&#xff0c;大概需要一两天。 2025年6月10日龙虎榜行业方向分析 1. 金融科技 代表标的&#xff1a;御银股份、雄帝科技 驱动…

观成科技:隐蔽隧道工具Ligolo-ng加密流量分析

1.工具介绍 Ligolo-ng是一款由go编写的高效隧道工具&#xff0c;该工具基于TUN接口实现其功能&#xff0c;利用反向TCP/TLS连接建立一条隐蔽的通信信道&#xff0c;支持使用Let’s Encrypt自动生成证书。Ligolo-ng的通信隐蔽性体现在其支持多种连接方式&#xff0c;适应复杂网…

铭豹扩展坞 USB转网口 突然无法识别解决方法

当 USB 转网口扩展坞在一台笔记本上无法识别,但在其他电脑上正常工作时,问题通常出在笔记本自身或其与扩展坞的兼容性上。以下是系统化的定位思路和排查步骤,帮助你快速找到故障原因: 背景: 一个M-pard(铭豹)扩展坞的网卡突然无法识别了,扩展出来的三个USB接口正常。…

未来机器人的大脑:如何用神经网络模拟器实现更智能的决策?

编辑&#xff1a;陈萍萍的公主一点人工一点智能 未来机器人的大脑&#xff1a;如何用神经网络模拟器实现更智能的决策&#xff1f;RWM通过双自回归机制有效解决了复合误差、部分可观测性和随机动力学等关键挑战&#xff0c;在不依赖领域特定归纳偏见的条件下实现了卓越的预测准…

Linux应用开发之网络套接字编程(实例篇)

服务端与客户端单连接 服务端代码 #include <sys/socket.h> #include <sys/types.h> #include <netinet/in.h> #include <stdio.h> #include <stdlib.h> #include <string.h> #include <arpa/inet.h> #include <pthread.h> …

华为云AI开发平台ModelArts

华为云ModelArts&#xff1a;重塑AI开发流程的“智能引擎”与“创新加速器”&#xff01; 在人工智能浪潮席卷全球的2025年&#xff0c;企业拥抱AI的意愿空前高涨&#xff0c;但技术门槛高、流程复杂、资源投入巨大的现实&#xff0c;却让许多创新构想止步于实验室。数据科学家…

深度学习在微纳光子学中的应用

深度学习在微纳光子学中的主要应用方向 深度学习与微纳光子学的结合主要集中在以下几个方向&#xff1a; 逆向设计 通过神经网络快速预测微纳结构的光学响应&#xff0c;替代传统耗时的数值模拟方法。例如设计超表面、光子晶体等结构。 特征提取与优化 从复杂的光学数据中自…