Searched refs:ht (Results 1 - 25 of 326) sorted by relevance

1234567891011>>

/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/drivers/gpu/drm/
H A Ddrm_hashtab.c40 int drm_ht_create(struct drm_open_hash *ht, unsigned int order) argument
44 ht->size = 1 << order;
45 ht->order = order;
46 ht->fill = 0;
47 ht->table = NULL;
48 ht->use_vmalloc = ((ht->size * sizeof(*ht->table)) > PAGE_SIZE);
49 if (!ht->use_vmalloc) {
50 ht
67 drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key) argument
84 drm_ht_find_key(struct drm_open_hash *ht, unsigned long key) argument
105 drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item) argument
137 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) argument
162 drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item) argument
176 drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key) argument
189 drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item) argument
197 drm_ht_remove(struct drm_open_hash *ht) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/drivers/gpu/drm/
H A Ddrm_hashtab.c40 int drm_ht_create(struct drm_open_hash *ht, unsigned int order) argument
44 ht->size = 1 << order;
45 ht->order = order;
46 ht->fill = 0;
47 ht->table = NULL;
48 ht->use_vmalloc = ((ht->size * sizeof(*ht->table)) > PAGE_SIZE);
49 if (!ht->use_vmalloc) {
50 ht
67 drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key) argument
84 drm_ht_find_key(struct drm_open_hash *ht, unsigned long key) argument
105 drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item) argument
137 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) argument
162 drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item) argument
176 drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key) argument
189 drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item) argument
197 drm_ht_remove(struct drm_open_hash *ht) argument
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/include/drm/
H A Ddrm_hashtab.h56 extern int drm_ht_create(struct drm_open_hash *ht, unsigned int order);
57 extern int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item);
58 extern int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
61 extern int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item);
63 extern void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key);
64 extern int drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key);
65 extern int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item);
66 extern void drm_ht_remove(struct drm_open_hash *ht);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/include/drm/
H A Ddrm_hashtab.h56 extern int drm_ht_create(struct drm_open_hash *ht, unsigned int order);
57 extern int drm_ht_insert_item(struct drm_open_hash *ht, struct drm_hash_item *item);
58 extern int drm_ht_just_insert_please(struct drm_open_hash *ht, struct drm_hash_item *item,
61 extern int drm_ht_find_item(struct drm_open_hash *ht, unsigned long key, struct drm_hash_item **item);
63 extern void drm_ht_verbose_list(struct drm_open_hash *ht, unsigned long key);
64 extern int drm_ht_remove_key(struct drm_open_hash *ht, unsigned long key);
65 extern int drm_ht_remove_item(struct drm_open_hash *ht, struct drm_hash_item *item);
66 extern void drm_ht_remove(struct drm_open_hash *ht);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/wget/src/
H A Dhash.c274 struct hash_table *ht = xnew (struct hash_table); local
276 ht->hash_function = hash_function ? hash_function : hash_pointer;
277 ht->test_function = test_function ? test_function : cmp_pointer;
281 ht->prime_offset = 0;
286 size = prime_size (size, &ht->prime_offset);
287 ht->size = size;
288 ht->resize_threshold = size * HASH_MAX_FULLNESS;
289 /*assert (ht->resize_threshold >= items);*/
291 ht->cells = xnew_array (struct cell, ht
305 hash_table_destroy(struct hash_table *ht) argument
316 find_cell(const struct hash_table *ht, const void *key) argument
337 hash_table_get(const struct hash_table *ht, const void *key) argument
350 hash_table_get_pair(const struct hash_table *ht, const void *lookup_key, void *orig_key, void *value) argument
369 hash_table_contains(const struct hash_table *ht, const void *key) argument
379 grow_hash_table(struct hash_table *ht) argument
422 hash_table_put(struct hash_table *ht, const void *key, const void *value) argument
451 hash_table_remove(struct hash_table *ht, const void *key) argument
499 hash_table_clear(struct hash_table *ht) argument
517 hash_table_for_each(struct hash_table *ht, int (*fn) (void *, void *, void *), void *arg) argument
548 hash_table_iterate(struct hash_table *ht, hash_table_iterator *iter) argument
584 hash_table_count(const struct hash_table *ht) argument
764 struct hash_table *ht = make_string_hash_table (0); local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/wget/src/
H A Dhash.c274 struct hash_table *ht = xnew (struct hash_table); local
276 ht->hash_function = hash_function ? hash_function : hash_pointer;
277 ht->test_function = test_function ? test_function : cmp_pointer;
281 ht->prime_offset = 0;
286 size = prime_size (size, &ht->prime_offset);
287 ht->size = size;
288 ht->resize_threshold = size * HASH_MAX_FULLNESS;
289 /*assert (ht->resize_threshold >= items);*/
291 ht->cells = xnew_array (struct cell, ht
305 hash_table_destroy(struct hash_table *ht) argument
316 find_cell(const struct hash_table *ht, const void *key) argument
337 hash_table_get(const struct hash_table *ht, const void *key) argument
350 hash_table_get_pair(const struct hash_table *ht, const void *lookup_key, void *orig_key, void *value) argument
369 hash_table_contains(const struct hash_table *ht, const void *key) argument
379 grow_hash_table(struct hash_table *ht) argument
422 hash_table_put(struct hash_table *ht, const void *key, const void *value) argument
451 hash_table_remove(struct hash_table *ht, const void *key) argument
499 hash_table_clear(struct hash_table *ht) argument
517 hash_table_for_each(struct hash_table *ht, int (*fn) (void *, void *, void *), void *arg) argument
548 hash_table_iterate(struct hash_table *ht, hash_table_iterator *iter) argument
584 hash_table_count(const struct hash_table *ht) argument
764 struct hash_table *ht = make_string_hash_table (0); local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/wget/src/
H A Dhash.c274 struct hash_table *ht = xnew (struct hash_table); local
276 ht->hash_function = hash_function ? hash_function : hash_pointer;
277 ht->test_function = test_function ? test_function : cmp_pointer;
281 ht->prime_offset = 0;
286 size = prime_size (size, &ht->prime_offset);
287 ht->size = size;
288 ht->resize_threshold = size * HASH_MAX_FULLNESS;
289 /*assert (ht->resize_threshold >= items);*/
291 ht->cells = xnew_array (struct cell, ht
305 hash_table_destroy(struct hash_table *ht) argument
316 find_cell(const struct hash_table *ht, const void *key) argument
337 hash_table_get(const struct hash_table *ht, const void *key) argument
350 hash_table_get_pair(const struct hash_table *ht, const void *lookup_key, void *orig_key, void *value) argument
369 hash_table_contains(const struct hash_table *ht, const void *key) argument
379 grow_hash_table(struct hash_table *ht) argument
422 hash_table_put(struct hash_table *ht, const void *key, const void *value) argument
451 hash_table_remove(struct hash_table *ht, const void *key) argument
499 hash_table_clear(struct hash_table *ht) argument
517 hash_table_for_each(struct hash_table *ht, int (*fn) (void *, void *, void *), void *arg) argument
548 hash_table_iterate(struct hash_table *ht, hash_table_iterator *iter) argument
584 hash_table_count(const struct hash_table *ht) argument
764 struct hash_table *ht = make_string_hash_table (0); local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/sched/
H A Dcls_u32.c74 struct tc_u_knode *ht[1]; member in struct:tc_u_hnode
104 struct tc_u_hnode *ht = (struct tc_u_hnode*)tp->root; local
116 n = ht->ht[sel];
188 ht = n->ht_down;
190 if (ht->divisor) {
197 sel = ht->divisor & u32_hash_fold(*data, &n->sel,
230 ht = n->ht_up;
246 struct tc_u_hnode *ht; local
248 for (ht
256 u32_lookup_key(struct tc_u_hnode *ht, u32 handle) argument
275 struct tc_u_hnode *ht; local
360 struct tc_u_hnode *ht = key->ht_up; local
378 u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument
392 u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument
424 struct tc_u_hnode *ht; local
449 struct tc_u_hnode *ht = (struct tc_u_hnode*)arg; local
470 gen_new_kid(struct tc_u_hnode *ht, u32 handle) argument
493 u32_set_parms(struct tcf_proto *tp, unsigned long base, struct tc_u_hnode *ht, struct tc_u_knode *n, struct nlattr **tb, struct nlattr *est) argument
554 struct tc_u_hnode *ht; local
684 struct tc_u_hnode *ht; local
733 struct tc_u_hnode *ht = (struct tc_u_hnode*)fh; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/sched/
H A Dcls_u32.c74 struct tc_u_knode *ht[1]; member in struct:tc_u_hnode
104 struct tc_u_hnode *ht = (struct tc_u_hnode*)tp->root; local
116 n = ht->ht[sel];
188 ht = n->ht_down;
190 if (ht->divisor) {
197 sel = ht->divisor & u32_hash_fold(*data, &n->sel,
230 ht = n->ht_up;
246 struct tc_u_hnode *ht; local
248 for (ht
256 u32_lookup_key(struct tc_u_hnode *ht, u32 handle) argument
275 struct tc_u_hnode *ht; local
360 struct tc_u_hnode *ht = key->ht_up; local
378 u32_clear_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument
392 u32_destroy_hnode(struct tcf_proto *tp, struct tc_u_hnode *ht) argument
424 struct tc_u_hnode *ht; local
449 struct tc_u_hnode *ht = (struct tc_u_hnode*)arg; local
470 gen_new_kid(struct tc_u_hnode *ht, u32 handle) argument
493 u32_set_parms(struct tcf_proto *tp, unsigned long base, struct tc_u_hnode *ht, struct tc_u_knode *n, struct nlattr **tb, struct nlattr *est) argument
554 struct tc_u_hnode *ht; local
684 struct tc_u_hnode *ht; local
733 struct tc_u_hnode *ht = (struct tc_u_hnode*)fh; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/lighttpd-1.4.39/src/
H A Dproc_open.h23 int proc_close(proc_handler_t *ht);
24 int proc_open(proc_handler_t *ht, const char *command);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/lighttpd-1.4.39/src/
H A Dproc_open.h23 int proc_close(proc_handler_t *ht);
24 int proc_open(proc_handler_t *ht, const char *command);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/lighttpd-1.4.39/src/
H A Dproc_open.h23 int proc_close(proc_handler_t *ht);
24 int proc_open(proc_handler_t *ht, const char *command);
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-arm-linux-2.6.36-uclibc-4.5.3/lib/gcc/arm-brcm-linux-uclibcgnueabi/4.5.3/plugin/include/
H A Dsymtab.h40 typedef struct ht hash_table;
46 struct ht struct
97 extern void ht_load (hash_table *ht, hashnode *entries,
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-armeabi-2013.11/lib/gcc/arm-none-eabi/4.8.1/plugin/include/
H A Dsymtab.h40 typedef struct ht cpp_hash_table;
46 struct ht struct
97 extern void ht_load (cpp_hash_table *ht, hashnode *entries,
H A Dtoplev.h68 extern struct ht *ident_hash;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/toolchains/hndtools-armeabi-2011.09/lib/gcc/arm-none-eabi/4.6.1/plugin/include/
H A Dsymtab.h41 typedef struct ht hash_table;
47 struct ht struct
98 extern void ht_load (hash_table *ht, hashnode *entries,
H A Dtoplev.h70 extern struct ht *ident_hash;
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/gdb/gdb/
H A Dsparc-stub.c468 struct hard_trap_info *ht; local
470 for (ht = hard_trap_info; ht->tt && ht->signo; ht++)
471 exceptionHandler(ht->tt, trap_low);
509 struct hard_trap_info *ht; local
511 for (ht = hard_trap_info; ht->tt && ht
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/gdb/gdb/
H A Dsparc-stub.c468 struct hard_trap_info *ht; local
470 for (ht = hard_trap_info; ht->tt && ht->signo; ht++)
471 exceptionHandler(ht->tt, trap_low);
509 struct hard_trap_info *ht; local
511 for (ht = hard_trap_info; ht->tt && ht
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/gdb/gdb/
H A Dsparc-stub.c468 struct hard_trap_info *ht; local
470 for (ht = hard_trap_info; ht->tt && ht->signo; ht++)
471 exceptionHandler(ht->tt, trap_low);
509 struct hard_trap_info *ht; local
511 for (ht = hard_trap_info; ht->tt && ht
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6.36/net/netfilter/
H A Dxt_hashlimit.c125 hash_dst(const struct xt_hashlimit_htable *ht, const struct dsthash_dst *dst) argument
129 ht->rnd);
131 * Instead of returning hash % ht->cfg.size (implying a divide)
132 * we return the high 32 bits of the (hash * ht->cfg.size) that will
136 return ((u64)hash * ht->cfg.size) >> 32;
140 dsthash_find(const struct xt_hashlimit_htable *ht, argument
145 u_int32_t hash = hash_dst(ht, dst);
147 if (!hlist_empty(&ht->hash[hash])) {
148 hlist_for_each_entry_rcu(ent, pos, &ht->hash[hash], node)
159 dsthash_alloc_init(struct xt_hashlimit_htable *ht, argument
201 dsthash_free(struct xt_hashlimit_htable *ht, struct dsthash_ent *ent) argument
269 select_all(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he) argument
275 select_gc(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he) argument
281 htable_selective_cleanup(struct xt_hashlimit_htable *ht, bool (*select)(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he)) argument
303 struct xt_hashlimit_htable *ht = (struct xt_hashlimit_htable *)htlong; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt/router/usb-modeswitch-2.2.3/jim/
H A Djim.h224 Jim_HashTable *ht; member in struct:Jim_HashTableIterator
233 #define Jim_FreeEntryVal(ht, entry) \
234 if ((ht)->type->valDestructor) \
235 (ht)->type->valDestructor((ht)->privdata, (entry)->u.val)
237 #define Jim_SetHashVal(ht, entry, _val_) do { \
238 if ((ht)->type->valDup) \
239 entry->u.val = (ht)->type->valDup((ht)->privdata, _val_); \
244 #define Jim_FreeEntryKey(ht, entr
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/linux/linux-2.6/net/netfilter/
H A Dxt_hashlimit.c125 hash_dst(const struct xt_hashlimit_htable *ht, const struct dsthash_dst *dst) argument
129 ht->rnd);
131 * Instead of returning hash % ht->cfg.size (implying a divide)
132 * we return the high 32 bits of the (hash * ht->cfg.size) that will
136 return ((u64)hash * ht->cfg.size) >> 32;
140 dsthash_find(const struct xt_hashlimit_htable *ht, argument
145 u_int32_t hash = hash_dst(ht, dst);
147 if (!hlist_empty(&ht->hash[hash])) {
148 hlist_for_each_entry_rcu(ent, pos, &ht->hash[hash], node)
159 dsthash_alloc_init(struct xt_hashlimit_htable *ht, argument
201 dsthash_free(struct xt_hashlimit_htable *ht, struct dsthash_ent *ent) argument
269 select_all(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he) argument
275 select_gc(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he) argument
281 htable_selective_cleanup(struct xt_hashlimit_htable *ht, bool (*select)(const struct xt_hashlimit_htable *ht, const struct dsthash_ent *he)) argument
303 struct xt_hashlimit_htable *ht = (struct xt_hashlimit_htable *)htlong; local
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src/router/usb-modeswitch-2.2.3/jim/
H A Djim.h224 Jim_HashTable *ht; member in struct:Jim_HashTableIterator
233 #define Jim_FreeEntryVal(ht, entry) \
234 if ((ht)->type->valDestructor) \
235 (ht)->type->valDestructor((ht)->privdata, (entry)->u.val)
237 #define Jim_SetHashVal(ht, entry, _val_) do { \
238 if ((ht)->type->valDup) \
239 entry->u.val = (ht)->type->valDup((ht)->privdata, _val_); \
244 #define Jim_FreeEntryKey(ht, entr
[all...]
/asuswrt-rt-n18u-9.0.0.4.380.2695/release/src-rt-6.x.4708/router/usb-modeswitch-2.2.3/jim/
H A Djim.h224 Jim_HashTable *ht; member in struct:Jim_HashTableIterator
233 #define Jim_FreeEntryVal(ht, entry) \
234 if ((ht)->type->valDestructor) \
235 (ht)->type->valDestructor((ht)->privdata, (entry)->u.val)
237 #define Jim_SetHashVal(ht, entry, _val_) do { \
238 if ((ht)->type->valDup) \
239 entry->u.val = (ht)->type->valDup((ht)->privdata, _val_); \
244 #define Jim_FreeEntryKey(ht, entr
[all...]

Completed in 722 milliseconds

1234567891011>>