4 * DSP-BIOS Bridge driver support functions for TI OMAP processors.
6 * Copyright (C) 2005-2006 Texas Instruments, Inc.
8 * This package is free software; you can redistribute it and/or modify
9 * it under the terms of the GNU General Public License version 2 as
10 * published by the Free Software Foundation.
12 * THIS PACKAGE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
13 * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
14 * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE.
17 #include <linux/types.h>
19 #include <dspbridge/host_os.h>
20 #include <dspbridge/gh.h>
27 struct gh_t_hash_tab {
30 struct element **buckets;
31 u16(*hash) (void *, u16);
32 bool(*match) (void *, void *);
33 void (*delete) (void *);
36 static void noop(void *p);
39 * ======== gh_create ========
42 struct gh_t_hash_tab *gh_create(u16 max_bucket, u16 val_size,
43 u16(*hash) (void *, u16), bool(*match) (void *,
45 void (*delete) (void *))
47 struct gh_t_hash_tab *hash_tab;
49 hash_tab = kzalloc(sizeof(struct gh_t_hash_tab), GFP_KERNEL);
52 hash_tab->max_bucket = max_bucket;
53 hash_tab->val_size = val_size;
54 hash_tab->hash = hash;
55 hash_tab->match = match;
56 hash_tab->delete = delete == NULL ? noop : delete;
59 kzalloc(sizeof(struct element *) * max_bucket, GFP_KERNEL);
60 if (hash_tab->buckets == NULL) {
65 for (i = 0; i < max_bucket; i++)
66 hash_tab->buckets[i] = NULL;
72 * ======== gh_delete ========
74 void gh_delete(struct gh_t_hash_tab *hash_tab)
76 struct element *elem, *next;
79 if (hash_tab != NULL) {
80 if (hash_tab->buckets != NULL) {
81 for (i = 0; i < hash_tab->max_bucket; i++) {
82 for (elem = hash_tab->buckets[i]; elem != NULL;
85 (*hash_tab->delete) (elem->data);
90 kfree(hash_tab->buckets);
98 * ======== gh_find ========
101 void *gh_find(struct gh_t_hash_tab *hash_tab, void *key)
103 struct element *elem;
105 elem = hash_tab->buckets[(*hash_tab->hash) (key, hash_tab->max_bucket)];
107 for (; elem; elem = elem->next) {
108 if ((*hash_tab->match) (key, elem->data))
116 * ======== gh_insert ========
119 void *gh_insert(struct gh_t_hash_tab *hash_tab, void *key, void *value)
121 struct element *elem;
125 elem = kzalloc(sizeof(struct element) - 1 + hash_tab->val_size,
129 dst = (char *)elem->data;
131 for (i = 0; i < hash_tab->val_size; i++)
134 i = (*hash_tab->hash) (key, hash_tab->max_bucket);
135 elem->next = hash_tab->buckets[i];
136 hash_tab->buckets[i] = elem;
145 * ======== noop ========
148 static void noop(void *p)
150 p = p; /* stifle compiler warning */
153 #ifdef CONFIG_TIDSPBRIDGE_BACKTRACE
155 * gh_iterate() - This function goes through all the elements in the hash table
156 * looking for the dsp symbols.
157 * @hash_tab: Hash table
158 * @callback: pointer to callback function
159 * @user_data: User data, contains the find_symbol_context pointer
162 void gh_iterate(struct gh_t_hash_tab *hash_tab,
163 void (*callback)(void *, void *), void *user_data)
165 struct element *elem;
168 if (hash_tab && hash_tab->buckets)
169 for (i = 0; i < hash_tab->max_bucket; i++) {
170 elem = hash_tab->buckets[i];
172 callback(&elem->data, user_data);