Loading...
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 | /* lists.c -- Buffer list handling routines -*- linux-c -*- * Created: Mon Apr 19 20:54:22 1999 by faith@precisioninsight.com * Revised: Fri Aug 20 09:27:01 1999 by faith@precisioninsight.com * * Copyright 1999 Precision Insight, Inc., Cedar Park, Texas. * All Rights Reserved. * * Permission is hereby granted, free of charge, to any person obtaining a * copy of this software and associated documentation files (the "Software"), * to deal in the Software without restriction, including without limitation * the rights to use, copy, modify, merge, publish, distribute, sublicense, * and/or sell copies of the Software, and to permit persons to whom the * Software is furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice (including the next * paragraph) shall be included in all copies or substantial portions of the * Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL * PRECISION INSIGHT AND/OR ITS SUPPLIERS BE LIABLE FOR ANY CLAIM, DAMAGES OR * OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, * ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER * DEALINGS IN THE SOFTWARE. * * $PI: xc/programs/Xserver/hw/xfree86/os-support/linux/drm/generic/lists.c,v 1.3 1999/08/20 15:07:02 faith Exp $ * $XFree86$ * */ #define __NO_VERSION__ #include "drmP.h" int drm_waitlist_create(drm_waitlist_t *bl, int count) { DRM_DEBUG("%d\n", count); if (bl->count) return -EINVAL; bl->count = count; bl->bufs = drm_alloc((bl->count + 2) * sizeof(*bl->bufs), DRM_MEM_BUFLISTS); bl->rp = bl->bufs; bl->wp = bl->bufs; bl->end = &bl->bufs[bl->count+1]; bl->write_lock = SPIN_LOCK_UNLOCKED; bl->read_lock = SPIN_LOCK_UNLOCKED; return 0; } int drm_waitlist_destroy(drm_waitlist_t *bl) { DRM_DEBUG("\n"); if (bl->rp != bl->wp) return -EINVAL; if (bl->bufs) drm_free(bl->bufs, (bl->count + 2) * sizeof(*bl->bufs), DRM_MEM_BUFLISTS); bl->count = 0; bl->bufs = NULL; bl->rp = NULL; bl->wp = NULL; bl->end = NULL; return 0; } int drm_waitlist_put(drm_waitlist_t *bl, drm_buf_t *buf) { int left; unsigned long flags; left = DRM_LEFTCOUNT(bl); DRM_DEBUG("put %d (%d left, rp = %p, wp = %p)\n", buf->idx, left, bl->rp, bl->wp); if (!left) { DRM_ERROR("Overflow while adding buffer %d from pid %d\n", buf->idx, buf->pid); return -EINVAL; } #if DRM_DMA_HISTOGRAM buf->time_queued = get_cycles(); #endif buf->list = DRM_LIST_WAIT; spin_lock_irqsave(&bl->write_lock, flags); *bl->wp = buf; if (++bl->wp >= bl->end) bl->wp = bl->bufs; spin_unlock_irqrestore(&bl->write_lock, flags); return 0; } drm_buf_t *drm_waitlist_get(drm_waitlist_t *bl) { drm_buf_t *buf; unsigned long flags; spin_lock_irqsave(&bl->read_lock, flags); buf = *bl->rp; if (bl->rp == bl->wp) { spin_unlock_irqrestore(&bl->read_lock, flags); return NULL; } if (++bl->rp >= bl->end) bl->rp = bl->bufs; spin_unlock_irqrestore(&bl->read_lock, flags); DRM_DEBUG("get %d\n", buf->idx); return buf; } int drm_freelist_create(drm_freelist_t *bl, int count) { DRM_DEBUG("\n"); atomic_set(&bl->count, 0); bl->next = NULL; init_waitqueue_head(&bl->waiting); bl->low_mark = 0; bl->high_mark = 0; atomic_set(&bl->wfh, 0); ++bl->initialized; return 0; } int drm_freelist_destroy(drm_freelist_t *bl) { DRM_DEBUG("\n"); atomic_set(&bl->count, 0); bl->next = NULL; return 0; } int drm_freelist_put(drm_device_t *dev, drm_freelist_t *bl, drm_buf_t *buf) { unsigned int old; unsigned int new; char failed; int count = 0; drm_device_dma_t *dma = dev->dma; if (!dma) { DRM_ERROR("No DMA support\n"); return 1; } if (buf->waiting || buf->pending || buf->list == DRM_LIST_FREE) { DRM_ERROR("Freed buffer %d: w%d, p%d, l%d\n", buf->idx, buf->waiting, buf->pending, buf->list); } DRM_DEBUG("%d, count = %d, wfh = %d, w%d, p%d\n", buf->idx, atomic_read(&bl->count), atomic_read(&bl->wfh), buf->waiting, buf->pending); if (!bl) return 1; #if DRM_DMA_HISTOGRAM buf->time_freed = get_cycles(); drm_histogram_compute(dev, buf); #endif buf->list = DRM_LIST_FREE; do { old = (unsigned long)bl->next; buf->next = (void *)old; new = (unsigned long)buf; _DRM_CAS(&bl->next, old, new, failed); if (++count > DRM_LOOPING_LIMIT) { DRM_ERROR("Looping\n"); return 1; } } while (failed); atomic_inc(&bl->count); if (atomic_read(&bl->count) > dma->buf_count) { DRM_ERROR("%d of %d buffers free after addition of %d\n", atomic_read(&bl->count), dma->buf_count, buf->idx); return 1; } /* Check for high water mark */ if (atomic_read(&bl->wfh) && atomic_read(&bl->count)>=bl->high_mark) { atomic_set(&bl->wfh, 0); wake_up_interruptible(&bl->waiting); } return 0; } static drm_buf_t *drm_freelist_try(drm_freelist_t *bl) { unsigned int old; unsigned int new; char failed; drm_buf_t *buf; int count = 0; if (!bl) return NULL; /* Get buffer */ do { old = (unsigned int)bl->next; if (!old) { return NULL; } new = (unsigned long)bl->next->next; _DRM_CAS(&bl->next, old, new, failed); if (++count > DRM_LOOPING_LIMIT) { DRM_ERROR("Looping\n"); return NULL; } } while (failed); atomic_dec(&bl->count); buf = (drm_buf_t *)old; buf->next = NULL; buf->list = DRM_LIST_NONE; DRM_DEBUG("%d, count = %d, wfh = %d, w%d, p%d\n", buf->idx, atomic_read(&bl->count), atomic_read(&bl->wfh), buf->waiting, buf->pending); if (buf->waiting || buf->pending) { DRM_ERROR("Free buffer %d: w%d, p%d, l%d\n", buf->idx, buf->waiting, buf->pending, buf->list); } return buf; } drm_buf_t *drm_freelist_get(drm_freelist_t *bl, int block) { drm_buf_t *buf = NULL; DECLARE_WAITQUEUE(entry, current); if (!bl || !bl->initialized) return NULL; /* Check for low water mark */ if (atomic_read(&bl->count) <= bl->low_mark) /* Became low */ atomic_set(&bl->wfh, 1); if (atomic_read(&bl->wfh)) { DRM_DEBUG("Block = %d, count = %d, wfh = %d\n", block, atomic_read(&bl->count), atomic_read(&bl->wfh)); if (block) { add_wait_queue(&bl->waiting, &entry); current->state = TASK_INTERRUPTIBLE; for (;;) { if (!atomic_read(&bl->wfh) && (buf = drm_freelist_try(bl))) break; schedule(); if (signal_pending(current)) break; } current->state = TASK_RUNNING; remove_wait_queue(&bl->waiting, &entry); } return buf; } DRM_DEBUG("Count = %d, wfh = %d\n", atomic_read(&bl->count), atomic_read(&bl->wfh)); return drm_freelist_try(bl); } |