aboutsummaryrefslogtreecommitdiffstats
path: root/drivers/tty/serial/xilinx_uartps.c
AgeCommit message (Expand)Author
2021-11-26serial: xilinx_uartps: Fix race condition causing stuck TXAnssi Hannula
2020-10-01serial: uartps: Wait for tx_empty in console setupRaviteja Narayanam
2020-02-14serial: uartps: Move the spinlock after the read of the tx emptyShubhrajyoti Datta
2020-02-14serial: uartps: Add a timeout to the tx empty waitShubhrajyoti Datta
2019-11-20serial: uartps: Fix suspend functionalityNava kishore Manne
2019-04-20serial: uartps: console_setup() can't be placed to init sectionMichal Simek
2019-03-23serial: uartps: Fix stuck ISR if RX disabled with non-empty FIFOAnssi Hannula
2019-01-26serial: set suppress_bind_attrs flag only if builtinAnders Roxell
2019-01-09serial: uartps: Fix interrupt mask issue to handle the RX interrupts properlyNava kishore Manne
2018-05-25serial: xuartps: Fix out-of-bounds access through DT aliasGeert Uytterhoeven
2017-07-30serial: xuartps: Remove __init marking from early writeJeffy Chen
2017-06-03serial: uartps: Fix kernel doc warningsNava kishore Manne
2017-05-18serial: xilinx_uartps: Fix the error pathShubhrajyoti Datta
2017-04-08serial: xuartps: Enable clocks in the pm disable case alsoShubhrajyoti Datta
2017-03-17serial: xuartps: Cleanup the clock enableShubhrajyoti Datta
2017-03-14serial: xilinx_uartps: Add pm runtime supportShubhrajyoti Datta
2017-01-25serial: xuartps: Enable uart loopback modeYasir-Khan
2016-10-27serial: xuartps: Add new compatible string for ZynqMPNava kishore Manne
2016-09-27serial: xuartps: Add some register initialisation to cdns_early_console_setup()Scott Telford
2016-09-27serial: xuartps: Removed unwanted checks while reading the error conditionsNava kishore Manne
2016-09-27serial: xuartps: Rewrite the interrupt handling logicAnirudha Sarangi
2016-09-22serial: xuartps: Do not enable parity error interruptAnirudha Sarangi
2016-09-22tty: serial: xuartps: Wait for rx and tx reset done statusNava kishore Manne
2016-09-22serial: xuartps: Adds RXBS register support for zynqmpNava kishore Manne
2016-09-02tty: xuartps: constify uart_ops structuresJulia Lawall
2016-06-25tty: xuartps: disable clocks when not usedShubhrajyoti Datta
2016-03-07serial: xuartps: Enable OF earlycon supportMichal Simek
2016-02-06tty: xuartps: Consolidate TX handlingSoren Brinkmann
2016-02-06tty: xuartps: Remove '_OFFSET' suffix from #definesSoren Brinkmann
2016-02-06tty: xuartps: Improve sysrq handlingSoren Brinkmann
2016-02-06tty: xuartps: Cleanup: Reformat if-elseSoren Brinkmann
2016-02-06tty: xuartps: Refactor IRQ handlingSoren Brinkmann
2016-02-06tty: xuartps: Move request_irq to after setting up the HWSoren Brinkmann
2016-02-06tty: xuartps: Move RX path into helper functionSoren Brinkmann
2016-02-06tty: xuartps: Acquire port lock for shutdownSoren Brinkmann
2016-02-06tty: xuartps: Keep lock for whole ISRSoren Brinkmann
2016-02-06tty: xuartps: Improve startup functionSoren Brinkmann
2016-02-06tty: xuartps: Clear interrupt status register in shutdownSoren Brinkmann
2016-02-06tty: xuartps: Don't consider circular buffer when enabling transmitterSoren Brinkmann
2016-02-06tty: xuartps: Use spinlock to serialize HW accessSoren Brinkmann
2016-02-06tty: xuartps: Beautify read-modify writesSoren Brinkmann
2015-05-10serial: xuartps: add __init to earlycon write methodMasahiro Yamada
2015-04-28serial: xilinx: Use platform_get_irq to get irq description structureMichal Simek
2015-03-26serial: xuartps: Fix check in console_setup().Thomas Betker
2015-03-26serial: xuartps: Get rid of register access macros.Thomas Betker
2015-03-26serial: xuartps: Fix iobase use.Thomas Betker
2015-03-26serial: xuartps: Fix cdns_uart_port[] definition.Thomas Betker
2015-03-26serial: xuartps: Fix register space size.Thomas Betker
2015-03-26tty: constify of_device_id arrayFabian Frederick
2015-03-07tty: serial: xilinx_uartps: Use Macro for ttyPS0Peter Crosthwaite
generated by cgit 1.2.3-korg (git 2.39.0) at 2024-05-22 09:03:02 +0000
"p">(void *), gfp_mask, node_id); if (!pool->elements) { kfree(pool); return NULL; } spin_lock_init(&pool->lock); pool->min_nr = min_nr; pool->pool_data = pool_data; init_waitqueue_head(&pool->wait); pool->alloc = alloc_fn; pool->free = free_fn; /* * First pre-allocate the guaranteed number of buffers. */ while (pool->curr_nr < pool->min_nr) { void *element; element = pool->alloc(gfp_mask, pool->pool_data); if (unlikely(!element)) { mempool_destroy(pool); return NULL; } add_element(pool, element); } return pool; } EXPORT_SYMBOL(mempool_create_node); /** * mempool_resize - resize an existing memory pool * @pool: pointer to the memory pool which was allocated via * mempool_create(). * @new_min_nr: the new minimum number of elements guaranteed to be * allocated for this pool. * @gfp_mask: the usual allocation bitmask. * * This function shrinks/grows the pool. In the case of growing, * it cannot be guaranteed that the pool will be grown to the new * size immediately, but new mempool_free() calls will refill it. * * Note, the caller must guarantee that no mempool_destroy is called * while this function is running. mempool_alloc() & mempool_free() * might be called (eg. from IRQ contexts) while this function executes. */ int mempool_resize(mempool_t *pool, int new_min_nr, gfp_t gfp_mask) { void *element; void **new_elements; unsigned long flags; BUG_ON(new_min_nr <= 0); spin_lock_irqsave(&pool->lock, flags); if (new_min_nr <= pool->min_nr) { while (new_min_nr < pool->curr_nr) { element = remove_element(pool); spin_unlock_irqrestore(&pool->lock, flags); pool->free(element, pool->pool_data); spin_lock_irqsave(&pool->lock, flags); } pool->min_nr = new_min_nr; goto out_unlock; } spin_unlock_irqrestore(&pool->lock, flags); /* Grow the pool */ new_elements = kmalloc(new_min_nr * sizeof(*new_elements), gfp_mask); if (!new_elements) return -ENOMEM; spin_lock_irqsave(&pool->lock, flags); if (unlikely(new_min_nr <= pool->min_nr)) { /* Raced, other resize will do our work */ spin_unlock_irqrestore(&pool->lock, flags); kfree(new_elements); goto out; } memcpy(new_elements, pool->elements, pool->curr_nr * sizeof(*new_elements)); kfree(pool->elements); pool->elements = new_elements; pool->min_nr = new_min_nr; while (pool->curr_nr < pool->min_nr) { spin_unlock_irqrestore(&pool->lock, flags); element = pool->alloc(gfp_mask, pool->pool_data); if (!element) goto out; spin_lock_irqsave(&pool->lock, flags); if (pool->curr_nr < pool->min_nr) { add_element(pool, element); } else { spin_unlock_irqrestore(&pool->lock, flags); pool->free(element, pool->pool_data); /* Raced */ goto out; } } out_unlock: spin_unlock_irqrestore(&pool->lock, flags); out: return 0; } EXPORT_SYMBOL(mempool_resize); /** * mempool_alloc - allocate an element from a specific memory pool * @pool: pointer to the memory pool which was allocated via * mempool_create(). * @gfp_mask: the usual allocation bitmask. * * this function only sleeps if the alloc_fn() function sleeps or * returns NULL. Note that due to preallocation, this function * *never* fails when called from process contexts. (it might * fail if called from an IRQ context.) */ void * mempool_alloc(mempool_t *pool, gfp_t gfp_mask) { void *element; unsigned long flags; wait_queue_t wait; gfp_t gfp_temp; might_sleep_if(gfp_mask & __GFP_WAIT); gfp_mask |= __GFP_NOMEMALLOC; /* don't allocate emergency reserves */ gfp_mask |= __GFP_NORETRY; /* don't loop in __alloc_pages */ gfp_mask |= __GFP_NOWARN; /* failures are OK */ gfp_temp = gfp_mask & ~(__GFP_WAIT|__GFP_IO); repeat_alloc: element = pool->alloc(gfp_temp, pool->pool_data); if (likely(element != NULL)) return element; spin_lock_irqsave(&pool->lock, flags); if (likely(pool->curr_nr)) { element = remove_element(pool); spin_unlock_irqrestore(&pool->lock, flags); /* paired with rmb in mempool_free(), read comment there */ smp_wmb(); return element; } /* * We use gfp mask w/o __GFP_WAIT or IO for the first round. If * alloc failed with that and @pool was empty, retry immediately. */ if (gfp_temp != gfp_mask) { spin_unlock_irqrestore(&pool->lock, flags); gfp_temp = gfp_mask; goto repeat_alloc; } /* We must not sleep if !__GFP_WAIT */ if (!(gfp_mask & __GFP_WAIT)) { spin_unlock_irqrestore(&pool->lock, flags); return NULL; } /* Let's wait for someone else to return an element to @pool */ init_wait(&wait); prepare_to_wait(&pool->wait, &wait, TASK_UNINTERRUPTIBLE); spin_unlock_irqrestore(&pool->lock, flags); /* * FIXME: this should be io_schedule(). The timeout is there as a * workaround for some DM problems in 2.6.18. */ io_schedule_timeout(5*HZ); finish_wait(&pool->wait, &wait); goto repeat_alloc; } EXPORT_SYMBOL(mempool_alloc); /** * mempool_free - return an element to the pool. * @element: pool element pointer. * @pool: pointer to the memory pool which was allocated via * mempool_create(). * * this function only sleeps if the free_fn() function sleeps. */ void mempool_free(void *element, mempool_t *pool) { unsigned long flags; if (unlikely(element == NULL)) return; /* * Paired with the wmb in mempool_alloc(). The preceding read is * for @element and the following @pool->curr_nr. This ensures * that the visible value of @pool->curr_nr is from after the * allocation of @element. This is necessary for fringe cases * where @element was passed to this task without going through * barriers. * * For example, assume @p is %NULL at the beginning and one task * performs "p = mempool_alloc(...);" while another task is doing * "while (!p) cpu_relax(); mempool_free(p, ...);". This function * may end up using curr_nr value which is from before allocation * of @p without the following rmb. */ smp_rmb(); /* * For correctness, we need a test which is guaranteed to trigger * if curr_nr + #allocated == min_nr. Testing curr_nr < min_nr * without locking achieves that and refilling as soon as possible * is desirable. * * Because curr_nr visible here is always a value after the * allocation of @element, any task which decremented curr_nr below * min_nr is guaranteed to see curr_nr < min_nr unless curr_nr gets * incremented to min_nr afterwards. If curr_nr gets incremented * to min_nr after the allocation of @element, the elements * allocated after that are subject to the same guarantee. * * Waiters happen iff curr_nr is 0 and the above guarantee also * ensures that there will be frees which return elements to the * pool waking up the waiters. */ if (unlikely(pool->curr_nr < pool->min_nr)) { spin_lock_irqsave(&pool->lock, flags); if (likely(pool->curr_nr < pool->min_nr)) { add_element(pool, element); spin_unlock_irqrestore(&pool->lock, flags); wake_up(&pool->wait); return; } spin_unlock_irqrestore(&pool->lock, flags); } pool->free(element, pool->pool_data); } EXPORT_SYMBOL(mempool_free); /* * A commonly used alloc and free fn. */ void *mempool_alloc_slab(gfp_t gfp_mask, void *pool_data) { struct kmem_cache *mem = pool_data; return kmem_cache_alloc(mem, gfp_mask); } EXPORT_SYMBOL(mempool_alloc_slab); void mempool_free_slab(void *element, void *pool_data) { struct kmem_cache *mem = pool_data; kmem_cache_free(mem, element); } EXPORT_SYMBOL(mempool_free_slab); /* * A commonly used alloc and free fn that kmalloc/kfrees the amount of memory * specified by pool_data */ void *mempool_kmalloc(gfp_t gfp_mask, void *pool_data) { size_t size = (size_t)pool_data; return kmalloc(size, gfp_mask); } EXPORT_SYMBOL(mempool_kmalloc); void mempool_kfree(void *element, void *pool_data) { kfree(element); } EXPORT_SYMBOL(mempool_kfree); /* * A simple mempool-backed page allocator that allocates pages * of the order specified by pool_data. */ void *mempool_alloc_pages(gfp_t gfp_mask, void *pool_data) { int order = (int)(long)pool_data; return alloc_pages(gfp_mask, order); } EXPORT_SYMBOL(mempool_alloc_pages); void mempool_free_pages(void *element, void *pool_data) { int order = (int)(long)pool_data; __free_pages(element, order); } EXPORT_SYMBOL(mempool_free_pages);
generated by cgit 1.2.3-korg (git 2.39.0) at 2024-05-22 09:03:01 +0000