summaryrefslogtreecommitdiff
path: root/tests/drmtest.c
blob: 685a6527e39015e046f1b8d41d610ad0709938ce (plain)
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
/*
 * Copyright © 2007 Intel Corporation
 *
 * 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
 * THE AUTHORS OR COPYRIGHT HOLDERS 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 <eric@anholt.net>
 *
 */

#include <string.h>
#include <fcntl.h>
#include <fnmatch.h>
#include <sys/stat.h>
#include <sys/ioctl.h>
#include "drmtest.h"

#define LIBUDEV_I_KNOW_THE_API_IS_SUBJECT_TO_CHANGE
#include <libudev.h>

static int is_master(int fd)
{
	drm_client_t client;
	int ret;

	/* Check that we're the only opener and authed. */
	client.idx = 0;
	ret = ioctl(fd, DRM_IOCTL_GET_CLIENT, &client);
	assert (ret == 0);
	if (!client.auth)
		return 0;
	client.idx = 1;
	ret = ioctl(fd, DRM_IOCTL_GET_CLIENT, &client);
	if (ret != -1 || errno != EINVAL)
		return 0;

	return 1;
}

/** Open the first DRM device matching the criteria */
int drm_open_matching(const char *pci_glob, int flags)
{
	struct udev *udev;
	struct udev_enumerate *e;
	struct udev_device *device, *parent;
        struct udev_list_entry *entry;
	const char *pci_id, *path;
	int fd;

	udev = udev_new();
	if (udev == NULL) {
		fprintf(stderr, "failed to initialize udev context\n");
		abort();
	}

	fd = -1;
	e = udev_enumerate_new(udev);
	udev_enumerate_add_match_subsystem(e, "drm");
        udev_enumerate_scan_devices(e);
        udev_list_entry_foreach(entry, udev_enumerate_get_list_entry(e)) {
		path = udev_list_entry_get_name(entry);
		device = udev_device_new_from_syspath(udev, path);
		parent = udev_device_get_parent(device);
		/* Filter out KMS output devices. */
		if (strcmp(udev_device_get_subsystem(parent), "pci") != 0)
			continue;
		pci_id = udev_device_get_property_value(parent, "PCI_ID");
		if (fnmatch(pci_glob, pci_id, 0) != 0)
			continue;
		fd = open(udev_device_get_devnode(device), O_RDWR);
		if (fd < 0)
			continue;
		if ((flags & DRM_TEST_MASTER) && !is_master(fd)) {
			close(fd);
			fd = -1;
			continue;
		}

		break;
	}
        udev_enumerate_unref(e);
	udev_unref(udev);

	return fd;
}

int drm_open_any(void)
{
	int fd = drm_open_matching("*:*", 0);

	if (fd < 0) {
		fprintf(stderr, "failed to open any drm device\n");
		abort();
	}

	return fd;
}

/**
 * Open the first DRM device we can find where we end up being the master.
 */
int drm_open_any_master(void)
{
	int fd = drm_open_matching("*:*", DRM_TEST_MASTER);

	if (fd < 0) {
		fprintf(stderr, "failed to open any drm device\n");
		abort();
	}

	return fd;

}
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. * * Authors: Rickard E. (Rik) Faith <faith@valinux.com> * * DESCRIPTION * * This file contains a straightforward skip list implementation.n * * FUTURE ENHANCEMENTS * * REFERENCES * * [Pugh90] William Pugh. Skip Lists: A Probabilistic Alternative to * Balanced Trees. CACM 33(6), June 1990, pp. 668-676. * */ #include <stdio.h> #include <stdlib.h> #define SL_MAIN 0 #if !SL_MAIN # include "xf86drm.h" #else # include <sys/time.h> #endif #define SL_LIST_MAGIC 0xfacade00LU #define SL_ENTRY_MAGIC 0x00fab1edLU #define SL_FREED_MAGIC 0xdecea5edLU #define SL_MAX_LEVEL 16 #define SL_DEBUG 0 #define SL_RANDOM_SEED 0xc01055a1LU #if SL_MAIN #define SL_ALLOC malloc #define SL_FREE free #define SL_RANDOM_DECL static int state = 0; #define SL_RANDOM_INIT(seed) if (!state) { srandom(seed); ++state; } #define SL_RANDOM random() #else #define SL_ALLOC drmMalloc #define SL_FREE drmFree #define SL_RANDOM_DECL static void *state = NULL #define SL_RANDOM_INIT(seed) if (!state) state = drmRandomCreate(seed) #define SL_RANDOM drmRandom(state) #endif typedef struct SLEntry { unsigned long magic; /* SL_ENTRY_MAGIC */ unsigned long key; void *value; int levels; struct SLEntry *forward[1]; /* variable sized array */ } SLEntry, *SLEntryPtr; typedef struct SkipList { unsigned long magic; /* SL_LIST_MAGIC */ int level; int count; SLEntryPtr head; SLEntryPtr p0; /* Position for iteration */ } SkipList, *SkipListPtr; #if SL_MAIN extern void *drmSLCreate(void); extern int drmSLDestroy(void *l); extern int drmSLLookup(void *l, unsigned long key, void **value); extern int drmSLInsert(void *l, unsigned long key, void *value); extern int drmSLDelete(void *l, unsigned long key); extern int drmSLNext(void *l, unsigned long *key, void **value); extern int drmSLFirst(void *l, unsigned long *key, void **value); extern void drmSLDump(void *l); extern int drmSLLookupNeighbors(void *l, unsigned long key, unsigned long *prev_key, void **prev_value, unsigned long *next_key, void **next_value); #endif static SLEntryPtr SLCreateEntry(int max_level, unsigned long key, void *value) { SLEntryPtr entry; if (max_level < 0 || max_level > SL_MAX_LEVEL) max_level = SL_MAX_LEVEL; entry = SL_ALLOC(sizeof(*entry) + (max_level + 1) * sizeof(entry->forward[0])); if (!entry) return NULL; entry->magic = SL_ENTRY_MAGIC; entry->key = key; entry->value = value; entry->levels = max_level + 1; return entry; } static int SLRandomLevel(void) { int level = 1; SL_RANDOM_DECL; SL_RANDOM_INIT(SL_RANDOM_SEED); while ((SL_RANDOM & 0x01) && level < SL_MAX_LEVEL) ++level; return level; } void *drmSLCreate(void) { SkipListPtr list; int i; list = SL_ALLOC(sizeof(*list)); if (!list) return NULL; list->magic = SL_LIST_MAGIC; list->level = 0; list->head = SLCreateEntry(SL_MAX_LEVEL, 0, NULL); list->count = 0; for (i = 0; i <= SL_MAX_LEVEL; i++) list->head->forward[i] = NULL; return list; } int drmSLDestroy(void *l) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; SLEntryPtr next; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ for (entry = list->head; entry; entry = next) { if (entry->magic != SL_ENTRY_MAGIC) return -1; /* Bad magic */ next = entry->forward[0]; entry->magic = SL_FREED_MAGIC; SL_FREE(entry); } list->magic = SL_FREED_MAGIC; SL_FREE(list); return 0; } static SLEntryPtr SLLocate(void *l, unsigned long key, SLEntryPtr *update) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; int i; if (list->magic != SL_LIST_MAGIC) return NULL; for (i = list->level, entry = list->head; i >= 0; i--) { while (entry->forward[i] && entry->forward[i]->key < key) entry = entry->forward[i]; update[i] = entry; } return entry->forward[0]; } int drmSLInsert(void *l, unsigned long key, void *value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; SLEntryPtr update[SL_MAX_LEVEL + 1]; int level; int i; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ entry = SLLocate(list, key, update); if (entry && entry->key == key) return 1; /* Already in list */ level = SLRandomLevel(); if (level > list->level) { level = ++list->level; update[level] = list->head; } entry = SLCreateEntry(level, key, value); /* Fix up forward pointers */ for (i = 0; i <= level; i++) { entry->forward[i] = update[i]->forward[i]; update[i]->forward[i] = entry; } ++list->count; return 0; /* Added to table */ } int drmSLDelete(void *l, unsigned long key) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr update[SL_MAX_LEVEL + 1]; SLEntryPtr entry; int i; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ entry = SLLocate(list, key, update); if (!entry || entry->key != key) return 1; /* Not found */ /* Fix up forward pointers */ for (i = 0; i <= list->level; i++) { if (update[i]->forward[i] == entry) update[i]->forward[i] = entry->forward[i]; } entry->magic = SL_FREED_MAGIC; SL_FREE(entry); while (list->level && !list->head->forward[list->level]) --list->level; --list->count; return 0; } int drmSLLookup(void *l, unsigned long key, void **value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr update[SL_MAX_LEVEL + 1]; SLEntryPtr entry; entry = SLLocate(list, key, update); if (entry && entry->key == key) { *value = entry; return 0; } *value = NULL; return -1; } int drmSLLookupNeighbors(void *l, unsigned long key, unsigned long *prev_key, void **prev_value, unsigned long *next_key, void **next_value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr update[SL_MAX_LEVEL + 1]; int retcode = 0; *prev_key = *next_key = key; *prev_value = *next_value = NULL; if (update[0]) { *prev_key = update[0]->key; *prev_value = update[0]->value; ++retcode; if (update[0]->forward[0]) { *next_key = update[0]->forward[0]->key; *next_value = update[0]->forward[0]->value; ++retcode; } } return retcode; } int drmSLNext(void *l, unsigned long *key, void **value) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ entry = list->p0; if (entry) { list->p0 = entry->forward[0]; *key = entry->key; *value = entry->value; return 1; } list->p0 = NULL; return 0; } int drmSLFirst(void *l, unsigned long *key, void **value) { SkipListPtr list = (SkipListPtr)l; if (list->magic != SL_LIST_MAGIC) return -1; /* Bad magic */ list->p0 = list->head->forward[0]; return drmSLNext(list, key, value); } /* Dump internal data structures for debugging. */ void drmSLDump(void *l) { SkipListPtr list = (SkipListPtr)l; SLEntryPtr entry; int i; if (list->magic != SL_LIST_MAGIC) { printf("Bad magic: 0x%08lx (expected 0x%08lx)\n", list->magic, SL_LIST_MAGIC); return; } printf("Level = %d, count = %d\n", list->level, list->count); for (entry = list->head; entry; entry = entry->forward[0]) { if (entry->magic != SL_ENTRY_MAGIC) { printf("Bad magic: 0x%08lx (expected 0x%08lx)\n", list->magic, SL_ENTRY_MAGIC); } printf("\nEntry %p <0x%08lx, %p> has %2d levels\n", entry, entry->key, entry->value, entry->levels); for (i = 0; i < entry->levels; i++) { if (entry->forward[i]) { printf(" %2d: %p <0x%08lx, %p>\n", i, entry->forward[i], entry->forward[i]->key, entry->forward[i]->value); } else { printf(" %2d: %p\n", i, entry->forward[i]); } } } } #if SL_MAIN static void print(SkipListPtr list) { unsigned long key; void *value; if (drmSLFirst(list, &key, &value)) { do { printf("key = %5lu, value = %p\n", key, value); } while (drmSLNext(list, &key, &value)); } } static double do_time(int size, int iter) { SkipListPtr list; int i, j; unsigned long keys[1000000]; unsigned long previous; unsigned long key; void *value; struct timeval start, stop; double usec; SL_RANDOM_DECL; SL_RANDOM_INIT(12345); list = drmSLCreate(); for (i = 0; i < size; i++) { keys[i] = SL_RANDOM; drmSLInsert(list, keys[i], NULL); } previous = 0; if (drmSLFirst(list, &key, &value)) { do { if (key <= previous) { printf( "%lu !< %lu\n", previous, key); } previous = key; } while (drmSLNext(list, &key, &value)); } gettimeofday(&start, NULL); for (j = 0; j < iter; j++) { for (i = 0; i < size; i++) { if (drmSLLookup(list, keys[i], &value)) printf("Error %lu %d\n", keys[i], i); } } gettimeofday(&stop, NULL); usec = (double)(stop.tv_sec * 1000000 + stop.tv_usec - start.tv_sec * 1000000 - start.tv_usec) / (size * iter); printf("%0.2f microseconds for list length %d\n", usec, size); drmSLDestroy(list); return usec; } static void print_neighbors(void *list, unsigned long key) { unsigned long prev_key = 0; unsigned long next_key = 0; void *prev_value; void *next_value; int retval; retval = drmSLLookupNeighbors(list, key, &prev_key, &prev_value, &next_key, &next_value); printf("Neighbors of %5lu: %d %5lu %5lu\n", key, retval, prev_key, next_key); } int main(void) { SkipListPtr list; double usec, usec2, usec3, usec4; list = drmSLCreate(); printf( "list at %p\n", list); print(list); printf("\n==============================\n\n"); drmSLInsert(list, 123, NULL); drmSLInsert(list, 213, NULL); drmSLInsert(list, 50, NULL); print(list); printf("\n==============================\n\n"); print_neighbors(list, 0); print_neighbors(list, 50); print_neighbors(list, 51); print_neighbors(list, 123); print_neighbors(list, 200); print_neighbors(list, 213); print_neighbors(list, 256); printf("\n==============================\n\n"); drmSLDelete(list, 50); print(list); printf("\n==============================\n\n"); drmSLDump(list); drmSLDestroy(list); printf("\n==============================\n\n"); usec = do_time(100, 10000); usec2 = do_time(1000, 500); printf("Table size increased by %0.2f, search time increased by %0.2f\n", 1000.0/100.0, usec2 / usec); usec3 = do_time(10000, 50); printf("Table size increased by %0.2f, search time increased by %0.2f\n", 10000.0/100.0, usec3 / usec); usec4 = do_time(100000, 4); printf("Table size increased by %0.2f, search time increased by %0.2f\n", 100000.0/100.0, usec4 / usec); return 0; } #endif