relayfs.txt 19 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442
  1. relayfs - a high-speed data relay filesystem
  2. ============================================
  3. relayfs is a filesystem designed to provide an efficient mechanism for
  4. tools and facilities to relay large and potentially sustained streams
  5. of data from kernel space to user space.
  6. The main abstraction of relayfs is the 'channel'. A channel consists
  7. of a set of per-cpu kernel buffers each represented by a file in the
  8. relayfs filesystem. Kernel clients write into a channel using
  9. efficient write functions which automatically log to the current cpu's
  10. channel buffer. User space applications mmap() the per-cpu files and
  11. retrieve the data as it becomes available.
  12. The format of the data logged into the channel buffers is completely
  13. up to the relayfs client; relayfs does however provide hooks which
  14. allow clients to impose some structure on the buffer data. Nor does
  15. relayfs implement any form of data filtering - this also is left to
  16. the client. The purpose is to keep relayfs as simple as possible.
  17. This document provides an overview of the relayfs API. The details of
  18. the function parameters are documented along with the functions in the
  19. filesystem code - please see that for details.
  20. Semantics
  21. =========
  22. Each relayfs channel has one buffer per CPU, each buffer has one or
  23. more sub-buffers. Messages are written to the first sub-buffer until
  24. it is too full to contain a new message, in which case it it is
  25. written to the next (if available). Messages are never split across
  26. sub-buffers. At this point, userspace can be notified so it empties
  27. the first sub-buffer, while the kernel continues writing to the next.
  28. When notified that a sub-buffer is full, the kernel knows how many
  29. bytes of it are padding i.e. unused. Userspace can use this knowledge
  30. to copy only valid data.
  31. After copying it, userspace can notify the kernel that a sub-buffer
  32. has been consumed.
  33. relayfs can operate in a mode where it will overwrite data not yet
  34. collected by userspace, and not wait for it to consume it.
  35. relayfs itself does not provide for communication of such data between
  36. userspace and kernel, allowing the kernel side to remain simple and
  37. not impose a single interface on userspace. It does provide a set of
  38. examples and a separate helper though, described below.
  39. klog and relay-apps example code
  40. ================================
  41. relayfs itself is ready to use, but to make things easier, a couple
  42. simple utility functions and a set of examples are provided.
  43. The relay-apps example tarball, available on the relayfs sourceforge
  44. site, contains a set of self-contained examples, each consisting of a
  45. pair of .c files containing boilerplate code for each of the user and
  46. kernel sides of a relayfs application; combined these two sets of
  47. boilerplate code provide glue to easily stream data to disk, without
  48. having to bother with mundane housekeeping chores.
  49. The 'klog debugging functions' patch (klog.patch in the relay-apps
  50. tarball) provides a couple of high-level logging functions to the
  51. kernel which allow writing formatted text or raw data to a channel,
  52. regardless of whether a channel to write into exists or not, or
  53. whether relayfs is compiled into the kernel or is configured as a
  54. module. These functions allow you to put unconditional 'trace'
  55. statements anywhere in the kernel or kernel modules; only when there
  56. is a 'klog handler' registered will data actually be logged (see the
  57. klog and kleak examples for details).
  58. It is of course possible to use relayfs from scratch i.e. without
  59. using any of the relay-apps example code or klog, but you'll have to
  60. implement communication between userspace and kernel, allowing both to
  61. convey the state of buffers (full, empty, amount of padding).
  62. klog and the relay-apps examples can be found in the relay-apps
  63. tarball on http://relayfs.sourceforge.net
  64. The relayfs user space API
  65. ==========================
  66. relayfs implements basic file operations for user space access to
  67. relayfs channel buffer data. Here are the file operations that are
  68. available and some comments regarding their behavior:
  69. open() enables user to open an _existing_ buffer.
  70. mmap() results in channel buffer being mapped into the caller's
  71. memory space. Note that you can't do a partial mmap - you must
  72. map the entire file, which is NRBUF * SUBBUFSIZE.
  73. read() read the contents of a channel buffer. The bytes read are
  74. 'consumed' by the reader i.e. they won't be available again
  75. to subsequent reads. If the channel is being used in
  76. no-overwrite mode (the default), it can be read at any time
  77. even if there's an active kernel writer. If the channel is
  78. being used in overwrite mode and there are active channel
  79. writers, results may be unpredictable - users should make
  80. sure that all logging to the channel has ended before using
  81. read() with overwrite mode.
  82. poll() POLLIN/POLLRDNORM/POLLERR supported. User applications are
  83. notified when sub-buffer boundaries are crossed.
  84. close() decrements the channel buffer's refcount. When the refcount
  85. reaches 0 i.e. when no process or kernel client has the buffer
  86. open, the channel buffer is freed.
  87. In order for a user application to make use of relayfs files, the
  88. relayfs filesystem must be mounted. For example,
  89. mount -t relayfs relayfs /mnt/relay
  90. NOTE: relayfs doesn't need to be mounted for kernel clients to create
  91. or use channels - it only needs to be mounted when user space
  92. applications need access to the buffer data.
  93. The relayfs kernel API
  94. ======================
  95. Here's a summary of the API relayfs provides to in-kernel clients:
  96. channel management functions:
  97. relay_open(base_filename, parent, subbuf_size, n_subbufs,
  98. callbacks)
  99. relay_close(chan)
  100. relay_flush(chan)
  101. relay_reset(chan)
  102. relayfs_create_dir(name, parent)
  103. relayfs_remove_dir(dentry)
  104. relayfs_create_file(name, parent, mode, fops, data)
  105. relayfs_remove_file(dentry)
  106. channel management typically called on instigation of userspace:
  107. relay_subbufs_consumed(chan, cpu, subbufs_consumed)
  108. write functions:
  109. relay_write(chan, data, length)
  110. __relay_write(chan, data, length)
  111. relay_reserve(chan, length)
  112. callbacks:
  113. subbuf_start(buf, subbuf, prev_subbuf, prev_padding)
  114. buf_mapped(buf, filp)
  115. buf_unmapped(buf, filp)
  116. create_buf_file(filename, parent, mode, buf, is_global)
  117. remove_buf_file(dentry)
  118. helper functions:
  119. relay_buf_full(buf)
  120. subbuf_start_reserve(buf, length)
  121. Creating a channel
  122. ------------------
  123. relay_open() is used to create a channel, along with its per-cpu
  124. channel buffers. Each channel buffer will have an associated file
  125. created for it in the relayfs filesystem, which can be opened and
  126. mmapped from user space if desired. The files are named
  127. basename0...basenameN-1 where N is the number of online cpus, and by
  128. default will be created in the root of the filesystem. If you want a
  129. directory structure to contain your relayfs files, you can create it
  130. with relayfs_create_dir() and pass the parent directory to
  131. relay_open(). Clients are responsible for cleaning up any directory
  132. structure they create when the channel is closed - use
  133. relayfs_remove_dir() for that.
  134. The total size of each per-cpu buffer is calculated by multiplying the
  135. number of sub-buffers by the sub-buffer size passed into relay_open().
  136. The idea behind sub-buffers is that they're basically an extension of
  137. double-buffering to N buffers, and they also allow applications to
  138. easily implement random-access-on-buffer-boundary schemes, which can
  139. be important for some high-volume applications. The number and size
  140. of sub-buffers is completely dependent on the application and even for
  141. the same application, different conditions will warrant different
  142. values for these parameters at different times. Typically, the right
  143. values to use are best decided after some experimentation; in general,
  144. though, it's safe to assume that having only 1 sub-buffer is a bad
  145. idea - you're guaranteed to either overwrite data or lose events
  146. depending on the channel mode being used.
  147. Channel 'modes'
  148. ---------------
  149. relayfs channels can be used in either of two modes - 'overwrite' or
  150. 'no-overwrite'. The mode is entirely determined by the implementation
  151. of the subbuf_start() callback, as described below. In 'overwrite'
  152. mode, also known as 'flight recorder' mode, writes continuously cycle
  153. around the buffer and will never fail, but will unconditionally
  154. overwrite old data regardless of whether it's actually been consumed.
  155. In no-overwrite mode, writes will fail i.e. data will be lost, if the
  156. number of unconsumed sub-buffers equals the total number of
  157. sub-buffers in the channel. It should be clear that if there is no
  158. consumer or if the consumer can't consume sub-buffers fast enought,
  159. data will be lost in either case; the only difference is whether data
  160. is lost from the beginning or the end of a buffer.
  161. As explained above, a relayfs channel is made of up one or more
  162. per-cpu channel buffers, each implemented as a circular buffer
  163. subdivided into one or more sub-buffers. Messages are written into
  164. the current sub-buffer of the channel's current per-cpu buffer via the
  165. write functions described below. Whenever a message can't fit into
  166. the current sub-buffer, because there's no room left for it, the
  167. client is notified via the subbuf_start() callback that a switch to a
  168. new sub-buffer is about to occur. The client uses this callback to 1)
  169. initialize the next sub-buffer if appropriate 2) finalize the previous
  170. sub-buffer if appropriate and 3) return a boolean value indicating
  171. whether or not to actually go ahead with the sub-buffer switch.
  172. To implement 'no-overwrite' mode, the userspace client would provide
  173. an implementation of the subbuf_start() callback something like the
  174. following:
  175. static int subbuf_start(struct rchan_buf *buf,
  176. void *subbuf,
  177. void *prev_subbuf,
  178. unsigned int prev_padding)
  179. {
  180. if (prev_subbuf)
  181. *((unsigned *)prev_subbuf) = prev_padding;
  182. if (relay_buf_full(buf))
  183. return 0;
  184. subbuf_start_reserve(buf, sizeof(unsigned int));
  185. return 1;
  186. }
  187. If the current buffer is full i.e. all sub-buffers remain unconsumed,
  188. the callback returns 0 to indicate that the buffer switch should not
  189. occur yet i.e. until the consumer has had a chance to read the current
  190. set of ready sub-buffers. For the relay_buf_full() function to make
  191. sense, the consumer is reponsible for notifying relayfs when
  192. sub-buffers have been consumed via relay_subbufs_consumed(). Any
  193. subsequent attempts to write into the buffer will again invoke the
  194. subbuf_start() callback with the same parameters; only when the
  195. consumer has consumed one or more of the ready sub-buffers will
  196. relay_buf_full() return 0, in which case the buffer switch can
  197. continue.
  198. The implementation of the subbuf_start() callback for 'overwrite' mode
  199. would be very similar:
  200. static int subbuf_start(struct rchan_buf *buf,
  201. void *subbuf,
  202. void *prev_subbuf,
  203. unsigned int prev_padding)
  204. {
  205. if (prev_subbuf)
  206. *((unsigned *)prev_subbuf) = prev_padding;
  207. subbuf_start_reserve(buf, sizeof(unsigned int));
  208. return 1;
  209. }
  210. In this case, the relay_buf_full() check is meaningless and the
  211. callback always returns 1, causing the buffer switch to occur
  212. unconditionally. It's also meaningless for the client to use the
  213. relay_subbufs_consumed() function in this mode, as it's never
  214. consulted.
  215. The default subbuf_start() implementation, used if the client doesn't
  216. define any callbacks, or doesn't define the subbuf_start() callback,
  217. implements the simplest possible 'no-overwrite' mode i.e. it does
  218. nothing but return 0.
  219. Header information can be reserved at the beginning of each sub-buffer
  220. by calling the subbuf_start_reserve() helper function from within the
  221. subbuf_start() callback. This reserved area can be used to store
  222. whatever information the client wants. In the example above, room is
  223. reserved in each sub-buffer to store the padding count for that
  224. sub-buffer. This is filled in for the previous sub-buffer in the
  225. subbuf_start() implementation; the padding value for the previous
  226. sub-buffer is passed into the subbuf_start() callback along with a
  227. pointer to the previous sub-buffer, since the padding value isn't
  228. known until a sub-buffer is filled. The subbuf_start() callback is
  229. also called for the first sub-buffer when the channel is opened, to
  230. give the client a chance to reserve space in it. In this case the
  231. previous sub-buffer pointer passed into the callback will be NULL, so
  232. the client should check the value of the prev_subbuf pointer before
  233. writing into the previous sub-buffer.
  234. Writing to a channel
  235. --------------------
  236. kernel clients write data into the current cpu's channel buffer using
  237. relay_write() or __relay_write(). relay_write() is the main logging
  238. function - it uses local_irqsave() to protect the buffer and should be
  239. used if you might be logging from interrupt context. If you know
  240. you'll never be logging from interrupt context, you can use
  241. __relay_write(), which only disables preemption. These functions
  242. don't return a value, so you can't determine whether or not they
  243. failed - the assumption is that you wouldn't want to check a return
  244. value in the fast logging path anyway, and that they'll always succeed
  245. unless the buffer is full and no-overwrite mode is being used, in
  246. which case you can detect a failed write in the subbuf_start()
  247. callback by calling the relay_buf_full() helper function.
  248. relay_reserve() is used to reserve a slot in a channel buffer which
  249. can be written to later. This would typically be used in applications
  250. that need to write directly into a channel buffer without having to
  251. stage data in a temporary buffer beforehand. Because the actual write
  252. may not happen immediately after the slot is reserved, applications
  253. using relay_reserve() can keep a count of the number of bytes actually
  254. written, either in space reserved in the sub-buffers themselves or as
  255. a separate array. See the 'reserve' example in the relay-apps tarball
  256. at http://relayfs.sourceforge.net for an example of how this can be
  257. done. Because the write is under control of the client and is
  258. separated from the reserve, relay_reserve() doesn't protect the buffer
  259. at all - it's up to the client to provide the appropriate
  260. synchronization when using relay_reserve().
  261. Closing a channel
  262. -----------------
  263. The client calls relay_close() when it's finished using the channel.
  264. The channel and its associated buffers are destroyed when there are no
  265. longer any references to any of the channel buffers. relay_flush()
  266. forces a sub-buffer switch on all the channel buffers, and can be used
  267. to finalize and process the last sub-buffers before the channel is
  268. closed.
  269. Creating non-relay files
  270. ------------------------
  271. relay_open() automatically creates files in the relayfs filesystem to
  272. represent the per-cpu kernel buffers; it's often useful for
  273. applications to be able to create their own files alongside the relay
  274. files in the relayfs filesystem as well e.g. 'control' files much like
  275. those created in /proc or debugfs for similar purposes, used to
  276. communicate control information between the kernel and user sides of a
  277. relayfs application. For this purpose the relayfs_create_file() and
  278. relayfs_remove_file() API functions exist. For relayfs_create_file(),
  279. the caller passes in a set of user-defined file operations to be used
  280. for the file and an optional void * to a user-specified data item,
  281. which will be accessible via inode->u.generic_ip (see the relay-apps
  282. tarball for examples). The file_operations are a required parameter
  283. to relayfs_create_file() and thus the semantics of these files are
  284. completely defined by the caller.
  285. See the relay-apps tarball at http://relayfs.sourceforge.net for
  286. examples of how these non-relay files are meant to be used.
  287. Creating relay files in other filesystems
  288. -----------------------------------------
  289. By default of course, relay_open() creates relay files in the relayfs
  290. filesystem. Because relay_file_operations is exported, however, it's
  291. also possible to create and use relay files in other pseudo-filesytems
  292. such as debugfs.
  293. For this purpose, two callback functions are provided,
  294. create_buf_file() and remove_buf_file(). create_buf_file() is called
  295. once for each per-cpu buffer from relay_open() to allow the client to
  296. create a file to be used to represent the corresponding buffer; if
  297. this callback is not defined, the default implementation will create
  298. and return a file in the relayfs filesystem to represent the buffer.
  299. The callback should return the dentry of the file created to represent
  300. the relay buffer. Note that the parent directory passed to
  301. relay_open() (and passed along to the callback), if specified, must
  302. exist in the same filesystem the new relay file is created in. If
  303. create_buf_file() is defined, remove_buf_file() must also be defined;
  304. it's responsible for deleting the file(s) created in create_buf_file()
  305. and is called during relay_close().
  306. The create_buf_file() implementation can also be defined in such a way
  307. as to allow the creation of a single 'global' buffer instead of the
  308. default per-cpu set. This can be useful for applications interested
  309. mainly in seeing the relative ordering of system-wide events without
  310. the need to bother with saving explicit timestamps for the purpose of
  311. merging/sorting per-cpu files in a postprocessing step.
  312. To have relay_open() create a global buffer, the create_buf_file()
  313. implementation should set the value of the is_global outparam to a
  314. non-zero value in addition to creating the file that will be used to
  315. represent the single buffer. In the case of a global buffer,
  316. create_buf_file() and remove_buf_file() will be called only once. The
  317. normal channel-writing functions e.g. relay_write() can still be used
  318. - writes from any cpu will transparently end up in the global buffer -
  319. but since it is a global buffer, callers should make sure they use the
  320. proper locking for such a buffer, either by wrapping writes in a
  321. spinlock, or by copying a write function from relayfs_fs.h and
  322. creating a local version that internally does the proper locking.
  323. See the 'exported-relayfile' examples in the relay-apps tarball for
  324. examples of creating and using relay files in debugfs.
  325. Misc
  326. ----
  327. Some applications may want to keep a channel around and re-use it
  328. rather than open and close a new channel for each use. relay_reset()
  329. can be used for this purpose - it resets a channel to its initial
  330. state without reallocating channel buffer memory or destroying
  331. existing mappings. It should however only be called when it's safe to
  332. do so i.e. when the channel isn't currently being written to.
  333. Finally, there are a couple of utility callbacks that can be used for
  334. different purposes. buf_mapped() is called whenever a channel buffer
  335. is mmapped from user space and buf_unmapped() is called when it's
  336. unmapped. The client can use this notification to trigger actions
  337. within the kernel application, such as enabling/disabling logging to
  338. the channel.
  339. Resources
  340. =========
  341. For news, example code, mailing list, etc. see the relayfs homepage:
  342. http://relayfs.sourceforge.net
  343. Credits
  344. =======
  345. The ideas and specs for relayfs came about as a result of discussions
  346. on tracing involving the following:
  347. Michel Dagenais <michel.dagenais@polymtl.ca>
  348. Richard Moore <richardj_moore@uk.ibm.com>
  349. Bob Wisniewski <bob@watson.ibm.com>
  350. Karim Yaghmour <karim@opersys.com>
  351. Tom Zanussi <zanussi@us.ibm.com>
  352. Also thanks to Hubertus Franke for a lot of useful suggestions and bug
  353. reports.