2006-08-07 05:30:28 -06:00
|
|
|
/**************************************************************************
|
|
|
|
*
|
|
|
|
* Copyright 2006 Tungsten Graphics, Inc., Bismarck, ND. USA.
|
|
|
|
* 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, sub license, 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 NON-INFRINGEMENT. IN NO EVENT SHALL
|
|
|
|
* THE COPYRIGHT HOLDERS, AUTHORS 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.
|
|
|
|
*
|
|
|
|
*
|
|
|
|
**************************************************************************/
|
|
|
|
/*
|
|
|
|
* Simple open hash tab implementation.
|
|
|
|
*
|
|
|
|
* Authors:
|
2007-10-19 15:21:04 -06:00
|
|
|
* Thomas Hellström <thomas-at-tungstengraphics-dot-com>
|
2006-08-07 05:30:28 -06:00
|
|
|
*/
|
|
|
|
|
2012-10-02 11:01:07 -06:00
|
|
|
#include <drm/drmP.h>
|
|
|
|
#include <drm/drm_hashtab.h>
|
2006-08-07 05:30:28 -06:00
|
|
|
#include <linux/hash.h>
|
include cleanup: Update gfp.h and slab.h includes to prepare for breaking implicit slab.h inclusion from percpu.h
percpu.h is included by sched.h and module.h and thus ends up being
included when building most .c files. percpu.h includes slab.h which
in turn includes gfp.h making everything defined by the two files
universally available and complicating inclusion dependencies.
percpu.h -> slab.h dependency is about to be removed. Prepare for
this change by updating users of gfp and slab facilities include those
headers directly instead of assuming availability. As this conversion
needs to touch large number of source files, the following script is
used as the basis of conversion.
http://userweb.kernel.org/~tj/misc/slabh-sweep.py
The script does the followings.
* Scan files for gfp and slab usages and update includes such that
only the necessary includes are there. ie. if only gfp is used,
gfp.h, if slab is used, slab.h.
* When the script inserts a new include, it looks at the include
blocks and try to put the new include such that its order conforms
to its surrounding. It's put in the include block which contains
core kernel includes, in the same order that the rest are ordered -
alphabetical, Christmas tree, rev-Xmas-tree or at the end if there
doesn't seem to be any matching order.
* If the script can't find a place to put a new include (mostly
because the file doesn't have fitting include block), it prints out
an error message indicating which .h file needs to be added to the
file.
The conversion was done in the following steps.
1. The initial automatic conversion of all .c files updated slightly
over 4000 files, deleting around 700 includes and adding ~480 gfp.h
and ~3000 slab.h inclusions. The script emitted errors for ~400
files.
2. Each error was manually checked. Some didn't need the inclusion,
some needed manual addition while adding it to implementation .h or
embedding .c file was more appropriate for others. This step added
inclusions to around 150 files.
3. The script was run again and the output was compared to the edits
from #2 to make sure no file was left behind.
4. Several build tests were done and a couple of problems were fixed.
e.g. lib/decompress_*.c used malloc/free() wrappers around slab
APIs requiring slab.h to be added manually.
5. The script was run on all .h files but without automatically
editing them as sprinkling gfp.h and slab.h inclusions around .h
files could easily lead to inclusion dependency hell. Most gfp.h
inclusion directives were ignored as stuff from gfp.h was usually
wildly available and often used in preprocessor macros. Each
slab.h inclusion directive was examined and added manually as
necessary.
6. percpu.h was updated not to include slab.h.
7. Build test were done on the following configurations and failures
were fixed. CONFIG_GCOV_KERNEL was turned off for all tests (as my
distributed build env didn't work with gcov compiles) and a few
more options had to be turned off depending on archs to make things
build (like ipr on powerpc/64 which failed due to missing writeq).
* x86 and x86_64 UP and SMP allmodconfig and a custom test config.
* powerpc and powerpc64 SMP allmodconfig
* sparc and sparc64 SMP allmodconfig
* ia64 SMP allmodconfig
* s390 SMP allmodconfig
* alpha SMP allmodconfig
* um on x86_64 SMP allmodconfig
8. percpu.h modifications were reverted so that it could be applied as
a separate patch and serve as bisection point.
Given the fact that I had only a couple of failures from tests on step
6, I'm fairly confident about the coverage of this conversion patch.
If there is a breakage, it's likely to be something in one of the arch
headers which should be easily discoverable easily on most builds of
the specific arch.
Signed-off-by: Tejun Heo <tj@kernel.org>
Guess-its-ok-by: Christoph Lameter <cl@linux-foundation.org>
Cc: Ingo Molnar <mingo@redhat.com>
Cc: Lee Schermerhorn <Lee.Schermerhorn@hp.com>
2010-03-24 02:04:11 -06:00
|
|
|
#include <linux/slab.h>
|
2011-08-30 16:16:33 -06:00
|
|
|
#include <linux/export.h>
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
int drm_ht_create(struct drm_open_hash *ht, unsigned int order)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
2011-01-26 11:33:25 -07:00
|
|
|
unsigned int size = 1 << order;
|
2006-08-07 05:30:28 -06:00
|
|
|
|
|
|
|
ht->order = order;
|
2007-02-18 00:23:11 -07:00
|
|
|
ht->table = NULL;
|
2011-01-26 11:33:25 -07:00
|
|
|
if (size <= PAGE_SIZE / sizeof(*ht->table))
|
|
|
|
ht->table = kcalloc(size, sizeof(*ht->table), GFP_KERNEL);
|
|
|
|
else
|
|
|
|
ht->table = vzalloc(size*sizeof(*ht->table));
|
2006-08-07 05:30:28 -06:00
|
|
|
if (!ht->table) {
|
|
|
|
DRM_ERROR("Out of memory for hash table\n");
|
|
|
|
return -ENOMEM;
|
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2009-04-08 09:16:24 -06:00
|
|
|
EXPORT_SYMBOL(drm_ht_create);
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
2007-07-11 18:26:44 -06:00
|
|
|
struct drm_hash_item *entry;
|
2006-08-07 05:30:28 -06:00
|
|
|
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];
|
2012-11-20 05:16:47 -07:00
|
|
|
hlist_for_each_entry(entry, list, h_list, head)
|
2006-08-07 05:30:28 -06:00
|
|
|
DRM_DEBUG("count %d, key: 0x%08lx\n", count++, entry->key);
|
|
|
|
}
|
|
|
|
|
2007-11-04 19:50:58 -07:00
|
|
|
static struct hlist_node *drm_ht_find_key(struct drm_open_hash *ht,
|
2006-08-07 05:30:28 -06:00
|
|
|
unsigned long key)
|
|
|
|
{
|
2007-07-11 18:26:44 -06:00
|
|
|
struct drm_hash_item *entry;
|
2006-08-07 05:30:28 -06:00
|
|
|
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];
|
2012-11-20 05:16:47 -07:00
|
|
|
hlist_for_each_entry(entry, list, h_list, head) {
|
2006-08-07 05:30:28 -06:00
|
|
|
if (entry->key == key)
|
|
|
|
return list;
|
|
|
|
if (entry->key > key)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
|
|
|
|
2012-11-20 05:16:47 -07:00
|
|
|
static struct hlist_node *drm_ht_find_key_rcu(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_entry_rcu(entry, list, h_list, head) {
|
|
|
|
if (entry->key == key)
|
|
|
|
return list;
|
|
|
|
if (entry->key > key)
|
|
|
|
break;
|
|
|
|
}
|
|
|
|
return NULL;
|
|
|
|
}
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
2007-07-11 18:26:44 -06:00
|
|
|
struct drm_hash_item *entry;
|
2006-08-07 05:30:28 -06:00
|
|
|
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;
|
2012-11-20 05:16:47 -07:00
|
|
|
hlist_for_each_entry(entry, list, h_list, head) {
|
2006-08-07 05:30:28 -06:00
|
|
|
if (entry->key == key)
|
2006-09-21 12:04:18 -06:00
|
|
|
return -EINVAL;
|
2006-08-07 05:30:28 -06:00
|
|
|
if (entry->key > key)
|
|
|
|
break;
|
|
|
|
parent = list;
|
|
|
|
}
|
|
|
|
if (parent) {
|
2012-11-06 04:31:48 -07:00
|
|
|
hlist_add_after_rcu(parent, &item->head);
|
2006-08-07 05:30:28 -06:00
|
|
|
} else {
|
2012-11-06 04:31:48 -07:00
|
|
|
hlist_add_head_rcu(&item->head, h_list);
|
2006-08-07 05:30:28 -06:00
|
|
|
}
|
|
|
|
return 0;
|
|
|
|
}
|
2008-11-05 11:31:53 -07:00
|
|
|
EXPORT_SYMBOL(drm_ht_insert_item);
|
2006-08-07 05:30:28 -06:00
|
|
|
|
|
|
|
/*
|
2007-11-04 19:50:58 -07:00
|
|
|
* Just insert an item and return any "bits" bit key that hasn't been
|
2006-08-07 05:30:28 -06:00
|
|
|
* used before.
|
|
|
|
*/
|
2007-07-11 18:26:44 -06:00
|
|
|
int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
|
2006-08-07 05:30:28 -06:00
|
|
|
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;
|
|
|
|
}
|
2009-04-08 09:16:24 -06:00
|
|
|
EXPORT_SYMBOL(drm_ht_just_insert_please);
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key,
|
|
|
|
struct drm_hash_item **item)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
|
|
|
struct hlist_node *list;
|
|
|
|
|
2012-11-20 05:16:47 -07:00
|
|
|
list = drm_ht_find_key_rcu(ht, key);
|
2006-08-07 05:30:28 -06:00
|
|
|
if (!list)
|
2006-09-21 12:04:18 -06:00
|
|
|
return -EINVAL;
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
*item = hlist_entry(list, struct drm_hash_item, head);
|
2006-08-07 05:30:28 -06:00
|
|
|
return 0;
|
|
|
|
}
|
2009-04-08 09:16:24 -06:00
|
|
|
EXPORT_SYMBOL(drm_ht_find_item);
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
int drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
|
|
|
struct hlist_node *list;
|
|
|
|
|
|
|
|
list = drm_ht_find_key(ht, key);
|
|
|
|
if (list) {
|
2012-11-06 04:31:48 -07:00
|
|
|
hlist_del_init_rcu(list);
|
2006-08-07 05:30:28 -06:00
|
|
|
return 0;
|
|
|
|
}
|
2006-09-21 12:04:18 -06:00
|
|
|
return -EINVAL;
|
2006-08-07 05:30:28 -06:00
|
|
|
}
|
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
2012-11-06 04:31:48 -07:00
|
|
|
hlist_del_init_rcu(&item->head);
|
2006-08-07 05:30:28 -06:00
|
|
|
return 0;
|
|
|
|
}
|
2008-11-05 11:31:53 -07:00
|
|
|
EXPORT_SYMBOL(drm_ht_remove_item);
|
2006-08-07 05:30:28 -06:00
|
|
|
|
2007-07-11 18:26:44 -06:00
|
|
|
void drm_ht_remove(struct drm_open_hash *ht)
|
2006-08-07 05:30:28 -06:00
|
|
|
{
|
|
|
|
if (ht->table) {
|
2011-01-26 11:33:25 -07:00
|
|
|
if ((PAGE_SIZE / sizeof(*ht->table)) >> ht->order)
|
2009-03-24 13:23:04 -06:00
|
|
|
kfree(ht->table);
|
2011-01-26 11:33:25 -07:00
|
|
|
else
|
|
|
|
vfree(ht->table);
|
2006-08-07 05:30:28 -06:00
|
|
|
ht->table = NULL;
|
|
|
|
}
|
|
|
|
}
|
2009-04-08 09:16:24 -06:00
|
|
|
EXPORT_SYMBOL(drm_ht_remove);
|