packet_mmap.txt 20 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528
  1. --------------------------------------------------------------------------------
  2. + ABSTRACT
  3. --------------------------------------------------------------------------------
  4. This file documents the mmap() facility available with the PACKET
  5. socket interface on 2.4 and 2.6 kernels. This type of sockets is used for
  6. capture network traffic with utilities like tcpdump or any other that needs
  7. raw access to network interface.
  8. You can find the latest version of this document at:
  9. http://wiki.ipxwarzone.com/index.php5?title=Linux_packet_mmap
  10. Howto can be found at:
  11. http://wiki.gnu-log.net (packet_mmap)
  12. Please send your comments to
  13. Ulisses Alonso Camaró <uaca@i.hate.spam.alumni.uv.es>
  14. Johann Baudy <johann.baudy@gnu-log.net>
  15. -------------------------------------------------------------------------------
  16. + Why use PACKET_MMAP
  17. --------------------------------------------------------------------------------
  18. In Linux 2.4/2.6 if PACKET_MMAP is not enabled, the capture process is very
  19. inefficient. It uses very limited buffers and requires one system call
  20. to capture each packet, it requires two if you want to get packet's
  21. timestamp (like libpcap always does).
  22. In the other hand PACKET_MMAP is very efficient. PACKET_MMAP provides a size
  23. configurable circular buffer mapped in user space that can be used to either
  24. send or receive packets. This way reading packets just needs to wait for them,
  25. most of the time there is no need to issue a single system call. Concerning
  26. transmission, multiple packets can be sent through one system call to get the
  27. highest bandwidth.
  28. By using a shared buffer between the kernel and the user also has the benefit
  29. of minimizing packet copies.
  30. It's fine to use PACKET_MMAP to improve the performance of the capture and
  31. transmission process, but it isn't everything. At least, if you are capturing
  32. at high speeds (this is relative to the cpu speed), you should check if the
  33. device driver of your network interface card supports some sort of interrupt
  34. load mitigation or (even better) if it supports NAPI, also make sure it is
  35. enabled. For transmission, check the MTU (Maximum Transmission Unit) used and
  36. supported by devices of your network.
  37. --------------------------------------------------------------------------------
  38. + How to use mmap() to improve capture process
  39. --------------------------------------------------------------------------------
  40. From the user standpoint, you should use the higher level libpcap library, which
  41. is a de facto standard, portable across nearly all operating systems
  42. including Win32.
  43. Said that, at time of this writing, official libpcap 0.8.1 is out and doesn't include
  44. support for PACKET_MMAP, and also probably the libpcap included in your distribution.
  45. I'm aware of two implementations of PACKET_MMAP in libpcap:
  46. http://wiki.ipxwarzone.com/ (by Simon Patarin, based on libpcap 0.6.2)
  47. http://public.lanl.gov/cpw/ (by Phil Wood, based on lastest libpcap)
  48. The rest of this document is intended for people who want to understand
  49. the low level details or want to improve libpcap by including PACKET_MMAP
  50. support.
  51. --------------------------------------------------------------------------------
  52. + How to use mmap() directly to improve capture process
  53. --------------------------------------------------------------------------------
  54. From the system calls stand point, the use of PACKET_MMAP involves
  55. the following process:
  56. [setup] socket() -------> creation of the capture socket
  57. setsockopt() ---> allocation of the circular buffer (ring)
  58. option: PACKET_RX_RING
  59. mmap() ---------> mapping of the allocated buffer to the
  60. user process
  61. [capture] poll() ---------> to wait for incoming packets
  62. [shutdown] close() --------> destruction of the capture socket and
  63. deallocation of all associated
  64. resources.
  65. socket creation and destruction is straight forward, and is done
  66. the same way with or without PACKET_MMAP:
  67. int fd;
  68. fd= socket(PF_PACKET, mode, htons(ETH_P_ALL))
  69. where mode is SOCK_RAW for the raw interface were link level
  70. information can be captured or SOCK_DGRAM for the cooked
  71. interface where link level information capture is not
  72. supported and a link level pseudo-header is provided
  73. by the kernel.
  74. The destruction of the socket and all associated resources
  75. is done by a simple call to close(fd).
  76. Next I will describe PACKET_MMAP settings and its constraints,
  77. also the mapping of the circular buffer in the user process and
  78. the use of this buffer.
  79. --------------------------------------------------------------------------------
  80. + How to use mmap() directly to improve transmission process
  81. --------------------------------------------------------------------------------
  82. Transmission process is similar to capture as shown below.
  83. [setup] socket() -------> creation of the transmission socket
  84. setsockopt() ---> allocation of the circular buffer (ring)
  85. option: PACKET_TX_RING
  86. bind() ---------> bind transmission socket with a network interface
  87. mmap() ---------> mapping of the allocated buffer to the
  88. user process
  89. [transmission] poll() ---------> wait for free packets (optional)
  90. send() ---------> send all packets that are set as ready in
  91. the ring
  92. The flag MSG_DONTWAIT can be used to return
  93. before end of transfer.
  94. [shutdown] close() --------> destruction of the transmission socket and
  95. deallocation of all associated resources.
  96. Binding the socket to your network interface is mandatory (with zero copy) to
  97. know the header size of frames used in the circular buffer.
  98. As capture, each frame contains two parts:
  99. --------------------
  100. | struct tpacket_hdr | Header. It contains the status of
  101. | | of this frame
  102. |--------------------|
  103. | data buffer |
  104. . . Data that will be sent over the network interface.
  105. . .
  106. --------------------
  107. bind() associates the socket to your network interface thanks to
  108. sll_ifindex parameter of struct sockaddr_ll.
  109. Initialization example:
  110. struct sockaddr_ll my_addr;
  111. struct ifreq s_ifr;
  112. ...
  113. strncpy (s_ifr.ifr_name, "eth0", sizeof(s_ifr.ifr_name));
  114. /* get interface index of eth0 */
  115. ioctl(this->socket, SIOCGIFINDEX, &s_ifr);
  116. /* fill sockaddr_ll struct to prepare binding */
  117. my_addr.sll_family = AF_PACKET;
  118. my_addr.sll_protocol = htons(ETH_P_ALL);
  119. my_addr.sll_ifindex = s_ifr.ifr_ifindex;
  120. /* bind socket to eth0 */
  121. bind(this->socket, (struct sockaddr *)&my_addr, sizeof(struct sockaddr_ll));
  122. A complete tutorial is available at: http://wiki.gnu-log.net/
  123. --------------------------------------------------------------------------------
  124. + PACKET_MMAP settings
  125. --------------------------------------------------------------------------------
  126. To setup PACKET_MMAP from user level code is done with a call like
  127. - Capture process
  128. setsockopt(fd, SOL_PACKET, PACKET_RX_RING, (void *) &req, sizeof(req))
  129. - Transmission process
  130. setsockopt(fd, SOL_PACKET, PACKET_TX_RING, (void *) &req, sizeof(req))
  131. The most significant argument in the previous call is the req parameter,
  132. this parameter must to have the following structure:
  133. struct tpacket_req
  134. {
  135. unsigned int tp_block_size; /* Minimal size of contiguous block */
  136. unsigned int tp_block_nr; /* Number of blocks */
  137. unsigned int tp_frame_size; /* Size of frame */
  138. unsigned int tp_frame_nr; /* Total number of frames */
  139. };
  140. This structure is defined in /usr/include/linux/if_packet.h and establishes a
  141. circular buffer (ring) of unswappable memory.
  142. Being mapped in the capture process allows reading the captured frames and
  143. related meta-information like timestamps without requiring a system call.
  144. Frames are grouped in blocks. Each block is a physically contiguous
  145. region of memory and holds tp_block_size/tp_frame_size frames. The total number
  146. of blocks is tp_block_nr. Note that tp_frame_nr is a redundant parameter because
  147. frames_per_block = tp_block_size/tp_frame_size
  148. indeed, packet_set_ring checks that the following condition is true
  149. frames_per_block * tp_block_nr == tp_frame_nr
  150. Lets see an example, with the following values:
  151. tp_block_size= 4096
  152. tp_frame_size= 2048
  153. tp_block_nr = 4
  154. tp_frame_nr = 8
  155. we will get the following buffer structure:
  156. block #1 block #2
  157. +---------+---------+ +---------+---------+
  158. | frame 1 | frame 2 | | frame 3 | frame 4 |
  159. +---------+---------+ +---------+---------+
  160. block #3 block #4
  161. +---------+---------+ +---------+---------+
  162. | frame 5 | frame 6 | | frame 7 | frame 8 |
  163. +---------+---------+ +---------+---------+
  164. A frame can be of any size with the only condition it can fit in a block. A block
  165. can only hold an integer number of frames, or in other words, a frame cannot
  166. be spawned across two blocks, so there are some details you have to take into
  167. account when choosing the frame_size. See "Mapping and use of the circular
  168. buffer (ring)".
  169. --------------------------------------------------------------------------------
  170. + PACKET_MMAP setting constraints
  171. --------------------------------------------------------------------------------
  172. In kernel versions prior to 2.4.26 (for the 2.4 branch) and 2.6.5 (2.6 branch),
  173. the PACKET_MMAP buffer could hold only 32768 frames in a 32 bit architecture or
  174. 16384 in a 64 bit architecture. For information on these kernel versions
  175. see http://pusa.uv.es/~ulisses/packet_mmap/packet_mmap.pre-2.4.26_2.6.5.txt
  176. Block size limit
  177. ------------------
  178. As stated earlier, each block is a contiguous physical region of memory. These
  179. memory regions are allocated with calls to the __get_free_pages() function. As
  180. the name indicates, this function allocates pages of memory, and the second
  181. argument is "order" or a power of two number of pages, that is
  182. (for PAGE_SIZE == 4096) order=0 ==> 4096 bytes, order=1 ==> 8192 bytes,
  183. order=2 ==> 16384 bytes, etc. The maximum size of a
  184. region allocated by __get_free_pages is determined by the MAX_ORDER macro. More
  185. precisely the limit can be calculated as:
  186. PAGE_SIZE << MAX_ORDER
  187. In a i386 architecture PAGE_SIZE is 4096 bytes
  188. In a 2.4/i386 kernel MAX_ORDER is 10
  189. In a 2.6/i386 kernel MAX_ORDER is 11
  190. So get_free_pages can allocate as much as 4MB or 8MB in a 2.4/2.6 kernel
  191. respectively, with an i386 architecture.
  192. User space programs can include /usr/include/sys/user.h and
  193. /usr/include/linux/mmzone.h to get PAGE_SIZE MAX_ORDER declarations.
  194. The pagesize can also be determined dynamically with the getpagesize (2)
  195. system call.
  196. Block number limit
  197. --------------------
  198. To understand the constraints of PACKET_MMAP, we have to see the structure
  199. used to hold the pointers to each block.
  200. Currently, this structure is a dynamically allocated vector with kmalloc
  201. called pg_vec, its size limits the number of blocks that can be allocated.
  202. +---+---+---+---+
  203. | x | x | x | x |
  204. +---+---+---+---+
  205. | | | |
  206. | | | v
  207. | | v block #4
  208. | v block #3
  209. v block #2
  210. block #1
  211. kmalloc allocates any number of bytes of physically contiguous memory from
  212. a pool of pre-determined sizes. This pool of memory is maintained by the slab
  213. allocator which is at the end the responsible for doing the allocation and
  214. hence which imposes the maximum memory that kmalloc can allocate.
  215. In a 2.4/2.6 kernel and the i386 architecture, the limit is 131072 bytes. The
  216. predetermined sizes that kmalloc uses can be checked in the "size-<bytes>"
  217. entries of /proc/slabinfo
  218. In a 32 bit architecture, pointers are 4 bytes long, so the total number of
  219. pointers to blocks is
  220. 131072/4 = 32768 blocks
  221. PACKET_MMAP buffer size calculator
  222. ------------------------------------
  223. Definitions:
  224. <size-max> : is the maximum size of allocable with kmalloc (see /proc/slabinfo)
  225. <pointer size>: depends on the architecture -- sizeof(void *)
  226. <page size> : depends on the architecture -- PAGE_SIZE or getpagesize (2)
  227. <max-order> : is the value defined with MAX_ORDER
  228. <frame size> : it's an upper bound of frame's capture size (more on this later)
  229. from these definitions we will derive
  230. <block number> = <size-max>/<pointer size>
  231. <block size> = <pagesize> << <max-order>
  232. so, the max buffer size is
  233. <block number> * <block size>
  234. and, the number of frames be
  235. <block number> * <block size> / <frame size>
  236. Suppose the following parameters, which apply for 2.6 kernel and an
  237. i386 architecture:
  238. <size-max> = 131072 bytes
  239. <pointer size> = 4 bytes
  240. <pagesize> = 4096 bytes
  241. <max-order> = 11
  242. and a value for <frame size> of 2048 bytes. These parameters will yield
  243. <block number> = 131072/4 = 32768 blocks
  244. <block size> = 4096 << 11 = 8 MiB.
  245. and hence the buffer will have a 262144 MiB size. So it can hold
  246. 262144 MiB / 2048 bytes = 134217728 frames
  247. Actually, this buffer size is not possible with an i386 architecture.
  248. Remember that the memory is allocated in kernel space, in the case of
  249. an i386 kernel's memory size is limited to 1GiB.
  250. All memory allocations are not freed until the socket is closed. The memory
  251. allocations are done with GFP_KERNEL priority, this basically means that
  252. the allocation can wait and swap other process' memory in order to allocate
  253. the necessary memory, so normally limits can be reached.
  254. Other constraints
  255. -------------------
  256. If you check the source code you will see that what I draw here as a frame
  257. is not only the link level frame. At the beginning of each frame there is a
  258. header called struct tpacket_hdr used in PACKET_MMAP to hold link level's frame
  259. meta information like timestamp. So what we draw here a frame it's really
  260. the following (from include/linux/if_packet.h):
  261. /*
  262. Frame structure:
  263. - Start. Frame must be aligned to TPACKET_ALIGNMENT=16
  264. - struct tpacket_hdr
  265. - pad to TPACKET_ALIGNMENT=16
  266. - struct sockaddr_ll
  267. - Gap, chosen so that packet data (Start+tp_net) aligns to
  268. TPACKET_ALIGNMENT=16
  269. - Start+tp_mac: [ Optional MAC header ]
  270. - Start+tp_net: Packet data, aligned to TPACKET_ALIGNMENT=16.
  271. - Pad to align to TPACKET_ALIGNMENT=16
  272. */
  273. The following are conditions that are checked in packet_set_ring
  274. tp_block_size must be a multiple of PAGE_SIZE (1)
  275. tp_frame_size must be greater than TPACKET_HDRLEN (obvious)
  276. tp_frame_size must be a multiple of TPACKET_ALIGNMENT
  277. tp_frame_nr must be exactly frames_per_block*tp_block_nr
  278. Note that tp_block_size should be chosen to be a power of two or there will
  279. be a waste of memory.
  280. --------------------------------------------------------------------------------
  281. + Mapping and use of the circular buffer (ring)
  282. --------------------------------------------------------------------------------
  283. The mapping of the buffer in the user process is done with the conventional
  284. mmap function. Even the circular buffer is compound of several physically
  285. discontiguous blocks of memory, they are contiguous to the user space, hence
  286. just one call to mmap is needed:
  287. mmap(0, size, PROT_READ|PROT_WRITE, MAP_SHARED, fd, 0);
  288. If tp_frame_size is a divisor of tp_block_size frames will be
  289. contiguously spaced by tp_frame_size bytes. If not, each
  290. tp_block_size/tp_frame_size frames there will be a gap between
  291. the frames. This is because a frame cannot be spawn across two
  292. blocks.
  293. At the beginning of each frame there is an status field (see
  294. struct tpacket_hdr). If this field is 0 means that the frame is ready
  295. to be used for the kernel, If not, there is a frame the user can read
  296. and the following flags apply:
  297. +++ Capture process:
  298. from include/linux/if_packet.h
  299. #define TP_STATUS_COPY 2
  300. #define TP_STATUS_LOSING 4
  301. #define TP_STATUS_CSUMNOTREADY 8
  302. TP_STATUS_COPY : This flag indicates that the frame (and associated
  303. meta information) has been truncated because it's
  304. larger than tp_frame_size. This packet can be
  305. read entirely with recvfrom().
  306. In order to make this work it must to be
  307. enabled previously with setsockopt() and
  308. the PACKET_COPY_THRESH option.
  309. The number of frames than can be buffered to
  310. be read with recvfrom is limited like a normal socket.
  311. See the SO_RCVBUF option in the socket (7) man page.
  312. TP_STATUS_LOSING : indicates there were packet drops from last time
  313. statistics where checked with getsockopt() and
  314. the PACKET_STATISTICS option.
  315. TP_STATUS_CSUMNOTREADY: currently it's used for outgoing IP packets which
  316. its checksum will be done in hardware. So while
  317. reading the packet we should not try to check the
  318. checksum.
  319. for convenience there are also the following defines:
  320. #define TP_STATUS_KERNEL 0
  321. #define TP_STATUS_USER 1
  322. The kernel initializes all frames to TP_STATUS_KERNEL, when the kernel
  323. receives a packet it puts in the buffer and updates the status with
  324. at least the TP_STATUS_USER flag. Then the user can read the packet,
  325. once the packet is read the user must zero the status field, so the kernel
  326. can use again that frame buffer.
  327. The user can use poll (any other variant should apply too) to check if new
  328. packets are in the ring:
  329. struct pollfd pfd;
  330. pfd.fd = fd;
  331. pfd.revents = 0;
  332. pfd.events = POLLIN|POLLRDNORM|POLLERR;
  333. if (status == TP_STATUS_KERNEL)
  334. retval = poll(&pfd, 1, timeout);
  335. It doesn't incur in a race condition to first check the status value and
  336. then poll for frames.
  337. ++ Transmission process
  338. Those defines are also used for transmission:
  339. #define TP_STATUS_AVAILABLE 0 // Frame is available
  340. #define TP_STATUS_SEND_REQUEST 1 // Frame will be sent on next send()
  341. #define TP_STATUS_SENDING 2 // Frame is currently in transmission
  342. #define TP_STATUS_WRONG_FORMAT 4 // Frame format is not correct
  343. First, the kernel initializes all frames to TP_STATUS_AVAILABLE. To send a
  344. packet, the user fills a data buffer of an available frame, sets tp_len to
  345. current data buffer size and sets its status field to TP_STATUS_SEND_REQUEST.
  346. This can be done on multiple frames. Once the user is ready to transmit, it
  347. calls send(). Then all buffers with status equal to TP_STATUS_SEND_REQUEST are
  348. forwarded to the network device. The kernel updates each status of sent
  349. frames with TP_STATUS_SENDING until the end of transfer.
  350. At the end of each transfer, buffer status returns to TP_STATUS_AVAILABLE.
  351. header->tp_len = in_i_size;
  352. header->tp_status = TP_STATUS_SEND_REQUEST;
  353. retval = send(this->socket, NULL, 0, 0);
  354. The user can also use poll() to check if a buffer is available:
  355. (status == TP_STATUS_SENDING)
  356. struct pollfd pfd;
  357. pfd.fd = fd;
  358. pfd.revents = 0;
  359. pfd.events = POLLOUT;
  360. retval = poll(&pfd, 1, timeout);
  361. -------------------------------------------------------------------------------
  362. + PACKET_TIMESTAMP
  363. -------------------------------------------------------------------------------
  364. The PACKET_TIMESTAMP setting determines the source of the timestamp in
  365. the packet meta information. If your NIC is capable of timestamping
  366. packets in hardware, you can request those hardware timestamps to used.
  367. Note: you may need to enable the generation of hardware timestamps with
  368. SIOCSHWTSTAMP.
  369. PACKET_TIMESTAMP accepts the same integer bit field as
  370. SO_TIMESTAMPING. However, only the SOF_TIMESTAMPING_SYS_HARDWARE
  371. and SOF_TIMESTAMPING_RAW_HARDWARE values are recognized by
  372. PACKET_TIMESTAMP. SOF_TIMESTAMPING_SYS_HARDWARE takes precedence over
  373. SOF_TIMESTAMPING_RAW_HARDWARE if both bits are set.
  374. int req = 0;
  375. req |= SOF_TIMESTAMPING_SYS_HARDWARE;
  376. setsockopt(fd, SOL_PACKET, PACKET_TIMESTAMP, (void *) &req, sizeof(req))
  377. If PACKET_TIMESTAMP is not set, a software timestamp generated inside
  378. the networking stack is used (the behavior before this setting was added).
  379. See include/linux/net_tstamp.h and Documentation/networking/timestamping
  380. for more information on hardware timestamps.
  381. --------------------------------------------------------------------------------
  382. + THANKS
  383. --------------------------------------------------------------------------------
  384. Jesse Brandeburg, for fixing my grammathical/spelling errors