1 1.1 jmcneill /** 2 1.1 jmcneill * Copyright (c) 2010-2012 Broadcom. All rights reserved. 3 1.1 jmcneill * 4 1.1 jmcneill * Redistribution and use in source and binary forms, with or without 5 1.1 jmcneill * modification, are permitted provided that the following conditions 6 1.1 jmcneill * are met: 7 1.1 jmcneill * 1. Redistributions of source code must retain the above copyright 8 1.1 jmcneill * notice, this list of conditions, and the following disclaimer, 9 1.1 jmcneill * without modification. 10 1.1 jmcneill * 2. Redistributions in binary form must reproduce the above copyright 11 1.1 jmcneill * notice, this list of conditions and the following disclaimer in the 12 1.1 jmcneill * documentation and/or other materials provided with the distribution. 13 1.1 jmcneill * 3. The names of the above-listed copyright holders may not be used 14 1.1 jmcneill * to endorse or promote products derived from this software without 15 1.1 jmcneill * specific prior written permission. 16 1.1 jmcneill * 17 1.1 jmcneill * ALTERNATIVELY, this software may be distributed under the terms of the 18 1.1 jmcneill * GNU General Public License ("GPL") version 2, as published by the Free 19 1.1 jmcneill * Software Foundation. 20 1.1 jmcneill * 21 1.1 jmcneill * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS 22 1.1 jmcneill * IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, 23 1.1 jmcneill * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 24 1.1 jmcneill * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR 25 1.1 jmcneill * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, 26 1.1 jmcneill * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, 27 1.1 jmcneill * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR 28 1.1 jmcneill * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF 29 1.1 jmcneill * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING 30 1.1 jmcneill * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS 31 1.1 jmcneill * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 32 1.1 jmcneill */ 33 1.1 jmcneill 34 1.1 jmcneill #include "vchiq_util.h" 35 1.1 jmcneill 36 1.1 jmcneill static inline int is_pow2(int i) 37 1.1 jmcneill { 38 1.1 jmcneill return i && !(i & (i - 1)); 39 1.1 jmcneill } 40 1.1 jmcneill 41 1.1 jmcneill int vchiu_queue_init(VCHIU_QUEUE_T *queue, int size) 42 1.1 jmcneill { 43 1.1 jmcneill WARN_ON(!is_pow2(size)); 44 1.1 jmcneill 45 1.1 jmcneill queue->size = size; 46 1.1 jmcneill queue->read = 0; 47 1.1 jmcneill queue->write = 0; 48 1.3 skrll queue->initialized = 1; 49 1.1 jmcneill 50 1.1 jmcneill _sema_init(&queue->pop, 0); 51 1.1 jmcneill _sema_init(&queue->push, 0); 52 1.1 jmcneill 53 1.1 jmcneill queue->storage = kzalloc(size * sizeof(VCHIQ_HEADER_T *), GFP_KERNEL); 54 1.1 jmcneill if (queue->storage == NULL) { 55 1.1 jmcneill vchiu_queue_delete(queue); 56 1.1 jmcneill return 0; 57 1.1 jmcneill } 58 1.1 jmcneill return 1; 59 1.1 jmcneill } 60 1.1 jmcneill 61 1.1 jmcneill void vchiu_queue_delete(VCHIU_QUEUE_T *queue) 62 1.1 jmcneill { 63 1.1 jmcneill if (queue->storage != NULL) 64 1.1 jmcneill kfree(queue->storage); 65 1.1 jmcneill } 66 1.1 jmcneill 67 1.1 jmcneill int vchiu_queue_is_empty(VCHIU_QUEUE_T *queue) 68 1.1 jmcneill { 69 1.1 jmcneill return queue->read == queue->write; 70 1.1 jmcneill } 71 1.1 jmcneill 72 1.1 jmcneill int vchiu_queue_is_full(VCHIU_QUEUE_T *queue) 73 1.1 jmcneill { 74 1.1 jmcneill return queue->write == queue->read + queue->size; 75 1.1 jmcneill } 76 1.1 jmcneill 77 1.1 jmcneill void vchiu_queue_push(VCHIU_QUEUE_T *queue, VCHIQ_HEADER_T *header) 78 1.1 jmcneill { 79 1.3 skrll if (!queue->initialized) 80 1.3 skrll return; 81 1.3 skrll 82 1.1 jmcneill while (queue->write == queue->read + queue->size) { 83 1.1 jmcneill if (down_interruptible(&queue->pop) != 0) { 84 1.1 jmcneill flush_signals(current); 85 1.1 jmcneill } 86 1.1 jmcneill } 87 1.1 jmcneill 88 1.2 skrll /* 89 1.2 skrll * Write to queue->storage must be visible after read from 90 1.2 skrll * queue->read 91 1.2 skrll */ 92 1.2 skrll smp_mb(); 93 1.2 skrll 94 1.1 jmcneill queue->storage[queue->write & (queue->size - 1)] = header; 95 1.1 jmcneill 96 1.2 skrll /* 97 1.2 skrll * Write to queue->storage must be visible before write to 98 1.2 skrll * queue->write 99 1.2 skrll */ 100 1.2 skrll smp_wmb(); 101 1.2 skrll 102 1.1 jmcneill queue->write++; 103 1.1 jmcneill 104 1.1 jmcneill up(&queue->push); 105 1.1 jmcneill } 106 1.1 jmcneill 107 1.1 jmcneill VCHIQ_HEADER_T *vchiu_queue_peek(VCHIU_QUEUE_T *queue) 108 1.1 jmcneill { 109 1.1 jmcneill while (queue->write == queue->read) { 110 1.1 jmcneill if (down_interruptible(&queue->push) != 0) { 111 1.1 jmcneill flush_signals(current); 112 1.1 jmcneill } 113 1.1 jmcneill } 114 1.1 jmcneill 115 1.1 jmcneill up(&queue->push); // We haven't removed anything from the queue. 116 1.2 skrll 117 1.2 skrll /* 118 1.2 skrll * Read from queue->storage must be visible after read from 119 1.2 skrll * queue->write 120 1.2 skrll */ 121 1.2 skrll smp_rmb(); 122 1.2 skrll 123 1.1 jmcneill return queue->storage[queue->read & (queue->size - 1)]; 124 1.1 jmcneill } 125 1.1 jmcneill 126 1.1 jmcneill VCHIQ_HEADER_T *vchiu_queue_pop(VCHIU_QUEUE_T *queue) 127 1.1 jmcneill { 128 1.1 jmcneill VCHIQ_HEADER_T *header; 129 1.1 jmcneill 130 1.1 jmcneill while (queue->write == queue->read) { 131 1.1 jmcneill if (down_interruptible(&queue->push) != 0) { 132 1.1 jmcneill flush_signals(current); 133 1.1 jmcneill } 134 1.1 jmcneill } 135 1.1 jmcneill 136 1.2 skrll /* 137 1.2 skrll * Read from queue->storage must be visible after read from 138 1.2 skrll * queue->write 139 1.2 skrll */ 140 1.2 skrll smp_rmb(); 141 1.2 skrll 142 1.1 jmcneill header = queue->storage[queue->read & (queue->size - 1)]; 143 1.1 jmcneill 144 1.2 skrll /* 145 1.2 skrll * Read from queue->storage must be visible before write to 146 1.2 skrll * queue->read 147 1.2 skrll */ 148 1.2 skrll smp_mb(); 149 1.2 skrll 150 1.1 jmcneill queue->read++; 151 1.1 jmcneill 152 1.1 jmcneill up(&queue->pop); 153 1.1 jmcneill 154 1.1 jmcneill return header; 155 1.1 jmcneill } 156