登录
首页 » C++ » sk_buff

sk_buff

于 2013-11-23 发布 文件大小:2KB
0 162
下载积分: 1 下载次数: 1

代码说明:

  sk_buff结构体,网络数据包传送,在内核中sk_buff表示一个网络数据包,它是一个双向链表,而链表头就是sk_buff_head,(sk_buff structure, network packet transmission, the kernel sk_buff represents a network packet, which is a doubly linked list, and the list head is sk_buff_head,)

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • 一个有关于VC++6.0与ACCESS库的小程序
    一个有关于VC++6.0与ACCESS数据库的小程序-1 on VC++6.0 and the ACCESS database, a small program
    2022-01-26 05:46:28下载
    积分:1
  • 设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函输入进行测试...
    设计邻接表类,实现无向图的深度优先非递归遍历,无向图的广度优先遍历,并设计主函数输入数据进行测试-Design category adjacency list, realize undirected graph of the depth-first traversal non-recursive, non-directed graph breadth-first traversal, and the design of the main function of the input data for testing
    2022-09-01 23:30:03下载
    积分:1
  • datastructureandc
    本书详细的说明了数据结构用c的实现,pdf格式,不可错过的一本好书。(The book describes in detail the data structure using c realization, pdf format, not to be missed in a good book.)
    2009-04-19 22:01:04下载
    积分:1
  • 本文章首先简要介绍了一维与二维情况下的最接近点对问题与所涉及到的解决算法.然后,把最接近点对问题延伸至三维,提出了自己的解决思想,并提供了相关伪代码,以供参考....
    本文章首先简要介绍了一维与二维情况下的最接近点对问题与所涉及到的解决算法.然后,把最接近点对问题延伸至三维,提出了自己的解决思想,并提供了相关伪代码,以供参考.请各位朋友多提建议!-err
    2023-06-26 16:35:04下载
    积分:1
  • 集装箱的装箱问题 给定一个集装箱,其长为L,宽为W和高为H,现有一批圆柱形木材,每根木材的长均为L,但是半径不同,设第i根木材半径为ri。问如何装箱,使得...
    集装箱的装箱问题 给定一个集装箱,其长为L,宽为W和高为H,现有一批圆柱形木材,每根木材的长均为L,但是半径不同,设第i根木材半径为ri。问如何装箱,使得集装箱的空间利用率最高?-problem given a container, its length L, width W and H for high, existing batch of cylindrical wood and each timber are long L, but different radius, based i-radius of the wood-ri. Asked how crates, containers make maximum utilization of space?
    2023-05-27 04:50:03下载
    积分:1
  • Figure-topological-sort
    说明:  拓扑排序   对一个 有向无环图 G进行拓扑排序,是将G中所有顶点排成一个线性序列,使得图中任 意一对顶点u和v,若u,v ∈E,则u在线性序列中出现在v之前。   通常,这样的线性序列称为满足拓扑次序的序列,简称 拓扑序列 。 注意:   ①若将图中顶点按拓扑次序排成一行,则图中所有的有向边均是从左指向右的。   ②若图中存在有向环,则不可能使顶点满足拓扑次序。   ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分:1
  • 南开大学库大作业
    用Java连接数据库实现数据的插入,删除,查找,修改等功能
    2022-07-28 05:35:08下载
    积分:1
  • Ex1
    从屏幕输入字符 判断括号匹配问题 数据结构作业(Judgment parenthesis matching data structure operations input characters from the screen)
    2012-11-27 15:17:10下载
    积分:1
  • youlishi
    有理数的算法,包括其加减乘除,启用的是单链表的形式来表达(Rational algorithms, including addition, subtraction, enabling a single-chain form of expression)
    2011-10-13 10:00:21下载
    积分:1
  • C-18-typical-classic-program
    C语言18个经典程序,算法。可以用到很多场合(18 typical programs. Could use in many situations)
    2014-04-21 21:21:17下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载