Searched refs:entries (Results 126 - 150 of 273) sorted by relevance

1234567891011

/freebsd-9.3-release/sys/dev/ipmi/
H A Dipmi_smbios.c150 smbios_walk_table(uint8_t *p, int entries, smbios_callback_t cb, void *arg) argument
154 while (entries--) {
/freebsd-9.3-release/sys/i386/include/xen/
H A Dhypercall.h149 unsigned long *frame_list, int entries)
151 return _hypercall2(int, set_gdt, frame_list, entries);
148 HYPERVISOR_set_gdt( unsigned long *frame_list, int entries) argument
/freebsd-9.3-release/usr.sbin/lpr/chkprintcap/
H A Dchkprintcap.c153 if (queuecnt != skres->entries) {
154 warnx("WARNING: found %d entries when skimming %s,",
155 skres->entries, pcap_fname);
/freebsd-9.3-release/contrib/ntp/sntp/libevent/
H A Devent-internal.h152 /* An array of evmap_io * or of evmap_signal *; empty entries are
154 void **entries; member in struct:event_signal_map
155 /* The number of entries available in entries */
276 /** The number of entries used in common_timeout_queues */
360 TAILQ_HEAD(event_configq, event_config_entry) entries; member in struct:event_config
/freebsd-9.3-release/sys/dev/mcd/
H A Dmcd.c1253 struct cd_toc_entry entries[MCD_MAXTOCS]; local
1257 if ( te->data_len < sizeof(entries[0])
1258 || (te->data_len % sizeof(entries[0])) != 0
1278 sizeof(entries[0]);
1281 if (len > sizeof(entries))
1292 entries[n].control = sc->data.toc[trk].control;
1293 entries[n].addr_type = sc->data.toc[trk].addr_type;
1294 entries[n].track =
1299 entries[n].addr.msf.unused = 0;
1300 entries[
[all...]
/freebsd-9.3-release/sys/ofed/drivers/infiniband/hw/mthca/
H A Dmthca_main.c115 "maximum number of memory protection table entries per HCA");
130 MODULE_PARM_DESC(log_mtts_per_seg, "Log2 number of MTT entries per segment (1-5)");
931 struct msix_entry entries[3]; local
934 entries[0].entry = 0;
935 entries[1].entry = 1;
936 entries[2].entry = 2;
938 err = pci_enable_msix(mdev->pdev, entries, ARRAY_SIZE(entries));
946 mdev->eq_table.eq[MTHCA_EQ_COMP ].msi_x_vector = entries[0].vector;
947 mdev->eq_table.eq[MTHCA_EQ_ASYNC].msi_x_vector = entries[
[all...]
/freebsd-9.3-release/contrib/bind9/lib/dns/
H A Dacache.c72 * CLEANERINCREMENT is how many entries are examined in one pass.
77 #define DNS_ACACHE_CLEANERINCREMENT 1000 /* Number of entries. */
151 int increment; /* Number of entries to
154 unsigned long ncleaned; /* Number of entries cleaned
194 ISC_LIST(dns_acacheentry_t) entries;
215 /* Data for Management of cache entries */
287 if (ISC_LIST_EMPTY(acache->entries) && acache->dbentries == 0) {
305 * Release the dependency of all entries, and detach them.
307 for (entry = ISC_LIST_HEAD(acache->entries);
320 ISC_LIST_UNLINK(acache->entries, entr
[all...]
H A Dadb.c69 * For type 3 negative cache entries, we will remember that the address is
146 * Bucketized locks and lists for entries.
153 dns_adbentrylist_t *entries; member in struct:dns_adb
251 * persist until that time. This allows entries found
345 * Private flag(s) for entries.
493 * no longer grow beyond 2^28 entries.)
572 * Move entries to new arrays.
575 e = ISC_LIST_HEAD(adb->entries[i]);
577 ISC_LIST_UNLINK(adb->entries[i], e, plink);
584 e = ISC_LIST_HEAD(adb->entries[
[all...]
/freebsd-9.3-release/sys/dev/ata/
H A Data-dma.c263 KASSERT(nsegs <= ATA_DMA_ENTRIES, ("too many DMA segment entries\n"));
268 ata_dmaload(struct ata_request *request, void *addr, int *entries) argument
322 if (entries)
323 *entries = dspa.nsegs;
/freebsd-9.3-release/contrib/bind9/lib/dns/include/dns/
H A Drrl.h107 * This should be small to limit the total size of the table of entries.
164 * A hash table of rate-limit entries.
174 * A block of rate-limit entries.
180 dns_rrl_entry_t entries[1]; member in struct:dns_rrl_block
/freebsd-9.3-release/gnu/usr.bin/cvs/cvs/
H A DMakefile16 commit.c create_adm.c cvsrc.c diff.c edit.c entries.c error.c \
/freebsd-9.3-release/sys/cam/ctl/
H A Dctl.h160 int ctl_port_list(struct ctl_port_entry *entries, int num_entries_alloced,
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/fs/zfs/
H A Dspace_map.c108 if (SM_DEBUG_DECODE(e)) /* Skip debug entries */
218 uint64_t size, entries; local
223 entries = 1;
227 * entries that would be required to write out the range tree.
231 entries += howmany(size, SM_RUN_MAX);
233 return (entries);
/freebsd-9.3-release/sys/gnu/fs/xfs/
H A Dxfs_dir_leaf.h50 * but are not packed. The freemap contains run-length-encoded entries
63 * (ie: there are entries for "." and "..").
99 xfs_dir_leaf_entry_t entries[1]; /* var sized array */ member in struct:xfs_dir_leafblock
/freebsd-9.3-release/sys/netgraph/bluetooth/include/
H A Dng_btsocket.h145 ng_hci_node_neighbor_cache_entry_ep *entries; member in struct:ng_btsocket_hci_raw_node_neighbor_cache
/freebsd-9.3-release/contrib/cvs/src/
H A Dwatch.c234 addremove_filesdoneproc (callerdat, err, repository, update_dir, entries)
239 List *entries;
H A Dimport.c599 List *entries; local
601 /* Reading all the entries for each file is fairly silly, and
604 entries = Entries_Open (0, NULL);
605 node = findnode_fn (entries, vfile);
618 Entries_Close (entries);
666 finfo.entries = NULL;
835 finfo.entries = NULL;
/freebsd-9.3-release/contrib/gcclibs/libcpp/
H A Dfiles.c966 To avoid duplicate entries we follow the convention that all
1002 /* Create a new block of memory for file hash entries. */
1070 /* Compare entries in the nonexistent file hash table. These are just
1492 while the PCH was being built. The 'entries' field is kept sorted
1495 that's OK. The code does rely on having entries with the same size
1517 struct pchf_entry entries[1];
1564 result->entries[count].once_only = f->once_only;
1569 f->st.st_size, result->entries[count].sum);
1581 md5_stream (ff, result->entries[count].sum);
1585 result->entries[coun
1516 struct pchf_entry entries[1]; member in struct:pchf_data
[all...]
/freebsd-9.3-release/contrib/libreadline/
H A Dhistory.c74 entries to remember. */
95 state->entries = the_history;
111 the_history = state->entries;
127 /* Return the number of bytes that the primary history entries are using.
283 /* Copy the rest of the entries, moving down one slot. */
389 /* Replace the DATA in the specified history entries, replacing OLD with
391 all of the history entries where entry->data == OLD; WHICH == -2 means
485 number of history entries. The value is positive if the history
/freebsd-9.3-release/sbin/newfs/
H A Dmkfs.c833 int entries; local
842 entries = (nflag) ? ROOTLINKCNT - 1: ROOTLINKCNT;
854 node.dp1.di_nlink = entries;
855 node.dp1.di_size = makedir(root_dir, entries);
890 node.dp2.di_nlink = entries;
891 node.dp2.di_size = makedir(root_dir, entries);
918 * construct a set of directory entries in "iobuf".
922 makedir(struct direct *protodir, int entries) argument
929 for (cp = iobuf, i = 0; i < entries - 1; i++) {
/freebsd-9.3-release/sys/fs/coda/
H A Dcoda_vfsops.c81 #define MARK_ENTRY(op) (coda_vfsopstats[op].entries++)
93 coda_vfsopstats[i].entries = 0;
/freebsd-9.3-release/sys/ofed/drivers/net/mlx4/
H A Dcq.c163 int entries, struct mlx4_mtt *mtt)
177 cq_context->logsize_usrpage = cpu_to_be32(ilog2(entries) << 24);
162 mlx4_cq_resize(struct mlx4_dev *dev, struct mlx4_cq *cq, int entries, struct mlx4_mtt *mtt) argument
H A Dmlx4.h253 __be64 entries[MLX4_MAX_MAC_NUM]; member in struct:mlx4_mac_table
264 __be32 entries[MLX4_MAX_VLAN_NUM]; member in struct:mlx4_vlan_table
H A Dmain.c125 "log maximum number of memory protection table entries per HCA");
133 MODULE_PARM_DESC(log_mtts_per_seg, "Log2 number of MTT entries per segment (1-7)");
699 * Reserved MTT entries must be aligned up to a cacheline
701 * writes to all other MTT entries. (The variable
1250 struct msix_entry *entries; local
1258 entries = kcalloc(nreq, sizeof *entries, GFP_KERNEL);
1259 if (!entries)
1263 entries[i].entry = i;
1266 err = pci_enable_msix(dev->pdev, entries, nre
[all...]
/freebsd-9.3-release/sys/cddl/contrib/opensolaris/uts/common/fs/
H A Dgfs.c280 * Error if no entries were returned yet
433 * Performs a basic check for "." and ".." directory entries.
519 * entries - NULL-terminated list of static entries (if any)
527 * static entries, defined when the structure is initialized, and dynamic
528 * entries, retrieved through callbacks.
530 * If a directory has static entries, then it must supply a inode callback,
532 * For a directory with dynamic entries, the caller must supply a readdir
540 gfs_dirent_t *entries, gfs_inode_cb inode_cb, int maxlen,
554 if (entries !
539 gfs_dir_create(size_t struct_size, vnode_t *pvp, vfs_t *vfsp, vnodeops_t *ops, gfs_dirent_t *entries, gfs_inode_cb inode_cb, int maxlen, gfs_readdir_cb readdir_cb, gfs_lookup_cb lookup_cb) argument
580 gfs_root_create(size_t size, vfs_t *vfsp, vnodeops_t *ops, ino64_t ino, gfs_dirent_t *entries, gfs_inode_cb inode_cb, int maxlen, gfs_readdir_cb readdir_cb, gfs_lookup_cb lookup_cb) argument
[all...]

Completed in 598 milliseconds

1234567891011