renesas/drm.git - libdrm, cloned from git://anongit.freedesktop.org/mesa/drm

diff options

author	Keith Packard <keithp@keithp.com>	2008-06-06 21:54:38 +0100
committer	Alan Hourihane <alanh@tungstengraphics.com>	2008-06-06 21:54:38 +0100
commit	c2fc142ea7e9dd651702773efbc9c3366f977aa6 (patch)
tree	aa7ff6a866fe4133bf122e4ad20f7665f8f61f22 /tests/modedemo
parent	6d4ffd12cd8d3713067adf5fa3bdcb023b0745f1 (diff)

[intel] remove settable use_mi_batchbuffer_start

The driver can know what hardware requires MI_BATCH_BUFFER vs MI_BATCH_BUFFER_START; there's no reason to let user mode configure this.

Diffstat (limited to 'tests/modedemo')

0 files changed, 0 insertions, 0 deletions

"> * 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 * VA LINUX SYSTEMS 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. * * Authors: * Eric Anholt <anholt@FreeBSD.org> * */ struct list_head { struct list_head *next, *prev; }; /* Cheat, assume the list_head is at the start of the struct */ #define list_entry(entry, type, member) (type *)(entry) static __inline__ void INIT_LIST_HEAD(struct list_head *head) { (head)->next = head; (head)->prev = head; } static __inline__ int list_empty(struct list_head *head) { return (head)->next == head; } static __inline__ void list_add_tail(struct list_head *entry, struct list_head *head) { (entry)->prev = (head)->prev; (entry)->next = head; (head)->prev->next = entry; (head)->prev = entry; } static __inline__ void list_del(struct list_head *entry) { (entry)->next->prev = (entry)->prev; (entry)->prev->next = (entry)->next; } #define list_for_each(entry, head) \ for (entry = (head)->next; entry != head; entry = (entry)->next) #define list_for_each_safe(entry, temp, head) \ for (entry = (head)->next, temp = (entry)->next; \ temp != head; \ entry = temp, temp = temp->next)


context:
space:
mode: