/freebsd-13-stable/sbin/newfs/ |
H A D | mkfs.c | 874 int entries; local 883 entries = (nflag) ? ROOTLINKCNT - 1: ROOTLINKCNT; 895 node.dp1.di_nlink = entries; 896 node.dp1.di_size = makedir(root_dir, entries); 931 node.dp2.di_nlink = entries; 932 node.dp2.di_size = makedir(root_dir, entries); 959 * construct a set of directory entries in "iobuf". 963 makedir(struct direct *protodir, int entries) argument 970 for (cp = iobuf, i = 0; i < entries - 1; i++) {
|
/freebsd-13-stable/sys/i386/include/xen/ |
H A D | hypercall.h | 161 unsigned long *frame_list, int entries) 163 return _hypercall2(int, set_gdt, frame_list, entries); 160 HYPERVISOR_set_gdt( unsigned long *frame_list, int entries) argument
|
/freebsd-13-stable/sys/dev/sfxge/ |
H A D | sfxge_rx.c | 246 KASSERT(rxfill <= EFX_RXQ_LIMIT(rxq->entries), 247 ("rxfill > EFX_RXQ_LIMIT(rxq->entries)")); 248 ntodo = min(EFX_RXQ_LIMIT(rxq->entries) - rxfill, target); 249 KASSERT(ntodo <= EFX_RXQ_LIMIT(rxq->entries), 250 ("ntodo > EFX_RQX_LIMIT(rxq->entries)")); 322 sfxge_rx_qfill(rxq, EFX_RXQ_LIMIT(rxq->entries), B_TRUE); 930 sfxge_rx_qfill(rxq, EFX_RXQ_LIMIT(rxq->entries), B_FALSE); 1285 rxq->entries = sc->rxq_entries; 1286 rxq->ptr_mask = rxq->entries - 1; 1287 rxq->refill_threshold = RX_REFILL_THRESHOLD(rxq->entries); [all...] |
/freebsd-13-stable/sys/dev/mlx4/mlx4_core/ |
H A D | mlx4_cq.c | 140 int entries, struct mlx4_mtt *mtt) 152 cq_context->logsize_usrpage = cpu_to_be32(ilog2(entries) << 24); 139 mlx4_cq_resize(struct mlx4_dev *dev, struct mlx4_cq *cq, int entries, struct mlx4_mtt *mtt) argument
|
/freebsd-13-stable/sys/amd64/include/xen/ |
H A D | hypercall.h | 184 unsigned long *frame_list, unsigned int entries) 186 return _hypercall2(int, set_gdt, frame_list, entries); 183 HYPERVISOR_set_gdt( unsigned long *frame_list, unsigned int entries) argument
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_x/ |
H A D | cached_data.c | 2449 sorted(apr_array_header_t *entries) 2453 const svn_fs_x__dirent_t * const *dirents = (const void *)entries->elts; 2454 for (i = 0; i < entries->nelts-1; ++i) 2483 /* Into ENTRIES, parse all directories entries from the serialized form in 2503 apr_array_header_t *entries; 2512 entries = apr_array_make(result_pool, (int)count, 2560 APR_ARRAY_PUSH(entries, svn_fs_x__dirent_t *) = dirent; 2569 APR_ARRAY_PUSH(entries, svn_fs_x__dirent_t *) = apr_hash_this_val(hi); 2571 if (!sorted(entries)) 2572 svn_sort__array(entries, compare_dirent 2448 sorted(apr_array_header_t *entries) argument 2502 apr_array_header_t *entries; local 2774 svn_fs_x__find_dir_entry(apr_array_header_t *entries, const char *name, int *hint) argument 3400 apr_array_header_t *entries; local [all...] |
H A D | dag.c | 260 _("Can't get entries of non-directory")); 378 svn_fs_x__dag_dir_entries(apr_array_header_t **entries, 387 _("Can't get entries of non-directory")); 389 return svn_fs_x__rep_contents_dir(entries, node->fs, noderev, result_pool, 593 /* Find the node named NAME in PARENT's entries list if it exists. */ 671 apr_array_header_t *entries; 675 /* Loop over directory entries */ 676 SVN_ERR(svn_fs_x__dag_dir_entries(&entries, node, scratch_pool, 678 for (i = 0; i < entries->nelts; ++i) 681 = &APR_ARRAY_IDX(entries, 375 svn_fs_x__dag_dir_entries(apr_array_header_t **entries, dag_node_t *node, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument 666 apr_array_header_t *entries; local [all...] |
/freebsd-13-stable/sys/dev/ixgbe/ |
H A D | if_sriov.c | 417 int entries; local 420 entries = (msg[0] & IXGBE_VT_MSGINFO_MASK) >> IXGBE_VT_MSGINFO_SHIFT; 421 entries = min(entries, IXGBE_MAX_VF_MC); 425 vf->num_mc_hashes = entries; 428 for (int i = 0; i < entries; i++) {
|
/freebsd-13-stable/contrib/subversion/subversion/libsvn_subr/ |
H A D | cache-membuffer.c | 54 * arbitrary gaps between entries. This buffer is sub-devided into 57 * 2. A directory of cache entries. This is organized similar to CPU 59 * of entries that may contain the header info for an item with 76 * entries. Every USED entry has a reference to the previous and the next 103 * As a result, frequently used entries are likely not to be dropped until 106 * with new entries. For details on the fine-tuning involved, see the 184 * byte, i.e. 8 flags/byte x 32 groups/flag x 8 entries/group x 40 index 200 /* We use this structure to identify cache entries. There cannot be two 201 * entries with the same entry key. However unlikely, though, two different 257 /* Number of used entries tha 651 entry_t entries[GROUP_SIZE]; member in struct:entry_group_t [all...] |
/freebsd-13-stable/contrib/subversion/subversion/libsvn_fs_base/util/ |
H A D | fs_skels.c | 761 apr_hash_t *entries = NULL; 766 return skel_err("entries"); 771 entries = apr_hash_make(pool); 773 /* Check entries are well-formed as we go along. */ 781 return skel_err("entries"); 790 apr_hash_set(entries, name, elt->children->len, id); 795 *entries_p = entries; 1351 apr_hash_t *entries, 1358 if (entries) 1360 /* Loop over hash entries */ 758 apr_hash_t *entries = NULL; local 1346 svn_fs_base__unparse_entries_skel(svn_skel_t **skel_p, apr_hash_t *entries, apr_pool_t *pool) argument [all...] |
/freebsd-13-stable/sys/dev/bnxt/ |
H A D | bnxt_hwrm.c | 1301 bnxt_hwrm_nvm_get_dir_info(struct bnxt_softc *softc, uint32_t *entries, argument 1320 if (entries) 1321 *entries = le32toh(resp->entries); 1331 bnxt_hwrm_nvm_get_dir_entries(struct bnxt_softc *softc, uint32_t *entries, argument 1340 if (!entries) 1341 entries = &ent; 1345 rc = bnxt_hwrm_nvm_get_dir_info(softc, entries, entry_length); 1348 if (*entries * *entry_length > dma_data->idi_size) {
|
/freebsd-13-stable/sys/fs/tmpfs/ |
H A D | tmpfs_subr.c | 544 * If the node references a directory, no entries are allowed. 1086 dc->tdc_current = LIST_NEXT(dc->tdc_current, uh.td_dup.entries); 1194 LIST_FOREACH(de, duphead, uh.td_dup.entries) { 1230 LIST_INSERT_HEAD(duphead, nde, uh.td_dup.entries); 1249 LIST_INSERT_HEAD(duphead, nde, uh.td_dup.entries); 1261 LIST_INSERT_HEAD(duphead, nde, uh.td_dup.entries); 1272 LIST_INSERT_HEAD(duphead, nde, uh.td_dup.entries); 1346 if (LIST_NEXT(de, uh.td_dup.entries) == NULL) { 1351 LIST_REMOVE(de, uh.td_dup.entries); 1382 LIST_REMOVE(dde, uh.td_dup.entries); [all...] |
/freebsd-13-stable/sys/netpfil/pf/ |
H A D | pf_lb.c | 175 r = TAILQ_NEXT(r, entries); 182 r = TAILQ_NEXT(r, entries); 186 r = TAILQ_NEXT(r, entries); 505 if (TAILQ_NEXT(rpool->cur, entries) == NULL) 508 rpool->cur = TAILQ_NEXT(rpool->cur, entries);
|
H A D | pf.h | 161 #define LCNT_OVERLOAD_FLUSH 6 /* state entries flushed */ 302 TAILQ_ENTRY(pf_pooladdr) entries; member in struct:pf_pooladdr 464 TAILQ_ENTRY(pf_rule) entries; member in struct:pf_rule
|
H A D | pf.c | 639 * Remove those entries, that don't need flushing. 1842 TAILQ_FOREACH_SAFE(r, &V_pf_unlinked_rules, entries, r1) { 1844 TAILQ_REMOVE(&V_pf_unlinked_rules, r, entries); 1845 TAILQ_INSERT_TAIL(&tmpq, r, entries); 1853 TAILQ_FOREACH_SAFE(r, &tmpq, entries, r1) { 1854 TAILQ_REMOVE(&tmpq, r, entries); 2037 head[i] = TAILQ_NEXT(head[i], entries); \ 2076 cur = TAILQ_NEXT(cur, entries); 2969 *r = TAILQ_NEXT(*r, entries); 3040 *r = TAILQ_NEXT(fr, entries); [all...] |
/freebsd-13-stable/bin/ls/ |
H A D | print.c | 325 if (dp->entries > lastentries) { 327 realloc(array, dp->entries * sizeof(FTSENT *))) == NULL) { 332 lastentries = dp->entries;
|
/freebsd-13-stable/usr.sbin/acpi/acpidump/ |
H A D | acpi.c | 904 u_int i, entries; local 909 entries = (sdp->Length - sizeof(ACPI_TABLE_MCFG)) / 912 for (i = 0; i < entries; i++, alloc++) { 1765 int i, entries; local 1771 entries = (rsdp->Length - sizeof(ACPI_TABLE_HEADER)) / addr_size; 1773 for (i = 0; i < entries; i++) { 2021 int entries, i; local 2026 entries = (rsdp->Length - sizeof(ACPI_TABLE_HEADER)) / addr_size; 2027 for (i = 0; i < entries; i++) { 2263 int entries, local [all...] |
/freebsd-13-stable/include/rpcsvc/ |
H A D | nfs_prot.x | 274 entry *entries; 953 entry3 *entries; 995 entryplus3 *entries;
|
/freebsd-13-stable/sys/dev/etherswitch/arswitch/ |
H A D | arswitch.c | 308 * Flush all ATU entries. 332 * Flush ATU entries for a single port. 344 /* Flush unicast entries on port */ 550 sc->atu.entries = malloc(sizeof(etherswitch_atu_entry_t) * 128, 552 if (sc->atu.entries == NULL) { 723 free(sc->atu.entries, M_DEVBUF); 1239 &sc->atu.entries[nitems], 1); 1241 sc->atu.entries[nitems].id = nitems; 1268 memcpy(e, &sc->atu.entries[id], sizeof(*e));
|
/freebsd-13-stable/sys/dev/amr/ |
H A D | amr_cam.c | 294 csio->ccb_h.sim_priv.entries[0].field= cam_sim_bus(sim); 433 bus = csio->ccb_h.sim_priv.entries[0].field;
|
/freebsd-13-stable/sys/dev/xen/grant_table/ |
H A D | grant_table.c | 42 /* External tools reserve first few grant table entries. */ 72 get_free_entries(int count, int *entries) argument 91 *entries = ref;
|
/freebsd-13-stable/sys/x86/acpica/ |
H A D | acpi_apm.c | 226 STAILQ_INSERT_TAIL(&acpi_sc->apm_cdevs, clone, entries); 247 STAILQ_REMOVE(&acpi_sc->apm_cdevs, clone, apm_clone_data, entries);
|
/freebsd-13-stable/sys/conf/ |
H A D | dtb.build.mk | 61 # entries in the NO_ROOT case.
|
/freebsd-13-stable/stand/lua/ |
H A D | menu.lua | 102 entries = { 153 entries = { 216 entries = function() function 223 -- We'll cache the alternate entries for performance.
|
/freebsd-13-stable/tools/tools/vhba/mptest/ |
H A D | vhba_mptest.c | 117 ccbh->sim_priv.entries[0].ptr = vhbas; 399 mptest_t *vhbas = ccbh->sim_priv.entries[0].ptr;
|