2017-11-07 01:11:51 +08:00
|
|
|
// SPDX-License-Identifier: GPL-2.0
|
2008-10-13 17:36:58 +08:00
|
|
|
/*
|
|
|
|
* Tty buffer allocation management
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include <linux/types.h>
|
|
|
|
#include <linux/errno.h>
|
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
|
|
|
#include <linux/minmax.h>
|
2008-10-13 17:36:58 +08:00
|
|
|
#include <linux/tty.h>
|
|
|
|
#include <linux/tty_driver.h>
|
|
|
|
#include <linux/tty_flip.h>
|
|
|
|
#include <linux/timer.h>
|
|
|
|
#include <linux/string.h>
|
|
|
|
#include <linux/slab.h>
|
|
|
|
#include <linux/sched.h>
|
|
|
|
#include <linux/wait.h>
|
|
|
|
#include <linux/bitops.h>
|
|
|
|
#include <linux/delay.h>
|
|
|
|
#include <linux/module.h>
|
2013-02-12 15:00:43 +08:00
|
|
|
#include <linux/ratelimit.h>
|
2021-04-08 20:51:30 +08:00
|
|
|
#include "tty.h"
|
2013-06-15 21:36:02 +08:00
|
|
|
|
|
|
|
#define MIN_TTYB_SIZE 256
|
|
|
|
#define TTYB_ALIGN_MASK 255
|
|
|
|
|
2013-06-15 21:36:08 +08:00
|
|
|
/*
|
|
|
|
* Byte threshold to limit memory consumption for flip buffers.
|
|
|
|
* The actual memory limit is > 2x this amount.
|
|
|
|
*/
|
2019-01-29 02:01:10 +08:00
|
|
|
#define TTYB_DEFAULT_MEM_LIMIT (640 * 1024UL)
|
2013-06-15 21:36:08 +08:00
|
|
|
|
2013-06-15 21:36:16 +08:00
|
|
|
/*
|
|
|
|
* We default to dicing tty buffer allocations to this many characters
|
|
|
|
* in order to avoid multiple page allocations. We know the size of
|
|
|
|
* tty_buffer itself but it must also be taken into account that the
|
2021-05-12 17:26:12 +08:00
|
|
|
* buffer is 256 byte aligned. See tty_buffer_find for the allocation
|
|
|
|
* logic this must match.
|
2013-06-15 21:36:16 +08:00
|
|
|
*/
|
|
|
|
|
|
|
|
#define TTY_BUFFER_PAGE (((PAGE_SIZE - sizeof(struct tty_buffer)) / 2) & ~0xFF)
|
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_lock_exclusive - gain exclusive access to buffer
|
|
|
|
* @port: tty port owning the flip buffer
|
2013-06-15 21:36:15 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Guarantees safe use of the &tty_ldisc_ops.receive_buf() method by excluding
|
|
|
|
* the buffer work and any pending flush from using the flip buffer. Data can
|
|
|
|
* continue to be added concurrently to the flip buffer from the driver side.
|
2013-06-15 21:36:15 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* See also tty_buffer_unlock_exclusive().
|
2013-06-15 21:36:15 +08:00
|
|
|
*/
|
|
|
|
void tty_buffer_lock_exclusive(struct tty_port *port)
|
|
|
|
{
|
|
|
|
struct tty_bufhead *buf = &port->buf;
|
|
|
|
|
|
|
|
atomic_inc(&buf->priority);
|
|
|
|
mutex_lock(&buf->lock);
|
|
|
|
}
|
2014-05-19 08:03:06 +08:00
|
|
|
EXPORT_SYMBOL_GPL(tty_buffer_lock_exclusive);
|
2013-06-15 21:36:15 +08:00
|
|
|
|
2021-11-26 16:16:02 +08:00
|
|
|
/**
|
|
|
|
* tty_buffer_unlock_exclusive - release exclusive access
|
|
|
|
* @port: tty port owning the flip buffer
|
|
|
|
*
|
|
|
|
* The buffer work is restarted if there is data in the flip buffer.
|
|
|
|
*
|
|
|
|
* See also tty_buffer_lock_exclusive().
|
|
|
|
*/
|
2013-06-15 21:36:15 +08:00
|
|
|
void tty_buffer_unlock_exclusive(struct tty_port *port)
|
|
|
|
{
|
|
|
|
struct tty_bufhead *buf = &port->buf;
|
|
|
|
int restart;
|
|
|
|
|
|
|
|
restart = buf->head->commit != buf->head->read;
|
|
|
|
|
|
|
|
atomic_dec(&buf->priority);
|
|
|
|
mutex_unlock(&buf->lock);
|
|
|
|
if (restart)
|
|
|
|
queue_work(system_unbound_wq, &buf->work);
|
|
|
|
}
|
2014-05-19 08:03:06 +08:00
|
|
|
EXPORT_SYMBOL_GPL(tty_buffer_unlock_exclusive);
|
2013-06-15 21:36:15 +08:00
|
|
|
|
2013-06-15 21:36:08 +08:00
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_space_avail - return unused buffer space
|
|
|
|
* @port: tty port owning the flip buffer
|
2013-06-15 21:36:08 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Returns: the # of bytes which can be written by the driver without reaching
|
|
|
|
* the buffer limit.
|
2013-06-15 21:36:08 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Note: this does not guarantee that memory is available to write the returned
|
|
|
|
* # of bytes (use tty_prepare_flip_string() to pre-allocate if memory
|
|
|
|
* guarantee is required).
|
2013-06-15 21:36:08 +08:00
|
|
|
*/
|
2021-05-05 17:19:17 +08:00
|
|
|
unsigned int tty_buffer_space_avail(struct tty_port *port)
|
2013-06-15 21:36:08 +08:00
|
|
|
{
|
2013-11-23 01:09:56 +08:00
|
|
|
int space = port->buf.mem_limit - atomic_read(&port->buf.mem_used);
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2013-06-15 21:36:08 +08:00
|
|
|
return max(space, 0);
|
|
|
|
}
|
2013-11-23 02:06:08 +08:00
|
|
|
EXPORT_SYMBOL_GPL(tty_buffer_space_avail);
|
2013-06-15 21:36:08 +08:00
|
|
|
|
2013-06-15 21:36:03 +08:00
|
|
|
static void tty_buffer_reset(struct tty_buffer *p, size_t size)
|
|
|
|
{
|
|
|
|
p->used = 0;
|
|
|
|
p->size = size;
|
|
|
|
p->next = NULL;
|
|
|
|
p->commit = 0;
|
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
|
|
|
p->lookahead = 0;
|
2013-06-15 21:36:03 +08:00
|
|
|
p->read = 0;
|
2013-12-09 22:23:52 +08:00
|
|
|
p->flags = 0;
|
2013-06-15 21:36:03 +08:00
|
|
|
}
|
|
|
|
|
2008-10-13 17:36:58 +08:00
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_free_all - free buffers used by a tty
|
|
|
|
* @port: tty port to free from
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Remove all the buffers pending on a tty whether queued with data or in the
|
|
|
|
* free ring. Must be called when the tty is no longer in use.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2012-10-19 04:26:47 +08:00
|
|
|
void tty_buffer_free_all(struct tty_port *port)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2012-10-19 04:26:47 +08:00
|
|
|
struct tty_bufhead *buf = &port->buf;
|
2013-06-15 21:36:06 +08:00
|
|
|
struct tty_buffer *p, *next;
|
|
|
|
struct llist_node *llist;
|
2018-09-07 21:19:06 +08:00
|
|
|
unsigned int freed = 0;
|
|
|
|
int still_used;
|
2012-10-19 04:26:45 +08:00
|
|
|
|
2013-06-15 21:36:05 +08:00
|
|
|
while ((p = buf->head) != NULL) {
|
|
|
|
buf->head = p->next;
|
2018-09-07 21:19:06 +08:00
|
|
|
freed += p->size;
|
2013-06-15 21:36:07 +08:00
|
|
|
if (p->size > 0)
|
|
|
|
kfree(p);
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
2013-06-15 21:36:06 +08:00
|
|
|
llist = llist_del_all(&buf->free);
|
|
|
|
llist_for_each_entry_safe(p, next, llist, free)
|
2013-06-15 21:36:05 +08:00
|
|
|
kfree(p);
|
2013-06-15 21:36:06 +08:00
|
|
|
|
2013-06-15 21:36:07 +08:00
|
|
|
tty_buffer_reset(&buf->sentinel, 0);
|
|
|
|
buf->head = &buf->sentinel;
|
|
|
|
buf->tail = &buf->sentinel;
|
2013-06-15 21:36:08 +08:00
|
|
|
|
2018-09-07 21:19:06 +08:00
|
|
|
still_used = atomic_xchg(&buf->mem_used, 0);
|
|
|
|
WARN(still_used != freed, "we still have not freed %d bytes!",
|
|
|
|
still_used - freed);
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_alloc - allocate a tty buffer
|
|
|
|
* @port: tty port
|
|
|
|
* @size: desired size (characters)
|
|
|
|
*
|
|
|
|
* Allocate a new tty buffer to hold the desired number of characters. We
|
|
|
|
* round our buffers off in 256 character chunks to get better allocation
|
|
|
|
* behaviour.
|
|
|
|
*
|
|
|
|
* Returns: %NULL if out of memory or the allocation would exceed the per
|
|
|
|
* device queue.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2012-10-19 04:26:47 +08:00
|
|
|
static struct tty_buffer *tty_buffer_alloc(struct tty_port *port, size_t size)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2013-06-15 21:36:06 +08:00
|
|
|
struct llist_node *free;
|
2008-10-13 17:36:58 +08:00
|
|
|
struct tty_buffer *p;
|
|
|
|
|
2013-06-15 21:36:04 +08:00
|
|
|
/* Round the buffer size out */
|
|
|
|
size = __ALIGN_MASK(size, TTYB_ALIGN_MASK);
|
|
|
|
|
|
|
|
if (size <= MIN_TTYB_SIZE) {
|
2013-06-15 21:36:06 +08:00
|
|
|
free = llist_del_first(&port->buf.free);
|
|
|
|
if (free) {
|
|
|
|
p = llist_entry(free, struct tty_buffer, free);
|
2013-06-15 21:36:04 +08:00
|
|
|
goto found;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/* Should possibly check if this fails for the largest buffer we
|
2021-05-12 17:26:13 +08:00
|
|
|
* have queued and recycle that ?
|
|
|
|
*/
|
2013-11-23 01:09:56 +08:00
|
|
|
if (atomic_read(&port->buf.mem_used) > port->buf.mem_limit)
|
2008-10-13 17:36:58 +08:00
|
|
|
return NULL;
|
2022-05-13 11:38:37 +08:00
|
|
|
p = kmalloc(sizeof(struct tty_buffer) + 2 * size,
|
|
|
|
GFP_ATOMIC | __GFP_NOWARN);
|
2008-10-13 17:36:58 +08:00
|
|
|
if (p == NULL)
|
|
|
|
return NULL;
|
2013-06-15 21:36:03 +08:00
|
|
|
|
2013-06-15 21:36:04 +08:00
|
|
|
found:
|
2013-06-15 21:36:03 +08:00
|
|
|
tty_buffer_reset(p, size);
|
2013-11-23 01:09:56 +08:00
|
|
|
atomic_add(size, &port->buf.mem_used);
|
2008-10-13 17:36:58 +08:00
|
|
|
return p;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_free - free a tty buffer
|
|
|
|
* @port: tty port owning the buffer
|
|
|
|
* @b: the buffer to free
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Free a tty buffer, or add it to the free list according to our internal
|
|
|
|
* strategy.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2012-10-19 04:26:47 +08:00
|
|
|
static void tty_buffer_free(struct tty_port *port, struct tty_buffer *b)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2012-10-19 04:26:47 +08:00
|
|
|
struct tty_bufhead *buf = &port->buf;
|
2012-10-19 04:26:45 +08:00
|
|
|
|
2008-10-13 17:36:58 +08:00
|
|
|
/* Dumb strategy for now - should keep some stats */
|
2013-11-23 01:09:56 +08:00
|
|
|
WARN_ON(atomic_sub_return(b->size, &buf->mem_used) < 0);
|
2008-10-13 17:36:58 +08:00
|
|
|
|
2013-06-15 21:36:02 +08:00
|
|
|
if (b->size > MIN_TTYB_SIZE)
|
2008-10-13 17:36:58 +08:00
|
|
|
kfree(b);
|
2013-06-15 21:36:07 +08:00
|
|
|
else if (b->size > 0)
|
2013-06-15 21:36:06 +08:00
|
|
|
llist_add(&b->free, &buf->free);
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_flush - flush full tty buffers
|
|
|
|
* @tty: tty to flush
|
|
|
|
* @ld: optional ldisc ptr (must be referenced)
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Flush all the buffers containing receive data. If @ld != %NULL, flush the
|
|
|
|
* ldisc input buffer.
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Locking: takes buffer lock to ensure single-threaded flip buffer 'consumer'.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2014-11-06 01:13:09 +08:00
|
|
|
void tty_buffer_flush(struct tty_struct *tty, struct tty_ldisc *ld)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2012-10-19 04:26:44 +08:00
|
|
|
struct tty_port *port = tty->port;
|
2012-10-19 04:26:47 +08:00
|
|
|
struct tty_bufhead *buf = &port->buf;
|
2013-06-15 21:36:14 +08:00
|
|
|
struct tty_buffer *next;
|
2008-10-13 17:36:58 +08:00
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
atomic_inc(&buf->priority);
|
2013-06-15 21:36:10 +08:00
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
mutex_lock(&buf->lock);
|
2015-09-17 23:17:09 +08:00
|
|
|
/* paired w/ release in __tty_buffer_request_room; ensures there are
|
|
|
|
* no pending memory accesses to the freed buffer
|
|
|
|
*/
|
|
|
|
while ((next = smp_load_acquire(&buf->head->next)) != NULL) {
|
2013-06-15 21:36:14 +08:00
|
|
|
tty_buffer_free(port, buf->head);
|
|
|
|
buf->head = next;
|
|
|
|
}
|
|
|
|
buf->head->read = buf->head->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
|
|
|
buf->head->lookahead = buf->head->read;
|
2014-11-06 01:13:09 +08:00
|
|
|
|
|
|
|
if (ld && ld->ops->flush_buffer)
|
|
|
|
ld->ops->flush_buffer(tty);
|
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
atomic_dec(&buf->priority);
|
|
|
|
mutex_unlock(&buf->lock);
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* __tty_buffer_request_room - grow tty buffer if needed
|
|
|
|
* @port: tty port
|
|
|
|
* @size: size desired
|
|
|
|
* @flags: buffer flags if new buffer allocated (default = 0)
|
|
|
|
*
|
|
|
|
* Make at least @size bytes of linear space available for the tty buffer.
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Will change over to a new buffer if the current buffer is encoded as
|
|
|
|
* %TTY_NORMAL (so has no flags buffer) and the new buffer requires a flags
|
|
|
|
* buffer.
|
2013-12-09 22:23:52 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Returns: the size we managed to find.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2013-12-09 22:23:52 +08:00
|
|
|
static int __tty_buffer_request_room(struct tty_port *port, size_t size,
|
|
|
|
int flags)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2012-10-19 04:26:47 +08:00
|
|
|
struct tty_bufhead *buf = &port->buf;
|
2008-10-13 17:36:58 +08:00
|
|
|
struct tty_buffer *b, *n;
|
2013-12-09 22:23:52 +08:00
|
|
|
int left, change;
|
2013-06-15 21:36:09 +08:00
|
|
|
|
2012-10-19 04:26:45 +08:00
|
|
|
b = buf->tail;
|
2013-12-09 22:23:52 +08:00
|
|
|
if (b->flags & TTYB_NORMAL)
|
|
|
|
left = 2 * b->size - b->used;
|
|
|
|
else
|
|
|
|
left = b->size - b->used;
|
2008-10-13 17:36:58 +08:00
|
|
|
|
2013-12-09 22:23:52 +08:00
|
|
|
change = (b->flags & TTYB_NORMAL) && (~flags & TTYB_NORMAL);
|
|
|
|
if (change || left < size) {
|
2008-10-13 17:36:58 +08:00
|
|
|
/* This is the slow path - looking for new buffers to use */
|
2015-04-30 17:22:17 +08:00
|
|
|
n = tty_buffer_alloc(port, size);
|
|
|
|
if (n != NULL) {
|
2013-12-09 22:23:52 +08:00
|
|
|
n->flags = flags;
|
2012-10-19 04:26:45 +08:00
|
|
|
buf->tail = n;
|
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
|
|
|
/*
|
|
|
|
* Paired w/ acquire in flush_to_ldisc() and lookahead_bufs()
|
|
|
|
* ensures they see all buffer data.
|
2015-09-17 23:17:10 +08:00
|
|
|
*/
|
|
|
|
smp_store_release(&b->commit, b->used);
|
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
|
|
|
/*
|
|
|
|
* Paired w/ acquire in flush_to_ldisc() and lookahead_bufs()
|
|
|
|
* ensures the latest commit value can be read before the head
|
|
|
|
* is advanced to the next buffer.
|
2014-05-02 22:56:12 +08:00
|
|
|
*/
|
2015-07-13 08:50:49 +08:00
|
|
|
smp_store_release(&b->next, n);
|
2013-12-09 22:23:52 +08:00
|
|
|
} else if (change)
|
|
|
|
size = 0;
|
|
|
|
else
|
2008-10-13 17:36:58 +08:00
|
|
|
size = left;
|
|
|
|
}
|
|
|
|
return size;
|
|
|
|
}
|
2013-12-09 22:23:52 +08:00
|
|
|
|
|
|
|
int tty_buffer_request_room(struct tty_port *port, size_t size)
|
|
|
|
{
|
|
|
|
return __tty_buffer_request_room(port, size, 0);
|
|
|
|
}
|
2008-10-13 17:36:58 +08:00
|
|
|
EXPORT_SYMBOL_GPL(tty_buffer_request_room);
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_insert_flip_string_fixed_flag - add characters to the tty buffer
|
|
|
|
* @port: tty port
|
|
|
|
* @chars: characters
|
|
|
|
* @flag: flag value for each character
|
|
|
|
* @size: size
|
|
|
|
*
|
|
|
|
* Queue a series of bytes to the tty buffering. All the characters passed are
|
|
|
|
* marked with the supplied flag.
|
|
|
|
*
|
|
|
|
* Returns: the number added.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2013-01-03 22:53:02 +08:00
|
|
|
int tty_insert_flip_string_fixed_flag(struct tty_port *port,
|
2010-02-19 00:43:54 +08:00
|
|
|
const unsigned char *chars, char flag, size_t size)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
|
|
|
int copied = 0;
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2008-10-13 17:36:58 +08:00
|
|
|
do {
|
2010-03-09 18:54:28 +08:00
|
|
|
int goal = min_t(size_t, size - copied, TTY_BUFFER_PAGE);
|
2013-12-09 22:23:52 +08:00
|
|
|
int flags = (flag == TTY_NORMAL) ? TTYB_NORMAL : 0;
|
|
|
|
int space = __tty_buffer_request_room(port, goal, flags);
|
2013-01-19 22:16:20 +08:00
|
|
|
struct tty_buffer *tb = port->buf.tail;
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2013-06-15 21:36:07 +08:00
|
|
|
if (unlikely(space == 0))
|
2008-10-13 17:36:58 +08:00
|
|
|
break;
|
2013-06-15 21:36:01 +08:00
|
|
|
memcpy(char_buf_ptr(tb, tb->used), chars, space);
|
2013-12-09 22:23:52 +08:00
|
|
|
if (~tb->flags & TTYB_NORMAL)
|
|
|
|
memset(flag_buf_ptr(tb, tb->used), flag, space);
|
2008-10-13 17:36:58 +08:00
|
|
|
tb->used += space;
|
|
|
|
copied += space;
|
|
|
|
chars += space;
|
|
|
|
/* There is a small chance that we need to split the data over
|
2021-05-12 17:26:13 +08:00
|
|
|
* several buffers. If this is the case we must loop.
|
|
|
|
*/
|
2008-10-13 17:36:58 +08:00
|
|
|
} while (unlikely(size > copied));
|
|
|
|
return copied;
|
|
|
|
}
|
2010-02-19 00:43:54 +08:00
|
|
|
EXPORT_SYMBOL(tty_insert_flip_string_fixed_flag);
|
2008-10-13 17:36:58 +08:00
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_insert_flip_string_flags - add characters to the tty buffer
|
|
|
|
* @port: tty port
|
|
|
|
* @chars: characters
|
|
|
|
* @flags: flag bytes
|
|
|
|
* @size: size
|
|
|
|
*
|
|
|
|
* Queue a series of bytes to the tty buffering. For each character the flags
|
|
|
|
* array indicates the status of the character.
|
|
|
|
*
|
|
|
|
* Returns: the number added.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2013-01-03 22:53:02 +08:00
|
|
|
int tty_insert_flip_string_flags(struct tty_port *port,
|
2008-10-13 17:36:58 +08:00
|
|
|
const unsigned char *chars, const char *flags, size_t size)
|
|
|
|
{
|
|
|
|
int copied = 0;
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2008-10-13 17:36:58 +08:00
|
|
|
do {
|
2010-03-09 18:54:28 +08:00
|
|
|
int goal = min_t(size_t, size - copied, TTY_BUFFER_PAGE);
|
2013-01-19 22:16:20 +08:00
|
|
|
int space = tty_buffer_request_room(port, goal);
|
|
|
|
struct tty_buffer *tb = port->buf.tail;
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2013-06-15 21:36:07 +08:00
|
|
|
if (unlikely(space == 0))
|
2008-10-13 17:36:58 +08:00
|
|
|
break;
|
2013-06-15 21:36:01 +08:00
|
|
|
memcpy(char_buf_ptr(tb, tb->used), chars, space);
|
|
|
|
memcpy(flag_buf_ptr(tb, tb->used), flags, space);
|
2008-10-13 17:36:58 +08:00
|
|
|
tb->used += space;
|
|
|
|
copied += space;
|
|
|
|
chars += space;
|
|
|
|
flags += space;
|
|
|
|
/* There is a small chance that we need to split the data over
|
2021-05-12 17:26:13 +08:00
|
|
|
* several buffers. If this is the case we must loop.
|
|
|
|
*/
|
2008-10-13 17:36:58 +08:00
|
|
|
} while (unlikely(size > copied));
|
|
|
|
return copied;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(tty_insert_flip_string_flags);
|
|
|
|
|
2017-06-21 05:10:41 +08:00
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* __tty_insert_flip_char - add one character to the tty buffer
|
|
|
|
* @port: tty port
|
|
|
|
* @ch: character
|
|
|
|
* @flag: flag byte
|
2017-06-21 05:10:41 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Queue a single byte @ch to the tty buffering, with an optional flag. This is
|
|
|
|
* the slow path of tty_insert_flip_char().
|
2017-06-21 05:10:41 +08:00
|
|
|
*/
|
|
|
|
int __tty_insert_flip_char(struct tty_port *port, unsigned char ch, char flag)
|
|
|
|
{
|
2017-08-02 19:11:39 +08:00
|
|
|
struct tty_buffer *tb;
|
2017-06-21 05:10:41 +08:00
|
|
|
int flags = (flag == TTY_NORMAL) ? TTYB_NORMAL : 0;
|
|
|
|
|
2017-06-21 05:10:42 +08:00
|
|
|
if (!__tty_buffer_request_room(port, 1, flags))
|
2017-06-21 05:10:41 +08:00
|
|
|
return 0;
|
|
|
|
|
2017-08-02 19:11:39 +08:00
|
|
|
tb = port->buf.tail;
|
2017-06-21 05:10:42 +08:00
|
|
|
if (~tb->flags & TTYB_NORMAL)
|
|
|
|
*flag_buf_ptr(tb, tb->used) = flag;
|
2017-06-21 05:10:41 +08:00
|
|
|
*char_buf_ptr(tb, tb->used++) = ch;
|
|
|
|
|
|
|
|
return 1;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(__tty_insert_flip_char);
|
|
|
|
|
2008-10-13 17:36:58 +08:00
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_prepare_flip_string - make room for characters
|
|
|
|
* @port: tty port
|
|
|
|
* @chars: return pointer for character write area
|
|
|
|
* @size: desired size
|
|
|
|
*
|
|
|
|
* Prepare a block of space in the buffer for data.
|
|
|
|
*
|
|
|
|
* This is used for drivers that need their own block copy routines into the
|
|
|
|
* buffer. There is no guarantee the buffer is a DMA target!
|
|
|
|
*
|
|
|
|
* Returns: the length available and buffer pointer (@chars) to the space which
|
|
|
|
* is now allocated and accounted for as ready for normal characters.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2013-01-03 22:53:02 +08:00
|
|
|
int tty_prepare_flip_string(struct tty_port *port, unsigned char **chars,
|
2012-10-19 04:26:47 +08:00
|
|
|
size_t size)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2013-12-09 22:23:52 +08:00
|
|
|
int space = __tty_buffer_request_room(port, size, TTYB_NORMAL);
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2008-10-13 17:36:58 +08:00
|
|
|
if (likely(space)) {
|
2013-01-19 22:16:20 +08:00
|
|
|
struct tty_buffer *tb = port->buf.tail;
|
2021-05-12 17:26:11 +08:00
|
|
|
|
2013-06-15 21:36:01 +08:00
|
|
|
*chars = char_buf_ptr(tb, tb->used);
|
2013-12-09 22:23:52 +08:00
|
|
|
if (~tb->flags & TTYB_NORMAL)
|
|
|
|
memset(flag_buf_ptr(tb, tb->used), TTY_NORMAL, space);
|
2008-10-13 17:36:58 +08:00
|
|
|
tb->used += space;
|
|
|
|
}
|
|
|
|
return space;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(tty_prepare_flip_string);
|
|
|
|
|
2016-01-11 12:36:13 +08:00
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_ldisc_receive_buf - forward data to line discipline
|
|
|
|
* @ld: line discipline to process input
|
|
|
|
* @p: char buffer
|
|
|
|
* @f: %TTY_NORMAL, %TTY_BREAK, etc. flags buffer
|
|
|
|
* @count: number of bytes to process
|
2016-01-11 12:36:13 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Callers other than flush_to_ldisc() need to exclude the kworker from
|
|
|
|
* concurrent use of the line discipline, see paste_selection().
|
2016-01-11 12:36:13 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Returns: the number of bytes processed.
|
2016-01-11 12:36:13 +08:00
|
|
|
*/
|
2017-01-17 06:54:31 +08:00
|
|
|
int tty_ldisc_receive_buf(struct tty_ldisc *ld, const unsigned char *p,
|
2021-05-05 17:19:04 +08:00
|
|
|
const char *f, int count)
|
2016-01-11 12:36:13 +08:00
|
|
|
{
|
|
|
|
if (ld->ops->receive_buf2)
|
|
|
|
count = ld->ops->receive_buf2(ld->tty, p, f, count);
|
|
|
|
else {
|
|
|
|
count = min_t(int, count, ld->tty->receive_room);
|
|
|
|
if (count && ld->ops->receive_buf)
|
|
|
|
ld->ops->receive_buf(ld->tty, p, f, count);
|
|
|
|
}
|
|
|
|
return count;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(tty_ldisc_receive_buf);
|
2008-10-13 17:36:58 +08:00
|
|
|
|
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
|
|
|
static void lookahead_bufs(struct tty_port *port, struct tty_buffer *head)
|
|
|
|
{
|
|
|
|
head->lookahead = max(head->lookahead, head->read);
|
|
|
|
|
|
|
|
while (head) {
|
|
|
|
struct tty_buffer *next;
|
|
|
|
unsigned char *p, *f = NULL;
|
|
|
|
unsigned int count;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Paired w/ release in __tty_buffer_request_room();
|
|
|
|
* ensures commit value read is not stale if the head
|
|
|
|
* is advancing to the next buffer.
|
|
|
|
*/
|
|
|
|
next = smp_load_acquire(&head->next);
|
|
|
|
/*
|
|
|
|
* Paired w/ release in __tty_buffer_request_room() or in
|
|
|
|
* tty_buffer_flush(); ensures we see the committed buffer data.
|
|
|
|
*/
|
|
|
|
count = smp_load_acquire(&head->commit) - head->lookahead;
|
|
|
|
if (!count) {
|
|
|
|
head = next;
|
|
|
|
continue;
|
|
|
|
}
|
|
|
|
|
|
|
|
p = char_buf_ptr(head, head->lookahead);
|
|
|
|
if (~head->flags & TTYB_NORMAL)
|
|
|
|
f = flag_buf_ptr(head, head->lookahead);
|
|
|
|
|
|
|
|
port->client_ops->lookahead_buf(port, p, f, count);
|
|
|
|
head->lookahead += count;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2013-06-15 21:14:14 +08:00
|
|
|
static int
|
2017-02-03 03:48:05 +08:00
|
|
|
receive_buf(struct tty_port *port, struct tty_buffer *head, int count)
|
2013-06-15 21:14:14 +08:00
|
|
|
{
|
2013-06-15 21:36:01 +08:00
|
|
|
unsigned char *p = char_buf_ptr(head, head->read);
|
2021-05-05 17:19:04 +08:00
|
|
|
const char *f = NULL;
|
2018-10-05 02:06:13 +08:00
|
|
|
int n;
|
2013-12-09 22:23:52 +08:00
|
|
|
|
|
|
|
if (~head->flags & TTYB_NORMAL)
|
|
|
|
f = flag_buf_ptr(head, head->read);
|
2013-06-15 21:14:14 +08:00
|
|
|
|
2018-10-05 02:06:13 +08:00
|
|
|
n = port->client_ops->receive_buf(port, p, f, count);
|
|
|
|
if (n > 0)
|
|
|
|
memset(p, 0, n);
|
|
|
|
return n;
|
2013-06-15 21:14:14 +08:00
|
|
|
}
|
2008-10-13 17:36:58 +08:00
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* flush_to_ldisc - flush data from buffer to ldisc
|
|
|
|
* @work: tty structure passed from work queue.
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* This routine is called out of the software interrupt to flush data from the
|
|
|
|
* buffer chain to the line discipline.
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* The receive_buf() method is single threaded for each tty instance.
|
2013-06-15 21:36:10 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Locking: takes buffer lock to ensure single-threaded flip buffer 'consumer'.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
|
|
|
static void flush_to_ldisc(struct work_struct *work)
|
|
|
|
{
|
2012-10-19 04:26:47 +08:00
|
|
|
struct tty_port *port = container_of(work, struct tty_port, buf.work);
|
|
|
|
struct tty_bufhead *buf = &port->buf;
|
2008-10-13 17:36:58 +08:00
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
mutex_lock(&buf->lock);
|
2009-10-14 23:59:49 +08:00
|
|
|
|
2013-06-15 21:36:11 +08:00
|
|
|
while (1) {
|
|
|
|
struct tty_buffer *head = buf->head;
|
2014-05-02 22:56:12 +08:00
|
|
|
struct tty_buffer *next;
|
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 count, rcvd;
|
2013-06-15 21:36:11 +08:00
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
/* Ldisc or user is trying to gain exclusive access */
|
|
|
|
if (atomic_read(&buf->priority))
|
2013-06-15 21:36:11 +08:00
|
|
|
break;
|
|
|
|
|
2015-07-13 08:50:49 +08:00
|
|
|
/* paired w/ release in __tty_buffer_request_room();
|
2014-05-02 22:56:12 +08:00
|
|
|
* ensures commit value read is not stale if the head
|
|
|
|
* is advancing to the next buffer
|
|
|
|
*/
|
2015-07-13 08:50:49 +08:00
|
|
|
next = smp_load_acquire(&head->next);
|
2015-09-17 23:17:10 +08:00
|
|
|
/* paired w/ release in __tty_buffer_request_room() or in
|
|
|
|
* tty_buffer_flush(); ensures we see the committed buffer data
|
|
|
|
*/
|
|
|
|
count = smp_load_acquire(&head->commit) - head->read;
|
2013-06-15 21:36:11 +08:00
|
|
|
if (!count) {
|
2016-03-07 05:16:30 +08:00
|
|
|
if (next == NULL)
|
2013-06-15 21:14:14 +08:00
|
|
|
break;
|
2014-05-02 22:56:12 +08:00
|
|
|
buf->head = next;
|
2013-06-15 21:36:11 +08:00
|
|
|
tty_buffer_free(port, head);
|
|
|
|
continue;
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
2013-06-15 21:36:11 +08:00
|
|
|
|
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
|
|
|
rcvd = receive_buf(port, head, count);
|
|
|
|
head->read += rcvd;
|
|
|
|
if (rcvd < count)
|
|
|
|
lookahead_bufs(port, head);
|
|
|
|
if (!rcvd)
|
2013-06-15 21:36:11 +08:00
|
|
|
break;
|
2021-10-11 22:08:24 +08:00
|
|
|
|
|
|
|
if (need_resched())
|
|
|
|
cond_resched();
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
2009-10-14 23:59:49 +08:00
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
mutex_unlock(&buf->lock);
|
2008-10-13 17:36:58 +08:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_flip_buffer_push - push terminal buffers
|
|
|
|
* @port: tty port to push
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Queue a push of the terminal flip buffers to the line discipline. Can be
|
|
|
|
* called from IRQ/atomic context.
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* In the event of the queue being busy for flipping the work will be held off
|
|
|
|
* and retried later.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2013-01-03 22:53:06 +08:00
|
|
|
void tty_flip_buffer_push(struct tty_port *port)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2021-11-22 19:16:48 +08:00
|
|
|
struct tty_bufhead *buf = &port->buf;
|
|
|
|
|
|
|
|
/*
|
|
|
|
* Paired w/ acquire in flush_to_ldisc(); ensures flush_to_ldisc() sees
|
|
|
|
* buffer data.
|
|
|
|
*/
|
|
|
|
smp_store_release(&buf->tail->commit, buf->tail->used);
|
|
|
|
queue_work(system_unbound_wq, &buf->work);
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
|
|
|
EXPORT_SYMBOL(tty_flip_buffer_push);
|
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_init - prepare a tty buffer structure
|
|
|
|
* @port: tty port to initialise
|
2008-10-13 17:36:58 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Set up the initial state of the buffer management for a tty device. Must be
|
|
|
|
* called before the other tty buffer functions are used.
|
2008-10-13 17:36:58 +08:00
|
|
|
*/
|
2012-10-19 04:26:47 +08:00
|
|
|
void tty_buffer_init(struct tty_port *port)
|
2008-10-13 17:36:58 +08:00
|
|
|
{
|
2012-10-19 04:26:47 +08:00
|
|
|
struct tty_bufhead *buf = &port->buf;
|
2012-10-19 04:26:45 +08:00
|
|
|
|
2013-06-15 21:36:15 +08:00
|
|
|
mutex_init(&buf->lock);
|
2013-06-15 21:36:07 +08:00
|
|
|
tty_buffer_reset(&buf->sentinel, 0);
|
|
|
|
buf->head = &buf->sentinel;
|
|
|
|
buf->tail = &buf->sentinel;
|
2013-06-15 21:36:06 +08:00
|
|
|
init_llist_head(&buf->free);
|
2013-11-23 01:09:56 +08:00
|
|
|
atomic_set(&buf->mem_used, 0);
|
2013-06-15 21:36:15 +08:00
|
|
|
atomic_set(&buf->priority, 0);
|
2012-10-19 04:26:45 +08:00
|
|
|
INIT_WORK(&buf->work, flush_to_ldisc);
|
2013-11-23 01:09:55 +08:00
|
|
|
buf->mem_limit = TTYB_DEFAULT_MEM_LIMIT;
|
2008-10-13 17:36:58 +08:00
|
|
|
}
|
2013-11-23 01:09:55 +08:00
|
|
|
|
|
|
|
/**
|
2021-11-26 16:16:02 +08:00
|
|
|
* tty_buffer_set_limit - change the tty buffer memory limit
|
|
|
|
* @port: tty port to change
|
|
|
|
* @limit: memory limit to set
|
|
|
|
*
|
|
|
|
* Change the tty buffer memory limit.
|
2013-11-23 01:09:55 +08:00
|
|
|
*
|
2021-11-26 16:16:02 +08:00
|
|
|
* Must be called before the other tty buffer functions are used.
|
2013-11-23 01:09:55 +08:00
|
|
|
*/
|
|
|
|
int tty_buffer_set_limit(struct tty_port *port, int limit)
|
|
|
|
{
|
|
|
|
if (limit < MIN_TTYB_SIZE)
|
|
|
|
return -EINVAL;
|
|
|
|
port->buf.mem_limit = limit;
|
|
|
|
return 0;
|
|
|
|
}
|
|
|
|
EXPORT_SYMBOL_GPL(tty_buffer_set_limit);
|
2015-01-18 04:42:05 +08:00
|
|
|
|
|
|
|
/* slave ptys can claim nested buffer lock when handling BRK and INTR */
|
|
|
|
void tty_buffer_set_lock_subclass(struct tty_port *port)
|
|
|
|
{
|
|
|
|
lockdep_set_subclass(&port->buf.lock, TTY_LOCK_SLAVE);
|
|
|
|
}
|
2015-10-18 04:36:23 +08:00
|
|
|
|
|
|
|
bool tty_buffer_restart_work(struct tty_port *port)
|
|
|
|
{
|
|
|
|
return queue_work(system_unbound_wq, &port->buf.work);
|
|
|
|
}
|
|
|
|
|
|
|
|
bool tty_buffer_cancel_work(struct tty_port *port)
|
|
|
|
{
|
|
|
|
return cancel_work_sync(&port->buf.work);
|
|
|
|
}
|
2016-03-07 05:16:30 +08:00
|
|
|
|
|
|
|
void tty_buffer_flush_work(struct tty_port *port)
|
|
|
|
{
|
|
|
|
flush_work(&port->buf.work);
|
|
|
|
}
|