Searched refs:entries (Results 276 - 300 of 402) sorted by relevance

<<11121314151617

/freebsd-11-stable/stand/i386/boot0/
H A Dboot0.S72 * made of four 16-byte entries each containing:
164 .set _MNUOPT, 0x10 # Saved menu entries
279 * within the first TLEN entries, we hit the 'unknown' entry.
282 movb $(TLEN+1),%cl # Number of entries
/freebsd-11-stable/usr.bin/finger/
H A Dutil.c176 ++entries;
/freebsd-11-stable/contrib/ofed/opensm/include/opensm/
H A Dosm_subnet.h218 osm_cct_entry_t entries[OSM_CCT_ENTRY_MAX]; member in struct:osm_cct
225 * entries
229 * Length of entries
713 * Congestion Control Table array of entries
/freebsd-11-stable/sys/cam/ctl/
H A Dctl_ioctl.h300 struct ctl_ooa_entry *entries; /* filled in kernel */ member in struct:ctl_ooa
539 * NEED_MORE_SPACE: The allocated length of the entries field is too
560 * alloc_len: The length of the data buffer allocated for entries.
568 * fill_len: The amount of data filled in the storage for entries.
/freebsd-11-stable/sys/dev/sfxge/
H A Dsfxge.h183 unsigned int entries; member in struct:sfxge_evq
/freebsd-11-stable/sys/x86/x86/
H A Ducode.c218 entry = &table->entries[i];
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dvdev_indirect.c83 * with the same number of entries as the vic_mapping_object. When
84 * the mapping is condensed, entries from the vic_obsolete_sm_object
112 * asynchronously process the obsolete bpobj, moving its entries to
133 * writing out a new mapping that contains only referenced entries.
158 * entries that are not completely obsolete (i.e. which don't have
251 int is_children; /* number of entries in is_child[] */
505 "new mapping object %llu has %llu entries "
506 "(was %llu entries)",
514 * This sync task appends entries to the new mapping object.
942 * physical entries o
959 uint64_t entries = 0; local
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/DebugInfo/DWARF/
H A DDWARFDebugFrame.h293 /// Return whether the section has any entries.
296 /// DWARF Frame entries accessors
299 iterator_range<iterator> entries() const { function in class:llvm::DWARFDebugFrame
/freebsd-11-stable/contrib/llvm-project/lldb/source/Commands/
H A DCommandObjectLog.cpp290 for (const auto &entry : args.entries())
/freebsd-11-stable/share/mk/
H A Ddirdeps.mk45 # All unqualified entries end up being qualified with .${TARGET_SPEC}
47 # entries) are also expanded to a full .<target_spec>.
51 # The fully qualified directory entries are used to construct a
182 # this handles unqualified entries
303 # SKIP_DIRDEPS allows for adding entries on command line.
533 # some entries may be qualified with .<machine>
/freebsd-11-stable/contrib/bmake/mk/
H A Ddirdeps.mk44 # All unqualified entries end up being qualified with .${TARGET_SPEC}
46 # entries) are also expanded to a full .<target_spec>.
50 # The fully qualified directory entries are used to construct a
217 # this handles unqualified entries
354 # SKIP_DIRDEPS allows for adding entries on command line.
601 # some entries may be qualified with .<machine>
/freebsd-11-stable/sys/geom/
H A Dgeom_dev.c604 old_entries = rep->entries;
605 rep->entries = new_entries;
612 rep->entries = old_entries;
/freebsd-11-stable/sys/dev/aacraid/
H A Daacraid_cam.c87 u_int8_t length; /* number of VPD entries */
227 camsc = ccb->ccb_h.sim_priv.entries[0].ptr;
386 ccb->ccb_h.sim_priv.entries[0].ptr = camsc;
634 ccb->ccb_h.sim_priv.entries[0].ptr = camsc;
870 ccb->ccb_h.sim_priv.entries[0].ptr = camsc;
1276 ccb->ccb_h.sim_priv.entries[0].ptr = camsc;
/freebsd-11-stable/contrib/subversion/subversion/libsvn_fs_fs/
H A Dfs_fs.c844 /* L2P pages are in entries - not in (k)Bytes */
1135 "### l2p-page-size is 8192 entries by default." NL
1777 /* Now re-open r0, create proto-index files from our entries and
2152 same time, and the entries added by the first one to write will
2407 apr_array_header_t *entries;
2409 SVN_ERR(svn_fs_fs__rep_contents_dir(&entries, fs, noderev, pool, pool));
2411 if (entries->nelts > 0)
2417 for (i = 0; i < entries->nelts; i++)
2423 dirent = APR_ARRAY_IDX(entries, i, svn_fs_dirent_t *);
2403 apr_array_header_t *entries; local
H A Dtree.c32 appropriate nodes get cloned (and parent directory entries updated)
147 /* the node allocated in the cache's pool. NULL for empty entries. */
151 /* Number of entries in the cache. Keep this low to keep pressure on the
153 a directory tree, we want enough entries to store nodes for all files
158 The actual number of instances may be higher but entries that got
170 /* fixed number of (possibly empty) cache entries */
176 /* number of entries created from POOL since the last cleanup */
530 /* Invalidate cache entries for PATH and any of its children. This
1776 /* different number of entries -> some addition / removal */
1784 entries on
2480 fs_dir_optimal_order(apr_array_header_t **ordered_p, svn_fs_root_t *root, apr_hash_t *entries, apr_pool_t *result_pool, apr_pool_t *scratch_pool) argument
4185 apr_array_header_t *entries; local
4753 apr_array_header_t *entries; local
[all...]
/freebsd-11-stable/contrib/libarchive/libarchive/
H A Darchive_read_support_format_mtree.c108 struct mtree_entry *entries; member in struct:mtree
304 p = mtree->entries;
806 * attributes for each file. For those entries, only the last line
944 mtree->entries = entry;
1057 mtree->this_entry = mtree->entries;
1128 if (mtree->entries == NULL) {
1199 * "Full" entries are allowed to have multiple lines
1201 * don't support multiple lines for "relative" entries
1203 * separate "relative" and "full" entries. (Merging
1204 * "relative" and "full" entries woul
[all...]
/freebsd-11-stable/sbin/pfctl/
H A Dpfctl.c152 { "table-entries", PF_LIMIT_TABLE_ENTRIES },
461 fprintf(stderr, "source tracking entries cleared\n");
832 TAILQ_INSERT_TAIL(&pool->list, pa, entries);
844 TAILQ_REMOVE(&src->list, pa, entries);
845 TAILQ_INSERT_TAIL(&dst->list, pa, entries);
855 TAILQ_REMOVE(&pool->list, pa, entries);
1276 TAILQ_FOREACH(pa, &p->list, entries) {
1329 TAILQ_INSERT_TAIL(rs->rules[rs_num].active.ptr, rule, entries);
1399 TAILQ_REMOVE(rs->rules[rs_num].active.ptr, r, entries);
H A Dparse.y362 TAILQ_ENTRY(loadanchors) entries;
1061 entries);
1404 nti = SIMPLEQ_NEXT(ti, entries);
1480 entries);
1490 entries);
4374 pa, entries);
4736 SIMPLEQ_FOREACH(ti, &opts->init_nodes, entries) {
5388 TAILQ_INSERT_TAIL(&r->rpool.list, pa, entries);
6076 TAILQ_REMOVE(src->rules[i].active.ptr, r, entries);
6077 TAILQ_INSERT_TAIL(dst->rules[i].active.ptr, r, entries);
[all...]
/freebsd-11-stable/sys/dev/mlx4/mlx4_core/
H A Dmlx4_main.c169 MODULE_PARM_DESC(log_mtts_per_seg, "Log2 number of MTT entries per segment (1-7)");
1610 * Reserved MTT entries must be aligned up to a cacheline
1612 * writes to all other MTT entries. (The variable
2838 struct msix_entry *entries; local
2850 entries = kcalloc(nreq, sizeof *entries, GFP_KERNEL);
2851 if (!entries)
2855 entries[i].entry = i;
2857 nreq = pci_enable_msix_range(dev->persist->pdev, entries, 2,
2861 kfree(entries);
[all...]
/freebsd-11-stable/sys/geom/journal/
H A Dg_journal.c115 u_int entries; local
118 entries = g_journal_record_entries;
119 error = sysctl_handle_int(oidp, &entries, 0, req);
122 if (entries < 1 || entries > GJ_RECORD_HEADER_NENTRIES)
124 g_journal_record_entries = entries;
1251 GJ_DEBUG(2, "Storing %d journal entries on %s at %jd.",
/freebsd-11-stable/sys/dev/drm/
H A Dmach64_dma.c50 * Waits for free entries in the FIFO.
54 * register one has to ensure that enough FIFO entries are available by calling
58 * \param entries number of free entries in the FIFO to wait for.
63 int mach64_do_wait_for_fifo(drm_mach64_private_t *dev_priv, int entries) argument
69 if (slots <= (0x8000 >> entries))
74 DRM_INFO("failed! slots=%d entries=%d\n", slots, entries);
101 * Wait for free entries in the ring buffer.
108 * This function should be called before writing new entries t
[all...]
/freebsd-11-stable/contrib/tcsh/
H A Dsh.hist.c113 return; /* no entries on history list */
115 /* Prune dummy entries from the front, then old entries from the back. If
573 double merit = 0.0, entries = 0; local
575 entries += bins[i]*i; /* total hashed objects */
579 (int)(100.0*merit/entries));
606 /* Renumber entries following p, which we will be deleting. */
615 /* The hash table is implemented as an array of pointers to Hist entries. Each
617 * following entries in case of a collision (linear rehash). Free entries i
[all...]
/freebsd-11-stable/contrib/subversion/
H A Dbuild.conf1307 [entries-compat-test]
1311 sources = entries-compat.c utils.c
1378 [entries-dump]
1381 sources = entries-dump.c
1592 entries-dump atomic-ra-revprop-change wc-lock-tester wc-incomplete-tester
1595 conflict-data-test db-test pristine-store-test entries-compat-test
/freebsd-11-stable/contrib/gdb/gdb/
H A Df-valprint.c341 offset table contains entries for both offset and subarray size. */
689 entry = the_common->entries;
/freebsd-11-stable/sys/xen/interface/
H A Dplatform.h341 * indexed by CPU number; only entries with the corresponding @cpumap_bitmap
403 uint32_t dpcnt; /* number of dependency entries */
418 uint32_t count; /* number of C state entries in array below */
588 XEN_GUEST_HANDLE(xenpf_resource_entry_t) entries; member in struct:xenpf_resource_op

Completed in 426 milliseconds

<<11121314151617