The seq_file Interface

Seq_file이 해결하는 문제

Device driver와 다른 kernel component는 debugfs·`/proc` 등에 virtual file을 만들어 사용자와 관리자에게 정보를 제공한다. 별도 utility 없이 사람이 읽고 script가 처리하기 쉬워 널리 사용된다.

짧은 문자열 하나를 반환하는 virtual file은 쉽지만 한 번의 read보다 긴 출력은 여러 read와 seek 사이에서 위치를 정확히 유지해야 한다. 위치가 출력 line 중간일 수도 있어 과거 kernel 구현은 이 처리를 자주 틀렸다.

Alexander Viro가 구현한 2.6 kernel의 seq_file 함수는 virtual file 작성자가 이 문제를 올바르게 해결하게 한다. Header는 `<linux/seq_file.h>`다.

예제 module은 `/proc/sequence`에서 증가하는 정수를 한 줄에 하나씩 끝없이 출력한다. `dd`로 첫 block과 seek한 다음 block을 별도로 읽어 이어 붙여도 정확한 결과가 나와야 한다.

dd if=/proc/sequence of=out1 count=1
dd if=/proc/sequence skip=1 of=out2 count=1

예제 자체는 쓸모없지만 다른 세부사항 없이 seek 가능한 seq_file 동작을 보여 준다. 원문은 전체 module source 링크도 제공한다.

.. SPDX-License-Identifier: GPL-2.0

======================
The seq_file Interface
======================

        Copyright 2003 Jonathan Corbet <corbet@lwn.net>

        This file is originally from the LWN.net Driver Porting series at
        https://lwn.net/Articles/driver-porting/


There are numerous ways for a device driver (or other kernel component) to
provide information to the user or system administrator.  One useful
technique is the creation of virtual files, in debugfs, /proc or elsewhere.
Virtual files can provide human-readable output that is easy to get at
without any special utility programs; they can also make life easier for
script writers. It is not surprising that the use of virtual files has
grown over the years.

Creating those files correctly has always been a bit of a challenge,
however. It is not that hard to make a virtual file which returns a
string. But life gets trickier if the output is long - anything greater
than an application is likely to read in a single operation.  Handling
multiple reads (and seeks) requires careful attention to the reader's
position within the virtual file - that position is, likely as not, in the
middle of a line of output. The kernel has traditionally had a number of
implementations that got this wrong.

The 2.6 kernel contains a set of functions (implemented by Alexander Viro)
which are designed to make it easy for virtual file creators to get it
right.

The seq_file interface is available via <linux/seq_file.h>. There are
three aspects to seq_file:

     * An iterator interface which lets a virtual file implementation
       step through the objects it is presenting.

     * Some utility functions for formatting objects for output without
       needing to worry about things like output buffers.

     * A set of canned file_operations which implement most operations on
       the virtual file.

We'll look at the seq_file interface via an extremely simple example: a
loadable module which creates a file called /proc/sequence. The file, when
read, simply produces a set of increasing integer values, one per line. The
sequence will continue until the user loses patience and finds something
better to do. The file is seekable, in that one can do something like the
following::

    dd if=/proc/sequence of=out1 count=1
    dd if=/proc/sequence skip=1 of=out2 count=1

Then concatenate the output files out1 and out2 and get the right
result. Yes, it is a thoroughly useless module, but the point is to show
how the mechanism works without getting lost in other details.  (Those
wanting to see the full source for this module can find it at
https://lwn.net/Articles/22359/).

제거된 `create_proc_entry()`

원래 LWN 문서는 kernel 3.10에서 제거된 `create_proc_entry()`를 사용했다. 현재 kernel에서는 `proc_create()`에 `file_operations`를 직접 넘겨야 한다.

- entry = create_proc_entry("sequence", 0, NULL);
- if (entry)
-         entry->proc_fops = &ct_file_ops;
+ entry = proc_create("sequence", 0, NULL, &ct_file_ops);

이 변경은 예제의 iterator 논리와 무관하지만 실제 module을 현재 kernel에서 빌드하려면 반드시 반영해야 한다.

Deprecated create_proc_entry
============================

Note that the above article uses create_proc_entry which was removed in
kernel 3.10. Current versions require the following update::

    -        entry = create_proc_entry("sequence", 0, NULL);
    -        if (entry)
    -                entry->proc_fops = &ct_file_ops;
    +        entry = proc_create("sequence", 0, NULL, &ct_file_ops);

Iterator session과 `start()`

Seq_file virtual file은 한 session, 대략 `read()` system call 하나 동안 데이터를 순회할 iterator를 구현해야 한다. 숫자 위치에서 object를 쉽게 찾을 수 있으면 iterator는 session 동안만 존재해도 된다. First/next 순회만 쉬운 구조라면 `seq_file.private`에 iterator를 저장해 session 사이에 이어갈 수 있다.

Firewall rule table은 position N을 chain의 N번째 rule로 해석할 수 있다. 변경 가능한 linked list는 현재 위치가 제거되지 않도록 보장할 수 있을 때 list pointer를 저장할 수 있다. Generator는 position이 virtual file byte offset으로 어떻게 변환되는지 알 필요가 없으며 position 0만 file 시작을 뜻해야 한다.

`/proc/sequence`는 다음 출력 숫자를 position으로 그대로 사용한다. Iterator에는 `start()`, `next()`, `stop()`, `show()` 네 함수가 필요하다.

`start()`는 session을 열고 position을 받아 그 위치에서 시작할 iterator를 반환한다. 전달되는 `pos`는 0 또는 이전 session에서 마지막으로 사용한 pos다.

static void *ct_seq_start(struct seq_file *s, loff_t *pos)
{
        loff_t *spos = kmalloc(sizeof(loff_t), GFP_KERNEL);
        if (!spos)
                return NULL;
        *spos = *pos;
        return spos;
}

예제 iterator state는 현재 position 하나를 담은 `loff_t`다. 예제 sequence는 끝이 없지만 일반 구현의 `start()`는 end-of-file을 넘었는지 검사하고 필요하면 `NULL`을 반환해야 한다.

Session 사이 state는 `seq_file.private`에 저장할 수 있다. `start()`가 offset 0에서만 반환할 수 있는 `SEQ_START_TOKEN`은 `show()`에 header 출력을 지시하는 편의 token이다. Core seq_file에 특별한 의미는 없고 `start()`, `next()`, `show()` 사이 통신 수단이다.

The iterator interface
======================

Modules implementing a virtual file with seq_file must implement an
iterator object that allows stepping through the data of interest
during a "session" (roughly one read() system call).  If the iterator
is able to move to a specific position - like the file they implement,
though with freedom to map the position number to a sequence location
in whatever way is convenient - the iterator need only exist
transiently during a session.  If the iterator cannot easily find a
numerical position but works well with a first/next interface, the
iterator can be stored in the private data area and continue from one
session to the next.

A seq_file implementation that is formatting firewall rules from a
table, for example, could provide a simple iterator that interprets
position N as the Nth rule in the chain.  A seq_file implementation
that presents the content of a, potentially volatile, linked list
might record a pointer into that list, providing that can be done
without risk of the current location being removed.

Positioning can thus be done in whatever way makes the most sense for
the generator of the data, which need not be aware of how a position
translates to an offset in the virtual file. The one obvious exception
is that a position of zero should indicate the beginning of the file.

The /proc/sequence iterator just uses the count of the next number it
will output as its position.

Four functions must be implemented to make the iterator work. The
first, called start(), starts a session and takes a position as an
argument, returning an iterator which will start reading at that
position.  The pos passed to start() will always be either zero, or
the most recent pos used in the previous session.

For our simple sequence example,
the start() function looks like::

        static void *ct_seq_start(struct seq_file *s, loff_t *pos)
        {
                loff_t *spos = kmalloc(sizeof(loff_t), GFP_KERNEL);
                if (! spos)
                        return NULL;
                *spos = *pos;
                return spos;
        }

The entire data structure for this iterator is a single loff_t value
holding the current position. There is no upper bound for the sequence
iterator, but that will not be the case for most other seq_file
implementations; in most cases the start() function should check for a
"past end of file" condition and return NULL if need be.

For more complicated applications, the private field of the seq_file
structure can be used to hold state from session to session.  There is
also a special value which can be returned by the start() function
called SEQ_START_TOKEN; it can be used if you wish to instruct your
show() function (described below) to print a header at the top of the

`next()` 위치 갱신과 `stop()`

`next()`는 iterator를 다음 sequence 위치로 옮기고 새 iterator를 반환하며 끝이면 `NULL`을 반환한다. 예제는 숫자를 하나 증가시킨다.

static void *ct_seq_next(struct seq_file *s, void *v, loff_t *pos)
{
        loff_t *spos = v;
        *pos = ++*spos;
        return spos;
}

`next()`는 `start()`가 새 위치를 다시 찾을 수 있는 값으로 `*pos`를 설정해야 한다. Private iterator를 유지하더라도 임의의 nonzero 값만 두면 충분하지 않다.

역사적으로 많은 `next()`가 EOF에서 `*pos`를 갱신하지 않아 다음 `start()`가 마지막 entry를 중복 보고하는 corner case가 있었다. 재발 방지를 위해 core seq_file은 `next()`가 `*pos`를 바꾸지 않으면 warning을 낸다. 따라서 반드시 값을 변경하고 nonzero로 만들어야 한다.

`stop()`은 session을 닫고 resource를 정리한다. Iterator를 동적 할당했다면 free하고 `start()`가 lock을 잡았다면 release한다. 마지막 `next()`가 설정한 `*pos`는 다음 session 첫 `start()`에 쓰인다. 단 `lseek()`가 호출되면 다음은 position 0에서 시작한다.

static void ct_seq_stop(struct seq_file *s, void *v)
{
        kfree(v);
}

output. SEQ_START_TOKEN should only be used if the offset is zero,
however.  SEQ_START_TOKEN has no special meaning to the core seq_file
code.  It is provided as a convenience for a start() function to
communicate with the next() and show() functions.

The next function to implement is called, amazingly, next(); its job is to
move the iterator forward to the next position in the sequence.  The
example module can simply increment the position by one; more useful
modules will do what is needed to step through some data structure. The
next() function returns a new iterator, or NULL if the sequence is
complete. Here's the example version::

        static void *ct_seq_next(struct seq_file *s, void *v, loff_t *pos)
        {
                loff_t *spos = v;
                *pos = ++*spos;
                return spos;
        }

The next() function should set ``*pos`` to a value that start() can use
to find the new location in the sequence.  When the iterator is being
stored in the private data area, rather than being reinitialized on each
start(), it might seem sufficient to simply set ``*pos`` to any non-zero
value (zero always tells start() to restart the sequence).  This is not
sufficient due to historical problems.

Historically, many next() functions have *not* updated ``*pos`` at
end-of-file.  If the value is then used by start() to initialise the
iterator, this can result in corner cases where the last entry in the
sequence is reported twice in the file.  In order to discourage this bug
from being resurrected, the core seq_file code now produces a warning if
a next() function does not change the value of ``*pos``.  Consequently a
next() function *must* change the value of ``*pos``, and of course must
set it to a non-zero value.

The stop() function closes a session; its job, of course, is to clean
up. If dynamic memory is allocated for the iterator, stop() is the
place to free it; if a lock was taken by start(), stop() must release
that lock.  The value that ``*pos`` was set to by the last next() call
before stop() is remembered, and used for the first start() call of
the next session unless lseek() has been called on the file; in that
case next start() will be asked to start at position zero::

        static void ct_seq_stop(struct seq_file *s, void *v)
        {
                kfree(v);
        }

Finally, the show() function should format the object currently pointed to
by the iterator for output.  The example module's show() function is::

        static int ct_seq_show(struct seq_file *s, void *v)
        {

`show()`와 `seq_operations` 계약

`show()`는 iterator가 가리키는 현재 object를 출력 형식으로 만든다. 성공은 0, 실패는 보통의 음수 errno를 반환해 userspace에 전달한다. `SEQ_SKIP`을 반환하면 현재 item을 건너뛰며, 그 전에 생성한 출력도 버린다.

static int ct_seq_show(struct seq_file *s, void *v)
{
        loff_t *spos = v;
        seq_printf(s, "%lld\n", (long long)*spos);
        return 0;
}

static const struct seq_operations ct_seq_ops = {
        .start = ct_seq_start,
        .next  = ct_seq_next,
        .stop  = ct_seq_stop,
        .show  = ct_seq_show,
};

`start()`가 반환하고 나머지 함수가 다루는 iterator 값은 seq_file core에 완전히 opaque하다. Counter, array pointer, linked-list pointer 등 순회에 유용한 무엇이든 될 수 있다.

Iterator callback 사이에는 외부 변화가 일어날 수 있음을 고려해야 한다. 다만 seq_file core는 `start()`와 `stop()` 사이에서 sleep하지 않고 다른 lock도 잡지 않으므로 이 구간 동안 lock을 유지하는 것은 합리적이다.

`start()` 또는 `next()`가 반환한 iterator는 이후 `next()`나 `stop()`에는 반드시 전달돼 획득한 lock 같은 resource를 확실히 해제할 수 있다. 반면 `show()`에 전달된다는 보장은 없다.

                loff_t *spos = v;
                seq_printf(s, "%lld\n", (long long)*spos);
                return 0;
        }

If all is well, the show() function should return zero.  A negative error
code in the usual manner indicates that something went wrong; it will be
passed back to user space.  This function can also return SEQ_SKIP, which
causes the current item to be skipped; if the show() function has already
generated output before returning SEQ_SKIP, that output will be dropped.

We will look at seq_printf() in a moment. But first, the definition of the
seq_file iterator is finished by creating a seq_operations structure with
the four functions we have just defined::

        static const struct seq_operations ct_seq_ops = {
                .start = ct_seq_start,
                .next  = ct_seq_next,
                .stop  = ct_seq_stop,
                .show  = ct_seq_show
        };

This structure will be needed to tie our iterator to the /proc file in
a little bit.

It's worth noting that the iterator value returned by start() and
manipulated by the other functions is considered to be completely opaque by
the seq_file code. It can thus be anything that is useful in stepping
through the data to be output. Counters can be useful, but it could also be
a direct pointer into an array or linked list. Anything goes, as long as
the programmer is aware that things can happen between calls to the
iterator function. However, the seq_file code (by design) will not sleep
between the calls to start() and stop(), so holding a lock during that time
is a reasonable thing to do. The seq_file code will also avoid taking any
other locks while the iterator is active.

The iterator value returned by start() or next() is guaranteed to be
passed to a subsequent next() or stop() call.  This allows resources
such as locks that were taken to be reliably released.  There is *no*
guarantee that the iterator will be passed to show(), though in practice
it often will be.

Formatted output helper

Seq_file core는 iterator가 만든 출력의 위치와 userspace buffer 전달을 관리한다. 구현은 모든 출력을 seq_file helper로 넘겨야 한다. 가장 흔한 `seq_printf()`는 `printk()`와 비슷하지만 첫 인자로 `struct seq_file *`를 받는다.

복잡한 출력을 만드는 함수는 `seq_has_overflowed(m)`를 검사해 true면 추가 `seq_*` 출력을 멈출 수 있다. True는 현재 seq_file buffer가 폐기되고 `show()`가 더 큰 buffer를 할당해 다시 formatting한다는 뜻이다.

Formatted output
================

The seq_file code manages positioning within the output created by the
iterator and getting it into the user's buffer. But, for that to work, that
output must be passed to the seq_file code. Some utility functions have
been defined which make this task easy.

Most code will simply use seq_printf(), which works pretty much like
printk(), but which requires the seq_file pointer as an argument.

For straight character output, the following functions may be used::

        seq_putc(struct seq_file *m, char c);
        seq_puts(struct seq_file *m, const char *s);
        seq_escape(struct seq_file *m, const char *s, const char *esc);

The first two output a single character and a string, just like one would
expect. seq_escape() is like seq_puts(), except that any character in s
which is in the string esc will be represented in octal form in the output.

There are also a pair of functions for printing filenames::

        int seq_path(struct seq_file *m, const struct path *path,
                     const char *esc);
        int seq_path_root(struct seq_file *m, const struct path *path,
                          const struct path *root, const char *esc)

Here, path indicates the file of interest, and esc is a set of characters
which should be escaped in the output.  A call to seq_path() will output
the path relative to the current process's filesystem root.  If a different
root is desired, it can be used with seq_path_root().  If it turns out that
path cannot be reached from root, seq_path_root() returns SEQ_SKIP.

A function producing complicated output may want to check::

        bool seq_has_overflowed(struct seq_file *m);

and avoid further seq_<output> calls if true is returned.

A true return from seq_has_overflowed means that the seq_file buffer will
be discarded and the seq_show function will attempt to allocate a larger
buffer and retry printing.

`seq_open()`과 private state

Iterator와 formatting 함수만으로는 userspace가 볼 file이 되지 않는다. Seq_file은 대부분의 file operation을 제공하지만 작성자는 iterator를 연결하는 `open()`을 구현해야 한다.

static int ct_open(struct inode *inode, struct file *file)
{
        return seq_open(file, &ct_seq_ops);
}

성공한 `seq_open()`은 `struct seq_file *`를 `file->private_data`에 저장한다. 같은 iterator를 여러 file에 쓰는 경우 `seq_file.private`에는 application 임의 pointer를 저장해 callback에서 꺼낼 수 있다.

`seq_open_private()`는 지정한 크기의 zero-filled memory를 `kmalloc`해 `seq_file.private`에 넣고 성공 시 0을 반환한다.

static int ct_open(struct inode *inode, struct file *file)
{
        return seq_open_private(file, &ct_seq_ops,
                                sizeof(struct mystruct));
}

`__seq_open_private()`는 기능은 같지만 성공 시 할당 memory pointer를 반환해 추가 초기화를 할 수 있다. 실패하면 `NULL`이므로 `-ENOMEM`을 반환한다.

struct mystruct *p =
        __seq_open_private(file, &ct_seq_ops, sizeof(*p));
if (!p)
        return -ENOMEM;
p->foo = bar;
p->baz = true;

대응 close인 `seq_release_private()`는 open helper가 할당한 memory를 free한 뒤 seq_file 구조를 release한다.

Making it all work
==================

So far, we have a nice set of functions which can produce output within the
seq_file system, but we have not yet turned them into a file that a user
can see. Creating a file within the kernel requires, of course, the
creation of a set of file_operations which implement the operations on that
file. The seq_file interface provides a set of canned operations which do
most of the work. The virtual file author still must implement the open()
method, however, to hook everything up. The open function is often a single
line, as in the example module::

        static int ct_open(struct inode *inode, struct file *file)
        {
                return seq_open(file, &ct_seq_ops);
        }

Here, the call to seq_open() takes the seq_operations structure we created
before, and gets set up to iterate through the virtual file.

On a successful open, seq_open() stores the struct seq_file pointer in
file->private_data. If you have an application where the same iterator can
be used for more than one file, you can store an arbitrary pointer in the
private field of the seq_file structure; that value can then be retrieved
by the iterator functions.

There is also a wrapper function to seq_open() called seq_open_private(). It
kmallocs a zero filled block of memory and stores a pointer to it in the
private field of the seq_file structure, returning 0 on success. The
block size is specified in a third parameter to the function, e.g.::

        static int ct_open(struct inode *inode, struct file *file)
        {
                return seq_open_private(file, &ct_seq_ops,
                                        sizeof(struct mystruct));
        }

There is also a variant function, __seq_open_private(), which is functionally
identical except that, if successful, it returns the pointer to the allocated
memory block, allowing further initialisation e.g.::

        static int ct_open(struct inode *inode, struct file *file)
        {
                struct mystruct *p =
                        __seq_open_private(file, &ct_seq_ops, sizeof(*p));

                if (!p)
                        return -ENOMEM;

                p->foo = bar; /* initialize my stuff */
                        ...
                p->baz = true;

                return 0;
        }

A corresponding close function, seq_release_private() is available which
frees the memory allocated in the corresponding open.

`file_operations`와 proc entry

관심 있는 나머지 operation인 `read()`, `llseek()`, `release()`는 seq_file core가 구현한다.

static const struct file_operations ct_file_ops = {
        .owner   = THIS_MODULE,
        .open    = ct_open,
        .read    = seq_read,
        .llseek  = seq_lseek,
        .release = seq_release,
};

Private field 내용을 `kfree()`해야 한다면 `.release = seq_release_private`를 사용한다.

마지막으로 module 초기화에서 `proc_create("sequence", 0, NULL, &ct_file_ops)`를 호출해 `/proc/sequence`를 만든다.

static int ct_init(void)
{
        proc_create("sequence", 0, NULL, &ct_file_ops);
        return 0;
}
module_init(ct_init);

The other operations of interest - read(), llseek(), and release() - are
all implemented by the seq_file code itself. So a virtual file's
file_operations structure will look like::

        static const struct file_operations ct_file_ops = {
                .owner   = THIS_MODULE,
                .open    = ct_open,
                .read    = seq_read,
                .llseek  = seq_lseek,
                .release = seq_release
        };

There is also a seq_release_private() which passes the contents of the
seq_file private field to kfree() before releasing the structure.

The final step is the creation of the /proc file itself. In the example
code, that is done in the initialization code in the usual way::

        static int ct_init(void)
        {
                struct proc_dir_entry *entry;

                proc_create("sequence", 0, NULL, &ct_file_ops);
                return 0;
        }

        module_init(ct_init);

And that is pretty much it.

Linked list iterator helper

Virtual file이 linked list를 순회한다면 `seq_list_start()`, `seq_list_start_head()`, `seq_list_next()` helper를 사용할 수 있다.

struct list_head *seq_list_start(struct list_head *head, loff_t pos);
struct list_head *seq_list_start_head(struct list_head *head, loff_t pos);
struct list_head *seq_list_next(void *v, struct list_head *head,
                                loff_t *ppos);

이 helper들은 `pos`를 list 안 위치로 해석해 순회한다. 구현의 `start()`와 `next()`는 적절한 `list_head` pointer와 함께 대응 `seq_list_*` helper만 호출하면 된다.

seq_list
========

If your file will be iterating through a linked list, you may find these
routines useful::

        struct list_head *seq_list_start(struct list_head *head,
                                                 loff_t pos);
        struct list_head *seq_list_start_head(struct list_head *head,
                                               loff_t pos);
        struct list_head *seq_list_next(void *v, struct list_head *head,
                                        loff_t *ppos);

These helpers will interpret pos as a position within the list and iterate
accordingly.  Your start() and next() functions need only invoke the
``seq_list_*`` helpers with a pointer to the appropriate list_head structure.

단일 출력용 `single_open()`

매우 단순한 virtual file은 전체 출력을 한 번에 만드는 `show()` 하나만 정의할 수 있다. `open()`에서 `single_open(file, show, data)`를 호출하면 출력 시 `show()`를 한 번 호출한다.

int single_open(struct file *file,
                int (*show)(struct seq_file *m, void *p),
                void *data);

`data` 값은 `seq_file.private`에서 찾을 수 있다. `single_open()`을 쓴 file_operations는 memory leak을 피하려고 `seq_release()`가 아니라 반드시 `single_release()`를 사용해야 한다.

The extra-simple version
========================

For extremely simple virtual files, there is an even easier interface.  A
module can define only the show() function, which should create all the
output that the virtual file will contain. The file's open() method then
calls::

        int single_open(struct file *file,
                        int (*show)(struct seq_file *m, void *p),
                        void *data);

When output time comes, the show() function will be called once. The data
value given to single_open() can be found in the private field of the
seq_file structure. When using single_open(), the programmer should use
single_release() instead of seq_release() in the file_operations structure
to avoid a memory leak.