relayfs.txt 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362
  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 stucture 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 not
  37. impose a single interface on userspace. It does provide a separate
  38. helper though, described below.
  39. klog, relay-app & librelay
  40. ==========================
  41. relayfs itself is ready to use, but to make things easier, two
  42. additional systems are provided. klog is a simple wrapper to make
  43. writing formatted text or raw data to a channel simpler, regardless of
  44. whether a channel to write into exists or not, or whether relayfs is
  45. compiled into the kernel or is configured as a module. relay-app is
  46. the kernel counterpart of userspace librelay.c, combined these two
  47. files provide glue to easily stream data to disk, without having to
  48. bother with housekeeping. klog and relay-app can be used together,
  49. with klog providing high-level logging functions to the kernel and
  50. relay-app taking care of kernel-user control and disk-logging chores.
  51. It is possible to use relayfs without relay-app & librelay, but you'll
  52. have to implement communication between userspace and kernel, allowing
  53. both to convey the state of buffers (full, empty, amount of padding).
  54. klog, relay-app and librelay can be found in the relay-apps tarball on
  55. http://relayfs.sourceforge.net
  56. The relayfs user space API
  57. ==========================
  58. relayfs implements basic file operations for user space access to
  59. relayfs channel buffer data. Here are the file operations that are
  60. available and some comments regarding their behavior:
  61. open() enables user to open an _existing_ buffer.
  62. mmap() results in channel buffer being mapped into the caller's
  63. memory space. Note that you can't do a partial mmap - you must
  64. map the entire file, which is NRBUF * SUBBUFSIZE.
  65. read() read the contents of a channel buffer. The bytes read are
  66. 'consumed' by the reader i.e. they won't be available again
  67. to subsequent reads. If the channel is being used in
  68. no-overwrite mode (the default), it can be read at any time
  69. even if there's an active kernel writer. If the channel is
  70. being used in overwrite mode and there are active channel
  71. writers, results may be unpredictable - users should make
  72. sure that all logging to the channel has ended before using
  73. read() with overwrite mode.
  74. poll() POLLIN/POLLRDNORM/POLLERR supported. User applications are
  75. notified when sub-buffer boundaries are crossed.
  76. close() decrements the channel buffer's refcount. When the refcount
  77. reaches 0 i.e. when no process or kernel client has the buffer
  78. open, the channel buffer is freed.
  79. In order for a user application to make use of relayfs files, the
  80. relayfs filesystem must be mounted. For example,
  81. mount -t relayfs relayfs /mnt/relay
  82. NOTE: relayfs doesn't need to be mounted for kernel clients to create
  83. or use channels - it only needs to be mounted when user space
  84. applications need access to the buffer data.
  85. The relayfs kernel API
  86. ======================
  87. Here's a summary of the API relayfs provides to in-kernel clients:
  88. channel management functions:
  89. relay_open(base_filename, parent, subbuf_size, n_subbufs,
  90. callbacks)
  91. relay_close(chan)
  92. relay_flush(chan)
  93. relay_reset(chan)
  94. relayfs_create_dir(name, parent)
  95. relayfs_remove_dir(dentry)
  96. channel management typically called on instigation of userspace:
  97. relay_subbufs_consumed(chan, cpu, subbufs_consumed)
  98. write functions:
  99. relay_write(chan, data, length)
  100. __relay_write(chan, data, length)
  101. relay_reserve(chan, length)
  102. callbacks:
  103. subbuf_start(buf, subbuf, prev_subbuf, prev_padding)
  104. buf_mapped(buf, filp)
  105. buf_unmapped(buf, filp)
  106. helper functions:
  107. relay_buf_full(buf)
  108. subbuf_start_reserve(buf, length)
  109. Creating a channel
  110. ------------------
  111. relay_open() is used to create a channel, along with its per-cpu
  112. channel buffers. Each channel buffer will have an associated file
  113. created for it in the relayfs filesystem, which can be opened and
  114. mmapped from user space if desired. The files are named
  115. basename0...basenameN-1 where N is the number of online cpus, and by
  116. default will be created in the root of the filesystem. If you want a
  117. directory structure to contain your relayfs files, you can create it
  118. with relayfs_create_dir() and pass the parent directory to
  119. relay_open(). Clients are responsible for cleaning up any directory
  120. structure they create when the channel is closed - use
  121. relayfs_remove_dir() for that.
  122. The total size of each per-cpu buffer is calculated by multiplying the
  123. number of sub-buffers by the sub-buffer size passed into relay_open().
  124. The idea behind sub-buffers is that they're basically an extension of
  125. double-buffering to N buffers, and they also allow applications to
  126. easily implement random-access-on-buffer-boundary schemes, which can
  127. be important for some high-volume applications. The number and size
  128. of sub-buffers is completely dependent on the application and even for
  129. the same application, different conditions will warrant different
  130. values for these parameters at different times. Typically, the right
  131. values to use are best decided after some experimentation; in general,
  132. though, it's safe to assume that having only 1 sub-buffer is a bad
  133. idea - you're guaranteed to either overwrite data or lose events
  134. depending on the channel mode being used.
  135. Channel 'modes'
  136. ---------------
  137. relayfs channels can be used in either of two modes - 'overwrite' or
  138. 'no-overwrite'. The mode is entirely determined by the implementation
  139. of the subbuf_start() callback, as described below. In 'overwrite'
  140. mode, also known as 'flight recorder' mode, writes continuously cycle
  141. around the buffer and will never fail, but will unconditionally
  142. overwrite old data regardless of whether it's actually been consumed.
  143. In no-overwrite mode, writes will fail i.e. data will be lost, if the
  144. number of unconsumed sub-buffers equals the total number of
  145. sub-buffers in the channel. It should be clear that if there is no
  146. consumer or if the consumer can't consume sub-buffers fast enought,
  147. data will be lost in either case; the only difference is whether data
  148. is lost from the beginning or the end of a buffer.
  149. As explained above, a relayfs channel is made of up one or more
  150. per-cpu channel buffers, each implemented as a circular buffer
  151. subdivided into one or more sub-buffers. Messages are written into
  152. the current sub-buffer of the channel's current per-cpu buffer via the
  153. write functions described below. Whenever a message can't fit into
  154. the current sub-buffer, because there's no room left for it, the
  155. client is notified via the subbuf_start() callback that a switch to a
  156. new sub-buffer is about to occur. The client uses this callback to 1)
  157. initialize the next sub-buffer if appropriate 2) finalize the previous
  158. sub-buffer if appropriate and 3) return a boolean value indicating
  159. whether or not to actually go ahead with the sub-buffer switch.
  160. To implement 'no-overwrite' mode, the userspace client would provide
  161. an implementation of the subbuf_start() callback something like the
  162. following:
  163. static int subbuf_start(struct rchan_buf *buf,
  164. void *subbuf,
  165. void *prev_subbuf,
  166. unsigned int prev_padding)
  167. {
  168. if (prev_subbuf)
  169. *((unsigned *)prev_subbuf) = prev_padding;
  170. if (relay_buf_full(buf))
  171. return 0;
  172. subbuf_start_reserve(buf, sizeof(unsigned int));
  173. return 1;
  174. }
  175. If the current buffer is full i.e. all sub-buffers remain unconsumed,
  176. the callback returns 0 to indicate that the buffer switch should not
  177. occur yet i.e. until the consumer has had a chance to read the current
  178. set of ready sub-buffers. For the relay_buf_full() function to make
  179. sense, the consumer is reponsible for notifying relayfs when
  180. sub-buffers have been consumed via relay_subbufs_consumed(). Any
  181. subsequent attempts to write into the buffer will again invoke the
  182. subbuf_start() callback with the same parameters; only when the
  183. consumer has consumed one or more of the ready sub-buffers will
  184. relay_buf_full() return 0, in which case the buffer switch can
  185. continue.
  186. The implementation of the subbuf_start() callback for 'overwrite' mode
  187. would be very similar:
  188. static int subbuf_start(struct rchan_buf *buf,
  189. void *subbuf,
  190. void *prev_subbuf,
  191. unsigned int prev_padding)
  192. {
  193. if (prev_subbuf)
  194. *((unsigned *)prev_subbuf) = prev_padding;
  195. subbuf_start_reserve(buf, sizeof(unsigned int));
  196. return 1;
  197. }
  198. In this case, the relay_buf_full() check is meaningless and the
  199. callback always returns 1, causing the buffer switch to occur
  200. unconditionally. It's also meaningless for the client to use the
  201. relay_subbufs_consumed() function in this mode, as it's never
  202. consulted.
  203. The default subbuf_start() implementation, used if the client doesn't
  204. define any callbacks, or doesn't define the subbuf_start() callback,
  205. implements the simplest possible 'no-overwrite' mode i.e. it does
  206. nothing but return 0.
  207. Header information can be reserved at the beginning of each sub-buffer
  208. by calling the subbuf_start_reserve() helper function from within the
  209. subbuf_start() callback. This reserved area can be used to store
  210. whatever information the client wants. In the example above, room is
  211. reserved in each sub-buffer to store the padding count for that
  212. sub-buffer. This is filled in for the previous sub-buffer in the
  213. subbuf_start() implementation; the padding value for the previous
  214. sub-buffer is passed into the subbuf_start() callback along with a
  215. pointer to the previous sub-buffer, since the padding value isn't
  216. known until a sub-buffer is filled. The subbuf_start() callback is
  217. also called for the first sub-buffer when the channel is opened, to
  218. give the client a chance to reserve space in it. In this case the
  219. previous sub-buffer pointer passed into the callback will be NULL, so
  220. the client should check the value of the prev_subbuf pointer before
  221. writing into the previous sub-buffer.
  222. Writing to a channel
  223. --------------------
  224. kernel clients write data into the current cpu's channel buffer using
  225. relay_write() or __relay_write(). relay_write() is the main logging
  226. function - it uses local_irqsave() to protect the buffer and should be
  227. used if you might be logging from interrupt context. If you know
  228. you'll never be logging from interrupt context, you can use
  229. __relay_write(), which only disables preemption. These functions
  230. don't return a value, so you can't determine whether or not they
  231. failed - the assumption is that you wouldn't want to check a return
  232. value in the fast logging path anyway, and that they'll always succeed
  233. unless the buffer is full and no-overwrite mode is being used, in
  234. which case you can detect a failed write in the subbuf_start()
  235. callback by calling the relay_buf_full() helper function.
  236. relay_reserve() is used to reserve a slot in a channel buffer which
  237. can be written to later. This would typically be used in applications
  238. that need to write directly into a channel buffer without having to
  239. stage data in a temporary buffer beforehand. Because the actual write
  240. may not happen immediately after the slot is reserved, applications
  241. using relay_reserve() can keep a count of the number of bytes actually
  242. written, either in space reserved in the sub-buffers themselves or as
  243. a separate array. See the 'reserve' example in the relay-apps tarball
  244. at http://relayfs.sourceforge.net for an example of how this can be
  245. done. Because the write is under control of the client and is
  246. separated from the reserve, relay_reserve() doesn't protect the buffer
  247. at all - it's up to the client to provide the appropriate
  248. synchronization when using relay_reserve().
  249. Closing a channel
  250. -----------------
  251. The client calls relay_close() when it's finished using the channel.
  252. The channel and its associated buffers are destroyed when there are no
  253. longer any references to any of the channel buffers. relay_flush()
  254. forces a sub-buffer switch on all the channel buffers, and can be used
  255. to finalize and process the last sub-buffers before the channel is
  256. closed.
  257. Misc
  258. ----
  259. Some applications may want to keep a channel around and re-use it
  260. rather than open and close a new channel for each use. relay_reset()
  261. can be used for this purpose - it resets a channel to its initial
  262. state without reallocating channel buffer memory or destroying
  263. existing mappings. It should however only be called when it's safe to
  264. do so i.e. when the channel isn't currently being written to.
  265. Finally, there are a couple of utility callbacks that can be used for
  266. different purposes. buf_mapped() is called whenever a channel buffer
  267. is mmapped from user space and buf_unmapped() is called when it's
  268. unmapped. The client can use this notification to trigger actions
  269. within the kernel application, such as enabling/disabling logging to
  270. the channel.
  271. Resources
  272. =========
  273. For news, example code, mailing list, etc. see the relayfs homepage:
  274. http://relayfs.sourceforge.net
  275. Credits
  276. =======
  277. The ideas and specs for relayfs came about as a result of discussions
  278. on tracing involving the following:
  279. Michel Dagenais <michel.dagenais@polymtl.ca>
  280. Richard Moore <richardj_moore@uk.ibm.com>
  281. Bob Wisniewski <bob@watson.ibm.com>
  282. Karim Yaghmour <karim@opersys.com>
  283. Tom Zanussi <zanussi@us.ibm.com>
  284. Also thanks to Hubertus Franke for a lot of useful suggestions and bug
  285. reports.