/freebsd-current/sys/dev/vmware/vmci/ |
H A D | vmci_hashtable.c | 21 static int hashtable_unlink_entry(struct vmci_hashtable *table, 23 static bool vmci_hashtable_entry_exists_locked(struct vmci_hashtable *table, 45 struct vmci_hashtable *table; local 47 table = vmci_alloc_kernel_mem(sizeof(*table), 49 if (table == NULL) 51 memset(table, 0, sizeof(*table)); 53 table->entries = vmci_alloc_kernel_mem(sizeof(*table 91 vmci_hashtable_destroy(struct vmci_hashtable *table) argument 147 vmci_hashtable_add_entry(struct vmci_hashtable *table, struct vmci_hash_entry *entry) argument 194 vmci_hashtable_remove_entry(struct vmci_hashtable *table, struct vmci_hash_entry *entry) argument 242 vmci_hashtable_get_entry_locked(struct vmci_hashtable *table, struct vmci_handle handle) argument 290 vmci_hashtable_get_entry(struct vmci_hashtable *table, struct vmci_handle handle) argument 326 vmci_hashtable_hold_entry(struct vmci_hashtable *table, struct vmci_hash_entry *entry) argument 358 vmci_hashtable_release_entry_locked(struct vmci_hashtable *table, struct vmci_hash_entry *entry) argument 403 vmci_hashtable_release_entry(struct vmci_hashtable *table, struct vmci_hash_entry *entry) argument 433 vmci_hashtable_entry_exists(struct vmci_hashtable *table, struct vmci_handle handle) argument 464 vmci_hashtable_entry_exists_locked(struct vmci_hashtable *table, struct vmci_handle handle) argument 507 hashtable_unlink_entry(struct vmci_hashtable *table, struct vmci_hash_entry *entry) argument 559 vmci_hashtable_sync(struct vmci_hashtable *table) argument [all...] |
H A D | vmci_hashtable.h | 7 /* Hash table for use in the APIs. */ 29 void vmci_hashtable_destroy(struct vmci_hashtable *table); 32 int vmci_hashtable_add_entry(struct vmci_hashtable *table, 34 int vmci_hashtable_remove_entry(struct vmci_hashtable *table, 36 struct vmci_hash_entry *vmci_hashtable_get_entry(struct vmci_hashtable *table, 38 void vmci_hashtable_hold_entry(struct vmci_hashtable *table, 40 int vmci_hashtable_release_entry(struct vmci_hashtable *table, 42 bool vmci_hashtable_entry_exists(struct vmci_hashtable *table, 44 void vmci_hashtable_sync(struct vmci_hashtable *table);
|
/freebsd-current/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-current/contrib/unbound/util/storage/ |
H A D | lruhash.c | 67 struct lruhash* table = (struct lruhash*)calloc(1, local 69 if(!table) 71 lock_quick_init(&table->lock); 72 table->sizefunc = sizefunc; 73 table->compfunc = compfunc; 74 table->delkeyfunc = delkeyfunc; 75 table->deldatafunc = deldatafunc; 76 table->cb_arg = arg; 77 table->size = start_size; 78 table 99 bin_delete(struct lruhash* table, struct lruhash_bin* bin) argument 118 bin_split(struct lruhash* table, struct lruhash_bin* newa, int newmask) argument 154 lruhash_delete(struct lruhash* table) argument 183 reclaim_space(struct lruhash* table, struct lruhash_entry** list) argument 219 bin_find_entry(struct lruhash* table, struct lruhash_bin* bin, hashvalue_type hash, void* key, size_t* collisions) argument 236 table_grow(struct lruhash* table) argument 271 lru_front(struct lruhash* table, struct lruhash_entry* entry) argument 282 lru_remove(struct lruhash* table, struct lruhash_entry* entry) argument 293 lru_touch(struct lruhash* table, struct lruhash_entry* entry) argument 305 lruhash_insert(struct lruhash* table, hashvalue_type hash, struct lruhash_entry* entry, void* data, void* cb_arg) argument 364 lruhash_lookup(struct lruhash* table, hashvalue_type hash, void* key, int wr) argument 386 lruhash_remove(struct lruhash* table, hashvalue_type hash, void* key) argument 424 bin_clear(struct lruhash* table, struct lruhash_bin* bin) argument 446 lruhash_clear(struct lruhash* table) argument 467 lruhash_status(struct lruhash* table, const char* id, int extended) argument 501 lruhash_get_mem(struct lruhash* table) argument 524 lruhash_setmarkdel(struct lruhash* table, lruhash_markdelfunc_type md) argument 532 lruhash_update_space_used(struct lruhash* table, void* cb_arg, int diff_size) argument 595 lru_demote(struct lruhash* table, struct lruhash_entry* entry) argument 618 lruhash_insert_or_retrieve(struct lruhash* table, hashvalue_type hash, struct lruhash_entry* entry, void* data, void* cb_arg) 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. */ 199 * An entry into the hash table. 228 * Create new hash table. 230 * @param maxmem: maximum amount of memory this table i [all...] |
/freebsd-current/lib/libsysdecode/ |
H A D | support.c | 34 lookup_value(struct name_table *table, uintmax_t val) argument 37 for (; table->str != NULL; table++) 38 if (table->val == val) 39 return (table->str); 45 * table. This is a helper routine which outputs a symbolic mask of 50 print_mask_part(FILE *fp, struct name_table *table, uintmax_t *valp, argument 56 for (; table->str != NULL; table++) { 57 if ((table 81 print_mask_int(FILE *fp, struct name_table *table, int ival, int *rem) argument 98 print_mask_0(FILE *fp, struct name_table *table, int val, int *rem) argument 114 print_mask_0ul(FILE *fp, struct name_table *table, u_long lval, u_long *rem) argument 155 print_value(FILE *fp, struct name_table *table, uintmax_t val) argument [all...] |
/freebsd-current/contrib/kyua/utils/text/ |
H A D | table_test.cpp | 29 #include "utils/text/table.hpp" 46 /// Because of the flattening of the formatted table into a string, we risk 48 /// a table. This should not happen, and not accounting for this little detail 51 /// \param expected Textual representation of the table, as a collection of 54 /// \param table The table to format. 58 const text::table& table) 60 ATF_REQUIRE_EQ(expected, text::join(formatter.format(table), "\n") + "\n"); 68 ATF_REQUIRE_EQ(5, text::table( 56 table_formatter_check(const std::string& expected, const text::table_formatter& formatter, const text::table& table) argument [all...] |
/freebsd-current/usr.sbin/bhyve/ |
H A D | basl.c | 97 basl_dump_table(const struct basl_table *const table, const bool mem) argument 99 const ACPI_TABLE_HEADER *const header = table->data; 103 data = table->data; 105 data = vm_map_gpa(table->ctx, BHYVE_ACPI_BASE + table->off, 106 table->len); 113 BHYVE_ACPI_BASE + table->off, mem ? "Memory" : "FwCfg"); 114 hexdump(data, table->len, NULL, 0); 122 struct basl_table *table; local 124 STAILQ_FOREACH(table, 146 basl_finish_install_guest_tables(struct basl_table *const table, uint32_t *const off) argument 187 basl_finish_patch_checksums(struct basl_table *const table) argument 255 struct basl_table *table; local 272 basl_finish_patch_pointers(struct basl_table *const table) argument 329 basl_finish_set_length(struct basl_table *const table) argument 347 struct basl_table *table; local 424 basl_table_add_checksum(struct basl_table *const table, const uint32_t off, const uint32_t start, const uint32_t len) argument 447 basl_table_add_length(struct basl_table *const table, const uint32_t off, const uint8_t size) argument 470 basl_table_add_pointer(struct basl_table *const table, const uint8_t src_signature[ACPI_NAMESEG_SIZE], const uint32_t off, const uint8_t size) argument 496 basl_table_append_bytes(struct basl_table *const table, const void *const bytes, const uint32_t len) argument 527 basl_table_append_checksum(struct basl_table *const table, const uint32_t start, const uint32_t len) argument 539 basl_table_append_content(struct basl_table *table, void *data, uint32_t len) argument 550 basl_table_append_fwcfg(struct basl_table *const table, const uint8_t *fwcfg_name, const uint32_t alignment, const uint8_t size) argument 567 basl_table_append_gas(struct basl_table *const table, const uint8_t space_id, const uint8_t bit_width, const uint8_t bit_offset, const uint8_t access_width, const uint64_t address) argument 583 basl_table_append_header(struct basl_table *const table, const uint8_t signature[ACPI_NAMESEG_SIZE], const uint8_t revision, const uint32_t oem_revision) argument 619 basl_table_append_int(struct basl_table *const table, const uint64_t val, const uint8_t size) argument 631 basl_table_append_length(struct basl_table *const table, const uint8_t size) argument 643 basl_table_append_pointer(struct basl_table *const table, const uint8_t src_signature[ACPI_NAMESEG_SIZE], const uint8_t size) argument 656 basl_table_create(struct basl_table **const table, struct vmctx *ctx, const uint8_t *const name, const uint32_t alignment) argument 688 basl_table_register_to_rsdt(struct basl_table *table) argument [all...] |
H A D | basl.h | 71 int basl_table_add_checksum(struct basl_table *const table, const uint32_t off, 73 int basl_table_add_length(struct basl_table *const table, const uint32_t off, 75 int basl_table_add_pointer(struct basl_table *const table, 78 int basl_table_append_bytes(struct basl_table *table, const void *bytes, 80 int basl_table_append_checksum(struct basl_table *table, uint32_t start, 83 int basl_table_append_content(struct basl_table *table, void *data, 85 int basl_table_append_fwcfg(struct basl_table *table, 88 int basl_table_append_gas(struct basl_table *table, uint8_t space_id, 91 int basl_table_append_header(struct basl_table *table, 94 int basl_table_append_int(struct basl_table *table, uint64_ [all...] |
/freebsd-current/contrib/ntp/libntp/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-current/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 53 return (table[sindex]); 57 * Add a new file position to the bottom of the position table. 64 * Scroll the position table up. 67 table[ [all...] |
/freebsd-current/sys/compat/linuxkpi/common/include/linux/ |
H A D | devcoredump.h | 39 _lkpi_dev_coredumpsg_free(struct scatterlist *table) argument 45 iter = table; 46 for_each_sg(table, iter, sg_nents(table), i) { 53 kfree(table); 66 dev_coredumpsg(struct device *dev __unused, struct scatterlist *table, argument 71 _lkpi_dev_coredumpsg_free(table);
|
/freebsd-current/sys/contrib/dev/iwlwifi/fw/ |
H A D | dump.c | 120 struct iwl_umac_error_event_table table = {}; local 129 iwl_trans_read_mem_bytes(trans, base, &table, sizeof(table)); 131 if (table.valid) 132 fwrt->dump.umac_err_id = table.error_id; 141 if (ERROR_START_OFFSET <= table.valid * ERROR_ELEM_SIZE) { 144 fwrt->trans->status, table.valid); 147 if ((table.error_id & ~FW_SYSASSERT_CPU_MASK) == 154 IWL_ERR(fwrt, "0x%08X | %s\n", table.error_id, 155 iwl_fw_lookup_assert_desc(table 174 struct iwl_error_event_table table = {}; local 298 struct iwl_tcm_error_event_table table = {}; local 372 struct iwl_rcm_error_event_table table = {}; local [all...] |
/freebsd-current/sys/dev/mlx4/mlx4_core/ |
H A D | mlx4_icm.c | 250 int mlx4_table_get(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 obj, argument 253 u32 i = (obj & (table->num_obj - 1)) / 254 (MLX4_TABLE_CHUNK_SIZE / table->obj_size); 257 mutex_lock(&table->mutex); 259 if (table->icm[i]) { 260 ++table->icm[i]->refcount; 264 table->icm[i] = mlx4_alloc_icm(dev, MLX4_TABLE_CHUNK_SIZE >> PAGE_SHIFT, 265 (table->lowmem ? gfp : GFP_HIGHUSER) | 266 __GFP_NOWARN, table->coherent); 267 if (!table 287 mlx4_table_put(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 obj) argument 307 mlx4_table_find(struct mlx4_icm_table *table, u32 obj, dma_addr_t *dma_handle) argument 354 mlx4_table_get_range(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 start, u32 end) argument 378 mlx4_table_put_range(struct mlx4_dev *dev, struct mlx4_icm_table *table, u32 start, u32 end) argument 387 mlx4_init_icm_table(struct mlx4_dev *dev, struct mlx4_icm_table *table, u64 virt, int obj_size, u32 nobj, int reserved, int use_lowmem, int use_coherent) argument 451 mlx4_cleanup_icm_table(struct mlx4_dev *dev, struct mlx4_icm_table *table) argument [all...] |
/freebsd-current/contrib/ofed/opensm/opensm/ |
H A D | st.c | 104 #define EQUAL(table,x,y) ((x)==(y) || (*table->type->compare)(((void*)x),((void *)y)) == 0) 106 #define do_hash(key,table) (unsigned int)(*(table)->type->hash)(((void*)key)) 107 #define do_hash_bin(key,table) (do_hash(key, table)%(table)->num_bins) 234 void st_free_table(st_table *table) argument 239 for (i = 0; i < table->num_bins; i++) { 240 ptr = table 273 st_lookup(st_table *table, st_data_t key, st_data_t *value) argument 309 st_insert(st_table *table, st_data_t key, st_data_t value) argument 326 st_add_direct(st_table *table, st_data_t key, st_data_t value) argument 335 rehash(st_table *table) argument 402 st_delete(st_table *table, st_data_t *key, st_data_t *value) argument 443 st_delete_safe(st_table *table, st_data_t *key, st_data_t *value, st_data_t never) argument 479 st_cleanup_safe(st_table *table, st_data_t never) argument 487 st_foreach(st_table *table, int (*func)(st_data_t key, st_data_t val, st_data_t arg), st_data_t arg) argument [all...] |
/freebsd-current/sys/contrib/openzfs/module/os/linux/spl/ |
H A D | spl-tsd.c | 25 * Thread specific data has implemented using a hash table, this avoids 30 * The majority of the entries in the hash table are for specific tsd 37 * By default the hash table is sized to 512 bins which is expected to 40 * The hash table contains two additional type of entries. They first 92 * tsd_hash_search - searches hash table for tsd_hash_entry 93 * @table: hash table 98 tsd_hash_search(tsd_hash_table_t *table, uint_t key, pid_t pid) argument 105 hash = hash_long((ulong_t)key * (ulong_t)pid, table->ht_bits); 106 bin = &table 156 tsd_hash_add(tsd_hash_table_t *table, uint_t key, pid_t pid, void *value) argument 215 tsd_hash_add_key(tsd_hash_table_t *table, uint_t *keyp, dtor_func_t dtor) argument 276 tsd_hash_add_pid(tsd_hash_table_t *table, pid_t pid) argument 315 tsd_hash_del(tsd_hash_table_t *table, tsd_hash_entry_t *entry) argument 332 tsd_hash_table_t *table; local 366 tsd_hash_table_fini(tsd_hash_table_t *table) argument 404 tsd_hash_table_t *table; local 461 tsd_hash_table_t *table; local 591 tsd_hash_table_t *table; local 654 tsd_hash_table_t *table; local [all...] |
/freebsd-current/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-current/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-current/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-current/sbin/dhclient/ |
H A D | hash.c | 78 void add_hash(struct hash_table *table, const 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-current/sys/contrib/openzfs/tests/zfs-tests/tests/functional/channel_program/lua_core/ |
H A D | tst.lib_table.lua | 26 -- testing table library 39 return table.unpack(res, 1, res.n) 59 local unpack = table.unpack 100 a = table.pack() 103 a = table.pack(table) 104 assert(a[1] == table and a.n == 1) 106 a = table.pack(nil, nil, nil, nil) 116 local s, e = pcall(table.sort, t, f) 135 table [all...] |
/freebsd-current/sbin/ipf/libipf/ |
H A D | printtqtable.c | 13 printtqtable(ipftq_t *table) argument 23 PRINTF(" %5d", table[i].ifq_ref - 1);
|
/freebsd-current/sys/dev/mlx5/mlx5_core/ |
H A D | mlx5_rl.c | 39 * If the table is full, return NULL 41 static struct mlx5_rl_entry *find_rl_entry(struct mlx5_rl_table *table, argument 48 for (i = 0; i < table->max_size; i++) { 49 entry = table->rl_entry + i; 95 const struct mlx5_rl_table *table = &dev->priv.rl_table; local 97 return (rate <= table->max_rate && rate >= table->min_rate && 104 struct mlx5_rl_table *table = &dev->priv.rl_table; local 108 mutex_lock(&table->rl_lock); 112 rate, table 163 struct mlx5_rl_table *table = &dev->priv.rl_table; local 192 struct mlx5_rl_table *table = &dev->priv.rl_table; local 222 struct mlx5_rl_table *table = &dev->priv.rl_table; local [all...] |
/freebsd-current/sys/libkern/ |
H A D | scanc.c | 36 scanc(u_int size, const u_char *cp, const u_char table[], int mask0) argument 43 if (table[*cp] & mask)
|