/freebsd-10-stable/contrib/unbound/util/storage/ |
H A D | lruhash.c | 66 struct lruhash* table = (struct lruhash*)calloc(1, local 68 if(!table) 70 lock_quick_init(&table->lock); 71 table->sizefunc = sizefunc; 72 table->compfunc = compfunc; 73 table->delkeyfunc = delkeyfunc; 74 table->deldatafunc = deldatafunc; 75 table->cb_arg = arg; 76 table->size = start_size; 77 table 97 bin_delete(struct lruhash* table, struct lruhash_bin* bin) argument 116 bin_split(struct lruhash* table, struct lruhash_bin* newa, int newmask) argument 152 lruhash_delete(struct lruhash* table) argument 181 reclaim_space(struct lruhash* table, struct lruhash_entry** list) argument 217 bin_find_entry(struct lruhash* table, struct lruhash_bin* bin, hashvalue_t hash, void* key) argument 230 table_grow(struct lruhash* table) argument 265 lru_front(struct lruhash* table, struct lruhash_entry* entry) argument 276 lru_remove(struct lruhash* table, struct lruhash_entry* entry) argument 287 lru_touch(struct lruhash* table, struct lruhash_entry* entry) argument 299 lruhash_insert(struct lruhash* table, hashvalue_t hash, struct lruhash_entry* entry, void* data, void* cb_arg) argument 355 lruhash_lookup(struct lruhash* table, hashvalue_t hash, void* key, int wr) argument 377 lruhash_remove(struct lruhash* table, hashvalue_t hash, void* key) argument 415 bin_clear(struct lruhash* table, struct lruhash_bin* bin) argument 437 lruhash_clear(struct lruhash* table) argument 458 lruhash_status(struct lruhash* table, const char* id, int extended) argument 492 lruhash_get_mem(struct lruhash* table) argument 515 lruhash_setmarkdel(struct lruhash* table, lruhash_markdelfunc_t md) argument [all...] |
H A D | slabhash.h | 39 * Hash table that consists of smaller hash tables. 52 * Hash table formed from several smaller ones. 53 * This results in a partitioned lruhash table, a 'slashtable'. 69 * Create new slabbed hash table. 73 * @param maxmem: maximum amount of memory this table is allowed to use. 74 * so every table gets maxmem/numtables to use for itself. 80 * @return: new hash table or NULL on malloc failure. 88 * Delete hash table. Entries are all deleted. 89 * @param table: to delete. 91 void slabhash_delete(struct slabhash* table); [all...] |
H A D | lruhash.h | 41 * The hash table keeps a maximum memory size. Old entries are removed 48 * so that the next thread can access the lookup table. 145 * Hash table that keeps LRU list of entries. 150 /** the size function for entries in this table */ 152 /** the compare function for entries in this table. */ 175 /** the number of entries in the hash table. */ 179 /** the amount of space the hash table is maximally allowed to use. */ 197 * An entry into the hash table. 226 * Create new hash table. 228 * @param maxmem: maximum amount of memory this table i [all...] |
/freebsd-10-stable/contrib/gdb/gdb/ |
H A D | frame-unwind.c | 38 /* Append a predicate to the end of the table. */ 40 append_predicate (struct frame_unwind_table *table, argument 43 table->sniffer = xrealloc (table->sniffer, ((table->nr + 1) 45 table->sniffer[table->nr] = sniffer; 46 table->nr++; 52 struct frame_unwind_table *table = XCALLOC (1, struct frame_unwind_table); local 53 append_predicate (table, dummy_frame_sniffe 63 struct frame_unwind_table *table = local 80 struct frame_unwind_table *table = gdbarch_data (gdbarch, frame_unwind_data); local [all...] |
H A D | frame-base.c | 81 struct frame_base_table *table = XCALLOC (1, struct frame_base_table); local 82 table->default_base = &default_frame_base; 83 return table; 89 struct frame_base_table *table = gdbarch_data (gdbarch, frame_base_data); local 90 if (table == NULL) 94 table = frame_base_init (gdbarch); 95 set_gdbarch_data (gdbarch, frame_base_data, table); 97 return table; 100 /* Append a predicate to the end of the table. */ 102 append_predicate (struct frame_base_table *table, argument 116 struct frame_base_table *table = frame_base_table (gdbarch); local 124 struct frame_base_table *table = frame_base_table (gdbarch); local 132 struct frame_base_table *table = frame_base_table (gdbarch); local [all...] |
/freebsd-10-stable/crypto/heimdal/lib/roken/ |
H A D | rtbl.c | 69 rtbl_set_flags (rtbl_t table, unsigned int flags) argument 71 table->flags = flags; 75 rtbl_get_flags (rtbl_t table) argument 77 return table->flags; 81 rtbl_get_column_by_id (rtbl_t table, unsigned int id) argument 84 for(i = 0; i < table->num_columns; i++) 85 if(table->columns[i]->column_id == id) 86 return table->columns[i]; 91 rtbl_get_column (rtbl_t table, const char *column) argument 94 for(i = 0; i < table 101 rtbl_destroy(rtbl_t table) argument 123 rtbl_add_column_by_id(rtbl_t table, unsigned int id, const char *header, unsigned int flags) argument 152 rtbl_add_column(rtbl_t table, const char *header, unsigned int flags) argument 158 rtbl_new_row(rtbl_t table) argument 184 column_compute_width(rtbl_t table, struct column_data *column) argument 198 rtbl_set_prefix(rtbl_t table, const char *prefix) argument 209 rtbl_set_separator(rtbl_t table, const char *separator) argument 220 rtbl_set_column_prefix(rtbl_t table, const char *column, const char *prefix) argument 236 rtbl_set_column_affix_by_id(rtbl_t table, unsigned int id, const char *prefix, const char *suffix) argument 267 get_column_prefix(rtbl_t table, struct column_data *c) argument 279 get_column_suffix(rtbl_t table, struct column_data *c) argument 305 rtbl_add_column_entry_by_id(rtbl_t table, unsigned int id, const char *data) argument 316 rtbl_add_column_entryv_by_id(rtbl_t table, unsigned int id, const char *fmt, ...) argument 334 rtbl_add_column_entry(rtbl_t table, const char *column, const char *data) argument 345 rtbl_add_column_entryv(rtbl_t table, const char *column, const char *fmt, ...) argument 363 rtbl_format(rtbl_t table, FILE * f) argument 433 rtbl_t table; local [all...] |
/freebsd-10-stable/contrib/binutils/bfd/ |
H A D | hash.c | 1 /* hash.c -- hash table routines for BFD 33 BFD provides a simple set of hash table functions. Routines 34 are provided to initialize a hash table, to free a hash table, 35 to look up a string in a hash table and optionally create an 36 entry for it, and to traverse a hash table. There is 37 currently no routine to delete an string from a hash table. 39 The basic hash table does not permit any data to be stored 40 with a string. However, a hash table is designed to present a 44 rather than simply providing a data pointer in a hash table 359 bfd_hash_table_init_n(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize, unsigned int size) argument 394 bfd_hash_table_init(struct bfd_hash_table *table, struct bfd_hash_entry *(*newfunc) (struct bfd_hash_entry *, struct bfd_hash_table *, const char *), unsigned int entsize) argument 407 bfd_hash_table_free(struct bfd_hash_table *table) argument 416 bfd_hash_lookup(struct bfd_hash_table *table, const char *string, bfd_boolean create, bfd_boolean copy) argument 519 bfd_hash_replace(struct bfd_hash_table *table, struct bfd_hash_entry *old, struct bfd_hash_entry *nw) argument 544 bfd_hash_allocate(struct bfd_hash_table *table, unsigned int size) argument 558 bfd_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string ATTRIBUTE_UNUSED) argument 570 bfd_hash_traverse(struct bfd_hash_table *table, bfd_boolean (*func) (struct bfd_hash_entry *, void *), void * info) argument 634 struct bfd_hash_table table; member in struct:bfd_strtab_hash 649 strtab_hash_newfunc(struct bfd_hash_entry *entry, struct bfd_hash_table *table, const char *string) argument 687 struct bfd_strtab_hash *table; local 727 _bfd_stringtab_free(struct bfd_strtab_hash *table) argument [all...] |
/freebsd-10-stable/contrib/gcclibs/libcpp/ |
H A D | symtab.c | 31 delete members from the table has been removed. */ 57 hash_table *table; local 59 table = XCNEW (hash_table); 62 _obstack_begin (&table->stack, 0, 0, 66 obstack_alignment_mask (&table->stack) = 0; 68 table->entries = XCNEWVEC (hashnode, nslots); 69 table->entries_owned = true; 70 table->nslots = nslots; 71 return table; 74 /* Frees all memory associated with a hash table 77 ht_destroy(hash_table *table) argument 94 ht_lookup(hash_table *table, const unsigned char *str, size_t len, enum ht_lookup_option insert) argument 102 ht_lookup_with_hash(hash_table *table, const unsigned char *str, size_t len, unsigned int hash, enum ht_lookup_option insert) argument 179 ht_expand(hash_table *table) argument 221 ht_forall(hash_table *table, ht_cb cb, const void *v) argument 253 ht_dump_statistics(hash_table *table) argument [all...] |
/freebsd-10-stable/contrib/apr-util/test/ |
H A D | testdbm.c | 40 dbm_table_t *table = apr_pcalloc(p, sizeof(*table) * NUM_TABLE_ROWS); local 44 table[i].key.dptr = apr_pmemdup(p, uuid.data, sizeof(uuid.data)); 45 table[i].key.dsize = sizeof(uuid.data); 46 table[i].val.dptr = apr_palloc(p, APR_UUID_FORMATTED_LENGTH); 47 table[i].val.dsize = APR_UUID_FORMATTED_LENGTH; 48 apr_uuid_format(table[i].val.dptr, &uuid); 53 table[i].val.dptr = apr_pmemdup(p, uuid.data, sizeof(uuid.data)); 54 table[i].val.dsize = sizeof(uuid.data); 55 table[ 63 test_dbm_store(abts_case *tc, apr_dbm_t *db, dbm_table_t *table) argument 81 test_dbm_fetch(abts_case *tc, apr_dbm_t *db, dbm_table_t *table) argument 101 test_dbm_delete(abts_case *tc, apr_dbm_t *db, dbm_table_t *table) argument 116 test_dbm_exists(abts_case *tc, apr_dbm_t *db, dbm_table_t *table) argument 131 test_dbm_traversal(abts_case *tc, apr_dbm_t *db, dbm_table_t *table) argument 170 dbm_table_t *table; local [all...] |
/freebsd-10-stable/contrib/ntp/lib/isc/ |
H A D | result.c | 119 resulttable *table; local 129 table = malloc(sizeof(*table)); 130 if (table == NULL) 132 table->base = base; 133 table->last = base + nresults - 1; 134 table->text = txt; 135 table->msgcat = msgcat; 136 table->set = set; 137 ISC_LINK_INIT(table, lin 173 resulttable *table; local [all...] |
/freebsd-10-stable/contrib/ipfilter/lib/ |
H A D | printtqtable.c | 13 printtqtable(table) 14 ipftq_t *table; 24 PRINTF(" %5d", table[i].ifq_ref - 1);
|
/freebsd-10-stable/contrib/less/ |
H A D | position.c | 12 * Routines dealing with the "position" table. 13 * This is a table which tells the position (in the input file) of the 16 * {{ The position table is scrolled by moving all the entries. 17 * Would be better to have a circular table 24 static POSITION *table = NULL; /* The position table */ variable 54 return (table[sindex]); 58 * Add a new file position to the bottom of the position table. 67 * Scroll the position table up. 70 table[ [all...] |
/freebsd-10-stable/contrib/ofed/management/opensm/opensm/ |
H A D | st.c | 106 #define EQUAL(table,x,y) ((x)==(y) || (*table->type->compare)(((void*)x),((void *)y)) == 0) 108 #define do_hash(key,table) (unsigned int)(*(table)->type->hash)(((void*)key)) 109 #define do_hash_bin(key,table) (do_hash(key, table)%(table)->num_bins) 239 void st_free_table(table) 240 st_table *table; 245 for (i = 0; i < table [all...] |
/freebsd-10-stable/sys/geom/part/ |
H A D | g_part_vtoc8.c | 147 vtoc8_align(struct g_part_vtoc8_table *table, uint64_t *start, uint64_t *size) argument 150 if (*size < table->secpercyl) 152 if (start != NULL && (*start % table->secpercyl)) { 153 *size += (*start % table->secpercyl) - table->secpercyl; 154 *start -= (*start % table->secpercyl) - table->secpercyl; 156 if (*size % table->secpercyl) 157 *size -= (*size % table->secpercyl); 158 if (*size < table 167 struct g_part_vtoc8_table *table; local 204 struct g_part_vtoc8_table *table; local 263 struct g_part_vtoc8_table *table; local 284 struct g_part_vtoc8_table *table; local 301 struct g_part_vtoc8_table *table; local 322 struct g_part_vtoc8_table *table; local 359 struct g_part_vtoc8_table *table; local 383 g_part_vtoc8_name(struct g_part_table *table, struct g_part_entry *baseentry, char *buf, size_t bufsz) argument 392 g_part_vtoc8_probe(struct g_part_table *table, struct g_consumer *cp) argument 435 struct g_part_vtoc8_table *table; local 544 struct g_part_vtoc8_table *table; local 568 struct g_part_vtoc8_table *table; local [all...] |
/freebsd-10-stable/sys/ofed/drivers/net/mlx4/ |
H A D | icm.c | 245 int mlx4_table_get(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 obj) argument 247 u32 i = (obj & (table->num_obj - 1)) / 248 (MLX4_TABLE_CHUNK_SIZE / table->obj_size); 251 mutex_lock(&table->mutex); 253 if (table->icm[i]) { 254 ++table->icm[i]->refcount; 258 table->icm[i] = mlx4_alloc_icm(dev, MLX4_TABLE_CHUNK_SIZE >> PAGE_SHIFT, 259 (table->lowmem ? GFP_KERNEL : GFP_HIGHUSER) | 260 __GFP_NOWARN, table->coherent); 261 if (!table 281 mlx4_table_put(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 obj) argument 305 mlx4_table_find(struct mlx4_icm_table *table, u32 obj, dma_addr_t *dma_handle) argument 352 mlx4_table_get_range(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 start, u32 end) argument 376 mlx4_table_put_range(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 start, u32 end) argument 385 mlx4_init_icm_table(struct mlx4_dev *dev, struct mlx4_icm_table *table, u64 virt, int obj_size, u64 nobj, int reserved, int use_lowmem, int use_coherent) argument 453 mlx4_cleanup_icm_table(struct mlx4_dev *dev, struct mlx4_icm_table *table) argument [all...] |
/freebsd-10-stable/sys/dev/amr/ |
H A D | amr_tables.h | 60 * Lookup table for code-to-text translations. 67 extern char *amr_describe_code(struct amr_code_lookup *table, u_int32_t code); 80 amr_describe_code(struct amr_code_lookup *table, u_int32_t code) argument 84 for (i = 0; table[i].string != NULL; i++) 85 if (table[i].code == code) 86 return(table[i].string); 87 return(table[i+1].string);
|
/freebsd-10-stable/sys/libkern/ |
H A D | scanc.c | 38 scanc(size, cp, table, mask0) 40 const u_char *cp, table[]; 48 if (table[*cp] & mask)
|
/freebsd-10-stable/contrib/com_err/ |
H A D | error.c | 51 if (code >= p->table->base && code < p->table->base + p->table->n_msgs) 52 return p->table->msgs[code - p->table->base]; 61 if (code >= p->table->base && code < p->table->base + p->table->n_msgs) { 62 const char *msg = p->table->msgs[code - p->table [all...] |
/freebsd-10-stable/contrib/netbsd-tests/lib/libc/stdlib/ |
H A D | t_abs.c | 50 } table[] = { local 59 for (size_t i = 0; i < __arraycount(table); i++) 60 ATF_CHECK(abs(table[i].val) == table[i].res); 74 } table[] = { local 86 for (size_t i = 0; i < __arraycount(table); i++) 87 ATF_CHECK(imaxabs(table[i].val) == table[i].res); 101 } table[] = { local 112 for (size_t i = 0; i < __arraycount(table); 127 } table[] = { local [all...] |
/freebsd-10-stable/crypto/heimdal/lib/com_err/ |
H A D | error.c | 54 if (code >= p->table->base && code < p->table->base + p->table->n_msgs) 55 return p->table->msgs[code - p->table->base]; 64 if (code >= p->table->base && code < p->table->base + p->table->n_msgs) { 65 const char *msg = p->table->msgs[code - p->table [all...] |
/freebsd-10-stable/sbin/dhclient/ |
H A D | hash.c | 78 void add_hash(struct hash_table *table, unsigned char *name, int len, argument 84 if (!table) 89 hashno = do_hash(name, len, table->hash_count); 93 warning("Can't add %s to hash table.", name); 98 bp->next = table->buckets[hashno]; 100 table->buckets[hashno] = bp; 104 hash_lookup(struct hash_table *table, unsigned char *name, int len) argument 109 if (!table) 115 hashno = do_hash(name, len, table->hash_count); 117 for (bp = table [all...] |
/freebsd-10-stable/sys/ia64/acpica/ |
H A D | madt.c | 116 ACPI_TABLE_MADT *table; local 132 table = (ACPI_TABLE_MADT *) 137 table->Header.Signature[0], 138 table->Header.Signature[1], 139 table->Header.Signature[2], 140 table->Header.Signature[3], table); 142 if (strncmp(table->Header.Signature, ACPI_SIG_MADT, 144 ACPI_FAILURE(AcpiTbChecksum((void *)table, 145 table 206 ACPI_TABLE_MADT *table; local [all...] |
/freebsd-10-stable/contrib/groff/src/roff/troff/ |
H A D | dictionary.cpp | 26 // is `p' a good size for a hash table 43 table = new association[n]; 53 table[i].v != 0; 55 if (s == table[i].s) { 57 void *temp = table[i].v; 58 table[i].v = v; 62 return table[i].v; 67 table[i].v = v; 68 table[i].s = s; 74 association *old_table = table; [all...] |
/freebsd-10-stable/contrib/wpa/src/utils/ |
H A D | eloop.c | 52 struct eloop_sock *table; member in struct:eloop_sock_table 59 int count; /* sum of all table counts */ 92 static void eloop_trace_sock_add_ref(struct eloop_sock_table *table) argument 95 if (table == NULL || table->table == NULL) 97 for (i = 0; i < table->count; i++) { 98 wpa_trace_add_ref(&table->table[i], eloop, 99 table 106 eloop_trace_sock_remove_ref(struct eloop_sock_table *table) argument 138 eloop_sock_table_add_sock(struct eloop_sock_table *table, int sock, eloop_sock_handler handler, void *eloop_data, void *user_data) argument 200 eloop_sock_table_remove_sock(struct eloop_sock_table *table, int sock) argument 314 eloop_sock_table_dispatch_table(struct eloop_sock_table *table, struct pollfd **pollfds_map, int max_pollfd_map, short int revents) argument 367 eloop_sock_table_set_fds(struct eloop_sock_table *table, fd_set *fds) argument 382 eloop_sock_table_dispatch(struct eloop_sock_table *table, fd_set *fds) argument 405 eloop_sock_table_destroy(struct eloop_sock_table *table) argument 460 struct eloop_sock_table *table; local 470 struct eloop_sock_table *table; local [all...] |
/freebsd-10-stable/usr.bin/xlint/lint2/ |
H A D | hash.c | 41 * XXX Really need a generalized hash table package 52 /* pointer to hash table, initialized in inithash() */ 58 * Initialize hash table. 88 * Look for a hash table entry. If no hash table entry for the 92 _hsearch(hte_t **table, const char *s, int mknew) argument 97 if (table == NULL) 98 table = htab; 101 for (hte = table[h]; hte != NULL; hte = hte->h_link) { 121 hte->h_link = table[ 132 _forall(hte_t **table, void (*f)(hte_t *)) argument 150 _destroyhash(hte_t **table) argument [all...] |