summaryrefslogtreecommitdiff
AgeCommit message (Expand)Author
2008-10-06radeon: fix pin ioctl interface to mesa can find offset for pinned buffersDave Airlie
2008-10-06drm/radeon: fixup clean flag handlingDave Airlie
2008-10-06radeon: fix missing bit from rs740 patchMihail Zenkov
2008-10-04radeon: Add support for HD2100 IGP (RS740)Alex Deucher
2008-10-03[FreeBSD] Don't explicitly bzero driver softc.Robert Noland
2008-10-03[FreeBSD] Use M_WAITOK when allocating driver memory.Robert Noland
2008-10-03[FreeBSD] Do a bit of optimization on drm_order()Robert Noland
2008-10-01Use devfs_get_cdevpriv in mmap as well.Robert Noland
2008-09-30intel bufmgr: reinstate buffer handle trackingJesse Barnes
2008-09-30Merge remote branch 'origin/modesetting-gem' into modesetting-gemDave Airlie
2008-09-30Merge remote branch 'origin/master' into modesetting-gemDave Airlie
2008-09-27intel: Copy data from card memory back to backing store when mapping.Xiang, Haihao
2008-09-26radeon: use atom for ext tmds on r4xxAlex Deucher
2008-09-26radeon: make atom on r4xx a module optionAlex Deucher
2008-09-25Merge branch 'modesetting-gem' of git+ssh://agd5f@git.freedesktop.org/git/mes...Alex Deucher
2008-09-25radeon: first pass at using atombios on r4xx hwAlex Deucher
2008-09-25Seperate modesetting userspace bits into drm_mode.hJakob Bornecrantz
2008-09-24radeon: add r600 modesetting registers writesDave Airlie
2008-09-24radeon: add parsing for r6xx object tablesDave Airlie
2008-09-23intel: Allow up to 15 seconds chewing on one buffer before acknowledging -EBUSY.Eric Anholt
2008-09-23intel: Replace wraparound test logic in bufmgr_fake. Again.Eric Anholt
2008-09-23intel: Do strerror on errno, not on the -1 return value from ioctl.Eric Anholt
2008-09-23Update intel modesetting to use mm_private instead of mm_handle.Kristian Høgsberg
2008-09-23radeon: fix minor cursor issuesDave Airlie
2008-09-23radeon: Fix type in check for tmds type.Kristian Høgsberg
2008-09-23Store the buffer object backing the fb as a void pointer, not a handle.Kristian Høgsberg
2008-09-23drm: fix brace placementDave Airlie
2008-09-22intel: Fix driver-supplied argument to exec function (fd.o bug #17653).Xiang, Haihao
2008-09-19radeon: rmx_fixup() fixes for legacy chipsAlex Deucher
2008-09-20radeon: fix voverplus calculationDave Airlie
2008-09-19radeon: tmds bracket failure found by krh.Dave Airlie
2008-09-18radeon: pll and interlace updates from the ddxAlex Deucher
2008-09-18radeon: Add functions to set mem/eng clocksAlex Deucher
2008-09-18radeon: add function to configure PCIE lanesAlex Deucher
2008-09-18Radeon: restructure PLL dataAlex Deucher
2008-09-18Export drm_put_minorAlex Deucher
2008-09-17[FreeBSD] Convert to using cdevpriv for file_priv trackingRobert Noland
2008-09-18fixup radeon stuff - need to checkout irqsDave Airlie
2008-09-18radeon: fixup buffer and cs bitsDave Airlie
2008-09-18[PATCH] radeon: fixup GEM domain setting - allows more userspace pathsDave Airlie
2008-09-18[PATCH] radeon: disable blit movesDave Airlie
2008-09-18radeon: fail properly if we can't create the ring.Dave Airlie
2008-09-18radeon: do proper memory controller init and setupDave Airlie
2008-09-18radeon: fix return valueDave Airlie
2008-09-18radeon: fixup reference counting properlyDave Airlie
2008-09-18radeon: sort out atom vs combios tables for r400 cardsDave Airlie
2008-09-18radeon: remove unneeded debuggingDave Airlie
2008-09-18radeon: don't do full edid for detection purposesDave Airlie
2008-09-18make text reserve 256kDave Airlie
2008-09-18radeon: add initial suspend/resume supportDave Airlie
= 0; i < ht->size; ++i) { INIT_HLIST_HEAD(&ht->table[i]); } return 0; } void drm_ht_verbose_list(struct drm_open_hash * ht, unsigned long key) { struct drm_hash_item *entry; struct hlist_head *h_list; struct hlist_node *list; unsigned int hashed_key; int count = 0; hashed_key = hash_long(key, ht->order); DRM_DEBUG("Key is 0x%08lx, Hashed key is 0x%08x\n", key, hashed_key); h_list = &ht->table[hashed_key]; hlist_for_each(list, h_list) { entry = hlist_entry(list, struct drm_hash_item, head); DRM_DEBUG("count %d, key: 0x%08lx\n", count++, entry->key); } } static struct hlist_node *drm_ht_find_key(struct drm_open_hash * ht, unsigned long key) { struct drm_hash_item *entry; struct hlist_head *h_list; struct hlist_node *list; unsigned int hashed_key; hashed_key = hash_long(key, ht->order); h_list = &ht->table[hashed_key]; hlist_for_each(list, h_list) { entry = hlist_entry(list, struct drm_hash_item, head); if (entry->key == key) return list; if (entry->key > key) break; } return NULL; } int drm_ht_insert_item(struct drm_open_hash * ht, struct drm_hash_item * item) { struct drm_hash_item *entry; struct hlist_head *h_list; struct hlist_node *list, *parent; unsigned int hashed_key; unsigned long key = item->key; hashed_key = hash_long(key, ht->order); h_list = &ht->table[hashed_key]; parent = NULL; hlist_for_each(list, h_list) { entry = hlist_entry(list, struct drm_hash_item, head); if (entry->key == key) return -EINVAL; if (entry->key > key) break; parent = list; } if (parent) { hlist_add_after(parent, &item->head); } else { hlist_add_head(&item->head, h_list); } return 0; } /* * Just insert an item and return any "bits" bit key that hasn't been * used before. */ int drm_ht_just_insert_please(struct drm_open_hash * ht, struct drm_hash_item * item, unsigned long seed, int bits, int shift, unsigned long add) { int ret; unsigned long mask = (1 << bits) - 1; unsigned long first, unshifted_key; unshifted_key = hash_long(seed, bits); first = unshifted_key; do { item->key = (unshifted_key << shift) + add; ret = drm_ht_insert_item(ht, item); if (ret) unshifted_key = (unshifted_key + 1) & mask; } while (ret && (unshifted_key != first)); if (ret) { DRM_ERROR("Available key bit space exhausted\n"); return -EINVAL; } return 0; } int drm_ht_find_item(struct drm_open_hash * ht, unsigned long key, struct drm_hash_item ** item) { struct hlist_node *list; list = drm_ht_find_key(ht, key); if (!list) return -EINVAL; *item = hlist_entry(list, struct drm_hash_item, head); return 0; } int drm_ht_remove_key(struct drm_open_hash * ht, unsigned long key) { struct hlist_node *list; list = drm_ht_find_key(ht, key); if (list) { hlist_del_init(list); ht->fill--; return 0; } return -EINVAL; } int drm_ht_remove_item(struct drm_open_hash * ht, struct drm_hash_item * item) { hlist_del_init(&item->head); ht->fill--; return 0; } void drm_ht_remove(struct drm_open_hash * ht) { if (ht->table) { if (ht->use_vmalloc) vfree(ht->table); else drm_free(ht->table, ht->size * sizeof(*ht->table), DRM_MEM_HASHTAB); ht->table = NULL; } }