2021-07-23 18:31:45 +08:00
|
|
|
/* SPDX-License-Identifier: GPL-2.0 */
|
|
|
|
#ifndef _LINUX_TTY_BUFFER_H
|
|
|
|
#define _LINUX_TTY_BUFFER_H
|
|
|
|
|
|
|
|
#include <linux/atomic.h>
|
|
|
|
#include <linux/llist.h>
|
|
|
|
#include <linux/mutex.h>
|
|
|
|
#include <linux/workqueue.h>
|
|
|
|
|
|
|
|
struct tty_buffer {
|
|
|
|
union {
|
|
|
|
struct tty_buffer *next;
|
|
|
|
struct llist_node free;
|
|
|
|
};
|
|
|
|
int used;
|
|
|
|
int size;
|
|
|
|
int commit;
|
tty: Implement lookahead to process XON/XOFF timely
When tty is not read from, XON/XOFF may get stuck into an
intermediate buffer. As those characters are there to do software
flow-control, it is not very useful. In the case where neither end
reads from ttys, the receiving ends might not be able receive the
XOFF characters and just keep sending more data to the opposite
direction. This problem is almost guaranteed to occur with DMA
which sends data in large chunks.
If TTY is slow to process characters, that is, eats less than given
amount in receive_buf, invoke lookahead for the rest of the chars
to process potential XON/XOFF characters.
We need to keep track of how many characters have been processed by the
lookahead to avoid processing the flow control char again on the normal
path. Bookkeeping occurs parallel on two layers (tty_buffer and n_tty)
to avoid passing the lookahead_count through the whole call chain.
When a flow-control char is processed, two things must occur:
a) it must not be treated as normal char
b) if not yet processed, flow-control actions need to be taken
The return value of n_tty_receive_char_flow_ctrl() tells caller a), and
b) is kept internal to n_tty_receive_char_flow_ctrl().
If characters were previous looked ahead, __receive_buf() makes two
calls to the appropriate n_tty_receive_buf_* function. First call is
made with lookahead_done=true for the characters that were subject to
lookahead earlier and then with lookahead=false for the new characters.
Either of the calls might be skipped when it has no characters to
handle.
Reported-by: Gilles Buloz <gilles.buloz@kontron.com>
Reviewed-by: Andy Shevchenko <andy.shevchenko@gmail.com>
Signed-off-by: Ilpo Järvinen <ilpo.jarvinen@linux.intel.com>
Link: https://lore.kernel.org/r/20220606153652.63554-2-ilpo.jarvinen@linux.intel.com
Signed-off-by: Greg Kroah-Hartman <gregkh@linuxfoundation.org>
2022-06-06 23:36:51 +08:00
|
|
|
int lookahead; /* Lazy update on recv, can become less than "read" */
|
2021-07-23 18:31:45 +08:00
|
|
|
int read;
|
2022-10-19 18:55:03 +08:00
|
|
|
bool flags;
|
2021-07-23 18:31:45 +08:00
|
|
|
/* Data points here */
|
|
|
|
unsigned long data[];
|
|
|
|
};
|
|
|
|
|
|
|
|
static inline unsigned char *char_buf_ptr(struct tty_buffer *b, int ofs)
|
|
|
|
{
|
|
|
|
return ((unsigned char *)b->data) + ofs;
|
|
|
|
}
|
|
|
|
|
|
|
|
static inline char *flag_buf_ptr(struct tty_buffer *b, int ofs)
|
|
|
|
{
|
|
|
|
return (char *)char_buf_ptr(b, ofs) + b->size;
|
|
|
|
}
|
|
|
|
|
|
|
|
struct tty_bufhead {
|
|
|
|
struct tty_buffer *head; /* Queue head */
|
|
|
|
struct work_struct work;
|
|
|
|
struct mutex lock;
|
|
|
|
atomic_t priority;
|
|
|
|
struct tty_buffer sentinel;
|
|
|
|
struct llist_head free; /* Free queue head */
|
|
|
|
atomic_t mem_used; /* In-use buffers excluding free list */
|
|
|
|
int mem_limit;
|
|
|
|
struct tty_buffer *tail; /* Active buffer */
|
|
|
|
};
|
|
|
|
|
|
|
|
/*
|
|
|
|
* When a break, frame error, or parity error happens, these codes are
|
|
|
|
* stuffed into the flags buffer.
|
|
|
|
*/
|
|
|
|
#define TTY_NORMAL 0
|
|
|
|
#define TTY_BREAK 1
|
|
|
|
#define TTY_FRAME 2
|
|
|
|
#define TTY_PARITY 3
|
|
|
|
#define TTY_OVERRUN 4
|
|
|
|
|
|
|
|
#endif
|