/freebsd-13-stable/sys/dev/netmap/ |
H A D | netmap_kloop.c | 467 /* First num_tx_rings entries are for the TX kicks. 468 * Then the RX kicks entries follow. The last two 469 * entries are for TX irq, and RX irq. */ 470 struct sync_kloop_poll_entry entries[0]; member in struct:sync_kloop_poll_ctx 479 struct sync_kloop_poll_entry *entry = poll_ctx->entries + 517 struct eventfd_ctx *irq_ctx = poll_ctx->entries[i].irq_ctx; 549 struct eventfd_ctx *irq_ctx = poll_ctx->entries[i].irq_ctx; 671 * entries. */ 696 /* We need 2 poll entries for TX and RX notifications coming 697 * from the netmap adapter, plus one entries pe [all...] |
/freebsd-13-stable/sys/contrib/ck/src/ |
H A D | ck_ht.c | 94 struct ck_ht_entry *entries; member in struct:ck_ht_map 141 ck_ht_map_create(struct ck_ht *table, CK_HT_TYPE entries) argument 148 n_entries = ck_internal_power_2(entries); 177 map->entries = (struct ck_ht_entry *)(((uintptr_t)&map[1] + prefix + 187 memset(map->entries, 0, sizeof(struct ck_ht_entry) * n_entries); 258 CK_HT_TYPE entries, 275 table->map = ck_ht_map_create(table, entries); 308 bucket = (void *)((uintptr_t)(map->entries + offset) & 422 entry = &map->entries[(i + seed) & map->mask]; 523 bucket = (void *)((uintptr_t)(map->entries 254 ck_ht_init(struct ck_ht *table, unsigned int mode, ck_ht_hash_cb_t *h, struct ck_malloc *m, CK_HT_TYPE entries, uint64_t seed) argument [all...] |
/freebsd-13-stable/sys/dev/vmware/vmci/ |
H A D | vmci_doorbell.c | 43 vmci_list(vmci_doorbell_entry) entries[VMCI_DOORBELL_INDEX_TABLE_SIZE]; 56 * The notify_idx_count is used for determining whether there are free entries 96 for (bucket = 0; bucket < ARRAYSIZE(vmci_doorbell_it.entries); 98 vmci_list_init(&vmci_doorbell_it.entries[bucket]); 258 vmci_list_scan(iter, &vmci_doorbell_it.entries[bucket], idx_list_item) { 337 vmci_list_insert(&vmci_doorbell_it.entries[bucket], entry, 855 vmci_list_scan(iter, &vmci_doorbell_it.entries[bucket], idx_list_item) {
|
/freebsd-13-stable/sys/netpfil/ipfw/ |
H A D | dn_heap.c | 73 * Increment size in blocks of 16 entries. 274 * heap property. It is needed when we delete a bunch of entries. 324 int entries; /* how many entries */ member in struct:dn_ht 403 /* Allocate buckets + 1 entries because buckets is use to 446 return ht ? ht->entries : 0; 473 ht->entries--; 481 ht->entries++; 508 ht->entries--; 547 ht->entries [all...] |
/freebsd-13-stable/contrib/llvm-project/lldb/source/DataFormatters/ |
H A D | FormatManager.cpp | 178 lldb::DynamicValueType use_dynamic, FormattersMatchVector &entries, 187 entries.push_back( 192 entries.push_back( 197 entries.push_back({display_type_name, did_strip_ptr, 206 use_dynamic, entries, did_strip_ptr, true, did_strip_typedef); 214 use_dynamic, entries, did_strip_ptr, did_strip_ref, 223 use_dynamic, entries, true, did_strip_ref, did_strip_typedef); 230 use_dynamic, entries, did_strip_ptr, did_strip_ref, 249 use_dynamic, entries, did_strip_ptr, did_strip_ref, 260 entries 176 GetPossibleMatches( ValueObject &valobj, CompilerType compiler_type, lldb::DynamicValueType use_dynamic, FormattersMatchVector &entries, bool did_strip_ptr, bool did_strip_ref, bool did_strip_typedef, bool root_level) argument [all...] |
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | index.c | 59 /* We store P2L proto-index entries as 6 values, 64 bits each on disk. 68 /* Page tables in the log-to-phys index file exclusively contain entries 76 /* number of mapping entries in that page */ 95 /* (max) number of entries per page */ 112 /* number of entries in the OFFSETS array */ 126 /* All of the log-to-phys proto index file consist of entries of this type. 130 /* phys offset + 1 of the data container. 0 for "new revision" entries. */ 133 /* corresponding item index. 0 for "new revision" entries. */ 137 * entries and for items with no outer container. */ 198 /* number of used entries i 798 encode_l2p_page(apr_array_header_t *entries, int start, int end, svn_spillbuf_t *buffer, apr_pool_t *scratch_pool) argument 925 apr_array_header_t *entries local 2674 get_p2l_page(apr_array_header_t **entries, svn_fs_x__revision_file_t *rev_file, svn_fs_t *fs, svn_revnum_t start_revision, apr_off_t start_offset, apr_off_t next_offset, apr_off_t page_start, apr_uint64_t page_size, apr_pool_t *result_pool) argument 2877 append_p2l_entries(apr_array_header_t *entries, apr_array_header_t *page_entries, apr_off_t block_start, apr_off_t block_end, svn_boolean_t resolve_ptr) argument 2941 apr_array_header_t *entries = *(apr_array_header_t **)out; local 2962 p2l_index_lookup(apr_array_header_t *entries, svn_fs_x__revision_file_t *rev_file, svn_fs_t *fs, svn_revnum_t revision, apr_off_t block_start, apr_off_t block_end, apr_pool_t *scratch_pool) argument 3107 svn_fs_x__p2l_index_lookup(apr_array_header_t **entries, svn_fs_t *fs, svn_fs_x__revision_file_t *rev_file, svn_revnum_t revision, apr_off_t block_start, apr_off_t block_size, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 3181 apr_array_header_t *entries = apr_pmemdup(scratch_pool, page, local 3253 apr_array_header_t *entries = apr_array_make(result_pool, 1, local 3483 svn_fs_x__p2l_index_from_p2l_entries(const char **protoname, svn_fs_t *fs, svn_fs_x__revision_file_t *rev_file, apr_array_header_t *entries, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 3581 svn_fs_x__l2p_index_from_p2l_entries(const char **protoname, svn_fs_t *fs, apr_array_header_t *entries, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 3876 svn_fs_x__p2l_entry_t *entries = (svn_fs_x__p2l_entry_t *)page->elts; local 3914 svn_fs_x__p2l_entry_t *entries; local [all...] |
/freebsd-13-stable/crypto/openssl/crypto/x509/ |
H A D | x509_obj.c | 62 for (i = 0; i < sk_X509_NAME_ENTRY_num(a->entries); i++) { 63 ne = sk_X509_NAME_ENTRY_value(a->entries, i);
|
/freebsd-13-stable/sys/dev/bnxt/ |
H A D | bnxt_hwrm.h | 90 int bnxt_hwrm_nvm_get_dir_info(struct bnxt_softc *softc, uint32_t *entries, 93 uint32_t *entries, uint32_t *entry_length, struct iflib_dma_info *dma_data);
|
/freebsd-13-stable/contrib/ncurses/ncurses/tinfo/ |
H A D | MKfallback.sh | 91 /* fallback entries for: $* */
|
/freebsd-13-stable/usr.sbin/kbdmap/ |
H A D | kbdmap.c | 73 SLIST_ENTRY(keymap) entries; 86 SLIST_FOREACH(km, &head, entries) 102 SLIST_FOREACH(km, &head, entries) 116 SLIST_FOREACH(km, &head, entries) { 118 SLIST_REMOVE(&head, km, keymap, entries); 134 SLIST_FOREACH(km, &head, entries) { 150 SLIST_INSERT_HEAD(&head, km_new, entries); 764 SLIST_FOREACH(km, &head, entries)
|
/freebsd-13-stable/usr.sbin/lpr/chkprintcap/ |
H A D | skimprintcap.c | 150 skinf->entries++; 259 warnx("%4d lines (%d comments), %d entries for %s", 260 skinf->lines, skinf->comments, skinf->entries, pcap_fname);
|
/freebsd-13-stable/sys/netpfil/ipfw/nat64/ |
H A D | nat64lsn.c | 102 STAILQ_ENTRY(nat64lsn_job_item) entries; 324 CK_SLIST_FOREACH(state, &STATE_HASH(host, hval), entries) { 392 state, entries); local 786 state, nat64lsn_state, entries); 826 CK_SLIST_FOREACH_SAFE(pg, &alias->portgroups, entries, tpg) { 866 nat64lsn_pg, entries); 871 CK_SLIST_INSERT_HEAD(portgroups, pg, entries); 885 entries, tmp) { 898 nat64lsn_host, entries); 901 CK_SLIST_INSERT_HEAD(hosts, host, entries); [all...] |
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/ |
H A D | fs.h | 190 /* representation key for this node's text data (files) or entries 350 /* entries list, maps (const char *) name --> (const char *) lock-node-id */ 351 apr_hash_t *entries; 348 apr_hash_t *entries; member in struct:lock_node_t
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/util/ |
H A D | fs_skels.h | 84 (the node-id of the entry), or NULL if SKEL contains no entries. 156 apr_hash_t *entries,
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_fs/ |
H A D | cached_data.h | 134 the directory entries of node-revision NODEREV in filesystem FS. The 135 returned table is allocated in RESULT_POOL and entries are sorted 149 svn_fs_fs__find_dir_entry(apr_array_header_t *entries,
|
H A D | recovery.c | 159 apr_hash_t *entries; local 186 rely on directory entries being stored as PLAIN reps, though. */ 205 /* Now read the entries from that stream. */ 206 entries = apr_hash_make(pool); 207 err = svn_hash_read2(entries, stream, SVN_HASH_TERMINATOR, pool); 219 /* Now check each of the entries in our directory to find new node and 222 for (hi = apr_hash_first(pool, entries); hi; hi = apr_hash_next(hi))
|
/freebsd-13-stable/lib/libmt/ |
H A D | mtlib.h | 73 STAILQ_HEAD(, mt_status_entry) entries; member in struct:mt_status_data
|
/freebsd-13-stable/sys/dev/agp/ |
H A D | agp_ati.c | 129 u_int32_t entries = apsize >> AGP_PAGE_SHIFT; local 134 sc->ag_entries = entries; 135 sc->ag_virtual = (void *)kmem_alloc_attr(entries * sizeof(u_int32_t), 149 kmem_free((vm_offset_t)sc->ag_virtual, entries *
|
/freebsd-13-stable/sys/netinet/cc/ |
H A D | cc.h | 169 STAILQ_ENTRY (cc_algo) entries; member in struct:cc_algo
|
/freebsd-13-stable/sys/security/mac_veriexec/ |
H A D | mac_veriexec.h | 101 LIST_ENTRY(mac_veriexec_fpops) entries; member in struct:mac_veriexec_fpops
|
H A D | mac_veriexec_internal.h | 59 LIST_ENTRY(mac_veriexec_file_info) entries; member in struct:mac_veriexec_file_info
|
/freebsd-13-stable/sys/sys/ |
H A D | disk_zone.h | 166 struct disk_zone_rep_entry *entries; member in struct:disk_zone_report
|
/freebsd-13-stable/sys/dev/sfxge/ |
H A D | sfxge_rx.h | 161 unsigned int entries; member in struct:sfxge_rxq
|
/freebsd-13-stable/sys/arm64/iommu/ |
H A D | iommu.c | 299 struct iommu_map_entries_tailq *entries, bool cansleep) 304 TAILQ_FOREACH_SAFE(entry, entries, dmamap_link, entry1) { 310 TAILQ_REMOVE(entries, entry, dmamap_link); 314 if (TAILQ_EMPTY(entries)) 317 panic("entries map is not empty"); 298 iommu_domain_unload(struct iommu_domain *iodom, struct iommu_map_entries_tailq *entries, bool cansleep) argument
|
/freebsd-13-stable/sys/fs/ext2fs/ |
H A D | ext2_htree.c | 534 * Move half of entries from the old directory block to the new one. 592 * Count the number of entries to move to directory block 2. 609 * Move half of directory entries from block 1 to block 2. 624 /* Shrink directory entries in block 1. */ 782 struct ext2fs_htree_entry *entries, *leaf_node; local 817 entries = info.h_levels[info.h_levels_num - 1].h_entries; 818 ent_num = ext2_htree_get_count(entries); 819 if (ent_num == ext2_htree_get_limit(entries)) { 855 split_hash = ext2_htree_get_hash(entries + src_ent_num); 857 /* Move half of index entries t [all...] |